1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in Isabelle2013-1 (November 2013)
5 -------------------------------------
9 * Discontinued obsolete 'uses' within theory header. Note that
10 commands like 'ML_file' work without separate declaration of file
11 dependencies. Minor INCOMPATIBILITY.
13 * Discontinued redundant 'use' command, which was superseded by
14 'ML_file' in Isabelle2013. Minor INCOMPATIBILITY.
16 * Simplified subscripts within identifiers, using plain \<^sub>
17 instead of the second copy \<^isub> and \<^isup>. Superscripts are
18 only for literal tokens within notation; explicit mixfix annotations
19 for consts or fixed variables may be used as fall-back for unusual
20 names. Obsolete \<twosuperior> has been expanded to \<^sup>2 in
21 Isabelle/HOL. INCOMPATIBILITY, use "isabelle update_sub_sup" to
22 standardize symbols as a starting point for further manual cleanup.
23 The ML reference variable "legacy_isub_isup" may be set as temporary
24 workaround, to make the prover accept a subset of the old identifier
27 * Document antiquotations: term style "isub" has been renamed to
28 "sub". Minor INCOMPATIBILITY.
30 * Uniform management of "quick_and_dirty" as system option (see also
31 "isabelle options"), configuration option within the context (see also
32 Config.get in Isabelle/ML), and attribute in Isabelle/Isar. Minor
33 INCOMPATIBILITY, need to use more official Isabelle means to access
34 quick_and_dirty, instead of historical poking into mutable reference.
36 * Renamed command 'print_configs' to 'print_options'. Minor
39 * Proper diagnostic command 'print_state'. Old 'pr' (with its
40 implicit change of some global references) is retained for now as
41 control command, e.g. for ProofGeneral 3.7.x.
43 * Discontinued 'print_drafts' command with its old-fashioned PS output
44 and Unix command-line print spooling. Minor INCOMPATIBILITY: use
45 'display_drafts' instead and print via the regular document viewer.
47 * Updated and extended "isar-ref" and "implementation" manual,
48 eliminated old "ref" manual.
51 *** Prover IDE -- Isabelle/Scala/jEdit ***
53 * New manual "jedit" for Isabelle/jEdit, see isabelle doc or
56 * Dockable window "Documentation" provides access to Isabelle
59 * Dockable window "Find" provides query operations for formal entities
60 (GUI front-end to 'find_theorems' command).
62 * Dockable window "Sledgehammer" manages asynchronous / parallel
63 sledgehammer runs over existing document sources, independently of
64 normal editing and checking process.
66 * Dockable window "Timing" provides an overview of relevant command
69 * Improved dockable window "Theories": Continuous checking of proof
70 document (visible and required parts) may be controlled explicitly,
71 using check box or shortcut "C+e ENTER". Individual theory nodes may
72 be marked explicitly as required and checked in full, using check box
73 or shortcut "C+e SPACE".
75 * Strictly monotonic document update, without premature cancellation of
76 running transactions that are still needed: avoid reset/restart of
77 such command executions while editing.
79 * Improved completion mechanism, which is now managed by the
80 Isabelle/jEdit plugin instead of SideKick. Refined table of Isabelle
81 symbol abbreviations (see $ISABELLE_HOME/etc/symbols).
83 * Support for asynchronous print functions, as overlay to existing
86 * Support for automatic tools in HOL, which try to prove or disprove
87 toplevel theorem statements.
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 * File specifications in jEdit (e.g. file browser) may refer to
94 $ISABELLE_HOME on all platforms. Discontinued obsolete
95 $ISABELLE_HOME_WINDOWS variable.
97 * Improved support for Linux look-and-feel "GTK+", see also "Utilities
98 / Global Options / Appearance".
100 * Improved support of native Mac OS X functionality via "MacOSX"
101 plugin, which is now enabled by default.
106 * Target-sensitive commands 'interpretation' and 'sublocale'.
107 Particularly, 'interpretation' now allows for non-persistent
108 interpretation within "context ... begin ... end" blocks. See
109 "isar-ref" manual for details.
111 * Improved locales diagnostic command 'print_dependencies'.
113 * Discontinued obsolete 'axioms' command, which has been marked as
114 legacy since Isabelle2009-2. INCOMPATIBILITY, use 'axiomatization'
115 instead, while observing its uniform scope for polymorphism.
117 * Discontinued empty name bindings in 'axiomatization'.
120 * System option "proofs" has been discontinued. Instead the global
121 state of Proofterm.proofs is persistently compiled into logic images
122 as required, notably HOL-Proofs. Users no longer need to change
123 Proofterm.proofs dynamically. Minor INCOMPATIBILITY.
125 * Syntax translation functions (print_translation etc.) always depend
126 on Proof.context. Discontinued former "(advanced)" option -- this is
127 now the default. Minor INCOMPATIBILITY.
129 * Former global reference trace_unify_fail is now available as
130 configuration option "unify_trace_failure" (global context only).
132 * SELECT_GOAL now retains the syntactic context of the overall goal
133 state (schematic variables etc.). Potential INCOMPATIBILITY in rare
139 * Improved support for ad hoc overloading of constants (see also
140 isar-ref manual and ~~/src/HOL/ex/Adhoc_Overloading_Examples.thy).
142 * Attibute 'code': 'code' now declares concrete and abstract code
143 equations uniformly. Use explicit 'code equation' and 'code abstract'
144 to distinguish both when desired.
147 - 'code_printing' unifies 'code_const' / 'code_type' / 'code_class' /
149 - 'code_identifier' declares name hints for arbitrary identifiers in
150 generated code, subsuming 'code_modulename'.
152 See the isar-ref manual for syntax diagrams, and the HOL theories for
156 - Various improvements to BNF-based (co)datatype package, including new
157 commands "primrec_new", "primcorec", and "datatype_new_compat",
158 as well as documentation. See "datatypes.pdf" for details.
163 - Renamed many generated theorems, including
165 map_comp' ~> map_comp
173 - parametrized correspondence relations are now supported:
174 + parametricity theorems for the raw term can be specified in
175 the command lift_definition, which allow us to generate stronger
177 + setup_lifting generates stronger transfer rules if parametric
178 correspondence relation can be generated
179 + various new properties of the relator must be specified to support
181 + parametricity theorem for the Quotient relation can be specified
182 - setup_lifting generates domain rules for the Transfer package
183 - stronger reflexivity prover of respectfulness theorems for type
185 - ===> and --> are now local. The symbols can be introduced
186 by interpreting the locale lifting_syntax (typically in an
188 - Lifting/Transfer relevant parts of Library/Quotient_* are now in
189 Main. Potential INCOMPATIBILITY
190 - new commands for restoring and deleting Lifting/Transfer context:
191 lifting_forget, lifting_update
192 - the command print_quotmaps was renamed to print_quot_maps.
196 - better support for domains in Transfer: replace Domainp T
197 by the actual invariant in a transferred goal
198 - transfer rules can have as assumptions other transfer rules
199 - Experimental support for transferring from the raw level to the
200 abstract level: Transfer.transferred attribute
201 - Attribute version of the transfer method: untransferred attribute
204 * Function package: For mutually recursive functions f and g, separate
205 cases rules f.cases and g.cases are generated instead of unusable
206 f_g.cases which exposed internal sum types. Potential INCOMPATIBILITY,
207 in the case that the unusable rule was used nevertheless.
209 * Function package: For each function f, new rules f.elims are
210 automatically generated, which eliminate equalities of the form "f x =
213 * New command 'fun_cases' derives ad-hoc elimination rules for
214 function equations as simplified instances of f.elims, analogous to
215 inductive_cases. See ~~/src/HOL/ex/Fundefs.thy for some examples.
217 * Library/Polynomial.thy:
218 - Use lifting for primitive definitions.
219 - Explicit conversions from and to lists of coefficients, used for
221 - Replaced recursion operator poly_rec by fold_coeffs.
222 - Prefer pre-existing gcd operation for gcd.
224 poly_eq_iff ~> poly_eq_poly_eq_iff
226 expand_poly_eq ~> poly_eq_iff
229 * New Library/FSet.thy: type of finite sets defined as a subtype of
230 sets defined by Lifting/Transfer
232 * Reification and reflection:
233 - Reification is now directly available in HOL-Main in structure
235 - Reflection now handles multiple lists with variables also.
236 - The whole reflection stack has been decomposed into conversions.
239 * Stronger precedence of syntax for big intersection and union on
240 sets, in accordance with corresponding lattice operations.
243 * Nested case expressions are now translated in a separate check phase
244 rather than during parsing. The data for case combinators is separated
245 from the datatype package. The declaration attribute
246 "case_translation" can be used to register new case combinators:
248 declare [[case_translation case_combinator constructor1 ... constructorN]]
250 * New Library/Simps_Case_Conv.thy: Provides commands simps_of_case and
251 case_of_simps to convert function definitions between a list of
252 equations with patterns on the lhs and a single equation with case
253 expressions on the rhs. See also Ex/Simps_Case_Conv_Examples.thy.
255 * Notation "{p:A. P}" now allows tuple patterns as well.
257 * Revised devices for recursive definitions over finite sets:
258 - Only one fundamental fold combinator on finite set remains:
259 Finite_Set.fold :: ('a => 'b => 'b) => 'b => 'a set => 'b
260 This is now identity on infinite sets.
261 - Locales ("mini packages") for fundamental definitions with
262 Finite_Set.fold: folding, folding_idem.
263 - Locales comm_monoid_set, semilattice_order_set and
264 semilattice_neutr_order_set for big operators on sets.
265 See theory Big_Operators for canonical examples.
266 Note that foundational constants comm_monoid_set.F and
267 semilattice_set.F correspond to former combinators fold_image
268 and fold1 respectively. These are now gone. You may use
269 those foundational constants as substitutes, but it is
270 preferable to interpret the above locales accordingly.
271 - Dropped class ab_semigroup_idem_mult (special case of lattice,
272 no longer needed in connection with Finite_Set.fold etc.)
274 card.union_inter ~> card_Un_Int [symmetric]
275 card.union_disjoint ~> card_Un_disjoint
278 * Locale hierarchy for abstract orderings and (semi)lattices.
280 * Discontinued theory src/HOL/Library/Eval_Witness. INCOMPATIBILITY.
282 * Numeric types mapped by default to target language numerals: natural
283 (replaces former code_numeral) and integer (replaces former code_int).
284 Conversions are available as integer_of_natural / natural_of_integer /
285 integer_of_nat / nat_of_integer (in HOL) and
286 Code_Numeral.integer_of_natural / Code_Numeral.natural_of_integer (in
287 ML). INCOMPATIBILITY.
289 * Discontinued theories Code_Integer and Efficient_Nat by a more
290 fine-grain stack of theories Code_Target_Int, Code_Binary_Nat,
291 Code_Target_Nat and Code_Target_Numeral. See the tutorial on code
292 generation for details. INCOMPATIBILITY.
294 * Complete_Partial_Order.admissible is defined outside the type class
295 ccpo, but with mandatory prefix ccpo. Admissibility theorems lose the
296 class predicate assumption or sort constraint when possible.
299 * Introduce type class "conditionally_complete_lattice": Like a
300 complete lattice but does not assume the existence of the top and
301 bottom elements. Allows to generalize some lemmas about reals and
302 extended reals. Removed SupInf and replaced it by the instantiation
303 of conditionally_complete_lattice for real. Renamed lemmas about
304 conditionally-complete lattice from Sup_... to cSup_... and from
305 Inf_... to cInf_... to avoid hidding of similar complete lattice
308 * Introduce type class linear_continuum as combination of
309 conditionally-complete lattices and inner dense linorders which have
310 more than one element. INCOMPATIBILITY.
312 * Introduced type classes order_top and order_bot. The old classes top
313 and bot only contain the syntax without assumptions. INCOMPATIBILITY:
314 Rename bot -> order_bot, top -> order_top
316 * Introduce type classes "no_top" and "no_bot" for orderings without
317 top and bottom elements.
319 * Split dense_linorder into inner_dense_order and no_top, no_bot.
321 * Complex_Main: Unify and move various concepts from
322 HOL-Multivariate_Analysis to HOL-Complex_Main.
324 - Introduce type class (lin)order_topology and
325 linear_continuum_topology. Allows to generalize theorems about
326 limits and order. Instances are reals and extended reals.
328 - continuous and continuos_on from Multivariate_Analysis:
329 "continuous" is the continuity of a function at a filter. "isCont"
330 is now an abbrevitation: "isCont x f == continuous (at _) f".
332 Generalized continuity lemmas from isCont to continuous on an
335 - compact from Multivariate_Analysis. Use Bolzano's lemma to prove
336 compactness of closed intervals on reals. Continuous functions
337 attain infimum and supremum on compact sets. The inverse of a
338 continuous function is continuous, when the function is continuous
341 - connected from Multivariate_Analysis. Use it to prove the
342 intermediate value theorem. Show connectedness of intervals on
343 linear_continuum_topology).
345 - first_countable_topology from Multivariate_Analysis. Is used to
346 show equivalence of properties on the neighbourhood filter of x and
347 on all sequences converging to x.
349 - FDERIV: Definition of has_derivative moved to Deriv.thy. Moved
350 theorems from Library/FDERIV.thy to Deriv.thy and base the
351 definition of DERIV on FDERIV. Add variants of DERIV and FDERIV
352 which are restricted to sets, i.e. to represent derivatives from
355 - Removed the within-filter. It is replaced by the principal filter:
357 F within X = inf F (principal X)
359 - Introduce "at x within U" as a single constant, "at x" is now an
360 abbreviation for "at x within UNIV"
362 - Introduce named theorem collections tendsto_intros,
363 continuous_intros, continuous_on_intros and FDERIV_intros. Theorems
364 in tendsto_intros (or FDERIV_intros) are also available as
365 tendsto_eq_intros (or FDERIV_eq_intros) where the right-hand side
366 is replaced by a congruence rule. This allows to apply them as
367 intro rules and then proving equivalence by the simplifier.
369 - Restructured theories in HOL-Complex_Main:
371 + Moved RealDef and RComplete into Real
373 + Introduced Topological_Spaces and moved theorems about
374 topological spaces, filters, limits and continuity to it
376 + Renamed RealVector to Real_Vector_Spaces
378 + Split Lim, SEQ, Series into Topological_Spaces,
379 Real_Vector_Spaces, and Limits
381 + Moved Ln and Log to Transcendental
383 + Moved theorems about continuity from Deriv to Topological_Spaces
385 - Remove various auxiliary lemmas.
389 * Consolidation of library theories on product orders:
391 Product_Lattice ~> Product_Order -- pointwise order on products
392 Product_ord ~> Product_Lexorder -- lexicographic order on products
398 - Reduce incidence of "too high arity" errors
402 isar_shrink ~> isar_compress
404 - Added options "isar_try0", "spy"
405 - Better support for "isar_proofs"
406 - MaSh has been fined-tuned and now runs as a local server
408 * Imperative-HOL: The MREC combinator is considered legacy and no
409 longer included by default. INCOMPATIBILITY, use partial_function
410 instead, or import theory Legacy_Mrec as a fallback.
412 * HOL-Algebra: Discontinued theories ~~/src/HOL/Algebra/abstract and
413 ~~/src/HOL/Algebra/poly. Existing theories should be based on
414 ~~/src/HOL/Library/Polynomial instead. The latter provides
415 integration with HOL's type classes for rings. INCOMPATIBILITY.
420 * Spec_Check is a Quickcheck tool for Isabelle/ML. The ML function
421 "check_property" allows to check specifications of the form "ALL x y
422 z. prop x y z". See also ~~/src/Tools/Spec_Check/ with its
423 Examples.thy in particular.
425 * Improved printing of exception trace in Poly/ML 5.5.1, with regular
426 tracing output in the command transaction context instead of physical
427 stdout. See also Toplevel.debug, Toplevel.debugging and
428 ML_Compiler.exn_trace.
430 * ML type "theory" is now immutable, without any special treatment of
431 drafts or linear updates (which could lead to "stale theory" errors in
432 the past). Discontinued obsolete operations like Theory.copy,
433 Theory.checkpoint, and the auxiliary type theory_ref. Minor
436 * More uniform naming of goal functions for skipped proofs:
438 Skip_Proof.prove ~> Goal.prove_sorry
439 Skip_Proof.prove_global ~> Goal.prove_sorry_global
441 Minor INCOMPATIBILITY.
443 * Simplifier tactics and tools use proper Proof.context instead of
444 historic type simpset. Old-style declarations like addsimps,
445 addsimprocs etc. operate directly on Proof.context. Raw type simpset
446 retains its use as snapshot of the main Simplifier context, using
447 simpset_of and put_simpset on Proof.context. INCOMPATIBILITY -- port
448 old tools by making them depend on (ctxt : Proof.context) instead of
449 (ss : simpset), then turn (simpset_of ctxt) into ctxt.
451 * Modifiers for classical wrappers (e.g. addWrapper, delWrapper)
452 operate on Proof.context instead of claset, for uniformity with addIs,
453 addEs, addDs etc. Note that claset_of and put_claset allow to manage
454 clasets separately from the context.
456 * Discontinued obsolete ML antiquotations @{claset} and @{simpset}.
457 INCOMPATIBILITY, use @{context} instead.
459 * Antiquotation @{theory_context A} is similar to @{theory A}, but
460 presents the result as initial Proof.context.
465 * Discontinued obsolete isabelle usedir, mkdir, make -- superseded by
466 "isabelle build" in Isabelle2013. INCOMPATIBILITY.
468 * Discontinued obsolete isabelle-process options -f and -u (former
469 administrative aliases of option -e). Minor INCOMPATIBILITY.
471 * Discontinued obsolete isabelle print tool, and PRINT_COMMAND
474 * Discontinued ISABELLE_DOC_FORMAT settings variable and historic
475 document formats: dvi.gz, ps, ps.gz -- the default document format is
478 * Isabelle settings variable ISABELLE_BUILD_JAVA_OPTIONS allows to
479 specify global resources of the JVM process run by isabelle build.
481 * Toplevel executable $ISABELLE_HOME/bin/isabelle_scala_script allows
482 to run Isabelle/Scala source files as standalone programs.
484 * Improved "isabelle keywords" tool (for old-style ProofGeneral
485 keyword tables): use Isabelle/Scala operations, which inspect outer
486 syntax without requiring to build sessions first.
488 * Sessions may be organized via 'chapter' specifications in the ROOT
489 file, which determines a two-level hierarchy of browser info. The old
490 tree-like organization via implicit sub-session relation (with its
491 tendency towards erratic fluctuation of URLs) has been discontinued.
492 The default chapter is called "Unsorted". Potential INCOMPATIBILITY
493 for HTML presentation of theories.
497 New in Isabelle2013 (February 2013)
498 -----------------------------------
502 * Theorem status about oracles and unfinished/failed future proofs is
503 no longer printed by default, since it is incompatible with
504 incremental / parallel checking of the persistent document model. ML
505 function Thm.peek_status may be used to inspect a snapshot of the
506 ongoing evaluation process. Note that in batch mode --- notably
507 isabelle build --- the system ensures that future proofs of all
508 accessible theorems in the theory context are finished (as before).
510 * Configuration option show_markup controls direct inlining of markup
511 into the printed representation of formal entities --- notably type
512 and sort constraints. This enables Prover IDE users to retrieve that
513 information via tooltips in the output window, for example.
515 * Command 'ML_file' evaluates ML text from a file directly within the
516 theory, without any predeclaration via 'uses' in the theory header.
518 * Old command 'use' command and corresponding keyword 'uses' in the
519 theory header are legacy features and will be discontinued soon.
520 Tools that load their additional source files may imitate the
521 'ML_file' implementation, such that the system can take care of
522 dependencies properly.
524 * Discontinued obsolete method fastsimp / tactic fast_simp_tac, which
525 is called fastforce / fast_force_tac already since Isabelle2011-1.
527 * Updated and extended "isar-ref" and "implementation" manual, reduced
528 remaining material in old "ref" manual.
530 * Improved support for auxiliary contexts that indicate block structure
531 for specifications. Nesting of "context fixes ... context assumes ..."
532 and "class ... context ...".
534 * Attribute "consumes" allows a negative value as well, which is
535 interpreted relatively to the total number of premises of the rule in
536 the target context. This form of declaration is stable when exported
537 from a nested 'context' with additional assumptions. It is the
538 preferred form for definitional packages, notably cases/rules produced
539 in HOL/inductive and HOL/function.
541 * More informative error messages for Isar proof commands involving
542 lazy enumerations (method applications etc.).
544 * Refined 'help' command to retrieve outer syntax commands according
545 to name patterns (with clickable results).
548 *** Prover IDE -- Isabelle/Scala/jEdit ***
550 * Parallel terminal proofs ('by') are enabled by default, likewise
551 proofs that are built into packages like 'datatype', 'function'. This
552 allows to "run ahead" checking the theory specifications on the
553 surface, while the prover is still crunching on internal
554 justifications. Unfinished / cancelled proofs are restarted as
555 required to complete full proof checking eventually.
557 * Improved output panel with tooltips, hyperlinks etc. based on the
558 same Rich_Text_Area as regular Isabelle/jEdit buffers. Activation of
559 tooltips leads to some window that supports the same recursively,
560 which can lead to stacks of tooltips as the semantic document content
561 is explored. ESCAPE closes the whole stack, individual windows may be
562 closed separately, or detached to become independent jEdit dockables.
564 * Improved support for commands that produce graph output: the text
565 message contains a clickable area to open a new instance of the graph
568 * More robust incremental parsing of outer syntax (partial comments,
569 malformed symbols). Changing the balance of open/close quotes and
570 comment delimiters works more conveniently with unfinished situations
571 that frequently occur in user interaction.
573 * More efficient painting and improved reactivity when editing large
574 files. More scalable management of formal document content.
576 * Smarter handling of tracing messages: prover process pauses after
577 certain number of messages per command transaction, with some user
578 dialog to stop or continue. This avoids swamping the front-end with
579 potentially infinite message streams.
581 * More plugin options and preferences, based on Isabelle/Scala. The
582 jEdit plugin option panel provides access to some Isabelle/Scala
583 options, including tuning parameters for editor reactivity and color
586 * Dockable window "Symbols" provides some editing support for Isabelle
589 * Dockable window "Monitor" shows ML runtime statistics. Note that
590 continuous display of the chart slows down the system.
592 * Improved editing support for control styles: subscript, superscript,
593 bold, reset of style -- operating on single symbols or text
594 selections. Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT.
596 * Actions isabelle.increase-font-size and isabelle.decrease-font-size
597 adjust the main text area font size, and its derivatives for output,
598 tooltips etc. Cf. keyboard shortcuts C-PLUS and C-MINUS, which often
599 need to be adapted to local keyboard layouts.
601 * More reactive completion popup by default: use \t (TAB) instead of
602 \n (NEWLINE) to minimize intrusion into regular flow of editing. See
603 also "Plugin Options / SideKick / General / Code Completion Options".
605 * Implicit check and build dialog of the specified logic session
606 image. For example, HOL, HOLCF, HOL-Nominal can be produced on
607 demand, without bundling big platform-dependent heap images in the
608 Isabelle distribution.
610 * Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates
611 from Oracle provide better multi-platform experience. This version is
612 now bundled exclusively with Isabelle.
617 * Code generation for Haskell: restrict unqualified imports from
618 Haskell Prelude to a small set of fundamental operations.
620 * Command 'export_code': relative file names are interpreted
621 relatively to master directory of current theory rather than the
622 rather arbitrary current working directory. INCOMPATIBILITY.
624 * Discontinued obsolete attribute "COMP". Potential INCOMPATIBILITY,
625 use regular rule composition via "OF" / "THEN", or explicit proof
626 structure instead. Note that Isabelle/ML provides a variety of
627 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied
628 with some care where this is really required.
630 * Command 'typ' supports an additional variant with explicit sort
631 constraint, to infer and check the most general type conforming to a
632 given sort. Example (in HOL):
634 typ "_ * _ * bool * unit" :: finite
636 * Command 'locale_deps' visualizes all locales and their relations as
644 - Added MaSh relevance filter based on machine-learning; see the
645 Sledgehammer manual for details.
646 - Polished Isar proofs generated with "isar_proofs" option.
647 - Rationalized type encodings ("type_enc" option).
648 - Renamed "kill_provers" subcommand to "kill_all".
650 isar_proof ~> isar_proofs
651 isar_shrink_factor ~> isar_shrink
652 max_relevant ~> max_facts
653 relevance_thresholds ~> fact_thresholds
655 * Quickcheck: added an optimisation for equality premises. It is
656 switched on by default, and can be switched off by setting the
657 configuration quickcheck_optimise_equality to false.
659 * Quotient: only one quotient can be defined by quotient_type
663 - generation of an abstraction function equation in lift_definition
665 - renamed no_abs_code -> no_code (INCOMPATIBILITY.)
667 * Simproc "finite_Collect" rewrites set comprehensions into pointfree
670 * Preprocessing of the code generator rewrites set comprehensions into
671 pointfree expressions.
673 * The SMT solver Z3 has now by default a restricted set of directly
674 supported features. For the full set of features (div/mod, nonlinear
675 arithmetic, datatypes/records) with potential proof reconstruction
676 failures, enable the configuration option "z3_with_extensions". Minor
679 * Simplified 'typedef' specifications: historical options for implicit
680 set definition and alternative name have been discontinued. The
681 former behavior of "typedef (open) t = A" is now the default, but
682 written just "typedef t = A". INCOMPATIBILITY, need to adapt theories
685 * Removed constant "chars"; prefer "Enum.enum" on type "char"
686 directly. INCOMPATIBILITY.
688 * Moved operation product, sublists and n_lists from theory Enum to
689 List. INCOMPATIBILITY.
691 * Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY.
693 * Class "comm_monoid_diff" formalises properties of bounded
694 subtraction, with natural numbers and multisets as typical instances.
696 * Added combinator "Option.these" with type "'a option set => 'a set".
698 * Theory "Transitive_Closure": renamed lemmas
700 reflcl_tranclp -> reflclp_tranclp
701 rtranclp_reflcl -> rtranclp_reflclp
705 * Theory "Rings": renamed lemmas (in class semiring)
707 left_distrib ~> distrib_right
708 right_distrib ~> distrib_left
712 * Generalized the definition of limits:
714 - Introduced the predicate filterlim (LIM x F. f x :> G) which
715 expresses that when the input values x converge to F then the
716 output f x converges to G.
718 - Added filters for convergence to positive (at_top) and negative
721 - Moved infinity in the norm (at_infinity) from
722 Multivariate_Analysis to Complex_Main.
724 - Removed real_tendsto_inf, it is superseded by "LIM x F. f x :>
729 * Theory "Library/Option_ord" provides instantiation of option type to
730 lattice type classes.
732 * Theory "Library/Multiset": renamed
734 constant fold_mset ~> Multiset.fold
735 fact fold_mset_commute ~> fold_mset_comm
739 * Renamed theory Library/List_Prefix to Library/Sublist, with related
742 - Renamed constants (and related lemmas)
745 strict_prefix ~> prefix
747 - Replaced constant "postfix" by "suffixeq" with swapped argument
748 order (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped
749 old infix syntax "xs >>= ys"; use "suffixeq ys xs" instead.
750 Renamed lemmas accordingly.
752 - Added constant "list_hembeq" for homeomorphic embedding on
753 lists. Added abbreviation "sublisteq" for special case
754 "list_hembeq (op =)".
756 - Theory Library/Sublist no longer provides "order" and "bot" type
757 class instances for the prefix order (merely corresponding locale
758 interpretations). The type class instances are now in theory
759 Library/Prefix_Order.
761 - The sublist relation of theory Library/Sublist_Order is now based
762 on "Sublist.sublisteq". Renamed lemmas accordingly:
764 le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff
765 le_list_append_mono ~> Sublist.list_hembeq_append_mono
766 le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2
767 le_list_Cons_EX ~> Sublist.list_hembeq_ConsD
768 le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2'
769 le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq
770 le_list_drop_Cons ~> Sublist.sublisteq_Cons'
771 le_list_drop_many ~> Sublist.sublisteq_drop_many
772 le_list_filter_left ~> Sublist.sublisteq_filter_left
773 le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many
774 le_list_rev_take_iff ~> Sublist.sublisteq_append
775 le_list_same_length ~> Sublist.sublisteq_same_length
776 le_list_take_many_iff ~> Sublist.sublisteq_append'
777 less_eq_list.drop ~> less_eq_list_drop
778 less_eq_list.induct ~> less_eq_list_induct
779 not_le_list_length ~> Sublist.not_sublisteq_length
783 * New theory Library/Countable_Set.
785 * Theory Library/Debug and Library/Parallel provide debugging and
786 parallel execution for code generated towards Isabelle/ML.
788 * Theory Library/FuncSet: Extended support for Pi and extensional and
789 introduce the extensional dependent function space "PiE". Replaced
790 extensional_funcset by an abbreviation, and renamed lemmas from
791 extensional_funcset to PiE as follows:
793 extensional_empty ~> PiE_empty
794 extensional_funcset_empty_domain ~> PiE_empty_domain
795 extensional_funcset_empty_range ~> PiE_empty_range
796 extensional_funcset_arb ~> PiE_arb
797 extensional_funcset_mem ~> PiE_mem
798 extensional_funcset_extend_domainI ~> PiE_fun_upd
799 extensional_funcset_restrict_domain ~> fun_upd_in_PiE
800 extensional_funcset_extend_domain_eq ~> PiE_insert_eq
801 card_extensional_funcset ~> card_PiE
802 finite_extensional_funcset ~> finite_PiE
806 * Theory Library/FinFun: theory of almost everywhere constant
807 functions (supersedes the AFP entry "Code Generation for Functions as
810 * Theory Library/Phantom: generic phantom type to make a type
811 parameter appear in a constant's type. This alternative to adding
812 TYPE('a) as another parameter avoids unnecessary closures in generated
815 * Theory Library/RBT_Impl: efficient construction of red-black trees
816 from sorted associative lists. Merging two trees with rbt_union may
817 return a structurally different tree than before. Potential
820 * Theory Library/IArray: immutable arrays with code generation.
822 * Theory Library/Finite_Lattice: theory of finite lattices.
824 * HOL/Multivariate_Analysis: replaced
826 "basis :: 'a::euclidean_space => nat => real"
827 "\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space"
829 on euclidean spaces by using the inner product "_ \<bullet> _" with
830 vectors from the Basis set: "\<Chi>\<Chi> i. f i" is superseded by
831 "SUM i : Basis. f i * r i".
833 With this change the following constants are also changed or removed:
835 DIM('a) :: nat ~> card (Basis :: 'a set) (is an abbreviation)
836 a $$ i ~> inner a i (where i : Basis)
838 \<pi>, \<pi>' removed
840 Theorems about these constants where removed.
844 component_le_norm ~> Basis_le_norm
845 euclidean_eq ~> euclidean_eq_iff
846 differential_zero_maxmin_component ~> differential_zero_maxmin_cart
847 euclidean_simps ~> inner_simps
848 independent_basis ~> independent_Basis
849 span_basis ~> span_Basis
850 in_span_basis ~> in_span_Basis
851 norm_bound_component_le ~> norm_boound_Basis_le
852 norm_bound_component_lt ~> norm_boound_Basis_lt
853 component_le_infnorm ~> Basis_le_infnorm
859 - Added simproc "measurable" to automatically prove measurability.
861 - Added induction rules for sigma sets with disjoint union
862 (sigma_sets_induct_disjoint) and for Borel-measurable functions
863 (borel_measurable_induct).
865 - Added the Daniell-Kolmogorov theorem (the existence the limit of a
868 * HOL/Cardinals: Theories of ordinals and cardinals (supersedes the
869 AFP entry "Ordinals_and_Cardinals").
871 * HOL/BNF: New (co)datatype package based on bounded natural functors
872 with support for mixed, nested recursion and interesting non-free
875 * HOL/Finite_Set and Relation: added new set and relation operations
876 expressed by Finite_Set.fold.
878 * New theory HOL/Library/RBT_Set: implementation of sets by red-black
879 trees for the code generator.
881 * HOL/Library/RBT and HOL/Library/Mapping have been converted to
883 possible INCOMPATIBILITY.
885 * HOL/Set: renamed Set.project -> Set.filter
889 *** Document preparation ***
891 * Dropped legacy antiquotations "term_style" and "thm_style", since
892 styles may be given as arguments to "term" and "thm" already.
893 Discontinued legacy styles "prem1" .. "prem19".
895 * Default LaTeX rendering for \<euro> is now based on eurosym package,
896 instead of slightly exotic babel/greek.
898 * Document variant NAME may use different LaTeX entry point
899 document/root_NAME.tex if that file exists, instead of the common
902 * Simplified custom document/build script, instead of old-style
903 document/IsaMakefile. Minor INCOMPATIBILITY.
908 * The default limit for maximum number of worker threads is now 8,
909 instead of 4, in correspondence to capabilities of contemporary
910 hardware and Poly/ML runtime system.
912 * Type Seq.results and related operations support embedded error
913 messages within lazy enumerations, and thus allow to provide
914 informative errors in the absence of any usable results.
916 * Renamed Position.str_of to Position.here to emphasize that this is a
917 formal device to inline positions into message text, but not
918 necessarily printing visible text.
923 * Advanced support for Isabelle sessions and build management, see
924 "system" manual for the chapter of that name, especially the "isabelle
925 build" tool and its examples. The "isabelle mkroot" tool prepares
926 session root directories for use with "isabelle build", similar to
927 former "isabelle mkdir" for "isabelle usedir". Note that this affects
928 document preparation as well. INCOMPATIBILITY, isabelle usedir /
929 mkdir / make are rendered obsolete.
931 * Discontinued obsolete Isabelle/build script, it is superseded by the
932 regular isabelle build tool. For example:
934 isabelle build -s -b HOL
936 * Discontinued obsolete "isabelle makeall".
938 * Discontinued obsolete IsaMakefile and ROOT.ML files from the
939 Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that
940 provides some traditional targets that invoke "isabelle build". Note
941 that this is inefficient! Applications of Isabelle/HOL involving
942 "isabelle make" should be upgraded to use "isabelle build" directly.
944 * The "isabelle options" tool prints Isabelle system options, as
945 required for "isabelle build", for example.
947 * The "isabelle logo" tool produces EPS and PDF format simultaneously.
948 Minor INCOMPATIBILITY in command-line options.
950 * The "isabelle install" tool has now a simpler command-line. Minor
953 * The "isabelle components" tool helps to resolve add-on components
954 that are not bundled, or referenced from a bare-bones repository
957 * Settings variable ISABELLE_PLATFORM_FAMILY refers to the general
958 platform family: "linux", "macos", "windows".
960 * The ML system is configured as regular component, and no longer
961 picked up from some surrounding directory. Potential INCOMPATIBILITY
962 for home-made settings.
964 * Improved ML runtime statistics (heap, threads, future tasks etc.).
966 * Discontinued support for Poly/ML 5.2.1, which was the last version
967 without exception positions and advanced ML compiler/toplevel
970 * Discontinued special treatment of Proof General -- no longer guess
971 PROOFGENERAL_HOME based on accidental file-system layout. Minor
972 INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS
973 settings manually, or use a Proof General version that has been
974 bundled as Isabelle component.
978 New in Isabelle2012 (May 2012)
979 ------------------------------
983 * Prover IDE (PIDE) improvements:
985 - more robust Sledgehammer integration (as before the sledgehammer
986 command-line needs to be typed into the source buffer)
987 - markup for bound variables
988 - markup for types of term variables (displayed as tooltips)
989 - support for user-defined Isar commands within the running session
990 - improved support for Unicode outside original 16bit range
991 e.g. glyph for \<A> (thanks to jEdit 4.5.1)
993 * Forward declaration of outer syntax keywords within the theory
994 header -- minor INCOMPATIBILITY for user-defined commands. Allow new
995 commands to be used in the same theory where defined.
997 * Auxiliary contexts indicate block structure for specifications with
998 additional parameters and assumptions. Such unnamed contexts may be
999 nested within other targets, like 'theory', 'locale', 'class',
1000 'instantiation' etc. Results from the local context are generalized
1001 accordingly and applied to the enclosing target context. Example:
1005 assumes xy: "x = y" and yz: "y = z"
1008 lemma my_trans: "x = z" using xy yz by simp
1014 The most basic application is to factor-out context elements of
1015 several fixes/assumes/shows theorem statements, e.g. see
1016 ~~/src/HOL/Isar_Examples/Group_Context.thy
1018 Any other local theory specification element works within the "context
1019 ... begin ... end" block as well.
1021 * Bundled declarations associate attributed fact expressions with a
1022 given name in the context. These may be later included in other
1023 contexts. This allows to manage context extensions casually, without
1024 the logical dependencies of locales and locale interpretation. See
1025 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.
1027 * Commands 'lemmas' and 'theorems' allow local variables using 'for'
1028 declaration, and results are standardized before being stored. Thus
1029 old-style "standard" after instantiation or composition of facts
1030 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of
1031 indices of schematic variables.
1033 * Rule attributes in local theory declarations (e.g. locale or class)
1034 are now statically evaluated: the resulting theorem is stored instead
1035 of the original expression. INCOMPATIBILITY in rare situations, where
1036 the historic accident of dynamic re-evaluation in interpretations
1039 * New tutorial "Programming and Proving in Isabelle/HOL"
1040 ("prog-prove"). It completely supersedes "A Tutorial Introduction to
1041 Structured Isar Proofs" ("isar-overview"), which has been removed. It
1042 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order
1043 Logic" as the recommended beginners tutorial, but does not cover all
1044 of the material of that old tutorial.
1046 * Updated and extended reference manuals: "isar-ref",
1047 "implementation", "system"; reduced remaining material in old "ref"
1053 * Command 'definition' no longer exports the foundational "raw_def"
1054 into the user context. Minor INCOMPATIBILITY, may use the regular
1055 "def" result with attribute "abs_def" to imitate the old version.
1057 * Attribute "abs_def" turns an equation of the form "f x y == t" into
1058 "f == %x y. t", which ensures that "simp" or "unfold" steps always
1059 expand it. This also works for object-logic equality. (Formerly
1060 undocumented feature.)
1062 * Sort constraints are now propagated in simultaneous statements, just
1063 like type constraints. INCOMPATIBILITY in rare situations, where
1064 distinct sorts used to be assigned accidentally. For example:
1066 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"
1068 lemma "P (x::'a)" and "Q (y::'a::bar)"
1069 -- "now uniform 'a::bar instead of default sort for first occurrence (!)"
1071 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more
1072 tolerant against multiple unifiers, as long as the final result is
1073 unique. (As before, rules are composed in canonical right-to-left
1074 order to accommodate newly introduced premises.)
1076 * Renamed some inner syntax categories:
1082 Minor INCOMPATIBILITY. Note that in practice "num_const" or
1083 "num_position" etc. are mainly used instead (which also include
1084 position information via constraints).
1086 * Simplified configuration options for syntax ambiguity: see
1087 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
1088 manual. Minor INCOMPATIBILITY.
1090 * Discontinued configuration option "syntax_positions": atomic terms
1091 in parse trees are always annotated by position constraints.
1093 * Old code generator for SML and its commands 'code_module',
1094 'code_library', 'consts_code', 'types_code' have been discontinued.
1095 Use commands of the generic code generator instead. INCOMPATIBILITY.
1097 * Redundant attribute "code_inline" has been discontinued. Use
1098 "code_unfold" instead. INCOMPATIBILITY.
1100 * Dropped attribute "code_unfold_post" in favor of the its dual
1101 "code_abbrev", which yields a common pattern in definitions like
1103 definition [code_abbrev]: "f = t"
1107 * Obsolete 'types' command has been discontinued. Use 'type_synonym'
1108 instead. INCOMPATIBILITY.
1110 * Discontinued old "prems" fact, which used to refer to the accidental
1111 collection of foundational premises in the context (already marked as
1112 legacy since Isabelle2011).
1117 * Type 'a set is now a proper type constructor (just as before
1118 Isabelle2008). Definitions mem_def and Collect_def have disappeared.
1119 Non-trivial INCOMPATIBILITY. For developments keeping predicates and
1120 sets separate, it is often sufficient to rephrase some set S that has
1121 been accidentally used as predicates by "%x. x : S", and some
1122 predicate P that has been accidentally used as set by "{x. P x}".
1123 Corresponding proofs in a first step should be pruned from any
1124 tinkering with former theorems mem_def and Collect_def as far as
1127 For developments which deliberately mix predicates and sets, a
1128 planning step is necessary to determine what should become a predicate
1129 and what a set. It can be helpful to carry out that step in
1130 Isabelle2011-1 before jumping right into the current release.
1132 * Code generation by default implements sets as container type rather
1133 than predicates. INCOMPATIBILITY.
1135 * New type synonym 'a rel = ('a * 'a) set
1137 * The representation of numerals has changed. Datatype "num"
1138 represents strictly positive binary numerals, along with functions
1139 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent
1140 positive and negated numeric literals, respectively. See also
1141 definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some
1142 user theories may require adaptations as follows:
1144 - Theorems with number_ring or number_semiring constraints: These
1145 classes are gone; use comm_ring_1 or comm_semiring_1 instead.
1147 - Theories defining numeric types: Remove number, number_semiring,
1148 and number_ring instances. Defer all theorems about numerals until
1149 after classes one and semigroup_add have been instantiated.
1151 - Numeral-only simp rules: Replace each rule having a "number_of v"
1152 pattern with two copies, one for numeral and one for neg_numeral.
1154 - Theorems about subclasses of semiring_1 or ring_1: These classes
1155 automatically support numerals now, so more simp rules and
1156 simprocs may now apply within the proof.
1158 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:
1159 Redefine using other integer operations.
1161 * Transfer: New package intended to generalize the existing
1162 "descending" method and related theorem attributes from the Quotient
1163 package. (Not all functionality is implemented yet, but future
1164 development will focus on Transfer as an eventual replacement for the
1165 corresponding parts of the Quotient package.)
1167 - transfer_rule attribute: Maintains a collection of transfer rules,
1168 which relate constants at two different types. Transfer rules may
1169 relate different type instances of the same polymorphic constant,
1170 or they may relate an operation on a raw type to a corresponding
1171 operation on an abstract type (quotient or subtype). For example:
1173 ((A ===> B) ===> list_all2 A ===> list_all2 B) map map
1174 (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int
1176 - transfer method: Replaces a subgoal on abstract types with an
1177 equivalent subgoal on the corresponding raw types. Constants are
1178 replaced with corresponding ones according to the transfer rules.
1179 Goals are generalized over all free variables by default; this is
1180 necessary for variables whose types change, but can be overridden
1181 for specific variables with e.g. "transfer fixing: x y z". The
1182 variant transfer' method allows replacing a subgoal with one that
1183 is logically stronger (rather than equivalent).
1185 - relator_eq attribute: Collects identity laws for relators of
1186 various type constructors, e.g. "list_all2 (op =) = (op =)". The
1187 transfer method uses these lemmas to infer transfer rules for
1188 non-polymorphic constants on the fly.
1190 - transfer_prover method: Assists with proving a transfer rule for a
1191 new constant, provided the constant is defined in terms of other
1192 constants that already have transfer rules. It should be applied
1193 after unfolding the constant definitions.
1195 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer
1196 from type nat to type int.
1198 * Lifting: New package intended to generalize the quotient_definition
1199 facility of the Quotient package; designed to work with Transfer.
1201 - lift_definition command: Defines operations on an abstract type in
1202 terms of a corresponding operation on a representation
1203 type. Example syntax:
1205 lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"
1208 Users must discharge a respectfulness proof obligation when each
1209 constant is defined. (For a type copy, i.e. a typedef with UNIV,
1210 the proof is discharged automatically.) The obligation is
1211 presented in a user-friendly, readable form; a respectfulness
1212 theorem in the standard format and a transfer rule are generated
1215 - Integration with code_abstype: For typedefs (e.g. subtypes
1216 corresponding to a datatype invariant, such as dlist),
1217 lift_definition generates a code certificate theorem and sets up
1218 code generation for each constant.
1220 - setup_lifting command: Sets up the Lifting package to work with a
1221 user-defined type. The user must provide either a quotient theorem
1222 or a type_definition theorem. The package configures transfer
1223 rules for equality and quantifiers on the type, and sets up the
1224 lift_definition command to work with the type.
1226 - Usage examples: See Quotient_Examples/Lift_DList.thy,
1227 Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,
1228 Word/Word.thy and Library/Float.thy.
1232 - The 'quotient_type' command now supports a 'morphisms' option with
1233 rep and abs functions, similar to typedef.
1235 - 'quotient_type' sets up new types to work with the Lifting and
1236 Transfer packages, as with 'setup_lifting'.
1238 - The 'quotient_definition' command now requires the user to prove a
1239 respectfulness property at the point where the constant is
1240 defined, similar to lift_definition; INCOMPATIBILITY.
1242 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems
1243 accordingly, INCOMPATIBILITY.
1245 * New diagnostic command 'find_unused_assms' to find potentially
1246 superfluous assumptions in theorems using Quickcheck.
1250 - Quickcheck returns variable assignments as counterexamples, which
1251 allows to reveal the underspecification of functions under test.
1252 For example, refuting "hd xs = x", it presents the variable
1253 assignment xs = [] and x = a1 as a counterexample, assuming that
1254 any property is false whenever "hd []" occurs in it.
1256 These counterexample are marked as potentially spurious, as
1257 Quickcheck also returns "xs = []" as a counterexample to the
1258 obvious theorem "hd xs = hd xs".
1260 After finding a potentially spurious counterexample, Quickcheck
1261 continues searching for genuine ones.
1263 By default, Quickcheck shows potentially spurious and genuine
1264 counterexamples. The option "genuine_only" sets quickcheck to only
1265 show genuine counterexamples.
1267 - The command 'quickcheck_generator' creates random and exhaustive
1268 value generators for a given type and operations.
1270 It generates values by using the operations as if they were
1271 constructors of that type.
1273 - Support for multisets.
1275 - Added "use_subtype" options.
1277 - Added "quickcheck_locale" configuration to specify how to process
1278 conjectures in a locale context.
1280 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option
1281 and affecting 'rat' and 'real'.
1284 - Integrated more tightly with SPASS, as described in the ITP 2012
1285 paper "More SPASS with Isabelle".
1286 - Made it try "smt" as a fallback if "metis" fails or times out.
1287 - Added support for the following provers: Alt-Ergo (via Why3 and
1288 TFF1), iProver, iProver-Eq.
1289 - Sped up the minimizer.
1290 - Added "lam_trans", "uncurry_aliases", and "minimize" options.
1291 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
1292 - Renamed "sound" option to "strict".
1294 * Metis: Added possibility to specify lambda translations scheme as a
1295 parenthesized argument (e.g., "by (metis (lifting) ...)").
1297 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".
1299 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.
1301 * New "case_product" attribute to generate a case rule doing multiple
1302 case distinctions at the same time. E.g.
1304 list.exhaust [case_product nat.exhaust]
1306 produces a rule which can be used to perform case distinction on both
1309 * New "eventually_elim" method as a generalized variant of the
1310 eventually_elim* rules. Supports structured proofs.
1312 * Typedef with implicit set definition is considered legacy. Use
1313 "typedef (open)" form instead, which will eventually become the
1316 * Record: code generation can be switched off manually with
1318 declare [[record_coden = false]] -- "default true"
1320 * Datatype: type parameters allow explicit sort constraints.
1322 * Concrete syntax for case expressions includes constraints for source
1323 positions, and thus produces Prover IDE markup for its bindings.
1324 INCOMPATIBILITY for old-style syntax translations that augment the
1325 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
1328 * Clarified attribute "mono_set": pure declaration without modifying
1329 the result of the fact expression.
1331 * More default pred/set conversions on a couple of relation operations
1332 and predicates. Added powers of predicate relations. Consolidation
1333 of some relation theorems:
1335 converse_def ~> converse_unfold
1336 rel_comp_def ~> relcomp_unfold
1337 symp_def ~> (modified, use symp_def and sym_def instead)
1338 transp_def ~> transp_trans
1339 Domain_def ~> Domain_unfold
1340 Range_def ~> Domain_converse [symmetric]
1342 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.
1344 See theory "Relation" for examples for making use of pred/set
1345 conversions by means of attributes "to_set" and "to_pred".
1349 * Renamed facts about the power operation on relations, i.e., relpow
1350 to match the constant's name:
1352 rel_pow_1 ~> relpow_1
1353 rel_pow_0_I ~> relpow_0_I
1354 rel_pow_Suc_I ~> relpow_Suc_I
1355 rel_pow_Suc_I2 ~> relpow_Suc_I2
1356 rel_pow_0_E ~> relpow_0_E
1357 rel_pow_Suc_E ~> relpow_Suc_E
1358 rel_pow_E ~> relpow_E
1359 rel_pow_Suc_D2 ~> relpow_Suc_D2
1360 rel_pow_Suc_E2 ~> relpow_Suc_E2
1361 rel_pow_Suc_D2' ~> relpow_Suc_D2'
1362 rel_pow_E2 ~> relpow_E2
1363 rel_pow_add ~> relpow_add
1364 rel_pow_commute ~> relpow
1365 rel_pow_empty ~> relpow_empty:
1366 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
1367 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
1368 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
1369 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
1370 rel_pow_fun_conv ~> relpow_fun_conv
1371 rel_pow_finite_bounded1 ~> relpow_finite_bounded1
1372 rel_pow_finite_bounded ~> relpow_finite_bounded
1373 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
1374 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
1375 single_valued_rel_pow ~> single_valued_relpow
1379 * Theory Relation: Consolidated constant name for relation composition
1380 and corresponding theorem names:
1382 - Renamed constant rel_comp to relcomp.
1384 - Dropped abbreviation pred_comp. Use relcompp instead.
1388 rel_compI ~> relcompI
1389 rel_compEpair ~> relcompEpair
1390 rel_compE ~> relcompE
1391 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq
1392 rel_comp_empty1 ~> relcomp_empty1
1393 rel_comp_mono ~> relcomp_mono
1394 rel_comp_subset_Sigma ~> relcomp_subset_Sigma
1395 rel_comp_distrib ~> relcomp_distrib
1396 rel_comp_distrib2 ~> relcomp_distrib2
1397 rel_comp_UNION_distrib ~> relcomp_UNION_distrib
1398 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2
1399 single_valued_rel_comp ~> single_valued_relcomp
1400 rel_comp_def ~> relcomp_unfold
1401 converse_rel_comp ~> converse_relcomp
1402 pred_compI ~> relcomppI
1403 pred_compE ~> relcomppE
1404 pred_comp_bot1 ~> relcompp_bot1
1405 pred_comp_bot2 ~> relcompp_bot2
1406 transp_pred_comp_less_eq ~> transp_relcompp_less_eq
1407 pred_comp_mono ~> relcompp_mono
1408 pred_comp_distrib ~> relcompp_distrib
1409 pred_comp_distrib2 ~> relcompp_distrib2
1410 converse_pred_comp ~> converse_relcompp
1412 finite_rel_comp ~> finite_relcomp
1414 set_rel_comp ~> set_relcomp
1418 * Theory Divides: Discontinued redundant theorems about div and mod.
1419 INCOMPATIBILITY, use the corresponding generic theorems instead.
1421 DIVISION_BY_ZERO ~> div_by_0, mod_by_0
1422 zdiv_self ~> div_self
1423 zmod_self ~> mod_self
1426 zdiv_zmod_equality ~> div_mod_equality2
1427 zdiv_zmod_equality2 ~> div_mod_equality
1428 zmod_zdiv_trivial ~> mod_div_trivial
1429 zdiv_zminus_zminus ~> div_minus_minus
1430 zmod_zminus_zminus ~> mod_minus_minus
1431 zdiv_zminus2 ~> div_minus_right
1432 zmod_zminus2 ~> mod_minus_right
1433 zdiv_minus1_right ~> div_minus1_right
1434 zmod_minus1_right ~> mod_minus1_right
1435 zdvd_mult_div_cancel ~> dvd_mult_div_cancel
1436 zmod_zmult1_eq ~> mod_mult_right_eq
1437 zpower_zmod ~> power_mod
1438 zdvd_zmod ~> dvd_mod
1439 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd
1440 mod_mult_distrib ~> mult_mod_left
1441 mod_mult_distrib2 ~> mult_mod_right
1443 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use
1444 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.
1446 * Finite_Set.fold now qualified. INCOMPATIBILITY.
1448 * Consolidated theorem names concerning fold combinators:
1450 inf_INFI_fold_inf ~> inf_INF_fold_inf
1451 sup_SUPR_fold_sup ~> sup_SUP_fold_sup
1452 INFI_fold_inf ~> INF_fold_inf
1453 SUPR_fold_sup ~> SUP_fold_sup
1454 union_set ~> union_set_fold
1455 minus_set ~> minus_set_fold
1456 INFI_set_fold ~> INF_set_fold
1457 SUPR_set_fold ~> SUP_set_fold
1458 INF_code ~> INF_set_foldr
1459 SUP_code ~> SUP_set_foldr
1460 foldr.simps ~> foldr.simps (in point-free formulation)
1461 foldr_fold_rev ~> foldr_conv_fold
1462 foldl_fold ~> foldl_conv_fold
1463 foldr_foldr ~> foldr_conv_foldl
1464 foldl_foldr ~> foldl_conv_foldr
1465 fold_set_remdups ~> fold_set_fold_remdups
1466 fold_set ~> fold_set_fold
1467 fold1_set ~> fold1_set_fold
1471 * Dropped rarely useful theorems concerning fold combinators:
1472 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
1473 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
1474 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
1475 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
1476 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,
1477 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.
1478 INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0"
1479 and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be
1480 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by
1481 unfolding "foldr_conv_fold" and "foldl_conv_fold".
1483 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,
1484 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,
1485 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,
1486 INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding
1487 lemmas over fold rather than foldr, or make use of lemmas
1488 fold_conv_foldr and fold_rev.
1490 * Congruence rules Option.map_cong and Option.bind_cong for recursion
1491 through option types.
1493 * "Transitive_Closure.ntrancl": bounded transitive closure on
1496 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.
1498 * Theory Int: Discontinued many legacy theorems specific to type int.
1499 INCOMPATIBILITY, use the corresponding generic theorems instead.
1501 zminus_zminus ~> minus_minus
1502 zminus_0 ~> minus_zero
1503 zminus_zadd_distrib ~> minus_add_distrib
1504 zadd_commute ~> add_commute
1505 zadd_assoc ~> add_assoc
1506 zadd_left_commute ~> add_left_commute
1509 zadd_0 ~> add_0_left
1510 zadd_0_right ~> add_0_right
1511 zadd_zminus_inverse2 ~> left_minus
1512 zmult_zminus ~> mult_minus_left
1513 zmult_commute ~> mult_commute
1514 zmult_assoc ~> mult_assoc
1515 zadd_zmult_distrib ~> left_distrib
1516 zadd_zmult_distrib2 ~> right_distrib
1517 zdiff_zmult_distrib ~> left_diff_distrib
1518 zdiff_zmult_distrib2 ~> right_diff_distrib
1519 zmult_1 ~> mult_1_left
1520 zmult_1_right ~> mult_1_right
1521 zle_refl ~> order_refl
1522 zle_trans ~> order_trans
1523 zle_antisym ~> order_antisym
1524 zle_linear ~> linorder_linear
1525 zless_linear ~> linorder_less_linear
1526 zadd_left_mono ~> add_left_mono
1527 zadd_strict_right_mono ~> add_strict_right_mono
1528 zadd_zless_mono ~> add_less_le_mono
1529 int_0_less_1 ~> zero_less_one
1530 int_0_neq_1 ~> zero_neq_one
1532 zpower_zadd_distrib ~> power_add
1533 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
1534 zero_le_zpower_abs ~> zero_le_power_abs
1536 * Theory Deriv: Renamed
1538 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
1540 * Theory Library/Multiset: Improved code generation of multisets.
1542 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets
1543 are expressed via type classes again. The special syntax
1544 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant
1545 setsum_set, which is now subsumed by Big_Operators.setsum.
1548 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
1549 use theory HOL/Library/Nat_Bijection instead.
1551 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black
1552 trees is now inside a type class context. Names of affected
1553 operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for
1554 theories working directly with raw red-black trees, adapt the names as
1558 bulkload -> rbt_bulkload
1559 del_from_left -> rbt_del_from_left
1560 del_from_right -> rbt_del_from_right
1562 delete -> rbt_delete
1564 insert -> rbt_insert
1565 insertw -> rbt_insert_with
1566 insert_with_key -> rbt_insert_with_key
1567 map_entry -> rbt_map_entry
1568 lookup -> rbt_lookup
1569 sorted -> rbt_sorted
1570 tree_greater -> rbt_greater
1571 tree_less -> rbt_less
1572 tree_less_symbol -> rbt_less_symbol
1574 union_with -> rbt_union_with
1575 union_with_key -> rbt_union_with_key
1578 balance_left_sorted -> balance_left_rbt_sorted
1579 balance_left_tree_greater -> balance_left_rbt_greater
1580 balance_left_tree_less -> balance_left_rbt_less
1581 balance_right_sorted -> balance_right_rbt_sorted
1582 balance_right_tree_greater -> balance_right_rbt_greater
1583 balance_right_tree_less -> balance_right_rbt_less
1584 balance_sorted -> balance_rbt_sorted
1585 balance_tree_greater -> balance_rbt_greater
1586 balance_tree_less -> balance_rbt_less
1587 bulkload_is_rbt -> rbt_bulkload_is_rbt
1588 combine_sorted -> combine_rbt_sorted
1589 combine_tree_greater -> combine_rbt_greater
1590 combine_tree_less -> combine_rbt_less
1591 delete_in_tree -> rbt_delete_in_tree
1592 delete_is_rbt -> rbt_delete_is_rbt
1593 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater
1594 del_from_left_tree_less -> rbt_del_from_left_rbt_less
1595 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater
1596 del_from_right_tree_less -> rbt_del_from_right_rbt_less
1597 del_in_tree -> rbt_del_in_tree
1598 del_inv1_inv2 -> rbt_del_inv1_inv2
1599 del_sorted -> rbt_del_rbt_sorted
1600 del_tree_greater -> rbt_del_rbt_greater
1601 del_tree_less -> rbt_del_rbt_less
1602 dom_lookup_Branch -> dom_rbt_lookup_Branch
1603 entries_lookup -> entries_rbt_lookup
1604 finite_dom_lookup -> finite_dom_rbt_lookup
1605 insert_sorted -> rbt_insert_rbt_sorted
1606 insertw_is_rbt -> rbt_insertw_is_rbt
1607 insertwk_is_rbt -> rbt_insertwk_is_rbt
1608 insertwk_sorted -> rbt_insertwk_rbt_sorted
1609 insertw_sorted -> rbt_insertw_rbt_sorted
1610 ins_sorted -> ins_rbt_sorted
1611 ins_tree_greater -> ins_rbt_greater
1612 ins_tree_less -> ins_rbt_less
1613 is_rbt_sorted -> is_rbt_rbt_sorted
1614 lookup_balance -> rbt_lookup_balance
1615 lookup_bulkload -> rbt_lookup_rbt_bulkload
1616 lookup_delete -> rbt_lookup_rbt_delete
1617 lookup_Empty -> rbt_lookup_Empty
1618 lookup_from_in_tree -> rbt_lookup_from_in_tree
1619 lookup_in_tree -> rbt_lookup_in_tree
1620 lookup_ins -> rbt_lookup_ins
1621 lookup_insert -> rbt_lookup_rbt_insert
1622 lookup_insertw -> rbt_lookup_rbt_insertw
1623 lookup_insertwk -> rbt_lookup_rbt_insertwk
1624 lookup_keys -> rbt_lookup_keys
1625 lookup_map -> rbt_lookup_map
1626 lookup_map_entry -> rbt_lookup_rbt_map_entry
1627 lookup_tree_greater -> rbt_lookup_rbt_greater
1628 lookup_tree_less -> rbt_lookup_rbt_less
1629 lookup_union -> rbt_lookup_rbt_union
1630 map_entry_color_of -> rbt_map_entry_color_of
1631 map_entry_inv1 -> rbt_map_entry_inv1
1632 map_entry_inv2 -> rbt_map_entry_inv2
1633 map_entry_is_rbt -> rbt_map_entry_is_rbt
1634 map_entry_sorted -> rbt_map_entry_rbt_sorted
1635 map_entry_tree_greater -> rbt_map_entry_rbt_greater
1636 map_entry_tree_less -> rbt_map_entry_rbt_less
1637 map_tree_greater -> map_rbt_greater
1638 map_tree_less -> map_rbt_less
1639 map_sorted -> map_rbt_sorted
1640 paint_sorted -> paint_rbt_sorted
1641 paint_lookup -> paint_rbt_lookup
1642 paint_tree_greater -> paint_rbt_greater
1643 paint_tree_less -> paint_rbt_less
1644 sorted_entries -> rbt_sorted_entries
1645 tree_greater_eq_trans -> rbt_greater_eq_trans
1646 tree_greater_nit -> rbt_greater_nit
1647 tree_greater_prop -> rbt_greater_prop
1648 tree_greater_simps -> rbt_greater_simps
1649 tree_greater_trans -> rbt_greater_trans
1650 tree_less_eq_trans -> rbt_less_eq_trans
1651 tree_less_nit -> rbt_less_nit
1652 tree_less_prop -> rbt_less_prop
1653 tree_less_simps -> rbt_less_simps
1654 tree_less_trans -> rbt_less_trans
1655 tree_ord_props -> rbt_ord_props
1656 union_Branch -> rbt_union_Branch
1657 union_is_rbt -> rbt_union_is_rbt
1658 unionw_is_rbt -> rbt_unionw_is_rbt
1659 unionwk_is_rbt -> rbt_unionwk_is_rbt
1660 unionwk_sorted -> rbt_unionwk_rbt_sorted
1662 * Theory HOL/Library/Float: Floating point numbers are now defined as
1663 a subset of the real numbers. All operations are defined using the
1664 lifing-framework and proofs use the transfer method. INCOMPATIBILITY.
1671 round_down -> float_round_down
1672 round_up -> float_round_up
1676 ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod
1679 abs_float_def -> Float.compute_float_abs
1680 bitlen_ge0 -> bitlen_nonneg
1681 bitlen.simps -> Float.compute_bitlen
1682 float_components -> Float_mantissa_exponent
1683 float_divl.simps -> Float.compute_float_divl
1684 float_divr.simps -> Float.compute_float_divr
1685 float_eq_odd -> mult_powr_eq_mult_powr_iff
1686 float_power -> real_of_float_power
1687 lapprox_posrat_def -> Float.compute_lapprox_posrat
1688 lapprox_rat.simps -> Float.compute_lapprox_rat
1689 le_float_def' -> Float.compute_float_le
1690 le_float_def -> less_eq_float.rep_eq
1691 less_float_def' -> Float.compute_float_less
1692 less_float_def -> less_float.rep_eq
1693 normfloat_def -> Float.compute_normfloat
1694 normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0
1695 normfloat -> normfloat_def
1696 normfloat_unique -> use normfloat_def
1697 number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral
1698 one_float_def -> Float.compute_float_one
1699 plus_float_def -> Float.compute_float_plus
1700 rapprox_posrat_def -> Float.compute_rapprox_posrat
1701 rapprox_rat.simps -> Float.compute_rapprox_rat
1702 real_of_float_0 -> zero_float.rep_eq
1703 real_of_float_1 -> one_float.rep_eq
1704 real_of_float_abs -> abs_float.rep_eq
1705 real_of_float_add -> plus_float.rep_eq
1706 real_of_float_minus -> uminus_float.rep_eq
1707 real_of_float_mult -> times_float.rep_eq
1708 real_of_float_simp -> Float.rep_eq
1709 real_of_float_sub -> minus_float.rep_eq
1710 round_down.simps -> Float.compute_float_round_down
1711 round_up.simps -> Float.compute_float_round_up
1712 times_float_def -> Float.compute_float_times
1713 uminus_float_def -> Float.compute_float_uminus
1714 zero_float_def -> Float.compute_float_zero
1716 Lemmas not necessary anymore, use the transfer method:
1717 bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,
1718 float_divr, float_le_simp, float_less1_mantissa_bound,
1719 float_less_simp, float_less_zero, float_le_zero,
1720 float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,
1721 floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,
1722 lapprox_rat_bottom, normalized_float, rapprox_posrat,
1723 rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,
1724 real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,
1725 round_up, zero_le_float, zero_less_float
1727 * New theory HOL/Library/DAList provides an abstract type for
1728 association lists with distinct keys.
1730 * Session HOL/IMP: Added new theory of abstract interpretation of
1733 * Session HOL-Import: Re-implementation from scratch is faster,
1734 simpler, and more scalable. Requires a proof bundle, which is
1735 available as an external component. Discontinued old (and mostly
1736 dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY.
1738 * Session HOL-Word: Discontinued many redundant theorems specific to
1739 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
1742 word_sub_alt ~> word_sub_wi
1743 word_add_alt ~> word_add_def
1744 word_mult_alt ~> word_mult_def
1745 word_minus_alt ~> word_minus_def
1746 word_0_alt ~> word_0_wi
1747 word_1_alt ~> word_1_wi
1748 word_add_0 ~> add_0_left
1749 word_add_0_right ~> add_0_right
1750 word_mult_1 ~> mult_1_left
1751 word_mult_1_right ~> mult_1_right
1752 word_add_commute ~> add_commute
1753 word_add_assoc ~> add_assoc
1754 word_add_left_commute ~> add_left_commute
1755 word_mult_commute ~> mult_commute
1756 word_mult_assoc ~> mult_assoc
1757 word_mult_left_commute ~> mult_left_commute
1758 word_left_distrib ~> left_distrib
1759 word_right_distrib ~> right_distrib
1760 word_left_minus ~> left_minus
1761 word_diff_0_right ~> diff_0_right
1762 word_diff_self ~> diff_self
1763 word_sub_def ~> diff_minus
1764 word_diff_minus ~> diff_minus
1765 word_add_ac ~> add_ac
1766 word_mult_ac ~> mult_ac
1767 word_plus_ac0 ~> add_0_left add_0_right add_ac
1768 word_times_ac1 ~> mult_1_left mult_1_right mult_ac
1769 word_order_trans ~> order_trans
1770 word_order_refl ~> order_refl
1771 word_order_antisym ~> order_antisym
1772 word_order_linear ~> linorder_linear
1773 lenw1_zero_neq_one ~> zero_neq_one
1774 word_number_of_eq ~> number_of_eq
1775 word_of_int_add_hom ~> wi_hom_add
1776 word_of_int_sub_hom ~> wi_hom_sub
1777 word_of_int_mult_hom ~> wi_hom_mult
1778 word_of_int_minus_hom ~> wi_hom_neg
1779 word_of_int_succ_hom ~> wi_hom_succ
1780 word_of_int_pred_hom ~> wi_hom_pred
1781 word_of_int_0_hom ~> word_0_wi
1782 word_of_int_1_hom ~> word_1_wi
1784 * Session HOL-Word: New proof method "word_bitwise" for splitting
1785 machine word equalities and inequalities into logical circuits,
1786 defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction,
1787 multiplication, shifting by constants, bitwise operators and numeric
1788 constants. Requires fixed-length word types, not 'a word. Solves
1789 many standard word identities outright and converts more into first
1790 order problems amenable to blast or similar. See also examples in
1791 HOL/Word/Examples/WordExamples.thy.
1793 * Session HOL-Probability: Introduced the type "'a measure" to
1794 represent measures, this replaces the records 'a algebra and 'a
1795 measure_space. The locales based on subset_class now have two
1796 locale-parameters the space \<Omega> and the set of measurable sets M.
1797 The product of probability spaces uses now the same constant as the
1798 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)
1799 measure". Most constants are defined now outside of locales and gain
1800 an additional parameter, like null_sets, almost_eventually or \<mu>'.
1801 Measure space constructions for distributions and densities now got
1802 their own constants distr and density. Instead of using locales to
1803 describe measure spaces with a finite space, the measure count_space
1804 and point_measure is introduced. INCOMPATIBILITY.
1808 finite_measure.\<mu>' -> measure
1809 product_algebra_generator -> prod_algebra
1810 product_prob_space.emb -> prod_emb
1811 product_prob_space.infprod_algebra -> PiM
1814 completeable_measure_space
1815 finite_measure_space
1817 finite_product_finite_prob_space
1818 finite_product_sigma_algebra
1819 finite_sigma_algebra
1821 pair_finite_prob_space
1822 pair_finite_sigma_algebra
1825 product_sigma_algebra
1829 distribution -> use distr measure, or distributed predicate
1831 joint_distribution -> use distr measure, or distributed predicate
1832 pair_measure_generator
1833 product_prob_space.infprod_algebra -> use PiM
1836 Replacement theorems:
1837 finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite
1838 finite_measure.empty_measure -> measure_empty
1839 finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq
1840 finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq
1841 finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably
1842 finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure
1843 finite_measure.finite_measure -> finite_measure.emeasure_finite
1844 finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton
1845 finite_measure.positive_measure' -> measure_nonneg
1846 finite_measure.real_measure -> finite_measure.emeasure_real
1847 finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb
1848 finite_product_sigma_algebra.in_P -> sets_PiM_I_finite
1849 finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty
1850 information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed
1851 information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple
1852 information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple
1853 information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple
1854 information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple
1855 information_space.entropy_commute -> information_space.entropy_commute_simple
1856 information_space.entropy_eq -> information_space.entropy_simple_distributed
1857 information_space.entropy_generic_eq -> information_space.entropy_simple_distributed
1858 information_space.entropy_positive -> information_space.entropy_nonneg_simple
1859 information_space.entropy_uniform_max -> information_space.entropy_uniform
1860 information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq
1861 information_space.KL_eq_0 -> information_space.KL_same_eq_0
1862 information_space.KL_ge_0 -> information_space.KL_nonneg
1863 information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed
1864 information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple
1865 Int_stable_cuboids -> Int_stable_atLeastAtMost
1866 Int_stable_product_algebra_generator -> positive_integral
1867 measure_preserving -> equality "distr M N f = N" "f : measurable M N"
1868 measure_space.additive -> emeasure_additive
1869 measure_space.AE_iff_null_set -> AE_iff_null
1870 measure_space.almost_everywhere_def -> eventually_ae_filter
1871 measure_space.almost_everywhere_vimage -> AE_distrD
1872 measure_space.continuity_from_above -> INF_emeasure_decseq
1873 measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq
1874 measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq
1875 measure_space.continuity_from_below -> SUP_emeasure_incseq
1876 measure_space_density -> emeasure_density
1877 measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density
1878 measure_space.integrable_vimage -> integrable_distr
1879 measure_space.integral_translated_density -> integral_density
1880 measure_space.integral_vimage -> integral_distr
1881 measure_space.measure_additive -> plus_emeasure
1882 measure_space.measure_compl -> emeasure_compl
1883 measure_space.measure_countable_increasing -> emeasure_countable_increasing
1884 measure_space.measure_countably_subadditive -> emeasure_subadditive_countably
1885 measure_space.measure_decseq -> decseq_emeasure
1886 measure_space.measure_Diff -> emeasure_Diff
1887 measure_space.measure_Diff_null_set -> emeasure_Diff_null_set
1888 measure_space.measure_eq_0 -> emeasure_eq_0
1889 measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite
1890 measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton
1891 measure_space.measure_incseq -> incseq_emeasure
1892 measure_space.measure_insert -> emeasure_insert
1893 measure_space.measure_mono -> emeasure_mono
1894 measure_space.measure_not_negative -> emeasure_not_MInf
1895 measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq
1896 measure_space.measure_setsum -> setsum_emeasure
1897 measure_space.measure_setsum_split -> setsum_emeasure_cover
1898 measure_space.measure_space_vimage -> emeasure_distr
1899 measure_space.measure_subadditive_finite -> emeasure_subadditive_finite
1900 measure_space.measure_subadditive -> subadditive
1901 measure_space.measure_top -> emeasure_space
1902 measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0
1903 measure_space.measure_Un_null_set -> emeasure_Un_null_set
1904 measure_space.positive_integral_translated_density -> positive_integral_density
1905 measure_space.positive_integral_vimage -> positive_integral_distr
1906 measure_space.real_continuity_from_above -> Lim_measure_decseq
1907 measure_space.real_continuity_from_below -> Lim_measure_incseq
1908 measure_space.real_measure_countably_subadditive -> measure_subadditive_countably
1909 measure_space.real_measure_Diff -> measure_Diff
1910 measure_space.real_measure_finite_Union -> measure_finite_Union
1911 measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton
1912 measure_space.real_measure_subadditive -> measure_subadditive
1913 measure_space.real_measure_Union -> measure_Union
1914 measure_space.real_measure_UNION -> measure_UNION
1915 measure_space.simple_function_vimage -> simple_function_comp
1916 measure_space.simple_integral_vimage -> simple_integral_distr
1917 measure_space.simple_integral_vimage -> simple_integral_distr
1918 measure_unique_Int_stable -> measure_eqI_generator_eq
1919 measure_unique_Int_stable_vimage -> measure_eqI_generator_eq
1920 pair_sigma_algebra.measurable_cut_fst -> sets_Pair1
1921 pair_sigma_algebra.measurable_cut_snd -> sets_Pair2
1922 pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1
1923 pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2
1924 pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff
1925 pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap
1926 pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'
1927 pair_sigma_algebra.sets_swap -> sets_pair_swap
1928 pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1
1929 pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2
1930 pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap
1931 pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2
1932 pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt
1933 pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times
1934 prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM
1935 prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq
1936 prob_space.measure_space_1 -> prob_space.emeasure_space_1
1937 prob_space.prob_space_vimage -> prob_space_distr
1938 prob_space.random_variable_restrict -> measurable_restrict
1939 prob_space_unique_Int_stable -> measure_eqI_prob_space
1940 product_algebraE -> prod_algebraE_all
1941 product_algebra_generator_der -> prod_algebra_eq_finite
1942 product_algebra_generator_into_space -> prod_algebra_sets_into_space
1943 product_algebraI -> sets_PiM_I_finite
1944 product_measure_exists -> product_sigma_finite.sigma_finite
1945 product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator
1946 product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb
1947 product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty
1948 product_prob_space.measurable_component -> measurable_component_singleton
1949 product_prob_space.measurable_emb -> measurable_prod_emb
1950 product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single
1951 product_prob_space.measurable_singleton_infprod -> measurable_component_singleton
1952 product_prob_space.measure_emb -> emeasure_prod_emb
1953 product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict
1954 product_sigma_algebra.product_algebra_into_space -> space_closed
1955 product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge
1956 product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton
1957 product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge
1958 sequence_space.measure_infprod -> sequence_space.measure_PiM_countable
1959 sets_product_algebra -> sets_PiM
1960 sigma_algebra.measurable_sigma -> measurable_measure_of
1961 sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint
1962 sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr
1963 sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq
1964 space_product_algebra -> space_PiM
1966 * Session HOL-TPTP: support to parse and import TPTP problems (all
1967 languages) into Isabelle/HOL.
1972 * New "case_product" attribute (see HOL).
1977 * Greater support for structured proofs involving induction or case
1980 * Much greater use of mathematical symbols.
1982 * Removal of many ML theorem bindings. INCOMPATIBILITY.
1987 * Antiquotation @{keyword "name"} produces a parser for outer syntax
1988 from a minor keyword introduced via theory header declaration.
1990 * Antiquotation @{command_spec "name"} produces the
1991 Outer_Syntax.command_spec from a major keyword introduced via theory
1992 header declaration; it can be passed to Outer_Syntax.command etc.
1994 * Local_Theory.define no longer hard-wires default theorem name
1995 "foo_def", but retains the binding as given. If that is Binding.empty
1996 / Attrib.empty_binding, the result is not registered as user-level
1997 fact. The Local_Theory.define_internal variant allows to specify a
1998 non-empty name (used for the foundation in the background theory),
1999 while omitting the fact binding in the user-context. Potential
2000 INCOMPATIBILITY for derived definitional packages: need to specify
2001 naming policy for primitive definitions more explicitly.
2003 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
2004 conformance with similar operations in structure Term and Logic.
2006 * Antiquotation @{attributes [...]} embeds attribute source
2007 representation into the ML text, which is particularly useful with
2008 declarations like Local_Theory.note.
2010 * Structure Proof_Context follows standard naming scheme. Old
2011 ProofContext has been discontinued. INCOMPATIBILITY.
2013 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
2014 change of semantics: update is applied to auxiliary local theory
2017 * Modernized some old-style infix operations:
2019 addeqcongs ~> Simplifier.add_eqcong
2020 deleqcongs ~> Simplifier.del_eqcong
2021 addcongs ~> Simplifier.add_cong
2022 delcongs ~> Simplifier.del_cong
2023 setmksimps ~> Simplifier.set_mksimps
2024 setmkcong ~> Simplifier.set_mkcong
2025 setmksym ~> Simplifier.set_mksym
2026 setmkeqTrue ~> Simplifier.set_mkeqTrue
2027 settermless ~> Simplifier.set_termless
2028 setsubgoaler ~> Simplifier.set_subgoaler
2029 addsplits ~> Splitter.add_split
2030 delsplits ~> Splitter.del_split
2035 * USER_HOME settings variable points to cross-platform user home
2036 directory, which coincides with HOME on POSIX systems only. Likewise,
2037 the Isabelle path specification "~" now expands to $USER_HOME, instead
2038 of former $HOME. A different default for USER_HOME may be set
2039 explicitly in shell environment, before Isabelle settings are
2040 evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where
2041 the generic user home was intended.
2043 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
2044 notation, which is useful for the jEdit file browser, for example.
2046 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
2051 New in Isabelle2011-1 (October 2011)
2052 ------------------------------------
2056 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
2057 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
2059 - Management of multiple theory files directly from the editor
2060 buffer store -- bypassing the file-system (no requirement to save
2061 files for checking).
2063 - Markup of formal entities within the text buffer, with semantic
2064 highlighting, tooltips and hyperlinks to jump to defining source
2067 - Improved text rendering, with sub/superscripts in the source
2068 buffer (including support for copy/paste wrt. output panel, HTML
2069 theory output and other non-Isabelle text boxes).
2071 - Refined scheduling of proof checking and printing of results,
2072 based on interactive editor view. (Note: jEdit folding and
2073 narrowing allows to restrict buffer perspectives explicitly.)
2075 - Reduced CPU performance requirements, usable on machines with few
2078 - Reduced memory requirements due to pruning of unused document
2079 versions (garbage collection).
2081 See also ~~/src/Tools/jEdit/README.html for further information,
2082 including some remaining limitations.
2084 * Theory loader: source files are exclusively located via the master
2085 directory of each theory node (where the .thy file itself resides).
2086 The global load path (such as src/HOL/Library) has been discontinued.
2087 Note that the path element ~~ may be used to reference theories in the
2088 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
2091 * Theory loader: source files are identified by content via SHA1
2092 digests. Discontinued former path/modtime identification and optional
2093 ISABELLE_FILE_IDENT plugin scripts.
2095 * Parallelization of nested Isar proofs is subject to
2096 Goal.parallel_proofs_threshold (default 100). See also isabelle
2099 * Name space: former unsynchronized references are now proper
2100 configuration options, with more conventional names:
2102 long_names ~> names_long
2103 short_names ~> names_short
2104 unique_names ~> names_unique
2106 Minor INCOMPATIBILITY, need to declare options in context like this:
2108 declare [[names_unique = false]]
2110 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note
2111 that the result needs to be unique, which means fact specifications
2112 may have to be refined after enriching a proof context.
2114 * Attribute "case_names" has been refined: the assumptions in each case
2115 can be named now by following the case name with [name1 name2 ...].
2117 * Isabelle/Isar reference manual has been updated and extended:
2118 - "Synopsis" provides a catalog of main Isar language concepts.
2119 - Formal references in syntax diagrams, via @{rail} antiquotation.
2120 - Updated material from classic "ref" manual, notably about
2121 "Classical Reasoner".
2126 * Class bot and top require underlying partial order rather than
2127 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.
2129 * Class complete_lattice: generalized a couple of lemmas from sets;
2130 generalized theorems INF_cong and SUP_cong. New type classes for
2131 complete boolean algebras and complete linear orders. Lemmas
2132 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
2133 class complete_linorder.
2135 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
2136 Sup_fun_def, Inf_apply, Sup_apply.
2138 Removed redundant lemmas (the right hand side gives hints how to
2139 replace them for (metis ...), or (simp only: ...) proofs):
2141 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
2142 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
2143 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
2144 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
2145 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
2146 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
2147 Inter_def ~> INF_def, image_def
2148 Union_def ~> SUP_def, image_def
2149 INT_eq ~> INF_def, and image_def
2150 UN_eq ~> SUP_def, and image_def
2151 INF_subset ~> INF_superset_mono [OF _ order_refl]
2153 More consistent and comprehensive names:
2155 INTER_eq_Inter_image ~> INF_def
2156 UNION_eq_Union_image ~> SUP_def
2159 INF_leI ~> INF_lower
2160 INF_leI2 ~> INF_lower2
2161 le_INFI ~> INF_greatest
2162 le_SUPI ~> SUP_upper
2163 le_SUPI2 ~> SUP_upper2
2164 SUP_leI ~> SUP_least
2165 INFI_bool_eq ~> INF_bool_eq
2166 SUPR_bool_eq ~> SUP_bool_eq
2167 INFI_apply ~> INF_apply
2168 SUPR_apply ~> SUP_apply
2169 INTER_def ~> INTER_eq
2170 UNION_def ~> UNION_eq
2174 * Renamed theory Complete_Lattice to Complete_Lattices.
2177 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
2178 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
2179 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
2180 Sup_insert are now declared as [simp]. INCOMPATIBILITY.
2182 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
2183 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
2184 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor
2187 * Added syntactic classes "inf" and "sup" for the respective
2188 constants. INCOMPATIBILITY: Changes in the argument order of the
2189 (mostly internal) locale predicates for some derived classes.
2191 * Theorem collections ball_simps and bex_simps do not contain theorems
2192 referring to UNION any longer; these have been moved to collection
2193 UN_ball_bex_simps. INCOMPATIBILITY.
2195 * Theory Archimedean_Field: floor now is defined as parameter of a
2196 separate type class floor_ceiling.
2198 * Theory Finite_Set: more coherent development of fold_set locales:
2200 locale fun_left_comm ~> locale comp_fun_commute
2201 locale fun_left_comm_idem ~> locale comp_fun_idem
2203 Both use point-free characterization; interpretation proofs may need
2204 adjustment. INCOMPATIBILITY.
2206 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
2207 accordance with standard mathematical terminology. INCOMPATIBILITY.
2209 * Theory Complex_Main: The locale interpretations for the
2210 bounded_linear and bounded_bilinear locales have been removed, in
2211 order to reduce the number of duplicate lemmas. Users must use the
2212 original names for distributivity theorems, potential INCOMPATIBILITY.
2214 divide.add ~> add_divide_distrib
2215 divide.diff ~> diff_divide_distrib
2216 divide.setsum ~> setsum_divide_distrib
2217 mult.add_right ~> right_distrib
2218 mult.diff_right ~> right_diff_distrib
2219 mult_right.setsum ~> setsum_right_distrib
2220 mult_left.diff ~> left_diff_distrib
2222 * Theory Complex_Main: Several redundant theorems have been removed or
2223 replaced by more general versions. INCOMPATIBILITY.
2225 real_diff_def ~> minus_real_def
2226 real_divide_def ~> divide_real_def
2227 real_less_def ~> less_le
2228 real_abs_def ~> abs_real_def
2229 real_sgn_def ~> sgn_real_def
2230 real_mult_commute ~> mult_commute
2231 real_mult_assoc ~> mult_assoc
2232 real_mult_1 ~> mult_1_left
2233 real_add_mult_distrib ~> left_distrib
2234 real_zero_not_eq_one ~> zero_neq_one
2235 real_mult_inverse_left ~> left_inverse
2236 INVERSE_ZERO ~> inverse_zero
2237 real_le_refl ~> order_refl
2238 real_le_antisym ~> order_antisym
2239 real_le_trans ~> order_trans
2240 real_le_linear ~> linear
2241 real_le_eq_diff ~> le_iff_diff_le_0
2242 real_add_left_mono ~> add_left_mono
2243 real_mult_order ~> mult_pos_pos
2244 real_mult_less_mono2 ~> mult_strict_left_mono
2245 real_of_int_real_of_nat ~> real_of_int_of_nat_eq
2246 real_0_le_divide_iff ~> zero_le_divide_iff
2247 realpow_two_disj ~> power2_eq_iff
2248 real_squared_diff_one_factored ~> square_diff_one_factored
2249 realpow_two_diff ~> square_diff_square_factored
2250 reals_complete2 ~> complete_real
2251 real_sum_squared_expand ~> power2_sum
2252 exp_ln_eq ~> ln_unique
2254 expi_zero ~> exp_zero
2255 lemma_DERIV_subst ~> DERIV_cong
2256 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
2257 LIMSEQ_const ~> tendsto_const
2258 LIMSEQ_norm ~> tendsto_norm
2259 LIMSEQ_add ~> tendsto_add
2260 LIMSEQ_minus ~> tendsto_minus
2261 LIMSEQ_minus_cancel ~> tendsto_minus_cancel
2262 LIMSEQ_diff ~> tendsto_diff
2263 bounded_linear.LIMSEQ ~> bounded_linear.tendsto
2264 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
2265 LIMSEQ_mult ~> tendsto_mult
2266 LIMSEQ_inverse ~> tendsto_inverse
2267 LIMSEQ_divide ~> tendsto_divide
2268 LIMSEQ_pow ~> tendsto_power
2269 LIMSEQ_setsum ~> tendsto_setsum
2270 LIMSEQ_setprod ~> tendsto_setprod
2271 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
2272 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
2273 LIMSEQ_imp_rabs ~> tendsto_rabs
2274 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
2275 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
2276 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
2277 LIMSEQ_Complex ~> tendsto_Complex
2278 LIM_ident ~> tendsto_ident_at
2279 LIM_const ~> tendsto_const
2280 LIM_add ~> tendsto_add
2281 LIM_add_zero ~> tendsto_add_zero
2282 LIM_minus ~> tendsto_minus
2283 LIM_diff ~> tendsto_diff
2284 LIM_norm ~> tendsto_norm
2285 LIM_norm_zero ~> tendsto_norm_zero
2286 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
2287 LIM_norm_zero_iff ~> tendsto_norm_zero_iff
2288 LIM_rabs ~> tendsto_rabs
2289 LIM_rabs_zero ~> tendsto_rabs_zero
2290 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
2291 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
2292 LIM_compose ~> tendsto_compose
2293 LIM_mult ~> tendsto_mult
2294 LIM_scaleR ~> tendsto_scaleR
2295 LIM_of_real ~> tendsto_of_real
2296 LIM_power ~> tendsto_power
2297 LIM_inverse ~> tendsto_inverse
2298 LIM_sgn ~> tendsto_sgn
2299 isCont_LIM_compose ~> isCont_tendsto_compose
2300 bounded_linear.LIM ~> bounded_linear.tendsto
2301 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
2302 bounded_bilinear.LIM ~> bounded_bilinear.tendsto
2303 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
2304 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
2305 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
2306 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
2308 * Theory Complex_Main: The definition of infinite series was
2309 generalized. Now it is defined on the type class {topological_space,
2310 comm_monoid_add}. Hence it is useable also for extended real numbers.
2312 * Theory Complex_Main: The complex exponential function "expi" is now
2313 a type-constrained abbreviation for "exp :: complex => complex"; thus
2314 several polymorphic lemmas about "exp" are now applicable to "expi".
2318 - Theory Library/Code_Char_ord provides native ordering of
2319 characters in the target language.
2321 - Commands code_module and code_library are legacy, use export_code
2324 - Method "evaluation" is legacy, use method "eval" instead.
2326 - Legacy evaluator "SML" is deactivated by default. May be
2327 reactivated by the following theory command:
2329 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
2331 * Declare ext [intro] by default. Rare INCOMPATIBILITY.
2333 * New proof method "induction" that gives induction hypotheses the
2334 name "IH", thus distinguishing them from further hypotheses that come
2335 from rule induction. The latter are still called "hyps". Method
2336 "induction" is a thin wrapper around "induct" and follows the same
2339 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
2340 still available as a legacy feature for some time.
2343 - Added "need" and "total_consts" options.
2344 - Reintroduced "show_skolems" option by popular demand.
2345 - Renamed attribute: nitpick_def ~> nitpick_unfold.
2349 - Use quasi-sound (and efficient) translations by default.
2350 - Added support for the following provers: E-ToFoF, LEO-II,
2351 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
2352 - Automatically preplay and minimize proofs before showing them if
2353 this can be done within reasonable time.
2354 - sledgehammer available_provers ~> sledgehammer supported_provers.
2356 - Added "preplay_timeout", "slicing", "type_enc", "sound",
2357 "max_mono_iters", and "max_new_mono_instances" options.
2358 - Removed "explicit_apply" and "full_types" options as well as "Full
2359 Types" Proof General menu item. INCOMPATIBILITY.
2362 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
2363 - Obsoleted "metisFT" -- use "metis (full_types)" instead.
2367 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
2368 "elim:" options. INCOMPATIBILITY.
2369 - Introduced 'try' that not only runs 'try_methods' but also
2370 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
2373 - Added "eval" option to evaluate terms for the found counterexample
2374 (currently only supported by the default (exhaustive) tester).
2375 - Added post-processing of terms to obtain readable counterexamples
2376 (currently only supported by the default (exhaustive) tester).
2377 - New counterexample generator quickcheck[narrowing] enables
2378 narrowing-based testing. Requires the Glasgow Haskell compiler
2379 with its installation location defined in the Isabelle settings
2380 environment as ISABELLE_GHC.
2381 - Removed quickcheck tester "SML" based on the SML code generator
2382 (formly in HOL/Library).
2384 * Function package: discontinued option "tailrec". INCOMPATIBILITY,
2385 use 'partial_function' instead.
2387 * Theory Library/Extended_Reals replaces now the positive extended
2388 reals found in probability theory. This file is extended by
2389 Multivariate_Analysis/Extended_Real_Limits.
2391 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,
2392 from where it must be imported explicitly if it is really required.
2395 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
2396 been moved here. INCOMPATIBILITY.
2398 * Theory Library/Saturated provides type of numbers with saturated
2401 * Theory Library/Product_Lattice defines a pointwise ordering for the
2402 product type 'a * 'b, and provides instance proofs for various order
2403 and lattice type classes.
2405 * Theory Library/Countable now provides the "countable_datatype" proof
2406 method for proving "countable" class instances for datatypes.
2408 * Theory Library/Cset_Monad allows do notation for computable sets
2409 (cset) via the generic monad ad-hoc overloading facility.
2411 * Library: Theories of common data structures are split into theories
2412 for implementation, an invariant-ensuring type, and connection to an
2413 abstract type. INCOMPATIBILITY.
2415 - RBT is split into RBT and RBT_Mapping.
2416 - AssocList is split and renamed into AList and AList_Mapping.
2417 - DList is split into DList_Impl, DList, and DList_Cset.
2418 - Cset is split into Cset and List_Cset.
2420 * Theory Library/Nat_Infinity has been renamed to
2421 Library/Extended_Nat, with name changes of the following types and
2424 type inat ~> type enat
2426 Infty ~> infinity (overloaded)
2430 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
2431 been renamed accordingly. INCOMPATIBILITY.
2433 * Session Multivariate_Analysis: The euclidean_space type class now
2434 fixes a constant "Basis :: 'a set" consisting of the standard
2435 orthonormal basis for the type. Users now have the option of
2436 quantifying over this set instead of using the "basis" function, e.g.
2437 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
2439 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
2440 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
2441 "Cart_nth" and "Cart_lambda" have been respectively renamed to
2442 "vec_nth" and "vec_lambda"; theorems mentioning those names have
2443 changed to match. Definition theorems for overloaded constants now use
2444 the standard "foo_vec_def" naming scheme. A few other theorems have
2445 been renamed as follows (INCOMPATIBILITY):
2447 Cart_eq ~> vec_eq_iff
2448 dist_nth_le_cart ~> dist_vec_nth_le
2449 tendsto_vector ~> vec_tendstoI
2450 Cauchy_vector ~> vec_CauchyI
2452 * Session Multivariate_Analysis: Several duplicate theorems have been
2453 removed, and other theorems have been renamed or replaced with more
2454 general versions. INCOMPATIBILITY.
2456 finite_choice ~> finite_set_choice
2457 eventually_conjI ~> eventually_conj
2458 eventually_and ~> eventually_conj_iff
2459 eventually_false ~> eventually_False
2460 setsum_norm ~> norm_setsum
2461 Lim_sequentially ~> LIMSEQ_def
2462 Lim_ident_at ~> LIM_ident
2463 Lim_const ~> tendsto_const
2464 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
2465 Lim_neg ~> tendsto_minus
2466 Lim_add ~> tendsto_add
2467 Lim_sub ~> tendsto_diff
2468 Lim_mul ~> tendsto_scaleR
2469 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
2470 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
2471 Lim_linear ~> bounded_linear.tendsto
2472 Lim_component ~> tendsto_euclidean_component
2473 Lim_component_cart ~> tendsto_vec_nth
2474 Lim_inner ~> tendsto_inner [OF tendsto_const]
2475 dot_lsum ~> inner_setsum_left
2476 dot_rsum ~> inner_setsum_right
2477 continuous_cmul ~> continuous_scaleR [OF continuous_const]
2478 continuous_neg ~> continuous_minus
2479 continuous_sub ~> continuous_diff
2480 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
2481 continuous_mul ~> continuous_scaleR
2482 continuous_inv ~> continuous_inverse
2483 continuous_at_within_inv ~> continuous_at_within_inverse
2484 continuous_at_inv ~> continuous_at_inverse
2485 continuous_at_norm ~> continuous_norm [OF continuous_at_id]
2486 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
2487 continuous_at_component ~> continuous_component [OF continuous_at_id]
2488 continuous_on_neg ~> continuous_on_minus
2489 continuous_on_sub ~> continuous_on_diff
2490 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
2491 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
2492 continuous_on_mul ~> continuous_on_scaleR
2493 continuous_on_mul_real ~> continuous_on_mult
2494 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
2495 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
2496 continuous_on_inverse ~> continuous_on_inv
2497 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
2498 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
2499 subset_interior ~> interior_mono
2500 subset_closure ~> closure_mono
2501 closure_univ ~> closure_UNIV
2502 real_arch_lt ~> reals_Archimedean2
2503 real_arch ~> reals_Archimedean3
2504 real_abs_norm ~> abs_norm_cancel
2505 real_abs_sub_norm ~> norm_triangle_ineq3
2506 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
2508 * Session HOL-Probability:
2509 - Caratheodory's extension lemma is now proved for ring_of_sets.
2510 - Infinite products of probability measures are now available.
2511 - Sigma closure is independent, if the generator is independent
2512 - Use extended reals instead of positive extended
2513 reals. INCOMPATIBILITY.
2515 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
2517 expand_fun_below ~> fun_below_iff
2518 below_fun_ext ~> fun_belowI
2519 expand_cfun_eq ~> cfun_eq_iff
2520 ext_cfun ~> cfun_eqI
2521 expand_cfun_below ~> cfun_below_iff
2522 below_cfun_ext ~> cfun_belowI
2523 monofun_fun_fun ~> fun_belowD
2524 monofun_fun_arg ~> monofunE
2525 monofun_lub_fun ~> adm_monofun [THEN admD]
2526 cont_lub_fun ~> adm_cont [THEN admD]
2527 cont2cont_Rep_CFun ~> cont2cont_APP
2528 cont_Rep_CFun_app ~> cont_APP_app
2529 cont_Rep_CFun_app_app ~> cont_APP_app_app
2530 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
2531 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
2532 contlub_cfun ~> lub_APP [symmetric]
2533 contlub_LAM ~> lub_LAM [symmetric]
2536 lift_distinct1 ~> lift.distinct(1)
2537 lift_distinct2 ~> lift.distinct(2)
2538 Def_not_UU ~> lift.distinct(2)
2539 Def_inject ~> lift.inject
2540 below_UU_iff ~> below_bottom_iff
2541 eq_UU_iff ~> eq_bottom_iff
2544 *** Document preparation ***
2546 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
2547 isar-ref manual, both for description and actual application of the
2550 * Antiquotation @{value} evaluates the given term and presents its
2553 * Antiquotations: term style "isub" provides ad-hoc conversion of
2554 variables x1, y23 into subscripted form x\<^isub>1,
2555 y\<^isub>2\<^isub>3.
2557 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
2558 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
2560 * Localized \isabellestyle switch can be used within blocks or groups
2563 \isabellestyle{it} %preferred default
2564 {\isabellestylett @{text "typewriter stuff"}}
2566 * Discontinued special treatment of hard tabulators. Implicit
2567 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual
2573 * The inner syntax of sort/type/term/prop supports inlined YXML
2574 representations within quoted string tokens. By encoding logical
2575 entities via Term_XML (in ML or Scala) concrete syntax can be
2576 bypassed, which is particularly useful for producing bits of text
2577 under external program control.
2579 * Antiquotations for ML and document preparation are managed as theory
2580 data, which requires explicit setup.
2582 * Isabelle_Process.is_active allows tools to check if the official
2583 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
2584 (better known as Proof General).
2586 * Structure Proof_Context follows standard naming scheme. Old
2587 ProofContext is still available for some time as legacy alias.
2589 * Structure Timing provides various operations for timing; supersedes
2590 former start_timing/end_timing etc.
2592 * Path.print is the official way to show file-system paths to users
2593 (including quotes etc.).
2595 * Inner syntax: identifiers in parse trees of generic categories
2596 "logic", "aprop", "idt" etc. carry position information (disguised as
2597 type constraints). Occasional INCOMPATIBILITY with non-compliant
2598 translations that choke on unexpected type constraints. Positions can
2599 be stripped in ML translations via Syntax.strip_positions /
2600 Syntax.strip_positions_ast, or via the syntax constant
2601 "_strip_positions" within parse trees. As last resort, positions can
2602 be disabled via the configuration option Syntax.positions, which is
2603 called "syntax_positions" in Isar attribute syntax.
2605 * Discontinued special status of various ML structures that contribute
2606 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
2607 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
2608 refer directly to Ast.Constant, Lexicon.is_identifier,
2609 Syntax_Trans.mk_binder_tr etc.
2611 * Typed print translation: discontinued show_sorts argument, which is
2612 already available via context of "advanced" translation.
2614 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
2615 goal states; body tactic needs to address all subgoals uniformly.
2617 * Slightly more special eq_list/eq_set, with shortcut involving
2618 pointer equality (assumes that eq relation is reflexive).
2620 * Classical tactics use proper Proof.context instead of historic types
2621 claset/clasimpset. Old-style declarations like addIs, addEs, addDs
2622 operate directly on Proof.context. Raw type claset retains its use as
2623 snapshot of the classical context, which can be recovered via
2624 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.
2625 INCOMPATIBILITY, classical tactics and derived proof methods require
2626 proper Proof.context.
2631 * Discontinued support for Poly/ML 5.2, which was the last version
2632 without proper multithreading and TimeLimit implementation.
2634 * Discontinued old lib/scripts/polyml-platform, which has been
2635 obsolete since Isabelle2009-2.
2637 * Various optional external tools are referenced more robustly and
2638 uniformly by explicit Isabelle settings as follows:
2640 ISABELLE_CSDP (formerly CSDP_EXE)
2641 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)
2642 ISABELLE_OCAML (formerly EXEC_OCAML)
2643 ISABELLE_SWIPL (formerly EXEC_SWIPL)
2644 ISABELLE_YAP (formerly EXEC_YAP)
2646 Note that automated detection from the file-system or search path has
2647 been discontinued. INCOMPATIBILITY.
2649 * Scala layer provides JVM method invocation service for static
2650 methods of type (String)String, see Invoke_Scala.method in ML. For
2653 Invoke_Scala.method "java.lang.System.getProperty" "java.home"
2655 Together with YXML.string_of_body/parse_body and XML.Encode/Decode
2656 this allows to pass structured values between ML and Scala.
2658 * The IsabelleText fonts includes some further glyphs to support the
2659 Prover IDE. Potential INCOMPATIBILITY: users who happen to have
2660 installed a local copy (which is normally *not* required) need to
2661 delete or update it from ~~/lib/fonts/.
2665 New in Isabelle2011 (January 2011)
2666 ----------------------------------
2670 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
2671 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
2672 useful tooltips and hyperlinks produced from its static analysis. The
2673 bundled component provides an executable Isabelle tool that can be run
2676 Isabelle2011/bin/isabelle jedit
2678 * Significantly improved Isabelle/Isar implementation manual.
2680 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
2681 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
2682 while the default heap location within that directory lacks that extra
2683 suffix. This isolates multiple Isabelle installations from each
2684 other, avoiding problems with old settings in new versions.
2685 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
2687 * Source files are always encoded as UTF-8, instead of old-fashioned
2688 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
2689 the following package declarations:
2691 \usepackage[utf8]{inputenc}
2692 \usepackage{textcomp}
2694 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
2695 a Unicode character is treated as a single symbol, not a sequence of
2696 non-ASCII bytes as before. Since Isabelle/ML string literals may
2697 contain symbols without further backslash escapes, Unicode can now be
2698 used here as well. Recall that Symbol.explode in ML provides a
2699 consistent view on symbols, while raw explode (or String.explode)
2700 merely give a byte-oriented representation.
2702 * Theory loader: source files are primarily located via the master
2703 directory of each theory node (where the .thy file itself resides).
2704 The global load path is still partially available as legacy feature.
2705 Minor INCOMPATIBILITY due to subtle change in file lookup: use
2706 explicit paths, relatively to the theory.
2708 * Special treatment of ML file names has been discontinued.
2709 Historically, optional extensions .ML or .sml were added on demand --
2710 at the cost of clarity of file dependencies. Recall that Isabelle/ML
2711 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
2713 * Various options that affect pretty printing etc. are now properly
2714 handled within the context via configuration options, instead of
2715 unsynchronized references or print modes. There are both ML Config.T
2716 entities and Isar declaration attributes to access these.
2718 ML (Config.T) Isar (attribute)
2720 eta_contract eta_contract
2721 show_brackets show_brackets
2722 show_sorts show_sorts
2723 show_types show_types
2724 show_question_marks show_question_marks
2725 show_consts show_consts
2726 show_abbrevs show_abbrevs
2728 Syntax.ast_trace syntax_ast_trace
2729 Syntax.ast_stat syntax_ast_stat
2730 Syntax.ambiguity_level syntax_ambiguity_level
2732 Goal_Display.goals_limit goals_limit
2733 Goal_Display.show_main_goal show_main_goal
2735 Method.rule_trace rule_trace
2737 Thy_Output.display thy_output_display
2738 Thy_Output.quotes thy_output_quotes
2739 Thy_Output.indent thy_output_indent
2740 Thy_Output.source thy_output_source
2741 Thy_Output.break thy_output_break
2743 Note that corresponding "..._default" references in ML may only be
2744 changed globally at the ROOT session setup, but *not* within a theory.
2745 The option "show_abbrevs" supersedes the former print mode
2746 "no_abbrevs" with inverted meaning.
2748 * More systematic naming of some configuration options.
2751 trace_simp ~> simp_trace
2752 debug_simp ~> simp_debug
2754 * Support for real valued configuration options, using simplistic
2755 floating-point notation that coincides with the inner syntax for
2758 * Support for real valued preferences (with approximative PGIP type):
2759 front-ends need to accept "pgint" values in float notation.
2762 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
2765 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
2770 * Command 'type_synonym' (with single argument) replaces somewhat
2771 outdated 'types', which is still available as legacy feature for some
2774 * Command 'nonterminal' (with 'and' separated list of arguments)
2775 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
2777 * Command 'notepad' replaces former 'example_proof' for
2778 experimentation in Isar without any result. INCOMPATIBILITY.
2780 * Locale interpretation commands 'interpret' and 'sublocale' accept
2781 lists of equations to map definitions in a locale to appropriate
2782 entities in the context of the interpretation. The 'interpretation'
2783 command already provided this functionality.
2785 * Diagnostic command 'print_dependencies' prints the locale instances
2786 that would be activated if the specified expression was interpreted in
2787 the current context. Variant "print_dependencies!" assumes a context
2788 without interpretations.
2790 * Diagnostic command 'print_interps' prints interpretations in proofs
2791 in addition to interpretations in theories.
2793 * Discontinued obsolete 'global' and 'local' commands to manipulate
2794 the theory name space. Rare INCOMPATIBILITY. The ML functions
2795 Sign.root_path and Sign.local_path may be applied directly where this
2796 feature is still required for historical reasons.
2798 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
2799 'definition' instead.
2801 * The "prems" fact, which refers to the accidental collection of
2802 foundational premises in the context, is now explicitly marked as
2803 legacy feature and will be discontinued soon. Consider using "assms"
2804 of the head statement or reference facts by explicit names.
2806 * Document antiquotations @{class} and @{type} print classes and type
2809 * Document antiquotation @{file} checks file/directory entries within
2810 the local file system.
2815 * Coercive subtyping: functions can be declared as coercions and type
2816 inference will add them as necessary upon input of a term. Theory
2817 Complex_Main declares real :: nat => real and real :: int => real as
2818 coercions. A coercion function f is declared like this:
2820 declare [[coercion f]]
2822 To lift coercions through type constructors (e.g. from nat => real to
2823 nat list => real list), map functions can be declared, e.g.
2825 declare [[coercion_map map]]
2827 Currently coercion inference is activated only in theories including
2828 real numbers, i.e. descendants of Complex_Main. This is controlled by
2829 the configuration option "coercion_enabled", e.g. it can be enabled in
2830 other theories like this:
2832 declare [[coercion_enabled]]
2834 * Command 'partial_function' provides basic support for recursive
2835 function definitions over complete partial orders. Concrete instances
2836 are provided for i) the option type, ii) tail recursion on arbitrary
2837 types, and iii) the heap monad of Imperative_HOL. See
2838 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
2841 * Function package: f.psimps rules are no longer implicitly declared
2842 as [simp]. INCOMPATIBILITY.
2844 * Datatype package: theorems generated for executable equality (class
2845 "eq") carry proper names and are treated as default code equations.
2847 * Inductive package: now offers command 'inductive_simps' to
2848 automatically derive instantiated and simplified equations for
2849 inductive predicates, similar to 'inductive_cases'.
2851 * Command 'enriched_type' allows to register properties of the
2852 functorial structure of types.
2854 * Improved infrastructure for term evaluation using code generator
2855 techniques, in particular static evaluation conversions.
2857 * Code generator: Scala (2.8 or higher) has been added to the target
2860 * Code generator: globbing constant expressions "*" and "Theory.*"
2861 have been replaced by the more idiomatic "_" and "Theory._".
2864 * Code generator: export_code without explicit file declaration prints
2865 to standard output. INCOMPATIBILITY.
2867 * Code generator: do not print function definitions for case
2868 combinators any longer.
2870 * Code generator: simplification with rules determined with
2871 src/Tools/Code/code_simp.ML and method "code_simp".
2873 * Code generator for records: more idiomatic representation of record
2874 types. Warning: records are not covered by ancient SML code
2875 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
2876 rep_datatype declaration helps to succeed then:
2880 rep_datatype foo_ext ...
2882 * Records: logical foundation type for records does not carry a
2883 '_type' suffix any longer (obsolete due to authentic syntax).
2886 * Quickcheck now by default uses exhaustive testing instead of random
2887 testing. Random testing can be invoked by "quickcheck [random]",
2888 exhaustive testing by "quickcheck [exhaustive]".
2890 * Quickcheck instantiates polymorphic types with small finite
2891 datatypes by default. This enables a simple execution mechanism to
2892 handle quantifiers and function equality over the finite datatypes.
2894 * Quickcheck random generator has been renamed from "code" to
2895 "random". INCOMPATIBILITY.
2897 * Quickcheck now has a configurable time limit which is set to 30
2898 seconds by default. This can be changed by adding [timeout = n] to the
2899 quickcheck command. The time limit for Auto Quickcheck is still set
2902 * Quickcheck in locales considers interpretations of that locale for
2903 counter example search.
2906 - Added "smt" and "remote_smt" provers based on the "smt" proof
2907 method. See the Sledgehammer manual for details ("isabelle doc
2910 sledgehammer atp_info ~> sledgehammer running_provers
2911 sledgehammer atp_kill ~> sledgehammer kill_provers
2912 sledgehammer available_atps ~> sledgehammer available_provers
2915 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
2916 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
2917 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
2918 (and "ms" and "min" are no longer supported)
2923 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
2924 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
2926 - Added support for partial quotient types.
2927 - Added local versions of the "Nitpick.register_xxx" functions.
2928 - Added "whack" option.
2929 - Allow registration of quotient types as codatatypes.
2930 - Improved "merge_type_vars" option to merge more types.
2931 - Removed unsound "fast_descrs" option.
2932 - Added custom symmetry breaking for datatypes, making it possible to reach
2933 higher cardinalities.
2934 - Prevent the expansion of too large definitions.
2936 * Proof methods "metis" and "meson" now have configuration options
2937 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
2938 to diagnose these tools. E.g.
2940 using [[metis_trace = true]]
2942 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
2943 manually as command 'solve_direct'.
2945 * The default SMT solver Z3 must be enabled explicitly (due to
2946 licensing issues) by setting the environment variable
2947 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
2948 commercial applications, the SMT solver CVC3 is provided as fall-back;
2949 changing the SMT solver is done via the configuration option
2952 * Remote SMT solvers need to be referred to by the "remote_" prefix,
2953 i.e. "remote_cvc3" and "remote_z3".
2955 * Added basic SMT support for datatypes, records, and typedefs using
2956 the oracle mode (no proofs). Direct support of pairs has been dropped
2957 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
2958 support for a similar behavior). Minor INCOMPATIBILITY.
2960 * Changed SMT configuration options:
2962 z3_proofs ~> smt_oracle (with inverted meaning)
2963 z3_trace_assms ~> smt_trace_used_facts
2976 * Boogie output files (.b2i files) need to be declared in the theory
2979 * Simplification procedure "list_to_set_comprehension" rewrites list
2980 comprehensions applied to List.set to set comprehensions. Occasional
2981 INCOMPATIBILITY, may be deactivated like this:
2983 declare [[simproc del: list_to_set_comprehension]]
2985 * Removed old version of primrec package. INCOMPATIBILITY.
2987 * Removed simplifier congruence rule of "prod_case", as has for long
2988 been the case with "split". INCOMPATIBILITY.
2990 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
2992 * Removed [split_format ... and ... and ...] version of
2993 [split_format]. Potential INCOMPATIBILITY.
2995 * Predicate "sorted" now defined inductively, with nice induction
2996 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
2998 * Constant "contents" renamed to "the_elem", to free the generic name
2999 contents for other uses. INCOMPATIBILITY.
3001 * Renamed class eq and constant eq (for code generation) to class
3002 equal and constant equal, plus renaming of related facts and various
3003 tuning. INCOMPATIBILITY.
3005 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
3007 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
3010 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
3011 avoid confusion with finite sets. INCOMPATIBILITY.
3013 * Abandoned locales equiv, congruent and congruent2 for equivalence
3014 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
3017 * Some previously unqualified names have been qualified:
3024 Trueprop ~> HOL.Trueprop
3029 op --> ~> HOL.implies
3041 Pair ~> Product_Type.Pair
3042 fst ~> Product_Type.fst
3043 snd ~> Product_Type.snd
3044 curry ~> Product_Type.curry
3046 Collect ~> Set.Collect
3050 * More canonical naming convention for some fundamental definitions:
3052 bot_bool_eq ~> bot_bool_def
3053 top_bool_eq ~> top_bool_def
3054 inf_bool_eq ~> inf_bool_def
3055 sup_bool_eq ~> sup_bool_def
3056 bot_fun_eq ~> bot_fun_def
3057 top_fun_eq ~> top_fun_def
3058 inf_fun_eq ~> inf_fun_def
3059 sup_fun_eq ~> sup_fun_def
3063 * More stylized fact names:
3065 expand_fun_eq ~> fun_eq_iff
3066 expand_set_eq ~> set_eq_iff
3068 nat_number ~> eval_nat_numeral
3072 * Refactoring of code-generation specific operations in theory List:
3078 mem_iff ~> member_def
3079 null_empty ~> null_def
3081 INCOMPATIBILITY. Note that these were not supposed to be used
3082 regularly unless for striking reasons; their main purpose was code
3085 Various operations from the Haskell prelude are used for generating
3088 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
3089 "surj f" is now an abbreviation of "range f = UNIV". The theorems
3090 bij_def and surj_def are unchanged. INCOMPATIBILITY.
3092 * Abolished some non-alphabetic type names: "prod" and "sum" replace
3093 "*" and "+" respectively. INCOMPATIBILITY.
3095 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
3096 "Sum_Type.Plus" instead.
3098 * Constant "split" has been merged with constant "prod_case"; names of
3099 ML functions, facts etc. involving split have been retained so far,
3100 though. INCOMPATIBILITY.
3102 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
3103 instead. INCOMPATIBILITY.
3105 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
3108 * Former theory Library/Enum is now part of the HOL-Main image.
3109 INCOMPATIBILITY: all constants of the Enum theory now have to be
3110 referred to by its qualified name.
3113 nlists ~> Enum.nlists
3114 product ~> Enum.product
3116 * Theory Library/Monad_Syntax provides do-syntax for monad types.
3117 Syntax in Library/State_Monad has been changed to avoid ambiguities.
3120 * Theory Library/SetsAndFunctions has been split into
3121 Library/Function_Algebras and Library/Set_Algebras; canonical names
3122 for instance definitions for functions; various improvements.
3125 * Theory Library/Multiset provides stable quicksort implementation of
3128 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
3131 * Session Multivariate_Analysis: introduced a type class for euclidean
3132 space. Most theorems are now stated in terms of euclidean spaces
3133 instead of finite cartesian products.
3136 real ^ 'n ~> 'a::real_vector
3137 ~> 'a::euclidean_space
3138 ~> 'a::ordered_euclidean_space
3139 (depends on your needs)
3143 \<chi> x. _ ~> \<chi>\<chi> x. _
3146 Also note that the indices are now natural numbers and not from some
3147 finite type. Finite cartesian products of euclidean spaces, products
3148 of euclidean spaces the real and complex numbers are instantiated to
3149 be euclidean_spaces. INCOMPATIBILITY.
3151 * Session Probability: introduced pextreal as positive extended real
3152 numbers. Use pextreal as value for measures. Introduce the
3153 Radon-Nikodym derivative, product spaces and Fubini's theorem for
3154 arbitrary sigma finite measures. Introduces Lebesgue measure based on
3155 the integral in Multivariate Analysis. INCOMPATIBILITY.
3157 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
3160 * Session SPARK (with image HOL-SPARK) provides commands to load and
3161 prove verification conditions generated by the SPARK Ada program
3162 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
3167 * Theorems for additive ring operations (locale abelian_monoid and
3168 descendants) are generated by interpretation from their multiplicative
3169 counterparts. Names (in particular theorem names) have the mandatory
3170 qualifier 'add'. Previous theorem names are redeclared for
3173 * Structure "int_ring" is now an abbreviation (previously a
3174 definition). This fits more natural with advanced interpretations.
3179 * The domain package now runs in definitional mode by default: The
3180 former command 'new_domain' is now called 'domain'. To use the domain
3181 package in its original axiomatic mode, use 'domain (unsafe)'.
3184 * The new class "domain" is now the default sort. Class "predomain"
3185 is an unpointed version of "domain". Theories can be updated by
3186 replacing sort annotations as shown below. INCOMPATIBILITY.
3188 'a::type ~> 'a::countable
3189 'a::cpo ~> 'a::predomain
3190 'a::pcpo ~> 'a::domain
3192 * The old type class "rep" has been superseded by class "domain".
3193 Accordingly, users of the definitional package must remove any
3194 "default_sort rep" declarations. INCOMPATIBILITY.
3196 * The domain package (definitional mode) now supports unpointed
3197 predomain argument types, as long as they are marked 'lazy'. (Strict
3198 arguments must be in class "domain".) For example, the following
3199 domain definition now works:
3201 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
3203 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
3204 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
3205 'a option, and 'a list. Additionally, it configures fixrec and the
3206 domain package to work with these types. For example:
3208 fixrec isInl :: "('a + 'b) u -> tr"
3209 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
3211 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
3213 * The "(permissive)" option of fixrec has been replaced with a
3214 per-equation "(unchecked)" option. See
3215 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
3217 * The "bifinite" class no longer fixes a constant "approx"; the class
3218 now just asserts that such a function exists. INCOMPATIBILITY.
3220 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
3221 defines an embedding of type 'a defl into udom by default; instances
3222 of "bifinite" and "domain" classes are available in
3223 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
3225 * The syntax "REP('a)" has been replaced with "DEFL('a)".
3227 * The predicate "directed" has been removed. INCOMPATIBILITY.
3229 * The type class "finite_po" has been removed. INCOMPATIBILITY.
3231 * The function "cprod_map" has been renamed to "prod_map".
3234 * The monadic bind operator on each powerdomain has new binder syntax
3235 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
3236 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
3238 * The infix syntax for binary union on each powerdomain has changed
3239 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
3240 syntax. INCOMPATIBILITY.
3242 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
3243 still supported as an input translation.
3245 * Renamed some theorems (the original names are also still available).
3247 expand_fun_below ~> fun_below_iff
3248 below_fun_ext ~> fun_belowI
3249 expand_cfun_eq ~> cfun_eq_iff
3250 ext_cfun ~> cfun_eqI
3251 expand_cfun_below ~> cfun_below_iff
3252 below_cfun_ext ~> cfun_belowI
3253 cont2cont_Rep_CFun ~> cont2cont_APP
3255 * The Abs and Rep functions for various types have changed names.
3256 Related theorem names have also changed to match. INCOMPATIBILITY.
3258 Rep_CFun ~> Rep_cfun
3259 Abs_CFun ~> Abs_cfun
3260 Rep_Sprod ~> Rep_sprod
3261 Abs_Sprod ~> Abs_sprod
3262 Rep_Ssum ~> Rep_ssum
3263 Abs_Ssum ~> Abs_ssum
3265 * Lemmas with names of the form *_defined_iff or *_strict_iff have
3266 been renamed to *_bottom_iff. INCOMPATIBILITY.
3268 * Various changes to bisimulation/coinduction with domain package:
3270 - Definitions of "bisim" constants no longer mention definedness.
3271 - With mutual recursion, "bisim" predicate is now curried.
3272 - With mutual recursion, each type gets a separate coind theorem.
3273 - Variable names in bisim_def and coinduct rules have changed.
3277 * Case combinators generated by the domain package for type "foo" are
3278 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
3280 * Several theorems have been renamed to more accurately reflect the
3281 names of constants and types involved. INCOMPATIBILITY.
3283 thelub_const ~> lub_const
3284 lub_const ~> is_lub_const
3286 is_lub_lub ~> is_lubD2
3288 unique_lub ~> is_lub_unique
3289 is_ub_lub ~> is_lub_rangeD1
3290 lub_bin_chain ~> is_lub_bin_chain
3291 lub_fun ~> is_lub_fun
3292 thelub_fun ~> lub_fun
3293 thelub_cfun ~> lub_cfun
3294 thelub_Pair ~> lub_Pair
3295 lub_cprod ~> is_lub_prod
3296 thelub_cprod ~> lub_prod
3297 minimal_cprod ~> minimal_prod
3298 inst_cprod_pcpo ~> inst_prod_pcpo
3300 compact_UU ~> compact_bottom
3301 deflation_UU ~> deflation_bottom
3302 finite_deflation_UU ~> finite_deflation_bottom
3304 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
3306 sq_ord_less_eq_trans ~> below_eq_trans
3307 sq_ord_eq_less_trans ~> eq_below_trans
3308 refl_less ~> below_refl
3309 trans_less ~> below_trans
3310 antisym_less ~> below_antisym
3311 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
3312 box_less ~> box_below
3313 rev_trans_less ~> rev_below_trans
3314 not_less2not_eq ~> not_below2not_eq
3315 less_UU_iff ~> below_UU_iff
3316 flat_less_iff ~> flat_below_iff
3317 adm_less ~> adm_below
3318 adm_not_less ~> adm_not_below
3319 adm_compact_not_less ~> adm_compact_not_below
3320 less_fun_def ~> below_fun_def
3321 expand_fun_less ~> fun_below_iff
3322 less_fun_ext ~> fun_belowI
3323 less_discr_def ~> below_discr_def
3324 discr_less_eq ~> discr_below_eq
3325 less_unit_def ~> below_unit_def
3326 less_cprod_def ~> below_prod_def
3327 prod_lessI ~> prod_belowI
3328 Pair_less_iff ~> Pair_below_iff
3329 fst_less_iff ~> fst_below_iff
3330 snd_less_iff ~> snd_below_iff
3331 expand_cfun_less ~> cfun_below_iff
3332 less_cfun_ext ~> cfun_belowI
3333 injection_less ~> injection_below
3334 less_up_def ~> below_up_def
3335 not_Iup_less ~> not_Iup_below
3336 Iup_less ~> Iup_below
3338 Def_inject_less_eq ~> Def_below_Def
3339 Def_less_is_eq ~> Def_below_iff
3340 spair_less_iff ~> spair_below_iff
3341 less_sprod ~> below_sprod
3342 spair_less ~> spair_below
3343 sfst_less_iff ~> sfst_below_iff
3344 ssnd_less_iff ~> ssnd_below_iff
3345 fix_least_less ~> fix_least_below
3346 dist_less_one ~> dist_below_one
3347 less_ONE ~> below_ONE
3348 ONE_less_iff ~> ONE_below_iff
3349 less_sinlD ~> below_sinlD
3350 less_sinrD ~> below_sinrD
3355 * All constant names are now qualified internally and use proper
3356 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
3361 * Antiquotation @{assert} inlines a function bool -> unit that raises
3362 Fail if the argument is false. Due to inlining the source position of
3363 failed assertions is included in the error output.
3365 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
3366 text is in practice always evaluated with a stable theory checkpoint.
3367 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
3369 * Antiquotation @{theory A} refers to theory A from the ancestry of
3370 the current context, not any accidental theory loader state as before.
3371 Potential INCOMPATIBILITY, subtle change in semantics.
3373 * Syntax.pretty_priority (default 0) configures the required priority
3374 of pretty-printed output and thus affects insertion of parentheses.
3376 * Syntax.default_root (default "any") configures the inner syntax
3377 category (nonterminal symbol) for parsing of terms.
3379 * Former exception Library.UnequalLengths now coincides with
3380 ListPair.UnequalLengths.
3382 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
3383 main functionality is provided by structure Simplifier.
3385 * Renamed raw "explode" function to "raw_explode" to emphasize its
3386 meaning. Note that internally to Isabelle, Symbol.explode is used in
3387 almost all situations.
3389 * Discontinued obsolete function sys_error and exception SYS_ERROR.
3390 See implementation manual for further details on exceptions in
3393 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
3396 * Renamed structure PureThy to Pure_Thy and moved most of its
3397 operations to structure Global_Theory, to emphasize that this is
3398 rarely-used global-only stuff.
3400 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
3401 instead (or tracing for high-volume output).
3403 * Configuration option show_question_marks only affects regular pretty
3404 printing of types and terms, not raw Term.string_of_vname.
3406 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
3407 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
3408 @{thms} for most purposes.
3410 * ML structure Unsynchronized is never opened, not even in Isar
3411 interaction mode as before. Old Unsynchronized.set etc. have been
3412 discontinued -- use plain := instead. This should be *rare* anyway,
3413 since modern tools always work via official context data, notably
3414 configuration options.
3416 * Parallel and asynchronous execution requires special care concerning
3417 interrupts. Structure Exn provides some convenience functions that
3418 avoid working directly with raw Interrupt. User code must not absorb
3419 interrupts -- intermediate handling (for cleanup etc.) needs to be
3420 followed by re-raising of the original exception. Another common
3421 source of mistakes are "handle _" patterns, which make the meaning of
3422 the program subject to physical effects of the environment.
3426 New in Isabelle2009-2 (June 2010)
3427 ---------------------------------
3431 * Authentic syntax for *all* logical entities (type classes, type
3432 constructors, term constants): provides simple and robust
3433 correspondence between formal entities and concrete syntax. Within
3434 the parse tree / AST representations, "constants" are decorated by
3435 their category (class, type, const) and spelled out explicitly with
3436 their full internal name.
3438 Substantial INCOMPATIBILITY concerning low-level syntax declarations
3439 and translations (translation rules and translation functions in ML).
3440 Some hints on upgrading:
3442 - Many existing uses of 'syntax' and 'translations' can be replaced
3443 by more modern 'type_notation', 'notation' and 'abbreviation',
3444 which are independent of this issue.
3446 - 'translations' require markup within the AST; the term syntax
3447 provides the following special forms:
3449 CONST c -- produces syntax version of constant c from context
3450 XCONST c -- literally c, checked as constant from context
3451 c -- literally c, if declared by 'syntax'
3453 Plain identifiers are treated as AST variables -- occasionally the
3454 system indicates accidental variables via the error "rhs contains
3457 Type classes and type constructors are marked according to their
3458 concrete syntax. Some old translations rules need to be written
3459 for the "type" category, using type constructor application
3460 instead of pseudo-term application of the default category
3463 - 'parse_translation' etc. in ML may use the following
3466 @{class_syntax c} -- type class c within parse tree / AST
3467 @{term_syntax c} -- type constructor c within parse tree / AST
3468 @{const_syntax c} -- ML version of "CONST c" above
3469 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
3471 - Literal types within 'typed_print_translations', i.e. those *not*
3472 represented as pseudo-terms are represented verbatim. Use @{class
3473 c} or @{type_name c} here instead of the above syntax
3476 Note that old non-authentic syntax was based on unqualified base
3477 names, so all of the above "constant" names would coincide. Recall
3478 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
3479 diagnose syntax problems.
3481 * Type constructors admit general mixfix syntax, not just infix.
3483 * Concrete syntax may be attached to local entities without a proof
3484 body, too. This works via regular mixfix annotations for 'fix',
3485 'def', 'obtain' etc. or via the explicit 'write' command, which is
3486 similar to the 'notation' command in theory specifications.
3488 * Discontinued unnamed infix syntax (legacy feature for many years) --
3489 need to specify constant name and syntax separately. Internal ML
3490 datatype constructors have been renamed from InfixName to Infix etc.
3491 Minor INCOMPATIBILITY.
3493 * Schematic theorem statements need to be explicitly markup as such,
3494 via commands 'schematic_lemma', 'schematic_theorem',
3495 'schematic_corollary'. Thus the relevance of the proof is made
3496 syntactically clear, which impacts performance in a parallel or
3497 asynchronous interactive environment. Minor INCOMPATIBILITY.
3499 * Use of cumulative prems via "!" in some proof methods has been
3500 discontinued (old legacy feature).
3502 * References 'trace_simp' and 'debug_simp' have been replaced by
3503 configuration options stored in the context. Enabling tracing (the
3504 case of debugging is similar) in proofs works via
3506 using [[trace_simp = true]]
3508 Tracing is then active for all invocations of the simplifier in
3509 subsequent goal refinement steps. Tracing may also still be enabled or
3510 disabled via the ProofGeneral settings menu.
3512 * Separate commands 'hide_class', 'hide_type', 'hide_const',
3513 'hide_fact' replace the former 'hide' KIND command. Minor
3516 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
3517 more efficient than combinations with -q1 or -q2.
3522 * Proofterms record type-class reasoning explicitly, using the
3523 "unconstrain" operation internally. This eliminates all sort
3524 constraints from a theorem and proof, introducing explicit
3525 OFCLASS-premises. On the proof term level, this operation is
3526 automatically applied at theorem boundaries, such that closed proofs
3527 are always free of sort constraints. INCOMPATIBILITY for tools that
3528 inspect proof terms.
3530 * Local theory specifications may depend on extra type variables that
3531 are not present in the result type -- arguments TYPE('a) :: 'a itself
3532 are added internally. For example:
3534 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
3536 * Predicates of locales introduced by classes carry a mandatory
3537 "class" prefix. INCOMPATIBILITY.
3539 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
3541 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
3544 * Command 'code_reflect' allows to incorporate generated ML code into
3545 runtime environment; replaces immature code_datatype antiquotation.
3548 * Code generator: simple concept for abstract datatypes obeying
3551 * Code generator: details of internal data cache have no impact on the
3552 user space functionality any longer.
3554 * Methods "unfold_locales" and "intro_locales" ignore non-locale
3555 subgoals. This is more appropriate for interpretations with 'where'.
3558 * Command 'example_proof' opens an empty proof body. This allows to
3559 experiment with Isar, without producing any persistent result.
3561 * Commands 'type_notation' and 'no_type_notation' declare type syntax
3562 within a local theory context, with explicit checking of the
3563 constructors involved (in contrast to the raw 'syntax' versions).
3565 * Commands 'types' and 'typedecl' now work within a local theory
3566 context -- without introducing dependencies on parameters or
3567 assumptions, which is not possible in Isabelle/Pure.
3569 * Command 'defaultsort' has been renamed to 'default_sort', it works
3570 within a local theory context. Minor INCOMPATIBILITY.
3575 * Command 'typedef' now works within a local theory context -- without
3576 introducing dependencies on parameters or assumptions, which is not
3577 possible in Isabelle/Pure/HOL. Note that the logical environment may
3578 contain multiple interpretations of local typedefs (with different
3579 non-emptiness proofs), even in a global theory context.
3581 * New package for quotient types. Commands 'quotient_type' and
3582 'quotient_definition' may be used for defining types and constants by
3583 quotient constructions. An example is the type of integers created by
3584 quotienting pairs of natural numbers:
3587 intrel :: "(nat * nat) => (nat * nat) => bool"
3589 "intrel (x, y) (u, v) = (x + v = u + y)"
3591 quotient_type int = "nat * nat" / intrel
3592 by (auto simp add: equivp_def expand_fun_eq)
3595 "0::int" is "(0::nat, 0::nat)"
3597 The method "lifting" can be used to lift of theorems from the
3598 underlying "raw" type to the quotient type. The example
3599 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
3600 construction and provides a reasoning infrastructure for finite sets.
3602 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
3603 clash with new theory Quotient in Main HOL.
3605 * Moved the SMT binding into the main HOL session, eliminating
3606 separate HOL-SMT session.
3608 * List membership infix mem operation is only an input abbreviation.
3611 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
3612 for future developements; former Library/Word.thy is still present in
3613 the AFP entry RSAPPS.
3615 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
3616 longer shadowed. INCOMPATIBILITY.
3618 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
3621 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
3624 * Dropped normalizing_semiring etc; use the facts in semiring classes
3625 instead. INCOMPATIBILITY.
3627 * Dropped several real-specific versions of lemmas about floor and
3628 ceiling; use the generic lemmas from theory "Archimedean_Field"
3629 instead. INCOMPATIBILITY.
3631 floor_number_of_eq ~> floor_number_of
3632 le_floor_eq_number_of ~> number_of_le_floor
3633 le_floor_eq_zero ~> zero_le_floor
3634 le_floor_eq_one ~> one_le_floor
3635 floor_less_eq_number_of ~> floor_less_number_of
3636 floor_less_eq_zero ~> floor_less_zero
3637 floor_less_eq_one ~> floor_less_one
3638 less_floor_eq_number_of ~> number_of_less_floor
3639 less_floor_eq_zero ~> zero_less_floor
3640 less_floor_eq_one ~> one_less_floor
3641 floor_le_eq_number_of ~> floor_le_number_of
3642 floor_le_eq_zero ~> floor_le_zero
3643 floor_le_eq_one ~> floor_le_one
3644 floor_subtract_number_of ~> floor_diff_number_of
3645 floor_subtract_one ~> floor_diff_one
3646 ceiling_number_of_eq ~> ceiling_number_of
3647 ceiling_le_eq_number_of ~> ceiling_le_number_of
3648 ceiling_le_zero_eq ~> ceiling_le_zero
3649 ceiling_le_eq_one ~> ceiling_le_one
3650 less_ceiling_eq_number_of ~> number_of_less_ceiling
3651 less_ceiling_eq_zero ~> zero_less_ceiling
3652 less_ceiling_eq_one ~> one_less_ceiling
3653 ceiling_less_eq_number_of ~> ceiling_less_number_of
3654 ceiling_less_eq_zero ~> ceiling_less_zero
3655 ceiling_less_eq_one ~> ceiling_less_one
3656 le_ceiling_eq_number_of ~> number_of_le_ceiling
3657 le_ceiling_eq_zero ~> zero_le_ceiling
3658 le_ceiling_eq_one ~> one_le_ceiling
3659 ceiling_subtract_number_of ~> ceiling_diff_number_of
3660 ceiling_subtract_one ~> ceiling_diff_one
3662 * Theory "Finite_Set": various folding_XXX locales facilitate the
3663 application of the various fold combinators on finite sets.
3665 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
3666 provides abstract red-black tree type which is backed by "RBT_Impl" as
3667 implementation. INCOMPATIBILTY.
3669 * Theory Library/Coinductive_List has been removed -- superseded by
3670 AFP/thys/Coinductive.
3672 * Theory PReal, including the type "preal" and related operations, has
3673 been removed. INCOMPATIBILITY.
3675 * Real: new development using Cauchy Sequences.
3677 * Split off theory "Big_Operators" containing setsum, setprod,
3678 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
3680 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
3681 "Int" etc. INCOMPATIBILITY.
3683 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
3685 * New set of rules "ac_simps" provides combined assoc / commute
3686 rewrites for all interpretations of the appropriate generic locales.
3688 * Renamed theory "OrderedGroup" to "Groups" and split theory
3689 "Ring_and_Field" into theories "Rings" and "Fields"; for more
3690 appropriate and more consistent names suitable for name prefixes
3691 within the HOL theories. INCOMPATIBILITY.
3693 * Some generic constants have been put to appropriate theories:
3694 - less_eq, less: Orderings
3695 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
3696 - inverse, divide: Rings
3699 * More consistent naming of type classes involving orderings (and
3702 lower_semilattice ~> semilattice_inf
3703 upper_semilattice ~> semilattice_sup
3705 dense_linear_order ~> dense_linorder
3707 pordered_ab_group_add ~> ordered_ab_group_add
3708 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
3709 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
3710 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
3711 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
3712 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
3713 pordered_cancel_semiring ~> ordered_cancel_semiring
3714 pordered_comm_monoid_add ~> ordered_comm_monoid_add
3715 pordered_comm_ring ~> ordered_comm_ring
3716 pordered_comm_semiring ~> ordered_comm_semiring
3717 pordered_ring ~> ordered_ring
3718 pordered_ring_abs ~> ordered_ring_abs
3719 pordered_semiring ~> ordered_semiring
3721 ordered_ab_group_add ~> linordered_ab_group_add
3722 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
3723 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
3724 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
3725 ordered_field ~> linordered_field
3726 ordered_field_no_lb ~> linordered_field_no_lb
3727 ordered_field_no_ub ~> linordered_field_no_ub
3728 ordered_field_dense_linear_order ~> dense_linordered_field
3729 ordered_idom ~> linordered_idom
3730 ordered_ring ~> linordered_ring
3731 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
3732 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
3733 ordered_ring_strict ~> linordered_ring_strict
3734 ordered_semidom ~> linordered_semidom
3735 ordered_semiring ~> linordered_semiring
3736 ordered_semiring_1 ~> linordered_semiring_1
3737 ordered_semiring_1_strict ~> linordered_semiring_1_strict
3738 ordered_semiring_strict ~> linordered_semiring_strict
3740 The following slightly odd type classes have been moved to a
3741 separate theory Library/Lattice_Algebras:
3743 lordered_ab_group_add ~> lattice_ab_group_add
3744 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
3745 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
3746 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
3747 lordered_ring ~> lattice_ring
3751 * Refined field classes:
3752 - classes division_ring_inverse_zero, field_inverse_zero,
3753 linordered_field_inverse_zero include rule inverse 0 = 0 --
3754 subsumes former division_by_zero class;
3755 - numerous lemmas have been ported from field to division_ring.
3758 * Refined algebra theorem collections:
3759 - dropped theorem group group_simps, use algebra_simps instead;
3760 - dropped theorem group ring_simps, use field_simps instead;
3761 - proper theorem collection field_simps subsumes former theorem
3762 groups field_eq_simps and field_simps;
3763 - dropped lemma eq_minus_self_iff which is a duplicate for
3767 * Theory Finite_Set and List: some lemmas have been generalized from
3770 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
3771 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
3772 inter_Inter_fold_inter ~> inf_Inf_fold_inf
3773 union_Union_fold_union ~> sup_Sup_fold_sup
3774 Inter_fold_inter ~> Inf_fold_inf
3775 Union_fold_union ~> Sup_fold_sup
3776 inter_INTER_fold_inter ~> inf_INFI_fold_inf
3777 union_UNION_fold_union ~> sup_SUPR_fold_sup
3778 INTER_fold_inter ~> INFI_fold_inf
3779 UNION_fold_union ~> SUPR_fold_sup
3781 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
3782 replaced by the more convenient lemmas Inf_empty and Sup_empty.
3783 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
3784 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
3785 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
3786 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
3788 * Reorganized theory Multiset: swapped notation of pointwise and
3791 - pointwise ordering is instance of class order with standard syntax
3793 - multiset ordering has syntax <=# and <#; partial order properties
3794 are provided by means of interpretation with prefix
3796 - less duplication, less historical organization of sections,
3797 conversion from associations lists to multisets, rudimentary code
3799 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
3804 multiset_eq_conv_count_eq ~> multiset_ext_iff
3805 multi_count_ext ~> multiset_ext
3806 diff_union_inverse2 ~> diff_union_cancelR
3810 * Theory Permutation: replaced local "remove" by List.remove1.
3812 * Code generation: ML and OCaml code is decorated with signatures.
3814 * Theory List: added transpose.
3816 * Library/Nat_Bijection.thy is a collection of bijective functions
3817 between nat and other types, which supersedes the older libraries
3818 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
3821 Nat_Int_Bij.nat2_to_nat ~> prod_encode
3822 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
3823 Nat_Int_Bij.int_to_nat_bij ~> int_encode
3824 Nat_Int_Bij.nat_to_int_bij ~> int_decode
3825 Countable.pair_encode ~> prod_encode
3826 NatIso.prod2nat ~> prod_encode
3827 NatIso.nat2prod ~> prod_decode
3828 NatIso.sum2nat ~> sum_encode
3829 NatIso.nat2sum ~> sum_decode
3830 NatIso.list2nat ~> list_encode
3831 NatIso.nat2list ~> list_decode
3832 NatIso.set2nat ~> set_encode
3833 NatIso.nat2set ~> set_decode
3836 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
3837 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
3838 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
3839 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
3840 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
3841 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
3842 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
3843 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
3844 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
3845 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
3846 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
3847 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
3848 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
3851 - Renamed ATP commands:
3852 atp_info ~> sledgehammer running_atps
3853 atp_kill ~> sledgehammer kill_atps
3854 atp_messages ~> sledgehammer messages
3855 atp_minimize ~> sledgehammer minimize
3856 print_atps ~> sledgehammer available_atps
3858 - Added user's manual ("isabelle doc sledgehammer").
3859 - Added option syntax and "sledgehammer_params" to customize
3860 Sledgehammer's behavior. See the manual for details.
3861 - Modified the Isar proof reconstruction code so that it produces
3862 direct proofs rather than proofs by contradiction. (This feature
3863 is still experimental.)
3864 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
3866 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
3869 - Added and implemented "binary_ints" and "bits" options.
3870 - Added "std" option and implemented support for nonstandard models.
3871 - Added and implemented "finitize" option to improve the precision
3872 of infinite datatypes based on a monotonicity analysis.
3873 - Added support for quotient types.
3874 - Added support for "specification" and "ax_specification"
3876 - Added support for local definitions (for "function" and
3877 "termination" proofs).
3878 - Added support for term postprocessors.
3879 - Optimized "Multiset.multiset" and "FinFun.finfun".
3880 - Improved efficiency of "destroy_constrs" optimization.
3881 - Fixed soundness bugs related to "destroy_constrs" optimization and
3883 - Fixed soundness bug related to higher-order constructors.
3884 - Fixed soundness bug when "full_descrs" is enabled.
3885 - Improved precision of set constructs.
3886 - Added "atoms" option.
3887 - Added cache to speed up repeated Kodkod invocations on the same
3889 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
3890 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
3891 "SAT4J_Light". INCOMPATIBILITY.
3892 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
3893 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
3894 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
3896 * Method "induct" now takes instantiations of the form t, where t is not
3897 a variable, as a shorthand for "x == t", where x is a fresh variable.
3898 If this is not intended, t has to be enclosed in parentheses.
3899 By default, the equalities generated by definitional instantiations
3900 are pre-simplified, which may cause parameters of inductive cases
3901 to disappear, or may even delete some of the inductive cases.
3902 Use "induct (no_simp)" instead of "induct" to restore the old
3903 behaviour. The (no_simp) option is also understood by the "cases"
3904 and "nominal_induct" methods, which now perform pre-simplification, too.
3910 * Variable names in lemmas generated by the domain package have
3911 changed; the naming scheme is now consistent with the HOL datatype
3912 package. Some proof scripts may be affected, INCOMPATIBILITY.
3914 * The domain package no longer defines the function "foo_copy" for
3915 recursive domain "foo". The reach lemma is now stated directly in
3916 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
3917 be reformulated in terms of "foo_take", INCOMPATIBILITY.
3919 * Most definedness lemmas generated by the domain package (previously
3920 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
3921 like "foo$x = UU <-> x = UU", which works better as a simp rule.
3922 Proofs that used definedness lemmas as intro rules may break,
3923 potential INCOMPATIBILITY.
3925 * Induction and casedist rules generated by the domain package now
3926 declare proper case_names (one called "bottom", and one named for each
3927 constructor). INCOMPATIBILITY.
3929 * For mutually-recursive domains, separate "reach" and "take_lemma"
3930 rules are generated for each domain, INCOMPATIBILITY.
3932 foo_bar.reach ~> foo.reach bar.reach
3933 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
3935 * Some lemmas generated by the domain package have been renamed for
3936 consistency with the datatype package, INCOMPATIBILITY.
3938 foo.ind ~> foo.induct
3939 foo.finite_ind ~> foo.finite_induct
3940 foo.coind ~> foo.coinduct
3941 foo.casedist ~> foo.exhaust
3942 foo.exhaust ~> foo.nchotomy
3944 * For consistency with other definition packages, the fixrec package
3945 now generates qualified theorem names, INCOMPATIBILITY.
3947 foo_simps ~> foo.simps
3948 foo_unfold ~> foo.unfold
3949 foo_induct ~> foo.induct
3951 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
3952 method and internal fixrec proofs now use the default simpset instead.
3955 * The "contlub" predicate has been removed. Proof scripts should use
3956 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
3958 * The "admw" predicate has been removed, INCOMPATIBILITY.
3960 * The constants cpair, cfst, and csnd have been removed in favor of
3961 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
3966 * Antiquotations for basic formal entities:
3968 @{class NAME} -- type class
3969 @{class_syntax NAME} -- syntax representation of the above
3971 @{type_name NAME} -- logical type
3972 @{type_abbrev NAME} -- type abbreviation
3973 @{nonterminal NAME} -- type of concrete syntactic category
3974 @{type_syntax NAME} -- syntax representation of any of the above
3976 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
3977 @{const_abbrev NAME} -- abbreviated constant
3978 @{const_syntax NAME} -- syntax representation of any of the above
3980 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
3981 syntax constant (cf. 'syntax' command).
3983 * Antiquotation @{make_string} inlines a function to print arbitrary
3984 values similar to the ML toplevel. The result is compiler dependent
3985 and may fall back on "?" in certain situations.
3987 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
3988 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
3989 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
3990 not work with the asynchronous Isar document model.
3992 * Configuration options now admit dynamic default values, depending on
3993 the context or even global references.
3995 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
3996 uses an efficient external library if available (for Poly/ML).
3998 * Renamed some important ML structures, while keeping the old names
3999 for some time as aliases within the structure Legacy:
4001 OuterKeyword ~> Keyword
4004 OuterSyntax ~> Outer_Syntax
4005 PrintMode ~> Print_Mode
4006 SpecParse ~> Parse_Spec
4009 ThyOutput ~> Thy_Output
4010 TypeInfer ~> Type_Infer
4012 Note that "open Legacy" simplifies porting of sources, but forgetting
4013 to remove it again will complicate porting again in the future.
4015 * Most operations that refer to a global context are named
4016 accordingly, e.g. Simplifier.global_context or
4017 ProofContext.init_global. There are some situations where a global
4018 context actually works, but under normal circumstances one needs to
4019 pass the proper local context through the code!
4021 * Discontinued old TheoryDataFun with its copy/init operation -- data
4022 needs to be pure. Functor Theory_Data_PP retains the traditional
4023 Pretty.pp argument to merge, which is absent in the standard
4024 Theory_Data version.
4026 * Sorts.certify_sort and derived "cert" operations for types and terms
4027 no longer minimize sorts. Thus certification at the boundary of the
4028 inference kernel becomes invariant under addition of class relations,
4029 which is an important monotonicity principle. Sorts are now minimized
4030 in the syntax layer only, at the boundary between the end-user and the
4031 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
4032 explicitly in rare situations.
4034 * Renamed old-style Drule.standard to Drule.export_without_context, to
4035 emphasize that this is in no way a standard operation.
4038 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
4039 usual for resolution. Rare INCOMPATIBILITY.
4041 * Renamed varify/unvarify operations to varify_global/unvarify_global
4042 to emphasize that these only work in a global situation (which is
4045 * Curried take and drop in library.ML; negative length is interpreted
4046 as infinity (as in chop). Subtle INCOMPATIBILITY.
4048 * Proof terms: type substitutions on proof constants now use canonical
4049 order of type variables. INCOMPATIBILITY for tools working with proof
4052 * Raw axioms/defs may no longer carry sort constraints, and raw defs
4053 may no longer carry premises. User-level specifications are
4054 transformed accordingly by Thm.add_axiom/add_def.
4059 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
4060 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
4061 proof terms are enabled unconditionally in the new HOL-Proofs image.
4063 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
4064 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
4067 * Old lib/scripts/polyml-platform is superseded by the
4068 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
4069 variant, even on a 64 bit machine. The following example setting
4070 prefers 64 bit if available:
4072 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
4074 * The preliminary Isabelle/jEdit application demonstrates the emerging
4075 Isabelle/Scala layer for advanced prover interaction and integration.
4076 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
4079 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
4080 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
4081 similar to the default assignment of the document preparation system
4082 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
4083 provides some operations for direct access to the font without asking
4084 the user for manual installation.
4088 New in Isabelle2009-1 (December 2009)
4089 -------------------------------------
4093 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
4094 one backslash should be used, even in ML sources.
4099 * Locale interpretation propagates mixins along the locale hierarchy.
4100 The currently only available mixins are the equations used to map
4101 local definitions to terms of the target domain of an interpretation.
4103 * Reactivated diagnostic command 'print_interps'. Use "print_interps
4104 loc" to print all interpretations of locale "loc" in the theory.
4105 Interpretations in proofs are not shown.
4107 * Thoroughly revised locales tutorial. New section on conditional
4110 * On instantiation of classes, remaining undefined class parameters
4111 are formally declared. INCOMPATIBILITY.
4114 *** Document preparation ***
4116 * New generalized style concept for printing terms: @{foo (style) ...}
4117 instead of @{foo_style style ...} (old form is still retained for
4118 backward compatibility). Styles can be also applied for
4119 antiquotations prop, term_type and typeof.
4124 * New proof method "smt" for a combination of first-order logic with
4125 equality, linear and nonlinear (natural/integer/real) arithmetic, and
4126 fixed-size bitvectors; there is also basic support for higher-order
4127 features (esp. lambda abstractions). It is an incomplete decision
4128 procedure based on external SMT solvers using the oracle mechanism;
4129 for the SMT solver Z3, this method is proof-producing. Certificates
4130 are provided to avoid calling the external solvers solely for
4131 re-checking proofs. Due to a remote SMT service there is no need for
4132 installing SMT solvers locally. See src/HOL/SMT.
4134 * New commands to load and prove verification conditions generated by
4135 the Boogie program verifier or derived systems (e.g. the Verifying C
4136 Compiler (VCC) or Spec#). See src/HOL/Boogie.
4138 * New counterexample generator tool 'nitpick' based on the Kodkod
4139 relational model finder. See src/HOL/Tools/Nitpick and
4140 src/HOL/Nitpick_Examples.
4142 * New commands 'code_pred' and 'values' to invoke the predicate
4143 compiler and to enumerate values of inductive predicates.
4145 * A tabled implementation of the reflexive transitive closure.
4147 * New implementation of quickcheck uses generic code generator;
4148 default generators are provided for all suitable HOL types, records
4149 and datatypes. Old quickcheck can be re-activated importing theory
4150 Library/SML_Quickcheck.
4152 * New testing tool Mirabelle for automated proof tools. Applies
4153 several tools and tactics like sledgehammer, metis, or quickcheck, to
4154 every proof step in a theory. To be used in batch mode via the
4155 "mirabelle" utility.
4157 * New proof method "sos" (sum of squares) for nonlinear real
4158 arithmetic (originally due to John Harison). It requires theory
4159 Library/Sum_Of_Squares. It is not a complete decision procedure but
4160 works well in practice on quantifier-free real arithmetic with +, -,
4161 *, ^, =, <= and <, i.e. boolean combinations of equalities and
4162 inequalities between polynomials. It makes use of external
4163 semidefinite programming solvers. Method "sos" generates a
4164 certificate that can be pasted into the proof thus avoiding the need
4165 to call an external tool every time the proof is checked. See
4166 src/HOL/Library/Sum_Of_Squares.
4168 * New method "linarith" invokes existing linear arithmetic decision
4171 * New command 'atp_minimal' reduces result produced by Sledgehammer.
4173 * New Sledgehammer option "Full Types" in Proof General settings menu.
4174 Causes full type information to be output to the ATPs. This slows
4175 ATPs down considerably but eliminates a source of unsound "proofs"
4178 * New method "metisFT": A version of metis that uses full type
4179 information in order to avoid failures of proof reconstruction.
4181 * New evaluator "approximate" approximates an real valued term using
4182 the same method as the approximation method.
4184 * Method "approximate" now supports arithmetic expressions as
4185 boundaries of intervals and implements interval splitting and Taylor
4188 * ML antiquotation @{code_datatype} inserts definition of a datatype
4189 generated by the code generator; e.g. see src/HOL/Predicate.thy.
4191 * New theory SupInf of the supremum and infimum operators for sets of
4194 * New theory Probability, which contains a development of measure
4195 theory, eventually leading to Lebesgue integration and probability.
4197 * Extended Multivariate Analysis to include derivation and Brouwer's
4200 * Reorganization of number theory, INCOMPATIBILITY:
4201 - new number theory development for nat and int, in theories Divides
4202 and GCD as well as in new session Number_Theory
4203 - some constants and facts now suffixed with _nat and _int
4205 - former session NumberTheory now named Old_Number_Theory, including
4206 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
4207 - moved theory Pocklington from src/HOL/Library to
4208 src/HOL/Old_Number_Theory
4210 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
4211 lcm of finite and infinite sets. It is shown that they form a complete
4214 * Class semiring_div requires superclass no_zero_divisors and proof of
4215 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
4216 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
4217 generalized to class semiring_div, subsuming former theorems
4218 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
4219 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
4222 * Refinements to lattice classes and sets:
4223 - less default intro/elim rules in locale variant, more default
4224 intro/elim rules in class variant: more uniformity
4225 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
4227 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
4229 - renamed ACI to inf_sup_aci
4230 - new class "boolean_algebra"
4231 - class "complete_lattice" moved to separate theory
4232 "Complete_Lattice"; corresponding constants (and abbreviations)
4233 renamed and with authentic syntax:
4234 Set.Inf ~> Complete_Lattice.Inf
4235 Set.Sup ~> Complete_Lattice.Sup
4236 Set.INFI ~> Complete_Lattice.INFI
4237 Set.SUPR ~> Complete_Lattice.SUPR
4238 Set.Inter ~> Complete_Lattice.Inter
4239 Set.Union ~> Complete_Lattice.Union
4240 Set.INTER ~> Complete_Lattice.INTER
4241 Set.UNION ~> Complete_Lattice.UNION
4242 - authentic syntax for
4245 - mere abbreviations:
4248 Set.inter (for inf, formerly Set.Int)
4249 Set.union (for sup, formerly Set.Un)
4250 Complete_Lattice.Inter (for Inf)
4251 Complete_Lattice.Union (for Sup)
4252 Complete_Lattice.INTER (for INFI)
4253 Complete_Lattice.UNION (for SUPR)
4254 - object-logic definitions as far as appropriate
4256 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
4257 Un_subset_iff are explicitly deleted as default simp rules; then also
4258 their lattice counterparts le_inf_iff and le_sup_iff have to be
4259 deleted to achieve the desired effect.
4261 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
4262 rules by default any longer; the same applies to min_max.inf_absorb1
4263 etc. INCOMPATIBILITY.
4265 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
4266 pred_set_conv by default. INCOMPATIBILITY.
4268 * Power operations on relations and functions are now one dedicated
4269 constant "compow" with infix syntax "^^". Power operation on
4270 multiplicative monoids retains syntax "^" and is now defined generic
4271 in class power. INCOMPATIBILITY.
4273 * Relation composition "R O S" now has a more standard argument order:
4274 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
4275 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
4276 break, since the O_assoc rule was not rewritten like this. Fix using
4277 O_assoc[symmetric]. The same applies to the curried version "R OO S".
4279 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
4280 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
4283 * Most rules produced by inductive and datatype package have mandatory
4284 prefixes. INCOMPATIBILITY.
4286 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
4287 the attribute of the same name. Each of the theorems in the list
4288 DERIV_intros assumes composition with an additional function and
4289 matches a variable to the derivative, which has to be solved by the
4290 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
4291 of most elementary terms. Former Maclauren.DERIV_tac and
4292 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
4295 * Code generator attributes follow the usual underscore convention:
4296 code_unfold replaces code unfold
4297 code_post replaces code post
4302 sizechange -> size_change
4303 induct_scheme -> induction_schema
4306 * Discontinued abbreviation "arbitrary" of constant "undefined".
4307 INCOMPATIBILITY, use "undefined" directly.
4310 Suc_eq_add_numeral_1 -> Suc_eq_plus1
4311 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
4312 Suc_plus1 -> Suc_eq_plus1
4313 *anti_sym -> *antisym*
4314 vector_less_eq_def -> vector_le_def
4317 * Added theorem List.map_map as [simp]. Removed List.map_compose.
4320 * Removed predicate "M hassize n" (<--> card M = n & finite M).
4326 * Theory Representable defines a class "rep" of domains that are
4327 representable (via an ep-pair) in the universal domain type "udom".
4328 Instances are provided for all type constructors defined in HOLCF.
4330 * The 'new_domain' command is a purely definitional version of the
4331 domain package, for representable domains. Syntax is identical to the
4332 old domain package. The 'new_domain' package also supports indirect
4333 recursion using previously-defined type constructors. See
4334 src/HOLCF/ex/New_Domain.thy for examples.
4336 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
4337 on the left-hand side of an equation, and then performs
4338 simplification. Rewriting is done using rules declared with the
4339 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
4340 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
4342 * The pattern-match compiler in 'fixrec' can now handle constructors
4343 with HOL function types. Pattern-match combinators for the Pair
4344 constructor are pre-configured.
4346 * The 'fixrec' package now produces better fixed-point induction rules
4347 for mutually-recursive definitions: Induction rules have conclusions
4348 of the form "P foo bar" instead of "P <foo, bar>".
4350 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
4351 been renamed to "below". The name "below" now replaces "less" in many
4352 theorem names. (Legacy theorem names using "less" are still supported
4355 * The 'fixrec' package now supports "bottom patterns". Bottom
4356 patterns can be used to generate strictness rules, or to make
4357 functions more strict (much like the bang-patterns supported by the
4358 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
4364 * Support for Poly/ML 5.3.0, with improved reporting of compiler
4365 errors and run-time exceptions, including detailed source positions.
4367 * Structure Name_Space (formerly NameSpace) now manages uniquely
4368 identified entries, with some additional information such as source
4369 position, logical grouping etc.
4371 * Theory and context data is now introduced by the simplified and
4372 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
4373 to be pure, but the old TheoryDataFun for mutable data (with explicit
4374 copy operation) is still available for some time.
4376 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
4377 provides a high-level programming interface to synchronized state
4378 variables with atomic update. This works via pure function
4379 application within a critical section -- its runtime should be as
4380 short as possible; beware of deadlocks if critical code is nested,
4381 either directly or indirectly via other synchronized variables!
4383 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
4384 wraps raw ML references, explicitly indicating their non-thread-safe
4385 behaviour. The Isar toplevel keeps this structure open, to
4386 accommodate Proof General as well as quick and dirty interactive
4387 experiments with references.
4389 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
4390 parallel tactical reasoning.
4392 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
4393 are similar to SUBPROOF, but are slightly more flexible: only the
4394 specified parts of the subgoal are imported into the context, and the
4395 body tactic may introduce new subgoals and schematic variables.
4397 * Old tactical METAHYPS, which does not observe the proof context, has
4398 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
4399 or Subgoal.FOCUS etc.
4401 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
4402 functors have their own ML name space there is no point to mark them
4403 separately.) Minor INCOMPATIBILITY.
4405 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
4407 * Renamed several structures FooBar to Foo_Bar. Occasional,
4410 * Operations of structure Skip_Proof no longer require quick_and_dirty
4411 mode, which avoids critical setmp.
4413 * Eliminated old Attrib.add_attributes, Method.add_methods and related
4414 combinators for "args". INCOMPATIBILITY, need to use simplified
4415 Attrib/Method.setup introduced in Isabelle2009.
4417 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
4418 back on global_simpset_of, global_claset_of, global_clasimpset_of as
4419 last resort. INCOMPATIBILITY.
4421 * Display.pretty_thm now requires a proper context (cf. former
4422 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
4423 or even Display.pretty_thm_without_context as last resort.
4426 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
4427 Syntax.pretty_typ/term directly, preferably with proper context
4428 instead of global theory.
4433 * Further fine tuning of parallel proof checking, scales up to 8 cores
4434 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
4437 * Support for additional "Isabelle components" via etc/components, see
4438 also the system manual.
4440 * The isabelle makeall tool now operates on all components with
4441 IsaMakefile, not just hardwired "logics".
4443 * Removed "compress" option from isabelle-process and isabelle usedir;
4444 this is always enabled.
4446 * Discontinued support for Poly/ML 4.x versions.
4448 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
4449 on a given logic image. This requires the lighttpd webserver and is
4450 currently supported on Linux only.
4454 New in Isabelle2009 (April 2009)
4455 --------------------------------
4459 * Simplified main Isabelle executables, with less surprises on
4460 case-insensitive file-systems (such as Mac OS).
4462 - The main Isabelle tool wrapper is now called "isabelle" instead of
4465 - The former "isabelle" alias for "isabelle-process" has been
4466 removed (should rarely occur to regular users).
4468 - The former "isabelle-interface" and its alias "Isabelle" have been
4469 removed (interfaces are now regular Isabelle tools).
4471 Within scripts and make files, the Isabelle environment variables
4472 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
4473 respectively. (The latter are still available as legacy feature.)
4475 The old isabelle-interface wrapper could react in confusing ways if
4476 the interface was uninstalled or changed otherwise. Individual
4477 interface tool configuration is now more explicit, see also the
4478 Isabelle system manual. In particular, Proof General is now available
4479 via "isabelle emacs".
4481 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
4482 purge installed copies of Isabelle executables and re-run "isabelle
4483 install -p ...", or use symlinks.
4485 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
4486 old ~/isabelle, which was slightly non-standard and apt to cause
4487 surprises on case-insensitive file-systems (such as Mac OS).
4489 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
4490 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
4491 care is required when using older releases of Isabelle. Note that
4492 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
4493 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
4495 * Proofs of fully specified statements are run in parallel on
4496 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
4497 a regular 4-core machine, if the initial heap space is made reasonably
4498 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
4500 * The main reference manuals ("isar-ref", "implementation", and
4501 "system") have been updated and extended. Formally checked references
4502 as hyperlinks are now available uniformly.
4507 * Complete re-implementation of locales. INCOMPATIBILITY in several
4508 respects. The most important changes are listed below. See the
4509 Tutorial on Locales ("locales" manual) for details.
4511 - In locale expressions, instantiation replaces renaming. Parameters
4512 must be declared in a for clause. To aid compatibility with previous
4513 parameter inheritance, in locale declarations, parameters that are not
4514 'touched' (instantiation position "_" or omitted) are implicitly added
4515 with their syntax at the beginning of the for clause.
4517 - Syntax from abbreviations and definitions in locales is available in
4518 locale expressions and context elements. The latter is particularly
4519 useful in locale declarations.
4521 - More flexible mechanisms to qualify names generated by locale
4522 expressions. Qualifiers (prefixes) may be specified in locale
4523 expressions, and can be marked as mandatory (syntax: "name!:") or
4524 optional (syntax "name?:"). The default depends for plain "name:"
4525 depends on the situation where a locale expression is used: in
4526 commands 'locale' and 'sublocale' prefixes are optional, in
4527 'interpretation' and 'interpret' prefixes are mandatory. The old
4528 implicit qualifiers derived from the parameter names of a locale are
4529 no longer generated.
4531 - Command "sublocale l < e" replaces "interpretation l < e". The
4532 instantiation clause in "interpretation" and "interpret" (square
4533 brackets) is no longer available. Use locale expressions.
4535 - When converting proof scripts, mandatory qualifiers in
4536 'interpretation' and 'interpret' should be retained by default, even
4537 if this is an INCOMPATIBILITY compared to former behavior. In the
4538 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
4539 in locale expressions range over a single locale instance only.
4541 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
4542 In existing theorem specifications replace the includes element by the
4543 respective context elements of the included locale, omitting those
4544 that are already present in the theorem specification. Multiple
4545 assume elements of a locale should be replaced by a single one
4546 involving the locale predicate. In the proof body, declarations (most
4547 notably theorems) may be regained by interpreting the respective
4548 locales in the proof context as required (command "interpret").
4550 If using "includes" in replacement of a target solely because the
4551 parameter types in the theorem are not as general as in the target,
4552 consider declaring a new locale with additional type constraints on
4553 the parameters (context element "constrains").
4555 - Discontinued "locale (open)". INCOMPATIBILITY.
4557 - Locale interpretation commands no longer attempt to simplify goal.
4558 INCOMPATIBILITY: in rare situations the generated goal differs. Use
4559 methods intro_locales and unfold_locales to clarify.
4561 - Locale interpretation commands no longer accept interpretation
4562 attributes. INCOMPATIBILITY.
4564 * Class declaration: so-called "base sort" must not be given in import
4565 list any longer, but is inferred from the specification. Particularly
4572 class foo = type + ...
4574 * Class target: global versions of theorems stemming do not carry a
4575 parameter prefix any longer. INCOMPATIBILITY.
4577 * Class 'instance' command no longer accepts attached definitions.
4578 INCOMPATIBILITY, use proper 'instantiation' target instead.
4580 * Recovered hiding of consts, which was accidentally broken in
4581 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
4582 makes c inaccessible; consider using ``hide (open) const c'' instead.
4584 * Slightly more coherent Pure syntax, with updated documentation in
4585 isar-ref manual. Removed locales meta_term_syntax and
4586 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
4587 INCOMPATIBILITY in rare situations. Note that &&& should not be used
4588 directly in regular applications.
4590 * There is a new syntactic category "float_const" for signed decimal
4591 fractions (e.g. 123.45 or -123.45).
4593 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
4594 interface with 'setup' command instead.
4596 * Command 'local_setup' is similar to 'setup', but operates on a local
4599 * The 'axiomatization' command now only works within a global theory
4600 context. INCOMPATIBILITY.
4602 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
4603 hypotheses. Sorts required in the course of reasoning need to be
4604 covered by the constraints in the initial statement, completed by the
4605 type instance information of the background theory. Non-trivial sort
4606 hypotheses, which rarely occur in practice, may be specified via
4607 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
4609 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
4611 The result contains an implicit sort hypotheses as before --
4612 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
4615 * Generalized Isar history, with support for linear undo, direct state
4618 * Changed defaults for unify configuration options:
4620 unify_trace_bound = 50 (formerly 25)
4621 unify_search_bound = 60 (formerly 30)
4623 * Different bookkeeping for code equations (INCOMPATIBILITY):
4625 a) On theory merge, the last set of code equations for a particular
4626 constant is taken (in accordance with the policy applied by other
4627 parts of the code generator framework).
4629 b) Code equations stemming from explicit declarations (e.g. code
4630 attribute) gain priority over default code equations stemming
4631 from definition, primrec, fun etc.
4633 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
4635 * Unified theorem tables for both code generators. Thus [code
4636 func] has disappeared and only [code] remains. INCOMPATIBILITY.
4638 * Command 'find_consts' searches for constants based on type and name
4641 find_consts "_ => bool"
4643 By default, matching is against subtypes, but it may be restricted to
4644 the whole type. Searching by name is possible. Multiple queries are
4645 conjunctive and queries may be negated by prefixing them with a
4648 find_consts strict: "_ => bool" name: "Int" -"int => int"
4650 * New 'find_theorems' criterion "solves" matches theorems that
4651 directly solve the current goal (modulo higher-order unification).
4653 * Auto solve feature for main theorem statements: whenever a new goal
4654 is stated, "find_theorems solves" is called; any theorems that could
4655 solve the lemma directly are listed as part of the goal state.
4656 Cf. associated options in Proof General Isabelle settings menu,
4657 enabled by default, with reasonable timeout for pathological cases of
4658 higher-order unification.
4661 *** Document preparation ***
4663 * Antiquotation @{lemma} now imitates a regular terminal proof,
4664 demanding keyword 'by' and supporting the full method expression
4665 syntax just like the Isar command 'by'.
4670 * Integrated main parts of former image HOL-Complex with HOL. Entry
4671 points Main and Complex_Main remain as before.
4673 * Logic image HOL-Plain provides a minimal HOL with the most important
4674 tools available (inductive, datatype, primrec, ...). This facilitates
4675 experimentation and tool development. Note that user applications
4676 (and library theories) should never refer to anything below theory
4679 * Logic image HOL-Main stops at theory Main, and thus facilitates
4680 experimentation due to shorter build times.
4682 * Logic image HOL-NSA contains theories of nonstandard analysis which
4683 were previously part of former HOL-Complex. Entry point Hyperreal
4684 remains valid, but theories formerly using Complex_Main should now use
4685 new entry point Hypercomplex.
4687 * Generic ATP manager for Sledgehammer, based on ML threads instead of
4688 Posix processes. Avoids potentially expensive forking of the ML
4689 process. New thread-based implementation also works on non-Unix
4690 platforms (Cygwin). Provers are no longer hardwired, but defined
4691 within the theory via plain ML wrapper functions. Basic Sledgehammer
4692 commands are covered in the isar-ref manual.
4694 * Wrapper scripts for remote SystemOnTPTP service allows to use
4695 sledgehammer without local ATP installation (Vampire etc.). Other
4696 provers may be included via suitable ML wrappers, see also
4697 src/HOL/ATP_Linkup.thy.
4699 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
4702 * The metis method no longer fails because the theorem is too trivial
4703 (contains the empty clause).
4705 * The metis method now fails in the usual manner, rather than raising
4706 an exception, if it determines that it cannot prove the theorem.
4708 * Method "coherent" implements a prover for coherent logic (see also
4709 src/Tools/coherent.ML).
4711 * Constants "undefined" and "default" replace "arbitrary". Usually
4712 "undefined" is the right choice to replace "arbitrary", though
4713 logically there is no difference. INCOMPATIBILITY.
4715 * Command "value" now integrates different evaluation mechanisms. The
4716 result of the first successful evaluation mechanism is printed. In
4717 square brackets a particular named evaluation mechanisms may be
4718 specified (currently, [SML], [code] or [nbe]). See further
4719 src/HOL/ex/Eval_Examples.thy.
4721 * Normalization by evaluation now allows non-leftlinear equations.
4722 Declare with attribute [code nbe].
4724 * Methods "case_tac" and "induct_tac" now refer to the very same rules
4725 as the structured Isar versions "cases" and "induct", cf. the
4726 corresponding "cases" and "induct" attributes. Mutual induction rules
4727 are now presented as a list of individual projections
4728 (e.g. foo_bar.inducts for types foo and bar); the old format with
4729 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
4730 rare situations a different rule is selected --- notably nested tuple
4731 elimination instead of former prod.exhaust: use explicit (case_tac t
4732 rule: prod.exhaust) here.
4734 * Attributes "cases", "induct", "coinduct" support "del" option.
4736 * Removed fact "case_split_thm", which duplicates "case_split".
4738 * The option datatype has been moved to a new theory Option. Renamed
4739 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
4741 * New predicate "strict_mono" classifies strict functions on partial
4742 orders. With strict functions on linear orders, reasoning about
4743 (in)equalities is facilitated by theorems "strict_mono_eq",
4744 "strict_mono_less_eq" and "strict_mono_less".
4746 * Some set operations are now proper qualified constants with
4747 authentic syntax. INCOMPATIBILITY:
4758 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
4761 * Auxiliary class "itself" has disappeared -- classes without any
4762 parameter are treated as expected by the 'class' command.
4764 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
4766 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
4767 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
4769 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
4770 method "approximation". It proves formulas on real values by using
4771 interval arithmetic. In the formulas are also the transcendental
4772 functions sin, cos, tan, atan, ln, exp and the constant pi are
4773 allowed. For examples see
4774 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
4776 * Theory "Reflection" now resides in HOL/Library.
4778 * Entry point to Word library now simply named "Word".
4781 * Made source layout more coherent with logical distribution
4784 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
4785 src/HOL/Library/Code_Message.thy ~> src/HOL/
4786 src/HOL/Library/GCD.thy ~> src/HOL/
4787 src/HOL/Library/Order_Relation.thy ~> src/HOL/
4788 src/HOL/Library/Parity.thy ~> src/HOL/
4789 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
4790 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
4791 src/HOL/Real/Lubs.thy ~> src/HOL/
4792 src/HOL/Real/PReal.thy ~> src/HOL/
4793 src/HOL/Real/Rational.thy ~> src/HOL/
4794 src/HOL/Real/RComplete.thy ~> src/HOL/
4795 src/HOL/Real/RealDef.thy ~> src/HOL/
4796 src/HOL/Real/RealPow.thy ~> src/HOL/
4797 src/HOL/Real/Real.thy ~> src/HOL/
4798 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
4799 src/HOL/Complex/Complex.thy ~> src/HOL/
4800 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
4801 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
4802 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
4803 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
4804 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
4805 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
4806 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
4807 src/HOL/Hyperreal/Log.thy ~> src/HOL/
4808 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
4809 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
4810 src/HOL/Hyperreal/Series.thy ~> src/HOL/
4811 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
4812 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
4813 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
4814 src/HOL/Real/Float ~> src/HOL/Library/
4815 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
4816 src/HOL/Real/RealVector.thy ~> src/HOL/
4818 src/HOL/arith_data.ML ~> src/HOL/Tools
4819 src/HOL/hologic.ML ~> src/HOL/Tools
4820 src/HOL/simpdata.ML ~> src/HOL/Tools
4821 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
4822 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
4823 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
4824 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
4825 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
4826 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
4827 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
4829 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
4830 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
4831 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
4832 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
4833 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
4834 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
4836 * If methods "eval" and "evaluation" encounter a structured proof
4837 state with !!/==>, only the conclusion is evaluated to True (if
4838 possible), avoiding strange error messages.
4840 * Method "sizechange" automates termination proofs using (a
4841 modification of) the size-change principle. Requires SAT solver. See
4842 src/HOL/ex/Termination.thy for examples.
4844 * Simplifier: simproc for let expressions now unfolds if bound
4845 variable occurs at most once in let expression body. INCOMPATIBILITY.
4847 * Method "arith": Linear arithmetic now ignores all inequalities when
4848 fast_arith_neq_limit is exceeded, instead of giving up entirely.
4850 * New attribute "arith" for facts that should always be used
4851 automatically by arithmetic. It is intended to be used locally in
4854 assumes [arith]: "x > 0"
4856 Global usage is discouraged because of possible performance impact.
4858 * New classes "top" and "bot" with corresponding operations "top" and
4859 "bot" in theory Orderings; instantiation of class "complete_lattice"
4860 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
4862 * Changed definition lemma "less_fun_def" in order to provide an
4863 instance for preorders on functions; use lemma "less_le" instead.
4866 * Theory Orderings: class "wellorder" moved here, with explicit
4867 induction rule "less_induct" as assumption. For instantiation of
4868 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
4871 * Theory Orderings: added class "preorder" as superclass of "order".
4872 INCOMPATIBILITY: Instantiation proofs for order, linorder
4873 etc. slightly changed. Some theorems named order_class.* now named
4876 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
4879 * Theory Finite_Set: added a new fold combinator of type
4881 ('a => 'b => 'b) => 'b => 'a set => 'b
4883 Occasionally this is more convenient than the old fold combinator
4884 which is now defined in terms of the new one and renamed to
4887 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
4888 and "ring_simps" have been replaced by "algebra_simps" (which can be
4889 extended with further lemmas!). At the moment both still exist but
4890 the former will disappear at some point.
4892 * Theory Power: Lemma power_Suc is now declared as a simp rule in
4893 class recpower. Type-specific simp rules for various recpower types
4894 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
4896 rat_power_0 -> power_0
4897 rat_power_Suc -> power_Suc
4898 realpow_0 -> power_0
4899 realpow_Suc -> power_Suc
4900 complexpow_0 -> power_0
4901 complexpow_Suc -> power_Suc
4902 power_poly_0 -> power_0
4903 power_poly_Suc -> power_Suc
4905 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
4906 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
4907 dvd has been generalized to class comm_semiring_1. Likewise a bunch
4908 of lemmas from Divides has been generalized from nat to class
4909 semiring_div. INCOMPATIBILITY. This involves the following theorem
4910 renames resulting from duplicate elimination:
4912 dvd_def_mod ~> dvd_eq_mod_eq_0
4913 zero_dvd_iff ~> dvd_0_left_iff
4914 dvd_0 ~> dvd_0_right
4915 DIVISION_BY_ZERO_DIV ~> div_by_0
4916 DIVISION_BY_ZERO_MOD ~> mod_by_0
4917 mult_div ~> div_mult_self2_is_id
4918 mult_mod ~> mod_mult_self2_is_0
4920 * Theory IntDiv: removed many lemmas that are instances of class-based
4921 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
4922 rename old lemmas as follows:
4924 dvd_diff -> nat_dvd_diff
4925 dvd_zminus_iff -> dvd_minus_iff
4926 mod_add1_eq -> mod_add_eq
4927 mod_mult1_eq -> mod_mult_right_eq
4928 mod_mult1_eq' -> mod_mult_left_eq
4929 mod_mult_distrib_mod -> mod_mult_eq
4930 nat_mod_add_left_eq -> mod_add_left_eq
4931 nat_mod_add_right_eq -> mod_add_right_eq
4932 nat_mod_div_trivial -> mod_div_trivial
4933 nat_mod_mod_trivial -> mod_mod_trivial
4934 zdiv_zadd_self1 -> div_add_self1
4935 zdiv_zadd_self2 -> div_add_self2
4936 zdiv_zmult_self1 -> div_mult_self2_is_id
4937 zdiv_zmult_self2 -> div_mult_self1_is_id
4938 zdvd_triv_left -> dvd_triv_left
4939 zdvd_triv_right -> dvd_triv_right
4940 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
4941 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
4942 zmod_zadd_left_eq -> mod_add_left_eq
4943 zmod_zadd_right_eq -> mod_add_right_eq
4944 zmod_zadd_self1 -> mod_add_self1
4945 zmod_zadd_self2 -> mod_add_self2
4946 zmod_zadd1_eq -> mod_add_eq
4947 zmod_zdiff1_eq -> mod_diff_eq
4948 zmod_zdvd_zmod -> mod_mod_cancel
4949 zmod_zmod_cancel -> mod_mod_cancel
4950 zmod_zmult_self1 -> mod_mult_self2_is_0
4951 zmod_zmult_self2 -> mod_mult_self1_is_0
4954 zdvd_abs1 -> abs_dvd_iff
4955 zdvd_abs2 -> dvd_abs_iff
4956 zdvd_refl -> dvd_refl
4957 zdvd_trans -> dvd_trans
4958 zdvd_zadd -> dvd_add
4959 zdvd_zdiff -> dvd_diff
4960 zdvd_zminus_iff -> dvd_minus_iff
4961 zdvd_zminus2_iff -> minus_dvd_iff
4962 zdvd_zmultD -> dvd_mult_right
4963 zdvd_zmultD2 -> dvd_mult_left
4964 zdvd_zmult_mono -> mult_dvd_mono
4965 zdvd_0_right -> dvd_0_right
4966 zdvd_0_left -> dvd_0_left_iff
4967 zdvd_1_left -> one_dvd
4968 zminus_dvd_iff -> minus_dvd_iff
4970 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
4972 * The real numbers offer decimal input syntax: 12.34 is translated
4973 into 1234/10^2. This translation is not reversed upon output.
4975 * Theory Library/Polynomial defines an abstract type 'a poly of
4976 univariate polynomials with coefficients of type 'a. In addition to
4977 the standard ring operations, it also supports div and mod. Code
4978 generation is also supported, using list-style constructors.
4980 * Theory Library/Inner_Product defines a class of real_inner for real
4981 inner product spaces, with an overloaded operation inner :: 'a => 'a
4982 => real. Class real_inner is a subclass of real_normed_vector from
4985 * Theory Library/Product_Vector provides instances for the product
4986 type 'a * 'b of several classes from RealVector and Inner_Product.
4987 Definitions of addition, subtraction, scalar multiplication, norms,
4988 and inner products are included.
4990 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
4991 addition to the field operations, numerals and case syntax are also
4994 * Theory Library/Diagonalize provides constructive version of Cantor's
4995 first diagonalization argument.
4997 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
4998 zlcm (for int); carried together from various gcd/lcm developements in
4999 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
5000 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
5001 may recover tupled syntax as follows:
5003 hide (open) const gcd
5004 abbreviation gcd where
5005 "gcd == (%(a, b). GCD.gcd a b)"
5007 GCD.gcd ("gcd '(_, _')")
5009 The same works for lcm, zgcd, zlcm.
5011 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
5012 instantiations for algebraic structures. Removed some duplicate
5013 theorems. Changes in simp rules. INCOMPATIBILITY.
5015 * ML antiquotation @{code} takes a constant as argument and generates
5016 corresponding code in background and inserts name of the corresponding
5017 resulting ML value/function/datatype constructor binding in place.
5018 All occurrences of @{code} with a single ML block are generated
5019 simultaneously. Provides a generic and safe interface for
5020 instrumentalizing code generation. See
5021 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
5022 In future you ought to refrain from ad-hoc compiling generated SML
5023 code on the ML toplevel. Note that (for technical reasons) @{code}
5024 cannot refer to constants for which user-defined serializations are
5025 set. Refer to the corresponding ML counterpart directly in that
5028 * Command 'rep_datatype': instead of theorem names the command now
5029 takes a list of terms denoting the constructors of the type to be
5030 represented as datatype. The characteristic theorems have to be
5031 proven. INCOMPATIBILITY. Also observe that the following theorems
5032 have disappeared in favour of existing ones:
5034 unit_induct ~> unit.induct
5035 prod_induct ~> prod.induct
5036 sum_induct ~> sum.induct
5037 Suc_Suc_eq ~> nat.inject
5038 Suc_not_Zero Zero_not_Suc ~> nat.distinct
5043 * New locales for orders and lattices where the equivalence relation
5044 is not restricted to equality. INCOMPATIBILITY: all order and lattice
5045 locales use a record structure with field eq for the equivalence.
5047 * New theory of factorial domains.
5049 * Units_l_inv and Units_r_inv are now simp rules by default.
5050 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
5051 and/or r_inv will now also require deletion of these lemmas.
5053 * Renamed the following theorems, INCOMPATIBILITY:
5055 UpperD ~> Upper_memD
5056 LowerD ~> Lower_memD
5057 least_carrier ~> least_closed
5058 greatest_carrier ~> greatest_closed
5059 greatest_Lower_above ~> greatest_Lower_below
5060 one_zero ~> carrier_one_zero
5061 one_not_zero ~> carrier_one_not_zero (collision with assumption)
5066 * Nominal datatypes can now contain type-variables.
5068 * Commands 'nominal_inductive' and 'equivariance' work with local
5071 * Nominal primrec can now works with local theory targets and its
5072 specification syntax now conforms to the general format as seen in
5075 * Method "perm_simp" honours the standard simplifier attributes
5076 (no_asm), (no_asm_use) etc.
5078 * The new predicate #* is defined like freshness, except that on the
5079 left hand side can be a set or list of atoms.
5081 * Experimental command 'nominal_inductive2' derives strong induction
5082 principles for inductive definitions. In contrast to
5083 'nominal_inductive', which can only deal with a fixed number of
5084 binders, it can deal with arbitrary expressions standing for sets of
5085 atoms to be avoided. The only inductive definition we have at the
5086 moment that needs this generalisation is the typing rule for Lets in
5089 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
5090 -----------------------------------------------------------------
5091 Gamma |- Let x be t1 in t2 : T2
5093 In this rule one wants to avoid all the binders that are introduced by
5094 "close Gamma T1". We are looking for other examples where this
5095 feature might be useful. Please let us know.
5100 * Reimplemented the simplification procedure for proving continuity
5101 subgoals. The new simproc is extensible; users can declare additional
5102 continuity introduction rules with the attribute [cont2cont].
5104 * The continuity simproc now uses a different introduction rule for
5105 solving continuity subgoals on terms with lambda abstractions. In
5106 some rare cases the new simproc may fail to solve subgoals that the
5107 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
5108 Potential INCOMPATIBILITY.
5110 * Command 'fixrec': specification syntax now conforms to the general
5111 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
5112 examples. INCOMPATIBILITY.
5117 * Proof of Zorn's Lemma for partial orders.
5122 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
5123 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
5124 depends on multithreading, so timouts will not work before Poly/ML
5127 * High-level support for concurrent ML programming, see
5128 src/Pure/Cuncurrent. The data-oriented model of "future values" is
5129 particularly convenient to organize independent functional
5130 computations. The concept of "synchronized variables" provides a
5131 higher-order interface for components with shared state, avoiding the
5132 delicate details of mutexes and condition variables. (Requires
5133 Poly/ML 5.2.1 or later.)
5135 * ML bindings produced via Isar commands are stored within the Isar
5136 context (theory or proof). Consequently, commands like 'use' and 'ML'
5137 become thread-safe and work with undo as expected (concerning
5138 top-level bindings, not side-effects on global references).
5139 INCOMPATIBILITY, need to provide proper Isar context when invoking the
5140 compiler at runtime; really global bindings need to be given outside a
5141 theory. (Requires Poly/ML 5.2 or later.)
5143 * Command 'ML_prf' is analogous to 'ML' but works within a proof
5144 context. Top-level ML bindings are stored within the proof context in
5145 a purely sequential fashion, disregarding the nested proof structure.
5146 ML bindings introduced by 'ML_prf' are discarded at the end of the
5147 proof. (Requires Poly/ML 5.2 or later.)
5149 * Simplified ML attribute and method setup, cf. functions Attrib.setup
5150 and Method.setup, as well as Isar commands 'attribute_setup' and
5151 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
5152 existing code accordingly, or use plain 'setup' together with old
5155 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
5156 to 'a -> thm, while results are always tagged with an authentic oracle
5157 name. The Isar command 'oracle' is now polymorphic, no argument type
5158 is specified. INCOMPATIBILITY, need to simplify existing oracle code
5159 accordingly. Note that extra performance may be gained by producing
5160 the cterm carefully, avoiding slow Thm.cterm_of.
5162 * Simplified interface for defining document antiquotations via
5163 ThyOutput.antiquotation, ThyOutput.output, and optionally
5164 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
5165 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
5168 * More systematic treatment of long names, abstract name bindings, and
5169 name space operations. Basic operations on qualified names have been
5170 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
5171 Long_Name.append. Old type bstring has been mostly replaced by
5172 abstract type binding (see structure Binding), which supports precise
5173 qualification by packages and local theory targets, as well as proper
5174 tracking of source positions. INCOMPATIBILITY, need to wrap old
5175 bstring values into Binding.name, or better pass through abstract
5176 bindings everywhere. See further src/Pure/General/long_name.ML,
5177 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
5179 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
5180 LocalTheory.note etc.) now refer to the *full* internal name, not the
5181 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
5183 * Disposed old type and term read functions (Sign.read_def_typ,
5184 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
5185 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
5186 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
5187 Syntax.read_term_global etc.; see also OldGoals.read_term as last
5188 resort for legacy applications.
5190 * Disposed old declarations, tactics, tactic combinators that refer to
5191 the simpset or claset of an implicit theory (such as Addsimps,
5192 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
5193 embedded ML text, or local_simpset_of with a proper context passed as
5194 explicit runtime argument.
5196 * Rules and tactics that read instantiations (read_instantiate,
5197 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
5198 context, which is required for parsing and type-checking. Moreover,
5199 the variables are specified as plain indexnames, not string encodings
5200 thereof. INCOMPATIBILITY.
5202 * Generic Toplevel.add_hook interface allows to analyze the result of
5203 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
5204 for theorem dependency output of transactions resulting in a new
5207 * ML antiquotations: block-structured compilation context indicated by
5208 \<lbrace> ... \<rbrace>; additional antiquotation forms:
5210 @{binding name} - basic name binding
5211 @{let ?pat = term} - term abbreviation (HO matching)
5212 @{note name = fact} - fact abbreviation
5213 @{thm fact} - singleton fact (with attributes)
5214 @{thms fact} - general fact (with attributes)
5215 @{lemma prop by method} - singleton goal
5216 @{lemma prop by meth1 meth2} - singleton goal
5217 @{lemma prop1 ... propN by method} - general goal
5218 @{lemma prop1 ... propN by meth1 meth2} - general goal
5219 @{lemma (open) ...} - open derivation
5224 * The Isabelle "emacs" tool provides a specific interface to invoke
5225 Proof General / Emacs, with more explicit failure if that is not
5226 installed (the old isabelle-interface script silently falls back on
5227 isabelle-process). The PROOFGENERAL_HOME setting determines the
5228 installation location of the Proof General distribution.
5230 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
5231 the Isabelle process into a JVM/Scala application. See
5232 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
5233 process wrapper has been discontinued.)
5235 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
5237 * Various status messages (with exact source position information) are
5238 emitted, if proper markup print mode is enabled. This allows
5239 user-interface components to provide detailed feedback on internal
5244 New in Isabelle2008 (June 2008)
5245 -------------------------------
5249 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
5250 and updated, with formally checked references as hyperlinks.
5252 * Theory loader: use_thy (and similar operations) no longer set the
5253 implicit ML context, which was occasionally hard to predict and in
5254 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
5255 provides a proper context already.
5257 * Theory loader: old-style ML proof scripts being *attached* to a thy
5258 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
5259 'use' within a theory file will do the job.
5261 * Name space merge now observes canonical order, i.e. the second space
5262 is inserted into the first one, while existing entries in the first
5263 space take precedence. INCOMPATIBILITY in rare situations, may try to
5264 swap theory imports.
5266 * Syntax: symbol \<chi> is now considered a letter. Potential
5267 INCOMPATIBILITY in identifier syntax etc.
5269 * Outer syntax: string tokens no longer admit escaped white space,
5270 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
5271 white space without escapes.
5273 * Outer syntax: string tokens may contain arbitrary character codes
5274 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
5280 * Context-dependent token translations. Default setup reverts locally
5281 fixed variables, and adds hilite markup for undeclared frees.
5283 * Unused theorems can be found using the new command 'unused_thms'.
5284 There are three ways of invoking it:
5287 Only finds unused theorems in the current theory.
5289 (2) unused_thms thy_1 ... thy_n -
5290 Finds unused theorems in the current theory and all of its ancestors,
5291 excluding the theories thy_1 ... thy_n and all of their ancestors.
5293 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
5294 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
5295 their ancestors, excluding the theories thy_1 ... thy_n and all of
5298 In order to increase the readability of the list produced by
5299 unused_thms, theorems that have been created by a particular instance
5300 of a theory command such as 'inductive' or 'function' are considered
5301 to belong to the same "group", meaning that if at least one theorem in
5302 this group is used, the other theorems in the same group are no longer
5303 reported as unused. Moreover, if all theorems in the group are
5304 unused, only one theorem in the group is displayed.
5306 Note that proof objects have to be switched on in order for
5307 unused_thms to work properly (i.e. !proofs must be >= 1, which is
5308 usually the case when using Proof General with the default settings).
5310 * Authentic naming of facts disallows ad-hoc overwriting of previous
5311 theorems within the same name space. INCOMPATIBILITY, need to remove
5312 duplicate fact bindings, or even accidental fact duplications. Note
5313 that tools may maintain dynamically scoped facts systematically, using
5314 PureThy.add_thms_dynamic.
5316 * Command 'hide' now allows to hide from "fact" name space as well.
5318 * Eliminated destructive theorem database, simpset, claset, and
5319 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
5320 update of theories within ML code.
5322 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
5323 INCOMPATIBILITY, object-logics depending on former Pure require
5324 additional setup PureThy.old_appl_syntax_setup; object-logics
5325 depending on former CPure need to refer to Pure.
5327 * Commands 'use' and 'ML' are now purely functional, operating on
5328 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
5329 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
5332 * Command 'setup': discontinued implicit version with ML reference.
5334 * Instantiation target allows for simultaneous specification of class
5335 instance operations together with an instantiation proof.
5336 Type-checking phase allows to refer to class operations uniformly.
5337 See src/HOL/Complex/Complex.thy for an Isar example and
5338 src/HOL/Library/Eval.thy for an ML example.
5340 * Indexing of literal facts: be more serious about including only
5341 facts from the visible specification/proof context, but not the
5342 background context (locale etc.). Affects `prop` notation and method
5343 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
5346 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
5347 "(open)" option, which used to expose internal bound variables to the
5350 * Isar statements: removed obsolete case "rule_context".
5351 INCOMPATIBILITY, better use explicit fixes/assumes.
5353 * Locale proofs: default proof step now includes 'unfold_locales';
5354 hence 'proof' without argument may be used to unfold locale
5358 *** Document preparation ***
5360 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
5361 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
5362 obsolete thumbpdf setup (contemporary PDF viewers do this on the
5363 spot); renamed link color from "darkblue" to "linkcolor" (default
5364 value unchanged, can be redefined via \definecolor); no longer sets
5365 "a4paper" option (unnecessary or even intrusive).
5367 * Antiquotation @{lemma A method} proves proposition A by the given
5368 method (either a method name or a method name plus (optional) method
5369 arguments in parentheses) and prints A just like @{prop A}.
5374 * New primrec package. Specification syntax conforms in style to
5375 definition/function/.... No separate induction rule is provided. The
5376 "primrec" command distinguishes old-style and new-style specifications
5377 by syntax. The former primrec package is now named OldPrimrecPackage.
5378 When adjusting theories, beware: constants stemming from new-style
5379 primrec specifications have authentic syntax.
5381 * Metis prover is now an order of magnitude faster, and also works
5382 with multithreading.
5384 * Metis: the maximum number of clauses that can be produced from a
5385 theorem is now given by the attribute max_clauses. Theorems that
5386 exceed this number are ignored, with a warning printed.
5388 * Sledgehammer no longer produces structured proofs by default. To
5389 enable, declare [[sledgehammer_full = true]]. Attributes
5390 reconstruction_modulus, reconstruction_sorts renamed
5391 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
5393 * Method "induct_scheme" derives user-specified induction rules
5394 from well-founded induction and completeness of patterns. This factors
5395 out some operations that are done internally by the function package
5396 and makes them available separately. See
5397 src/HOL/ex/Induction_Scheme.thy for examples.
5399 * More flexible generation of measure functions for termination
5400 proofs: Measure functions can be declared by proving a rule of the
5401 form "is_measure f" and giving it the [measure_function] attribute.
5402 The "is_measure" predicate is logically meaningless (always true), and
5403 just guides the heuristic. To find suitable measure functions, the
5404 termination prover sets up the goal "is_measure ?f" of the appropriate
5405 type and generates all solutions by prolog-style backwards proof using
5408 This setup also deals with rules like
5410 "is_measure f ==> is_measure (list_size f)"
5412 which accommodates nested datatypes that recurse through lists.
5413 Similar rules are predeclared for products and option types.
5415 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
5419 - Definitions of overloaded constants on sets have to be replaced by
5420 definitions on => and bool.
5422 - Some definitions of overloaded operators on sets can now be proved
5423 using the definitions of the operators on => and bool. Therefore,
5424 the following theorems have been renamed:
5426 subset_def -> subset_eq
5427 psubset_def -> psubset_eq
5428 set_diff_def -> set_diff_eq
5429 Compl_def -> Compl_eq
5430 Sup_set_def -> Sup_set_eq
5431 Inf_set_def -> Inf_set_eq
5432 sup_set_def -> sup_set_eq
5433 inf_set_def -> inf_set_eq
5435 - Due to the incompleteness of the HO unification algorithm, some
5436 rules such as subst may require manual instantiation, if some of
5437 the unknowns in the rule is a set.
5439 - Higher order unification and forward proofs:
5442 have "P (S::'a set)" <...>
5443 then have "EX S. P S" ..
5445 no longer works (due to the incompleteness of the HO unification
5446 algorithm) and must be replaced by the pattern
5453 - Calculational reasoning with subst (or similar rules):
5456 have "P (S::'a set)" <...>
5457 also have "S = T" <...>
5458 finally have "P T" .
5460 no longer works (for similar reasons as the previous example) and
5461 must be replaced by something like
5463 have "P (S::'a set)" <...>
5464 moreover have "S = T" <...>
5465 ultimately have "P T" by simp
5467 - Tactics or packages written in ML code:
5468 Code performing pattern matching on types via
5470 Type ("set", [T]) => ...
5472 must be rewritten. Moreover, functions like strip_type or
5473 binder_types no longer return the right value when applied to a
5476 T1 => ... => Tn => U => bool
5480 T1 => ... => Tn => U set
5482 * Merged theories Wellfounded_Recursion, Accessible_Part and
5483 Wellfounded_Relations to theory Wellfounded.
5485 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
5487 * Class finite no longer treats UNIV as class parameter. Use class
5488 enum from theory Library/Enum instead to achieve a similar effect.
5491 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
5492 and "Cons". INCOMPATIBILITY.
5494 * HOL (and FOL): renamed variables in rules imp_elim and swap.
5495 Potential INCOMPATIBILITY.
5497 * Theory Product_Type: duplicated lemmas split_Pair_apply and
5498 injective_fst_snd removed, use split_eta and prod_eqI instead.
5499 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
5501 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
5502 the same name in theory Orderings:
5512 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
5513 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
5514 and different variable names.
5516 * Library/Option_ord.thy: Canonical order on option type.
5518 * Library/RBT.thy: Red-black trees, an efficient implementation of
5521 * Library/Countable.thy: Type class for countable types.
5523 * Theory Int: The representation of numerals has changed. The infix
5524 operator BIT and the bit datatype with constructors B0 and B1 have
5525 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
5526 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
5527 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
5530 * Theory Nat: definition of <= and < on natural numbers no longer
5531 depend on well-founded relations. INCOMPATIBILITY. Definitions
5532 le_def and less_def have disappeared. Consider lemmas not_less
5533 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
5535 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
5536 (whose purpose mainly is for various fold_set functionals) have been
5537 abandoned in favor of the existing algebraic classes
5538 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
5539 lower_semilattice (resp. upper_semilattice) and linorder.
5542 * Theory Transitive_Closure: induct and cases rules now declare proper
5543 case_names ("base" and "step"). INCOMPATIBILITY.
5545 * Theorem Inductive.lfp_ordinal_induct generalized to complete
5546 lattices. The form set-specific version is available as
5547 Inductive.lfp_ordinal_induct_set.
5549 * Renamed theorems "power.simps" to "power_int.simps".
5552 * Class semiring_div provides basic abstract properties of semirings
5553 with division and modulo operations. Subsumes former class dvd_mod.
5555 * Merged theories IntDef, Numeral and IntArith into unified theory
5556 Int. INCOMPATIBILITY.
5558 * Theory Library/Code_Index: type "index" now represents natural
5559 numbers rather than integers. INCOMPATIBILITY.
5561 * New class "uminus" with operation "uminus" (split of from class
5562 "minus" which now only has operation "minus", binary).
5565 * Constants "card", "internal_split", "option_map" now with authentic
5566 syntax. INCOMPATIBILITY.
5568 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
5569 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
5570 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
5571 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
5572 Sup_set_def, le_def, less_def, option_map_def now with object
5573 equality. INCOMPATIBILITY.
5575 * Records. Removed K_record, and replaced it by pure lambda term
5576 %x. c. The simplifier setup is now more robust against eta expansion.
5577 INCOMPATIBILITY: in cases explicitly referring to K_record.
5579 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
5581 * Library/ListVector: new theory of arithmetic vector operations.
5583 * Library/Order_Relation: new theory of various orderings as sets of
5584 pairs. Defines preorders, partial orders, linear orders and
5585 well-orders on sets and on types.
5590 * Renamed some theories to allow to loading both ZF and HOL in the
5593 Datatype -> Datatype_ZF
5594 Inductive -> Inductive_ZF
5601 INCOMPATIBILITY: ZF theories that import individual theories below
5602 Main might need to be adapted. Regular theory Main is still
5603 available, as trivial extension of Main_ZF.
5608 * ML within Isar: antiquotation @{const name} or @{const
5609 name(typargs)} produces statically-checked Const term.
5611 * Functor NamedThmsFun: data is available to the user as dynamic fact
5612 (of the same name). Removed obsolete print command.
5614 * Removed obsolete "use_legacy_bindings" function.
5616 * The ``print mode'' is now a thread-local value derived from a global
5617 template (the former print_mode reference), thus access becomes
5618 non-critical. The global print_mode reference is for session
5619 management only; user-code should use print_mode_value,
5620 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
5622 * Functions system/system_out provide a robust way to invoke external
5623 shell commands, with propagation of interrupts (requires Poly/ML
5624 5.2.1). Do not use OS.Process.system etc. from the basis library!
5629 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
5630 in accordance with Proof General 3.7, which prefers GNU emacs.
5632 * isatool tty runs Isabelle process with plain tty interaction;
5633 optional line editor may be specified via ISABELLE_LINE_EDITOR
5634 setting, the default settings attempt to locate "ledit" and "rlwrap".
5636 * isatool browser now works with Cygwin as well, using general
5637 "javapath" function defined in Isabelle process environment.
5639 * YXML notation provides a simple and efficient alternative to
5640 standard XML transfer syntax. See src/Pure/General/yxml.ML and
5641 isatool yxml as described in the Isabelle system manual.
5643 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
5644 provides general wrapper for managing an Isabelle process in a robust
5645 fashion, with ``cooked'' output from stdin/stderr.
5647 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
5648 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
5650 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
5651 way of changing the user's settings is via
5652 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
5655 * Multithreading.max_threads := 0 refers to the number of actual CPU
5656 cores of the underlying machine, which is a good starting point for
5657 optimal performance tuning. The corresponding usedir option -M allows
5658 "max" as an alias for "0". WARNING: does not work on certain versions
5659 of Mac OS (with Poly/ML 5.1).
5661 * isabelle-process: non-ML sessions are run with "nice", to reduce the
5662 adverse effect of Isabelle flooding interactive front-ends (notably
5663 ProofGeneral / XEmacs).
5667 New in Isabelle2007 (November 2007)
5668 -----------------------------------
5672 * More uniform information about legacy features, notably a
5673 warning/error of "Legacy feature: ...", depending on the state of the
5674 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
5675 legacy features will disappear eventually.
5677 * Theory syntax: the header format ``theory A = B + C:'' has been
5678 discontinued in favour of ``theory A imports B C begin''. Use isatool
5679 fixheaders to convert existing theory files. INCOMPATIBILITY.
5681 * Theory syntax: the old non-Isar theory file format has been
5682 discontinued altogether. Note that ML proof scripts may still be used
5683 with Isar theories; migration is usually quite simple with the ML
5684 function use_legacy_bindings. INCOMPATIBILITY.
5686 * Theory syntax: some popular names (e.g. 'class', 'declaration',
5687 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
5690 * Theory loader: be more serious about observing the static theory
5691 header specifications (including optional directories), but not the
5692 accidental file locations of previously successful loads. The strict
5693 update policy of former update_thy is now already performed by
5694 use_thy, so the former has been removed; use_thys updates several
5695 theories simultaneously, just as 'imports' within a theory header
5696 specification, but without merging the results. Potential
5697 INCOMPATIBILITY: may need to refine theory headers and commands
5698 ROOT.ML which depend on load order.
5700 * Theory loader: optional support for content-based file
5701 identification, instead of the traditional scheme of full physical
5702 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
5703 (cf. the system manual). The new scheme allows to work with
5704 non-finished theories in persistent session images, such that source
5705 files may be moved later on without requiring reloads.
5707 * Theory loader: old-style ML proof scripts being *attached* to a thy
5708 file (with the same base name as the theory) are considered a legacy
5709 feature, which will disappear eventually. Even now, the theory loader
5710 no longer maintains dependencies on such files.
5712 * Syntax: the scope for resolving ambiguities via type-inference is
5713 now limited to individual terms, instead of whole simultaneous
5714 specifications as before. This greatly reduces the complexity of the
5715 syntax module and improves flexibility by separating parsing and
5716 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
5717 'fixes' etc.) are required in rare situations.
5719 * Syntax: constants introduced by new-style packages ('definition',
5720 'abbreviation' etc.) are passed through the syntax module in
5721 ``authentic mode''. This means that associated mixfix annotations
5722 really stick to such constants, independently of potential name space
5723 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
5724 trees are represented slightly differently, may need to adapt syntax
5725 translations accordingly. Use CONST marker in 'translations' and
5726 @{const_syntax} antiquotation in 'parse_translation' etc.
5728 * Legacy goal package: reduced interface to the bare minimum required
5729 to keep existing proof scripts running. Most other user-level
5730 functions are now part of the OldGoals structure, which is *not* open
5731 by default (consider isatool expandshort before open OldGoals).
5732 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
5733 these tend to cause confusion about the actual goal (!) context being
5734 used here, which is not necessarily the same as the_context().
5736 * Command 'find_theorems': supports "*" wild-card in "name:"
5737 criterion; "with_dups" option. Certain ProofGeneral versions might
5738 support a specific search form (see ProofGeneral/CHANGES).
5740 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
5741 by default, which means that "prems" (and also "fixed variables") are
5742 suppressed from proof state output. Note that the ProofGeneral
5743 settings mechanism allows to change and save options persistently, but
5744 older versions of Isabelle will fail to start up if a negative prems
5747 * Local theory targets may be specified by non-nested blocks of
5748 ``context/locale/class ... begin'' followed by ``end''. The body may
5749 contain definitions, theorems etc., including any derived mechanism
5750 that has been implemented on top of these primitives. This concept
5751 generalizes the existing ``theorem (in ...)'' towards more versatility
5754 * Proof General interface: proper undo of final 'end' command;
5755 discontinued Isabelle/classic mode (ML proof scripts).
5758 *** Document preparation ***
5760 * Added antiquotation @{theory name} which prints the given name,
5761 after checking that it refers to a valid ancestor theory in the
5764 * Added antiquotations @{ML_type text} and @{ML_struct text} which
5765 check the given source text as ML type/structure, printing verbatim.
5767 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
5768 "c args == rhs" given in the current context. (Any number of
5769 arguments may be given on the LHS.)
5774 * The 'class' package offers a combination of axclass and locale to
5775 achieve Haskell-like type classes in Isabelle. Definitions and
5776 theorems within a class context produce both relative results (with
5777 implicit parameters according to the locale context), and polymorphic
5778 constants with qualified polymorphism (according to the class
5779 context). Within the body context of a 'class' target, a separate
5780 syntax layer ("user space type system") takes care of converting
5781 between global polymorphic consts and internal locale representation.
5782 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
5783 "isatool doc classes" provides a tutorial.
5785 * Generic code generator framework allows to generate executable
5786 code for ML and Haskell (including Isabelle classes). A short usage
5789 internal compilation:
5790 export_code <list of constants (term syntax)> in SML
5791 writing SML code to a file:
5792 export_code <list of constants (term syntax)> in SML <filename>
5793 writing OCaml code to a file:
5794 export_code <list of constants (term syntax)> in OCaml <filename>
5795 writing Haskell code to a bunch of files:
5796 export_code <list of constants (term syntax)> in Haskell <filename>
5798 evaluating closed propositions to True/False using code generation:
5801 Reasonable default setup of framework in HOL.
5803 Theorem attributs for selecting and transforming function equations theorems:
5805 [code fun]: select a theorem as function equation for a specific constant
5806 [code fun del]: deselect a theorem as function equation for a specific constant
5807 [code inline]: select an equation theorem for unfolding (inlining) in place
5808 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
5810 User-defined serializations (target in {SML, OCaml, Haskell}):
5812 code_const <and-list of constants (term syntax)>
5813 {(target) <and-list of const target syntax>}+
5815 code_type <and-list of type constructors>
5816 {(target) <and-list of type target syntax>}+
5818 code_instance <and-list of instances>
5820 where instance ::= <type constructor> :: <class>
5822 code_class <and_list of classes>
5823 {(target) <and-list of class target syntax>}+
5824 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
5826 code_instance and code_class only are effective to target Haskell.
5828 For example usage see src/HOL/ex/Codegenerator.thy and
5829 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
5830 generation from Isabelle/HOL theories is available via "isatool doc
5833 * Code generator: consts in 'consts_code' Isar commands are now
5834 referred to by usual term syntax (including optional type
5837 * Command 'no_translations' removes translation rules from theory
5840 * Overloaded definitions are now actually checked for acyclic
5841 dependencies. The overloading scheme is slightly more general than
5842 that of Haskell98, although Isabelle does not demand an exact
5843 correspondence to type class and instance declarations.
5844 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
5845 exotic versions of overloading -- at the discretion of the user!
5847 Polymorphic constants are represented via type arguments, i.e. the
5848 instantiation that matches an instance against the most general
5849 declaration given in the signature. For example, with the declaration
5850 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
5851 as c(nat). Overloading is essentially simultaneous structural
5852 recursion over such type arguments. Incomplete specification patterns
5853 impose global constraints on all occurrences, e.g. c('a * 'a) on the
5854 LHS means that more general c('a * 'b) will be disallowed on any RHS.
5855 Command 'print_theory' outputs the normalized system of recursive
5856 equations, see section "definitions".
5858 * Configuration options are maintained within the theory or proof
5859 context (with name and type bool/int/string), providing a very simple
5860 interface to a poor-man's version of general context data. Tools may
5861 declare options in ML (e.g. using Attrib.config_int) and then refer to
5862 these values using Config.get etc. Users may change options via an
5863 associated attribute of the same name. This form of context
5864 declaration works particularly well with commands 'declare' or
5865 'using', for example ``declare [[foo = 42]]''. Thus it has become
5866 very easy to avoid global references, which would not observe Isar
5867 toplevel undo/redo and fail to work with multithreading.
5869 Various global ML references of Pure and HOL have been turned into
5870 configuration options:
5872 Unify.search_bound unify_search_bound
5873 Unify.trace_bound unify_trace_bound
5874 Unify.trace_simp unify_trace_simp
5875 Unify.trace_types unify_trace_types
5876 Simplifier.simp_depth_limit simp_depth_limit
5877 Blast.depth_limit blast_depth_limit
5878 DatatypeProp.dtK datatype_distinctness_limit
5879 fast_arith_neq_limit fast_arith_neq_limit
5880 fast_arith_split_limit fast_arith_split_limit
5882 * Named collections of theorems may be easily installed as context
5883 data using the functor NamedThmsFun (see also
5884 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
5885 attributes; there is also a toplevel print command. This facility is
5886 just a common case of general context data, which is the preferred way
5887 for anything more complex than just a list of facts in canonical
5890 * Isar: command 'declaration' augments a local theory by generic
5891 declaration functions written in ML. This enables arbitrary content
5892 being added to the context, depending on a morphism that tells the
5893 difference of the original declaration context wrt. the application
5894 context encountered later on.
5896 * Isar: proper interfaces for simplification procedures. Command
5897 'simproc_setup' declares named simprocs (with match patterns, and body
5898 text in ML). Attribute "simproc" adds/deletes simprocs in the current
5899 context. ML antiquotation @{simproc name} retrieves named simprocs.
5901 * Isar: an extra pair of brackets around attribute declarations
5902 abbreviates a theorem reference involving an internal dummy fact,
5903 which will be ignored later --- only the effect of the attribute on
5904 the background context will persist. This form of in-place
5905 declarations is particularly useful with commands like 'declare' and
5906 'using', for example ``have A using [[simproc a]] by simp''.
5908 * Isar: method "assumption" (and implicit closing of subproofs) now
5909 takes simple non-atomic goal assumptions into account: after applying
5910 an assumption as a rule the resulting subgoals are solved by atomic
5911 assumption steps. This is particularly useful to finish 'obtain'
5912 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
5913 without referring to the original premise "!!x. P x ==> thesis" in the
5914 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
5917 * Isar: implicit use of prems from the Isar proof context is
5918 considered a legacy feature. Common applications like ``have A .''
5919 may be replaced by ``have A by fact'' or ``note `A`''. In general,
5920 referencing facts explicitly here improves readability and
5921 maintainability of proof texts.
5923 * Isar: improper proof element 'guess' is like 'obtain', but derives
5924 the obtained context from the course of reasoning! For example:
5926 assume "EX x y. A x & B y" -- "any previous fact"
5927 then guess x and y by clarify
5929 This technique is potentially adventurous, depending on the facts and
5930 proof tools being involved here.
5932 * Isar: known facts from the proof context may be specified as literal
5933 propositions, using ASCII back-quote syntax. This works wherever
5934 named facts used to be allowed so far, in proof commands, proof
5935 methods, attributes etc. Literal facts are retrieved from the context
5936 according to unification of type and term parameters. For example,
5937 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
5938 theorems in the current context, then these are valid literal facts:
5939 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
5941 There is also a proof method "fact" which does the same composition
5942 for explicit goal states, e.g. the following proof texts coincide with
5943 certain special cases of literal facts:
5945 have "A" by fact == note `A`
5946 have "A ==> B" by fact == note `A ==> B`
5947 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
5948 have "P a ==> Q a" by fact == note `P a ==> Q a`
5950 * Isar: ":" (colon) is no longer a symbolic identifier character in
5951 outer syntax. Thus symbolic identifiers may be used without
5952 additional white space in declarations like this: ``assume *: A''.
5954 * Isar: 'print_facts' prints all local facts of the current context,
5955 both named and unnamed ones.
5957 * Isar: 'def' now admits simultaneous definitions, e.g.:
5959 def x == "t" and y == "u"
5961 * Isar: added command 'unfolding', which is structurally similar to
5962 'using', but affects both the goal state and facts by unfolding given
5963 rewrite rules. Thus many occurrences of the 'unfold' method or
5964 'unfolded' attribute may be replaced by first-class proof text.
5966 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
5967 and command 'unfolding' now all support object-level equalities
5968 (potentially conditional). The underlying notion of rewrite rule is
5969 analogous to the 'rule_format' attribute, but *not* that of the
5970 Simplifier (which is usually more generous).
5972 * Isar: the new attribute [rotated n] (default n = 1) rotates the
5973 premises of a theorem by n. Useful in conjunction with drule.
5975 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
5976 method expression within a sandbox consisting of the first N
5977 sub-goals, which need to exist. For example, ``simp_all [3]''
5978 simplifies the first three sub-goals, while (rule foo, simp_all)[]
5979 simplifies all new goals that emerge from applying rule foo to the
5980 originally first one.
5982 * Isar: schematic goals are no longer restricted to higher-order
5983 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
5986 * Isar: the conclusion of a long theorem statement is now either
5987 'shows' (a simultaneous conjunction, as before), or 'obtains'
5988 (essentially a disjunction of cases with local parameters and
5989 assumptions). The latter allows to express general elimination rules
5990 adequately; in this notation common elimination rules look like this:
5992 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
5994 obtains x where "P x"
5996 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
6000 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
6006 The subsequent classical rules even refer to the formal "thesis"
6009 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
6012 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
6013 obtains "thesis ==> something"
6015 The actual proof of an 'obtains' statement is analogous to that of the
6016 Isar proof element 'obtain', only that there may be several cases.
6017 Optional case names may be specified in parentheses; these will be
6018 available both in the present proof and as annotations in the
6019 resulting rule, for later use with the 'cases' method (cf. attribute
6022 * Isar: the assumptions of a long theorem statement are available as
6023 "assms" fact in the proof context. This is more appropriate than the
6024 (historical) "prems", which refers to all assumptions of the current
6025 context, including those from the target locale, proof body etc.
6027 * Isar: 'print_statement' prints theorems from the current theory or
6028 proof context in long statement form, according to the syntax of a
6031 * Isar: 'obtain' takes an optional case name for the local context
6032 introduction rule (default "that").
6034 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
6035 explicit (is "_ ==> ?foo") in the rare cases where this still happens
6038 * Pure: syntax "CONST name" produces a fully internalized constant
6039 according to the current context. This is particularly useful for
6040 syntax translations that should refer to internal constant
6041 representations independently of name spaces.
6043 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
6044 instead of "FOO ". This allows multiple binder declarations to coexist
6045 in the same context. INCOMPATIBILITY.
6047 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
6048 primitive that also works in a locale context (both for constants and
6049 fixed variables). Type declaration and internal syntactic representation
6050 of given constants retrieved from the context. Likewise, the
6051 'no_notation' command allows to remove given syntax annotations from the
6054 * Isar/locales: new derived specification elements 'axiomatization',
6055 'definition', 'abbreviation', which support type-inference, admit
6056 object-level specifications (equality, equivalence). See also the
6057 isar-ref manual. Examples:
6060 eq (infix "===" 50) where
6061 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
6063 definition "f x y = x + y + 1"
6064 definition g where "g x = f x x"
6067 neq (infix "=!=" 50) where
6068 "x =!= y == ~ (x === y)"
6070 These specifications may be also used in a locale context. Then the
6071 constants being introduced depend on certain fixed parameters, and the
6072 constant name is qualified by the locale base name. An internal
6073 abbreviation takes care for convenient input and output, making the
6074 parameters implicit and using the original short name. See also
6075 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
6076 entities from a monomorphic theory.
6078 Presently, abbreviations are only available 'in' a target locale, but
6079 not inherited by general import expressions. Also note that
6080 'abbreviation' may be used as a type-safe replacement for 'syntax' +
6081 'translations' in common applications. The "no_abbrevs" print mode
6082 prevents folding of abbreviations in term output.
6084 Concrete syntax is attached to specified constants in internal form,
6085 independently of name spaces. The parse tree representation is
6086 slightly different -- use 'notation' instead of raw 'syntax', and
6087 'translations' with explicit "CONST" markup to accommodate this.
6089 * Pure/Isar: unified syntax for new-style specification mechanisms
6090 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
6091 full type inference and dummy patterns ("_"). For example:
6093 definition "K x _ = x"
6095 inductive conj for A B
6096 where "A ==> B ==> conj A B"
6098 * Pure: command 'print_abbrevs' prints all constant abbreviations of
6099 the current context. Print mode "no_abbrevs" prevents inversion of
6100 abbreviations on output.
6102 * Isar/locales: improved parameter handling: use of locales "var" and
6103 "struct" no longer necessary; - parameter renamings are no longer
6104 required to be injective. For example, this allows to define
6105 endomorphisms as locale endom = homom mult mult h.
6107 * Isar/locales: changed the way locales with predicates are defined.
6108 Instead of accumulating the specification, the imported expression is
6109 now an interpretation. INCOMPATIBILITY: different normal form of
6110 locale expressions. In particular, in interpretations of locales with
6111 predicates, goals repesenting already interpreted fragments are not
6112 removed automatically. Use methods `intro_locales' and
6113 `unfold_locales'; see below.
6115 * Isar/locales: new methods `intro_locales' and `unfold_locales'
6116 provide backward reasoning on locales predicates. The methods are
6117 aware of interpretations and discharge corresponding goals.
6118 `intro_locales' is less aggressive then `unfold_locales' and does not
6119 unfold predicates to assumptions.
6121 * Isar/locales: the order in which locale fragments are accumulated
6122 has changed. This enables to override declarations from fragments due
6123 to interpretations -- for example, unwanted simp rules.
6125 * Isar/locales: interpretation in theories and proof contexts has been
6126 extended. One may now specify (and prove) equations, which are
6127 unfolded in interpreted theorems. This is useful for replacing
6128 defined concepts (constants depending on locale parameters) by
6129 concepts already existing in the target context. Example:
6131 interpretation partial_order ["op <= :: [int, int] => bool"]
6132 where "partial_order.less (op <=) (x::int) y = (x < y)"
6134 Typically, the constant `partial_order.less' is created by a
6135 definition specification element in the context of locale
6138 * Method "induct": improved internal context management to support
6139 local fixes and defines on-the-fly. Thus explicit meta-level
6140 connectives !! and ==> are rarely required anymore in inductive goals
6141 (using object-logic connectives for this purpose has been long
6142 obsolete anyway). Common proof patterns are explained in
6143 src/HOL/Induct/Common_Patterns.thy, see also
6144 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
6147 * Method "induct": improved handling of simultaneous goals. Instead of
6148 introducing object-level conjunction, the statement is now split into
6149 several conclusions, while the corresponding symbolic cases are nested
6150 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
6151 see src/HOL/Induct/Common_Patterns.thy, for example.
6153 * Method "induct": mutual induction rules are now specified as a list
6154 of rule sharing the same induction cases. HOL packages usually provide
6155 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
6156 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
6157 mutual induction rules differently, i.e. like this:
6159 (induct rule: foo_bar.inducts)
6160 (induct set: foo bar)
6161 (induct pred: foo bar)
6162 (induct type: foo bar)
6164 The ML function ProjectRule.projections turns old-style rules into the
6167 * Method "coinduct": dual of induction, see
6168 src/HOL/Library/Coinductive_List.thy for various examples.
6170 * Method "cases", "induct", "coinduct": the ``(open)'' option is
6171 considered a legacy feature.
6173 * Attribute "symmetric" produces result with standardized schematic
6174 variables (index 0). Potential INCOMPATIBILITY.
6176 * Simplifier: by default the simplifier trace only shows top level
6177 rewrites now. That is, trace_simp_depth_limit is set to 1 by
6178 default. Thus there is less danger of being flooded by the trace. The
6179 trace indicates where parts have been suppressed.
6181 * Provers/classical: removed obsolete classical version of elim_format
6182 attribute; classical elim/dest rules are now treated uniformly when
6183 manipulating the claset.
6185 * Provers/classical: stricter checks to ensure that supplied intro,
6186 dest and elim rules are well-formed; dest and elim rules must have at
6189 * Provers/classical: attributes dest/elim/intro take an optional
6190 weight argument for the rule (just as the Pure versions). Weights are
6191 ignored by automated tools, but determine the search order of single
6194 * Syntax: input syntax now supports dummy variable binding "%_. b",
6195 where the body does not mention the bound variable. Note that dummy
6196 patterns implicitly depend on their context of bounds, which makes
6197 "{_. _}" match any set comprehension as expected. Potential
6198 INCOMPATIBILITY -- parse translations need to cope with syntactic
6199 constant "_idtdummy" in the binding position.
6201 * Syntax: removed obsolete syntactic constant "_K" and its associated
6202 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
6203 for example "A -> B" => "Pi A (%_. B)".
6205 * Pure: 'class_deps' command visualizes the subclass relation, using
6206 the graph browser tool.
6208 * Pure: 'print_theory' now suppresses certain internal declarations by
6209 default; use '!' option for full details.
6214 * Method "metis" proves goals by applying the Metis general-purpose
6215 resolution prover (see also http://gilith.com/software/metis/).
6216 Examples are in the directory MetisExamples. WARNING: the
6217 Isabelle/HOL-Metis integration does not yet work properly with
6220 * Command 'sledgehammer' invokes external automatic theorem provers as
6221 background processes. It generates calls to the "metis" method if
6222 successful. These can be pasted into the proof. Users do not have to
6223 wait for the automatic provers to return. WARNING: does not really
6224 work with multi-threading.
6226 * New "auto_quickcheck" feature tests outermost goal statements for
6227 potential counter-examples. Controlled by ML references
6228 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
6229 5000 milliseconds). Fails silently if statements is outside of
6230 executable fragment, or any other codgenerator problem occurs.
6232 * New constant "undefined" with axiom "undefined x = undefined".
6234 * Added class "HOL.eq", allowing for code generation with polymorphic
6237 * Some renaming of class constants due to canonical name prefixing in
6238 the new 'class' package:
6240 HOL.abs ~> HOL.abs_class.abs
6241 HOL.divide ~> HOL.divide_class.divide
6242 0 ~> HOL.zero_class.zero
6243 1 ~> HOL.one_class.one
6244 op + ~> HOL.plus_class.plus
6245 op - ~> HOL.minus_class.minus
6246 uminus ~> HOL.minus_class.uminus
6247 op * ~> HOL.times_class.times
6248 op < ~> HOL.ord_class.less
6249 op <= > HOL.ord_class.less_eq
6250 Nat.power ~> Power.power_class.power
6251 Nat.size ~> Nat.size_class.size
6252 Numeral.number_of ~> Numeral.number_class.number_of
6253 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
6254 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
6255 Orderings.min ~> Orderings.ord_class.min
6256 Orderings.max ~> Orderings.ord_class.max
6257 Divides.op div ~> Divides.div_class.div
6258 Divides.op mod ~> Divides.div_class.mod
6259 Divides.op dvd ~> Divides.div_class.dvd
6261 INCOMPATIBILITY. Adaptions may be required in the following cases:
6263 a) User-defined constants using any of the names "plus", "minus",
6264 "times", "less" or "less_eq". The standard syntax translations for
6265 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
6268 b) Variables named "plus", "minus", "times", "less", "less_eq"
6269 INCOMPATIBILITY: use more specific names.
6271 c) Permutative equations (e.g. "a + b = b + a")
6272 Since the change of names also changes the order of terms, permutative
6273 rewrite rules may get applied in a different order. Experience shows
6274 that this is rarely the case (only two adaptions in the whole Isabelle
6275 distribution). INCOMPATIBILITY: rewrite proofs
6277 d) ML code directly refering to constant names
6278 This in general only affects hand-written proof tactics, simprocs and
6279 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
6280 Consider using @{const_name} antiquotation.
6282 * New class "default" with associated constant "default".
6284 * Function "sgn" is now overloaded and available on int, real, complex
6285 (and other numeric types), using class "sgn". Two possible defs of
6286 sgn are given as equational assumptions in the classes sgn_if and
6287 sgn_div_norm; ordered_idom now also inherits from sgn_if.
6290 * Locale "partial_order" now unified with class "order" (cf. theory
6291 Orderings), added parameter "less". INCOMPATIBILITY.
6293 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
6294 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
6295 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
6297 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
6298 changed order of proof goals in instance proofs.
6300 * The transitivity reasoner for partial and linear orders is set up
6301 for classes "order" and "linorder". Instances of the reasoner are available
6302 in all contexts importing or interpreting the corresponding locales.
6303 Method "order" invokes the reasoner separately; the reasoner
6304 is also integrated with the Simplifier as a solver. Diagnostic
6305 command 'print_orders' shows the available instances of the reasoner
6306 in the current context.
6308 * Localized monotonicity predicate in theory "Orderings"; integrated
6309 lemmas max_of_mono and min_of_mono with this predicate.
6312 * Formulation of theorem "dense" changed slightly due to integration
6313 with new class dense_linear_order.
6315 * Uniform lattice theory development in HOL.
6317 constants "meet" and "join" now named "inf" and "sup"
6318 constant "Meet" now named "Inf"
6320 classes "meet_semilorder" and "join_semilorder" now named
6321 "lower_semilattice" and "upper_semilattice"
6322 class "lorder" now named "lattice"
6323 class "comp_lat" now named "complete_lattice"
6325 Instantiation of lattice classes allows explicit definitions
6326 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
6328 INCOMPATIBILITY. Theorem renames:
6330 meet_left_le ~> inf_le1
6331 meet_right_le ~> inf_le2
6332 join_left_le ~> sup_ge1
6333 join_right_le ~> sup_ge2
6334 meet_join_le ~> inf_sup_ord
6337 le_meet ~> le_inf_iff
6338 le_join ~> ge_sup_conv
6339 meet_idempotent ~> inf_idem
6340 join_idempotent ~> sup_idem
6341 meet_comm ~> inf_commute
6342 join_comm ~> sup_commute
6343 meet_leI1 ~> le_infI1
6344 meet_leI2 ~> le_infI2
6345 le_joinI1 ~> le_supI1
6346 le_joinI2 ~> le_supI2
6347 meet_assoc ~> inf_assoc
6348 join_assoc ~> sup_assoc
6349 meet_left_comm ~> inf_left_commute
6350 meet_left_idempotent ~> inf_left_idem
6351 join_left_comm ~> sup_left_commute
6352 join_left_idempotent ~> sup_left_idem
6355 le_def_meet ~> le_iff_inf
6356 le_def_join ~> le_iff_sup
6357 join_absorp2 ~> sup_absorb2
6358 join_absorp1 ~> sup_absorb1
6359 meet_absorp1 ~> inf_absorb1
6360 meet_absorp2 ~> inf_absorb2
6361 meet_join_absorp ~> inf_sup_absorb
6362 join_meet_absorp ~> sup_inf_absorb
6363 distrib_join_le ~> distrib_sup_le
6364 distrib_meet_le ~> distrib_inf_le
6366 add_meet_distrib_left ~> add_inf_distrib_left
6367 add_join_distrib_left ~> add_sup_distrib_left
6368 is_join_neg_meet ~> is_join_neg_inf
6369 is_meet_neg_join ~> is_meet_neg_sup
6370 add_meet_distrib_right ~> add_inf_distrib_right
6371 add_join_distrib_right ~> add_sup_distrib_right
6372 add_meet_join_distribs ~> add_sup_inf_distribs
6373 join_eq_neg_meet ~> sup_eq_neg_inf
6374 meet_eq_neg_join ~> inf_eq_neg_sup
6375 add_eq_meet_join ~> add_eq_inf_sup
6376 meet_0_imp_0 ~> inf_0_imp_0
6377 join_0_imp_0 ~> sup_0_imp_0
6378 meet_0_eq_0 ~> inf_0_eq_0
6379 join_0_eq_0 ~> sup_0_eq_0
6380 neg_meet_eq_join ~> neg_inf_eq_sup
6381 neg_join_eq_meet ~> neg_sup_eq_inf
6382 join_eq_if ~> sup_eq_if
6384 mono_meet ~> mono_inf
6385 mono_join ~> mono_sup
6386 meet_bool_eq ~> inf_bool_eq
6387 join_bool_eq ~> sup_bool_eq
6388 meet_fun_eq ~> inf_fun_eq
6389 join_fun_eq ~> sup_fun_eq
6390 meet_set_eq ~> inf_set_eq
6391 join_set_eq ~> sup_set_eq
6392 meet1_iff ~> inf1_iff
6393 meet2_iff ~> inf2_iff
6402 join1_iff ~> sup1_iff
6403 join2_iff ~> sup2_iff
6413 is_meet_Meet ~> is_meet_Inf
6414 Meet_bool_def ~> Inf_bool_def
6415 Meet_fun_def ~> Inf_fun_def
6416 Meet_greatest ~> Inf_greatest
6417 Meet_lower ~> Inf_lower
6418 Meet_set_def ~> Inf_set_def
6421 Sup_bool_eq ~> Sup_bool_def
6422 Sup_fun_eq ~> Sup_fun_def
6423 Sup_set_eq ~> Sup_set_def
6425 listsp_meetI ~> listsp_infI
6426 listsp_meet_eq ~> listsp_inf_eq
6431 * Added syntactic class "size"; overloaded constant "size" now has
6432 type "'a::size ==> bool"
6434 * Internal reorganisation of `size' of datatypes: size theorems
6435 "foo.size" are no longer subsumed by "foo.simps" (but are still
6436 simplification rules by default!); theorems "prod.size" now named
6439 * Class "div" now inherits from class "times" rather than "type".
6442 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
6443 Linorder etc. have disappeared; operations defined in terms of
6444 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
6446 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
6448 * HOL-Word: New extensive library and type for generic, fixed size
6449 machine words, with arithmetic, bit-wise, shifting and rotating
6450 operations, reflection into int, nat, and bool lists, automation for
6451 linear arithmetic (by automatic reflection into nat or int), including
6452 lemmas on overflow and monotonicity. Instantiated to all appropriate
6453 arithmetic type classes, supporting automatic simplification of
6454 numerals on all operations.
6456 * Library/Boolean_Algebra: locales for abstract boolean algebras.
6458 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
6460 * Code generator library theories:
6461 - Code_Integer represents HOL integers by big integer literals in target
6463 - Code_Char represents HOL characters by character literals in target
6465 - Code_Char_chr like Code_Char, but also offers treatment of character
6466 codes; includes Code_Integer.
6467 - Executable_Set allows to generate code for finite sets using lists.
6468 - Executable_Rat implements rational numbers as triples (sign, enumerator,
6470 - Executable_Real implements a subset of real numbers, namly those
6471 representable by rational numbers.
6472 - Efficient_Nat implements natural numbers by integers, which in general will
6473 result in higher efficency; pattern matching with 0/Suc is eliminated;
6474 includes Code_Integer.
6475 - Code_Index provides an additional datatype index which is mapped to
6476 target-language built-in integers.
6477 - Code_Message provides an additional datatype message_string which is isomorphic to
6478 strings; messages are mapped to target-language strings.
6480 * New package for inductive predicates
6482 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
6485 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
6486 for z_1 :: U_1 and ... and z_n :: U_m
6488 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
6491 with full support for type-inference, rather than
6493 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
6495 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
6496 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
6498 inductive "s z_1 ... z_m"
6500 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
6503 For backward compatibility, there is a wrapper allowing inductive
6504 sets to be defined with the new package via
6507 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
6508 for z_1 :: U_1 and ... and z_n :: U_m
6510 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
6516 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
6517 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
6518 for z_1 :: U_1 and ... and z_n :: U_m
6520 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
6521 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
6524 if the additional syntax "p ..." is required.
6526 Numerous examples can be found in the subdirectories src/HOL/Auth,
6527 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
6531 - Since declaration and definition of inductive sets or predicates
6532 is no longer separated, abbreviations involving the newly
6533 introduced sets or predicates must be specified together with the
6534 introduction rules after the 'where' keyword (see above), rather
6535 than before the actual inductive definition.
6537 - The variables in induction and elimination rules are now
6538 quantified in the order of their occurrence in the introduction
6539 rules, rather than in alphabetical order. Since this may break
6540 some proofs, these proofs either have to be repaired, e.g. by
6541 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
6542 statements of the form
6544 case (rule_i a_i_1 ... a_i_{k_i})
6546 or the old order of quantification has to be restored by explicitly adding
6547 meta-level quantifiers in the introduction rules, i.e.
6549 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
6551 - The format of the elimination rules is now
6553 p z_1 ... z_m x_1 ... x_n ==>
6554 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
6559 (x_1, ..., x_n) : s z_1 ... z_m ==>
6560 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
6563 for sets rather than
6565 x : s z_1 ... z_m ==>
6566 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
6569 This may require terms in goals to be expanded to n-tuples
6570 (e.g. using case_tac or simplification with the split_paired_all
6571 rule) before the above elimination rule is applicable.
6573 - The elimination or case analysis rules for (mutually) inductive
6574 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
6575 list of rules "p_1_..._p_k.elims" is no longer available.
6577 * New package "function"/"fun" for general recursive functions,
6578 supporting mutual and nested recursion, definitions in local contexts,
6579 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
6580 for small examples, and the separate tutorial on the function
6581 package. The old recdef "package" is still available as before, but
6582 users are encouraged to use the new package.
6584 * Method "lexicographic_order" automatically synthesizes termination
6585 relations as lexicographic combinations of size measures.
6587 * Case-expressions allow arbitrary constructor-patterns (including
6588 "_") and take their order into account, like in functional
6589 programming. Internally, this is translated into nested
6590 case-expressions; missing cases are added and mapped to the predefined
6591 constant "undefined". In complicated cases printing may no longer show
6592 the original input but the internal form. Lambda-abstractions allow
6593 the same form of pattern matching: "% pat1 => e1 | ..." is an
6594 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
6597 * IntDef: The constant "int :: nat => int" has been removed; now "int"
6598 is an abbreviation for "of_nat :: nat => int". The simplification
6599 rules for "of_nat" have been changed to work like "int" did
6600 previously. Potential INCOMPATIBILITY:
6601 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
6602 - of_nat_diff and of_nat_mult are no longer default simp rules
6604 * Method "algebra" solves polynomial equations over (semi)rings using
6605 Groebner bases. The (semi)ring structure is defined by locales and the
6606 tool setup depends on that generic context. Installing the method for
6607 a specific type involves instantiating the locale and possibly adding
6608 declarations for computation on the coefficients. The method is
6609 already instantiated for natural numbers and for the axiomatic class
6610 of idoms with numerals. See also the paper by Chaieb and Wenzel at
6611 CALCULEMUS 2007 for the general principles underlying this
6612 architecture of context-aware proof-tools.
6614 * Method "ferrack" implements quantifier elimination over
6615 special-purpose dense linear orders using locales (analogous to
6616 "algebra"). The method is already installed for class
6617 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
6620 * Former constant "List.op @" now named "List.append". Use ML
6621 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
6622 circumvent possible incompatibilities when working on ML level.
6624 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
6626 * New function listsum :: 'a list => 'a for arbitrary monoids.
6627 Special syntax: "SUM x <- xs. f x" (and latex variants)
6629 * New syntax for Haskell-like list comprehension (input only), eg.
6630 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
6632 * The special syntax for function "filter" has changed from [x :
6633 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
6634 comprehension syntax, and for uniformity. INCOMPATIBILITY.
6636 * [a..b] is now defined for arbitrary linear orders. It used to be
6637 defined on nat only, as an abbreviation for [a..<Suc b]
6640 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
6642 * New functions "sorted" and "sort" in src/HOL/List.thy.
6644 * New lemma collection field_simps (an extension of ring_simps) for
6645 manipulating (in)equations involving division. Multiplies with all
6646 denominators that can be proved to be non-zero (in equations) or
6647 positive/negative (in inequations).
6649 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
6650 have been improved and renamed to ring_simps, group_simps and
6651 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
6652 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
6654 * Theory Library/Commutative_Ring: switched from recdef to function
6655 package; constants add, mul, pow now curried. Infix syntax for
6656 algebraic operations.
6658 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
6661 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
6664 * HOL/records: generalised field-update to take a function on the
6665 field rather than the new value: r(|A := x|) is translated to A_update
6666 (K x) r The K-combinator that is internally used is called K_record.
6667 INCOMPATIBILITY: Usage of the plain update functions has to be
6670 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
6671 * x = 0, which are required for a semiring. Richer structures do not
6672 inherit from semiring_0 anymore, because this property is a theorem
6673 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
6674 there is more to prove, but this is mostly trivial.
6676 * Class "recpower" is generalized to arbitrary monoids, not just
6677 commutative semirings. INCOMPATIBILITY: may need to incorporate
6678 commutativity or semiring properties additionally.
6680 * Constant "List.list_all2" in List.thy now uses authentic syntax.
6681 INCOMPATIBILITY: translations containing list_all2 may go wrong,
6682 better use 'abbreviation'.
6684 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
6686 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
6687 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
6688 significant changes for setting up numeral syntax for types:
6689 - New constants Numeral.pred and Numeral.succ instead
6690 of former Numeral.bin_pred and Numeral.bin_succ.
6691 - Use integer operations instead of bin_add, bin_mult and so on.
6692 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
6693 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
6695 See src/HOL/Integ/IntArith.thy for an example setup.
6697 * Command 'normal_form' computes the normal form of a term that may
6698 contain free variables. For example ``normal_form "rev [a, b, c]"''
6699 produces ``[b, c, a]'' (without proof). This command is suitable for
6700 heavy-duty computations because the functions are compiled to ML
6701 first. Correspondingly, a method "normalization" is provided. See
6702 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
6704 * Alternative iff syntax "A <-> B" for equality on bool (with priority
6705 25 like -->); output depends on the "iff" print_mode, the default is
6706 "A = B" (with priority 50).
6708 * Relations less (<) and less_eq (<=) are also available on type bool.
6709 Modified syntax to disallow nesting without explicit parentheses,
6710 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
6713 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
6715 * Relation composition operator "op O" now has precedence 75 and binds
6716 stronger than union and intersection. INCOMPATIBILITY.
6718 * The old set interval syntax "{m..n(}" (and relatives) has been
6719 removed. Use "{m..<n}" (and relatives) instead.
6721 * In the context of the assumption "~(s = t)" the Simplifier rewrites
6722 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
6723 ``declare [[simproc del: neq]]''.
6725 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
6728 * Theorem Cons_eq_map_conv no longer declared as "simp".
6730 * Theorem setsum_mult renamed to setsum_right_distrib.
6732 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
6735 * Reimplemented methods "sat" and "satx", with several improvements:
6736 goals no longer need to be stated as "<prems> ==> False", equivalences
6737 (i.e. "=" on type bool) are handled, variable names of the form
6738 "lit_<n>" are no longer reserved, significant speedup.
6740 * Methods "sat" and "satx" can now replay MiniSat proof traces.
6741 zChaff is still supported as well.
6743 * 'inductive' and 'datatype': provide projections of mutual rules,
6744 bundled as foo_bar.inducts;
6746 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
6749 * Library: moved theory Accessible_Part to main HOL.
6751 * Library: added theory Coinductive_List of potentially infinite lists
6752 as greatest fixed-point.
6754 * Library: added theory AssocList which implements (finite) maps as
6757 * Method "evaluation" solves goals (i.e. a boolean expression)
6758 efficiently by compiling it to ML. The goal is "proved" (via an
6759 oracle) if it evaluates to True.
6761 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
6762 also when invoked by the simplifier. This results in the Simplifier
6763 being more powerful on arithmetic goals. INCOMPATIBILITY.
6764 Configuration option fast_arith_split_limit=0 recovers the old
6767 * Support for hex (0x20) and binary (0b1001) numerals.
6769 * New method: reify eqs (t), where eqs are equations for an
6770 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
6771 parameter, computes a term s::'b and a list xs::'a list and proves the
6772 theorem I xs s = t. This is also known as reification or quoting. The
6773 resulting theorem is applied to the subgoal to substitute t with I xs
6774 s. If t is omitted, the subgoal itself is reified.
6776 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
6777 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
6778 where f is supposed to be a computable function (in the sense of code
6779 generattion). The method uses reify to compute s and xs as above then
6780 applies corr_thm and uses normalization by evaluation to "prove" f s =
6781 r and finally gets the theorem t = r, which is again applied to the
6782 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
6784 * Reflection: Automatic reification now handels binding, an example is
6785 available in src/HOL/ex/ReflectionEx.thy
6787 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
6788 command 'statespace' that is similar to 'record', but introduces an
6789 abstract specification based on the locale infrastructure instead of
6790 HOL types. This leads to extra flexibility in composing state spaces,
6791 in particular multiple inheritance and renaming of components.
6796 * Hyperreal: Functions root and sqrt are now defined on negative real
6797 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
6798 Nonnegativity side conditions have been removed from many lemmas, so
6799 that more subgoals may now be solved by simplification; potential
6802 * Real: new type classes formalize real normed vector spaces and
6803 algebras, using new overloaded constants scaleR :: real => 'a => 'a
6804 and norm :: 'a => real.
6806 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
6807 reals into other types. The overloaded constant Reals :: 'a set is now
6808 defined as range of_real; potential INCOMPATIBILITY.
6810 * Real: proper support for ML code generation, including 'quickcheck'.
6811 Reals are implemented as arbitrary precision rationals.
6813 * Hyperreal: Several constants that previously worked only for the
6814 reals have been generalized, so they now work over arbitrary vector
6815 spaces. Type annotations may need to be added in some cases; potential
6818 Infinitesimal :: ('a::real_normed_vector) star set
6819 HFinite :: ('a::real_normed_vector) star set
6820 HInfinite :: ('a::real_normed_vector) star set
6821 approx :: ('a::real_normed_vector) star => 'a star => bool
6822 monad :: ('a::real_normed_vector) star => 'a star set
6823 galaxy :: ('a::real_normed_vector) star => 'a star set
6824 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
6825 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
6826 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
6827 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
6828 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
6829 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
6830 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
6831 sgn :: 'a::real_normed_vector => 'a
6832 exp :: 'a::{recpower,real_normed_field,banach} => 'a
6834 * Complex: Some complex-specific constants are now abbreviations for
6835 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
6836 hnorm. Other constants have been entirely removed in favor of the
6837 polymorphic versions (INCOMPATIBILITY):
6841 HInfinite <-- CInfinite
6842 Infinitesimal <-- CInfinitesimal
6845 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
6846 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
6847 (ns)deriv <-- (ns)cderiv
6852 * Formalisation of ideals and the quotient construction over rings.
6854 * Order and lattice theory no longer based on records.
6857 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
6858 greatest_closed. INCOMPATIBILITY.
6860 * Method algebra is now set up via an attribute. For examples see
6861 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
6862 of algebraic structures.
6864 * Renamed theory CRing to Ring.
6869 * Substantial, yet incomplete support for nominal datatypes (binding
6870 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
6871 src/HOL/Nominal/Examples. Prospective users should consult
6872 http://isabelle.in.tum.de/nominal/
6877 * ML basics: just one true type int, which coincides with IntInf.int
6880 * ML within Isar: antiquotations allow to embed statically-checked
6881 formal entities in the source, referring to the context available at
6882 compile-time. For example:
6884 ML {* @{sort "{zero,one}"} *}
6885 ML {* @{typ "'a => 'b"} *}
6886 ML {* @{term "%x. x"} *}
6887 ML {* @{prop "x == y"} *}
6888 ML {* @{ctyp "'a => 'b"} *}
6889 ML {* @{cterm "%x. x"} *}
6890 ML {* @{cprop "x == y"} *}
6891 ML {* @{thm asm_rl} *}
6892 ML {* @{thms asm_rl} *}
6893 ML {* @{type_name c} *}
6894 ML {* @{type_syntax c} *}
6895 ML {* @{const_name c} *}
6896 ML {* @{const_syntax c} *}
6899 ML {* @{theory Pure} *}
6900 ML {* @{theory_ref} *}
6901 ML {* @{theory_ref Pure} *}
6904 ML {* @{clasimpset} *}
6906 The same works for sources being ``used'' within an Isar context.
6908 * ML in Isar: improved error reporting; extra verbosity with
6909 ML_Context.trace enabled.
6911 * Pure/General/table.ML: the join operations now works via exceptions
6912 DUP/SAME instead of type option. This is simpler in simple cases, and
6913 admits slightly more efficient complex applications.
6915 * Pure: 'advanced' translation functions (parse_translation etc.) now
6916 use Context.generic instead of just theory.
6918 * Pure: datatype Context.generic joins theory/Proof.context and
6919 provides some facilities for code that works in either kind of
6920 context, notably GenericDataFun for uniform theory and proof data.
6922 * Pure: simplified internal attribute type, which is now always
6923 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
6924 local (Proof.context) attributes have been discontinued, while
6925 minimizing code duplication. Thm.rule_attribute and
6926 Thm.declaration_attribute build canonical attributes; see also structure
6927 Context for further operations on Context.generic, notably
6928 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
6929 declarations and definitions.
6931 * Context data interfaces (Theory/Proof/GenericDataFun): removed
6932 name/print, uninitialized data defaults to ad-hoc copy of empty value,
6933 init only required for impure data. INCOMPATIBILITY: empty really need
6934 to be empty (no dependencies on theory content!)
6936 * Pure/kernel: consts certification ignores sort constraints given in
6937 signature declarations. (This information is not relevant to the
6938 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
6939 potential INCOMPATIBILITY.
6941 * Pure: axiomatic type classes are now purely definitional, with
6942 explicit proofs of class axioms and super class relations performed
6943 internally. See Pure/axclass.ML for the main internal interfaces --
6944 notably AxClass.define_class supercedes AxClass.add_axclass, and
6945 AxClass.axiomatize_class/classrel/arity supersede
6946 Sign.add_classes/classrel/arities.
6948 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
6949 global/local versions on theory vs. Proof.context have been
6950 discontinued; Attrib.syntax and Method.syntax have been adapted
6951 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
6952 attributes, methods, etc.
6954 * Pure: several functions of signature "... -> theory -> theory * ..."
6955 have been reoriented to "... -> theory -> ... * theory" in order to
6956 allow natural usage in combination with the ||>, ||>>, |-> and
6957 fold_map combinators.
6959 * Pure: official theorem names (closed derivations) and additional
6960 comments (tags) are now strictly separate. Name hints -- which are
6961 maintained as tags -- may be attached any time without affecting the
6964 * Pure: primitive rule lift_rule now takes goal cterm instead of an
6965 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
6966 achieve the old behaviour.
6968 * Pure: the "Goal" constant is now called "prop", supporting a
6969 slightly more general idea of ``protecting'' meta-level rule
6972 * Pure: Logic.(un)varify only works in a global context, which is now
6973 enforced instead of silently assumed. INCOMPATIBILITY, may use
6974 Logic.legacy_(un)varify as temporary workaround.
6976 * Pure: structure Name provides scalable operations for generating
6977 internal variable names, notably Name.variants etc. This replaces
6978 some popular functions from term.ML:
6980 Term.variant -> Name.variant
6981 Term.variantlist -> Name.variant_list
6982 Term.invent_names -> Name.invent_list
6984 Note that low-level renaming rarely occurs in new code -- operations
6985 from structure Variable are used instead (see below).
6987 * Pure: structure Variable provides fundamental operations for proper
6988 treatment of fixed/schematic variables in a context. For example,
6989 Variable.import introduces fixes for schematics of given facts and
6990 Variable.export reverses the effect (up to renaming) -- this replaces
6991 various freeze_thaw operations.
6993 * Pure: structure Goal provides simple interfaces for
6994 init/conclude/finish and tactical prove operations (replacing former
6995 Tactic.prove). Goal.prove is the canonical way to prove results
6996 within a given context; Goal.prove_global is a degraded version for
6997 theory level goals, including a global Drule.standard. Note that
6998 OldGoals.prove_goalw_cterm has long been obsolete, since it is
6999 ill-behaved in a local proof context (e.g. with local fixes/assumes or
7000 in a locale context).
7002 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
7003 and type checking (Syntax.check_term etc.), with common combinations
7004 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
7005 which are considered legacy and await removal.
7007 * Pure/Syntax: generic interfaces for type unchecking
7008 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
7009 with common combinations (Syntax.pretty_term, Syntax.string_of_term
7010 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
7011 available for convenience, but refer to the very same operations using
7012 a mere theory instead of a full context.
7014 * Isar: simplified treatment of user-level errors, using exception
7015 ERROR of string uniformly. Function error now merely raises ERROR,
7016 without any side effect on output channels. The Isar toplevel takes
7017 care of proper display of ERROR exceptions. ML code may use plain
7018 handle/can/try; cat_error may be used to concatenate errors like this:
7020 ... handle ERROR msg => cat_error msg "..."
7022 Toplevel ML code (run directly or through the Isar toplevel) may be
7023 embedded into the Isar toplevel with exception display/debug like
7026 Isar.toplevel (fn () => ...)
7028 INCOMPATIBILITY, removed special transform_error facilities, removed
7029 obsolete variants of user-level exceptions (ERROR_MESSAGE,
7030 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
7031 -- use plain ERROR instead.
7033 * Isar: theory setup now has type (theory -> theory), instead of a
7034 list. INCOMPATIBILITY, may use #> to compose setup functions.
7036 * Isar: ML toplevel pretty printer for type Proof.context, subject to
7037 ProofContext.debug/verbose flags.
7039 * Isar: Toplevel.theory_to_proof admits transactions that modify the
7040 theory before entering a proof state. Transactions now always see a
7041 quasi-functional intermediate checkpoint, both in interactive and
7044 * Isar: simplified interfaces for outer syntax. Renamed
7045 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
7046 OuterSyntax.add_parsers -- this functionality is now included in
7047 OuterSyntax.command etc. INCOMPATIBILITY.
7049 * Simplifier: the simpset of a running simplification process now
7050 contains a proof context (cf. Simplifier.the_context), which is the
7051 very context that the initial simpset has been retrieved from (by
7052 simpset_of/local_simpset_of). Consequently, all plug-in components
7053 (solver, looper etc.) may depend on arbitrary proof data.
7055 * Simplifier.inherit_context inherits the proof context (plus the
7056 local bounds) of the current simplification process; any simproc
7057 etc. that calls the Simplifier recursively should do this! Removed
7058 former Simplifier.inherit_bounds, which is already included here --
7059 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
7060 specify an explicit context using Simplifier.context/theory_context.
7062 * Simplifier/Classical Reasoner: more abstract interfaces
7063 change_simpset/claset for modifying the simpset/claset reference of a
7064 theory; raw versions simpset/claset_ref etc. have been discontinued --
7067 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
7073 * settings: the default heap location within ISABELLE_HOME_USER now
7074 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
7075 Isabelle installations.
7077 * isabelle-process: option -S (secure mode) disables some critical
7078 operations, notably runtime compilation and evaluation of ML source
7081 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
7083 * Support for parallel execution, using native multicore support of
7084 Poly/ML 5.1. The theory loader exploits parallelism when processing
7085 independent theories, according to the given theory header
7086 specifications. The maximum number of worker threads is specified via
7087 usedir option -M or the "max-threads" setting in Proof General. A
7088 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
7089 to 6 on a 8-core machine. User-code needs to observe certain
7090 guidelines for thread-safe programming, see appendix A in the Isar
7091 Implementation manual.
7095 New in Isabelle2005 (October 2005)
7096 ----------------------------------
7100 * Theory headers: the new header syntax for Isar theories is
7103 imports <theory1> ... <theoryN>
7104 uses <file1> ... <fileM>
7107 where the 'uses' part is optional. The previous syntax
7109 theory <name> = <theory1> + ... + <theoryN>:
7111 will disappear in the next release. Use isatool fixheaders to convert
7112 existing theory files. Note that there is no change in ancient
7113 non-Isar theories now, but these will disappear soon.
7115 * Theory loader: parent theories can now also be referred to via
7116 relative and absolute paths.
7118 * Command 'find_theorems' searches for a list of criteria instead of a
7119 list of constants. Known criteria are: intro, elim, dest, name:string,
7120 simp:term, and any term. Criteria can be preceded by '-' to select
7121 theorems that do not match. Intro, elim, dest select theorems that
7122 match the current goal, name:s selects theorems whose fully qualified
7123 name contain s, and simp:term selects all simplification rules whose
7124 lhs match term. Any other term is interpreted as pattern and selects
7125 all theorems matching the pattern. Available in ProofGeneral under
7126 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
7128 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
7130 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
7131 matching the current goal as introduction rule and not having "HOL."
7132 in their name (i.e. not being defined in theory HOL).
7134 * Command 'thms_containing' has been discontinued in favour of
7135 'find_theorems'; INCOMPATIBILITY.
7137 * Communication with Proof General is now 8bit clean, which means that
7138 Unicode text in UTF-8 encoding may be used within theory texts (both
7139 formal and informal parts). Cf. option -U of the Isabelle Proof
7140 General interface. Here are some simple examples (cf. src/HOL/ex):
7142 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
7143 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
7145 * Improved efficiency of the Simplifier and, to a lesser degree, the
7146 Classical Reasoner. Typical big applications run around 2 times
7150 *** Document preparation ***
7152 * Commands 'display_drafts' and 'print_drafts' perform simple output
7153 of raw sources. Only those symbols that do not require additional
7154 LaTeX packages (depending on comments in isabellesym.sty) are
7155 displayed properly, everything else is left verbatim. isatool display
7156 and isatool print are used as front ends (these are subject to the
7157 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
7159 * Command tags control specific markup of certain regions of text,
7160 notably folding and hiding. Predefined tags include "theory" (for
7161 theory begin and end), "proof" for proof commands, and "ML" for
7162 commands involving ML code; the additional tags "visible" and
7163 "invisible" are unused by default. Users may give explicit tag
7164 specifications in the text, e.g. ''by %invisible (auto)''. The
7165 interpretation of tags is determined by the LaTeX job during document
7166 preparation: see option -V of isatool usedir, or options -n and -t of
7167 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
7170 Several document versions may be produced at the same time via isatool
7171 usedir (the generated index.html will link all of them). Typical
7172 specifications include ''-V document=theory,proof,ML'' to present
7173 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
7174 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
7175 these parts without any formal replacement text. The Isabelle site
7176 default settings produce ''document'' and ''outline'' versions as
7179 * Several new antiquotations:
7181 @{term_type term} prints a term with its type annotated;
7183 @{typeof term} prints the type of a term;
7185 @{const const} is the same as @{term const}, but checks that the
7186 argument is a known logical constant;
7188 @{term_style style term} and @{thm_style style thm} print a term or
7189 theorem applying a "style" to it
7193 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
7194 definitions, equations, inequations etc., 'concl' printing only the
7195 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
7196 to print the specified premise. TermStyle.add_style provides an ML
7197 interface for introducing further styles. See also the "LaTeX Sugar"
7198 document practical applications. The ML antiquotation prints
7199 type-checked ML expressions verbatim.
7201 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
7202 and 'text' support optional locale specification '(in loc)', which
7203 specifies the default context for interpreting antiquotations. For
7204 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
7206 * Option 'locale=NAME' of antiquotations specifies an alternative
7207 context interpreting the subsequent argument. For example: @{thm
7208 [locale=lattice] inf_assoc}.
7210 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
7213 * Proper output of antiquotations for theory commands involving a
7214 proof context (such as 'locale' or 'theorem (in loc) ...').
7216 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
7217 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
7219 * isatool usedir: new option -C (default true) controls whether option
7220 -D should include a copy of the original document directory; -C false
7221 prevents unwanted effects such as copying of administrative CVS data.
7226 * Considerably improved version of 'constdefs' command. Now performs
7227 automatic type-inference of declared constants; additional support for
7228 local structure declarations (cf. locales and HOL records), see also
7229 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
7230 sequential dependencies of definitions within a single 'constdefs'
7231 section; moreover, the declared name needs to be an identifier. If
7232 all fails, consider to fall back on 'consts' and 'defs' separately.
7234 * Improved indexed syntax and implicit structures. First of all,
7235 indexed syntax provides a notational device for subscripted
7236 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
7237 expressions. Secondly, in a local context with structure
7238 declarations, number indexes \<^sub>n or the empty index (default
7239 number 1) refer to a certain fixed variable implicitly; option
7240 show_structs controls printing of implicit structures. Typical
7241 applications of these concepts involve record types and locales.
7243 * New command 'no_syntax' removes grammar declarations (and
7244 translations) resulting from the given syntax specification, which is
7245 interpreted in the same manner as for the 'syntax' command.
7247 * 'Advanced' translation functions (parse_translation etc.) may depend
7248 on the signature of the theory context being presently used for
7249 parsing/printing, see also isar-ref manual.
7251 * Improved 'oracle' command provides a type-safe interface to turn an
7252 ML expression of type theory -> T -> term into a primitive rule of
7253 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
7254 is already included here); see also FOL/ex/IffExample.thy;
7257 * axclass: name space prefix for class "c" is now "c_class" (was "c"
7258 before); "cI" is no longer bound, use "c.intro" instead.
7259 INCOMPATIBILITY. This change avoids clashes of fact bindings for
7260 axclasses vs. locales.
7262 * Improved internal renaming of symbolic identifiers -- attach primes
7263 instead of base 26 numbers.
7265 * New flag show_question_marks controls printing of leading question
7266 marks in schematic variable names.
7268 * In schematic variable names, *any* symbol following \<^isub> or
7269 \<^isup> is now treated as part of the base name. For example, the
7270 following works without printing of awkward ".0" indexes:
7272 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
7275 * Inner syntax includes (*(*nested*) comments*).
7277 * Pretty printer now supports unbreakable blocks, specified in mixfix
7278 annotations as "(00...)".
7280 * Clear separation of logical types and nonterminals, where the latter
7281 may only occur in 'syntax' specifications or type abbreviations.
7282 Before that distinction was only partially implemented via type class
7283 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
7284 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
7285 exotic syntax specifications may require further adaption
7286 (e.g. Cube/Cube.thy).
7288 * Removed obsolete type class "logic", use the top sort {} instead.
7289 Note that non-logical types should be declared as 'nonterminals'
7290 rather than 'types'. INCOMPATIBILITY for new object-logic
7293 * Attributes 'induct' and 'cases': type or set names may now be
7294 locally fixed variables as well.
7296 * Simplifier: can now control the depth to which conditional rewriting
7297 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
7300 * Simplifier: simplification procedures may now take the current
7301 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
7302 interface), which is very useful for calling the Simplifier
7303 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
7304 is gone -- use prems_of_ss on the simpset instead. Moreover, the
7305 low-level mk_simproc no longer applies Logic.varify internally, to
7306 allow for use in a context of fixed variables.
7308 * thin_tac now works even if the assumption being deleted contains !!
7309 or ==>. More generally, erule now works even if the major premise of
7310 the elimination rule contains !! or ==>.
7312 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
7314 * Reorganized bootstrapping of the Pure theories; CPure is now derived
7315 from Pure, which contains all common declarations already. Both
7316 theories are defined via plain Isabelle/Isar .thy files.
7317 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
7318 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
7319 use isatool fixcpure to adapt your theory and ML sources.
7321 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
7322 selections of theorems in named facts via index ranges.
7324 * 'print_theorems': in theory mode, really print the difference
7325 wrt. the last state (works for interactive theory development only),
7326 in proof mode print all local facts (cf. 'print_facts');
7328 * 'hide': option '(open)' hides only base names.
7330 * More efficient treatment of intermediate checkpoints in interactive
7333 * Code generator is now invoked via code_module (incremental code
7334 generation) and code_library (modular code generation, ML structures
7335 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
7336 must be quoted when used as identifiers.
7338 * New 'value' command for reading, evaluating and printing terms using
7339 the code generator. INCOMPATIBILITY: command keyword 'value' must be
7340 quoted when used as identifier.
7345 * New commands for the interpretation of locale expressions in
7346 theories (1), locales (2) and proof contexts (3). These generate
7347 proof obligations from the expression specification. After the
7348 obligations have been discharged, theorems of the expression are added
7349 to the theory, target locale or proof context. The synopsis of the
7350 commands is a follows:
7352 (1) interpretation expr inst
7353 (2) interpretation target < expr
7354 (3) interpret expr inst
7356 Interpretation in theories and proof contexts require a parameter
7357 instantiation of terms from the current context. This is applied to
7358 specifications and theorems of the interpreted expression.
7359 Interpretation in locales only permits parameter renaming through the
7360 locale expression. Interpretation is smart in that interpretations
7361 that are active already do not occur in proof obligations, neither are
7362 instantiated theorems stored in duplicate. Use 'print_interps' to
7363 inspect active interpretations of a particular locale. For details,
7364 see the Isar Reference manual. Examples can be found in
7365 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
7367 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
7368 'interpret' instead.
7370 * New context element 'constrains' for adding type constraints to
7373 * Context expressions: renaming of parameters with syntax
7376 * Locale declaration: 'includes' disallowed.
7378 * Proper static binding of attribute syntax -- i.e. types / terms /
7379 facts mentioned as arguments are always those of the locale definition
7380 context, independently of the context of later invocations. Moreover,
7381 locale operations (renaming and type / term instantiation) are applied
7382 to attribute arguments as expected.
7384 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
7385 actual attributes; rare situations may require Attrib.attribute to
7386 embed those attributes into Attrib.src that lack concrete syntax.
7387 Attribute implementations need to cooperate properly with the static
7388 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
7389 Attrib.XXX_thm etc. already do the right thing without further
7390 intervention. Only unusual applications -- such as "where" or "of"
7391 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
7392 on the context and the facts involved -- may have to assign parsed
7393 values to argument tokens explicitly.
7395 * Changed parameter management in theorem generation for long goal
7396 statements with 'includes'. INCOMPATIBILITY: produces a different
7397 theorem statement in rare situations.
7399 * Locale inspection command 'print_locale' omits notes elements. Use
7400 'print_locale!' to have them included in the output.
7405 * Provers/hypsubst.ML: improved version of the subst method, for
7406 single-step rewriting: it now works in bound variable contexts. New is
7407 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
7408 rewrite a different subterm than the original subst method, which is
7409 still available as 'simplesubst'.
7411 * Provers/quasi.ML: new transitivity reasoners for transitivity only
7414 * Provers/trancl.ML: new transitivity reasoner for transitive and
7415 reflexive-transitive closure of relations.
7417 * Provers/blast.ML: new reference depth_limit to make blast's depth
7418 limit (previously hard-coded with a value of 20) user-definable.
7420 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
7421 is peformed already. Object-logics merely need to finish their
7422 initial simpset configuration as before. INCOMPATIBILITY.
7427 * Symbolic syntax of Hilbert Choice Operator is now as follows:
7430 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
7432 The symbol \<some> is displayed as the alternative epsilon of LaTeX
7433 and x-symbol; use option '-m epsilon' to get it actually printed.
7434 Moreover, the mathematically important symbolic identifier \<epsilon>
7435 becomes available as variable, constant etc. INCOMPATIBILITY,
7437 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
7438 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
7439 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
7440 support corresponding Isar calculations.
7442 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
7445 * theory SetInterval: changed the syntax for open intervals:
7454 The old syntax is still supported but will disappear in the next
7455 release. For conversion use the following Emacs search and replace
7456 patterns (these are not perfect but work quite well):
7458 {)\([^\.]*\)\.\. -> {\1<\.\.}
7459 \.\.\([^(}]*\)(} -> \.\.<\1}
7461 * Theory Commutative_Ring (in Library): method comm_ring for proving
7462 equalities in commutative rings; method 'algebra' provides a generic
7465 * Theory Finite_Set: changed the syntax for 'setsum', summation over
7466 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
7467 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
7470 Some new syntax forms are available:
7472 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
7473 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
7474 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
7475 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
7477 The latter form "\<Sum>x < k. e" used to be based on a separate
7478 function "Summation", which has been discontinued.
7480 * theory Finite_Set: in structured induction proofs, the insert case
7481 is now 'case (insert x F)' instead of the old counterintuitive 'case
7484 * The 'refute' command has been extended to support a much larger
7485 fragment of HOL, including axiomatic type classes, constdefs and
7486 typedefs, inductive datatypes and recursion.
7488 * New tactics 'sat' and 'satx' to prove propositional tautologies.
7489 Requires zChaff with proof generation to be installed. See
7490 HOL/ex/SAT_Examples.thy for examples.
7492 * Datatype induction via method 'induct' now preserves the name of the
7493 induction variable. For example, when proving P(xs::'a list) by
7494 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
7495 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
7496 in unstructured proof scripts.
7498 * Reworked implementation of records. Improved scalability for
7499 records with many fields, avoiding performance problems for type
7500 inference. Records are no longer composed of nested field types, but
7501 of nested extension types. Therefore the record type only grows linear
7502 in the number of extensions and not in the number of fields. The
7503 top-level (users) view on records is preserved. Potential
7504 INCOMPATIBILITY only in strange cases, where the theory depends on the
7505 old record representation. The type generated for a record is called
7506 <record_name>_ext_type.
7508 Flag record_quick_and_dirty_sensitive can be enabled to skip the
7509 proofs triggered by a record definition or a simproc (if
7510 quick_and_dirty is enabled). Definitions of large records can take
7513 New simproc record_upd_simproc for simplification of multiple record
7514 updates enabled by default. Moreover, trivial updates are also
7515 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
7516 occasionally, since simplification is more powerful by default.
7518 * typedef: proper support for polymorphic sets, which contain extra
7519 type-variables in the term.
7521 * Simplifier: automatically reasons about transitivity chains
7522 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
7523 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
7524 old proofs break occasionally as simplification may now solve more
7525 goals than previously.
7527 * Simplifier: converts x <= y into x = y if assumption y <= x is
7528 present. Works for all partial orders (class "order"), in particular
7529 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
7532 * Simplifier: new simproc for "let x = a in f x". If a is a free or
7533 bound variable or a constant then the let is unfolded. Otherwise
7534 first a is simplified to b, and then f b is simplified to g. If
7535 possible we abstract b from g arriving at "let x = b in h x",
7536 otherwise we unfold the let and arrive at g. The simproc can be
7537 enabled/disabled by the reference use_let_simproc. Potential
7538 INCOMPATIBILITY since simplification is more powerful by default.
7540 * Classical reasoning: the meson method now accepts theorems as arguments.
7542 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
7543 jobs to provide advice on the provability of subgoals.
7545 * Theory OrderedGroup and Ring_and_Field: various additions and
7546 improvements to faciliate calculations involving equalities and
7549 The following theorems have been eliminated or modified
7552 abs_eq now named abs_of_nonneg
7553 abs_of_ge_0 now named abs_of_nonneg
7554 abs_minus_eq now named abs_of_nonpos
7555 imp_abs_id now named abs_of_nonneg
7556 imp_abs_neg_id now named abs_of_nonpos
7557 mult_pos now named mult_pos_pos
7558 mult_pos_le now named mult_nonneg_nonneg
7559 mult_pos_neg_le now named mult_nonneg_nonpos
7560 mult_pos_neg2_le now named mult_nonneg_nonpos2
7561 mult_neg now named mult_neg_neg
7562 mult_neg_le now named mult_nonpos_nonpos
7564 * The following lemmas in Ring_and_Field have been added to the simplifier:
7567 not_square_less_zero
7569 The following lemmas have been deleted from Real/RealPow:
7579 * Theory Parity: added rules for simplifying exponents.
7583 The following theorems have been eliminated or modified
7586 list_all_Nil now named list_all.simps(1)
7587 list_all_Cons now named list_all.simps(2)
7588 list_all_conv now named list_all_iff
7589 set_mem_eq now named mem_iff
7591 * Theories SetsAndFunctions and BigO (see HOL/Library) support
7592 asymptotic "big O" calculations. See the notes in BigO.thy.
7597 * Theory RealDef: better support for embedding natural numbers and
7598 integers in the reals.
7600 The following theorems have been eliminated or modified
7603 exp_ge_add_one_self now requires no hypotheses
7604 real_of_int_add reversed direction of equality (use [symmetric])
7605 real_of_int_minus reversed direction of equality (use [symmetric])
7606 real_of_int_diff reversed direction of equality (use [symmetric])
7607 real_of_int_mult reversed direction of equality (use [symmetric])
7609 * Theory RComplete: expanded support for floor and ceiling functions.
7611 * Theory Ln is new, with properties of the natural logarithm
7613 * Hyperreal: There is a new type constructor "star" for making
7614 nonstandard types. The old type names are now type synonyms:
7618 hcomplex = complex star
7620 * Hyperreal: Many groups of similarly-defined constants have been
7621 replaced by polymorphic versions (INCOMPATIBILITY):
7623 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
7625 starset <-- starsetNat, starsetC
7626 *s* <-- *sNat*, *sc*
7627 starset_n <-- starsetNat_n, starsetC_n
7628 *sn* <-- *sNatn*, *scn*
7629 InternalSets <-- InternalNatSets, InternalCSets
7631 starfun <-- starfun{Nat,Nat2,C,RC,CR}
7632 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
7633 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
7634 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
7635 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
7637 * Hyperreal: Many type-specific theorems have been removed in favor of
7638 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
7640 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
7641 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
7642 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
7643 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
7644 right_minus <-- hypreal_add_minus
7645 left_minus <-- {hypreal,hcomplex}_add_minus_left
7646 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
7647 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
7648 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
7649 mult_1_right <-- hcomplex_mult_one_right
7650 mult_zero_left <-- hcomplex_mult_zero_left
7651 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
7652 right_distrib <-- hypnat_add_mult_distrib2
7653 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
7654 right_inverse <-- hypreal_mult_inverse
7655 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
7656 order_refl <-- {hypreal,hypnat}_le_refl
7657 order_trans <-- {hypreal,hypnat}_le_trans
7658 order_antisym <-- {hypreal,hypnat}_le_anti_sym
7659 order_less_le <-- {hypreal,hypnat}_less_le
7660 linorder_linear <-- {hypreal,hypnat}_le_linear
7661 add_left_mono <-- {hypreal,hypnat}_add_left_mono
7662 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
7663 add_nonneg_nonneg <-- hypreal_le_add_order
7665 * Hyperreal: Separate theorems having to do with type-specific
7666 versions of constants have been merged into theorems that apply to the
7667 new polymorphic constants (INCOMPATIBILITY):
7669 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
7670 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
7671 STAR_Un <-- {STAR,NatStar,STARC}_Un
7672 STAR_Int <-- {STAR,NatStar,STARC}_Int
7673 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
7674 STAR_subset <-- {STAR,NatStar,STARC}_subset
7675 STAR_mem <-- {STAR,NatStar,STARC}_mem
7676 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
7677 STAR_diff <-- {STAR,STARC}_diff
7678 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
7679 STARC_hcomplex_of_complex}_image_subset
7680 starset_n_Un <-- starset{Nat,C}_n_Un
7681 starset_n_Int <-- starset{Nat,C}_n_Int
7682 starset_n_Compl <-- starset{Nat,C}_n_Compl
7683 starset_n_diff <-- starset{Nat,C}_n_diff
7684 InternalSets_Un <-- Internal{Nat,C}Sets_Un
7685 InternalSets_Int <-- Internal{Nat,C}Sets_Int
7686 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
7687 InternalSets_diff <-- Internal{Nat,C}Sets_diff
7688 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
7689 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
7690 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
7691 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
7692 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
7693 starfun <-- starfun{Nat,Nat2,C,RC,CR}
7694 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
7695 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
7696 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
7697 starfun_diff <-- starfun{C,RC,CR}_diff
7698 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
7699 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
7700 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
7701 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
7702 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
7703 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
7704 starfun_Id <-- starfunC_Id
7705 starfun_approx <-- starfun{Nat,CR}_approx
7706 starfun_capprox <-- starfun{C,RC}_capprox
7707 starfun_abs <-- starfunNat_rabs
7708 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
7709 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
7710 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
7711 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
7712 starfun_add_capprox <-- starfun{C,RC}_add_capprox
7713 starfun_add_approx <-- starfunCR_add_approx
7714 starfun_inverse_inverse <-- starfunC_inverse_inverse
7715 starfun_divide <-- starfun{C,CR,RC}_divide
7716 starfun_n <-- starfun{Nat,C}_n
7717 starfun_n_mult <-- starfun{Nat,C}_n_mult
7718 starfun_n_add <-- starfun{Nat,C}_n_add
7719 starfun_n_add_minus <-- starfunNat_n_add_minus
7720 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
7721 starfun_n_minus <-- starfun{Nat,C}_n_minus
7722 starfun_n_eq <-- starfun{Nat,C}_n_eq
7724 star_n_add <-- {hypreal,hypnat,hcomplex}_add
7725 star_n_minus <-- {hypreal,hcomplex}_minus
7726 star_n_diff <-- {hypreal,hcomplex}_diff
7727 star_n_mult <-- {hypreal,hcomplex}_mult
7728 star_n_inverse <-- {hypreal,hcomplex}_inverse
7729 star_n_le <-- {hypreal,hypnat}_le
7730 star_n_less <-- {hypreal,hypnat}_less
7731 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
7732 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
7733 star_n_abs <-- hypreal_hrabs
7734 star_n_divide <-- hcomplex_divide
7736 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
7737 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
7738 star_of_diff <-- hypreal_of_real_diff
7739 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
7740 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
7741 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
7742 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
7743 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
7744 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
7745 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
7746 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
7747 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
7748 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
7749 star_of_number_of <-- {hypreal,hcomplex}_number_of
7750 star_of_number_less <-- number_of_less_hypreal_of_real_iff
7751 star_of_number_le <-- number_of_le_hypreal_of_real_iff
7752 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
7753 star_of_less_number <-- hypreal_of_real_less_number_of_iff
7754 star_of_le_number <-- hypreal_of_real_le_number_of_iff
7755 star_of_power <-- hypreal_of_real_power
7756 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
7758 * Hyperreal: new method "transfer" that implements the transfer
7759 principle of nonstandard analysis. With a subgoal that mentions
7760 nonstandard types like "'a star", the command "apply transfer"
7761 replaces it with an equivalent one that mentions only standard types.
7762 To be successful, all free variables must have standard types; non-
7763 standard variables must have explicit universal quantifiers.
7765 * Hyperreal: A theory of Taylor series.
7770 * Discontinued special version of 'constdefs' (which used to support
7771 continuous functions) in favor of the general Pure one with full
7774 * New simplification procedure for solving continuity conditions; it
7775 is much faster on terms with many nested lambda abstractions (cubic
7776 instead of exponential time).
7778 * New syntax for domain package: selector names are now optional.
7779 Parentheses should be omitted unless argument is lazy, for example:
7781 domain 'a stream = cons "'a" (lazy "'a stream")
7783 * New command 'fixrec' for defining recursive functions with pattern
7784 matching; defining multiple functions with mutual recursion is also
7785 supported. Patterns may include the constants cpair, spair, up, sinl,
7786 sinr, or any data constructor defined by the domain package. The given
7787 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
7788 syntax and examples.
7790 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
7791 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
7792 but the proof obligation additionally includes an admissibility
7793 requirement. The packages generate instances of class cpo or pcpo,
7794 with continuity and strictness theorems for Rep and Abs.
7796 * HOLCF: Many theorems have been renamed according to a more standard naming
7797 scheme (INCOMPATIBILITY):
7799 foo_inject: "foo$x = foo$y ==> x = y"
7800 foo_eq: "(foo$x = foo$y) = (x = y)"
7801 foo_less: "(foo$x << foo$y) = (x << y)"
7802 foo_strict: "foo$UU = UU"
7803 foo_defined: "... ==> foo$x ~= UU"
7804 foo_defined_iff: "(foo$x = UU) = (x = UU)"
7809 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
7810 including the First Isomorphism Theorem (on quotienting by the kernel
7813 * ZF/Simplifier: install second copy of type solver that actually
7814 makes use of TC rules declared to Isar proof contexts (or locales);
7815 the old version is still required for ML proof scripts.
7820 * Converted to Isar theory format; use locales instead of axiomatic
7826 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
7829 * Pure/library.ML no longer defines its own option datatype, but uses
7830 that of the SML basis, which has constructors NONE and SOME instead of
7831 None and Some, as well as exception Option.Option instead of OPTION.
7832 The functions the, if_none, is_some, is_none have been adapted
7833 accordingly, while Option.map replaces apsome.
7835 * Pure/library.ML: the exception LIST has been given up in favour of
7836 the standard exceptions Empty and Subscript, as well as
7837 Library.UnequalLengths. Function like Library.hd and Library.tl are
7838 superceded by the standard hd and tl functions etc.
7840 A number of basic list functions are no longer exported to the ML
7841 toplevel, as they are variants of predefined functions. The following
7842 suggests how one can translate existing code:
7844 rev_append xs ys = List.revAppend (xs, ys)
7845 nth_elem (i, xs) = List.nth (xs, i)
7846 last_elem xs = List.last xs
7847 flat xss = List.concat xss
7848 seq fs = List.app fs
7849 partition P xs = List.partition P xs
7850 mapfilter f xs = List.mapPartial f xs
7852 * Pure/library.ML: several combinators for linear functional
7853 transformations, notably reverse application and composition:
7856 (x, y) |-> f f #-> g
7858 * Pure/library.ML: introduced/changed precedence of infix operators:
7860 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
7862 infix 3 o oo ooo oooo;
7863 infix 4 ~~ upto downto;
7865 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
7868 * Pure/library.ML: natural list combinators fold, fold_rev, and
7869 fold_map support linear functional transformations and nesting. For
7872 fold f [x1, ..., xN] y =
7873 y |> f x1 |> ... |> f xN
7875 (fold o fold) f [xs1, ..., xsN] y =
7876 y |> fold f xs1 |> ... |> fold f xsN
7878 fold f [x1, ..., xN] =
7881 (fold o fold) f [xs1, ..., xsN] =
7882 fold f xs1 #> ... #> fold f xsN
7884 * Pure/library.ML: the following selectors on type 'a option are
7887 the: 'a option -> 'a (*partial*)
7888 these: 'a option -> 'a where 'a = 'b list
7889 the_default: 'a -> 'a option -> 'a
7890 the_list: 'a option -> 'a list
7892 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
7893 basic operations for association lists, following natural argument
7894 order; moreover the explicit equality predicate passed here avoids
7895 potentially expensive polymorphic runtime equality checks.
7896 The old functions may be expressed as follows:
7898 assoc = uncurry (AList.lookup (op =))
7899 assocs = these oo AList.lookup (op =)
7900 overwrite = uncurry (AList.update (op =)) o swap
7902 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
7904 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
7905 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
7907 replacing make_keylist and keyfilter (occassionally used)
7910 make_keylist = AList.make
7911 keyfilter = AList.find (op =)
7913 * eq_fst and eq_snd now take explicit equality parameter, thus
7914 avoiding eqtypes. Naive rewrites:
7916 eq_fst = eq_fst (op =)
7917 eq_snd = eq_snd (op =)
7919 * Removed deprecated apl and apr (rarely used).
7922 apl (n, op) =>>= curry op n
7923 apr (op, m) =>>= fn n => op (n, m)
7925 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
7926 provides a reasonably efficient light-weight implementation of sets as
7929 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
7930 few new operations; existing lookup and update are now curried to
7931 follow natural argument order (for use with fold etc.);
7932 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
7934 * Pure/General: output via the Isabelle channels of
7935 writeln/warning/error etc. is now passed through Output.output, with a
7936 hook for arbitrary transformations depending on the print_mode
7937 (cf. Output.add_mode -- the first active mode that provides a output
7938 function wins). Already formatted output may be embedded into further
7939 text via Output.raw; the result of Pretty.string_of/str_of and derived
7940 functions (string_of_term/cterm/thm etc.) is already marked raw to
7941 accommodate easy composition of diagnostic messages etc. Programmers
7942 rarely need to care about Output.output or Output.raw at all, with
7943 some notable exceptions: Output.output is required when bypassing the
7944 standard channels (writeln etc.), or in token translations to produce
7945 properly formatted results; Output.raw is required when capturing
7946 already output material that will eventually be presented to the user
7947 a second time. For the default print mode, both Output.output and
7948 Output.raw have no effect.
7950 * Pure/General: Output.time_accumulator NAME creates an operator ('a
7951 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
7952 cumulative results are displayed at the end of a batch session.
7954 * Pure/General: File.sysify_path and File.quote_sysify path have been
7955 replaced by File.platform_path and File.shell_path (with appropriate
7956 hooks). This provides a clean interface for unusual systems where the
7957 internal and external process view of file names are different.
7959 * Pure: more efficient orders for basic syntactic entities: added
7960 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
7961 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
7962 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
7963 orders now -- potential INCOMPATIBILITY for code that depends on a
7964 particular order for Symtab.keys, Symtab.dest, etc. (consider using
7965 Library.sort_strings on result).
7967 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
7968 fold_types traverse types/terms from left to right, observing natural
7969 argument order. Supercedes previous foldl_XXX versions, add_frees,
7970 add_vars etc. have been adapted as well: INCOMPATIBILITY.
7972 * Pure: name spaces have been refined, with significant changes of the
7973 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
7974 to extern(_table). The plain name entry path is superceded by a
7975 general 'naming' context, which also includes the 'policy' to produce
7976 a fully qualified name and external accesses of a fully qualified
7977 name; NameSpace.extend is superceded by context dependent
7978 Sign.declare_name. Several theory and proof context operations modify
7979 the naming context. Especially note Theory.restore_naming and
7980 ProofContext.restore_naming to get back to a sane state; note that
7981 Theory.add_path is no longer sufficient to recover from
7982 Theory.absolute_path in particular.
7984 * Pure: new flags short_names (default false) and unique_names
7985 (default true) for controlling output of qualified names. If
7986 short_names is set, names are printed unqualified. If unique_names is
7987 reset, the name prefix is reduced to the minimum required to achieve
7988 the original result when interning again, even if there is an overlap
7989 with earlier declarations.
7991 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
7992 now 'extend', and 'merge' gets an additional Pretty.pp argument
7993 (useful for printing error messages). INCOMPATIBILITY.
7995 * Pure: major reorganization of the theory context. Type Sign.sg and
7996 Theory.theory are now identified, referring to the universal
7997 Context.theory (see Pure/context.ML). Actual signature and theory
7998 content is managed as theory data. The old code and interfaces were
7999 spread over many files and structures; the new arrangement introduces
8000 considerable INCOMPATIBILITY to gain more clarity:
8002 Context -- theory management operations (name, identity, inclusion,
8003 parents, ancestors, merge, etc.), plus generic theory data;
8005 Sign -- logical signature and syntax operations (declaring consts,
8006 types, etc.), plus certify/read for common entities;
8008 Theory -- logical theory operations (stating axioms, definitions,
8009 oracles), plus a copy of logical signature operations (consts,
8010 types, etc.); also a few basic management operations (Theory.copy,
8013 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
8014 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
8015 for convenience -- they merely return the theory.
8017 * Pure: type Type.tsig is superceded by theory in most interfaces.
8019 * Pure: the Isar proof context type is already defined early in Pure
8020 as Context.proof (note that ProofContext.context and Proof.context are
8021 aliases, where the latter is the preferred name). This enables other
8022 Isabelle components to refer to that type even before Isar is present.
8024 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
8025 typeK, constK, axiomK, oracleK), but provide explicit operations for
8026 any of these kinds. For example, Sign.intern typeK is now
8027 Sign.intern_type, Theory.hide_space Sign.typeK is now
8028 Theory.hide_types. Also note that former
8029 Theory.hide_classes/types/consts are now
8030 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
8031 internalize their arguments! INCOMPATIBILITY.
8033 * Pure: get_thm interface (of PureThy and ProofContext) expects
8034 datatype thmref (with constructors Name and NameSelection) instead of
8035 plain string -- INCOMPATIBILITY;
8037 * Pure: cases produced by proof methods specify options, where NONE
8038 means to remove case bindings -- INCOMPATIBILITY in
8041 * Pure: the following operations retrieve axioms or theorems from a
8042 theory node or theory hierarchy, respectively:
8044 Theory.axioms_of: theory -> (string * term) list
8045 Theory.all_axioms_of: theory -> (string * term) list
8046 PureThy.thms_of: theory -> (string * thm) list
8047 PureThy.all_thms_of: theory -> (string * thm) list
8049 * Pure: print_tac now outputs the goal through the trace channel.
8051 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
8052 Reference Toplevel.debug (default false) controls detailed printing
8053 and tracing of low-level exceptions; Toplevel.profiling (default 0)
8054 controls execution profiling -- set to 1 for time and 2 for space
8055 (both increase the runtime).
8057 * Isar session: The initial use of ROOT.ML is now always timed,
8058 i.e. the log will show the actual process times, in contrast to the
8059 elapsed wall-clock time that the outer shell wrapper produces.
8061 * Simplifier: improved handling of bound variables (nameless
8062 representation, avoid allocating new strings). Simprocs that invoke
8063 the Simplifier recursively should use Simplifier.inherit_bounds to
8064 avoid local name clashes. Failure to do so produces warnings
8065 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
8066 for further details.
8068 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
8069 bindings for all theorems stored within a given theory; this may help
8070 in porting non-Isar theories to Isar ones, while keeping ML proof
8071 scripts for the time being.
8073 * ML operator HTML.with_charset specifies the charset begin used for
8074 generated HTML files. For example:
8076 HTML.with_charset "utf-8" use_thy "Hebrew";
8077 HTML.with_charset "utf-8" use_thy "Chinese";
8082 * Allow symlinks to all proper Isabelle executables (Isabelle,
8083 isabelle, isatool etc.).
8085 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
8086 isatool doc, isatool mkdir, display_drafts etc.).
8088 * isatool usedir: option -f allows specification of the ML file to be
8089 used by Isabelle; default is ROOT.ML.
8091 * New isatool version outputs the version identifier of the Isabelle
8092 distribution being used.
8094 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
8095 (containing Boolean satisfiability problems) into Isabelle/HOL
8100 New in Isabelle2004 (April 2004)
8101 --------------------------------
8105 * Provers/order.ML: new efficient reasoner for partial and linear orders.
8106 Replaces linorder.ML.
8108 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
8109 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
8110 (\<a>...\<z>), are now considered normal letters, and can therefore
8111 be used anywhere where an ASCII letter (a...zA...Z) has until
8112 now. COMPATIBILITY: This obviously changes the parsing of some
8113 terms, especially where a symbol has been used as a binder, say
8114 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
8115 as an identifier. Fix it by inserting a space around former
8116 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
8117 existing theory and ML files.
8119 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
8121 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
8122 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
8123 a normal (but invisible) letter. For multiple letter subscripts repeat
8124 \<^isub> like this: x\<^isub>1\<^isub>2.
8126 * Pure: There are now sub-/superscripts that can span more than one
8127 character. Text between \<^bsub> and \<^esub> is set in subscript in
8128 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
8129 superscript. The new control characters are not identifier parts.
8131 * Pure: Control-symbols of the form \<^raw:...> will literally print the
8132 content of "..." to the latex file instead of \isacntrl... . The "..."
8133 may consist of any printable characters excluding the end bracket >.
8135 * Pure: Using new Isar command "finalconsts" (or the ML functions
8136 Theory.add_finals or Theory.add_finals_i) it is now possible to
8137 declare constants "final", which prevents their being given a definition
8138 later. It is useful for constants whose behaviour is fixed axiomatically
8139 rather than definitionally, such as the meta-logic connectives.
8141 * Pure: 'instance' now handles general arities with general sorts
8142 (i.e. intersections of classes),
8144 * Presentation: generated HTML now uses a CSS style sheet to make layout
8145 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
8146 It can be changed to alter the colors/layout of generated pages.
8151 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
8152 cut_tac, subgoal_tac and thin_tac:
8153 - Now understand static (Isar) contexts. As a consequence, users of Isar
8154 locales are no longer forced to write Isar proof scripts.
8155 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
8157 - INCOMPATIBILITY: names of variables to be instantiated may no
8158 longer be enclosed in quotes. Instead, precede variable name with `?'.
8159 This is consistent with the instantiation attribute "where".
8161 * Attributes "where" and "of":
8162 - Now take type variables of instantiated theorem into account when reading
8163 the instantiation string. This fixes a bug that caused instantiated
8164 theorems to have too special types in some circumstances.
8165 - "where" permits explicit instantiations of type variables.
8167 * Calculation commands "moreover" and "also" no longer interfere with
8168 current facts ("this"), admitting arbitrary combinations with "then"
8172 - Goal statements involving the context element "includes" no longer
8173 generate theorems with internal delta predicates (those ending on
8174 "_axioms") in the premise.
8175 Resolve particular premise with <locale>.intro to obtain old form.
8176 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
8177 specification and "includes" elements in goal statement.
8178 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
8179 [intro?] and [elim?] (respectively) by default.
8180 - Experimental command for instantiation of locales in proof contexts:
8181 instantiate <label>[<attrs>]: <loc>
8182 Instantiates locale <loc> and adds all its theorems to the current context
8183 taking into account their attributes. Label and attrs are optional
8184 modifiers, like in theorem declarations. If present, names of
8185 instantiated theorems are qualified with <label>, and the attributes
8186 <attrs> are applied after any attributes these theorems might have already.
8187 If the locale has assumptions, a chained fact of the form
8188 "<loc> t1 ... tn" is expected from which instantiations of the parameters
8189 are derived. The command does not support old-style locales declared
8190 with "locale (open)".
8191 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
8193 * HOL: Tactic emulation methods induct_tac and case_tac understand static
8199 * Proof import: new image HOL4 contains the imported library from
8200 the HOL4 system with about 2500 theorems. It is imported by
8201 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
8202 can be used like any other Isabelle image. See
8203 HOL/Import/HOL/README for more information.
8206 - Much improved handling of linear and partial orders.
8207 Reasoners for linear and partial orders are set up for type classes
8208 "linorder" and "order" respectively, and are added to the default simpset
8209 as solvers. This means that the simplifier can build transitivity chains
8210 to solve goals from the assumptions.
8211 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
8212 of blast or auto after simplification become unnecessary because the goal
8213 is solved by simplification already.
8215 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
8216 all proved in axiomatic type classes for semirings, rings and fields.
8219 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
8220 now formalized using the Ring_and_Field theory mentioned above.
8221 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
8222 than before, because now they are set up once in a generic manner.
8223 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
8224 Look for the general versions in Ring_and_Field (and Power if they concern
8227 * Type "rat" of the rational numbers is now available in HOL-Complex.
8230 - Record types are now by default printed with their type abbreviation
8231 instead of the list of all field types. This can be configured via
8232 the reference "print_record_type_abbr".
8233 - Simproc "record_upd_simproc" for simplification of multiple updates added
8234 (not enabled by default).
8235 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
8236 EX x. x = sel r to True (not enabled by default).
8237 - Tactic "record_split_simp_tac" to split and simplify records added.
8239 * 'specification' command added, allowing for definition by
8240 specification. There is also an 'ax_specification' command that
8241 introduces the new constants axiomatically.
8243 * arith(_tac) is now able to generate counterexamples for reals as well.
8245 * HOL-Algebra: new locale "ring" for non-commutative rings.
8247 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
8248 definitions, thanks to Sava Krsti\'{c} and John Matthews.
8250 * HOL-Matrix: a first theory for matrices in HOL with an application of
8251 matrix theory to linear programming.
8253 * Unions and Intersections:
8254 The latex output syntax of UN and INT has been changed
8255 from "\Union x \in A. B" to "\Union_{x \in A} B"
8256 i.e. the index formulae has become a subscript.
8257 Similarly for "\Union x. B", and for \Inter instead of \Union.
8259 * Unions and Intersections over Intervals:
8260 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
8261 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
8262 like in normal math, and corresponding versions for < and for intersection.
8264 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
8265 lexicographic dictonary ordering has been added as "lexord".
8267 * ML: the legacy theory structures Int and List have been removed. They had
8268 conflicted with ML Basis Library structures having the same names.
8270 * 'refute' command added to search for (finite) countermodels. Only works
8271 for a fragment of HOL. The installation of an external SAT solver is
8272 highly recommended. See "HOL/Refute.thy" for details.
8274 * 'quickcheck' command: Allows to find counterexamples by evaluating
8275 formulae under an assignment of free variables to random values.
8276 In contrast to 'refute', it can deal with inductive datatypes,
8277 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
8283 * Streams now come with concatenation and are part of the HOLCF image
8287 New in Isabelle2003 (May 2003)
8288 ------------------------------
8292 * Provers/simplifier:
8294 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
8295 Assumptions are now subject to complete mutual simplification,
8296 not just from left to right. The simplifier now preserves
8297 the order of assumptions.
8299 Potential INCOMPATIBILITY:
8301 -- simp sometimes diverges where the old version did
8302 not, e.g. invoking simp on the goal
8304 [| P (f x); y = x; f x = f y |] ==> Q
8306 now gives rise to the infinite reduction sequence
8308 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
8310 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
8313 -- Tactics combining classical reasoner and simplification (such as auto)
8314 are also affected by this change, because many of them rely on
8315 simp. They may sometimes diverge as well or yield a different numbers
8316 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
8317 in case of problems. Sometimes subsequent calls to the classical
8318 reasoner will fail because a preceeding call to the simplifier too
8319 eagerly simplified the goal, e.g. deleted redundant premises.
8321 - The simplifier trace now shows the names of the applied rewrite rules
8323 - You can limit the number of recursive invocations of the simplifier
8324 during conditional rewriting (where the simplifie tries to solve the
8325 conditions before applying the rewrite rule):
8326 ML "simp_depth_limit := n"
8327 where n is an integer. Thus you can force termination where previously
8328 the simplifier would diverge.
8330 - Accepts free variables as head terms in congruence rules. Useful in Isar.
8332 - No longer aborts on failed congruence proof. Instead, the
8333 congruence is ignored.
8335 * Pure: New generic framework for extracting programs from constructive
8336 proofs. See HOL/Extraction.thy for an example instantiation, as well
8337 as HOL/Extraction for some case studies.
8339 * Pure: The main goal of the proof state is no longer shown by default, only
8340 the subgoals. This behaviour is controlled by a new flag.
8341 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
8342 (ML: Proof.show_main_goal).
8344 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
8345 rules whose conclusion matches subgoal 1:
8346 PG menu: Isabelle/Isar -> Show me -> matching rules
8347 The rules are ordered by how closely they match the subgoal.
8348 In particular, rules that solve a subgoal outright are displayed first
8349 (or rather last, the way they are printed).
8350 (ML: ProofGeneral.print_intros())
8352 * Pure: New flag trace_unify_fail causes unification to print
8353 diagnostic information (PG: in trace buffer) when it fails. This is
8354 useful for figuring out why single step proofs like rule, erule or
8357 * Pure: Locale specifications now produce predicate definitions
8358 according to the body of text (covering assumptions modulo local
8359 definitions); predicate "loc_axioms" covers newly introduced text,
8360 while "loc" is cumulative wrt. all included locale expressions; the
8361 latter view is presented only on export into the global theory
8362 context; potential INCOMPATIBILITY, use "(open)" option to fall back
8363 on the old view without predicates;
8365 * Pure: predefined locales "var" and "struct" are useful for sharing
8366 parameters (as in CASL, for example); just specify something like
8367 ``var x + var y + struct M'' as import;
8369 * Pure: improved thms_containing: proper indexing of facts instead of
8370 raw theorems; check validity of results wrt. current name space;
8371 include local facts of proof configuration (also covers active
8372 locales), cover fixed variables in index; may use "_" in term
8373 specification; an optional limit for the number of printed facts may
8374 be given (the default is 40);
8376 * Pure: disallow duplicate fact bindings within new-style theory files
8379 * Provers: improved induct method: assumptions introduced by case
8380 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
8381 the goal statement); "foo" still refers to all facts collectively;
8383 * Provers: the function blast.overloaded has been removed: all constants
8384 are regarded as potentially overloaded, which improves robustness in exchange
8385 for slight decrease in efficiency;
8387 * Provers/linorder: New generic prover for transitivity reasoning over
8388 linear orders. Note: this prover is not efficient!
8390 * Isar: preview of problems to finish 'show' now produce an error
8391 rather than just a warning (in interactive mode);
8398 - Produces a counter example if it cannot prove a goal.
8399 Note that the counter example may be spurious if the goal is not a formula
8400 of quantifier-free linear arithmetic.
8401 In ProofGeneral the counter example appears in the trace buffer.
8403 - Knows about div k and mod k where k is a numeral of type nat or int.
8405 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
8406 linear arithmetic fails. This takes account of quantifiers and divisibility.
8407 Presburger arithmetic can also be called explicitly via presburger(_tac).
8409 * simp's arithmetic capabilities have been enhanced a bit: it now
8410 takes ~= in premises into account (by performing a case split);
8412 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
8413 are distributed over a sum of terms;
8415 * New tactic "trans_tac" and method "trans" instantiate
8416 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
8419 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
8420 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
8422 * 'typedef' command has new option "open" to suppress the set
8425 * functions Min and Max on finite sets have been introduced (theory
8428 * attribute [symmetric] now works for relations as well; it turns
8429 (x,y) : R^-1 into (y,x) : R, and vice versa;
8431 * induct over a !!-quantified statement (say !!x1..xn):
8432 each "case" automatically performs "fix x1 .. xn" with exactly those names.
8434 * Map: `empty' is no longer a constant but a syntactic abbreviation for
8435 %x. None. Warning: empty_def now refers to the previously hidden definition
8438 * Algebra: formalization of classical algebra. Intended as base for
8439 any algebraic development in Isabelle. Currently covers group theory
8440 (up to Sylow's theorem) and ring theory (Universal Property of
8441 Univariate Polynomials). Contributions welcome;
8443 * GroupTheory: deleted, since its material has been moved to Algebra;
8445 * Complex: new directory of the complex numbers with numeric constants,
8446 nonstandard complex numbers, and some complex analysis, standard and
8447 nonstandard (Jacques Fleuriot);
8449 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
8451 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
8454 * Real/HahnBanach: updated and adapted to locales;
8456 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
8459 * UNITY: added the Meier-Sanders theory of progress sets;
8461 * MicroJava: bytecode verifier and lightweight bytecode verifier
8462 as abstract algorithms, instantiated to the JVM;
8464 * Bali: Java source language formalization. Type system, operational
8465 semantics, axiomatic semantics. Supported language features:
8466 classes, interfaces, objects,virtual methods, static methods,
8467 static/instance fields, arrays, access modifiers, definite
8468 assignment, exceptions.
8473 * ZF/Constructible: consistency proof for AC (Gdel's constructible
8476 * Main ZF: virtually all theories converted to new-style format;
8481 * Pure: Tactic.prove provides sane interface for internal proofs;
8482 omits the infamous "standard" operation, so this is more appropriate
8483 than prove_goalw_cterm in many situations (e.g. in simprocs);
8485 * Pure: improved error reporting of simprocs;
8487 * Provers: Simplifier.simproc(_i) provides sane interface for setting
8491 *** Document preparation ***
8493 * uses \par instead of \\ for line breaks in theory text. This may
8494 shift some page breaks in large documents. To get the old behaviour
8495 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
8497 * minimized dependencies of isabelle.sty and isabellesym.sty on
8500 * \<euro> now needs package babel/greek instead of marvosym (which
8503 * normal size for \<zero>...\<nine> (uses \mathbf instead of
8508 New in Isabelle2002 (March 2002)
8509 --------------------------------
8511 *** Document preparation ***
8513 * greatly simplified document preparation setup, including more
8514 graceful interpretation of isatool usedir -i/-d/-D options, and more
8515 instructive isatool mkdir; users should basically be able to get
8516 started with "isatool mkdir HOL Test && isatool make"; alternatively,
8517 users may run a separate document processing stage manually like this:
8518 "isatool usedir -D output HOL Test && isatool document Test/output";
8520 * theory dependency graph may now be incorporated into documents;
8521 isatool usedir -g true will produce session_graph.eps/.pdf for use
8522 with \includegraphics of LaTeX;
8524 * proper spacing of consecutive markup elements, especially text
8525 blocks after section headings;
8527 * support bold style (for single symbols only), input syntax is like
8528 this: "\<^bold>\<alpha>" or "\<^bold>A";
8530 * \<bullet> is now output as bold \cdot by default, which looks much
8531 better in printed text;
8533 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
8534 note that these symbols are currently unavailable in Proof General /
8535 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
8537 * isatool latex no longer depends on changed TEXINPUTS, instead
8538 isatool document copies the Isabelle style files to the target
8544 * Pure/Provers: improved proof by cases and induction;
8545 - 'case' command admits impromptu naming of parameters (such as
8547 - 'induct' method divinates rule instantiation from the inductive
8548 claim; no longer requires excessive ?P bindings for proper
8549 instantiation of cases;
8550 - 'induct' method properly enumerates all possibilities of set/type
8551 rules; as a consequence facts may be also passed through *type*
8552 rules without further ado;
8553 - 'induct' method now derives symbolic cases from the *rulified*
8554 rule (before it used to rulify cases stemming from the internal
8555 atomized version); this means that the context of a non-atomic
8556 statement becomes is included in the hypothesis, avoiding the
8557 slightly cumbersome show "PROP ?case" form;
8558 - 'induct' may now use elim-style induction rules without chaining
8559 facts, using ``missing'' premises from the goal state; this allows
8560 rules stemming from inductive sets to be applied in unstructured
8561 scripts, while still benefitting from proper handling of non-atomic
8562 statements; NB: major inductive premises need to be put first, all
8563 the rest of the goal is passed through the induction;
8564 - 'induct' proper support for mutual induction involving non-atomic
8565 rule statements (uses the new concept of simultaneous goals, see
8567 - append all possible rule selections, but only use the first
8568 success (no backtracking);
8569 - removed obsolete "(simplified)" and "(stripped)" options of methods;
8570 - undeclared rule case names default to numbers 1, 2, 3, ...;
8571 - added 'print_induct_rules' (covered by help item in recent Proof
8573 - moved induct/cases attributes to Pure, methods to Provers;
8574 - generic method setup instantiated for FOL and HOL;
8576 * Pure: support multiple simultaneous goal statements, for example
8577 "have a: A and b: B" (same for 'theorem' etc.); being a pure
8578 meta-level mechanism, this acts as if several individual goals had
8579 been stated separately; in particular common proof methods need to be
8580 repeated in order to cover all claims; note that a single elimination
8581 step is *not* sufficient to establish the two conjunctions, so this
8584 assume "A & B" then have A and B .. (*".." fails*)
8586 better use "obtain" in situations as above; alternative refer to
8587 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
8589 * Pure: proper integration with ``locales''; unlike the original
8590 version by Florian Kammller, Isar locales package high-level proof
8591 contexts rather than raw logical ones (e.g. we admit to include
8592 attributes everywhere); operations on locales include merge and
8593 rename; support for implicit arguments (``structures''); simultaneous
8594 type-inference over imports and text; see also HOL/ex/Locales.thy for
8597 * Pure: the following commands have been ``localized'', supporting a
8598 target locale specification "(in name)": 'lemma', 'theorem',
8599 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
8600 stored both within the locale and at the theory level (exported and
8601 qualified by the locale name);
8603 * Pure: theory goals may now be specified in ``long'' form, with
8604 ad-hoc contexts consisting of arbitrary locale elements. for example
8605 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
8606 definitions may be given, too); the result is a meta-level rule with
8607 the context elements being discharged in the obvious way;
8609 * Pure: new proof command 'using' allows to augment currently used
8610 facts after a goal statement ('using' is syntactically analogous to
8611 'apply', but acts on the goal's facts only); this allows chained facts
8612 to be separated into parts given before and after a claim, as in
8613 ``from a and b have C using d and e <proof>'';
8615 * Pure: renamed "antecedent" case to "rule_context";
8617 * Pure: new 'judgment' command records explicit information about the
8618 object-logic embedding (used by several tools internally); no longer
8619 use hard-wired "Trueprop";
8621 * Pure: added 'corollary' command;
8623 * Pure: fixed 'token_translation' command;
8625 * Pure: removed obsolete 'exported' attribute;
8627 * Pure: dummy pattern "_" in is/let is now automatically lifted over
8628 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
8629 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
8631 * Pure: method 'atomize' presents local goal premises as object-level
8632 statements (atomic meta-level propositions); setup controlled via
8633 rewrite rules declarations of 'atomize' attribute; example
8634 application: 'induct' method with proper rule statements in improper
8637 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
8638 now consider the syntactic context of assumptions, giving a better
8639 chance to get type-inference of the arguments right (this is
8640 especially important for locales);
8642 * Pure: "sorry" no longer requires quick_and_dirty in interactive
8645 * Pure/obtain: the formal conclusion "thesis", being marked as
8646 ``internal'', may no longer be reference directly in the text;
8647 potential INCOMPATIBILITY, may need to use "?thesis" in rare
8650 * Pure: generic 'sym' attribute which declares a rule both as pure
8651 'elim?' and for the 'symmetric' operation;
8653 * Pure: marginal comments ``--'' may now occur just anywhere in the
8654 text; the fixed correlation with particular command syntax has been
8657 * Pure: new method 'rules' is particularly well-suited for proof
8658 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
8659 but often produces more compact proof terms with less detours;
8661 * Pure/Provers/classical: simplified integration with pure rule
8662 attributes and methods; the classical "intro?/elim?/dest?"
8663 declarations coincide with the pure ones; the "rule" method no longer
8664 includes classically swapped intros; "intro" and "elim" methods no
8665 longer pick rules from the context; also got rid of ML declarations
8666 AddXIs/AddXEs/AddXDs; all of this has some potential for
8669 * Provers/classical: attribute 'swapped' produces classical inversions
8670 of introduction rules;
8672 * Provers/simplifier: 'simplified' attribute may refer to explicit
8673 rules instead of full simplifier context; 'iff' attribute handles
8676 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
8678 * HOL: 'recdef' now fails on unfinished automated proofs, use
8679 "(permissive)" option to recover old behavior;
8681 * HOL: 'inductive' no longer features separate (collective) attributes
8682 for 'intros' (was found too confusing);
8684 * HOL: properly declared induction rules less_induct and
8690 * HOL: moved over to sane numeral syntax; the new policy is as
8693 - 0 and 1 are polymorphic constants, which are defined on any
8694 numeric type (nat, int, real etc.);
8696 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
8697 binary representation internally;
8699 - type nat has special constructor Suc, and generally prefers Suc 0
8700 over 1::nat and Suc (Suc 0) over 2::nat;
8702 This change may cause significant problems of INCOMPATIBILITY; here
8703 are some hints on converting existing sources:
8705 - due to the new "num" token, "-0" and "-1" etc. are now atomic
8706 entities, so expressions involving "-" (unary or binary minus) need
8707 to be spaced properly;
8709 - existing occurrences of "1" may need to be constraint "1::nat" or
8710 even replaced by Suc 0; similar for old "2";
8712 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
8714 - remove all special provisions on numerals in proofs;
8716 * HOL: simp rules nat_number expand numerals on nat to Suc/0
8717 representation (depends on bin_arith_simps in the default context);
8719 * HOL: symbolic syntax for x^2 (numeral 2);
8721 * HOL: the class of all HOL types is now called "type" rather than
8722 "term"; INCOMPATIBILITY, need to adapt references to this type class
8723 in axclass/classes, instance/arities, and (usually rare) occurrences
8724 in typings (of consts etc.); internally the class is called
8725 "HOL.type", ML programs should refer to HOLogic.typeS;
8727 * HOL/record package improvements:
8728 - new derived operations "fields" to build a partial record section,
8729 "extend" to promote a fixed record to a record scheme, and
8730 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
8731 declared as simp by default;
8732 - shared operations ("more", "fields", etc.) now need to be always
8733 qualified) --- potential INCOMPATIBILITY;
8734 - removed "make_scheme" operations (use "make" with "extend") --
8736 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
8737 - provides cases/induct rules for use with corresponding Isar
8738 methods (for concrete records, record schemes, concrete more
8739 parts, and schematic more parts -- in that order);
8740 - internal definitions directly based on a light-weight abstract
8741 theory of product types over typedef rather than datatype;
8743 * HOL: generic code generator for generating executable ML code from
8744 specifications; specific support for HOL constructs such as inductive
8745 datatypes and sets, as well as recursive functions; can be invoked
8746 via 'generate_code' theory section;
8748 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
8750 * HOL: consolidated and renamed several theories. In particular:
8751 Ord.thy has been absorbed into HOL.thy
8752 String.thy has been absorbed into List.thy
8754 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
8755 (beware of argument permutation!);
8757 * HOL: linorder_less_split superseded by linorder_cases;
8759 * HOL/List: "nodups" renamed to "distinct";
8761 * HOL: added "The" definite description operator; move Hilbert's "Eps"
8762 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
8763 - Ex_def has changed, now need to use some_eq_ex
8765 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
8766 in this (rare) case use:
8768 delSWrapper "split_all_tac"
8769 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
8771 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
8774 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
8775 Isabelle's type classes, ^ on functions and relations has too general
8776 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
8777 necessary to attach explicit type constraints;
8779 * HOL/Relation: the prefix name of the infix "O" has been changed from
8780 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
8781 renamed accordingly (eg "compI" -> "rel_compI").
8783 * HOL: syntax translations now work properly with numerals and records
8786 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
8787 of "lam" -- INCOMPATIBILITY;
8789 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
8790 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
8791 renamed "Product_Type.unit";
8793 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
8795 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
8796 the "cases" method);
8798 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
8801 * HOL/IMP: updated and converted to new-style theory format; several
8802 parts turned into readable document, with proper Isar proof texts and
8803 some explanations (by Gerwin Klein);
8805 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
8807 * HOL-Hyperreal is now a logic image;
8812 * Isar: consts/constdefs supports mixfix syntax for continuous
8815 * Isar: domain package adapted to new-style theory format, e.g. see
8818 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
8819 potential INCOMPATIBILITY; now use plain induct_tac instead of former
8820 lift.induct_tac, always use UU instead of Undef;
8822 * HOLCF/IMP: updated and converted to new-style theory;
8827 * Isar: proper integration of logic-specific tools and packages,
8828 including theory commands '(co)inductive', '(co)datatype',
8829 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
8830 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
8832 * theory Main no longer includes AC; for the Axiom of Choice, base
8833 your theory on Main_ZFC;
8835 * the integer library now covers quotients and remainders, with many
8836 laws relating division to addition, multiplication, etc.;
8838 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
8839 typeless version of the formalism;
8841 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
8844 * ZF/Induct: new directory for examples of inductive definitions,
8845 including theory Multiset for multiset orderings; converted to
8846 new-style theory format;
8848 * ZF: many new theorems about lists, ordinals, etc.;
8853 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
8854 variable proof controls level of detail: 0 = no proofs (only oracle
8855 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
8856 also ref manual for further ML interfaces;
8858 * Pure/axclass: removed obsolete ML interface
8859 goal_subclass/goal_arity;
8861 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
8862 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
8863 separate tokens, so expressions involving minus need to be spaced
8866 * Pure/syntax: support non-oriented infixes, using keyword "infix"
8867 rather than "infixl" or "infixr";
8869 * Pure/syntax: concrete syntax for dummy type variables admits genuine
8870 sort constraint specifications in type inference; e.g. "x::_::foo"
8871 ensures that the type of "x" is of sort "foo" (but not necessarily a
8874 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
8875 control output of nested => (types); the default behavior is
8878 * Pure/syntax: builtin parse translation for "_constify" turns valued
8879 tokens into AST constants;
8881 * Pure/syntax: prefer later declarations of translations and print
8882 translation functions; potential INCOMPATIBILITY: need to reverse
8883 multiple declarations for same syntax element constant;
8885 * Pure/show_hyps reset by default (in accordance to existing Isar
8888 * Provers/classical: renamed addaltern to addafter, addSaltern to
8891 * Provers/clasimp: ``iff'' declarations now handle conditional rules
8894 * system: tested support for MacOS X; should be able to get Isabelle +
8895 Proof General to work in a plain Terminal after installing Poly/ML
8896 (e.g. from the Isabelle distribution area) and GNU bash alone
8897 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
8898 support requires further installations, e.g. from
8899 http://fink.sourceforge.net/);
8901 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
8903 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
8904 of 40 MB), cf. ML_OPTIONS;
8906 * system: Proof General keywords specification is now part of the
8907 Isabelle distribution (see etc/isar-keywords.el);
8909 * system: support for persistent Proof General sessions (refrain from
8910 outdating all loaded theories on startup); user may create writable
8911 logic images like this: ``isabelle -q HOL Test'';
8913 * system: smart selection of Isabelle process versus Isabelle
8914 interface, accommodates case-insensitive file systems (e.g. HFS+); may
8915 run both "isabelle" and "Isabelle" even if file names are badly
8916 damaged (executable inspects the case of the first letter of its own
8917 name); added separate "isabelle-process" and "isabelle-interface";
8919 * system: refrain from any attempt at filtering input streams; no
8920 longer support ``8bit'' encoding of old isabelle font, instead proper
8921 iso-latin characters may now be used; the related isatools
8922 "symbolinput" and "nonascii" have disappeared as well;
8924 * system: removed old "xterm" interface (the print modes "xterm" and
8925 "xterm_color" are still available for direct use in a suitable
8930 New in Isabelle99-2 (February 2001)
8931 -----------------------------------
8933 *** Overview of INCOMPATIBILITIES ***
8935 * HOL: please note that theories in the Library and elsewhere often use the
8936 new-style (Isar) format; to refer to their theorems in an ML script you must
8937 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
8939 * HOL: inductive package no longer splits induction rule aggressively,
8940 but only as far as specified by the introductions given; the old
8941 format may be recovered via ML function complete_split_rule or attribute
8942 'split_rule (complete)';
8944 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
8945 gfp_Tarski to gfp_unfold;
8947 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
8949 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
8950 relation); infix "^^" has been renamed "``"; infix "``" has been
8951 renamed "`"; "univalent" has been renamed "single_valued";
8953 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
8956 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
8958 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
8960 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
8961 consequence, it is no longer monotonic wrt. the local goal context
8962 (which is now passed through the inductive cases);
8964 * Document preparation: renamed standard symbols \<ll> to \<lless> and
8965 \<gg> to \<ggreater>;
8968 *** Document preparation ***
8970 * \isabellestyle{NAME} selects version of Isabelle output (currently
8971 available: are "it" for near math-mode best-style output, "sl" for
8972 slanted text style, and "tt" for plain type-writer; if no
8973 \isabellestyle command is given, output is according to slanted
8976 * support sub/super scripts (for single symbols only), input syntax is
8977 like this: "A\<^sup>*" or "A\<^sup>\<star>";
8979 * some more standard symbols; see Appendix A of the system manual for
8980 the complete list of symbols defined in isabellesym.sty;
8982 * improved isabelle style files; more abstract symbol implementation
8983 (should now use \isamath{...} and \isatext{...} in custom symbol
8986 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
8987 state; Note that presentation of goal states does not conform to
8988 actual human-readable proof documents. Please do not include goal
8989 states into document output unless you really know what you are doing!
8991 * proper indentation of antiquoted output with proportional LaTeX
8994 * no_document ML operator temporarily disables LaTeX document
8997 * isatool unsymbolize tunes sources for plain ASCII communication;
9002 * Pure: Isar now suffers initial goal statements to contain unbound
9003 schematic variables (this does not conform to actual readable proof
9004 documents, due to unpredictable outcome and non-compositional proof
9005 checking); users who know what they are doing may use schematic goals
9006 for Prolog-style synthesis of proven results;
9008 * Pure: assumption method (an implicit finishing) now handles actual
9011 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
9012 initial goal, declare "that" only as Pure intro (only for single
9013 steps); the "that" rule assumption may now be involved in implicit
9014 finishing, thus ".." becomes a feasible for trivial obtains;
9016 * Pure: default proof step now includes 'intro_classes'; thus trivial
9017 instance proofs may be performed by "..";
9019 * Pure: ?thesis / ?this / "..." now work for pure meta-level
9022 * Pure: more robust selection of calculational rules;
9024 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
9025 rule (as well as the assumption rule);
9027 * Pure: 'thm_deps' command visualizes dependencies of theorems and
9028 lemmas, using the graph browser tool;
9030 * Pure: predict failure of "show" in interactive mode;
9032 * Pure: 'thms_containing' now takes actual terms as arguments;
9034 * HOL: improved method 'induct' --- now handles non-atomic goals
9035 (potential INCOMPATIBILITY); tuned error handling;
9037 * HOL: cases and induct rules now provide explicit hints about the
9038 number of facts to be consumed (0 for "type" and 1 for "set" rules);
9039 any remaining facts are inserted into the goal verbatim;
9041 * HOL: local contexts (aka cases) may now contain term bindings as
9042 well; the 'cases' and 'induct' methods new provide a ?case binding for
9043 the result to be shown in each case;
9045 * HOL: added 'recdef_tc' command;
9047 * isatool convert assists in eliminating legacy ML scripts;
9052 * HOL/Library: a collection of generic theories to be used together
9053 with main HOL; the theory loader path already includes this directory
9054 by default; the following existing theories have been moved here:
9055 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
9056 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
9058 * HOL/Unix: "Some aspects of Unix file-system security", a typical
9059 modelling and verification task performed in Isabelle/HOL +
9060 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
9062 * HOL/Algebra: special summation operator SUM no longer exists, it has
9063 been replaced by setsum; infix 'assoc' now has priority 50 (like
9064 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
9065 'domain', this makes the theory consistent with mathematical
9068 * HOL basics: added overloaded operations "inverse" and "divide"
9069 (infix "/"), syntax for generic "abs" operation, generic summation
9072 * HOL/typedef: simplified package, provide more useful rules (see also
9075 * HOL/datatype: induction rule for arbitrarily branching datatypes is
9076 now expressed as a proper nested rule (old-style tactic scripts may
9077 require atomize_strip_tac to cope with non-atomic premises);
9079 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
9080 to "split_conv" (old name still available for compatibility);
9082 * HOL: improved concrete syntax for strings (e.g. allows translation
9083 rules with string literals);
9085 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
9086 and Fleuriot's mechanization of analysis, including the transcendental
9087 functions for the reals;
9089 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
9094 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
9095 "lam" is displayed as TWO lambda-symbols
9097 * CTT: theory Main now available, containing everything (that is, Bool
9103 * Pure: the Simplifier has been implemented properly as a derived rule
9104 outside of the actual kernel (at last!); the overall performance
9105 penalty in practical applications is about 50%, while reliability of
9106 the Isabelle inference kernel has been greatly improved;
9108 * print modes "brackets" and "no_brackets" control output of nested =>
9109 (types) and ==> (props); the default behaviour is "brackets";
9111 * Provers: fast_tac (and friends) now handle actual object-logic rules
9112 as assumptions as well;
9114 * system: support Poly/ML 4.0;
9116 * system: isatool install handles KDE version 1 or 2;
9120 New in Isabelle99-1 (October 2000)
9121 ----------------------------------
9123 *** Overview of INCOMPATIBILITIES ***
9125 * HOL: simplification of natural numbers is much changed; to partly
9126 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
9127 issue the following ML commands:
9129 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
9130 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
9132 * HOL: simplification no longer dives into case-expressions; this is
9133 controlled by "t.weak_case_cong" for each datatype t;
9135 * HOL: nat_less_induct renamed to less_induct;
9137 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
9138 fixsome to patch .thy and .ML sources automatically;
9140 select_equality -> some_equality
9141 select_eq_Ex -> some_eq_ex
9142 selectI2EX -> someI2_ex
9145 select1_equality -> some1_equality
9146 Eps_sym_eq -> some_sym_eq_trivial
9147 Eps_eq -> some_eq_trivial
9149 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
9151 * HOL: removed obsolete theorem binding expand_if (refer to split_if
9154 * HOL: the recursion equations generated by 'recdef' are now called
9155 f.simps instead of f.rules;
9157 * HOL: qed_spec_mp now also handles bounded ALL as well;
9159 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
9160 sometimes be needed;
9162 * HOL: the constant for "f``x" is now "image" rather than "op ``";
9164 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
9166 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
9167 product is now "<*>" instead of "Times"; the lexicographic product is
9168 now "<*lex*>" instead of "**";
9170 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
9171 of main HOL, but was unused); better use HOL's datatype package;
9173 * HOL: removed "symbols" syntax for constant "override" of theory Map;
9174 the old syntax may be recovered as follows:
9177 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
9178 (infixl "\\<oplus>" 100)
9180 * HOL/Real: "rabs" replaced by overloaded "abs" function;
9182 * HOL/ML: even fewer consts are declared as global (see theories Ord,
9183 Lfp, Gfp, WF); this only affects ML packages that refer to const names
9186 * HOL and ZF: syntax for quotienting wrt an equivalence relation
9187 changed from A/r to A//r;
9189 * ZF: new treatment of arithmetic (nat & int) may break some old
9192 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
9193 rulify -> rule_format, elimify -> elim_format, ...);
9195 * Isar/Provers: intro/elim/dest attributes changed; renamed
9196 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
9197 should have to change intro!! to intro? only); replaced "delrule" by
9200 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
9202 * Provers: strengthened force_tac by using new first_best_tac;
9204 * LaTeX document preparation: several changes of isabelle.sty (see
9208 *** Document preparation ***
9210 * formal comments (text blocks etc.) in new-style theories may now
9211 contain antiquotations of thm/prop/term/typ/text to be presented
9212 according to latex print mode; concrete syntax is like this:
9213 @{term[show_types] "f(x) = a + x"};
9215 * isatool mkdir provides easy setup of Isabelle session directories,
9216 including proper document sources;
9218 * generated LaTeX sources are now deleted after successful run
9219 (isatool document -c); may retain a copy somewhere else via -D option
9222 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
9223 style files, achieving self-contained LaTeX sources and simplifying
9226 * old-style theories now produce (crude) LaTeX output as well;
9228 * browser info session directories are now self-contained (may be put
9229 on WWW server seperately); improved graphs of nested sessions; removed
9230 graph for 'all sessions';
9232 * several improvements in isabelle style files; \isabellestyle{it}
9233 produces fake math mode output; \isamarkupheader is now \section by
9234 default; see lib/texinputs/isabelle.sty etc.;
9239 * Isar/Pure: local results and corresponding term bindings are now
9240 subject to Hindley-Milner polymorphism (similar to ML); this
9241 accommodates incremental type-inference very nicely;
9243 * Isar/Pure: new derived language element 'obtain' supports
9244 generalized existence reasoning;
9246 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
9247 support accumulation of results, without applying any rules yet;
9248 useful to collect intermediate results without explicit name
9249 references, and for use with transitivity rules with more than 2
9252 * Isar/Pure: scalable support for case-analysis type proofs: new
9253 'case' language element refers to local contexts symbolically, as
9254 produced by certain proof methods; internally, case names are attached
9255 to theorems as "tags";
9257 * Isar/Pure: theory command 'hide' removes declarations from
9258 class/type/const name spaces;
9260 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
9261 indicate potential overloading;
9263 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
9265 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
9266 "{a,b,c}" instead of {a,b,c};
9268 * Isar/Pure now provides its own version of intro/elim/dest
9269 attributes; useful for building new logics, but beware of confusion
9270 with the version in Provers/classical;
9272 * Isar/Pure: the local context of (non-atomic) goals is provided via
9273 case name 'antecedent';
9275 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
9276 to the current context is now done automatically);
9278 * Isar/Pure: theory command 'method_setup' provides a simple interface
9279 for definining proof methods in ML;
9281 * Isar/Provers: intro/elim/dest attributes changed; renamed
9282 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
9283 most cases, one should have to change intro!! to intro? only);
9284 replaced "delrule" by "rule del";
9286 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
9287 'symmetric' attribute (the latter supercedes [RS sym]);
9289 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
9290 method modifier); 'simp' method: 'only:' modifier removes loopers as
9291 well (including splits);
9293 * Isar/Provers: Simplifier and Classical methods now support all kind
9294 of modifiers used in the past, including 'cong', 'iff', etc.
9296 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
9297 of Simplifier and Classical reasoner);
9299 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
9300 now support named cases; major packages (inductive, datatype, primrec,
9301 recdef) support case names and properly name parameters;
9303 * Isar/HOL: new transitivity rules for substitution in inequalities --
9304 monotonicity conditions are extracted to be proven at end of
9307 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
9310 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
9311 split_if split_if_asm; datatype package provides theorems foo.splits =
9312 foo.split foo.split_asm for each datatype;
9314 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
9315 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
9316 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
9317 use "(cases (simplified))" method in proper proof texts);
9319 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
9321 * Isar: names of theorems etc. may be natural numbers as well;
9323 * Isar: 'pr' command: optional arguments for goals_limit and
9324 ProofContext.prems_limit; no longer prints theory contexts, but only
9327 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
9328 additional print modes to be specified; e.g. "pr(latex)" will print
9329 proof state according to the Isabelle LaTeX style;
9331 * Isar: improved support for emulating tactic scripts, including proof
9332 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
9333 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
9334 (for HOL datatypes);
9336 * Isar: simplified (more robust) goal selection of proof methods: 1st
9337 goal, all goals, or explicit goal specifier (tactic emulation); thus
9338 'proof method scripts' have to be in depth-first order;
9340 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
9342 * Isar: removed 'help' command, which hasn't been too helpful anyway;
9343 should instead use individual commands for printing items
9344 (print_commands, print_methods etc.);
9346 * Isar: added 'nothing' --- the empty list of theorems;
9351 * HOL/MicroJava: formalization of a fragment of Java, together with a
9352 corresponding virtual machine and a specification of its bytecode
9353 verifier and a lightweight bytecode verifier, including proofs of
9354 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
9355 Cornelia Pusch (see also the homepage of project Bali at
9356 http://isabelle.in.tum.de/Bali/);
9358 * HOL/Algebra: new theory of rings and univariate polynomials, by
9361 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
9362 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
9365 * HOL/Lattice: fundamental concepts of lattice theory and order
9366 structures, including duals, properties of bounds versus algebraic
9367 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
9368 Theorem for complete lattices etc.; may also serve as a demonstration
9369 for abstract algebraic reasoning using axiomatic type classes, and
9370 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
9372 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
9375 * HOL/IMPP: extension of IMP with local variables and mutually
9376 recursive procedures, by David von Oheimb;
9378 * HOL/Lambda: converted into new-style theory and document;
9380 * HOL/ex/Multiquote: example of multiple nested quotations and
9381 anti-quotations -- basically a generalized version of de-Bruijn
9382 representation; very useful in avoiding lifting of operations;
9384 * HOL/record: added general record equality rule to simpset; fixed
9385 select-update simplification procedure to handle extended records as
9386 well; admit "r" as field name;
9388 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
9389 other numeric types and also as the identity of groups, rings, etc.;
9391 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
9392 Types nat and int belong to this axclass;
9394 * HOL: greatly improved simplification involving numerals of type nat, int, real:
9395 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
9396 i*j + k + j*#3*i simplifies to #4*(i*j) + k
9397 two terms #m*u and #n*u are replaced by #(m+n)*u
9398 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
9399 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
9400 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
9402 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
9403 powerful prover for predicate logic but knows nothing of clasets; see
9404 ex/mesontest.ML and ex/mesontest2.ML for example applications;
9406 * HOL: new version of "case_tac" subsumes both boolean case split and
9407 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
9408 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
9410 * HOL: simplification no longer dives into case-expressions: only the
9411 selector expression is simplified, but not the remaining arms; to
9412 enable full simplification of case-expressions for datatype t, you may
9413 remove t.weak_case_cong from the simpset, either globally (Delcongs
9414 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
9416 * HOL/recdef: the recursion equations generated by 'recdef' for
9417 function 'f' are now called f.simps instead of f.rules; if all
9418 termination conditions are proved automatically, these simplification
9419 rules are added to the simpset, as in primrec; rules may be named
9420 individually as well, resulting in a separate list of theorems for
9423 * HOL/While is a new theory that provides a while-combinator. It
9424 permits the definition of tail-recursive functions without the
9425 provision of a termination measure. The latter is necessary once the
9426 invariant proof rule for while is applied.
9428 * HOL: new (overloaded) notation for the set of elements below/above
9429 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
9431 * HOL: theorems impI, allI, ballI bound as "strip";
9433 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
9434 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
9435 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
9437 * HOL/Real: "rabs" replaced by overloaded "abs" function;
9439 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
9440 main HOL, but was unused);
9442 * HOL: fewer consts declared as global (e.g. have to refer to
9443 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
9445 * HOL: tuned AST representation of nested pairs, avoiding bogus output
9446 in case of overlap with user translations (e.g. judgements over
9447 tuples); (note that the underlying logical represenation is still
9453 * ZF: simplification automatically cancels common terms in arithmetic
9454 expressions over nat and int;
9456 * ZF: new treatment of nat to minimize type-checking: all operators
9457 coerce their operands to a natural number using the function natify,
9458 making the algebraic laws unconditional;
9460 * ZF: as above, for int: operators coerce their operands to an integer
9461 using the function intify;
9463 * ZF: the integer library now contains many of the usual laws for the
9464 orderings, including $<=, and monotonicity laws for $+ and $*;
9466 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
9469 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
9470 to the simplifier and classical reasoner simultaneously;
9475 * Provers: blast_tac now handles actual object-logic rules as
9476 assumptions; note that auto_tac uses blast_tac internally as well;
9478 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
9479 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
9481 * Provers: delrules now handles destruct rules as well (no longer need
9482 explicit make_elim);
9484 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
9485 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
9486 use instead the strong form,
9487 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
9488 in HOL, FOL and ZF the function cla_make_elim will create such rules
9489 from destruct-rules;
9491 * Provers: Simplifier.easy_setup provides a fast path to basic
9492 Simplifier setup for new object-logics;
9494 * Pure: AST translation rules no longer require constant head on LHS;
9496 * Pure: improved name spaces: ambiguous output is qualified; support
9497 for hiding of names;
9499 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
9500 XSYMBOL_HOME; no longer need to do manual configuration in most
9503 * system: compression of ML heaps images may now be controlled via -c
9504 option of isabelle and isatool usedir (currently only observed by
9507 * system: isatool installfonts may handle X-Symbol fonts as well (very
9508 useful for remote X11);
9510 * system: provide TAGS file for Isabelle sources;
9512 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
9515 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
9516 timing flag supersedes proof_timing and Toplevel.trace;
9518 * ML: new combinators |>> and |>>> for incremental transformations
9519 with secondary results (e.g. certain theory extensions):
9521 * ML: PureThy.add_defs gets additional argument to indicate potential
9522 overloading (usually false);
9524 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
9529 New in Isabelle99 (October 1999)
9530 --------------------------------
9532 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9534 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
9535 are no longer simplified. (This allows the simplifier to unfold recursive
9536 functional programs.) To restore the old behaviour, declare
9538 Delcongs [if_weak_cong];
9540 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
9543 * HOL: the predicate "inj" is now defined by translation to "inj_on";
9545 * HOL/datatype: mutual_induct_tac no longer exists --
9546 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
9548 * HOL/typedef: fixed type inference for representing set; type
9549 arguments now have to occur explicitly on the rhs as type constraints;
9551 * ZF: The con_defs part of an inductive definition may no longer refer
9552 to constants declared in the same theory;
9554 * HOL, ZF: the function mk_cases, generated by the inductive
9555 definition package, has lost an argument. To simplify its result, it
9556 uses the default simpset instead of a supplied list of theorems.
9558 * HOL/List: the constructors of type list are now Nil and Cons;
9560 * Simplifier: the type of the infix ML functions
9561 setSSolver addSSolver setSolver addSolver
9562 is now simpset * solver -> simpset where `solver' is a new abstract type
9563 for packaging solvers. A solver is created via
9564 mk_solver: string -> (thm list -> int -> tactic) -> solver
9565 where the string argument is only a comment.
9570 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
9571 decision procedure for linear arithmetic. Currently it is used for
9572 types `nat', `int', and `real' in HOL (see below); it can, should and
9573 will be instantiated for other types and logics as well.
9575 * The simplifier now accepts rewrite rules with flexible heads, eg
9576 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
9577 They are applied like any rule with a non-pattern lhs, i.e. by first-order
9583 * New Isabelle/Isar subsystem provides an alternative to traditional
9584 tactical theorem proving; together with the ProofGeneral/isar user
9585 interface it offers an interactive environment for developing human
9586 readable proof documents (Isar == Intelligible semi-automated
9587 reasoning); for further information see isatool doc isar-ref,
9588 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
9590 * improved and simplified presentation of theories: better HTML markup
9591 (including colors), graph views in several sizes; isatool usedir now
9592 provides a proper interface for user theories (via -P option); actual
9593 document preparation based on (PDF)LaTeX is available as well (for
9594 new-style theories only); see isatool doc system for more information;
9596 * native support for Proof General, both for classic Isabelle and
9599 * ML function thm_deps visualizes dependencies of theorems and lemmas,
9600 using the graph browser tool;
9602 * Isabelle manuals now also available as PDF;
9604 * theory loader rewritten from scratch (may not be fully
9605 bug-compatible); old loadpath variable has been replaced by show_path,
9606 add_path, del_path, reset_path functions; new operations such as
9607 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
9610 * improved isatool install: option -k creates KDE application icon,
9611 option -p DIR installs standalone binaries;
9613 * added ML_PLATFORM setting (useful for cross-platform installations);
9614 more robust handling of platform specific ML images for SML/NJ;
9616 * the settings environment is now statically scoped, i.e. it is never
9617 created again in sub-processes invoked from isabelle, isatool, or
9620 * path element specification '~~' refers to '$ISABELLE_HOME';
9622 * in locales, the "assumes" and "defines" parts may be omitted if
9625 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
9628 * new print_mode "HTML";
9630 * new flag show_tags controls display of tags of theorems (which are
9631 basically just comments that may be attached by some tools);
9633 * Isamode 2.6 requires patch to accomodate change of Isabelle font
9634 mode and goal output format:
9636 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
9638 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
9640 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
9641 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
9643 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
9645 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
9647 * function bind_thms stores lists of theorems (cf. bind_thm);
9649 * new shorthand tactics ftac, eatac, datac, fatac;
9651 * qed (and friends) now accept "" as result name; in that case the
9652 theorem is not stored, but proper checks and presentation of the
9655 * theorem database now also indexes constants "Trueprop", "all",
9656 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
9661 ** HOL arithmetic **
9663 * There are now decision procedures for linear arithmetic over nat and
9666 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
9667 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
9668 are treated as atomic; subformulae not involving type `nat' or `int'
9669 are ignored; quantified subformulae are ignored unless they are
9670 positive universal or negative existential. The tactic has to be
9671 invoked by hand and can be a little bit slow. In particular, the
9672 running time is exponential in the number of occurrences of `min' and
9673 `max', and `-' on `nat'.
9675 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
9676 (negated) (in)equalities among the premises and the conclusion into
9677 account (i.e. no compound formulae) and does not know about `min' and
9678 `max', and `-' on `nat'. It is fast and is used automatically by the
9681 NB: At the moment, these decision procedures do not cope with mixed
9682 nat/int formulae where the two parts interact, such as `m < n ==>
9685 * HOL/Numeral provides a generic theory of numerals (encoded
9686 efficiently as bit strings); setup for types nat/int/real is in place;
9687 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
9688 int, existing theories and proof scripts may require a few additional
9691 * integer division and remainder can now be performed on constant
9694 * many properties of integer multiplication, division and remainder
9697 * An interface to the Stanford Validity Checker (SVC) is available through the
9698 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
9699 are proved automatically. SVC must be installed separately, and its results
9700 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
9701 invocation of the underlying oracle). For SVC see
9702 http://verify.stanford.edu/SVC
9704 * IsaMakefile: the HOL-Real target now builds an actual image;
9709 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
9710 (in Isabelle/Isar) -- by Gertrud Bauer;
9712 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
9713 analysis for assembly languages with subtypes;
9715 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
9716 -- avoids syntactic ambiguities and treats state, transition, and
9717 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
9718 changed syntax and (many) tactics;
9720 * HOL/inductive: Now also handles more general introduction rules such
9721 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
9722 theorems are now maintained within the theory (maintained via the
9725 * HOL/datatype: Now also handles arbitrarily branching datatypes
9726 (using function types) such as
9728 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
9730 * HOL/record: record_simproc (part of the default simpset) takes care
9731 of selectors applied to updated records; record_split_tac is no longer
9732 part of the default claset; update_defs may now be removed from the
9733 simpset in many cases; COMPATIBILITY: old behavior achieved by
9735 claset_ref () := claset() addSWrapper record_split_wrapper;
9736 Delsimprocs [record_simproc]
9738 * HOL/typedef: fixed type inference for representing set; type
9739 arguments now have to occur explicitly on the rhs as type constraints;
9741 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
9742 names rather than an ML expression;
9744 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
9745 supplied later. Program schemes can be defined, such as
9746 "While B C s = (if B s then While B C (C s) else s)"
9747 where the well-founded relation can be chosen after B and C have been given.
9749 * HOL/List: the constructors of type list are now Nil and Cons;
9750 INCOMPATIBILITY: while [] and infix # syntax is still there, of
9751 course, ML tools referring to List.list.op # etc. have to be adapted;
9753 * HOL_quantifiers flag superseded by "HOL" print mode, which is
9754 disabled by default; run isabelle with option -m HOL to get back to
9755 the original Gordon/HOL-style output;
9757 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
9758 ALL x<=y. P, EX x<y. P, EX x<=y. P;
9760 * HOL basic syntax simplified (more orthogonal): all variants of
9761 All/Ex now support plain / symbolic / HOL notation; plain syntax for
9762 Eps operator is provided as well: "SOME x. P[x]";
9764 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
9766 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
9767 thus available for user theories;
9769 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
9770 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
9773 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
9774 several times and then mp;
9779 * the notation <<...>> is now available as a notation for sequences of
9782 * the simplifier is now installed
9784 * the axiom system has been generalized (thanks to Soren Heilmann)
9786 * the classical reasoner now has a default rule database
9791 * new primrec section allows primitive recursive functions to be given
9792 directly (as in HOL) over datatypes and the natural numbers;
9794 * new tactics induct_tac and exhaust_tac for induction (or case
9795 analysis) over datatypes and the natural numbers;
9797 * the datatype declaration of type T now defines the recursor T_rec;
9799 * simplification automatically does freeness reasoning for datatype
9802 * automatic type-inference, with AddTCs command to insert new
9803 type-checking rules;
9805 * datatype introduction rules are now added as Safe Introduction rules
9808 * the syntax "if P then x else y" is now available in addition to
9812 *** Internal programming interfaces ***
9814 * tuned simplifier trace output; new flag debug_simp;
9816 * structures Vartab / Termtab (instances of TableFun) offer efficient
9817 tables indexed by indexname_ord / term_ord (compatible with aconv);
9819 * AxClass.axclass_tac lost the theory argument;
9821 * tuned current_goals_markers semantics: begin / end goal avoids
9822 printing empty lines;
9824 * removed prs and prs_fn hook, which was broken because it did not
9825 include \n in its semantics, forcing writeln to add one
9826 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
9827 string -> unit if you really want to output text without newline;
9829 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
9830 plain output, interface builders may have to enable 'isabelle_font'
9831 mode to get Isabelle font glyphs as before;
9833 * refined token_translation interface; INCOMPATIBILITY: output length
9834 now of type real instead of int;
9836 * theory loader actions may be traced via new ThyInfo.add_hook
9837 interface (see src/Pure/Thy/thy_info.ML); example application: keep
9838 your own database of information attached to *whole* theories -- as
9839 opposed to intra-theory data slots offered via TheoryDataFun;
9841 * proper handling of dangling sort hypotheses (at last!);
9842 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
9843 extra sort hypotheses that can be witnessed from the type signature;
9844 the force_strip_shyps flag is gone, any remaining shyps are simply
9845 left in the theorem (with a warning issued by strip_shyps_warning);
9849 New in Isabelle98-1 (October 1998)
9850 ----------------------------------
9852 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9854 * several changes of automated proof tools;
9856 * HOL: major changes to the inductive and datatype packages, including
9857 some minor incompatibilities of theory syntax;
9859 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
9862 * HOL: removed duplicate thms in Arith:
9863 less_imp_add_less should be replaced by trans_less_add1
9864 le_imp_add_le should be replaced by trans_le_add1
9866 * HOL: unary minus is now overloaded (new type constraints may be
9869 * HOL and ZF: unary minus for integers is now #- instead of #~. In
9870 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
9871 now taken as an integer constant.
9873 * Pure: ML function 'theory_of' renamed to 'theory';
9879 1. Asm_full_simp_tac is now more aggressive.
9880 1. It will sometimes reorient premises if that increases their power to
9882 2. It does no longer proceed strictly from left to right but may also
9883 rotate premises to achieve further simplification.
9884 For compatibility reasons there is now Asm_lr_simp_tac which is like the
9885 old Asm_full_simp_tac in that it does not rotate premises.
9886 2. The simplifier now knows a little bit about nat-arithmetic.
9888 * Classical reasoner: wrapper mechanism for the classical reasoner now
9889 allows for selected deletion of wrappers, by introduction of names for
9890 wrapper functionals. This implies that addbefore, addSbefore,
9891 addaltern, and addSaltern now take a pair (name, tactic) as argument,
9892 and that adding two tactics with the same name overwrites the first
9893 one (emitting a warning).
9894 type wrapper = (int -> tactic) -> (int -> tactic)
9895 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
9896 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
9897 delWrapper, delSWrapper: claset * string -> claset
9898 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
9900 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
9901 semantics; addbefore now affects only the unsafe part of step_tac
9902 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
9903 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
9906 * Classical reasoner: setwrapper to setWrapper and compwrapper to
9907 compWrapper; added safe wrapper (and access functions for it);
9909 * HOL/split_all_tac is now much faster and fails if there is nothing
9910 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
9911 and the names of the automatically generated variables have changed.
9912 split_all_tac has moved within claset() from unsafe wrappers to safe
9913 wrappers, which means that !!-bound variables are split much more
9914 aggressively, and safe_tac and clarify_tac now split such variables.
9915 If this splitting is not appropriate, use delSWrapper "split_all_tac".
9916 Note: the same holds for record_split_tac, which does the job of
9917 split_all_tac for record fields.
9919 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
9920 permanently to the default simpset using Addsplits just like
9921 Addsimps. They can be removed via Delsplits just like
9922 Delsimps. Lower-case versions are also available.
9924 * HOL/Simplifier: The rule split_if is now part of the default
9925 simpset. This means that the simplifier will eliminate all occurrences
9926 of if-then-else in the conclusion of a goal. To prevent this, you can
9927 either remove split_if completely from the default simpset by
9928 `Delsplits [split_if]' or remove it in a specific call of the
9929 simplifier using `... delsplits [split_if]'. You can also add/delete
9930 other case splitting rules to/from the default simpset: every datatype
9931 generates suitable rules `split_t_case' and `split_t_case_asm' (where
9932 t is the name of the datatype).
9934 * Classical reasoner / Simplifier combination: new force_tac (and
9935 derivatives Force_tac, force) combines rewriting and classical
9936 reasoning (and whatever other tools) similarly to auto_tac, but is
9937 aimed to solve the given subgoal completely.
9942 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
9943 and `goalw': the theory is no longer needed as an explicit argument -
9944 the current theory context is used; assumptions are no longer returned
9945 at the ML-level unless one of them starts with ==> or !!; it is
9946 recommended to convert to these new commands using isatool fixgoal
9947 (backup your sources first!);
9949 * new top-level commands 'thm' and 'thms' for retrieving theorems from
9950 the current theory context, and 'theory' to lookup stored theories;
9952 * new theory section 'locale' for declaring constants, assumptions and
9953 definitions that have local scope;
9955 * new theory section 'nonterminals' for purely syntactic types;
9957 * new theory section 'setup' for generic ML setup functions
9958 (e.g. package initialization);
9960 * the distribution now includes Isabelle icons: see
9961 lib/logo/isabelle-{small,tiny}.xpm;
9963 * isatool install - install binaries with absolute references to
9966 * isatool logo -- create instances of the Isabelle logo (as EPS);
9968 * print mode 'emacs' reserved for Isamode;
9970 * support multiple print (ast) translations per constant name;
9972 * theorems involving oracles are now printed with a suffixed [!];
9977 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
9979 * HOL/inductive package reorganized and improved: now supports mutual
9985 oddI "n : EVEN ==> Suc n : ODD"
9986 evenI "n : ODD ==> Suc n : EVEN"
9988 new theorem list "elims" contains an elimination rule for each of the
9989 recursive sets; inductive definitions now handle disjunctive premises
9990 correctly (also ZF);
9992 INCOMPATIBILITIES: requires Inductive as an ancestor; component
9993 "mutual_induct" no longer exists - the induction rule is always
9994 contained in "induct";
9997 * HOL/datatype package re-implemented and greatly improved: now
9998 supports mutually recursive datatypes such as
10001 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
10002 | SUM ('a aexp) ('a aexp)
10003 | DIFF ('a aexp) ('a aexp)
10006 'a bexp = LESS ('a aexp) ('a aexp)
10007 | AND ('a bexp) ('a bexp)
10008 | OR ('a bexp) ('a bexp)
10010 as well as indirectly recursive datatypes such as
10013 ('a, 'b) term = Var 'a
10014 | App 'b ((('a, 'b) term) list)
10016 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
10017 induction on mutually / indirectly recursive datatypes.
10019 Primrec equations are now stored in theory and can be accessed via
10020 <function_name>.simps.
10024 - Theories using datatypes must now have theory Datatype as an
10026 - The specific <typename>.induct_tac no longer exists - use the
10027 generic induct_tac instead.
10028 - natE has been renamed to nat.exhaust - use exhaust_tac
10029 instead of res_inst_tac ... natE. Note that the variable
10030 names in nat.exhaust differ from the names in natE, this
10031 may cause some "fragile" proofs to fail.
10032 - The theorems split_<typename>_case and split_<typename>_case_asm
10033 have been renamed to <typename>.split and <typename>.split_asm.
10034 - Since default sorts of type variables are now handled correctly,
10035 some datatype definitions may have to be annotated with explicit
10037 - Primrec definitions no longer require function name and type
10038 of recursive argument.
10040 Consider using isatool fixdatatype to adapt your theories and proof
10041 scripts to the new package (backup your sources first!).
10044 * HOL/record package: considerably improved implementation; now
10045 includes concrete syntax for record types, terms, updates; theorems
10046 for surjective pairing and splitting !!-bound record variables; proof
10047 support is as follows:
10049 1) standard conversions (selectors or updates applied to record
10050 constructor terms) are part of the standard simpset;
10052 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
10053 made part of standard simpset and claset via addIffs;
10055 3) a tactic for record field splitting (record_split_tac) is part of
10056 the standard claset (addSWrapper);
10058 To get a better idea about these rules you may retrieve them via
10059 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
10060 the name of your record type.
10062 The split tactic 3) conceptually simplifies by the following rule:
10064 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
10066 Thus any record variable that is bound by meta-all will automatically
10067 blow up into some record constructor term, consequently the
10068 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
10069 solve record problems automatically.
10072 * reorganized the main HOL image: HOL/Integ and String loaded by
10073 default; theory Main includes everything;
10075 * automatic simplification of integer sums and comparisons, using cancellation;
10077 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
10079 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
10081 * many new identities for unions, intersections, set difference, etc.;
10083 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
10084 called split_if, split_split, split_sum_case and split_nat_case (to go
10085 with add/delsplits);
10087 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
10088 (?x::unit) = (); this is made part of the default simpset, which COULD
10089 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
10090 'Delsimprocs [unit_eq_proc];' as last resort); also note that
10091 unit_abs_eta_conv is added in order to counter the effect of
10092 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
10095 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
10098 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
10099 It and 'sym RS equals0D' are now in the default claset, giving automatic
10100 disjointness reasoning but breaking a few old proofs.
10102 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
10103 to 'converse' from 'inverse' (for compatibility with ZF and some
10106 * HOL/recdef can now declare non-recursive functions, with {} supplied as
10107 the well-founded relation;
10109 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
10110 Compl A. The "Compl" syntax remains available as input syntax for this
10113 * HOL/Update: new theory of function updates:
10114 f(a:=b) == %x. if x=a then b else f x
10115 may also be iterated as in f(a:=b,c:=d,...);
10117 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
10120 - new function list_update written xs[i:=v] that updates the i-th
10121 list position. May also be iterated as in xs[i:=a,j:=b,...].
10122 - new function `upt' written [i..j(] which generates the list
10123 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
10124 bound write [i..j], which is a shorthand for [i..j+1(].
10125 - new lexicographic orderings and corresponding wellfoundedness theorems.
10128 - removed 'pred' (predecessor) function;
10129 - generalized some theorems about n-1;
10130 - many new laws about "div" and "mod";
10131 - new laws about greatest common divisors (see theory ex/Primes);
10133 * HOL/Relation: renamed the relational operator r^-1 "converse"
10134 instead of "inverse";
10136 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
10137 of the multiset ordering;
10139 * directory HOL/Real: a construction of the reals using Dedekind cuts
10140 (not included by default);
10142 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
10144 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
10145 programs, i.e. different program variables may have different types.
10147 * calling (stac rew i) now fails if "rew" has no effect on the goal
10148 [previously, this check worked only if the rewrite rule was unconditional]
10149 Now rew can involve either definitions or equalities (either == or =).
10154 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
10155 only the theorems proved on ZF.ML;
10157 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
10158 It and 'sym RS equals0D' are now in the default claset, giving automatic
10159 disjointness reasoning but breaking a few old proofs.
10161 * ZF/Update: new theory of function updates
10162 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
10163 may also be iterated as in f(a:=b,c:=d,...);
10165 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
10167 * calling (stac rew i) now fails if "rew" has no effect on the goal
10168 [previously, this check worked only if the rewrite rule was unconditional]
10169 Now rew can involve either definitions or equalities (either == or =).
10171 * case_tac provided for compatibility with HOL
10172 (like the old excluded_middle_tac, but with subgoals swapped)
10175 *** Internal programming interfaces ***
10177 * Pure: several new basic modules made available for general use, see
10178 also src/Pure/README;
10180 * improved the theory data mechanism to support encapsulation (data
10181 kind name replaced by private Object.kind, acting as authorization
10182 key); new type-safe user interface via functor TheoryDataFun; generic
10183 print_data function becomes basically useless;
10185 * removed global_names compatibility flag -- all theory declarations
10186 are qualified by default;
10188 * module Pure/Syntax now offers quote / antiquote translation
10189 functions (useful for Hoare logic etc. with implicit dependencies);
10190 see HOL/ex/Antiquote for an example use;
10192 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
10195 * new tactical CHANGED_GOAL for checking that a tactic modifies a
10198 * Display.print_goals function moved to Locale.print_goals;
10200 * standard print function for goals supports current_goals_markers
10201 variable for marking begin of proof, end of proof, start of goal; the
10202 default is ("", "", ""); setting current_goals_markers := ("<proof>",
10203 "</proof>", "<goal>") causes SGML like tagged proof state printing,
10208 New in Isabelle98 (January 1998)
10209 --------------------------------
10211 *** Overview of INCOMPATIBILITIES (see below for more details) ***
10213 * changed lexical syntax of terms / types: dots made part of long
10214 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
10216 * simpset (and claset) reference variable replaced by functions
10217 simpset / simpset_ref;
10219 * no longer supports theory aliases (via merge) and non-trivial
10220 implicit merge of thms' signatures;
10222 * most internal names of constants changed due to qualified names;
10224 * changed Pure/Sequence interface (see Pure/seq.ML);
10227 *** General Changes ***
10229 * hierachically structured name spaces (for consts, types, axms, thms
10230 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
10231 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
10232 isatool fixdots ensures space after dots (e.g. "%x. x"); set
10233 long_names for fully qualified output names; NOTE: ML programs
10234 (special tactics, packages etc.) referring to internal names may have
10235 to be adapted to cope with fully qualified names; in case of severe
10236 backward campatibility problems try setting 'global_names' at compile
10237 time to have enrything declared within a flat name space; one may also
10238 fine tune name declarations in theories via the 'global' and 'local'
10241 * reimplemented the implicit simpset and claset using the new anytype
10242 data filed in signatures; references simpset:simpset ref etc. are
10243 replaced by functions simpset:unit->simpset and
10244 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
10245 to patch your ML files accordingly;
10247 * HTML output now includes theory graph data for display with Java
10248 applet or isatool browser; data generated automatically via isatool
10249 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
10251 * defs may now be conditional; improved rewrite_goals_tac to handle
10252 conditional equations;
10254 * defs now admits additional type arguments, using TYPE('a) syntax;
10256 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
10257 creates a new theory node; implicit merge of thms' signatures is
10258 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
10259 transfer:theory->thm->thm in (rare) cases;
10261 * improved handling of draft signatures / theories; draft thms (and
10262 ctyps, cterms) are automatically promoted to real ones;
10264 * slightly changed interfaces for oracles: admit many per theory, named
10265 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
10267 * print_goals: optional output of const types (set show_consts and
10270 * improved output of warnings (###) and errors (***);
10272 * subgoal_tac displays a warning if the new subgoal has type variables;
10274 * removed old README and Makefiles;
10276 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
10278 * removed obsolete init_pps and init_database;
10280 * deleted the obsolete tactical STATE, which was declared by
10281 fun STATE tacfun st = tacfun st st;
10283 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
10284 (which abbreviates $HOME);
10286 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
10287 use isatool fixseq to adapt your ML programs (this works for fully
10288 qualified references to the Sequence structure only!);
10290 * use_thy no longer requires writable current directory; it always
10291 reloads .ML *and* .thy file, if either one is out of date;
10294 *** Classical Reasoner ***
10296 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
10297 tactics that use classical reasoning to simplify a subgoal without
10298 splitting it into several subgoals;
10300 * Safe_tac: like safe_tac but uses the default claset;
10305 * added simplification meta rules:
10306 (asm_)(full_)simplify: simpset -> thm -> thm;
10308 * simplifier.ML no longer part of Pure -- has to be loaded by object
10311 * added prems argument to simplification procedures;
10313 * HOL, FOL, ZF: added infix function `addsplits':
10314 instead of `<simpset> setloop (split_tac <thms>)'
10315 you can simply write `<simpset> addsplits <thms>'
10320 * TYPE('a) syntax for type reflection terms;
10322 * no longer handles consts with name "" -- declare as 'syntax' instead;
10324 * pretty printer: changed order of mixfix annotation preference (again!);
10326 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
10331 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
10332 with `addloop' of the simplifier to faciliate case splitting in premises.
10334 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
10336 * HOL/Auth: new protocol proofs including some for the Internet
10339 * HOL/Map: new theory of `maps' a la VDM;
10341 * HOL/simplifier: simplification procedures nat_cancel_sums for
10342 cancelling out common nat summands from =, <, <= (in)equalities, or
10343 differences; simplification procedures nat_cancel_factor for
10344 cancelling common factor from =, <, <= (in)equalities over natural
10345 sums; nat_cancel contains both kinds of procedures, it is installed by
10346 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
10348 * HOL/simplifier: terms of the form
10349 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
10351 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
10352 and those of the form
10353 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
10355 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
10358 Each datatype `t' now comes with a theorem `split_t_case' of the form
10360 P(t_case f1 ... fn x) =
10361 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
10363 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
10366 and a theorem `split_t_case_asm' of the form
10368 P(t_case f1 ... fn x) =
10369 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
10371 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
10373 which can be added to a simpset via `addsplits'. The existing theorems
10374 expand_list_case and expand_option_case have been renamed to
10375 split_list_case and split_option_case.
10378 - `pred n' is automatically converted to `n-1'.
10379 Users are strongly encouraged not to use `pred' any longer,
10380 because it will disappear altogether at some point.
10381 - Users are strongly encouraged to write "0 < n" rather than
10382 "n ~= 0". Theorems and proof tools have been modified towards this
10386 the function "set_of_list" has been renamed "set" (and its theorems too);
10387 the function "nth" now takes its arguments in the reverse order and
10388 has acquired the infix notation "!" as in "xs!n".
10390 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
10392 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
10393 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
10395 * HOL/record: extensible records with schematic structural subtyping
10396 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
10397 still lacks various theorems and concrete record syntax;
10402 * removed "axioms" and "generated by" sections;
10404 * replaced "ops" section by extended "consts" section, which is capable of
10405 handling the continuous function space "->" directly;
10408 . proves theorems immediately and stores them in the theory,
10409 . creates hierachical name space,
10410 . now uses normal mixfix annotations (instead of cinfix...),
10411 . minor changes to some names and values (for consistency),
10412 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
10413 . separator between mutual domain defs: changed "," to "and",
10414 . improved handling of sort constraints; now they have to
10415 appear on the left-hand side of the equations only;
10417 * fixed LAM <x,y,zs>.b syntax;
10419 * added extended adm_tac to simplifier in HOLCF -- can now discharge
10420 adm (%x. P (t x)), where P is chainfinite and t continuous;
10425 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
10426 with `addloop' of the simplifier to faciliate case splitting in premises.
10428 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
10429 in HOL, they strip ALL and --> from proved theorems;
10433 New in Isabelle94-8 (May 1997)
10434 ------------------------------
10436 *** General Changes ***
10438 * new utilities to build / run / maintain Isabelle etc. (in parts
10439 still somewhat experimental); old Makefiles etc. still functional;
10441 * new 'Isabelle System Manual';
10443 * INSTALL text, together with ./configure and ./build scripts;
10445 * reimplemented type inference for greater efficiency, better error
10446 messages and clean internal interface;
10448 * prlim command for dealing with lots of subgoals (an easier way of
10449 setting goals_limit);
10454 * supports alternative (named) syntax tables (parser and pretty
10455 printer); internal interface is provided by add_modesyntax(_i);
10457 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
10458 be used in conjunction with the Isabelle symbol font; uses the
10459 "symbols" syntax table;
10461 * added token_translation interface (may translate name tokens in
10462 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
10463 the current print_mode); IMPORTANT: user print translation functions
10464 are responsible for marking newly introduced bounds
10465 (Syntax.mark_boundT);
10467 * token translations for modes "xterm" and "xterm_color" that display
10468 names in bold, underline etc. or colors (which requires a color
10471 * infixes may now be declared with names independent of their syntax;
10473 * added typed_print_translation (like print_translation, but may
10474 access type of constant);
10477 *** Classical Reasoner ***
10479 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
10480 some limitations. Blast_tac...
10481 + ignores addss, addbefore, addafter; this restriction is intrinsic
10482 + ignores elimination rules that don't have the correct format
10483 (the conclusion MUST be a formula variable)
10484 + ignores types, which can make HOL proofs fail
10485 + rules must not require higher-order unification, e.g. apply_type in ZF
10486 [message "Function Var's argument not a bound variable" relates to this]
10487 + its proof strategy is more general but can actually be slower
10489 * substitution with equality assumptions no longer permutes other
10492 * minor changes in semantics of addafter (now called addaltern); renamed
10493 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
10494 (and access functions for it);
10496 * improved combination of classical reasoner and simplifier:
10497 + functions for handling clasimpsets
10498 + improvement of addss: now the simplifier is called _after_ the
10500 + safe variant of addss called addSss: uses safe simplifications
10501 _during_ the safe steps. It is more complete as it allows multiple
10502 instantiations of unknowns (e.g. with slow_tac).
10506 * added interface for simplification procedures (functions that
10507 produce *proven* rewrite rules on the fly, depending on current
10510 * ordering on terms as parameter (used for ordered rewriting);
10512 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
10514 * the solver is now split into a safe and an unsafe part.
10515 This should be invisible for the normal user, except that the
10516 functions setsolver and addsolver have been renamed to setSolver and
10517 addSolver; added safe_asm_full_simp_tac;
10522 * a generic induction tactic `induct_tac' which works for all datatypes and
10523 also for type `nat';
10525 * a generic case distinction tactic `exhaust_tac' which works for all
10526 datatypes and also for type `nat';
10528 * each datatype comes with a function `size';
10530 * patterns in case expressions allow tuple patterns as arguments to
10531 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
10533 * primrec now also works with type nat;
10535 * recdef: a new declaration form, allows general recursive functions to be
10536 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
10538 * the constant for negation has been renamed from "not" to "Not" to
10539 harmonize with FOL, ZF, LK, etc.;
10541 * HOL/ex/LFilter theory of a corecursive "filter" functional for
10544 * HOL/Modelcheck demonstrates invocation of model checker oracle;
10546 * HOL/ex/Ring.thy declares cring_simp, which solves equational
10547 problems in commutative rings, using axiomatic type classes for + and *;
10549 * more examples in HOL/MiniML and HOL/Auth;
10551 * more default rewrite rules for quantifiers, union/intersection;
10553 * a new constant `arbitrary == @x.False';
10555 * HOLCF/IOA replaces old HOL/IOA;
10557 * HOLCF changes: derived all rules and arities
10558 + axiomatic type classes instead of classes
10559 + typedef instead of faking type definitions
10560 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
10561 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
10562 + eliminated the types void, one, tr
10563 + use unit lift and bool lift (with translations) instead of one and tr
10564 + eliminated blift from Lift3.thy (use Def instead of blift)
10565 all eliminated rules are derived as theorems --> no visible changes ;
10570 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
10571 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
10572 as ZF_cs addSIs [equalityI];
10576 New in Isabelle94-7 (November 96)
10577 ---------------------------------
10579 * allowing negative levels (as offsets) in prlev and choplev;
10581 * super-linear speedup for large simplifications;
10583 * FOL, ZF and HOL now use miniscoping: rewriting pushes
10584 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
10585 FAIL); can suppress it using the command Delsimps (ex_simps @
10586 all_simps); De Morgan laws are also now included, by default;
10588 * improved printing of ==> : ~:
10590 * new object-logic "Sequents" adds linear logic, while replacing LK
10591 and Modal (thanks to Sara Kalvala);
10593 * HOL/Auth: correctness proofs for authentication protocols;
10595 * HOL: new auto_tac combines rewriting and classical reasoning (many
10596 examples on HOL/Auth);
10598 * HOL: new command AddIffs for declaring theorems of the form P=Q to
10599 the rewriter and classical reasoner simultaneously;
10601 * function uresult no longer returns theorems in "standard" format;
10602 regain previous version by: val uresult = standard o uresult;
10606 New in Isabelle94-6
10607 -------------------
10609 * oracles -- these establish an interface between Isabelle and trusted
10610 external reasoners, which may deliver results as theorems;
10612 * proof objects (in particular record all uses of oracles);
10614 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
10616 * "constdefs" section in theory files;
10618 * "primrec" section (HOL) no longer requires names;
10620 * internal type "tactic" now simply "thm -> thm Sequence.seq";
10624 New in Isabelle94-5
10625 -------------------
10627 * reduced space requirements;
10629 * automatic HTML generation from theories;
10631 * theory files no longer require "..." (quotes) around most types;
10633 * new examples, including two proofs of the Church-Rosser theorem;
10635 * non-curried (1994) version of HOL is no longer distributed;
10639 New in Isabelle94-4
10640 -------------------
10642 * greatly reduced space requirements;
10644 * theory files (.thy) no longer require \...\ escapes at line breaks;
10646 * searchable theorem database (see the section "Retrieving theorems" on
10647 page 8 of the Reference Manual);
10649 * new examples, including Grabczewski's monumental case study of the
10652 * The previous version of HOL renamed to Old_HOL;
10654 * The new version of HOL (previously called CHOL) uses a curried syntax
10655 for functions. Application looks like f a b instead of f(a,b);
10657 * Mutually recursive inductive definitions finally work in HOL;
10659 * In ZF, pattern-matching on tuples is now available in all abstractions and
10660 translates to the operator "split";
10664 New in Isabelle94-3
10665 -------------------
10667 * new infix operator, addss, allowing the classical reasoner to
10668 perform simplification at each step of its search. Example:
10669 fast_tac (cs addss ss)
10671 * a new logic, CHOL, the same as HOL, but with a curried syntax
10672 for functions. Application looks like f a b instead of f(a,b). Also pairs
10673 look like (a,b) instead of <a,b>;
10675 * PLEASE NOTE: CHOL will eventually replace HOL!
10677 * In CHOL, pattern-matching on tuples is now available in all abstractions.
10678 It translates to the operator "split". A new theory of integers is available;
10680 * In ZF, integer numerals now denote two's-complement binary integers.
10681 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
10683 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
10684 of the Axiom of Choice;
10688 New in Isabelle94-2
10689 -------------------
10691 * Significantly faster resolution;
10693 * the different sections in a .thy file can now be mixed and repeated
10696 * Database of theorems for FOL, HOL and ZF. New
10697 commands including qed, qed_goal and bind_thm store theorems in the database.
10699 * Simple database queries: return a named theorem (get_thm) or all theorems of
10700 a given theory (thms_of), or find out what theory a theorem was proved in
10703 * Bugs fixed in the inductive definition and datatype packages;
10705 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
10706 and HOL_dup_cs obsolete;
10708 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
10711 * Simpler definition of function space in ZF;
10713 * new results about cardinal and ordinal arithmetic in ZF;
10715 * 'subtype' facility in HOL for introducing new types as subsets of existing
10718 :mode=isabelle-news:wrap=hard:maxLineLen=72: