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 * Stronger precedence of syntax for big intersection and union on
140 sets, in accordance with corresponding lattice operations.
143 * Notation "{p:A. P}" now allows tuple patterns as well.
145 * Nested case expressions are now translated in a separate check phase
146 rather than during parsing. The data for case combinators is separated
147 from the datatype package. The declaration attribute
148 "case_translation" can be used to register new case combinators:
150 declare [[case_translation case_combinator constructor1 ... constructorN]]
153 - 'code_printing' unifies 'code_const' / 'code_type' / 'code_class' /
155 - 'code_identifier' declares name hints for arbitrary identifiers in
156 generated code, subsuming 'code_modulename'.
158 See the isar-ref manual for syntax diagrams, and the HOL theories for
161 * Attibute 'code': 'code' now declares concrete and abstract code
162 equations uniformly. Use explicit 'code equation' and 'code abstract'
163 to distinguish both when desired.
165 * Discontinued theories Code_Integer and Efficient_Nat by a more
166 fine-grain stack of theories Code_Target_Int, Code_Binary_Nat,
167 Code_Target_Nat and Code_Target_Numeral. See the tutorial on code
168 generation for details. INCOMPATIBILITY.
170 * Numeric types are mapped by default to target language numerals:
171 natural (replaces former code_numeral) and integer (replaces former
172 code_int). Conversions are available as integer_of_natural /
173 natural_of_integer / integer_of_nat / nat_of_integer (in HOL) and
174 Code_Numeral.integer_of_natural / Code_Numeral.natural_of_integer (in
175 ML). INCOMPATIBILITY.
177 * Function package: For mutually recursive functions f and g, separate
178 cases rules f.cases and g.cases are generated instead of unusable
179 f_g.cases which exposed internal sum types. Potential INCOMPATIBILITY,
180 in the case that the unusable rule was used nevertheless.
182 * Function package: For each function f, new rules f.elims are
183 generated, which eliminate equalities of the form "f x = t".
185 * New command 'fun_cases' derives ad-hoc elimination rules for
186 function equations as simplified instances of f.elims, analogous to
187 inductive_cases. See ~~/src/HOL/ex/Fundefs.thy for some examples.
190 - parametrized correspondence relations are now supported:
191 + parametricity theorems for the raw term can be specified in
192 the command lift_definition, which allow us to generate stronger
194 + setup_lifting generates stronger transfer rules if parametric
195 correspondence relation can be generated
196 + various new properties of the relator must be specified to support
198 + parametricity theorem for the Quotient relation can be specified
199 - setup_lifting generates domain rules for the Transfer package
200 - stronger reflexivity prover of respectfulness theorems for type
202 - ===> and --> are now local. The symbols can be introduced
203 by interpreting the locale lifting_syntax (typically in an
205 - Lifting/Transfer relevant parts of Library/Quotient_* are now in
206 Main. Potential INCOMPATIBILITY
207 - new commands for restoring and deleting Lifting/Transfer context:
208 lifting_forget, lifting_update
209 - the command print_quotmaps was renamed to print_quot_maps.
213 - better support for domains in Transfer: replace Domainp T
214 by the actual invariant in a transferred goal
215 - transfer rules can have as assumptions other transfer rules
216 - Experimental support for transferring from the raw level to the
217 abstract level: Transfer.transferred attribute
218 - Attribute version of the transfer method: untransferred attribute
220 * Reification and reflection:
221 - Reification is now directly available in HOL-Main in structure
223 - Reflection now handles multiple lists with variables also.
224 - The whole reflection stack has been decomposed into conversions.
227 * Revised devices for recursive definitions over finite sets:
228 - Only one fundamental fold combinator on finite set remains:
229 Finite_Set.fold :: ('a => 'b => 'b) => 'b => 'a set => 'b
230 This is now identity on infinite sets.
231 - Locales ("mini packages") for fundamental definitions with
232 Finite_Set.fold: folding, folding_idem.
233 - Locales comm_monoid_set, semilattice_order_set and
234 semilattice_neutr_order_set for big operators on sets.
235 See theory Big_Operators for canonical examples.
236 Note that foundational constants comm_monoid_set.F and
237 semilattice_set.F correspond to former combinators fold_image
238 and fold1 respectively. These are now gone. You may use
239 those foundational constants as substitutes, but it is
240 preferable to interpret the above locales accordingly.
241 - Dropped class ab_semigroup_idem_mult (special case of lattice,
242 no longer needed in connection with Finite_Set.fold etc.)
244 card.union_inter ~> card_Un_Int [symmetric]
245 card.union_disjoint ~> card_Un_disjoint
248 * Locale hierarchy for abstract orderings and (semi)lattices.
250 * Complete_Partial_Order.admissible is defined outside the type class
251 ccpo, but with mandatory prefix ccpo. Admissibility theorems lose the
252 class predicate assumption or sort constraint when possible.
255 * Introduce type class "conditionally_complete_lattice": Like a
256 complete lattice but does not assume the existence of the top and
257 bottom elements. Allows to generalize some lemmas about reals and
258 extended reals. Removed SupInf and replaced it by the instantiation
259 of conditionally_complete_lattice for real. Renamed lemmas about
260 conditionally-complete lattice from Sup_... to cSup_... and from
261 Inf_... to cInf_... to avoid hidding of similar complete lattice
264 * Introduce type class linear_continuum as combination of
265 conditionally-complete lattices and inner dense linorders which have
266 more than one element. INCOMPATIBILITY.
268 * Introduced type classes order_top and order_bot. The old classes top
269 and bot only contain the syntax without assumptions. INCOMPATIBILITY:
270 Rename bot -> order_bot, top -> order_top
272 * Introduce type classes "no_top" and "no_bot" for orderings without
273 top and bottom elements.
275 * Split dense_linorder into inner_dense_order and no_top, no_bot.
277 * Complex_Main: Unify and move various concepts from
278 HOL-Multivariate_Analysis to HOL-Complex_Main.
280 - Introduce type class (lin)order_topology and
281 linear_continuum_topology. Allows to generalize theorems about
282 limits and order. Instances are reals and extended reals.
284 - continuous and continuos_on from Multivariate_Analysis:
285 "continuous" is the continuity of a function at a filter. "isCont"
286 is now an abbrevitation: "isCont x f == continuous (at _) f".
288 Generalized continuity lemmas from isCont to continuous on an
291 - compact from Multivariate_Analysis. Use Bolzano's lemma to prove
292 compactness of closed intervals on reals. Continuous functions
293 attain infimum and supremum on compact sets. The inverse of a
294 continuous function is continuous, when the function is continuous
297 - connected from Multivariate_Analysis. Use it to prove the
298 intermediate value theorem. Show connectedness of intervals on
299 linear_continuum_topology).
301 - first_countable_topology from Multivariate_Analysis. Is used to
302 show equivalence of properties on the neighbourhood filter of x and
303 on all sequences converging to x.
305 - FDERIV: Definition of has_derivative moved to Deriv.thy. Moved
306 theorems from Library/FDERIV.thy to Deriv.thy and base the
307 definition of DERIV on FDERIV. Add variants of DERIV and FDERIV
308 which are restricted to sets, i.e. to represent derivatives from
311 - Removed the within-filter. It is replaced by the principal filter:
313 F within X = inf F (principal X)
315 - Introduce "at x within U" as a single constant, "at x" is now an
316 abbreviation for "at x within UNIV"
318 - Introduce named theorem collections tendsto_intros,
319 continuous_intros, continuous_on_intros and FDERIV_intros. Theorems
320 in tendsto_intros (or FDERIV_intros) are also available as
321 tendsto_eq_intros (or FDERIV_eq_intros) where the right-hand side
322 is replaced by a congruence rule. This allows to apply them as
323 intro rules and then proving equivalence by the simplifier.
325 - Restructured theories in HOL-Complex_Main:
327 + Moved RealDef and RComplete into Real
329 + Introduced Topological_Spaces and moved theorems about
330 topological spaces, filters, limits and continuity to it
332 + Renamed RealVector to Real_Vector_Spaces
334 + Split Lim, SEQ, Series into Topological_Spaces,
335 Real_Vector_Spaces, and Limits
337 + Moved Ln and Log to Transcendental
339 + Moved theorems about continuity from Deriv to Topological_Spaces
341 - Remove various auxiliary lemmas.
347 - Reduce incidence of "too high arity" errors
351 isar_shrink ~> isar_compress
353 - Added options "isar_try0", "spy"
354 - Better support for "isar_proofs"
355 - MaSh has been fined-tuned and now runs as a local server
357 * Improved support for ad hoc overloading of constants (see also
358 isar-ref manual and ~~/src/HOL/ex/Adhoc_Overloading_Examples.thy).
360 * Library/Polynomial.thy:
361 - Use lifting for primitive definitions.
362 - Explicit conversions from and to lists of coefficients, used for
364 - Replaced recursion operator poly_rec by fold_coeffs.
365 - Prefer pre-existing gcd operation for gcd.
367 poly_eq_iff ~> poly_eq_poly_eq_iff
369 expand_poly_eq ~> poly_eq_iff
372 * New Library/Simps_Case_Conv.thy: Provides commands simps_of_case and
373 case_of_simps to convert function definitions between a list of
374 equations with patterns on the lhs and a single equation with case
375 expressions on the rhs. See also Ex/Simps_Case_Conv_Examples.thy.
377 * New Library/FSet.thy: type of finite sets defined as a subtype of
378 sets defined by Lifting/Transfer.
380 * Discontinued theory src/HOL/Library/Eval_Witness. INCOMPATIBILITY.
382 * Consolidation of library theories on product orders:
384 Product_Lattice ~> Product_Order -- pointwise order on products
385 Product_ord ~> Product_Lexorder -- lexicographic order on products
389 * Imperative-HOL: The MREC combinator is considered legacy and no
390 longer included by default. INCOMPATIBILITY, use partial_function
391 instead, or import theory Legacy_Mrec as a fallback.
393 * HOL-Algebra: Discontinued theories ~~/src/HOL/Algebra/abstract and
394 ~~/src/HOL/Algebra/poly. Existing theories should be based on
395 ~~/src/HOL/Library/Polynomial instead. The latter provides
396 integration with HOL's type classes for rings. INCOMPATIBILITY.
399 - Various improvements to BNF-based (co)datatype package, including
400 new commands "primrec_new", "primcorec", and
401 "datatype_new_compat", as well as documentation. See
402 "datatypes.pdf" for details.
403 - New "coinduction" method to avoid some boilerplate (compared to
409 - Renamed many generated theorems, including
411 map_comp' ~> map_comp
421 * Spec_Check is a Quickcheck tool for Isabelle/ML. The ML function
422 "check_property" allows to check specifications of the form "ALL x y
423 z. prop x y z". See also ~~/src/Tools/Spec_Check/ with its
424 Examples.thy in particular.
426 * Improved printing of exception trace in Poly/ML 5.5.1, with regular
427 tracing output in the command transaction context instead of physical
428 stdout. See also Toplevel.debug, Toplevel.debugging and
429 ML_Compiler.exn_trace.
431 * ML type "theory" is now immutable, without any special treatment of
432 drafts or linear updates (which could lead to "stale theory" errors in
433 the past). Discontinued obsolete operations like Theory.copy,
434 Theory.checkpoint, and the auxiliary type theory_ref. Minor
437 * More uniform naming of goal functions for skipped proofs:
439 Skip_Proof.prove ~> Goal.prove_sorry
440 Skip_Proof.prove_global ~> Goal.prove_sorry_global
442 Minor INCOMPATIBILITY.
444 * Simplifier tactics and tools use proper Proof.context instead of
445 historic type simpset. Old-style declarations like addsimps,
446 addsimprocs etc. operate directly on Proof.context. Raw type simpset
447 retains its use as snapshot of the main Simplifier context, using
448 simpset_of and put_simpset on Proof.context. INCOMPATIBILITY -- port
449 old tools by making them depend on (ctxt : Proof.context) instead of
450 (ss : simpset), then turn (simpset_of ctxt) into ctxt.
452 * Modifiers for classical wrappers (e.g. addWrapper, delWrapper)
453 operate on Proof.context instead of claset, for uniformity with addIs,
454 addEs, addDs etc. Note that claset_of and put_claset allow to manage
455 clasets separately from the context.
457 * Discontinued obsolete ML antiquotations @{claset} and @{simpset}.
458 INCOMPATIBILITY, use @{context} instead.
460 * Antiquotation @{theory_context A} is similar to @{theory A}, but
461 presents the result as initial Proof.context.
466 * Discontinued obsolete isabelle usedir, mkdir, make -- superseded by
467 "isabelle build" in Isabelle2013. INCOMPATIBILITY.
469 * Discontinued obsolete isabelle-process options -f and -u (former
470 administrative aliases of option -e). Minor INCOMPATIBILITY.
472 * Discontinued obsolete isabelle print tool, and PRINT_COMMAND
475 * Discontinued ISABELLE_DOC_FORMAT settings variable and historic
476 document formats: dvi.gz, ps, ps.gz -- the default document format is
479 * Isabelle settings variable ISABELLE_BUILD_JAVA_OPTIONS allows to
480 specify global resources of the JVM process run by isabelle build.
482 * Toplevel executable $ISABELLE_HOME/bin/isabelle_scala_script allows
483 to run Isabelle/Scala source files as standalone programs.
485 * Improved "isabelle keywords" tool (for old-style ProofGeneral
486 keyword tables): use Isabelle/Scala operations, which inspect outer
487 syntax without requiring to build sessions first.
489 * Sessions may be organized via 'chapter' specifications in the ROOT
490 file, which determines a two-level hierarchy of browser info. The old
491 tree-like organization via implicit sub-session relation (with its
492 tendency towards erratic fluctuation of URLs) has been discontinued.
493 The default chapter is called "Unsorted". Potential INCOMPATIBILITY
494 for HTML presentation of theories.
498 New in Isabelle2013 (February 2013)
499 -----------------------------------
503 * Theorem status about oracles and unfinished/failed future proofs is
504 no longer printed by default, since it is incompatible with
505 incremental / parallel checking of the persistent document model. ML
506 function Thm.peek_status may be used to inspect a snapshot of the
507 ongoing evaluation process. Note that in batch mode --- notably
508 isabelle build --- the system ensures that future proofs of all
509 accessible theorems in the theory context are finished (as before).
511 * Configuration option show_markup controls direct inlining of markup
512 into the printed representation of formal entities --- notably type
513 and sort constraints. This enables Prover IDE users to retrieve that
514 information via tooltips in the output window, for example.
516 * Command 'ML_file' evaluates ML text from a file directly within the
517 theory, without any predeclaration via 'uses' in the theory header.
519 * Old command 'use' command and corresponding keyword 'uses' in the
520 theory header are legacy features and will be discontinued soon.
521 Tools that load their additional source files may imitate the
522 'ML_file' implementation, such that the system can take care of
523 dependencies properly.
525 * Discontinued obsolete method fastsimp / tactic fast_simp_tac, which
526 is called fastforce / fast_force_tac already since Isabelle2011-1.
528 * Updated and extended "isar-ref" and "implementation" manual, reduced
529 remaining material in old "ref" manual.
531 * Improved support for auxiliary contexts that indicate block structure
532 for specifications. Nesting of "context fixes ... context assumes ..."
533 and "class ... context ...".
535 * Attribute "consumes" allows a negative value as well, which is
536 interpreted relatively to the total number of premises of the rule in
537 the target context. This form of declaration is stable when exported
538 from a nested 'context' with additional assumptions. It is the
539 preferred form for definitional packages, notably cases/rules produced
540 in HOL/inductive and HOL/function.
542 * More informative error messages for Isar proof commands involving
543 lazy enumerations (method applications etc.).
545 * Refined 'help' command to retrieve outer syntax commands according
546 to name patterns (with clickable results).
549 *** Prover IDE -- Isabelle/Scala/jEdit ***
551 * Parallel terminal proofs ('by') are enabled by default, likewise
552 proofs that are built into packages like 'datatype', 'function'. This
553 allows to "run ahead" checking the theory specifications on the
554 surface, while the prover is still crunching on internal
555 justifications. Unfinished / cancelled proofs are restarted as
556 required to complete full proof checking eventually.
558 * Improved output panel with tooltips, hyperlinks etc. based on the
559 same Rich_Text_Area as regular Isabelle/jEdit buffers. Activation of
560 tooltips leads to some window that supports the same recursively,
561 which can lead to stacks of tooltips as the semantic document content
562 is explored. ESCAPE closes the whole stack, individual windows may be
563 closed separately, or detached to become independent jEdit dockables.
565 * Improved support for commands that produce graph output: the text
566 message contains a clickable area to open a new instance of the graph
569 * More robust incremental parsing of outer syntax (partial comments,
570 malformed symbols). Changing the balance of open/close quotes and
571 comment delimiters works more conveniently with unfinished situations
572 that frequently occur in user interaction.
574 * More efficient painting and improved reactivity when editing large
575 files. More scalable management of formal document content.
577 * Smarter handling of tracing messages: prover process pauses after
578 certain number of messages per command transaction, with some user
579 dialog to stop or continue. This avoids swamping the front-end with
580 potentially infinite message streams.
582 * More plugin options and preferences, based on Isabelle/Scala. The
583 jEdit plugin option panel provides access to some Isabelle/Scala
584 options, including tuning parameters for editor reactivity and color
587 * Dockable window "Symbols" provides some editing support for Isabelle
590 * Dockable window "Monitor" shows ML runtime statistics. Note that
591 continuous display of the chart slows down the system.
593 * Improved editing support for control styles: subscript, superscript,
594 bold, reset of style -- operating on single symbols or text
595 selections. Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT.
597 * Actions isabelle.increase-font-size and isabelle.decrease-font-size
598 adjust the main text area font size, and its derivatives for output,
599 tooltips etc. Cf. keyboard shortcuts C-PLUS and C-MINUS, which often
600 need to be adapted to local keyboard layouts.
602 * More reactive completion popup by default: use \t (TAB) instead of
603 \n (NEWLINE) to minimize intrusion into regular flow of editing. See
604 also "Plugin Options / SideKick / General / Code Completion Options".
606 * Implicit check and build dialog of the specified logic session
607 image. For example, HOL, HOLCF, HOL-Nominal can be produced on
608 demand, without bundling big platform-dependent heap images in the
609 Isabelle distribution.
611 * Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates
612 from Oracle provide better multi-platform experience. This version is
613 now bundled exclusively with Isabelle.
618 * Code generation for Haskell: restrict unqualified imports from
619 Haskell Prelude to a small set of fundamental operations.
621 * Command 'export_code': relative file names are interpreted
622 relatively to master directory of current theory rather than the
623 rather arbitrary current working directory. INCOMPATIBILITY.
625 * Discontinued obsolete attribute "COMP". Potential INCOMPATIBILITY,
626 use regular rule composition via "OF" / "THEN", or explicit proof
627 structure instead. Note that Isabelle/ML provides a variety of
628 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied
629 with some care where this is really required.
631 * Command 'typ' supports an additional variant with explicit sort
632 constraint, to infer and check the most general type conforming to a
633 given sort. Example (in HOL):
635 typ "_ * _ * bool * unit" :: finite
637 * Command 'locale_deps' visualizes all locales and their relations as
645 - Added MaSh relevance filter based on machine-learning; see the
646 Sledgehammer manual for details.
647 - Polished Isar proofs generated with "isar_proofs" option.
648 - Rationalized type encodings ("type_enc" option).
649 - Renamed "kill_provers" subcommand to "kill_all".
651 isar_proof ~> isar_proofs
652 isar_shrink_factor ~> isar_shrink
653 max_relevant ~> max_facts
654 relevance_thresholds ~> fact_thresholds
656 * Quickcheck: added an optimisation for equality premises. It is
657 switched on by default, and can be switched off by setting the
658 configuration quickcheck_optimise_equality to false.
660 * Quotient: only one quotient can be defined by quotient_type
664 - generation of an abstraction function equation in lift_definition
666 - renamed no_abs_code -> no_code (INCOMPATIBILITY.)
668 * Simproc "finite_Collect" rewrites set comprehensions into pointfree
671 * Preprocessing of the code generator rewrites set comprehensions into
672 pointfree expressions.
674 * The SMT solver Z3 has now by default a restricted set of directly
675 supported features. For the full set of features (div/mod, nonlinear
676 arithmetic, datatypes/records) with potential proof reconstruction
677 failures, enable the configuration option "z3_with_extensions". Minor
680 * Simplified 'typedef' specifications: historical options for implicit
681 set definition and alternative name have been discontinued. The
682 former behavior of "typedef (open) t = A" is now the default, but
683 written just "typedef t = A". INCOMPATIBILITY, need to adapt theories
686 * Removed constant "chars"; prefer "Enum.enum" on type "char"
687 directly. INCOMPATIBILITY.
689 * Moved operation product, sublists and n_lists from theory Enum to
690 List. INCOMPATIBILITY.
692 * Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY.
694 * Class "comm_monoid_diff" formalises properties of bounded
695 subtraction, with natural numbers and multisets as typical instances.
697 * Added combinator "Option.these" with type "'a option set => 'a set".
699 * Theory "Transitive_Closure": renamed lemmas
701 reflcl_tranclp -> reflclp_tranclp
702 rtranclp_reflcl -> rtranclp_reflclp
706 * Theory "Rings": renamed lemmas (in class semiring)
708 left_distrib ~> distrib_right
709 right_distrib ~> distrib_left
713 * Generalized the definition of limits:
715 - Introduced the predicate filterlim (LIM x F. f x :> G) which
716 expresses that when the input values x converge to F then the
717 output f x converges to G.
719 - Added filters for convergence to positive (at_top) and negative
722 - Moved infinity in the norm (at_infinity) from
723 Multivariate_Analysis to Complex_Main.
725 - Removed real_tendsto_inf, it is superseded by "LIM x F. f x :>
730 * Theory "Library/Option_ord" provides instantiation of option type to
731 lattice type classes.
733 * Theory "Library/Multiset": renamed
735 constant fold_mset ~> Multiset.fold
736 fact fold_mset_commute ~> fold_mset_comm
740 * Renamed theory Library/List_Prefix to Library/Sublist, with related
743 - Renamed constants (and related lemmas)
746 strict_prefix ~> prefix
748 - Replaced constant "postfix" by "suffixeq" with swapped argument
749 order (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped
750 old infix syntax "xs >>= ys"; use "suffixeq ys xs" instead.
751 Renamed lemmas accordingly.
753 - Added constant "list_hembeq" for homeomorphic embedding on
754 lists. Added abbreviation "sublisteq" for special case
755 "list_hembeq (op =)".
757 - Theory Library/Sublist no longer provides "order" and "bot" type
758 class instances for the prefix order (merely corresponding locale
759 interpretations). The type class instances are now in theory
760 Library/Prefix_Order.
762 - The sublist relation of theory Library/Sublist_Order is now based
763 on "Sublist.sublisteq". Renamed lemmas accordingly:
765 le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff
766 le_list_append_mono ~> Sublist.list_hembeq_append_mono
767 le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2
768 le_list_Cons_EX ~> Sublist.list_hembeq_ConsD
769 le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2'
770 le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq
771 le_list_drop_Cons ~> Sublist.sublisteq_Cons'
772 le_list_drop_many ~> Sublist.sublisteq_drop_many
773 le_list_filter_left ~> Sublist.sublisteq_filter_left
774 le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many
775 le_list_rev_take_iff ~> Sublist.sublisteq_append
776 le_list_same_length ~> Sublist.sublisteq_same_length
777 le_list_take_many_iff ~> Sublist.sublisteq_append'
778 less_eq_list.drop ~> less_eq_list_drop
779 less_eq_list.induct ~> less_eq_list_induct
780 not_le_list_length ~> Sublist.not_sublisteq_length
784 * New theory Library/Countable_Set.
786 * Theory Library/Debug and Library/Parallel provide debugging and
787 parallel execution for code generated towards Isabelle/ML.
789 * Theory Library/FuncSet: Extended support for Pi and extensional and
790 introduce the extensional dependent function space "PiE". Replaced
791 extensional_funcset by an abbreviation, and renamed lemmas from
792 extensional_funcset to PiE as follows:
794 extensional_empty ~> PiE_empty
795 extensional_funcset_empty_domain ~> PiE_empty_domain
796 extensional_funcset_empty_range ~> PiE_empty_range
797 extensional_funcset_arb ~> PiE_arb
798 extensional_funcset_mem ~> PiE_mem
799 extensional_funcset_extend_domainI ~> PiE_fun_upd
800 extensional_funcset_restrict_domain ~> fun_upd_in_PiE
801 extensional_funcset_extend_domain_eq ~> PiE_insert_eq
802 card_extensional_funcset ~> card_PiE
803 finite_extensional_funcset ~> finite_PiE
807 * Theory Library/FinFun: theory of almost everywhere constant
808 functions (supersedes the AFP entry "Code Generation for Functions as
811 * Theory Library/Phantom: generic phantom type to make a type
812 parameter appear in a constant's type. This alternative to adding
813 TYPE('a) as another parameter avoids unnecessary closures in generated
816 * Theory Library/RBT_Impl: efficient construction of red-black trees
817 from sorted associative lists. Merging two trees with rbt_union may
818 return a structurally different tree than before. Potential
821 * Theory Library/IArray: immutable arrays with code generation.
823 * Theory Library/Finite_Lattice: theory of finite lattices.
825 * HOL/Multivariate_Analysis: replaced
827 "basis :: 'a::euclidean_space => nat => real"
828 "\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space"
830 on euclidean spaces by using the inner product "_ \<bullet> _" with
831 vectors from the Basis set: "\<Chi>\<Chi> i. f i" is superseded by
832 "SUM i : Basis. f i * r i".
834 With this change the following constants are also changed or removed:
836 DIM('a) :: nat ~> card (Basis :: 'a set) (is an abbreviation)
837 a $$ i ~> inner a i (where i : Basis)
839 \<pi>, \<pi>' removed
841 Theorems about these constants where removed.
845 component_le_norm ~> Basis_le_norm
846 euclidean_eq ~> euclidean_eq_iff
847 differential_zero_maxmin_component ~> differential_zero_maxmin_cart
848 euclidean_simps ~> inner_simps
849 independent_basis ~> independent_Basis
850 span_basis ~> span_Basis
851 in_span_basis ~> in_span_Basis
852 norm_bound_component_le ~> norm_boound_Basis_le
853 norm_bound_component_lt ~> norm_boound_Basis_lt
854 component_le_infnorm ~> Basis_le_infnorm
860 - Added simproc "measurable" to automatically prove measurability.
862 - Added induction rules for sigma sets with disjoint union
863 (sigma_sets_induct_disjoint) and for Borel-measurable functions
864 (borel_measurable_induct).
866 - Added the Daniell-Kolmogorov theorem (the existence the limit of a
869 * HOL/Cardinals: Theories of ordinals and cardinals (supersedes the
870 AFP entry "Ordinals_and_Cardinals").
872 * HOL/BNF: New (co)datatype package based on bounded natural functors
873 with support for mixed, nested recursion and interesting non-free
876 * HOL/Finite_Set and Relation: added new set and relation operations
877 expressed by Finite_Set.fold.
879 * New theory HOL/Library/RBT_Set: implementation of sets by red-black
880 trees for the code generator.
882 * HOL/Library/RBT and HOL/Library/Mapping have been converted to
884 possible INCOMPATIBILITY.
886 * HOL/Set: renamed Set.project -> Set.filter
890 *** Document preparation ***
892 * Dropped legacy antiquotations "term_style" and "thm_style", since
893 styles may be given as arguments to "term" and "thm" already.
894 Discontinued legacy styles "prem1" .. "prem19".
896 * Default LaTeX rendering for \<euro> is now based on eurosym package,
897 instead of slightly exotic babel/greek.
899 * Document variant NAME may use different LaTeX entry point
900 document/root_NAME.tex if that file exists, instead of the common
903 * Simplified custom document/build script, instead of old-style
904 document/IsaMakefile. Minor INCOMPATIBILITY.
909 * The default limit for maximum number of worker threads is now 8,
910 instead of 4, in correspondence to capabilities of contemporary
911 hardware and Poly/ML runtime system.
913 * Type Seq.results and related operations support embedded error
914 messages within lazy enumerations, and thus allow to provide
915 informative errors in the absence of any usable results.
917 * Renamed Position.str_of to Position.here to emphasize that this is a
918 formal device to inline positions into message text, but not
919 necessarily printing visible text.
924 * Advanced support for Isabelle sessions and build management, see
925 "system" manual for the chapter of that name, especially the "isabelle
926 build" tool and its examples. The "isabelle mkroot" tool prepares
927 session root directories for use with "isabelle build", similar to
928 former "isabelle mkdir" for "isabelle usedir". Note that this affects
929 document preparation as well. INCOMPATIBILITY, isabelle usedir /
930 mkdir / make are rendered obsolete.
932 * Discontinued obsolete Isabelle/build script, it is superseded by the
933 regular isabelle build tool. For example:
935 isabelle build -s -b HOL
937 * Discontinued obsolete "isabelle makeall".
939 * Discontinued obsolete IsaMakefile and ROOT.ML files from the
940 Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that
941 provides some traditional targets that invoke "isabelle build". Note
942 that this is inefficient! Applications of Isabelle/HOL involving
943 "isabelle make" should be upgraded to use "isabelle build" directly.
945 * The "isabelle options" tool prints Isabelle system options, as
946 required for "isabelle build", for example.
948 * The "isabelle logo" tool produces EPS and PDF format simultaneously.
949 Minor INCOMPATIBILITY in command-line options.
951 * The "isabelle install" tool has now a simpler command-line. Minor
954 * The "isabelle components" tool helps to resolve add-on components
955 that are not bundled, or referenced from a bare-bones repository
958 * Settings variable ISABELLE_PLATFORM_FAMILY refers to the general
959 platform family: "linux", "macos", "windows".
961 * The ML system is configured as regular component, and no longer
962 picked up from some surrounding directory. Potential INCOMPATIBILITY
963 for home-made settings.
965 * Improved ML runtime statistics (heap, threads, future tasks etc.).
967 * Discontinued support for Poly/ML 5.2.1, which was the last version
968 without exception positions and advanced ML compiler/toplevel
971 * Discontinued special treatment of Proof General -- no longer guess
972 PROOFGENERAL_HOME based on accidental file-system layout. Minor
973 INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS
974 settings manually, or use a Proof General version that has been
975 bundled as Isabelle component.
979 New in Isabelle2012 (May 2012)
980 ------------------------------
984 * Prover IDE (PIDE) improvements:
986 - more robust Sledgehammer integration (as before the sledgehammer
987 command-line needs to be typed into the source buffer)
988 - markup for bound variables
989 - markup for types of term variables (displayed as tooltips)
990 - support for user-defined Isar commands within the running session
991 - improved support for Unicode outside original 16bit range
992 e.g. glyph for \<A> (thanks to jEdit 4.5.1)
994 * Forward declaration of outer syntax keywords within the theory
995 header -- minor INCOMPATIBILITY for user-defined commands. Allow new
996 commands to be used in the same theory where defined.
998 * Auxiliary contexts indicate block structure for specifications with
999 additional parameters and assumptions. Such unnamed contexts may be
1000 nested within other targets, like 'theory', 'locale', 'class',
1001 'instantiation' etc. Results from the local context are generalized
1002 accordingly and applied to the enclosing target context. Example:
1006 assumes xy: "x = y" and yz: "y = z"
1009 lemma my_trans: "x = z" using xy yz by simp
1015 The most basic application is to factor-out context elements of
1016 several fixes/assumes/shows theorem statements, e.g. see
1017 ~~/src/HOL/Isar_Examples/Group_Context.thy
1019 Any other local theory specification element works within the "context
1020 ... begin ... end" block as well.
1022 * Bundled declarations associate attributed fact expressions with a
1023 given name in the context. These may be later included in other
1024 contexts. This allows to manage context extensions casually, without
1025 the logical dependencies of locales and locale interpretation. See
1026 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.
1028 * Commands 'lemmas' and 'theorems' allow local variables using 'for'
1029 declaration, and results are standardized before being stored. Thus
1030 old-style "standard" after instantiation or composition of facts
1031 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of
1032 indices of schematic variables.
1034 * Rule attributes in local theory declarations (e.g. locale or class)
1035 are now statically evaluated: the resulting theorem is stored instead
1036 of the original expression. INCOMPATIBILITY in rare situations, where
1037 the historic accident of dynamic re-evaluation in interpretations
1040 * New tutorial "Programming and Proving in Isabelle/HOL"
1041 ("prog-prove"). It completely supersedes "A Tutorial Introduction to
1042 Structured Isar Proofs" ("isar-overview"), which has been removed. It
1043 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order
1044 Logic" as the recommended beginners tutorial, but does not cover all
1045 of the material of that old tutorial.
1047 * Updated and extended reference manuals: "isar-ref",
1048 "implementation", "system"; reduced remaining material in old "ref"
1054 * Command 'definition' no longer exports the foundational "raw_def"
1055 into the user context. Minor INCOMPATIBILITY, may use the regular
1056 "def" result with attribute "abs_def" to imitate the old version.
1058 * Attribute "abs_def" turns an equation of the form "f x y == t" into
1059 "f == %x y. t", which ensures that "simp" or "unfold" steps always
1060 expand it. This also works for object-logic equality. (Formerly
1061 undocumented feature.)
1063 * Sort constraints are now propagated in simultaneous statements, just
1064 like type constraints. INCOMPATIBILITY in rare situations, where
1065 distinct sorts used to be assigned accidentally. For example:
1067 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"
1069 lemma "P (x::'a)" and "Q (y::'a::bar)"
1070 -- "now uniform 'a::bar instead of default sort for first occurrence (!)"
1072 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more
1073 tolerant against multiple unifiers, as long as the final result is
1074 unique. (As before, rules are composed in canonical right-to-left
1075 order to accommodate newly introduced premises.)
1077 * Renamed some inner syntax categories:
1083 Minor INCOMPATIBILITY. Note that in practice "num_const" or
1084 "num_position" etc. are mainly used instead (which also include
1085 position information via constraints).
1087 * Simplified configuration options for syntax ambiguity: see
1088 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
1089 manual. Minor INCOMPATIBILITY.
1091 * Discontinued configuration option "syntax_positions": atomic terms
1092 in parse trees are always annotated by position constraints.
1094 * Old code generator for SML and its commands 'code_module',
1095 'code_library', 'consts_code', 'types_code' have been discontinued.
1096 Use commands of the generic code generator instead. INCOMPATIBILITY.
1098 * Redundant attribute "code_inline" has been discontinued. Use
1099 "code_unfold" instead. INCOMPATIBILITY.
1101 * Dropped attribute "code_unfold_post" in favor of the its dual
1102 "code_abbrev", which yields a common pattern in definitions like
1104 definition [code_abbrev]: "f = t"
1108 * Obsolete 'types' command has been discontinued. Use 'type_synonym'
1109 instead. INCOMPATIBILITY.
1111 * Discontinued old "prems" fact, which used to refer to the accidental
1112 collection of foundational premises in the context (already marked as
1113 legacy since Isabelle2011).
1118 * Type 'a set is now a proper type constructor (just as before
1119 Isabelle2008). Definitions mem_def and Collect_def have disappeared.
1120 Non-trivial INCOMPATIBILITY. For developments keeping predicates and
1121 sets separate, it is often sufficient to rephrase some set S that has
1122 been accidentally used as predicates by "%x. x : S", and some
1123 predicate P that has been accidentally used as set by "{x. P x}".
1124 Corresponding proofs in a first step should be pruned from any
1125 tinkering with former theorems mem_def and Collect_def as far as
1128 For developments which deliberately mix predicates and sets, a
1129 planning step is necessary to determine what should become a predicate
1130 and what a set. It can be helpful to carry out that step in
1131 Isabelle2011-1 before jumping right into the current release.
1133 * Code generation by default implements sets as container type rather
1134 than predicates. INCOMPATIBILITY.
1136 * New type synonym 'a rel = ('a * 'a) set
1138 * The representation of numerals has changed. Datatype "num"
1139 represents strictly positive binary numerals, along with functions
1140 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent
1141 positive and negated numeric literals, respectively. See also
1142 definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some
1143 user theories may require adaptations as follows:
1145 - Theorems with number_ring or number_semiring constraints: These
1146 classes are gone; use comm_ring_1 or comm_semiring_1 instead.
1148 - Theories defining numeric types: Remove number, number_semiring,
1149 and number_ring instances. Defer all theorems about numerals until
1150 after classes one and semigroup_add have been instantiated.
1152 - Numeral-only simp rules: Replace each rule having a "number_of v"
1153 pattern with two copies, one for numeral and one for neg_numeral.
1155 - Theorems about subclasses of semiring_1 or ring_1: These classes
1156 automatically support numerals now, so more simp rules and
1157 simprocs may now apply within the proof.
1159 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:
1160 Redefine using other integer operations.
1162 * Transfer: New package intended to generalize the existing
1163 "descending" method and related theorem attributes from the Quotient
1164 package. (Not all functionality is implemented yet, but future
1165 development will focus on Transfer as an eventual replacement for the
1166 corresponding parts of the Quotient package.)
1168 - transfer_rule attribute: Maintains a collection of transfer rules,
1169 which relate constants at two different types. Transfer rules may
1170 relate different type instances of the same polymorphic constant,
1171 or they may relate an operation on a raw type to a corresponding
1172 operation on an abstract type (quotient or subtype). For example:
1174 ((A ===> B) ===> list_all2 A ===> list_all2 B) map map
1175 (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int
1177 - transfer method: Replaces a subgoal on abstract types with an
1178 equivalent subgoal on the corresponding raw types. Constants are
1179 replaced with corresponding ones according to the transfer rules.
1180 Goals are generalized over all free variables by default; this is
1181 necessary for variables whose types change, but can be overridden
1182 for specific variables with e.g. "transfer fixing: x y z". The
1183 variant transfer' method allows replacing a subgoal with one that
1184 is logically stronger (rather than equivalent).
1186 - relator_eq attribute: Collects identity laws for relators of
1187 various type constructors, e.g. "list_all2 (op =) = (op =)". The
1188 transfer method uses these lemmas to infer transfer rules for
1189 non-polymorphic constants on the fly.
1191 - transfer_prover method: Assists with proving a transfer rule for a
1192 new constant, provided the constant is defined in terms of other
1193 constants that already have transfer rules. It should be applied
1194 after unfolding the constant definitions.
1196 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer
1197 from type nat to type int.
1199 * Lifting: New package intended to generalize the quotient_definition
1200 facility of the Quotient package; designed to work with Transfer.
1202 - lift_definition command: Defines operations on an abstract type in
1203 terms of a corresponding operation on a representation
1204 type. Example syntax:
1206 lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"
1209 Users must discharge a respectfulness proof obligation when each
1210 constant is defined. (For a type copy, i.e. a typedef with UNIV,
1211 the proof is discharged automatically.) The obligation is
1212 presented in a user-friendly, readable form; a respectfulness
1213 theorem in the standard format and a transfer rule are generated
1216 - Integration with code_abstype: For typedefs (e.g. subtypes
1217 corresponding to a datatype invariant, such as dlist),
1218 lift_definition generates a code certificate theorem and sets up
1219 code generation for each constant.
1221 - setup_lifting command: Sets up the Lifting package to work with a
1222 user-defined type. The user must provide either a quotient theorem
1223 or a type_definition theorem. The package configures transfer
1224 rules for equality and quantifiers on the type, and sets up the
1225 lift_definition command to work with the type.
1227 - Usage examples: See Quotient_Examples/Lift_DList.thy,
1228 Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,
1229 Word/Word.thy and Library/Float.thy.
1233 - The 'quotient_type' command now supports a 'morphisms' option with
1234 rep and abs functions, similar to typedef.
1236 - 'quotient_type' sets up new types to work with the Lifting and
1237 Transfer packages, as with 'setup_lifting'.
1239 - The 'quotient_definition' command now requires the user to prove a
1240 respectfulness property at the point where the constant is
1241 defined, similar to lift_definition; INCOMPATIBILITY.
1243 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems
1244 accordingly, INCOMPATIBILITY.
1246 * New diagnostic command 'find_unused_assms' to find potentially
1247 superfluous assumptions in theorems using Quickcheck.
1251 - Quickcheck returns variable assignments as counterexamples, which
1252 allows to reveal the underspecification of functions under test.
1253 For example, refuting "hd xs = x", it presents the variable
1254 assignment xs = [] and x = a1 as a counterexample, assuming that
1255 any property is false whenever "hd []" occurs in it.
1257 These counterexample are marked as potentially spurious, as
1258 Quickcheck also returns "xs = []" as a counterexample to the
1259 obvious theorem "hd xs = hd xs".
1261 After finding a potentially spurious counterexample, Quickcheck
1262 continues searching for genuine ones.
1264 By default, Quickcheck shows potentially spurious and genuine
1265 counterexamples. The option "genuine_only" sets quickcheck to only
1266 show genuine counterexamples.
1268 - The command 'quickcheck_generator' creates random and exhaustive
1269 value generators for a given type and operations.
1271 It generates values by using the operations as if they were
1272 constructors of that type.
1274 - Support for multisets.
1276 - Added "use_subtype" options.
1278 - Added "quickcheck_locale" configuration to specify how to process
1279 conjectures in a locale context.
1281 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option
1282 and affecting 'rat' and 'real'.
1285 - Integrated more tightly with SPASS, as described in the ITP 2012
1286 paper "More SPASS with Isabelle".
1287 - Made it try "smt" as a fallback if "metis" fails or times out.
1288 - Added support for the following provers: Alt-Ergo (via Why3 and
1289 TFF1), iProver, iProver-Eq.
1290 - Sped up the minimizer.
1291 - Added "lam_trans", "uncurry_aliases", and "minimize" options.
1292 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
1293 - Renamed "sound" option to "strict".
1295 * Metis: Added possibility to specify lambda translations scheme as a
1296 parenthesized argument (e.g., "by (metis (lifting) ...)").
1298 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".
1300 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.
1302 * New "case_product" attribute to generate a case rule doing multiple
1303 case distinctions at the same time. E.g.
1305 list.exhaust [case_product nat.exhaust]
1307 produces a rule which can be used to perform case distinction on both
1310 * New "eventually_elim" method as a generalized variant of the
1311 eventually_elim* rules. Supports structured proofs.
1313 * Typedef with implicit set definition is considered legacy. Use
1314 "typedef (open)" form instead, which will eventually become the
1317 * Record: code generation can be switched off manually with
1319 declare [[record_coden = false]] -- "default true"
1321 * Datatype: type parameters allow explicit sort constraints.
1323 * Concrete syntax for case expressions includes constraints for source
1324 positions, and thus produces Prover IDE markup for its bindings.
1325 INCOMPATIBILITY for old-style syntax translations that augment the
1326 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
1329 * Clarified attribute "mono_set": pure declaration without modifying
1330 the result of the fact expression.
1332 * More default pred/set conversions on a couple of relation operations
1333 and predicates. Added powers of predicate relations. Consolidation
1334 of some relation theorems:
1336 converse_def ~> converse_unfold
1337 rel_comp_def ~> relcomp_unfold
1338 symp_def ~> (modified, use symp_def and sym_def instead)
1339 transp_def ~> transp_trans
1340 Domain_def ~> Domain_unfold
1341 Range_def ~> Domain_converse [symmetric]
1343 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.
1345 See theory "Relation" for examples for making use of pred/set
1346 conversions by means of attributes "to_set" and "to_pred".
1350 * Renamed facts about the power operation on relations, i.e., relpow
1351 to match the constant's name:
1353 rel_pow_1 ~> relpow_1
1354 rel_pow_0_I ~> relpow_0_I
1355 rel_pow_Suc_I ~> relpow_Suc_I
1356 rel_pow_Suc_I2 ~> relpow_Suc_I2
1357 rel_pow_0_E ~> relpow_0_E
1358 rel_pow_Suc_E ~> relpow_Suc_E
1359 rel_pow_E ~> relpow_E
1360 rel_pow_Suc_D2 ~> relpow_Suc_D2
1361 rel_pow_Suc_E2 ~> relpow_Suc_E2
1362 rel_pow_Suc_D2' ~> relpow_Suc_D2'
1363 rel_pow_E2 ~> relpow_E2
1364 rel_pow_add ~> relpow_add
1365 rel_pow_commute ~> relpow
1366 rel_pow_empty ~> relpow_empty:
1367 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
1368 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
1369 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
1370 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
1371 rel_pow_fun_conv ~> relpow_fun_conv
1372 rel_pow_finite_bounded1 ~> relpow_finite_bounded1
1373 rel_pow_finite_bounded ~> relpow_finite_bounded
1374 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
1375 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
1376 single_valued_rel_pow ~> single_valued_relpow
1380 * Theory Relation: Consolidated constant name for relation composition
1381 and corresponding theorem names:
1383 - Renamed constant rel_comp to relcomp.
1385 - Dropped abbreviation pred_comp. Use relcompp instead.
1389 rel_compI ~> relcompI
1390 rel_compEpair ~> relcompEpair
1391 rel_compE ~> relcompE
1392 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq
1393 rel_comp_empty1 ~> relcomp_empty1
1394 rel_comp_mono ~> relcomp_mono
1395 rel_comp_subset_Sigma ~> relcomp_subset_Sigma
1396 rel_comp_distrib ~> relcomp_distrib
1397 rel_comp_distrib2 ~> relcomp_distrib2
1398 rel_comp_UNION_distrib ~> relcomp_UNION_distrib
1399 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2
1400 single_valued_rel_comp ~> single_valued_relcomp
1401 rel_comp_def ~> relcomp_unfold
1402 converse_rel_comp ~> converse_relcomp
1403 pred_compI ~> relcomppI
1404 pred_compE ~> relcomppE
1405 pred_comp_bot1 ~> relcompp_bot1
1406 pred_comp_bot2 ~> relcompp_bot2
1407 transp_pred_comp_less_eq ~> transp_relcompp_less_eq
1408 pred_comp_mono ~> relcompp_mono
1409 pred_comp_distrib ~> relcompp_distrib
1410 pred_comp_distrib2 ~> relcompp_distrib2
1411 converse_pred_comp ~> converse_relcompp
1413 finite_rel_comp ~> finite_relcomp
1415 set_rel_comp ~> set_relcomp
1419 * Theory Divides: Discontinued redundant theorems about div and mod.
1420 INCOMPATIBILITY, use the corresponding generic theorems instead.
1422 DIVISION_BY_ZERO ~> div_by_0, mod_by_0
1423 zdiv_self ~> div_self
1424 zmod_self ~> mod_self
1427 zdiv_zmod_equality ~> div_mod_equality2
1428 zdiv_zmod_equality2 ~> div_mod_equality
1429 zmod_zdiv_trivial ~> mod_div_trivial
1430 zdiv_zminus_zminus ~> div_minus_minus
1431 zmod_zminus_zminus ~> mod_minus_minus
1432 zdiv_zminus2 ~> div_minus_right
1433 zmod_zminus2 ~> mod_minus_right
1434 zdiv_minus1_right ~> div_minus1_right
1435 zmod_minus1_right ~> mod_minus1_right
1436 zdvd_mult_div_cancel ~> dvd_mult_div_cancel
1437 zmod_zmult1_eq ~> mod_mult_right_eq
1438 zpower_zmod ~> power_mod
1439 zdvd_zmod ~> dvd_mod
1440 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd
1441 mod_mult_distrib ~> mult_mod_left
1442 mod_mult_distrib2 ~> mult_mod_right
1444 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use
1445 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.
1447 * Finite_Set.fold now qualified. INCOMPATIBILITY.
1449 * Consolidated theorem names concerning fold combinators:
1451 inf_INFI_fold_inf ~> inf_INF_fold_inf
1452 sup_SUPR_fold_sup ~> sup_SUP_fold_sup
1453 INFI_fold_inf ~> INF_fold_inf
1454 SUPR_fold_sup ~> SUP_fold_sup
1455 union_set ~> union_set_fold
1456 minus_set ~> minus_set_fold
1457 INFI_set_fold ~> INF_set_fold
1458 SUPR_set_fold ~> SUP_set_fold
1459 INF_code ~> INF_set_foldr
1460 SUP_code ~> SUP_set_foldr
1461 foldr.simps ~> foldr.simps (in point-free formulation)
1462 foldr_fold_rev ~> foldr_conv_fold
1463 foldl_fold ~> foldl_conv_fold
1464 foldr_foldr ~> foldr_conv_foldl
1465 foldl_foldr ~> foldl_conv_foldr
1466 fold_set_remdups ~> fold_set_fold_remdups
1467 fold_set ~> fold_set_fold
1468 fold1_set ~> fold1_set_fold
1472 * Dropped rarely useful theorems concerning fold combinators:
1473 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
1474 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
1475 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
1476 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
1477 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,
1478 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.
1479 INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0"
1480 and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be
1481 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by
1482 unfolding "foldr_conv_fold" and "foldl_conv_fold".
1484 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,
1485 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,
1486 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,
1487 INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding
1488 lemmas over fold rather than foldr, or make use of lemmas
1489 fold_conv_foldr and fold_rev.
1491 * Congruence rules Option.map_cong and Option.bind_cong for recursion
1492 through option types.
1494 * "Transitive_Closure.ntrancl": bounded transitive closure on
1497 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.
1499 * Theory Int: Discontinued many legacy theorems specific to type int.
1500 INCOMPATIBILITY, use the corresponding generic theorems instead.
1502 zminus_zminus ~> minus_minus
1503 zminus_0 ~> minus_zero
1504 zminus_zadd_distrib ~> minus_add_distrib
1505 zadd_commute ~> add_commute
1506 zadd_assoc ~> add_assoc
1507 zadd_left_commute ~> add_left_commute
1510 zadd_0 ~> add_0_left
1511 zadd_0_right ~> add_0_right
1512 zadd_zminus_inverse2 ~> left_minus
1513 zmult_zminus ~> mult_minus_left
1514 zmult_commute ~> mult_commute
1515 zmult_assoc ~> mult_assoc
1516 zadd_zmult_distrib ~> left_distrib
1517 zadd_zmult_distrib2 ~> right_distrib
1518 zdiff_zmult_distrib ~> left_diff_distrib
1519 zdiff_zmult_distrib2 ~> right_diff_distrib
1520 zmult_1 ~> mult_1_left
1521 zmult_1_right ~> mult_1_right
1522 zle_refl ~> order_refl
1523 zle_trans ~> order_trans
1524 zle_antisym ~> order_antisym
1525 zle_linear ~> linorder_linear
1526 zless_linear ~> linorder_less_linear
1527 zadd_left_mono ~> add_left_mono
1528 zadd_strict_right_mono ~> add_strict_right_mono
1529 zadd_zless_mono ~> add_less_le_mono
1530 int_0_less_1 ~> zero_less_one
1531 int_0_neq_1 ~> zero_neq_one
1533 zpower_zadd_distrib ~> power_add
1534 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
1535 zero_le_zpower_abs ~> zero_le_power_abs
1537 * Theory Deriv: Renamed
1539 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
1541 * Theory Library/Multiset: Improved code generation of multisets.
1543 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets
1544 are expressed via type classes again. The special syntax
1545 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant
1546 setsum_set, which is now subsumed by Big_Operators.setsum.
1549 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
1550 use theory HOL/Library/Nat_Bijection instead.
1552 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black
1553 trees is now inside a type class context. Names of affected
1554 operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for
1555 theories working directly with raw red-black trees, adapt the names as
1559 bulkload -> rbt_bulkload
1560 del_from_left -> rbt_del_from_left
1561 del_from_right -> rbt_del_from_right
1563 delete -> rbt_delete
1565 insert -> rbt_insert
1566 insertw -> rbt_insert_with
1567 insert_with_key -> rbt_insert_with_key
1568 map_entry -> rbt_map_entry
1569 lookup -> rbt_lookup
1570 sorted -> rbt_sorted
1571 tree_greater -> rbt_greater
1572 tree_less -> rbt_less
1573 tree_less_symbol -> rbt_less_symbol
1575 union_with -> rbt_union_with
1576 union_with_key -> rbt_union_with_key
1579 balance_left_sorted -> balance_left_rbt_sorted
1580 balance_left_tree_greater -> balance_left_rbt_greater
1581 balance_left_tree_less -> balance_left_rbt_less
1582 balance_right_sorted -> balance_right_rbt_sorted
1583 balance_right_tree_greater -> balance_right_rbt_greater
1584 balance_right_tree_less -> balance_right_rbt_less
1585 balance_sorted -> balance_rbt_sorted
1586 balance_tree_greater -> balance_rbt_greater
1587 balance_tree_less -> balance_rbt_less
1588 bulkload_is_rbt -> rbt_bulkload_is_rbt
1589 combine_sorted -> combine_rbt_sorted
1590 combine_tree_greater -> combine_rbt_greater
1591 combine_tree_less -> combine_rbt_less
1592 delete_in_tree -> rbt_delete_in_tree
1593 delete_is_rbt -> rbt_delete_is_rbt
1594 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater
1595 del_from_left_tree_less -> rbt_del_from_left_rbt_less
1596 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater
1597 del_from_right_tree_less -> rbt_del_from_right_rbt_less
1598 del_in_tree -> rbt_del_in_tree
1599 del_inv1_inv2 -> rbt_del_inv1_inv2
1600 del_sorted -> rbt_del_rbt_sorted
1601 del_tree_greater -> rbt_del_rbt_greater
1602 del_tree_less -> rbt_del_rbt_less
1603 dom_lookup_Branch -> dom_rbt_lookup_Branch
1604 entries_lookup -> entries_rbt_lookup
1605 finite_dom_lookup -> finite_dom_rbt_lookup
1606 insert_sorted -> rbt_insert_rbt_sorted
1607 insertw_is_rbt -> rbt_insertw_is_rbt
1608 insertwk_is_rbt -> rbt_insertwk_is_rbt
1609 insertwk_sorted -> rbt_insertwk_rbt_sorted
1610 insertw_sorted -> rbt_insertw_rbt_sorted
1611 ins_sorted -> ins_rbt_sorted
1612 ins_tree_greater -> ins_rbt_greater
1613 ins_tree_less -> ins_rbt_less
1614 is_rbt_sorted -> is_rbt_rbt_sorted
1615 lookup_balance -> rbt_lookup_balance
1616 lookup_bulkload -> rbt_lookup_rbt_bulkload
1617 lookup_delete -> rbt_lookup_rbt_delete
1618 lookup_Empty -> rbt_lookup_Empty
1619 lookup_from_in_tree -> rbt_lookup_from_in_tree
1620 lookup_in_tree -> rbt_lookup_in_tree
1621 lookup_ins -> rbt_lookup_ins
1622 lookup_insert -> rbt_lookup_rbt_insert
1623 lookup_insertw -> rbt_lookup_rbt_insertw
1624 lookup_insertwk -> rbt_lookup_rbt_insertwk
1625 lookup_keys -> rbt_lookup_keys
1626 lookup_map -> rbt_lookup_map
1627 lookup_map_entry -> rbt_lookup_rbt_map_entry
1628 lookup_tree_greater -> rbt_lookup_rbt_greater
1629 lookup_tree_less -> rbt_lookup_rbt_less
1630 lookup_union -> rbt_lookup_rbt_union
1631 map_entry_color_of -> rbt_map_entry_color_of
1632 map_entry_inv1 -> rbt_map_entry_inv1
1633 map_entry_inv2 -> rbt_map_entry_inv2
1634 map_entry_is_rbt -> rbt_map_entry_is_rbt
1635 map_entry_sorted -> rbt_map_entry_rbt_sorted
1636 map_entry_tree_greater -> rbt_map_entry_rbt_greater
1637 map_entry_tree_less -> rbt_map_entry_rbt_less
1638 map_tree_greater -> map_rbt_greater
1639 map_tree_less -> map_rbt_less
1640 map_sorted -> map_rbt_sorted
1641 paint_sorted -> paint_rbt_sorted
1642 paint_lookup -> paint_rbt_lookup
1643 paint_tree_greater -> paint_rbt_greater
1644 paint_tree_less -> paint_rbt_less
1645 sorted_entries -> rbt_sorted_entries
1646 tree_greater_eq_trans -> rbt_greater_eq_trans
1647 tree_greater_nit -> rbt_greater_nit
1648 tree_greater_prop -> rbt_greater_prop
1649 tree_greater_simps -> rbt_greater_simps
1650 tree_greater_trans -> rbt_greater_trans
1651 tree_less_eq_trans -> rbt_less_eq_trans
1652 tree_less_nit -> rbt_less_nit
1653 tree_less_prop -> rbt_less_prop
1654 tree_less_simps -> rbt_less_simps
1655 tree_less_trans -> rbt_less_trans
1656 tree_ord_props -> rbt_ord_props
1657 union_Branch -> rbt_union_Branch
1658 union_is_rbt -> rbt_union_is_rbt
1659 unionw_is_rbt -> rbt_unionw_is_rbt
1660 unionwk_is_rbt -> rbt_unionwk_is_rbt
1661 unionwk_sorted -> rbt_unionwk_rbt_sorted
1663 * Theory HOL/Library/Float: Floating point numbers are now defined as
1664 a subset of the real numbers. All operations are defined using the
1665 lifing-framework and proofs use the transfer method. INCOMPATIBILITY.
1672 round_down -> float_round_down
1673 round_up -> float_round_up
1677 ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod
1680 abs_float_def -> Float.compute_float_abs
1681 bitlen_ge0 -> bitlen_nonneg
1682 bitlen.simps -> Float.compute_bitlen
1683 float_components -> Float_mantissa_exponent
1684 float_divl.simps -> Float.compute_float_divl
1685 float_divr.simps -> Float.compute_float_divr
1686 float_eq_odd -> mult_powr_eq_mult_powr_iff
1687 float_power -> real_of_float_power
1688 lapprox_posrat_def -> Float.compute_lapprox_posrat
1689 lapprox_rat.simps -> Float.compute_lapprox_rat
1690 le_float_def' -> Float.compute_float_le
1691 le_float_def -> less_eq_float.rep_eq
1692 less_float_def' -> Float.compute_float_less
1693 less_float_def -> less_float.rep_eq
1694 normfloat_def -> Float.compute_normfloat
1695 normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0
1696 normfloat -> normfloat_def
1697 normfloat_unique -> use normfloat_def
1698 number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral
1699 one_float_def -> Float.compute_float_one
1700 plus_float_def -> Float.compute_float_plus
1701 rapprox_posrat_def -> Float.compute_rapprox_posrat
1702 rapprox_rat.simps -> Float.compute_rapprox_rat
1703 real_of_float_0 -> zero_float.rep_eq
1704 real_of_float_1 -> one_float.rep_eq
1705 real_of_float_abs -> abs_float.rep_eq
1706 real_of_float_add -> plus_float.rep_eq
1707 real_of_float_minus -> uminus_float.rep_eq
1708 real_of_float_mult -> times_float.rep_eq
1709 real_of_float_simp -> Float.rep_eq
1710 real_of_float_sub -> minus_float.rep_eq
1711 round_down.simps -> Float.compute_float_round_down
1712 round_up.simps -> Float.compute_float_round_up
1713 times_float_def -> Float.compute_float_times
1714 uminus_float_def -> Float.compute_float_uminus
1715 zero_float_def -> Float.compute_float_zero
1717 Lemmas not necessary anymore, use the transfer method:
1718 bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,
1719 float_divr, float_le_simp, float_less1_mantissa_bound,
1720 float_less_simp, float_less_zero, float_le_zero,
1721 float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,
1722 floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,
1723 lapprox_rat_bottom, normalized_float, rapprox_posrat,
1724 rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,
1725 real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,
1726 round_up, zero_le_float, zero_less_float
1728 * New theory HOL/Library/DAList provides an abstract type for
1729 association lists with distinct keys.
1731 * Session HOL/IMP: Added new theory of abstract interpretation of
1734 * Session HOL-Import: Re-implementation from scratch is faster,
1735 simpler, and more scalable. Requires a proof bundle, which is
1736 available as an external component. Discontinued old (and mostly
1737 dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY.
1739 * Session HOL-Word: Discontinued many redundant theorems specific to
1740 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
1743 word_sub_alt ~> word_sub_wi
1744 word_add_alt ~> word_add_def
1745 word_mult_alt ~> word_mult_def
1746 word_minus_alt ~> word_minus_def
1747 word_0_alt ~> word_0_wi
1748 word_1_alt ~> word_1_wi
1749 word_add_0 ~> add_0_left
1750 word_add_0_right ~> add_0_right
1751 word_mult_1 ~> mult_1_left
1752 word_mult_1_right ~> mult_1_right
1753 word_add_commute ~> add_commute
1754 word_add_assoc ~> add_assoc
1755 word_add_left_commute ~> add_left_commute
1756 word_mult_commute ~> mult_commute
1757 word_mult_assoc ~> mult_assoc
1758 word_mult_left_commute ~> mult_left_commute
1759 word_left_distrib ~> left_distrib
1760 word_right_distrib ~> right_distrib
1761 word_left_minus ~> left_minus
1762 word_diff_0_right ~> diff_0_right
1763 word_diff_self ~> diff_self
1764 word_sub_def ~> diff_minus
1765 word_diff_minus ~> diff_minus
1766 word_add_ac ~> add_ac
1767 word_mult_ac ~> mult_ac
1768 word_plus_ac0 ~> add_0_left add_0_right add_ac
1769 word_times_ac1 ~> mult_1_left mult_1_right mult_ac
1770 word_order_trans ~> order_trans
1771 word_order_refl ~> order_refl
1772 word_order_antisym ~> order_antisym
1773 word_order_linear ~> linorder_linear
1774 lenw1_zero_neq_one ~> zero_neq_one
1775 word_number_of_eq ~> number_of_eq
1776 word_of_int_add_hom ~> wi_hom_add
1777 word_of_int_sub_hom ~> wi_hom_sub
1778 word_of_int_mult_hom ~> wi_hom_mult
1779 word_of_int_minus_hom ~> wi_hom_neg
1780 word_of_int_succ_hom ~> wi_hom_succ
1781 word_of_int_pred_hom ~> wi_hom_pred
1782 word_of_int_0_hom ~> word_0_wi
1783 word_of_int_1_hom ~> word_1_wi
1785 * Session HOL-Word: New proof method "word_bitwise" for splitting
1786 machine word equalities and inequalities into logical circuits,
1787 defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction,
1788 multiplication, shifting by constants, bitwise operators and numeric
1789 constants. Requires fixed-length word types, not 'a word. Solves
1790 many standard word identities outright and converts more into first
1791 order problems amenable to blast or similar. See also examples in
1792 HOL/Word/Examples/WordExamples.thy.
1794 * Session HOL-Probability: Introduced the type "'a measure" to
1795 represent measures, this replaces the records 'a algebra and 'a
1796 measure_space. The locales based on subset_class now have two
1797 locale-parameters the space \<Omega> and the set of measurable sets M.
1798 The product of probability spaces uses now the same constant as the
1799 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)
1800 measure". Most constants are defined now outside of locales and gain
1801 an additional parameter, like null_sets, almost_eventually or \<mu>'.
1802 Measure space constructions for distributions and densities now got
1803 their own constants distr and density. Instead of using locales to
1804 describe measure spaces with a finite space, the measure count_space
1805 and point_measure is introduced. INCOMPATIBILITY.
1809 finite_measure.\<mu>' -> measure
1810 product_algebra_generator -> prod_algebra
1811 product_prob_space.emb -> prod_emb
1812 product_prob_space.infprod_algebra -> PiM
1815 completeable_measure_space
1816 finite_measure_space
1818 finite_product_finite_prob_space
1819 finite_product_sigma_algebra
1820 finite_sigma_algebra
1822 pair_finite_prob_space
1823 pair_finite_sigma_algebra
1826 product_sigma_algebra
1830 distribution -> use distr measure, or distributed predicate
1832 joint_distribution -> use distr measure, or distributed predicate
1833 pair_measure_generator
1834 product_prob_space.infprod_algebra -> use PiM
1837 Replacement theorems:
1838 finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite
1839 finite_measure.empty_measure -> measure_empty
1840 finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq
1841 finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq
1842 finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably
1843 finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure
1844 finite_measure.finite_measure -> finite_measure.emeasure_finite
1845 finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton
1846 finite_measure.positive_measure' -> measure_nonneg
1847 finite_measure.real_measure -> finite_measure.emeasure_real
1848 finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb
1849 finite_product_sigma_algebra.in_P -> sets_PiM_I_finite
1850 finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty
1851 information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed
1852 information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple
1853 information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple
1854 information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple
1855 information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple
1856 information_space.entropy_commute -> information_space.entropy_commute_simple
1857 information_space.entropy_eq -> information_space.entropy_simple_distributed
1858 information_space.entropy_generic_eq -> information_space.entropy_simple_distributed
1859 information_space.entropy_positive -> information_space.entropy_nonneg_simple
1860 information_space.entropy_uniform_max -> information_space.entropy_uniform
1861 information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq
1862 information_space.KL_eq_0 -> information_space.KL_same_eq_0
1863 information_space.KL_ge_0 -> information_space.KL_nonneg
1864 information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed
1865 information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple
1866 Int_stable_cuboids -> Int_stable_atLeastAtMost
1867 Int_stable_product_algebra_generator -> positive_integral
1868 measure_preserving -> equality "distr M N f = N" "f : measurable M N"
1869 measure_space.additive -> emeasure_additive
1870 measure_space.AE_iff_null_set -> AE_iff_null
1871 measure_space.almost_everywhere_def -> eventually_ae_filter
1872 measure_space.almost_everywhere_vimage -> AE_distrD
1873 measure_space.continuity_from_above -> INF_emeasure_decseq
1874 measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq
1875 measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq
1876 measure_space.continuity_from_below -> SUP_emeasure_incseq
1877 measure_space_density -> emeasure_density
1878 measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density
1879 measure_space.integrable_vimage -> integrable_distr
1880 measure_space.integral_translated_density -> integral_density
1881 measure_space.integral_vimage -> integral_distr
1882 measure_space.measure_additive -> plus_emeasure
1883 measure_space.measure_compl -> emeasure_compl
1884 measure_space.measure_countable_increasing -> emeasure_countable_increasing
1885 measure_space.measure_countably_subadditive -> emeasure_subadditive_countably
1886 measure_space.measure_decseq -> decseq_emeasure
1887 measure_space.measure_Diff -> emeasure_Diff
1888 measure_space.measure_Diff_null_set -> emeasure_Diff_null_set
1889 measure_space.measure_eq_0 -> emeasure_eq_0
1890 measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite
1891 measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton
1892 measure_space.measure_incseq -> incseq_emeasure
1893 measure_space.measure_insert -> emeasure_insert
1894 measure_space.measure_mono -> emeasure_mono
1895 measure_space.measure_not_negative -> emeasure_not_MInf
1896 measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq
1897 measure_space.measure_setsum -> setsum_emeasure
1898 measure_space.measure_setsum_split -> setsum_emeasure_cover
1899 measure_space.measure_space_vimage -> emeasure_distr
1900 measure_space.measure_subadditive_finite -> emeasure_subadditive_finite
1901 measure_space.measure_subadditive -> subadditive
1902 measure_space.measure_top -> emeasure_space
1903 measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0
1904 measure_space.measure_Un_null_set -> emeasure_Un_null_set
1905 measure_space.positive_integral_translated_density -> positive_integral_density
1906 measure_space.positive_integral_vimage -> positive_integral_distr
1907 measure_space.real_continuity_from_above -> Lim_measure_decseq
1908 measure_space.real_continuity_from_below -> Lim_measure_incseq
1909 measure_space.real_measure_countably_subadditive -> measure_subadditive_countably
1910 measure_space.real_measure_Diff -> measure_Diff
1911 measure_space.real_measure_finite_Union -> measure_finite_Union
1912 measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton
1913 measure_space.real_measure_subadditive -> measure_subadditive
1914 measure_space.real_measure_Union -> measure_Union
1915 measure_space.real_measure_UNION -> measure_UNION
1916 measure_space.simple_function_vimage -> simple_function_comp
1917 measure_space.simple_integral_vimage -> simple_integral_distr
1918 measure_space.simple_integral_vimage -> simple_integral_distr
1919 measure_unique_Int_stable -> measure_eqI_generator_eq
1920 measure_unique_Int_stable_vimage -> measure_eqI_generator_eq
1921 pair_sigma_algebra.measurable_cut_fst -> sets_Pair1
1922 pair_sigma_algebra.measurable_cut_snd -> sets_Pair2
1923 pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1
1924 pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2
1925 pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff
1926 pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap
1927 pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'
1928 pair_sigma_algebra.sets_swap -> sets_pair_swap
1929 pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1
1930 pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2
1931 pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap
1932 pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2
1933 pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt
1934 pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times
1935 prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM
1936 prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq
1937 prob_space.measure_space_1 -> prob_space.emeasure_space_1
1938 prob_space.prob_space_vimage -> prob_space_distr
1939 prob_space.random_variable_restrict -> measurable_restrict
1940 prob_space_unique_Int_stable -> measure_eqI_prob_space
1941 product_algebraE -> prod_algebraE_all
1942 product_algebra_generator_der -> prod_algebra_eq_finite
1943 product_algebra_generator_into_space -> prod_algebra_sets_into_space
1944 product_algebraI -> sets_PiM_I_finite
1945 product_measure_exists -> product_sigma_finite.sigma_finite
1946 product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator
1947 product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb
1948 product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty
1949 product_prob_space.measurable_component -> measurable_component_singleton
1950 product_prob_space.measurable_emb -> measurable_prod_emb
1951 product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single
1952 product_prob_space.measurable_singleton_infprod -> measurable_component_singleton
1953 product_prob_space.measure_emb -> emeasure_prod_emb
1954 product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict
1955 product_sigma_algebra.product_algebra_into_space -> space_closed
1956 product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge
1957 product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton
1958 product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge
1959 sequence_space.measure_infprod -> sequence_space.measure_PiM_countable
1960 sets_product_algebra -> sets_PiM
1961 sigma_algebra.measurable_sigma -> measurable_measure_of
1962 sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint
1963 sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr
1964 sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq
1965 space_product_algebra -> space_PiM
1967 * Session HOL-TPTP: support to parse and import TPTP problems (all
1968 languages) into Isabelle/HOL.
1973 * New "case_product" attribute (see HOL).
1978 * Greater support for structured proofs involving induction or case
1981 * Much greater use of mathematical symbols.
1983 * Removal of many ML theorem bindings. INCOMPATIBILITY.
1988 * Antiquotation @{keyword "name"} produces a parser for outer syntax
1989 from a minor keyword introduced via theory header declaration.
1991 * Antiquotation @{command_spec "name"} produces the
1992 Outer_Syntax.command_spec from a major keyword introduced via theory
1993 header declaration; it can be passed to Outer_Syntax.command etc.
1995 * Local_Theory.define no longer hard-wires default theorem name
1996 "foo_def", but retains the binding as given. If that is Binding.empty
1997 / Attrib.empty_binding, the result is not registered as user-level
1998 fact. The Local_Theory.define_internal variant allows to specify a
1999 non-empty name (used for the foundation in the background theory),
2000 while omitting the fact binding in the user-context. Potential
2001 INCOMPATIBILITY for derived definitional packages: need to specify
2002 naming policy for primitive definitions more explicitly.
2004 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
2005 conformance with similar operations in structure Term and Logic.
2007 * Antiquotation @{attributes [...]} embeds attribute source
2008 representation into the ML text, which is particularly useful with
2009 declarations like Local_Theory.note.
2011 * Structure Proof_Context follows standard naming scheme. Old
2012 ProofContext has been discontinued. INCOMPATIBILITY.
2014 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
2015 change of semantics: update is applied to auxiliary local theory
2018 * Modernized some old-style infix operations:
2020 addeqcongs ~> Simplifier.add_eqcong
2021 deleqcongs ~> Simplifier.del_eqcong
2022 addcongs ~> Simplifier.add_cong
2023 delcongs ~> Simplifier.del_cong
2024 setmksimps ~> Simplifier.set_mksimps
2025 setmkcong ~> Simplifier.set_mkcong
2026 setmksym ~> Simplifier.set_mksym
2027 setmkeqTrue ~> Simplifier.set_mkeqTrue
2028 settermless ~> Simplifier.set_termless
2029 setsubgoaler ~> Simplifier.set_subgoaler
2030 addsplits ~> Splitter.add_split
2031 delsplits ~> Splitter.del_split
2036 * USER_HOME settings variable points to cross-platform user home
2037 directory, which coincides with HOME on POSIX systems only. Likewise,
2038 the Isabelle path specification "~" now expands to $USER_HOME, instead
2039 of former $HOME. A different default for USER_HOME may be set
2040 explicitly in shell environment, before Isabelle settings are
2041 evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where
2042 the generic user home was intended.
2044 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
2045 notation, which is useful for the jEdit file browser, for example.
2047 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
2052 New in Isabelle2011-1 (October 2011)
2053 ------------------------------------
2057 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
2058 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
2060 - Management of multiple theory files directly from the editor
2061 buffer store -- bypassing the file-system (no requirement to save
2062 files for checking).
2064 - Markup of formal entities within the text buffer, with semantic
2065 highlighting, tooltips and hyperlinks to jump to defining source
2068 - Improved text rendering, with sub/superscripts in the source
2069 buffer (including support for copy/paste wrt. output panel, HTML
2070 theory output and other non-Isabelle text boxes).
2072 - Refined scheduling of proof checking and printing of results,
2073 based on interactive editor view. (Note: jEdit folding and
2074 narrowing allows to restrict buffer perspectives explicitly.)
2076 - Reduced CPU performance requirements, usable on machines with few
2079 - Reduced memory requirements due to pruning of unused document
2080 versions (garbage collection).
2082 See also ~~/src/Tools/jEdit/README.html for further information,
2083 including some remaining limitations.
2085 * Theory loader: source files are exclusively located via the master
2086 directory of each theory node (where the .thy file itself resides).
2087 The global load path (such as src/HOL/Library) has been discontinued.
2088 Note that the path element ~~ may be used to reference theories in the
2089 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
2092 * Theory loader: source files are identified by content via SHA1
2093 digests. Discontinued former path/modtime identification and optional
2094 ISABELLE_FILE_IDENT plugin scripts.
2096 * Parallelization of nested Isar proofs is subject to
2097 Goal.parallel_proofs_threshold (default 100). See also isabelle
2100 * Name space: former unsynchronized references are now proper
2101 configuration options, with more conventional names:
2103 long_names ~> names_long
2104 short_names ~> names_short
2105 unique_names ~> names_unique
2107 Minor INCOMPATIBILITY, need to declare options in context like this:
2109 declare [[names_unique = false]]
2111 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note
2112 that the result needs to be unique, which means fact specifications
2113 may have to be refined after enriching a proof context.
2115 * Attribute "case_names" has been refined: the assumptions in each case
2116 can be named now by following the case name with [name1 name2 ...].
2118 * Isabelle/Isar reference manual has been updated and extended:
2119 - "Synopsis" provides a catalog of main Isar language concepts.
2120 - Formal references in syntax diagrams, via @{rail} antiquotation.
2121 - Updated material from classic "ref" manual, notably about
2122 "Classical Reasoner".
2127 * Class bot and top require underlying partial order rather than
2128 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.
2130 * Class complete_lattice: generalized a couple of lemmas from sets;
2131 generalized theorems INF_cong and SUP_cong. New type classes for
2132 complete boolean algebras and complete linear orders. Lemmas
2133 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
2134 class complete_linorder.
2136 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
2137 Sup_fun_def, Inf_apply, Sup_apply.
2139 Removed redundant lemmas (the right hand side gives hints how to
2140 replace them for (metis ...), or (simp only: ...) proofs):
2142 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
2143 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
2144 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
2145 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
2146 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
2147 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
2148 Inter_def ~> INF_def, image_def
2149 Union_def ~> SUP_def, image_def
2150 INT_eq ~> INF_def, and image_def
2151 UN_eq ~> SUP_def, and image_def
2152 INF_subset ~> INF_superset_mono [OF _ order_refl]
2154 More consistent and comprehensive names:
2156 INTER_eq_Inter_image ~> INF_def
2157 UNION_eq_Union_image ~> SUP_def
2160 INF_leI ~> INF_lower
2161 INF_leI2 ~> INF_lower2
2162 le_INFI ~> INF_greatest
2163 le_SUPI ~> SUP_upper
2164 le_SUPI2 ~> SUP_upper2
2165 SUP_leI ~> SUP_least
2166 INFI_bool_eq ~> INF_bool_eq
2167 SUPR_bool_eq ~> SUP_bool_eq
2168 INFI_apply ~> INF_apply
2169 SUPR_apply ~> SUP_apply
2170 INTER_def ~> INTER_eq
2171 UNION_def ~> UNION_eq
2175 * Renamed theory Complete_Lattice to Complete_Lattices.
2178 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
2179 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
2180 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
2181 Sup_insert are now declared as [simp]. INCOMPATIBILITY.
2183 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
2184 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
2185 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor
2188 * Added syntactic classes "inf" and "sup" for the respective
2189 constants. INCOMPATIBILITY: Changes in the argument order of the
2190 (mostly internal) locale predicates for some derived classes.
2192 * Theorem collections ball_simps and bex_simps do not contain theorems
2193 referring to UNION any longer; these have been moved to collection
2194 UN_ball_bex_simps. INCOMPATIBILITY.
2196 * Theory Archimedean_Field: floor now is defined as parameter of a
2197 separate type class floor_ceiling.
2199 * Theory Finite_Set: more coherent development of fold_set locales:
2201 locale fun_left_comm ~> locale comp_fun_commute
2202 locale fun_left_comm_idem ~> locale comp_fun_idem
2204 Both use point-free characterization; interpretation proofs may need
2205 adjustment. INCOMPATIBILITY.
2207 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
2208 accordance with standard mathematical terminology. INCOMPATIBILITY.
2210 * Theory Complex_Main: The locale interpretations for the
2211 bounded_linear and bounded_bilinear locales have been removed, in
2212 order to reduce the number of duplicate lemmas. Users must use the
2213 original names for distributivity theorems, potential INCOMPATIBILITY.
2215 divide.add ~> add_divide_distrib
2216 divide.diff ~> diff_divide_distrib
2217 divide.setsum ~> setsum_divide_distrib
2218 mult.add_right ~> right_distrib
2219 mult.diff_right ~> right_diff_distrib
2220 mult_right.setsum ~> setsum_right_distrib
2221 mult_left.diff ~> left_diff_distrib
2223 * Theory Complex_Main: Several redundant theorems have been removed or
2224 replaced by more general versions. INCOMPATIBILITY.
2226 real_diff_def ~> minus_real_def
2227 real_divide_def ~> divide_real_def
2228 real_less_def ~> less_le
2229 real_abs_def ~> abs_real_def
2230 real_sgn_def ~> sgn_real_def
2231 real_mult_commute ~> mult_commute
2232 real_mult_assoc ~> mult_assoc
2233 real_mult_1 ~> mult_1_left
2234 real_add_mult_distrib ~> left_distrib
2235 real_zero_not_eq_one ~> zero_neq_one
2236 real_mult_inverse_left ~> left_inverse
2237 INVERSE_ZERO ~> inverse_zero
2238 real_le_refl ~> order_refl
2239 real_le_antisym ~> order_antisym
2240 real_le_trans ~> order_trans
2241 real_le_linear ~> linear
2242 real_le_eq_diff ~> le_iff_diff_le_0
2243 real_add_left_mono ~> add_left_mono
2244 real_mult_order ~> mult_pos_pos
2245 real_mult_less_mono2 ~> mult_strict_left_mono
2246 real_of_int_real_of_nat ~> real_of_int_of_nat_eq
2247 real_0_le_divide_iff ~> zero_le_divide_iff
2248 realpow_two_disj ~> power2_eq_iff
2249 real_squared_diff_one_factored ~> square_diff_one_factored
2250 realpow_two_diff ~> square_diff_square_factored
2251 reals_complete2 ~> complete_real
2252 real_sum_squared_expand ~> power2_sum
2253 exp_ln_eq ~> ln_unique
2255 expi_zero ~> exp_zero
2256 lemma_DERIV_subst ~> DERIV_cong
2257 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
2258 LIMSEQ_const ~> tendsto_const
2259 LIMSEQ_norm ~> tendsto_norm
2260 LIMSEQ_add ~> tendsto_add
2261 LIMSEQ_minus ~> tendsto_minus
2262 LIMSEQ_minus_cancel ~> tendsto_minus_cancel
2263 LIMSEQ_diff ~> tendsto_diff
2264 bounded_linear.LIMSEQ ~> bounded_linear.tendsto
2265 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
2266 LIMSEQ_mult ~> tendsto_mult
2267 LIMSEQ_inverse ~> tendsto_inverse
2268 LIMSEQ_divide ~> tendsto_divide
2269 LIMSEQ_pow ~> tendsto_power
2270 LIMSEQ_setsum ~> tendsto_setsum
2271 LIMSEQ_setprod ~> tendsto_setprod
2272 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
2273 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
2274 LIMSEQ_imp_rabs ~> tendsto_rabs
2275 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
2276 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
2277 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
2278 LIMSEQ_Complex ~> tendsto_Complex
2279 LIM_ident ~> tendsto_ident_at
2280 LIM_const ~> tendsto_const
2281 LIM_add ~> tendsto_add
2282 LIM_add_zero ~> tendsto_add_zero
2283 LIM_minus ~> tendsto_minus
2284 LIM_diff ~> tendsto_diff
2285 LIM_norm ~> tendsto_norm
2286 LIM_norm_zero ~> tendsto_norm_zero
2287 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
2288 LIM_norm_zero_iff ~> tendsto_norm_zero_iff
2289 LIM_rabs ~> tendsto_rabs
2290 LIM_rabs_zero ~> tendsto_rabs_zero
2291 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
2292 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
2293 LIM_compose ~> tendsto_compose
2294 LIM_mult ~> tendsto_mult
2295 LIM_scaleR ~> tendsto_scaleR
2296 LIM_of_real ~> tendsto_of_real
2297 LIM_power ~> tendsto_power
2298 LIM_inverse ~> tendsto_inverse
2299 LIM_sgn ~> tendsto_sgn
2300 isCont_LIM_compose ~> isCont_tendsto_compose
2301 bounded_linear.LIM ~> bounded_linear.tendsto
2302 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
2303 bounded_bilinear.LIM ~> bounded_bilinear.tendsto
2304 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
2305 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
2306 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
2307 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
2309 * Theory Complex_Main: The definition of infinite series was
2310 generalized. Now it is defined on the type class {topological_space,
2311 comm_monoid_add}. Hence it is useable also for extended real numbers.
2313 * Theory Complex_Main: The complex exponential function "expi" is now
2314 a type-constrained abbreviation for "exp :: complex => complex"; thus
2315 several polymorphic lemmas about "exp" are now applicable to "expi".
2319 - Theory Library/Code_Char_ord provides native ordering of
2320 characters in the target language.
2322 - Commands code_module and code_library are legacy, use export_code
2325 - Method "evaluation" is legacy, use method "eval" instead.
2327 - Legacy evaluator "SML" is deactivated by default. May be
2328 reactivated by the following theory command:
2330 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
2332 * Declare ext [intro] by default. Rare INCOMPATIBILITY.
2334 * New proof method "induction" that gives induction hypotheses the
2335 name "IH", thus distinguishing them from further hypotheses that come
2336 from rule induction. The latter are still called "hyps". Method
2337 "induction" is a thin wrapper around "induct" and follows the same
2340 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
2341 still available as a legacy feature for some time.
2344 - Added "need" and "total_consts" options.
2345 - Reintroduced "show_skolems" option by popular demand.
2346 - Renamed attribute: nitpick_def ~> nitpick_unfold.
2350 - Use quasi-sound (and efficient) translations by default.
2351 - Added support for the following provers: E-ToFoF, LEO-II,
2352 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
2353 - Automatically preplay and minimize proofs before showing them if
2354 this can be done within reasonable time.
2355 - sledgehammer available_provers ~> sledgehammer supported_provers.
2357 - Added "preplay_timeout", "slicing", "type_enc", "sound",
2358 "max_mono_iters", and "max_new_mono_instances" options.
2359 - Removed "explicit_apply" and "full_types" options as well as "Full
2360 Types" Proof General menu item. INCOMPATIBILITY.
2363 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
2364 - Obsoleted "metisFT" -- use "metis (full_types)" instead.
2368 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
2369 "elim:" options. INCOMPATIBILITY.
2370 - Introduced 'try' that not only runs 'try_methods' but also
2371 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
2374 - Added "eval" option to evaluate terms for the found counterexample
2375 (currently only supported by the default (exhaustive) tester).
2376 - Added post-processing of terms to obtain readable counterexamples
2377 (currently only supported by the default (exhaustive) tester).
2378 - New counterexample generator quickcheck[narrowing] enables
2379 narrowing-based testing. Requires the Glasgow Haskell compiler
2380 with its installation location defined in the Isabelle settings
2381 environment as ISABELLE_GHC.
2382 - Removed quickcheck tester "SML" based on the SML code generator
2383 (formly in HOL/Library).
2385 * Function package: discontinued option "tailrec". INCOMPATIBILITY,
2386 use 'partial_function' instead.
2388 * Theory Library/Extended_Reals replaces now the positive extended
2389 reals found in probability theory. This file is extended by
2390 Multivariate_Analysis/Extended_Real_Limits.
2392 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,
2393 from where it must be imported explicitly if it is really required.
2396 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
2397 been moved here. INCOMPATIBILITY.
2399 * Theory Library/Saturated provides type of numbers with saturated
2402 * Theory Library/Product_Lattice defines a pointwise ordering for the
2403 product type 'a * 'b, and provides instance proofs for various order
2404 and lattice type classes.
2406 * Theory Library/Countable now provides the "countable_datatype" proof
2407 method for proving "countable" class instances for datatypes.
2409 * Theory Library/Cset_Monad allows do notation for computable sets
2410 (cset) via the generic monad ad-hoc overloading facility.
2412 * Library: Theories of common data structures are split into theories
2413 for implementation, an invariant-ensuring type, and connection to an
2414 abstract type. INCOMPATIBILITY.
2416 - RBT is split into RBT and RBT_Mapping.
2417 - AssocList is split and renamed into AList and AList_Mapping.
2418 - DList is split into DList_Impl, DList, and DList_Cset.
2419 - Cset is split into Cset and List_Cset.
2421 * Theory Library/Nat_Infinity has been renamed to
2422 Library/Extended_Nat, with name changes of the following types and
2425 type inat ~> type enat
2427 Infty ~> infinity (overloaded)
2431 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
2432 been renamed accordingly. INCOMPATIBILITY.
2434 * Session Multivariate_Analysis: The euclidean_space type class now
2435 fixes a constant "Basis :: 'a set" consisting of the standard
2436 orthonormal basis for the type. Users now have the option of
2437 quantifying over this set instead of using the "basis" function, e.g.
2438 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
2440 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
2441 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
2442 "Cart_nth" and "Cart_lambda" have been respectively renamed to
2443 "vec_nth" and "vec_lambda"; theorems mentioning those names have
2444 changed to match. Definition theorems for overloaded constants now use
2445 the standard "foo_vec_def" naming scheme. A few other theorems have
2446 been renamed as follows (INCOMPATIBILITY):
2448 Cart_eq ~> vec_eq_iff
2449 dist_nth_le_cart ~> dist_vec_nth_le
2450 tendsto_vector ~> vec_tendstoI
2451 Cauchy_vector ~> vec_CauchyI
2453 * Session Multivariate_Analysis: Several duplicate theorems have been
2454 removed, and other theorems have been renamed or replaced with more
2455 general versions. INCOMPATIBILITY.
2457 finite_choice ~> finite_set_choice
2458 eventually_conjI ~> eventually_conj
2459 eventually_and ~> eventually_conj_iff
2460 eventually_false ~> eventually_False
2461 setsum_norm ~> norm_setsum
2462 Lim_sequentially ~> LIMSEQ_def
2463 Lim_ident_at ~> LIM_ident
2464 Lim_const ~> tendsto_const
2465 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
2466 Lim_neg ~> tendsto_minus
2467 Lim_add ~> tendsto_add
2468 Lim_sub ~> tendsto_diff
2469 Lim_mul ~> tendsto_scaleR
2470 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
2471 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
2472 Lim_linear ~> bounded_linear.tendsto
2473 Lim_component ~> tendsto_euclidean_component
2474 Lim_component_cart ~> tendsto_vec_nth
2475 Lim_inner ~> tendsto_inner [OF tendsto_const]
2476 dot_lsum ~> inner_setsum_left
2477 dot_rsum ~> inner_setsum_right
2478 continuous_cmul ~> continuous_scaleR [OF continuous_const]
2479 continuous_neg ~> continuous_minus
2480 continuous_sub ~> continuous_diff
2481 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
2482 continuous_mul ~> continuous_scaleR
2483 continuous_inv ~> continuous_inverse
2484 continuous_at_within_inv ~> continuous_at_within_inverse
2485 continuous_at_inv ~> continuous_at_inverse
2486 continuous_at_norm ~> continuous_norm [OF continuous_at_id]
2487 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
2488 continuous_at_component ~> continuous_component [OF continuous_at_id]
2489 continuous_on_neg ~> continuous_on_minus
2490 continuous_on_sub ~> continuous_on_diff
2491 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
2492 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
2493 continuous_on_mul ~> continuous_on_scaleR
2494 continuous_on_mul_real ~> continuous_on_mult
2495 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
2496 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
2497 continuous_on_inverse ~> continuous_on_inv
2498 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
2499 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
2500 subset_interior ~> interior_mono
2501 subset_closure ~> closure_mono
2502 closure_univ ~> closure_UNIV
2503 real_arch_lt ~> reals_Archimedean2
2504 real_arch ~> reals_Archimedean3
2505 real_abs_norm ~> abs_norm_cancel
2506 real_abs_sub_norm ~> norm_triangle_ineq3
2507 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
2509 * Session HOL-Probability:
2510 - Caratheodory's extension lemma is now proved for ring_of_sets.
2511 - Infinite products of probability measures are now available.
2512 - Sigma closure is independent, if the generator is independent
2513 - Use extended reals instead of positive extended
2514 reals. INCOMPATIBILITY.
2516 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
2518 expand_fun_below ~> fun_below_iff
2519 below_fun_ext ~> fun_belowI
2520 expand_cfun_eq ~> cfun_eq_iff
2521 ext_cfun ~> cfun_eqI
2522 expand_cfun_below ~> cfun_below_iff
2523 below_cfun_ext ~> cfun_belowI
2524 monofun_fun_fun ~> fun_belowD
2525 monofun_fun_arg ~> monofunE
2526 monofun_lub_fun ~> adm_monofun [THEN admD]
2527 cont_lub_fun ~> adm_cont [THEN admD]
2528 cont2cont_Rep_CFun ~> cont2cont_APP
2529 cont_Rep_CFun_app ~> cont_APP_app
2530 cont_Rep_CFun_app_app ~> cont_APP_app_app
2531 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
2532 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
2533 contlub_cfun ~> lub_APP [symmetric]
2534 contlub_LAM ~> lub_LAM [symmetric]
2537 lift_distinct1 ~> lift.distinct(1)
2538 lift_distinct2 ~> lift.distinct(2)
2539 Def_not_UU ~> lift.distinct(2)
2540 Def_inject ~> lift.inject
2541 below_UU_iff ~> below_bottom_iff
2542 eq_UU_iff ~> eq_bottom_iff
2545 *** Document preparation ***
2547 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
2548 isar-ref manual, both for description and actual application of the
2551 * Antiquotation @{value} evaluates the given term and presents its
2554 * Antiquotations: term style "isub" provides ad-hoc conversion of
2555 variables x1, y23 into subscripted form x\<^isub>1,
2556 y\<^isub>2\<^isub>3.
2558 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
2559 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
2561 * Localized \isabellestyle switch can be used within blocks or groups
2564 \isabellestyle{it} %preferred default
2565 {\isabellestylett @{text "typewriter stuff"}}
2567 * Discontinued special treatment of hard tabulators. Implicit
2568 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual
2574 * The inner syntax of sort/type/term/prop supports inlined YXML
2575 representations within quoted string tokens. By encoding logical
2576 entities via Term_XML (in ML or Scala) concrete syntax can be
2577 bypassed, which is particularly useful for producing bits of text
2578 under external program control.
2580 * Antiquotations for ML and document preparation are managed as theory
2581 data, which requires explicit setup.
2583 * Isabelle_Process.is_active allows tools to check if the official
2584 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
2585 (better known as Proof General).
2587 * Structure Proof_Context follows standard naming scheme. Old
2588 ProofContext is still available for some time as legacy alias.
2590 * Structure Timing provides various operations for timing; supersedes
2591 former start_timing/end_timing etc.
2593 * Path.print is the official way to show file-system paths to users
2594 (including quotes etc.).
2596 * Inner syntax: identifiers in parse trees of generic categories
2597 "logic", "aprop", "idt" etc. carry position information (disguised as
2598 type constraints). Occasional INCOMPATIBILITY with non-compliant
2599 translations that choke on unexpected type constraints. Positions can
2600 be stripped in ML translations via Syntax.strip_positions /
2601 Syntax.strip_positions_ast, or via the syntax constant
2602 "_strip_positions" within parse trees. As last resort, positions can
2603 be disabled via the configuration option Syntax.positions, which is
2604 called "syntax_positions" in Isar attribute syntax.
2606 * Discontinued special status of various ML structures that contribute
2607 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
2608 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
2609 refer directly to Ast.Constant, Lexicon.is_identifier,
2610 Syntax_Trans.mk_binder_tr etc.
2612 * Typed print translation: discontinued show_sorts argument, which is
2613 already available via context of "advanced" translation.
2615 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
2616 goal states; body tactic needs to address all subgoals uniformly.
2618 * Slightly more special eq_list/eq_set, with shortcut involving
2619 pointer equality (assumes that eq relation is reflexive).
2621 * Classical tactics use proper Proof.context instead of historic types
2622 claset/clasimpset. Old-style declarations like addIs, addEs, addDs
2623 operate directly on Proof.context. Raw type claset retains its use as
2624 snapshot of the classical context, which can be recovered via
2625 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.
2626 INCOMPATIBILITY, classical tactics and derived proof methods require
2627 proper Proof.context.
2632 * Discontinued support for Poly/ML 5.2, which was the last version
2633 without proper multithreading and TimeLimit implementation.
2635 * Discontinued old lib/scripts/polyml-platform, which has been
2636 obsolete since Isabelle2009-2.
2638 * Various optional external tools are referenced more robustly and
2639 uniformly by explicit Isabelle settings as follows:
2641 ISABELLE_CSDP (formerly CSDP_EXE)
2642 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)
2643 ISABELLE_OCAML (formerly EXEC_OCAML)
2644 ISABELLE_SWIPL (formerly EXEC_SWIPL)
2645 ISABELLE_YAP (formerly EXEC_YAP)
2647 Note that automated detection from the file-system or search path has
2648 been discontinued. INCOMPATIBILITY.
2650 * Scala layer provides JVM method invocation service for static
2651 methods of type (String)String, see Invoke_Scala.method in ML. For
2654 Invoke_Scala.method "java.lang.System.getProperty" "java.home"
2656 Together with YXML.string_of_body/parse_body and XML.Encode/Decode
2657 this allows to pass structured values between ML and Scala.
2659 * The IsabelleText fonts includes some further glyphs to support the
2660 Prover IDE. Potential INCOMPATIBILITY: users who happen to have
2661 installed a local copy (which is normally *not* required) need to
2662 delete or update it from ~~/lib/fonts/.
2666 New in Isabelle2011 (January 2011)
2667 ----------------------------------
2671 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
2672 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
2673 useful tooltips and hyperlinks produced from its static analysis. The
2674 bundled component provides an executable Isabelle tool that can be run
2677 Isabelle2011/bin/isabelle jedit
2679 * Significantly improved Isabelle/Isar implementation manual.
2681 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
2682 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
2683 while the default heap location within that directory lacks that extra
2684 suffix. This isolates multiple Isabelle installations from each
2685 other, avoiding problems with old settings in new versions.
2686 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
2688 * Source files are always encoded as UTF-8, instead of old-fashioned
2689 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
2690 the following package declarations:
2692 \usepackage[utf8]{inputenc}
2693 \usepackage{textcomp}
2695 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
2696 a Unicode character is treated as a single symbol, not a sequence of
2697 non-ASCII bytes as before. Since Isabelle/ML string literals may
2698 contain symbols without further backslash escapes, Unicode can now be
2699 used here as well. Recall that Symbol.explode in ML provides a
2700 consistent view on symbols, while raw explode (or String.explode)
2701 merely give a byte-oriented representation.
2703 * Theory loader: source files are primarily located via the master
2704 directory of each theory node (where the .thy file itself resides).
2705 The global load path is still partially available as legacy feature.
2706 Minor INCOMPATIBILITY due to subtle change in file lookup: use
2707 explicit paths, relatively to the theory.
2709 * Special treatment of ML file names has been discontinued.
2710 Historically, optional extensions .ML or .sml were added on demand --
2711 at the cost of clarity of file dependencies. Recall that Isabelle/ML
2712 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
2714 * Various options that affect pretty printing etc. are now properly
2715 handled within the context via configuration options, instead of
2716 unsynchronized references or print modes. There are both ML Config.T
2717 entities and Isar declaration attributes to access these.
2719 ML (Config.T) Isar (attribute)
2721 eta_contract eta_contract
2722 show_brackets show_brackets
2723 show_sorts show_sorts
2724 show_types show_types
2725 show_question_marks show_question_marks
2726 show_consts show_consts
2727 show_abbrevs show_abbrevs
2729 Syntax.ast_trace syntax_ast_trace
2730 Syntax.ast_stat syntax_ast_stat
2731 Syntax.ambiguity_level syntax_ambiguity_level
2733 Goal_Display.goals_limit goals_limit
2734 Goal_Display.show_main_goal show_main_goal
2736 Method.rule_trace rule_trace
2738 Thy_Output.display thy_output_display
2739 Thy_Output.quotes thy_output_quotes
2740 Thy_Output.indent thy_output_indent
2741 Thy_Output.source thy_output_source
2742 Thy_Output.break thy_output_break
2744 Note that corresponding "..._default" references in ML may only be
2745 changed globally at the ROOT session setup, but *not* within a theory.
2746 The option "show_abbrevs" supersedes the former print mode
2747 "no_abbrevs" with inverted meaning.
2749 * More systematic naming of some configuration options.
2752 trace_simp ~> simp_trace
2753 debug_simp ~> simp_debug
2755 * Support for real valued configuration options, using simplistic
2756 floating-point notation that coincides with the inner syntax for
2759 * Support for real valued preferences (with approximative PGIP type):
2760 front-ends need to accept "pgint" values in float notation.
2763 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
2766 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
2771 * Command 'type_synonym' (with single argument) replaces somewhat
2772 outdated 'types', which is still available as legacy feature for some
2775 * Command 'nonterminal' (with 'and' separated list of arguments)
2776 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
2778 * Command 'notepad' replaces former 'example_proof' for
2779 experimentation in Isar without any result. INCOMPATIBILITY.
2781 * Locale interpretation commands 'interpret' and 'sublocale' accept
2782 lists of equations to map definitions in a locale to appropriate
2783 entities in the context of the interpretation. The 'interpretation'
2784 command already provided this functionality.
2786 * Diagnostic command 'print_dependencies' prints the locale instances
2787 that would be activated if the specified expression was interpreted in
2788 the current context. Variant "print_dependencies!" assumes a context
2789 without interpretations.
2791 * Diagnostic command 'print_interps' prints interpretations in proofs
2792 in addition to interpretations in theories.
2794 * Discontinued obsolete 'global' and 'local' commands to manipulate
2795 the theory name space. Rare INCOMPATIBILITY. The ML functions
2796 Sign.root_path and Sign.local_path may be applied directly where this
2797 feature is still required for historical reasons.
2799 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
2800 'definition' instead.
2802 * The "prems" fact, which refers to the accidental collection of
2803 foundational premises in the context, is now explicitly marked as
2804 legacy feature and will be discontinued soon. Consider using "assms"
2805 of the head statement or reference facts by explicit names.
2807 * Document antiquotations @{class} and @{type} print classes and type
2810 * Document antiquotation @{file} checks file/directory entries within
2811 the local file system.
2816 * Coercive subtyping: functions can be declared as coercions and type
2817 inference will add them as necessary upon input of a term. Theory
2818 Complex_Main declares real :: nat => real and real :: int => real as
2819 coercions. A coercion function f is declared like this:
2821 declare [[coercion f]]
2823 To lift coercions through type constructors (e.g. from nat => real to
2824 nat list => real list), map functions can be declared, e.g.
2826 declare [[coercion_map map]]
2828 Currently coercion inference is activated only in theories including
2829 real numbers, i.e. descendants of Complex_Main. This is controlled by
2830 the configuration option "coercion_enabled", e.g. it can be enabled in
2831 other theories like this:
2833 declare [[coercion_enabled]]
2835 * Command 'partial_function' provides basic support for recursive
2836 function definitions over complete partial orders. Concrete instances
2837 are provided for i) the option type, ii) tail recursion on arbitrary
2838 types, and iii) the heap monad of Imperative_HOL. See
2839 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
2842 * Function package: f.psimps rules are no longer implicitly declared
2843 as [simp]. INCOMPATIBILITY.
2845 * Datatype package: theorems generated for executable equality (class
2846 "eq") carry proper names and are treated as default code equations.
2848 * Inductive package: now offers command 'inductive_simps' to
2849 automatically derive instantiated and simplified equations for
2850 inductive predicates, similar to 'inductive_cases'.
2852 * Command 'enriched_type' allows to register properties of the
2853 functorial structure of types.
2855 * Improved infrastructure for term evaluation using code generator
2856 techniques, in particular static evaluation conversions.
2858 * Code generator: Scala (2.8 or higher) has been added to the target
2861 * Code generator: globbing constant expressions "*" and "Theory.*"
2862 have been replaced by the more idiomatic "_" and "Theory._".
2865 * Code generator: export_code without explicit file declaration prints
2866 to standard output. INCOMPATIBILITY.
2868 * Code generator: do not print function definitions for case
2869 combinators any longer.
2871 * Code generator: simplification with rules determined with
2872 src/Tools/Code/code_simp.ML and method "code_simp".
2874 * Code generator for records: more idiomatic representation of record
2875 types. Warning: records are not covered by ancient SML code
2876 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
2877 rep_datatype declaration helps to succeed then:
2881 rep_datatype foo_ext ...
2883 * Records: logical foundation type for records does not carry a
2884 '_type' suffix any longer (obsolete due to authentic syntax).
2887 * Quickcheck now by default uses exhaustive testing instead of random
2888 testing. Random testing can be invoked by "quickcheck [random]",
2889 exhaustive testing by "quickcheck [exhaustive]".
2891 * Quickcheck instantiates polymorphic types with small finite
2892 datatypes by default. This enables a simple execution mechanism to
2893 handle quantifiers and function equality over the finite datatypes.
2895 * Quickcheck random generator has been renamed from "code" to
2896 "random". INCOMPATIBILITY.
2898 * Quickcheck now has a configurable time limit which is set to 30
2899 seconds by default. This can be changed by adding [timeout = n] to the
2900 quickcheck command. The time limit for Auto Quickcheck is still set
2903 * Quickcheck in locales considers interpretations of that locale for
2904 counter example search.
2907 - Added "smt" and "remote_smt" provers based on the "smt" proof
2908 method. See the Sledgehammer manual for details ("isabelle doc
2911 sledgehammer atp_info ~> sledgehammer running_provers
2912 sledgehammer atp_kill ~> sledgehammer kill_provers
2913 sledgehammer available_atps ~> sledgehammer available_provers
2916 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
2917 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
2918 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
2919 (and "ms" and "min" are no longer supported)
2924 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
2925 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
2927 - Added support for partial quotient types.
2928 - Added local versions of the "Nitpick.register_xxx" functions.
2929 - Added "whack" option.
2930 - Allow registration of quotient types as codatatypes.
2931 - Improved "merge_type_vars" option to merge more types.
2932 - Removed unsound "fast_descrs" option.
2933 - Added custom symmetry breaking for datatypes, making it possible to reach
2934 higher cardinalities.
2935 - Prevent the expansion of too large definitions.
2937 * Proof methods "metis" and "meson" now have configuration options
2938 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
2939 to diagnose these tools. E.g.
2941 using [[metis_trace = true]]
2943 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
2944 manually as command 'solve_direct'.
2946 * The default SMT solver Z3 must be enabled explicitly (due to
2947 licensing issues) by setting the environment variable
2948 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
2949 commercial applications, the SMT solver CVC3 is provided as fall-back;
2950 changing the SMT solver is done via the configuration option
2953 * Remote SMT solvers need to be referred to by the "remote_" prefix,
2954 i.e. "remote_cvc3" and "remote_z3".
2956 * Added basic SMT support for datatypes, records, and typedefs using
2957 the oracle mode (no proofs). Direct support of pairs has been dropped
2958 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
2959 support for a similar behavior). Minor INCOMPATIBILITY.
2961 * Changed SMT configuration options:
2963 z3_proofs ~> smt_oracle (with inverted meaning)
2964 z3_trace_assms ~> smt_trace_used_facts
2977 * Boogie output files (.b2i files) need to be declared in the theory
2980 * Simplification procedure "list_to_set_comprehension" rewrites list
2981 comprehensions applied to List.set to set comprehensions. Occasional
2982 INCOMPATIBILITY, may be deactivated like this:
2984 declare [[simproc del: list_to_set_comprehension]]
2986 * Removed old version of primrec package. INCOMPATIBILITY.
2988 * Removed simplifier congruence rule of "prod_case", as has for long
2989 been the case with "split". INCOMPATIBILITY.
2991 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
2993 * Removed [split_format ... and ... and ...] version of
2994 [split_format]. Potential INCOMPATIBILITY.
2996 * Predicate "sorted" now defined inductively, with nice induction
2997 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
2999 * Constant "contents" renamed to "the_elem", to free the generic name
3000 contents for other uses. INCOMPATIBILITY.
3002 * Renamed class eq and constant eq (for code generation) to class
3003 equal and constant equal, plus renaming of related facts and various
3004 tuning. INCOMPATIBILITY.
3006 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
3008 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
3011 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
3012 avoid confusion with finite sets. INCOMPATIBILITY.
3014 * Abandoned locales equiv, congruent and congruent2 for equivalence
3015 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
3018 * Some previously unqualified names have been qualified:
3025 Trueprop ~> HOL.Trueprop
3030 op --> ~> HOL.implies
3042 Pair ~> Product_Type.Pair
3043 fst ~> Product_Type.fst
3044 snd ~> Product_Type.snd
3045 curry ~> Product_Type.curry
3047 Collect ~> Set.Collect
3051 * More canonical naming convention for some fundamental definitions:
3053 bot_bool_eq ~> bot_bool_def
3054 top_bool_eq ~> top_bool_def
3055 inf_bool_eq ~> inf_bool_def
3056 sup_bool_eq ~> sup_bool_def
3057 bot_fun_eq ~> bot_fun_def
3058 top_fun_eq ~> top_fun_def
3059 inf_fun_eq ~> inf_fun_def
3060 sup_fun_eq ~> sup_fun_def
3064 * More stylized fact names:
3066 expand_fun_eq ~> fun_eq_iff
3067 expand_set_eq ~> set_eq_iff
3069 nat_number ~> eval_nat_numeral
3073 * Refactoring of code-generation specific operations in theory List:
3079 mem_iff ~> member_def
3080 null_empty ~> null_def
3082 INCOMPATIBILITY. Note that these were not supposed to be used
3083 regularly unless for striking reasons; their main purpose was code
3086 Various operations from the Haskell prelude are used for generating
3089 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
3090 "surj f" is now an abbreviation of "range f = UNIV". The theorems
3091 bij_def and surj_def are unchanged. INCOMPATIBILITY.
3093 * Abolished some non-alphabetic type names: "prod" and "sum" replace
3094 "*" and "+" respectively. INCOMPATIBILITY.
3096 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
3097 "Sum_Type.Plus" instead.
3099 * Constant "split" has been merged with constant "prod_case"; names of
3100 ML functions, facts etc. involving split have been retained so far,
3101 though. INCOMPATIBILITY.
3103 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
3104 instead. INCOMPATIBILITY.
3106 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
3109 * Former theory Library/Enum is now part of the HOL-Main image.
3110 INCOMPATIBILITY: all constants of the Enum theory now have to be
3111 referred to by its qualified name.
3114 nlists ~> Enum.nlists
3115 product ~> Enum.product
3117 * Theory Library/Monad_Syntax provides do-syntax for monad types.
3118 Syntax in Library/State_Monad has been changed to avoid ambiguities.
3121 * Theory Library/SetsAndFunctions has been split into
3122 Library/Function_Algebras and Library/Set_Algebras; canonical names
3123 for instance definitions for functions; various improvements.
3126 * Theory Library/Multiset provides stable quicksort implementation of
3129 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
3132 * Session Multivariate_Analysis: introduced a type class for euclidean
3133 space. Most theorems are now stated in terms of euclidean spaces
3134 instead of finite cartesian products.
3137 real ^ 'n ~> 'a::real_vector
3138 ~> 'a::euclidean_space
3139 ~> 'a::ordered_euclidean_space
3140 (depends on your needs)
3144 \<chi> x. _ ~> \<chi>\<chi> x. _
3147 Also note that the indices are now natural numbers and not from some
3148 finite type. Finite cartesian products of euclidean spaces, products
3149 of euclidean spaces the real and complex numbers are instantiated to
3150 be euclidean_spaces. INCOMPATIBILITY.
3152 * Session Probability: introduced pextreal as positive extended real
3153 numbers. Use pextreal as value for measures. Introduce the
3154 Radon-Nikodym derivative, product spaces and Fubini's theorem for
3155 arbitrary sigma finite measures. Introduces Lebesgue measure based on
3156 the integral in Multivariate Analysis. INCOMPATIBILITY.
3158 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
3161 * Session SPARK (with image HOL-SPARK) provides commands to load and
3162 prove verification conditions generated by the SPARK Ada program
3163 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
3168 * Theorems for additive ring operations (locale abelian_monoid and
3169 descendants) are generated by interpretation from their multiplicative
3170 counterparts. Names (in particular theorem names) have the mandatory
3171 qualifier 'add'. Previous theorem names are redeclared for
3174 * Structure "int_ring" is now an abbreviation (previously a
3175 definition). This fits more natural with advanced interpretations.
3180 * The domain package now runs in definitional mode by default: The
3181 former command 'new_domain' is now called 'domain'. To use the domain
3182 package in its original axiomatic mode, use 'domain (unsafe)'.
3185 * The new class "domain" is now the default sort. Class "predomain"
3186 is an unpointed version of "domain". Theories can be updated by
3187 replacing sort annotations as shown below. INCOMPATIBILITY.
3189 'a::type ~> 'a::countable
3190 'a::cpo ~> 'a::predomain
3191 'a::pcpo ~> 'a::domain
3193 * The old type class "rep" has been superseded by class "domain".
3194 Accordingly, users of the definitional package must remove any
3195 "default_sort rep" declarations. INCOMPATIBILITY.
3197 * The domain package (definitional mode) now supports unpointed
3198 predomain argument types, as long as they are marked 'lazy'. (Strict
3199 arguments must be in class "domain".) For example, the following
3200 domain definition now works:
3202 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
3204 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
3205 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
3206 'a option, and 'a list. Additionally, it configures fixrec and the
3207 domain package to work with these types. For example:
3209 fixrec isInl :: "('a + 'b) u -> tr"
3210 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
3212 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
3214 * The "(permissive)" option of fixrec has been replaced with a
3215 per-equation "(unchecked)" option. See
3216 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
3218 * The "bifinite" class no longer fixes a constant "approx"; the class
3219 now just asserts that such a function exists. INCOMPATIBILITY.
3221 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
3222 defines an embedding of type 'a defl into udom by default; instances
3223 of "bifinite" and "domain" classes are available in
3224 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
3226 * The syntax "REP('a)" has been replaced with "DEFL('a)".
3228 * The predicate "directed" has been removed. INCOMPATIBILITY.
3230 * The type class "finite_po" has been removed. INCOMPATIBILITY.
3232 * The function "cprod_map" has been renamed to "prod_map".
3235 * The monadic bind operator on each powerdomain has new binder syntax
3236 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
3237 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
3239 * The infix syntax for binary union on each powerdomain has changed
3240 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
3241 syntax. INCOMPATIBILITY.
3243 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
3244 still supported as an input translation.
3246 * Renamed some theorems (the original names are also still available).
3248 expand_fun_below ~> fun_below_iff
3249 below_fun_ext ~> fun_belowI
3250 expand_cfun_eq ~> cfun_eq_iff
3251 ext_cfun ~> cfun_eqI
3252 expand_cfun_below ~> cfun_below_iff
3253 below_cfun_ext ~> cfun_belowI
3254 cont2cont_Rep_CFun ~> cont2cont_APP
3256 * The Abs and Rep functions for various types have changed names.
3257 Related theorem names have also changed to match. INCOMPATIBILITY.
3259 Rep_CFun ~> Rep_cfun
3260 Abs_CFun ~> Abs_cfun
3261 Rep_Sprod ~> Rep_sprod
3262 Abs_Sprod ~> Abs_sprod
3263 Rep_Ssum ~> Rep_ssum
3264 Abs_Ssum ~> Abs_ssum
3266 * Lemmas with names of the form *_defined_iff or *_strict_iff have
3267 been renamed to *_bottom_iff. INCOMPATIBILITY.
3269 * Various changes to bisimulation/coinduction with domain package:
3271 - Definitions of "bisim" constants no longer mention definedness.
3272 - With mutual recursion, "bisim" predicate is now curried.
3273 - With mutual recursion, each type gets a separate coind theorem.
3274 - Variable names in bisim_def and coinduct rules have changed.
3278 * Case combinators generated by the domain package for type "foo" are
3279 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
3281 * Several theorems have been renamed to more accurately reflect the
3282 names of constants and types involved. INCOMPATIBILITY.
3284 thelub_const ~> lub_const
3285 lub_const ~> is_lub_const
3287 is_lub_lub ~> is_lubD2
3289 unique_lub ~> is_lub_unique
3290 is_ub_lub ~> is_lub_rangeD1
3291 lub_bin_chain ~> is_lub_bin_chain
3292 lub_fun ~> is_lub_fun
3293 thelub_fun ~> lub_fun
3294 thelub_cfun ~> lub_cfun
3295 thelub_Pair ~> lub_Pair
3296 lub_cprod ~> is_lub_prod
3297 thelub_cprod ~> lub_prod
3298 minimal_cprod ~> minimal_prod
3299 inst_cprod_pcpo ~> inst_prod_pcpo
3301 compact_UU ~> compact_bottom
3302 deflation_UU ~> deflation_bottom
3303 finite_deflation_UU ~> finite_deflation_bottom
3305 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
3307 sq_ord_less_eq_trans ~> below_eq_trans
3308 sq_ord_eq_less_trans ~> eq_below_trans
3309 refl_less ~> below_refl
3310 trans_less ~> below_trans
3311 antisym_less ~> below_antisym
3312 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
3313 box_less ~> box_below
3314 rev_trans_less ~> rev_below_trans
3315 not_less2not_eq ~> not_below2not_eq
3316 less_UU_iff ~> below_UU_iff
3317 flat_less_iff ~> flat_below_iff
3318 adm_less ~> adm_below
3319 adm_not_less ~> adm_not_below
3320 adm_compact_not_less ~> adm_compact_not_below
3321 less_fun_def ~> below_fun_def
3322 expand_fun_less ~> fun_below_iff
3323 less_fun_ext ~> fun_belowI
3324 less_discr_def ~> below_discr_def
3325 discr_less_eq ~> discr_below_eq
3326 less_unit_def ~> below_unit_def
3327 less_cprod_def ~> below_prod_def
3328 prod_lessI ~> prod_belowI
3329 Pair_less_iff ~> Pair_below_iff
3330 fst_less_iff ~> fst_below_iff
3331 snd_less_iff ~> snd_below_iff
3332 expand_cfun_less ~> cfun_below_iff
3333 less_cfun_ext ~> cfun_belowI
3334 injection_less ~> injection_below
3335 less_up_def ~> below_up_def
3336 not_Iup_less ~> not_Iup_below
3337 Iup_less ~> Iup_below
3339 Def_inject_less_eq ~> Def_below_Def
3340 Def_less_is_eq ~> Def_below_iff
3341 spair_less_iff ~> spair_below_iff
3342 less_sprod ~> below_sprod
3343 spair_less ~> spair_below
3344 sfst_less_iff ~> sfst_below_iff
3345 ssnd_less_iff ~> ssnd_below_iff
3346 fix_least_less ~> fix_least_below
3347 dist_less_one ~> dist_below_one
3348 less_ONE ~> below_ONE
3349 ONE_less_iff ~> ONE_below_iff
3350 less_sinlD ~> below_sinlD
3351 less_sinrD ~> below_sinrD
3356 * All constant names are now qualified internally and use proper
3357 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
3362 * Antiquotation @{assert} inlines a function bool -> unit that raises
3363 Fail if the argument is false. Due to inlining the source position of
3364 failed assertions is included in the error output.
3366 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
3367 text is in practice always evaluated with a stable theory checkpoint.
3368 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
3370 * Antiquotation @{theory A} refers to theory A from the ancestry of
3371 the current context, not any accidental theory loader state as before.
3372 Potential INCOMPATIBILITY, subtle change in semantics.
3374 * Syntax.pretty_priority (default 0) configures the required priority
3375 of pretty-printed output and thus affects insertion of parentheses.
3377 * Syntax.default_root (default "any") configures the inner syntax
3378 category (nonterminal symbol) for parsing of terms.
3380 * Former exception Library.UnequalLengths now coincides with
3381 ListPair.UnequalLengths.
3383 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
3384 main functionality is provided by structure Simplifier.
3386 * Renamed raw "explode" function to "raw_explode" to emphasize its
3387 meaning. Note that internally to Isabelle, Symbol.explode is used in
3388 almost all situations.
3390 * Discontinued obsolete function sys_error and exception SYS_ERROR.
3391 See implementation manual for further details on exceptions in
3394 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
3397 * Renamed structure PureThy to Pure_Thy and moved most of its
3398 operations to structure Global_Theory, to emphasize that this is
3399 rarely-used global-only stuff.
3401 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
3402 instead (or tracing for high-volume output).
3404 * Configuration option show_question_marks only affects regular pretty
3405 printing of types and terms, not raw Term.string_of_vname.
3407 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
3408 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
3409 @{thms} for most purposes.
3411 * ML structure Unsynchronized is never opened, not even in Isar
3412 interaction mode as before. Old Unsynchronized.set etc. have been
3413 discontinued -- use plain := instead. This should be *rare* anyway,
3414 since modern tools always work via official context data, notably
3415 configuration options.
3417 * Parallel and asynchronous execution requires special care concerning
3418 interrupts. Structure Exn provides some convenience functions that
3419 avoid working directly with raw Interrupt. User code must not absorb
3420 interrupts -- intermediate handling (for cleanup etc.) needs to be
3421 followed by re-raising of the original exception. Another common
3422 source of mistakes are "handle _" patterns, which make the meaning of
3423 the program subject to physical effects of the environment.
3427 New in Isabelle2009-2 (June 2010)
3428 ---------------------------------
3432 * Authentic syntax for *all* logical entities (type classes, type
3433 constructors, term constants): provides simple and robust
3434 correspondence between formal entities and concrete syntax. Within
3435 the parse tree / AST representations, "constants" are decorated by
3436 their category (class, type, const) and spelled out explicitly with
3437 their full internal name.
3439 Substantial INCOMPATIBILITY concerning low-level syntax declarations
3440 and translations (translation rules and translation functions in ML).
3441 Some hints on upgrading:
3443 - Many existing uses of 'syntax' and 'translations' can be replaced
3444 by more modern 'type_notation', 'notation' and 'abbreviation',
3445 which are independent of this issue.
3447 - 'translations' require markup within the AST; the term syntax
3448 provides the following special forms:
3450 CONST c -- produces syntax version of constant c from context
3451 XCONST c -- literally c, checked as constant from context
3452 c -- literally c, if declared by 'syntax'
3454 Plain identifiers are treated as AST variables -- occasionally the
3455 system indicates accidental variables via the error "rhs contains
3458 Type classes and type constructors are marked according to their
3459 concrete syntax. Some old translations rules need to be written
3460 for the "type" category, using type constructor application
3461 instead of pseudo-term application of the default category
3464 - 'parse_translation' etc. in ML may use the following
3467 @{class_syntax c} -- type class c within parse tree / AST
3468 @{term_syntax c} -- type constructor c within parse tree / AST
3469 @{const_syntax c} -- ML version of "CONST c" above
3470 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
3472 - Literal types within 'typed_print_translations', i.e. those *not*
3473 represented as pseudo-terms are represented verbatim. Use @{class
3474 c} or @{type_name c} here instead of the above syntax
3477 Note that old non-authentic syntax was based on unqualified base
3478 names, so all of the above "constant" names would coincide. Recall
3479 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
3480 diagnose syntax problems.
3482 * Type constructors admit general mixfix syntax, not just infix.
3484 * Concrete syntax may be attached to local entities without a proof
3485 body, too. This works via regular mixfix annotations for 'fix',
3486 'def', 'obtain' etc. or via the explicit 'write' command, which is
3487 similar to the 'notation' command in theory specifications.
3489 * Discontinued unnamed infix syntax (legacy feature for many years) --
3490 need to specify constant name and syntax separately. Internal ML
3491 datatype constructors have been renamed from InfixName to Infix etc.
3492 Minor INCOMPATIBILITY.
3494 * Schematic theorem statements need to be explicitly markup as such,
3495 via commands 'schematic_lemma', 'schematic_theorem',
3496 'schematic_corollary'. Thus the relevance of the proof is made
3497 syntactically clear, which impacts performance in a parallel or
3498 asynchronous interactive environment. Minor INCOMPATIBILITY.
3500 * Use of cumulative prems via "!" in some proof methods has been
3501 discontinued (old legacy feature).
3503 * References 'trace_simp' and 'debug_simp' have been replaced by
3504 configuration options stored in the context. Enabling tracing (the
3505 case of debugging is similar) in proofs works via
3507 using [[trace_simp = true]]
3509 Tracing is then active for all invocations of the simplifier in
3510 subsequent goal refinement steps. Tracing may also still be enabled or
3511 disabled via the ProofGeneral settings menu.
3513 * Separate commands 'hide_class', 'hide_type', 'hide_const',
3514 'hide_fact' replace the former 'hide' KIND command. Minor
3517 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
3518 more efficient than combinations with -q1 or -q2.
3523 * Proofterms record type-class reasoning explicitly, using the
3524 "unconstrain" operation internally. This eliminates all sort
3525 constraints from a theorem and proof, introducing explicit
3526 OFCLASS-premises. On the proof term level, this operation is
3527 automatically applied at theorem boundaries, such that closed proofs
3528 are always free of sort constraints. INCOMPATIBILITY for tools that
3529 inspect proof terms.
3531 * Local theory specifications may depend on extra type variables that
3532 are not present in the result type -- arguments TYPE('a) :: 'a itself
3533 are added internally. For example:
3535 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
3537 * Predicates of locales introduced by classes carry a mandatory
3538 "class" prefix. INCOMPATIBILITY.
3540 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
3542 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
3545 * Command 'code_reflect' allows to incorporate generated ML code into
3546 runtime environment; replaces immature code_datatype antiquotation.
3549 * Code generator: simple concept for abstract datatypes obeying
3552 * Code generator: details of internal data cache have no impact on the
3553 user space functionality any longer.
3555 * Methods "unfold_locales" and "intro_locales" ignore non-locale
3556 subgoals. This is more appropriate for interpretations with 'where'.
3559 * Command 'example_proof' opens an empty proof body. This allows to
3560 experiment with Isar, without producing any persistent result.
3562 * Commands 'type_notation' and 'no_type_notation' declare type syntax
3563 within a local theory context, with explicit checking of the
3564 constructors involved (in contrast to the raw 'syntax' versions).
3566 * Commands 'types' and 'typedecl' now work within a local theory
3567 context -- without introducing dependencies on parameters or
3568 assumptions, which is not possible in Isabelle/Pure.
3570 * Command 'defaultsort' has been renamed to 'default_sort', it works
3571 within a local theory context. Minor INCOMPATIBILITY.
3576 * Command 'typedef' now works within a local theory context -- without
3577 introducing dependencies on parameters or assumptions, which is not
3578 possible in Isabelle/Pure/HOL. Note that the logical environment may
3579 contain multiple interpretations of local typedefs (with different
3580 non-emptiness proofs), even in a global theory context.
3582 * New package for quotient types. Commands 'quotient_type' and
3583 'quotient_definition' may be used for defining types and constants by
3584 quotient constructions. An example is the type of integers created by
3585 quotienting pairs of natural numbers:
3588 intrel :: "(nat * nat) => (nat * nat) => bool"
3590 "intrel (x, y) (u, v) = (x + v = u + y)"
3592 quotient_type int = "nat * nat" / intrel
3593 by (auto simp add: equivp_def expand_fun_eq)
3596 "0::int" is "(0::nat, 0::nat)"
3598 The method "lifting" can be used to lift of theorems from the
3599 underlying "raw" type to the quotient type. The example
3600 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
3601 construction and provides a reasoning infrastructure for finite sets.
3603 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
3604 clash with new theory Quotient in Main HOL.
3606 * Moved the SMT binding into the main HOL session, eliminating
3607 separate HOL-SMT session.
3609 * List membership infix mem operation is only an input abbreviation.
3612 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
3613 for future developements; former Library/Word.thy is still present in
3614 the AFP entry RSAPPS.
3616 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
3617 longer shadowed. INCOMPATIBILITY.
3619 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
3622 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
3625 * Dropped normalizing_semiring etc; use the facts in semiring classes
3626 instead. INCOMPATIBILITY.
3628 * Dropped several real-specific versions of lemmas about floor and
3629 ceiling; use the generic lemmas from theory "Archimedean_Field"
3630 instead. INCOMPATIBILITY.
3632 floor_number_of_eq ~> floor_number_of
3633 le_floor_eq_number_of ~> number_of_le_floor
3634 le_floor_eq_zero ~> zero_le_floor
3635 le_floor_eq_one ~> one_le_floor
3636 floor_less_eq_number_of ~> floor_less_number_of
3637 floor_less_eq_zero ~> floor_less_zero
3638 floor_less_eq_one ~> floor_less_one
3639 less_floor_eq_number_of ~> number_of_less_floor
3640 less_floor_eq_zero ~> zero_less_floor
3641 less_floor_eq_one ~> one_less_floor
3642 floor_le_eq_number_of ~> floor_le_number_of
3643 floor_le_eq_zero ~> floor_le_zero
3644 floor_le_eq_one ~> floor_le_one
3645 floor_subtract_number_of ~> floor_diff_number_of
3646 floor_subtract_one ~> floor_diff_one
3647 ceiling_number_of_eq ~> ceiling_number_of
3648 ceiling_le_eq_number_of ~> ceiling_le_number_of
3649 ceiling_le_zero_eq ~> ceiling_le_zero
3650 ceiling_le_eq_one ~> ceiling_le_one
3651 less_ceiling_eq_number_of ~> number_of_less_ceiling
3652 less_ceiling_eq_zero ~> zero_less_ceiling
3653 less_ceiling_eq_one ~> one_less_ceiling
3654 ceiling_less_eq_number_of ~> ceiling_less_number_of
3655 ceiling_less_eq_zero ~> ceiling_less_zero
3656 ceiling_less_eq_one ~> ceiling_less_one
3657 le_ceiling_eq_number_of ~> number_of_le_ceiling
3658 le_ceiling_eq_zero ~> zero_le_ceiling
3659 le_ceiling_eq_one ~> one_le_ceiling
3660 ceiling_subtract_number_of ~> ceiling_diff_number_of
3661 ceiling_subtract_one ~> ceiling_diff_one
3663 * Theory "Finite_Set": various folding_XXX locales facilitate the
3664 application of the various fold combinators on finite sets.
3666 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
3667 provides abstract red-black tree type which is backed by "RBT_Impl" as
3668 implementation. INCOMPATIBILTY.
3670 * Theory Library/Coinductive_List has been removed -- superseded by
3671 AFP/thys/Coinductive.
3673 * Theory PReal, including the type "preal" and related operations, has
3674 been removed. INCOMPATIBILITY.
3676 * Real: new development using Cauchy Sequences.
3678 * Split off theory "Big_Operators" containing setsum, setprod,
3679 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
3681 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
3682 "Int" etc. INCOMPATIBILITY.
3684 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
3686 * New set of rules "ac_simps" provides combined assoc / commute
3687 rewrites for all interpretations of the appropriate generic locales.
3689 * Renamed theory "OrderedGroup" to "Groups" and split theory
3690 "Ring_and_Field" into theories "Rings" and "Fields"; for more
3691 appropriate and more consistent names suitable for name prefixes
3692 within the HOL theories. INCOMPATIBILITY.
3694 * Some generic constants have been put to appropriate theories:
3695 - less_eq, less: Orderings
3696 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
3697 - inverse, divide: Rings
3700 * More consistent naming of type classes involving orderings (and
3703 lower_semilattice ~> semilattice_inf
3704 upper_semilattice ~> semilattice_sup
3706 dense_linear_order ~> dense_linorder
3708 pordered_ab_group_add ~> ordered_ab_group_add
3709 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
3710 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
3711 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
3712 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
3713 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
3714 pordered_cancel_semiring ~> ordered_cancel_semiring
3715 pordered_comm_monoid_add ~> ordered_comm_monoid_add
3716 pordered_comm_ring ~> ordered_comm_ring
3717 pordered_comm_semiring ~> ordered_comm_semiring
3718 pordered_ring ~> ordered_ring
3719 pordered_ring_abs ~> ordered_ring_abs
3720 pordered_semiring ~> ordered_semiring
3722 ordered_ab_group_add ~> linordered_ab_group_add
3723 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
3724 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
3725 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
3726 ordered_field ~> linordered_field
3727 ordered_field_no_lb ~> linordered_field_no_lb
3728 ordered_field_no_ub ~> linordered_field_no_ub
3729 ordered_field_dense_linear_order ~> dense_linordered_field
3730 ordered_idom ~> linordered_idom
3731 ordered_ring ~> linordered_ring
3732 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
3733 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
3734 ordered_ring_strict ~> linordered_ring_strict
3735 ordered_semidom ~> linordered_semidom
3736 ordered_semiring ~> linordered_semiring
3737 ordered_semiring_1 ~> linordered_semiring_1
3738 ordered_semiring_1_strict ~> linordered_semiring_1_strict
3739 ordered_semiring_strict ~> linordered_semiring_strict
3741 The following slightly odd type classes have been moved to a
3742 separate theory Library/Lattice_Algebras:
3744 lordered_ab_group_add ~> lattice_ab_group_add
3745 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
3746 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
3747 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
3748 lordered_ring ~> lattice_ring
3752 * Refined field classes:
3753 - classes division_ring_inverse_zero, field_inverse_zero,
3754 linordered_field_inverse_zero include rule inverse 0 = 0 --
3755 subsumes former division_by_zero class;
3756 - numerous lemmas have been ported from field to division_ring.
3759 * Refined algebra theorem collections:
3760 - dropped theorem group group_simps, use algebra_simps instead;
3761 - dropped theorem group ring_simps, use field_simps instead;
3762 - proper theorem collection field_simps subsumes former theorem
3763 groups field_eq_simps and field_simps;
3764 - dropped lemma eq_minus_self_iff which is a duplicate for
3768 * Theory Finite_Set and List: some lemmas have been generalized from
3771 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
3772 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
3773 inter_Inter_fold_inter ~> inf_Inf_fold_inf
3774 union_Union_fold_union ~> sup_Sup_fold_sup
3775 Inter_fold_inter ~> Inf_fold_inf
3776 Union_fold_union ~> Sup_fold_sup
3777 inter_INTER_fold_inter ~> inf_INFI_fold_inf
3778 union_UNION_fold_union ~> sup_SUPR_fold_sup
3779 INTER_fold_inter ~> INFI_fold_inf
3780 UNION_fold_union ~> SUPR_fold_sup
3782 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
3783 replaced by the more convenient lemmas Inf_empty and Sup_empty.
3784 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
3785 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
3786 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
3787 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
3789 * Reorganized theory Multiset: swapped notation of pointwise and
3792 - pointwise ordering is instance of class order with standard syntax
3794 - multiset ordering has syntax <=# and <#; partial order properties
3795 are provided by means of interpretation with prefix
3797 - less duplication, less historical organization of sections,
3798 conversion from associations lists to multisets, rudimentary code
3800 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
3805 multiset_eq_conv_count_eq ~> multiset_ext_iff
3806 multi_count_ext ~> multiset_ext
3807 diff_union_inverse2 ~> diff_union_cancelR
3811 * Theory Permutation: replaced local "remove" by List.remove1.
3813 * Code generation: ML and OCaml code is decorated with signatures.
3815 * Theory List: added transpose.
3817 * Library/Nat_Bijection.thy is a collection of bijective functions
3818 between nat and other types, which supersedes the older libraries
3819 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
3822 Nat_Int_Bij.nat2_to_nat ~> prod_encode
3823 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
3824 Nat_Int_Bij.int_to_nat_bij ~> int_encode
3825 Nat_Int_Bij.nat_to_int_bij ~> int_decode
3826 Countable.pair_encode ~> prod_encode
3827 NatIso.prod2nat ~> prod_encode
3828 NatIso.nat2prod ~> prod_decode
3829 NatIso.sum2nat ~> sum_encode
3830 NatIso.nat2sum ~> sum_decode
3831 NatIso.list2nat ~> list_encode
3832 NatIso.nat2list ~> list_decode
3833 NatIso.set2nat ~> set_encode
3834 NatIso.nat2set ~> set_decode
3837 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
3838 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
3839 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
3840 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
3841 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
3842 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
3843 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
3844 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
3845 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
3846 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
3847 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
3848 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
3849 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
3852 - Renamed ATP commands:
3853 atp_info ~> sledgehammer running_atps
3854 atp_kill ~> sledgehammer kill_atps
3855 atp_messages ~> sledgehammer messages
3856 atp_minimize ~> sledgehammer minimize
3857 print_atps ~> sledgehammer available_atps
3859 - Added user's manual ("isabelle doc sledgehammer").
3860 - Added option syntax and "sledgehammer_params" to customize
3861 Sledgehammer's behavior. See the manual for details.
3862 - Modified the Isar proof reconstruction code so that it produces
3863 direct proofs rather than proofs by contradiction. (This feature
3864 is still experimental.)
3865 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
3867 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
3870 - Added and implemented "binary_ints" and "bits" options.
3871 - Added "std" option and implemented support for nonstandard models.
3872 - Added and implemented "finitize" option to improve the precision
3873 of infinite datatypes based on a monotonicity analysis.
3874 - Added support for quotient types.
3875 - Added support for "specification" and "ax_specification"
3877 - Added support for local definitions (for "function" and
3878 "termination" proofs).
3879 - Added support for term postprocessors.
3880 - Optimized "Multiset.multiset" and "FinFun.finfun".
3881 - Improved efficiency of "destroy_constrs" optimization.
3882 - Fixed soundness bugs related to "destroy_constrs" optimization and
3884 - Fixed soundness bug related to higher-order constructors.
3885 - Fixed soundness bug when "full_descrs" is enabled.
3886 - Improved precision of set constructs.
3887 - Added "atoms" option.
3888 - Added cache to speed up repeated Kodkod invocations on the same
3890 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
3891 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
3892 "SAT4J_Light". INCOMPATIBILITY.
3893 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
3894 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
3895 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
3897 * Method "induct" now takes instantiations of the form t, where t is not
3898 a variable, as a shorthand for "x == t", where x is a fresh variable.
3899 If this is not intended, t has to be enclosed in parentheses.
3900 By default, the equalities generated by definitional instantiations
3901 are pre-simplified, which may cause parameters of inductive cases
3902 to disappear, or may even delete some of the inductive cases.
3903 Use "induct (no_simp)" instead of "induct" to restore the old
3904 behaviour. The (no_simp) option is also understood by the "cases"
3905 and "nominal_induct" methods, which now perform pre-simplification, too.
3911 * Variable names in lemmas generated by the domain package have
3912 changed; the naming scheme is now consistent with the HOL datatype
3913 package. Some proof scripts may be affected, INCOMPATIBILITY.
3915 * The domain package no longer defines the function "foo_copy" for
3916 recursive domain "foo". The reach lemma is now stated directly in
3917 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
3918 be reformulated in terms of "foo_take", INCOMPATIBILITY.
3920 * Most definedness lemmas generated by the domain package (previously
3921 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
3922 like "foo$x = UU <-> x = UU", which works better as a simp rule.
3923 Proofs that used definedness lemmas as intro rules may break,
3924 potential INCOMPATIBILITY.
3926 * Induction and casedist rules generated by the domain package now
3927 declare proper case_names (one called "bottom", and one named for each
3928 constructor). INCOMPATIBILITY.
3930 * For mutually-recursive domains, separate "reach" and "take_lemma"
3931 rules are generated for each domain, INCOMPATIBILITY.
3933 foo_bar.reach ~> foo.reach bar.reach
3934 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
3936 * Some lemmas generated by the domain package have been renamed for
3937 consistency with the datatype package, INCOMPATIBILITY.
3939 foo.ind ~> foo.induct
3940 foo.finite_ind ~> foo.finite_induct
3941 foo.coind ~> foo.coinduct
3942 foo.casedist ~> foo.exhaust
3943 foo.exhaust ~> foo.nchotomy
3945 * For consistency with other definition packages, the fixrec package
3946 now generates qualified theorem names, INCOMPATIBILITY.
3948 foo_simps ~> foo.simps
3949 foo_unfold ~> foo.unfold
3950 foo_induct ~> foo.induct
3952 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
3953 method and internal fixrec proofs now use the default simpset instead.
3956 * The "contlub" predicate has been removed. Proof scripts should use
3957 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
3959 * The "admw" predicate has been removed, INCOMPATIBILITY.
3961 * The constants cpair, cfst, and csnd have been removed in favor of
3962 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
3967 * Antiquotations for basic formal entities:
3969 @{class NAME} -- type class
3970 @{class_syntax NAME} -- syntax representation of the above
3972 @{type_name NAME} -- logical type
3973 @{type_abbrev NAME} -- type abbreviation
3974 @{nonterminal NAME} -- type of concrete syntactic category
3975 @{type_syntax NAME} -- syntax representation of any of the above
3977 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
3978 @{const_abbrev NAME} -- abbreviated constant
3979 @{const_syntax NAME} -- syntax representation of any of the above
3981 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
3982 syntax constant (cf. 'syntax' command).
3984 * Antiquotation @{make_string} inlines a function to print arbitrary
3985 values similar to the ML toplevel. The result is compiler dependent
3986 and may fall back on "?" in certain situations.
3988 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
3989 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
3990 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
3991 not work with the asynchronous Isar document model.
3993 * Configuration options now admit dynamic default values, depending on
3994 the context or even global references.
3996 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
3997 uses an efficient external library if available (for Poly/ML).
3999 * Renamed some important ML structures, while keeping the old names
4000 for some time as aliases within the structure Legacy:
4002 OuterKeyword ~> Keyword
4005 OuterSyntax ~> Outer_Syntax
4006 PrintMode ~> Print_Mode
4007 SpecParse ~> Parse_Spec
4010 ThyOutput ~> Thy_Output
4011 TypeInfer ~> Type_Infer
4013 Note that "open Legacy" simplifies porting of sources, but forgetting
4014 to remove it again will complicate porting again in the future.
4016 * Most operations that refer to a global context are named
4017 accordingly, e.g. Simplifier.global_context or
4018 ProofContext.init_global. There are some situations where a global
4019 context actually works, but under normal circumstances one needs to
4020 pass the proper local context through the code!
4022 * Discontinued old TheoryDataFun with its copy/init operation -- data
4023 needs to be pure. Functor Theory_Data_PP retains the traditional
4024 Pretty.pp argument to merge, which is absent in the standard
4025 Theory_Data version.
4027 * Sorts.certify_sort and derived "cert" operations for types and terms
4028 no longer minimize sorts. Thus certification at the boundary of the
4029 inference kernel becomes invariant under addition of class relations,
4030 which is an important monotonicity principle. Sorts are now minimized
4031 in the syntax layer only, at the boundary between the end-user and the
4032 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
4033 explicitly in rare situations.
4035 * Renamed old-style Drule.standard to Drule.export_without_context, to
4036 emphasize that this is in no way a standard operation.
4039 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
4040 usual for resolution. Rare INCOMPATIBILITY.
4042 * Renamed varify/unvarify operations to varify_global/unvarify_global
4043 to emphasize that these only work in a global situation (which is
4046 * Curried take and drop in library.ML; negative length is interpreted
4047 as infinity (as in chop). Subtle INCOMPATIBILITY.
4049 * Proof terms: type substitutions on proof constants now use canonical
4050 order of type variables. INCOMPATIBILITY for tools working with proof
4053 * Raw axioms/defs may no longer carry sort constraints, and raw defs
4054 may no longer carry premises. User-level specifications are
4055 transformed accordingly by Thm.add_axiom/add_def.
4060 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
4061 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
4062 proof terms are enabled unconditionally in the new HOL-Proofs image.
4064 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
4065 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
4068 * Old lib/scripts/polyml-platform is superseded by the
4069 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
4070 variant, even on a 64 bit machine. The following example setting
4071 prefers 64 bit if available:
4073 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
4075 * The preliminary Isabelle/jEdit application demonstrates the emerging
4076 Isabelle/Scala layer for advanced prover interaction and integration.
4077 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
4080 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
4081 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
4082 similar to the default assignment of the document preparation system
4083 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
4084 provides some operations for direct access to the font without asking
4085 the user for manual installation.
4089 New in Isabelle2009-1 (December 2009)
4090 -------------------------------------
4094 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
4095 one backslash should be used, even in ML sources.
4100 * Locale interpretation propagates mixins along the locale hierarchy.
4101 The currently only available mixins are the equations used to map
4102 local definitions to terms of the target domain of an interpretation.
4104 * Reactivated diagnostic command 'print_interps'. Use "print_interps
4105 loc" to print all interpretations of locale "loc" in the theory.
4106 Interpretations in proofs are not shown.
4108 * Thoroughly revised locales tutorial. New section on conditional
4111 * On instantiation of classes, remaining undefined class parameters
4112 are formally declared. INCOMPATIBILITY.
4115 *** Document preparation ***
4117 * New generalized style concept for printing terms: @{foo (style) ...}
4118 instead of @{foo_style style ...} (old form is still retained for
4119 backward compatibility). Styles can be also applied for
4120 antiquotations prop, term_type and typeof.
4125 * New proof method "smt" for a combination of first-order logic with
4126 equality, linear and nonlinear (natural/integer/real) arithmetic, and
4127 fixed-size bitvectors; there is also basic support for higher-order
4128 features (esp. lambda abstractions). It is an incomplete decision
4129 procedure based on external SMT solvers using the oracle mechanism;
4130 for the SMT solver Z3, this method is proof-producing. Certificates
4131 are provided to avoid calling the external solvers solely for
4132 re-checking proofs. Due to a remote SMT service there is no need for
4133 installing SMT solvers locally. See src/HOL/SMT.
4135 * New commands to load and prove verification conditions generated by
4136 the Boogie program verifier or derived systems (e.g. the Verifying C
4137 Compiler (VCC) or Spec#). See src/HOL/Boogie.
4139 * New counterexample generator tool 'nitpick' based on the Kodkod
4140 relational model finder. See src/HOL/Tools/Nitpick and
4141 src/HOL/Nitpick_Examples.
4143 * New commands 'code_pred' and 'values' to invoke the predicate
4144 compiler and to enumerate values of inductive predicates.
4146 * A tabled implementation of the reflexive transitive closure.
4148 * New implementation of quickcheck uses generic code generator;
4149 default generators are provided for all suitable HOL types, records
4150 and datatypes. Old quickcheck can be re-activated importing theory
4151 Library/SML_Quickcheck.
4153 * New testing tool Mirabelle for automated proof tools. Applies
4154 several tools and tactics like sledgehammer, metis, or quickcheck, to
4155 every proof step in a theory. To be used in batch mode via the
4156 "mirabelle" utility.
4158 * New proof method "sos" (sum of squares) for nonlinear real
4159 arithmetic (originally due to John Harison). It requires theory
4160 Library/Sum_Of_Squares. It is not a complete decision procedure but
4161 works well in practice on quantifier-free real arithmetic with +, -,
4162 *, ^, =, <= and <, i.e. boolean combinations of equalities and
4163 inequalities between polynomials. It makes use of external
4164 semidefinite programming solvers. Method "sos" generates a
4165 certificate that can be pasted into the proof thus avoiding the need
4166 to call an external tool every time the proof is checked. See
4167 src/HOL/Library/Sum_Of_Squares.
4169 * New method "linarith" invokes existing linear arithmetic decision
4172 * New command 'atp_minimal' reduces result produced by Sledgehammer.
4174 * New Sledgehammer option "Full Types" in Proof General settings menu.
4175 Causes full type information to be output to the ATPs. This slows
4176 ATPs down considerably but eliminates a source of unsound "proofs"
4179 * New method "metisFT": A version of metis that uses full type
4180 information in order to avoid failures of proof reconstruction.
4182 * New evaluator "approximate" approximates an real valued term using
4183 the same method as the approximation method.
4185 * Method "approximate" now supports arithmetic expressions as
4186 boundaries of intervals and implements interval splitting and Taylor
4189 * ML antiquotation @{code_datatype} inserts definition of a datatype
4190 generated by the code generator; e.g. see src/HOL/Predicate.thy.
4192 * New theory SupInf of the supremum and infimum operators for sets of
4195 * New theory Probability, which contains a development of measure
4196 theory, eventually leading to Lebesgue integration and probability.
4198 * Extended Multivariate Analysis to include derivation and Brouwer's
4201 * Reorganization of number theory, INCOMPATIBILITY:
4202 - new number theory development for nat and int, in theories Divides
4203 and GCD as well as in new session Number_Theory
4204 - some constants and facts now suffixed with _nat and _int
4206 - former session NumberTheory now named Old_Number_Theory, including
4207 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
4208 - moved theory Pocklington from src/HOL/Library to
4209 src/HOL/Old_Number_Theory
4211 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
4212 lcm of finite and infinite sets. It is shown that they form a complete
4215 * Class semiring_div requires superclass no_zero_divisors and proof of
4216 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
4217 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
4218 generalized to class semiring_div, subsuming former theorems
4219 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
4220 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
4223 * Refinements to lattice classes and sets:
4224 - less default intro/elim rules in locale variant, more default
4225 intro/elim rules in class variant: more uniformity
4226 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
4228 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
4230 - renamed ACI to inf_sup_aci
4231 - new class "boolean_algebra"
4232 - class "complete_lattice" moved to separate theory
4233 "Complete_Lattice"; corresponding constants (and abbreviations)
4234 renamed and with authentic syntax:
4235 Set.Inf ~> Complete_Lattice.Inf
4236 Set.Sup ~> Complete_Lattice.Sup
4237 Set.INFI ~> Complete_Lattice.INFI
4238 Set.SUPR ~> Complete_Lattice.SUPR
4239 Set.Inter ~> Complete_Lattice.Inter
4240 Set.Union ~> Complete_Lattice.Union
4241 Set.INTER ~> Complete_Lattice.INTER
4242 Set.UNION ~> Complete_Lattice.UNION
4243 - authentic syntax for
4246 - mere abbreviations:
4249 Set.inter (for inf, formerly Set.Int)
4250 Set.union (for sup, formerly Set.Un)
4251 Complete_Lattice.Inter (for Inf)
4252 Complete_Lattice.Union (for Sup)
4253 Complete_Lattice.INTER (for INFI)
4254 Complete_Lattice.UNION (for SUPR)
4255 - object-logic definitions as far as appropriate
4257 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
4258 Un_subset_iff are explicitly deleted as default simp rules; then also
4259 their lattice counterparts le_inf_iff and le_sup_iff have to be
4260 deleted to achieve the desired effect.
4262 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
4263 rules by default any longer; the same applies to min_max.inf_absorb1
4264 etc. INCOMPATIBILITY.
4266 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
4267 pred_set_conv by default. INCOMPATIBILITY.
4269 * Power operations on relations and functions are now one dedicated
4270 constant "compow" with infix syntax "^^". Power operation on
4271 multiplicative monoids retains syntax "^" and is now defined generic
4272 in class power. INCOMPATIBILITY.
4274 * Relation composition "R O S" now has a more standard argument order:
4275 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
4276 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
4277 break, since the O_assoc rule was not rewritten like this. Fix using
4278 O_assoc[symmetric]. The same applies to the curried version "R OO S".
4280 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
4281 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
4284 * Most rules produced by inductive and datatype package have mandatory
4285 prefixes. INCOMPATIBILITY.
4287 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
4288 the attribute of the same name. Each of the theorems in the list
4289 DERIV_intros assumes composition with an additional function and
4290 matches a variable to the derivative, which has to be solved by the
4291 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
4292 of most elementary terms. Former Maclauren.DERIV_tac and
4293 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
4296 * Code generator attributes follow the usual underscore convention:
4297 code_unfold replaces code unfold
4298 code_post replaces code post
4303 sizechange -> size_change
4304 induct_scheme -> induction_schema
4307 * Discontinued abbreviation "arbitrary" of constant "undefined".
4308 INCOMPATIBILITY, use "undefined" directly.
4311 Suc_eq_add_numeral_1 -> Suc_eq_plus1
4312 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
4313 Suc_plus1 -> Suc_eq_plus1
4314 *anti_sym -> *antisym*
4315 vector_less_eq_def -> vector_le_def
4318 * Added theorem List.map_map as [simp]. Removed List.map_compose.
4321 * Removed predicate "M hassize n" (<--> card M = n & finite M).
4327 * Theory Representable defines a class "rep" of domains that are
4328 representable (via an ep-pair) in the universal domain type "udom".
4329 Instances are provided for all type constructors defined in HOLCF.
4331 * The 'new_domain' command is a purely definitional version of the
4332 domain package, for representable domains. Syntax is identical to the
4333 old domain package. The 'new_domain' package also supports indirect
4334 recursion using previously-defined type constructors. See
4335 src/HOLCF/ex/New_Domain.thy for examples.
4337 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
4338 on the left-hand side of an equation, and then performs
4339 simplification. Rewriting is done using rules declared with the
4340 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
4341 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
4343 * The pattern-match compiler in 'fixrec' can now handle constructors
4344 with HOL function types. Pattern-match combinators for the Pair
4345 constructor are pre-configured.
4347 * The 'fixrec' package now produces better fixed-point induction rules
4348 for mutually-recursive definitions: Induction rules have conclusions
4349 of the form "P foo bar" instead of "P <foo, bar>".
4351 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
4352 been renamed to "below". The name "below" now replaces "less" in many
4353 theorem names. (Legacy theorem names using "less" are still supported
4356 * The 'fixrec' package now supports "bottom patterns". Bottom
4357 patterns can be used to generate strictness rules, or to make
4358 functions more strict (much like the bang-patterns supported by the
4359 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
4365 * Support for Poly/ML 5.3.0, with improved reporting of compiler
4366 errors and run-time exceptions, including detailed source positions.
4368 * Structure Name_Space (formerly NameSpace) now manages uniquely
4369 identified entries, with some additional information such as source
4370 position, logical grouping etc.
4372 * Theory and context data is now introduced by the simplified and
4373 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
4374 to be pure, but the old TheoryDataFun for mutable data (with explicit
4375 copy operation) is still available for some time.
4377 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
4378 provides a high-level programming interface to synchronized state
4379 variables with atomic update. This works via pure function
4380 application within a critical section -- its runtime should be as
4381 short as possible; beware of deadlocks if critical code is nested,
4382 either directly or indirectly via other synchronized variables!
4384 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
4385 wraps raw ML references, explicitly indicating their non-thread-safe
4386 behaviour. The Isar toplevel keeps this structure open, to
4387 accommodate Proof General as well as quick and dirty interactive
4388 experiments with references.
4390 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
4391 parallel tactical reasoning.
4393 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
4394 are similar to SUBPROOF, but are slightly more flexible: only the
4395 specified parts of the subgoal are imported into the context, and the
4396 body tactic may introduce new subgoals and schematic variables.
4398 * Old tactical METAHYPS, which does not observe the proof context, has
4399 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
4400 or Subgoal.FOCUS etc.
4402 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
4403 functors have their own ML name space there is no point to mark them
4404 separately.) Minor INCOMPATIBILITY.
4406 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
4408 * Renamed several structures FooBar to Foo_Bar. Occasional,
4411 * Operations of structure Skip_Proof no longer require quick_and_dirty
4412 mode, which avoids critical setmp.
4414 * Eliminated old Attrib.add_attributes, Method.add_methods and related
4415 combinators for "args". INCOMPATIBILITY, need to use simplified
4416 Attrib/Method.setup introduced in Isabelle2009.
4418 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
4419 back on global_simpset_of, global_claset_of, global_clasimpset_of as
4420 last resort. INCOMPATIBILITY.
4422 * Display.pretty_thm now requires a proper context (cf. former
4423 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
4424 or even Display.pretty_thm_without_context as last resort.
4427 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
4428 Syntax.pretty_typ/term directly, preferably with proper context
4429 instead of global theory.
4434 * Further fine tuning of parallel proof checking, scales up to 8 cores
4435 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
4438 * Support for additional "Isabelle components" via etc/components, see
4439 also the system manual.
4441 * The isabelle makeall tool now operates on all components with
4442 IsaMakefile, not just hardwired "logics".
4444 * Removed "compress" option from isabelle-process and isabelle usedir;
4445 this is always enabled.
4447 * Discontinued support for Poly/ML 4.x versions.
4449 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
4450 on a given logic image. This requires the lighttpd webserver and is
4451 currently supported on Linux only.
4455 New in Isabelle2009 (April 2009)
4456 --------------------------------
4460 * Simplified main Isabelle executables, with less surprises on
4461 case-insensitive file-systems (such as Mac OS).
4463 - The main Isabelle tool wrapper is now called "isabelle" instead of
4466 - The former "isabelle" alias for "isabelle-process" has been
4467 removed (should rarely occur to regular users).
4469 - The former "isabelle-interface" and its alias "Isabelle" have been
4470 removed (interfaces are now regular Isabelle tools).
4472 Within scripts and make files, the Isabelle environment variables
4473 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
4474 respectively. (The latter are still available as legacy feature.)
4476 The old isabelle-interface wrapper could react in confusing ways if
4477 the interface was uninstalled or changed otherwise. Individual
4478 interface tool configuration is now more explicit, see also the
4479 Isabelle system manual. In particular, Proof General is now available
4480 via "isabelle emacs".
4482 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
4483 purge installed copies of Isabelle executables and re-run "isabelle
4484 install -p ...", or use symlinks.
4486 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
4487 old ~/isabelle, which was slightly non-standard and apt to cause
4488 surprises on case-insensitive file-systems (such as Mac OS).
4490 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
4491 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
4492 care is required when using older releases of Isabelle. Note that
4493 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
4494 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
4496 * Proofs of fully specified statements are run in parallel on
4497 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
4498 a regular 4-core machine, if the initial heap space is made reasonably
4499 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
4501 * The main reference manuals ("isar-ref", "implementation", and
4502 "system") have been updated and extended. Formally checked references
4503 as hyperlinks are now available uniformly.
4508 * Complete re-implementation of locales. INCOMPATIBILITY in several
4509 respects. The most important changes are listed below. See the
4510 Tutorial on Locales ("locales" manual) for details.
4512 - In locale expressions, instantiation replaces renaming. Parameters
4513 must be declared in a for clause. To aid compatibility with previous
4514 parameter inheritance, in locale declarations, parameters that are not
4515 'touched' (instantiation position "_" or omitted) are implicitly added
4516 with their syntax at the beginning of the for clause.
4518 - Syntax from abbreviations and definitions in locales is available in
4519 locale expressions and context elements. The latter is particularly
4520 useful in locale declarations.
4522 - More flexible mechanisms to qualify names generated by locale
4523 expressions. Qualifiers (prefixes) may be specified in locale
4524 expressions, and can be marked as mandatory (syntax: "name!:") or
4525 optional (syntax "name?:"). The default depends for plain "name:"
4526 depends on the situation where a locale expression is used: in
4527 commands 'locale' and 'sublocale' prefixes are optional, in
4528 'interpretation' and 'interpret' prefixes are mandatory. The old
4529 implicit qualifiers derived from the parameter names of a locale are
4530 no longer generated.
4532 - Command "sublocale l < e" replaces "interpretation l < e". The
4533 instantiation clause in "interpretation" and "interpret" (square
4534 brackets) is no longer available. Use locale expressions.
4536 - When converting proof scripts, mandatory qualifiers in
4537 'interpretation' and 'interpret' should be retained by default, even
4538 if this is an INCOMPATIBILITY compared to former behavior. In the
4539 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
4540 in locale expressions range over a single locale instance only.
4542 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
4543 In existing theorem specifications replace the includes element by the
4544 respective context elements of the included locale, omitting those
4545 that are already present in the theorem specification. Multiple
4546 assume elements of a locale should be replaced by a single one
4547 involving the locale predicate. In the proof body, declarations (most
4548 notably theorems) may be regained by interpreting the respective
4549 locales in the proof context as required (command "interpret").
4551 If using "includes" in replacement of a target solely because the
4552 parameter types in the theorem are not as general as in the target,
4553 consider declaring a new locale with additional type constraints on
4554 the parameters (context element "constrains").
4556 - Discontinued "locale (open)". INCOMPATIBILITY.
4558 - Locale interpretation commands no longer attempt to simplify goal.
4559 INCOMPATIBILITY: in rare situations the generated goal differs. Use
4560 methods intro_locales and unfold_locales to clarify.
4562 - Locale interpretation commands no longer accept interpretation
4563 attributes. INCOMPATIBILITY.
4565 * Class declaration: so-called "base sort" must not be given in import
4566 list any longer, but is inferred from the specification. Particularly
4573 class foo = type + ...
4575 * Class target: global versions of theorems stemming do not carry a
4576 parameter prefix any longer. INCOMPATIBILITY.
4578 * Class 'instance' command no longer accepts attached definitions.
4579 INCOMPATIBILITY, use proper 'instantiation' target instead.
4581 * Recovered hiding of consts, which was accidentally broken in
4582 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
4583 makes c inaccessible; consider using ``hide (open) const c'' instead.
4585 * Slightly more coherent Pure syntax, with updated documentation in
4586 isar-ref manual. Removed locales meta_term_syntax and
4587 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
4588 INCOMPATIBILITY in rare situations. Note that &&& should not be used
4589 directly in regular applications.
4591 * There is a new syntactic category "float_const" for signed decimal
4592 fractions (e.g. 123.45 or -123.45).
4594 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
4595 interface with 'setup' command instead.
4597 * Command 'local_setup' is similar to 'setup', but operates on a local
4600 * The 'axiomatization' command now only works within a global theory
4601 context. INCOMPATIBILITY.
4603 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
4604 hypotheses. Sorts required in the course of reasoning need to be
4605 covered by the constraints in the initial statement, completed by the
4606 type instance information of the background theory. Non-trivial sort
4607 hypotheses, which rarely occur in practice, may be specified via
4608 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
4610 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
4612 The result contains an implicit sort hypotheses as before --
4613 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
4616 * Generalized Isar history, with support for linear undo, direct state
4619 * Changed defaults for unify configuration options:
4621 unify_trace_bound = 50 (formerly 25)
4622 unify_search_bound = 60 (formerly 30)
4624 * Different bookkeeping for code equations (INCOMPATIBILITY):
4626 a) On theory merge, the last set of code equations for a particular
4627 constant is taken (in accordance with the policy applied by other
4628 parts of the code generator framework).
4630 b) Code equations stemming from explicit declarations (e.g. code
4631 attribute) gain priority over default code equations stemming
4632 from definition, primrec, fun etc.
4634 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
4636 * Unified theorem tables for both code generators. Thus [code
4637 func] has disappeared and only [code] remains. INCOMPATIBILITY.
4639 * Command 'find_consts' searches for constants based on type and name
4642 find_consts "_ => bool"
4644 By default, matching is against subtypes, but it may be restricted to
4645 the whole type. Searching by name is possible. Multiple queries are
4646 conjunctive and queries may be negated by prefixing them with a
4649 find_consts strict: "_ => bool" name: "Int" -"int => int"
4651 * New 'find_theorems' criterion "solves" matches theorems that
4652 directly solve the current goal (modulo higher-order unification).
4654 * Auto solve feature for main theorem statements: whenever a new goal
4655 is stated, "find_theorems solves" is called; any theorems that could
4656 solve the lemma directly are listed as part of the goal state.
4657 Cf. associated options in Proof General Isabelle settings menu,
4658 enabled by default, with reasonable timeout for pathological cases of
4659 higher-order unification.
4662 *** Document preparation ***
4664 * Antiquotation @{lemma} now imitates a regular terminal proof,
4665 demanding keyword 'by' and supporting the full method expression
4666 syntax just like the Isar command 'by'.
4671 * Integrated main parts of former image HOL-Complex with HOL. Entry
4672 points Main and Complex_Main remain as before.
4674 * Logic image HOL-Plain provides a minimal HOL with the most important
4675 tools available (inductive, datatype, primrec, ...). This facilitates
4676 experimentation and tool development. Note that user applications
4677 (and library theories) should never refer to anything below theory
4680 * Logic image HOL-Main stops at theory Main, and thus facilitates
4681 experimentation due to shorter build times.
4683 * Logic image HOL-NSA contains theories of nonstandard analysis which
4684 were previously part of former HOL-Complex. Entry point Hyperreal
4685 remains valid, but theories formerly using Complex_Main should now use
4686 new entry point Hypercomplex.
4688 * Generic ATP manager for Sledgehammer, based on ML threads instead of
4689 Posix processes. Avoids potentially expensive forking of the ML
4690 process. New thread-based implementation also works on non-Unix
4691 platforms (Cygwin). Provers are no longer hardwired, but defined
4692 within the theory via plain ML wrapper functions. Basic Sledgehammer
4693 commands are covered in the isar-ref manual.
4695 * Wrapper scripts for remote SystemOnTPTP service allows to use
4696 sledgehammer without local ATP installation (Vampire etc.). Other
4697 provers may be included via suitable ML wrappers, see also
4698 src/HOL/ATP_Linkup.thy.
4700 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
4703 * The metis method no longer fails because the theorem is too trivial
4704 (contains the empty clause).
4706 * The metis method now fails in the usual manner, rather than raising
4707 an exception, if it determines that it cannot prove the theorem.
4709 * Method "coherent" implements a prover for coherent logic (see also
4710 src/Tools/coherent.ML).
4712 * Constants "undefined" and "default" replace "arbitrary". Usually
4713 "undefined" is the right choice to replace "arbitrary", though
4714 logically there is no difference. INCOMPATIBILITY.
4716 * Command "value" now integrates different evaluation mechanisms. The
4717 result of the first successful evaluation mechanism is printed. In
4718 square brackets a particular named evaluation mechanisms may be
4719 specified (currently, [SML], [code] or [nbe]). See further
4720 src/HOL/ex/Eval_Examples.thy.
4722 * Normalization by evaluation now allows non-leftlinear equations.
4723 Declare with attribute [code nbe].
4725 * Methods "case_tac" and "induct_tac" now refer to the very same rules
4726 as the structured Isar versions "cases" and "induct", cf. the
4727 corresponding "cases" and "induct" attributes. Mutual induction rules
4728 are now presented as a list of individual projections
4729 (e.g. foo_bar.inducts for types foo and bar); the old format with
4730 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
4731 rare situations a different rule is selected --- notably nested tuple
4732 elimination instead of former prod.exhaust: use explicit (case_tac t
4733 rule: prod.exhaust) here.
4735 * Attributes "cases", "induct", "coinduct" support "del" option.
4737 * Removed fact "case_split_thm", which duplicates "case_split".
4739 * The option datatype has been moved to a new theory Option. Renamed
4740 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
4742 * New predicate "strict_mono" classifies strict functions on partial
4743 orders. With strict functions on linear orders, reasoning about
4744 (in)equalities is facilitated by theorems "strict_mono_eq",
4745 "strict_mono_less_eq" and "strict_mono_less".
4747 * Some set operations are now proper qualified constants with
4748 authentic syntax. INCOMPATIBILITY:
4759 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
4762 * Auxiliary class "itself" has disappeared -- classes without any
4763 parameter are treated as expected by the 'class' command.
4765 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
4767 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
4768 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
4770 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
4771 method "approximation". It proves formulas on real values by using
4772 interval arithmetic. In the formulas are also the transcendental
4773 functions sin, cos, tan, atan, ln, exp and the constant pi are
4774 allowed. For examples see
4775 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
4777 * Theory "Reflection" now resides in HOL/Library.
4779 * Entry point to Word library now simply named "Word".
4782 * Made source layout more coherent with logical distribution
4785 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
4786 src/HOL/Library/Code_Message.thy ~> src/HOL/
4787 src/HOL/Library/GCD.thy ~> src/HOL/
4788 src/HOL/Library/Order_Relation.thy ~> src/HOL/
4789 src/HOL/Library/Parity.thy ~> src/HOL/
4790 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
4791 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
4792 src/HOL/Real/Lubs.thy ~> src/HOL/
4793 src/HOL/Real/PReal.thy ~> src/HOL/
4794 src/HOL/Real/Rational.thy ~> src/HOL/
4795 src/HOL/Real/RComplete.thy ~> src/HOL/
4796 src/HOL/Real/RealDef.thy ~> src/HOL/
4797 src/HOL/Real/RealPow.thy ~> src/HOL/
4798 src/HOL/Real/Real.thy ~> src/HOL/
4799 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
4800 src/HOL/Complex/Complex.thy ~> src/HOL/
4801 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
4802 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
4803 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
4804 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
4805 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
4806 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
4807 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
4808 src/HOL/Hyperreal/Log.thy ~> src/HOL/
4809 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
4810 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
4811 src/HOL/Hyperreal/Series.thy ~> src/HOL/
4812 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
4813 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
4814 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
4815 src/HOL/Real/Float ~> src/HOL/Library/
4816 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
4817 src/HOL/Real/RealVector.thy ~> src/HOL/
4819 src/HOL/arith_data.ML ~> src/HOL/Tools
4820 src/HOL/hologic.ML ~> src/HOL/Tools
4821 src/HOL/simpdata.ML ~> src/HOL/Tools
4822 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
4823 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
4824 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
4825 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
4826 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
4827 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
4828 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
4830 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
4831 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
4832 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
4833 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
4834 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
4835 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
4837 * If methods "eval" and "evaluation" encounter a structured proof
4838 state with !!/==>, only the conclusion is evaluated to True (if
4839 possible), avoiding strange error messages.
4841 * Method "sizechange" automates termination proofs using (a
4842 modification of) the size-change principle. Requires SAT solver. See
4843 src/HOL/ex/Termination.thy for examples.
4845 * Simplifier: simproc for let expressions now unfolds if bound
4846 variable occurs at most once in let expression body. INCOMPATIBILITY.
4848 * Method "arith": Linear arithmetic now ignores all inequalities when
4849 fast_arith_neq_limit is exceeded, instead of giving up entirely.
4851 * New attribute "arith" for facts that should always be used
4852 automatically by arithmetic. It is intended to be used locally in
4855 assumes [arith]: "x > 0"
4857 Global usage is discouraged because of possible performance impact.
4859 * New classes "top" and "bot" with corresponding operations "top" and
4860 "bot" in theory Orderings; instantiation of class "complete_lattice"
4861 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
4863 * Changed definition lemma "less_fun_def" in order to provide an
4864 instance for preorders on functions; use lemma "less_le" instead.
4867 * Theory Orderings: class "wellorder" moved here, with explicit
4868 induction rule "less_induct" as assumption. For instantiation of
4869 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
4872 * Theory Orderings: added class "preorder" as superclass of "order".
4873 INCOMPATIBILITY: Instantiation proofs for order, linorder
4874 etc. slightly changed. Some theorems named order_class.* now named
4877 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
4880 * Theory Finite_Set: added a new fold combinator of type
4882 ('a => 'b => 'b) => 'b => 'a set => 'b
4884 Occasionally this is more convenient than the old fold combinator
4885 which is now defined in terms of the new one and renamed to
4888 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
4889 and "ring_simps" have been replaced by "algebra_simps" (which can be
4890 extended with further lemmas!). At the moment both still exist but
4891 the former will disappear at some point.
4893 * Theory Power: Lemma power_Suc is now declared as a simp rule in
4894 class recpower. Type-specific simp rules for various recpower types
4895 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
4897 rat_power_0 -> power_0
4898 rat_power_Suc -> power_Suc
4899 realpow_0 -> power_0
4900 realpow_Suc -> power_Suc
4901 complexpow_0 -> power_0
4902 complexpow_Suc -> power_Suc
4903 power_poly_0 -> power_0
4904 power_poly_Suc -> power_Suc
4906 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
4907 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
4908 dvd has been generalized to class comm_semiring_1. Likewise a bunch
4909 of lemmas from Divides has been generalized from nat to class
4910 semiring_div. INCOMPATIBILITY. This involves the following theorem
4911 renames resulting from duplicate elimination:
4913 dvd_def_mod ~> dvd_eq_mod_eq_0
4914 zero_dvd_iff ~> dvd_0_left_iff
4915 dvd_0 ~> dvd_0_right
4916 DIVISION_BY_ZERO_DIV ~> div_by_0
4917 DIVISION_BY_ZERO_MOD ~> mod_by_0
4918 mult_div ~> div_mult_self2_is_id
4919 mult_mod ~> mod_mult_self2_is_0
4921 * Theory IntDiv: removed many lemmas that are instances of class-based
4922 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
4923 rename old lemmas as follows:
4925 dvd_diff -> nat_dvd_diff
4926 dvd_zminus_iff -> dvd_minus_iff
4927 mod_add1_eq -> mod_add_eq
4928 mod_mult1_eq -> mod_mult_right_eq
4929 mod_mult1_eq' -> mod_mult_left_eq
4930 mod_mult_distrib_mod -> mod_mult_eq
4931 nat_mod_add_left_eq -> mod_add_left_eq
4932 nat_mod_add_right_eq -> mod_add_right_eq
4933 nat_mod_div_trivial -> mod_div_trivial
4934 nat_mod_mod_trivial -> mod_mod_trivial
4935 zdiv_zadd_self1 -> div_add_self1
4936 zdiv_zadd_self2 -> div_add_self2
4937 zdiv_zmult_self1 -> div_mult_self2_is_id
4938 zdiv_zmult_self2 -> div_mult_self1_is_id
4939 zdvd_triv_left -> dvd_triv_left
4940 zdvd_triv_right -> dvd_triv_right
4941 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
4942 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
4943 zmod_zadd_left_eq -> mod_add_left_eq
4944 zmod_zadd_right_eq -> mod_add_right_eq
4945 zmod_zadd_self1 -> mod_add_self1
4946 zmod_zadd_self2 -> mod_add_self2
4947 zmod_zadd1_eq -> mod_add_eq
4948 zmod_zdiff1_eq -> mod_diff_eq
4949 zmod_zdvd_zmod -> mod_mod_cancel
4950 zmod_zmod_cancel -> mod_mod_cancel
4951 zmod_zmult_self1 -> mod_mult_self2_is_0
4952 zmod_zmult_self2 -> mod_mult_self1_is_0
4955 zdvd_abs1 -> abs_dvd_iff
4956 zdvd_abs2 -> dvd_abs_iff
4957 zdvd_refl -> dvd_refl
4958 zdvd_trans -> dvd_trans
4959 zdvd_zadd -> dvd_add
4960 zdvd_zdiff -> dvd_diff
4961 zdvd_zminus_iff -> dvd_minus_iff
4962 zdvd_zminus2_iff -> minus_dvd_iff
4963 zdvd_zmultD -> dvd_mult_right
4964 zdvd_zmultD2 -> dvd_mult_left
4965 zdvd_zmult_mono -> mult_dvd_mono
4966 zdvd_0_right -> dvd_0_right
4967 zdvd_0_left -> dvd_0_left_iff
4968 zdvd_1_left -> one_dvd
4969 zminus_dvd_iff -> minus_dvd_iff
4971 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
4973 * The real numbers offer decimal input syntax: 12.34 is translated
4974 into 1234/10^2. This translation is not reversed upon output.
4976 * Theory Library/Polynomial defines an abstract type 'a poly of
4977 univariate polynomials with coefficients of type 'a. In addition to
4978 the standard ring operations, it also supports div and mod. Code
4979 generation is also supported, using list-style constructors.
4981 * Theory Library/Inner_Product defines a class of real_inner for real
4982 inner product spaces, with an overloaded operation inner :: 'a => 'a
4983 => real. Class real_inner is a subclass of real_normed_vector from
4986 * Theory Library/Product_Vector provides instances for the product
4987 type 'a * 'b of several classes from RealVector and Inner_Product.
4988 Definitions of addition, subtraction, scalar multiplication, norms,
4989 and inner products are included.
4991 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
4992 addition to the field operations, numerals and case syntax are also
4995 * Theory Library/Diagonalize provides constructive version of Cantor's
4996 first diagonalization argument.
4998 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
4999 zlcm (for int); carried together from various gcd/lcm developements in
5000 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
5001 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
5002 may recover tupled syntax as follows:
5004 hide (open) const gcd
5005 abbreviation gcd where
5006 "gcd == (%(a, b). GCD.gcd a b)"
5008 GCD.gcd ("gcd '(_, _')")
5010 The same works for lcm, zgcd, zlcm.
5012 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
5013 instantiations for algebraic structures. Removed some duplicate
5014 theorems. Changes in simp rules. INCOMPATIBILITY.
5016 * ML antiquotation @{code} takes a constant as argument and generates
5017 corresponding code in background and inserts name of the corresponding
5018 resulting ML value/function/datatype constructor binding in place.
5019 All occurrences of @{code} with a single ML block are generated
5020 simultaneously. Provides a generic and safe interface for
5021 instrumentalizing code generation. See
5022 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
5023 In future you ought to refrain from ad-hoc compiling generated SML
5024 code on the ML toplevel. Note that (for technical reasons) @{code}
5025 cannot refer to constants for which user-defined serializations are
5026 set. Refer to the corresponding ML counterpart directly in that
5029 * Command 'rep_datatype': instead of theorem names the command now
5030 takes a list of terms denoting the constructors of the type to be
5031 represented as datatype. The characteristic theorems have to be
5032 proven. INCOMPATIBILITY. Also observe that the following theorems
5033 have disappeared in favour of existing ones:
5035 unit_induct ~> unit.induct
5036 prod_induct ~> prod.induct
5037 sum_induct ~> sum.induct
5038 Suc_Suc_eq ~> nat.inject
5039 Suc_not_Zero Zero_not_Suc ~> nat.distinct
5044 * New locales for orders and lattices where the equivalence relation
5045 is not restricted to equality. INCOMPATIBILITY: all order and lattice
5046 locales use a record structure with field eq for the equivalence.
5048 * New theory of factorial domains.
5050 * Units_l_inv and Units_r_inv are now simp rules by default.
5051 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
5052 and/or r_inv will now also require deletion of these lemmas.
5054 * Renamed the following theorems, INCOMPATIBILITY:
5056 UpperD ~> Upper_memD
5057 LowerD ~> Lower_memD
5058 least_carrier ~> least_closed
5059 greatest_carrier ~> greatest_closed
5060 greatest_Lower_above ~> greatest_Lower_below
5061 one_zero ~> carrier_one_zero
5062 one_not_zero ~> carrier_one_not_zero (collision with assumption)
5067 * Nominal datatypes can now contain type-variables.
5069 * Commands 'nominal_inductive' and 'equivariance' work with local
5072 * Nominal primrec can now works with local theory targets and its
5073 specification syntax now conforms to the general format as seen in
5076 * Method "perm_simp" honours the standard simplifier attributes
5077 (no_asm), (no_asm_use) etc.
5079 * The new predicate #* is defined like freshness, except that on the
5080 left hand side can be a set or list of atoms.
5082 * Experimental command 'nominal_inductive2' derives strong induction
5083 principles for inductive definitions. In contrast to
5084 'nominal_inductive', which can only deal with a fixed number of
5085 binders, it can deal with arbitrary expressions standing for sets of
5086 atoms to be avoided. The only inductive definition we have at the
5087 moment that needs this generalisation is the typing rule for Lets in
5090 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
5091 -----------------------------------------------------------------
5092 Gamma |- Let x be t1 in t2 : T2
5094 In this rule one wants to avoid all the binders that are introduced by
5095 "close Gamma T1". We are looking for other examples where this
5096 feature might be useful. Please let us know.
5101 * Reimplemented the simplification procedure for proving continuity
5102 subgoals. The new simproc is extensible; users can declare additional
5103 continuity introduction rules with the attribute [cont2cont].
5105 * The continuity simproc now uses a different introduction rule for
5106 solving continuity subgoals on terms with lambda abstractions. In
5107 some rare cases the new simproc may fail to solve subgoals that the
5108 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
5109 Potential INCOMPATIBILITY.
5111 * Command 'fixrec': specification syntax now conforms to the general
5112 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
5113 examples. INCOMPATIBILITY.
5118 * Proof of Zorn's Lemma for partial orders.
5123 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
5124 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
5125 depends on multithreading, so timouts will not work before Poly/ML
5128 * High-level support for concurrent ML programming, see
5129 src/Pure/Cuncurrent. The data-oriented model of "future values" is
5130 particularly convenient to organize independent functional
5131 computations. The concept of "synchronized variables" provides a
5132 higher-order interface for components with shared state, avoiding the
5133 delicate details of mutexes and condition variables. (Requires
5134 Poly/ML 5.2.1 or later.)
5136 * ML bindings produced via Isar commands are stored within the Isar
5137 context (theory or proof). Consequently, commands like 'use' and 'ML'
5138 become thread-safe and work with undo as expected (concerning
5139 top-level bindings, not side-effects on global references).
5140 INCOMPATIBILITY, need to provide proper Isar context when invoking the
5141 compiler at runtime; really global bindings need to be given outside a
5142 theory. (Requires Poly/ML 5.2 or later.)
5144 * Command 'ML_prf' is analogous to 'ML' but works within a proof
5145 context. Top-level ML bindings are stored within the proof context in
5146 a purely sequential fashion, disregarding the nested proof structure.
5147 ML bindings introduced by 'ML_prf' are discarded at the end of the
5148 proof. (Requires Poly/ML 5.2 or later.)
5150 * Simplified ML attribute and method setup, cf. functions Attrib.setup
5151 and Method.setup, as well as Isar commands 'attribute_setup' and
5152 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
5153 existing code accordingly, or use plain 'setup' together with old
5156 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
5157 to 'a -> thm, while results are always tagged with an authentic oracle
5158 name. The Isar command 'oracle' is now polymorphic, no argument type
5159 is specified. INCOMPATIBILITY, need to simplify existing oracle code
5160 accordingly. Note that extra performance may be gained by producing
5161 the cterm carefully, avoiding slow Thm.cterm_of.
5163 * Simplified interface for defining document antiquotations via
5164 ThyOutput.antiquotation, ThyOutput.output, and optionally
5165 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
5166 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
5169 * More systematic treatment of long names, abstract name bindings, and
5170 name space operations. Basic operations on qualified names have been
5171 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
5172 Long_Name.append. Old type bstring has been mostly replaced by
5173 abstract type binding (see structure Binding), which supports precise
5174 qualification by packages and local theory targets, as well as proper
5175 tracking of source positions. INCOMPATIBILITY, need to wrap old
5176 bstring values into Binding.name, or better pass through abstract
5177 bindings everywhere. See further src/Pure/General/long_name.ML,
5178 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
5180 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
5181 LocalTheory.note etc.) now refer to the *full* internal name, not the
5182 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
5184 * Disposed old type and term read functions (Sign.read_def_typ,
5185 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
5186 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
5187 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
5188 Syntax.read_term_global etc.; see also OldGoals.read_term as last
5189 resort for legacy applications.
5191 * Disposed old declarations, tactics, tactic combinators that refer to
5192 the simpset or claset of an implicit theory (such as Addsimps,
5193 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
5194 embedded ML text, or local_simpset_of with a proper context passed as
5195 explicit runtime argument.
5197 * Rules and tactics that read instantiations (read_instantiate,
5198 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
5199 context, which is required for parsing and type-checking. Moreover,
5200 the variables are specified as plain indexnames, not string encodings
5201 thereof. INCOMPATIBILITY.
5203 * Generic Toplevel.add_hook interface allows to analyze the result of
5204 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
5205 for theorem dependency output of transactions resulting in a new
5208 * ML antiquotations: block-structured compilation context indicated by
5209 \<lbrace> ... \<rbrace>; additional antiquotation forms:
5211 @{binding name} - basic name binding
5212 @{let ?pat = term} - term abbreviation (HO matching)
5213 @{note name = fact} - fact abbreviation
5214 @{thm fact} - singleton fact (with attributes)
5215 @{thms fact} - general fact (with attributes)
5216 @{lemma prop by method} - singleton goal
5217 @{lemma prop by meth1 meth2} - singleton goal
5218 @{lemma prop1 ... propN by method} - general goal
5219 @{lemma prop1 ... propN by meth1 meth2} - general goal
5220 @{lemma (open) ...} - open derivation
5225 * The Isabelle "emacs" tool provides a specific interface to invoke
5226 Proof General / Emacs, with more explicit failure if that is not
5227 installed (the old isabelle-interface script silently falls back on
5228 isabelle-process). The PROOFGENERAL_HOME setting determines the
5229 installation location of the Proof General distribution.
5231 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
5232 the Isabelle process into a JVM/Scala application. See
5233 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
5234 process wrapper has been discontinued.)
5236 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
5238 * Various status messages (with exact source position information) are
5239 emitted, if proper markup print mode is enabled. This allows
5240 user-interface components to provide detailed feedback on internal
5245 New in Isabelle2008 (June 2008)
5246 -------------------------------
5250 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
5251 and updated, with formally checked references as hyperlinks.
5253 * Theory loader: use_thy (and similar operations) no longer set the
5254 implicit ML context, which was occasionally hard to predict and in
5255 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
5256 provides a proper context already.
5258 * Theory loader: old-style ML proof scripts being *attached* to a thy
5259 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
5260 'use' within a theory file will do the job.
5262 * Name space merge now observes canonical order, i.e. the second space
5263 is inserted into the first one, while existing entries in the first
5264 space take precedence. INCOMPATIBILITY in rare situations, may try to
5265 swap theory imports.
5267 * Syntax: symbol \<chi> is now considered a letter. Potential
5268 INCOMPATIBILITY in identifier syntax etc.
5270 * Outer syntax: string tokens no longer admit escaped white space,
5271 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
5272 white space without escapes.
5274 * Outer syntax: string tokens may contain arbitrary character codes
5275 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
5281 * Context-dependent token translations. Default setup reverts locally
5282 fixed variables, and adds hilite markup for undeclared frees.
5284 * Unused theorems can be found using the new command 'unused_thms'.
5285 There are three ways of invoking it:
5288 Only finds unused theorems in the current theory.
5290 (2) unused_thms thy_1 ... thy_n -
5291 Finds unused theorems in the current theory and all of its ancestors,
5292 excluding the theories thy_1 ... thy_n and all of their ancestors.
5294 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
5295 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
5296 their ancestors, excluding the theories thy_1 ... thy_n and all of
5299 In order to increase the readability of the list produced by
5300 unused_thms, theorems that have been created by a particular instance
5301 of a theory command such as 'inductive' or 'function' are considered
5302 to belong to the same "group", meaning that if at least one theorem in
5303 this group is used, the other theorems in the same group are no longer
5304 reported as unused. Moreover, if all theorems in the group are
5305 unused, only one theorem in the group is displayed.
5307 Note that proof objects have to be switched on in order for
5308 unused_thms to work properly (i.e. !proofs must be >= 1, which is
5309 usually the case when using Proof General with the default settings).
5311 * Authentic naming of facts disallows ad-hoc overwriting of previous
5312 theorems within the same name space. INCOMPATIBILITY, need to remove
5313 duplicate fact bindings, or even accidental fact duplications. Note
5314 that tools may maintain dynamically scoped facts systematically, using
5315 PureThy.add_thms_dynamic.
5317 * Command 'hide' now allows to hide from "fact" name space as well.
5319 * Eliminated destructive theorem database, simpset, claset, and
5320 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
5321 update of theories within ML code.
5323 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
5324 INCOMPATIBILITY, object-logics depending on former Pure require
5325 additional setup PureThy.old_appl_syntax_setup; object-logics
5326 depending on former CPure need to refer to Pure.
5328 * Commands 'use' and 'ML' are now purely functional, operating on
5329 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
5330 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
5333 * Command 'setup': discontinued implicit version with ML reference.
5335 * Instantiation target allows for simultaneous specification of class
5336 instance operations together with an instantiation proof.
5337 Type-checking phase allows to refer to class operations uniformly.
5338 See src/HOL/Complex/Complex.thy for an Isar example and
5339 src/HOL/Library/Eval.thy for an ML example.
5341 * Indexing of literal facts: be more serious about including only
5342 facts from the visible specification/proof context, but not the
5343 background context (locale etc.). Affects `prop` notation and method
5344 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
5347 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
5348 "(open)" option, which used to expose internal bound variables to the
5351 * Isar statements: removed obsolete case "rule_context".
5352 INCOMPATIBILITY, better use explicit fixes/assumes.
5354 * Locale proofs: default proof step now includes 'unfold_locales';
5355 hence 'proof' without argument may be used to unfold locale
5359 *** Document preparation ***
5361 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
5362 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
5363 obsolete thumbpdf setup (contemporary PDF viewers do this on the
5364 spot); renamed link color from "darkblue" to "linkcolor" (default
5365 value unchanged, can be redefined via \definecolor); no longer sets
5366 "a4paper" option (unnecessary or even intrusive).
5368 * Antiquotation @{lemma A method} proves proposition A by the given
5369 method (either a method name or a method name plus (optional) method
5370 arguments in parentheses) and prints A just like @{prop A}.
5375 * New primrec package. Specification syntax conforms in style to
5376 definition/function/.... No separate induction rule is provided. The
5377 "primrec" command distinguishes old-style and new-style specifications
5378 by syntax. The former primrec package is now named OldPrimrecPackage.
5379 When adjusting theories, beware: constants stemming from new-style
5380 primrec specifications have authentic syntax.
5382 * Metis prover is now an order of magnitude faster, and also works
5383 with multithreading.
5385 * Metis: the maximum number of clauses that can be produced from a
5386 theorem is now given by the attribute max_clauses. Theorems that
5387 exceed this number are ignored, with a warning printed.
5389 * Sledgehammer no longer produces structured proofs by default. To
5390 enable, declare [[sledgehammer_full = true]]. Attributes
5391 reconstruction_modulus, reconstruction_sorts renamed
5392 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
5394 * Method "induct_scheme" derives user-specified induction rules
5395 from well-founded induction and completeness of patterns. This factors
5396 out some operations that are done internally by the function package
5397 and makes them available separately. See
5398 src/HOL/ex/Induction_Scheme.thy for examples.
5400 * More flexible generation of measure functions for termination
5401 proofs: Measure functions can be declared by proving a rule of the
5402 form "is_measure f" and giving it the [measure_function] attribute.
5403 The "is_measure" predicate is logically meaningless (always true), and
5404 just guides the heuristic. To find suitable measure functions, the
5405 termination prover sets up the goal "is_measure ?f" of the appropriate
5406 type and generates all solutions by prolog-style backwards proof using
5409 This setup also deals with rules like
5411 "is_measure f ==> is_measure (list_size f)"
5413 which accommodates nested datatypes that recurse through lists.
5414 Similar rules are predeclared for products and option types.
5416 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
5420 - Definitions of overloaded constants on sets have to be replaced by
5421 definitions on => and bool.
5423 - Some definitions of overloaded operators on sets can now be proved
5424 using the definitions of the operators on => and bool. Therefore,
5425 the following theorems have been renamed:
5427 subset_def -> subset_eq
5428 psubset_def -> psubset_eq
5429 set_diff_def -> set_diff_eq
5430 Compl_def -> Compl_eq
5431 Sup_set_def -> Sup_set_eq
5432 Inf_set_def -> Inf_set_eq
5433 sup_set_def -> sup_set_eq
5434 inf_set_def -> inf_set_eq
5436 - Due to the incompleteness of the HO unification algorithm, some
5437 rules such as subst may require manual instantiation, if some of
5438 the unknowns in the rule is a set.
5440 - Higher order unification and forward proofs:
5443 have "P (S::'a set)" <...>
5444 then have "EX S. P S" ..
5446 no longer works (due to the incompleteness of the HO unification
5447 algorithm) and must be replaced by the pattern
5454 - Calculational reasoning with subst (or similar rules):
5457 have "P (S::'a set)" <...>
5458 also have "S = T" <...>
5459 finally have "P T" .
5461 no longer works (for similar reasons as the previous example) and
5462 must be replaced by something like
5464 have "P (S::'a set)" <...>
5465 moreover have "S = T" <...>
5466 ultimately have "P T" by simp
5468 - Tactics or packages written in ML code:
5469 Code performing pattern matching on types via
5471 Type ("set", [T]) => ...
5473 must be rewritten. Moreover, functions like strip_type or
5474 binder_types no longer return the right value when applied to a
5477 T1 => ... => Tn => U => bool
5481 T1 => ... => Tn => U set
5483 * Merged theories Wellfounded_Recursion, Accessible_Part and
5484 Wellfounded_Relations to theory Wellfounded.
5486 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
5488 * Class finite no longer treats UNIV as class parameter. Use class
5489 enum from theory Library/Enum instead to achieve a similar effect.
5492 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
5493 and "Cons". INCOMPATIBILITY.
5495 * HOL (and FOL): renamed variables in rules imp_elim and swap.
5496 Potential INCOMPATIBILITY.
5498 * Theory Product_Type: duplicated lemmas split_Pair_apply and
5499 injective_fst_snd removed, use split_eta and prod_eqI instead.
5500 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
5502 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
5503 the same name in theory Orderings:
5513 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
5514 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
5515 and different variable names.
5517 * Library/Option_ord.thy: Canonical order on option type.
5519 * Library/RBT.thy: Red-black trees, an efficient implementation of
5522 * Library/Countable.thy: Type class for countable types.
5524 * Theory Int: The representation of numerals has changed. The infix
5525 operator BIT and the bit datatype with constructors B0 and B1 have
5526 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
5527 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
5528 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
5531 * Theory Nat: definition of <= and < on natural numbers no longer
5532 depend on well-founded relations. INCOMPATIBILITY. Definitions
5533 le_def and less_def have disappeared. Consider lemmas not_less
5534 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
5536 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
5537 (whose purpose mainly is for various fold_set functionals) have been
5538 abandoned in favor of the existing algebraic classes
5539 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
5540 lower_semilattice (resp. upper_semilattice) and linorder.
5543 * Theory Transitive_Closure: induct and cases rules now declare proper
5544 case_names ("base" and "step"). INCOMPATIBILITY.
5546 * Theorem Inductive.lfp_ordinal_induct generalized to complete
5547 lattices. The form set-specific version is available as
5548 Inductive.lfp_ordinal_induct_set.
5550 * Renamed theorems "power.simps" to "power_int.simps".
5553 * Class semiring_div provides basic abstract properties of semirings
5554 with division and modulo operations. Subsumes former class dvd_mod.
5556 * Merged theories IntDef, Numeral and IntArith into unified theory
5557 Int. INCOMPATIBILITY.
5559 * Theory Library/Code_Index: type "index" now represents natural
5560 numbers rather than integers. INCOMPATIBILITY.
5562 * New class "uminus" with operation "uminus" (split of from class
5563 "minus" which now only has operation "minus", binary).
5566 * Constants "card", "internal_split", "option_map" now with authentic
5567 syntax. INCOMPATIBILITY.
5569 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
5570 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
5571 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
5572 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
5573 Sup_set_def, le_def, less_def, option_map_def now with object
5574 equality. INCOMPATIBILITY.
5576 * Records. Removed K_record, and replaced it by pure lambda term
5577 %x. c. The simplifier setup is now more robust against eta expansion.
5578 INCOMPATIBILITY: in cases explicitly referring to K_record.
5580 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
5582 * Library/ListVector: new theory of arithmetic vector operations.
5584 * Library/Order_Relation: new theory of various orderings as sets of
5585 pairs. Defines preorders, partial orders, linear orders and
5586 well-orders on sets and on types.
5591 * Renamed some theories to allow to loading both ZF and HOL in the
5594 Datatype -> Datatype_ZF
5595 Inductive -> Inductive_ZF
5602 INCOMPATIBILITY: ZF theories that import individual theories below
5603 Main might need to be adapted. Regular theory Main is still
5604 available, as trivial extension of Main_ZF.
5609 * ML within Isar: antiquotation @{const name} or @{const
5610 name(typargs)} produces statically-checked Const term.
5612 * Functor NamedThmsFun: data is available to the user as dynamic fact
5613 (of the same name). Removed obsolete print command.
5615 * Removed obsolete "use_legacy_bindings" function.
5617 * The ``print mode'' is now a thread-local value derived from a global
5618 template (the former print_mode reference), thus access becomes
5619 non-critical. The global print_mode reference is for session
5620 management only; user-code should use print_mode_value,
5621 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
5623 * Functions system/system_out provide a robust way to invoke external
5624 shell commands, with propagation of interrupts (requires Poly/ML
5625 5.2.1). Do not use OS.Process.system etc. from the basis library!
5630 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
5631 in accordance with Proof General 3.7, which prefers GNU emacs.
5633 * isatool tty runs Isabelle process with plain tty interaction;
5634 optional line editor may be specified via ISABELLE_LINE_EDITOR
5635 setting, the default settings attempt to locate "ledit" and "rlwrap".
5637 * isatool browser now works with Cygwin as well, using general
5638 "javapath" function defined in Isabelle process environment.
5640 * YXML notation provides a simple and efficient alternative to
5641 standard XML transfer syntax. See src/Pure/General/yxml.ML and
5642 isatool yxml as described in the Isabelle system manual.
5644 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
5645 provides general wrapper for managing an Isabelle process in a robust
5646 fashion, with ``cooked'' output from stdin/stderr.
5648 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
5649 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
5651 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
5652 way of changing the user's settings is via
5653 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
5656 * Multithreading.max_threads := 0 refers to the number of actual CPU
5657 cores of the underlying machine, which is a good starting point for
5658 optimal performance tuning. The corresponding usedir option -M allows
5659 "max" as an alias for "0". WARNING: does not work on certain versions
5660 of Mac OS (with Poly/ML 5.1).
5662 * isabelle-process: non-ML sessions are run with "nice", to reduce the
5663 adverse effect of Isabelle flooding interactive front-ends (notably
5664 ProofGeneral / XEmacs).
5668 New in Isabelle2007 (November 2007)
5669 -----------------------------------
5673 * More uniform information about legacy features, notably a
5674 warning/error of "Legacy feature: ...", depending on the state of the
5675 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
5676 legacy features will disappear eventually.
5678 * Theory syntax: the header format ``theory A = B + C:'' has been
5679 discontinued in favour of ``theory A imports B C begin''. Use isatool
5680 fixheaders to convert existing theory files. INCOMPATIBILITY.
5682 * Theory syntax: the old non-Isar theory file format has been
5683 discontinued altogether. Note that ML proof scripts may still be used
5684 with Isar theories; migration is usually quite simple with the ML
5685 function use_legacy_bindings. INCOMPATIBILITY.
5687 * Theory syntax: some popular names (e.g. 'class', 'declaration',
5688 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
5691 * Theory loader: be more serious about observing the static theory
5692 header specifications (including optional directories), but not the
5693 accidental file locations of previously successful loads. The strict
5694 update policy of former update_thy is now already performed by
5695 use_thy, so the former has been removed; use_thys updates several
5696 theories simultaneously, just as 'imports' within a theory header
5697 specification, but without merging the results. Potential
5698 INCOMPATIBILITY: may need to refine theory headers and commands
5699 ROOT.ML which depend on load order.
5701 * Theory loader: optional support for content-based file
5702 identification, instead of the traditional scheme of full physical
5703 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
5704 (cf. the system manual). The new scheme allows to work with
5705 non-finished theories in persistent session images, such that source
5706 files may be moved later on without requiring reloads.
5708 * Theory loader: old-style ML proof scripts being *attached* to a thy
5709 file (with the same base name as the theory) are considered a legacy
5710 feature, which will disappear eventually. Even now, the theory loader
5711 no longer maintains dependencies on such files.
5713 * Syntax: the scope for resolving ambiguities via type-inference is
5714 now limited to individual terms, instead of whole simultaneous
5715 specifications as before. This greatly reduces the complexity of the
5716 syntax module and improves flexibility by separating parsing and
5717 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
5718 'fixes' etc.) are required in rare situations.
5720 * Syntax: constants introduced by new-style packages ('definition',
5721 'abbreviation' etc.) are passed through the syntax module in
5722 ``authentic mode''. This means that associated mixfix annotations
5723 really stick to such constants, independently of potential name space
5724 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
5725 trees are represented slightly differently, may need to adapt syntax
5726 translations accordingly. Use CONST marker in 'translations' and
5727 @{const_syntax} antiquotation in 'parse_translation' etc.
5729 * Legacy goal package: reduced interface to the bare minimum required
5730 to keep existing proof scripts running. Most other user-level
5731 functions are now part of the OldGoals structure, which is *not* open
5732 by default (consider isatool expandshort before open OldGoals).
5733 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
5734 these tend to cause confusion about the actual goal (!) context being
5735 used here, which is not necessarily the same as the_context().
5737 * Command 'find_theorems': supports "*" wild-card in "name:"
5738 criterion; "with_dups" option. Certain ProofGeneral versions might
5739 support a specific search form (see ProofGeneral/CHANGES).
5741 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
5742 by default, which means that "prems" (and also "fixed variables") are
5743 suppressed from proof state output. Note that the ProofGeneral
5744 settings mechanism allows to change and save options persistently, but
5745 older versions of Isabelle will fail to start up if a negative prems
5748 * Local theory targets may be specified by non-nested blocks of
5749 ``context/locale/class ... begin'' followed by ``end''. The body may
5750 contain definitions, theorems etc., including any derived mechanism
5751 that has been implemented on top of these primitives. This concept
5752 generalizes the existing ``theorem (in ...)'' towards more versatility
5755 * Proof General interface: proper undo of final 'end' command;
5756 discontinued Isabelle/classic mode (ML proof scripts).
5759 *** Document preparation ***
5761 * Added antiquotation @{theory name} which prints the given name,
5762 after checking that it refers to a valid ancestor theory in the
5765 * Added antiquotations @{ML_type text} and @{ML_struct text} which
5766 check the given source text as ML type/structure, printing verbatim.
5768 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
5769 "c args == rhs" given in the current context. (Any number of
5770 arguments may be given on the LHS.)
5775 * The 'class' package offers a combination of axclass and locale to
5776 achieve Haskell-like type classes in Isabelle. Definitions and
5777 theorems within a class context produce both relative results (with
5778 implicit parameters according to the locale context), and polymorphic
5779 constants with qualified polymorphism (according to the class
5780 context). Within the body context of a 'class' target, a separate
5781 syntax layer ("user space type system") takes care of converting
5782 between global polymorphic consts and internal locale representation.
5783 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
5784 "isatool doc classes" provides a tutorial.
5786 * Generic code generator framework allows to generate executable
5787 code for ML and Haskell (including Isabelle classes). A short usage
5790 internal compilation:
5791 export_code <list of constants (term syntax)> in SML
5792 writing SML code to a file:
5793 export_code <list of constants (term syntax)> in SML <filename>
5794 writing OCaml code to a file:
5795 export_code <list of constants (term syntax)> in OCaml <filename>
5796 writing Haskell code to a bunch of files:
5797 export_code <list of constants (term syntax)> in Haskell <filename>
5799 evaluating closed propositions to True/False using code generation:
5802 Reasonable default setup of framework in HOL.
5804 Theorem attributs for selecting and transforming function equations theorems:
5806 [code fun]: select a theorem as function equation for a specific constant
5807 [code fun del]: deselect a theorem as function equation for a specific constant
5808 [code inline]: select an equation theorem for unfolding (inlining) in place
5809 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
5811 User-defined serializations (target in {SML, OCaml, Haskell}):
5813 code_const <and-list of constants (term syntax)>
5814 {(target) <and-list of const target syntax>}+
5816 code_type <and-list of type constructors>
5817 {(target) <and-list of type target syntax>}+
5819 code_instance <and-list of instances>
5821 where instance ::= <type constructor> :: <class>
5823 code_class <and_list of classes>
5824 {(target) <and-list of class target syntax>}+
5825 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
5827 code_instance and code_class only are effective to target Haskell.
5829 For example usage see src/HOL/ex/Codegenerator.thy and
5830 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
5831 generation from Isabelle/HOL theories is available via "isatool doc
5834 * Code generator: consts in 'consts_code' Isar commands are now
5835 referred to by usual term syntax (including optional type
5838 * Command 'no_translations' removes translation rules from theory
5841 * Overloaded definitions are now actually checked for acyclic
5842 dependencies. The overloading scheme is slightly more general than
5843 that of Haskell98, although Isabelle does not demand an exact
5844 correspondence to type class and instance declarations.
5845 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
5846 exotic versions of overloading -- at the discretion of the user!
5848 Polymorphic constants are represented via type arguments, i.e. the
5849 instantiation that matches an instance against the most general
5850 declaration given in the signature. For example, with the declaration
5851 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
5852 as c(nat). Overloading is essentially simultaneous structural
5853 recursion over such type arguments. Incomplete specification patterns
5854 impose global constraints on all occurrences, e.g. c('a * 'a) on the
5855 LHS means that more general c('a * 'b) will be disallowed on any RHS.
5856 Command 'print_theory' outputs the normalized system of recursive
5857 equations, see section "definitions".
5859 * Configuration options are maintained within the theory or proof
5860 context (with name and type bool/int/string), providing a very simple
5861 interface to a poor-man's version of general context data. Tools may
5862 declare options in ML (e.g. using Attrib.config_int) and then refer to
5863 these values using Config.get etc. Users may change options via an
5864 associated attribute of the same name. This form of context
5865 declaration works particularly well with commands 'declare' or
5866 'using', for example ``declare [[foo = 42]]''. Thus it has become
5867 very easy to avoid global references, which would not observe Isar
5868 toplevel undo/redo and fail to work with multithreading.
5870 Various global ML references of Pure and HOL have been turned into
5871 configuration options:
5873 Unify.search_bound unify_search_bound
5874 Unify.trace_bound unify_trace_bound
5875 Unify.trace_simp unify_trace_simp
5876 Unify.trace_types unify_trace_types
5877 Simplifier.simp_depth_limit simp_depth_limit
5878 Blast.depth_limit blast_depth_limit
5879 DatatypeProp.dtK datatype_distinctness_limit
5880 fast_arith_neq_limit fast_arith_neq_limit
5881 fast_arith_split_limit fast_arith_split_limit
5883 * Named collections of theorems may be easily installed as context
5884 data using the functor NamedThmsFun (see also
5885 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
5886 attributes; there is also a toplevel print command. This facility is
5887 just a common case of general context data, which is the preferred way
5888 for anything more complex than just a list of facts in canonical
5891 * Isar: command 'declaration' augments a local theory by generic
5892 declaration functions written in ML. This enables arbitrary content
5893 being added to the context, depending on a morphism that tells the
5894 difference of the original declaration context wrt. the application
5895 context encountered later on.
5897 * Isar: proper interfaces for simplification procedures. Command
5898 'simproc_setup' declares named simprocs (with match patterns, and body
5899 text in ML). Attribute "simproc" adds/deletes simprocs in the current
5900 context. ML antiquotation @{simproc name} retrieves named simprocs.
5902 * Isar: an extra pair of brackets around attribute declarations
5903 abbreviates a theorem reference involving an internal dummy fact,
5904 which will be ignored later --- only the effect of the attribute on
5905 the background context will persist. This form of in-place
5906 declarations is particularly useful with commands like 'declare' and
5907 'using', for example ``have A using [[simproc a]] by simp''.
5909 * Isar: method "assumption" (and implicit closing of subproofs) now
5910 takes simple non-atomic goal assumptions into account: after applying
5911 an assumption as a rule the resulting subgoals are solved by atomic
5912 assumption steps. This is particularly useful to finish 'obtain'
5913 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
5914 without referring to the original premise "!!x. P x ==> thesis" in the
5915 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
5918 * Isar: implicit use of prems from the Isar proof context is
5919 considered a legacy feature. Common applications like ``have A .''
5920 may be replaced by ``have A by fact'' or ``note `A`''. In general,
5921 referencing facts explicitly here improves readability and
5922 maintainability of proof texts.
5924 * Isar: improper proof element 'guess' is like 'obtain', but derives
5925 the obtained context from the course of reasoning! For example:
5927 assume "EX x y. A x & B y" -- "any previous fact"
5928 then guess x and y by clarify
5930 This technique is potentially adventurous, depending on the facts and
5931 proof tools being involved here.
5933 * Isar: known facts from the proof context may be specified as literal
5934 propositions, using ASCII back-quote syntax. This works wherever
5935 named facts used to be allowed so far, in proof commands, proof
5936 methods, attributes etc. Literal facts are retrieved from the context
5937 according to unification of type and term parameters. For example,
5938 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
5939 theorems in the current context, then these are valid literal facts:
5940 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
5942 There is also a proof method "fact" which does the same composition
5943 for explicit goal states, e.g. the following proof texts coincide with
5944 certain special cases of literal facts:
5946 have "A" by fact == note `A`
5947 have "A ==> B" by fact == note `A ==> B`
5948 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
5949 have "P a ==> Q a" by fact == note `P a ==> Q a`
5951 * Isar: ":" (colon) is no longer a symbolic identifier character in
5952 outer syntax. Thus symbolic identifiers may be used without
5953 additional white space in declarations like this: ``assume *: A''.
5955 * Isar: 'print_facts' prints all local facts of the current context,
5956 both named and unnamed ones.
5958 * Isar: 'def' now admits simultaneous definitions, e.g.:
5960 def x == "t" and y == "u"
5962 * Isar: added command 'unfolding', which is structurally similar to
5963 'using', but affects both the goal state and facts by unfolding given
5964 rewrite rules. Thus many occurrences of the 'unfold' method or
5965 'unfolded' attribute may be replaced by first-class proof text.
5967 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
5968 and command 'unfolding' now all support object-level equalities
5969 (potentially conditional). The underlying notion of rewrite rule is
5970 analogous to the 'rule_format' attribute, but *not* that of the
5971 Simplifier (which is usually more generous).
5973 * Isar: the new attribute [rotated n] (default n = 1) rotates the
5974 premises of a theorem by n. Useful in conjunction with drule.
5976 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
5977 method expression within a sandbox consisting of the first N
5978 sub-goals, which need to exist. For example, ``simp_all [3]''
5979 simplifies the first three sub-goals, while (rule foo, simp_all)[]
5980 simplifies all new goals that emerge from applying rule foo to the
5981 originally first one.
5983 * Isar: schematic goals are no longer restricted to higher-order
5984 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
5987 * Isar: the conclusion of a long theorem statement is now either
5988 'shows' (a simultaneous conjunction, as before), or 'obtains'
5989 (essentially a disjunction of cases with local parameters and
5990 assumptions). The latter allows to express general elimination rules
5991 adequately; in this notation common elimination rules look like this:
5993 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
5995 obtains x where "P x"
5997 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
6001 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
6007 The subsequent classical rules even refer to the formal "thesis"
6010 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
6013 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
6014 obtains "thesis ==> something"
6016 The actual proof of an 'obtains' statement is analogous to that of the
6017 Isar proof element 'obtain', only that there may be several cases.
6018 Optional case names may be specified in parentheses; these will be
6019 available both in the present proof and as annotations in the
6020 resulting rule, for later use with the 'cases' method (cf. attribute
6023 * Isar: the assumptions of a long theorem statement are available as
6024 "assms" fact in the proof context. This is more appropriate than the
6025 (historical) "prems", which refers to all assumptions of the current
6026 context, including those from the target locale, proof body etc.
6028 * Isar: 'print_statement' prints theorems from the current theory or
6029 proof context in long statement form, according to the syntax of a
6032 * Isar: 'obtain' takes an optional case name for the local context
6033 introduction rule (default "that").
6035 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
6036 explicit (is "_ ==> ?foo") in the rare cases where this still happens
6039 * Pure: syntax "CONST name" produces a fully internalized constant
6040 according to the current context. This is particularly useful for
6041 syntax translations that should refer to internal constant
6042 representations independently of name spaces.
6044 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
6045 instead of "FOO ". This allows multiple binder declarations to coexist
6046 in the same context. INCOMPATIBILITY.
6048 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
6049 primitive that also works in a locale context (both for constants and
6050 fixed variables). Type declaration and internal syntactic representation
6051 of given constants retrieved from the context. Likewise, the
6052 'no_notation' command allows to remove given syntax annotations from the
6055 * Isar/locales: new derived specification elements 'axiomatization',
6056 'definition', 'abbreviation', which support type-inference, admit
6057 object-level specifications (equality, equivalence). See also the
6058 isar-ref manual. Examples:
6061 eq (infix "===" 50) where
6062 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
6064 definition "f x y = x + y + 1"
6065 definition g where "g x = f x x"
6068 neq (infix "=!=" 50) where
6069 "x =!= y == ~ (x === y)"
6071 These specifications may be also used in a locale context. Then the
6072 constants being introduced depend on certain fixed parameters, and the
6073 constant name is qualified by the locale base name. An internal
6074 abbreviation takes care for convenient input and output, making the
6075 parameters implicit and using the original short name. See also
6076 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
6077 entities from a monomorphic theory.
6079 Presently, abbreviations are only available 'in' a target locale, but
6080 not inherited by general import expressions. Also note that
6081 'abbreviation' may be used as a type-safe replacement for 'syntax' +
6082 'translations' in common applications. The "no_abbrevs" print mode
6083 prevents folding of abbreviations in term output.
6085 Concrete syntax is attached to specified constants in internal form,
6086 independently of name spaces. The parse tree representation is
6087 slightly different -- use 'notation' instead of raw 'syntax', and
6088 'translations' with explicit "CONST" markup to accommodate this.
6090 * Pure/Isar: unified syntax for new-style specification mechanisms
6091 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
6092 full type inference and dummy patterns ("_"). For example:
6094 definition "K x _ = x"
6096 inductive conj for A B
6097 where "A ==> B ==> conj A B"
6099 * Pure: command 'print_abbrevs' prints all constant abbreviations of
6100 the current context. Print mode "no_abbrevs" prevents inversion of
6101 abbreviations on output.
6103 * Isar/locales: improved parameter handling: use of locales "var" and
6104 "struct" no longer necessary; - parameter renamings are no longer
6105 required to be injective. For example, this allows to define
6106 endomorphisms as locale endom = homom mult mult h.
6108 * Isar/locales: changed the way locales with predicates are defined.
6109 Instead of accumulating the specification, the imported expression is
6110 now an interpretation. INCOMPATIBILITY: different normal form of
6111 locale expressions. In particular, in interpretations of locales with
6112 predicates, goals repesenting already interpreted fragments are not
6113 removed automatically. Use methods `intro_locales' and
6114 `unfold_locales'; see below.
6116 * Isar/locales: new methods `intro_locales' and `unfold_locales'
6117 provide backward reasoning on locales predicates. The methods are
6118 aware of interpretations and discharge corresponding goals.
6119 `intro_locales' is less aggressive then `unfold_locales' and does not
6120 unfold predicates to assumptions.
6122 * Isar/locales: the order in which locale fragments are accumulated
6123 has changed. This enables to override declarations from fragments due
6124 to interpretations -- for example, unwanted simp rules.
6126 * Isar/locales: interpretation in theories and proof contexts has been
6127 extended. One may now specify (and prove) equations, which are
6128 unfolded in interpreted theorems. This is useful for replacing
6129 defined concepts (constants depending on locale parameters) by
6130 concepts already existing in the target context. Example:
6132 interpretation partial_order ["op <= :: [int, int] => bool"]
6133 where "partial_order.less (op <=) (x::int) y = (x < y)"
6135 Typically, the constant `partial_order.less' is created by a
6136 definition specification element in the context of locale
6139 * Method "induct": improved internal context management to support
6140 local fixes and defines on-the-fly. Thus explicit meta-level
6141 connectives !! and ==> are rarely required anymore in inductive goals
6142 (using object-logic connectives for this purpose has been long
6143 obsolete anyway). Common proof patterns are explained in
6144 src/HOL/Induct/Common_Patterns.thy, see also
6145 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
6148 * Method "induct": improved handling of simultaneous goals. Instead of
6149 introducing object-level conjunction, the statement is now split into
6150 several conclusions, while the corresponding symbolic cases are nested
6151 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
6152 see src/HOL/Induct/Common_Patterns.thy, for example.
6154 * Method "induct": mutual induction rules are now specified as a list
6155 of rule sharing the same induction cases. HOL packages usually provide
6156 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
6157 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
6158 mutual induction rules differently, i.e. like this:
6160 (induct rule: foo_bar.inducts)
6161 (induct set: foo bar)
6162 (induct pred: foo bar)
6163 (induct type: foo bar)
6165 The ML function ProjectRule.projections turns old-style rules into the
6168 * Method "coinduct": dual of induction, see
6169 src/HOL/Library/Coinductive_List.thy for various examples.
6171 * Method "cases", "induct", "coinduct": the ``(open)'' option is
6172 considered a legacy feature.
6174 * Attribute "symmetric" produces result with standardized schematic
6175 variables (index 0). Potential INCOMPATIBILITY.
6177 * Simplifier: by default the simplifier trace only shows top level
6178 rewrites now. That is, trace_simp_depth_limit is set to 1 by
6179 default. Thus there is less danger of being flooded by the trace. The
6180 trace indicates where parts have been suppressed.
6182 * Provers/classical: removed obsolete classical version of elim_format
6183 attribute; classical elim/dest rules are now treated uniformly when
6184 manipulating the claset.
6186 * Provers/classical: stricter checks to ensure that supplied intro,
6187 dest and elim rules are well-formed; dest and elim rules must have at
6190 * Provers/classical: attributes dest/elim/intro take an optional
6191 weight argument for the rule (just as the Pure versions). Weights are
6192 ignored by automated tools, but determine the search order of single
6195 * Syntax: input syntax now supports dummy variable binding "%_. b",
6196 where the body does not mention the bound variable. Note that dummy
6197 patterns implicitly depend on their context of bounds, which makes
6198 "{_. _}" match any set comprehension as expected. Potential
6199 INCOMPATIBILITY -- parse translations need to cope with syntactic
6200 constant "_idtdummy" in the binding position.
6202 * Syntax: removed obsolete syntactic constant "_K" and its associated
6203 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
6204 for example "A -> B" => "Pi A (%_. B)".
6206 * Pure: 'class_deps' command visualizes the subclass relation, using
6207 the graph browser tool.
6209 * Pure: 'print_theory' now suppresses certain internal declarations by
6210 default; use '!' option for full details.
6215 * Method "metis" proves goals by applying the Metis general-purpose
6216 resolution prover (see also http://gilith.com/software/metis/).
6217 Examples are in the directory MetisExamples. WARNING: the
6218 Isabelle/HOL-Metis integration does not yet work properly with
6221 * Command 'sledgehammer' invokes external automatic theorem provers as
6222 background processes. It generates calls to the "metis" method if
6223 successful. These can be pasted into the proof. Users do not have to
6224 wait for the automatic provers to return. WARNING: does not really
6225 work with multi-threading.
6227 * New "auto_quickcheck" feature tests outermost goal statements for
6228 potential counter-examples. Controlled by ML references
6229 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
6230 5000 milliseconds). Fails silently if statements is outside of
6231 executable fragment, or any other codgenerator problem occurs.
6233 * New constant "undefined" with axiom "undefined x = undefined".
6235 * Added class "HOL.eq", allowing for code generation with polymorphic
6238 * Some renaming of class constants due to canonical name prefixing in
6239 the new 'class' package:
6241 HOL.abs ~> HOL.abs_class.abs
6242 HOL.divide ~> HOL.divide_class.divide
6243 0 ~> HOL.zero_class.zero
6244 1 ~> HOL.one_class.one
6245 op + ~> HOL.plus_class.plus
6246 op - ~> HOL.minus_class.minus
6247 uminus ~> HOL.minus_class.uminus
6248 op * ~> HOL.times_class.times
6249 op < ~> HOL.ord_class.less
6250 op <= > HOL.ord_class.less_eq
6251 Nat.power ~> Power.power_class.power
6252 Nat.size ~> Nat.size_class.size
6253 Numeral.number_of ~> Numeral.number_class.number_of
6254 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
6255 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
6256 Orderings.min ~> Orderings.ord_class.min
6257 Orderings.max ~> Orderings.ord_class.max
6258 Divides.op div ~> Divides.div_class.div
6259 Divides.op mod ~> Divides.div_class.mod
6260 Divides.op dvd ~> Divides.div_class.dvd
6262 INCOMPATIBILITY. Adaptions may be required in the following cases:
6264 a) User-defined constants using any of the names "plus", "minus",
6265 "times", "less" or "less_eq". The standard syntax translations for
6266 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
6269 b) Variables named "plus", "minus", "times", "less", "less_eq"
6270 INCOMPATIBILITY: use more specific names.
6272 c) Permutative equations (e.g. "a + b = b + a")
6273 Since the change of names also changes the order of terms, permutative
6274 rewrite rules may get applied in a different order. Experience shows
6275 that this is rarely the case (only two adaptions in the whole Isabelle
6276 distribution). INCOMPATIBILITY: rewrite proofs
6278 d) ML code directly refering to constant names
6279 This in general only affects hand-written proof tactics, simprocs and
6280 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
6281 Consider using @{const_name} antiquotation.
6283 * New class "default" with associated constant "default".
6285 * Function "sgn" is now overloaded and available on int, real, complex
6286 (and other numeric types), using class "sgn". Two possible defs of
6287 sgn are given as equational assumptions in the classes sgn_if and
6288 sgn_div_norm; ordered_idom now also inherits from sgn_if.
6291 * Locale "partial_order" now unified with class "order" (cf. theory
6292 Orderings), added parameter "less". INCOMPATIBILITY.
6294 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
6295 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
6296 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
6298 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
6299 changed order of proof goals in instance proofs.
6301 * The transitivity reasoner for partial and linear orders is set up
6302 for classes "order" and "linorder". Instances of the reasoner are available
6303 in all contexts importing or interpreting the corresponding locales.
6304 Method "order" invokes the reasoner separately; the reasoner
6305 is also integrated with the Simplifier as a solver. Diagnostic
6306 command 'print_orders' shows the available instances of the reasoner
6307 in the current context.
6309 * Localized monotonicity predicate in theory "Orderings"; integrated
6310 lemmas max_of_mono and min_of_mono with this predicate.
6313 * Formulation of theorem "dense" changed slightly due to integration
6314 with new class dense_linear_order.
6316 * Uniform lattice theory development in HOL.
6318 constants "meet" and "join" now named "inf" and "sup"
6319 constant "Meet" now named "Inf"
6321 classes "meet_semilorder" and "join_semilorder" now named
6322 "lower_semilattice" and "upper_semilattice"
6323 class "lorder" now named "lattice"
6324 class "comp_lat" now named "complete_lattice"
6326 Instantiation of lattice classes allows explicit definitions
6327 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
6329 INCOMPATIBILITY. Theorem renames:
6331 meet_left_le ~> inf_le1
6332 meet_right_le ~> inf_le2
6333 join_left_le ~> sup_ge1
6334 join_right_le ~> sup_ge2
6335 meet_join_le ~> inf_sup_ord
6338 le_meet ~> le_inf_iff
6339 le_join ~> ge_sup_conv
6340 meet_idempotent ~> inf_idem
6341 join_idempotent ~> sup_idem
6342 meet_comm ~> inf_commute
6343 join_comm ~> sup_commute
6344 meet_leI1 ~> le_infI1
6345 meet_leI2 ~> le_infI2
6346 le_joinI1 ~> le_supI1
6347 le_joinI2 ~> le_supI2
6348 meet_assoc ~> inf_assoc
6349 join_assoc ~> sup_assoc
6350 meet_left_comm ~> inf_left_commute
6351 meet_left_idempotent ~> inf_left_idem
6352 join_left_comm ~> sup_left_commute
6353 join_left_idempotent ~> sup_left_idem
6356 le_def_meet ~> le_iff_inf
6357 le_def_join ~> le_iff_sup
6358 join_absorp2 ~> sup_absorb2
6359 join_absorp1 ~> sup_absorb1
6360 meet_absorp1 ~> inf_absorb1
6361 meet_absorp2 ~> inf_absorb2
6362 meet_join_absorp ~> inf_sup_absorb
6363 join_meet_absorp ~> sup_inf_absorb
6364 distrib_join_le ~> distrib_sup_le
6365 distrib_meet_le ~> distrib_inf_le
6367 add_meet_distrib_left ~> add_inf_distrib_left
6368 add_join_distrib_left ~> add_sup_distrib_left
6369 is_join_neg_meet ~> is_join_neg_inf
6370 is_meet_neg_join ~> is_meet_neg_sup
6371 add_meet_distrib_right ~> add_inf_distrib_right
6372 add_join_distrib_right ~> add_sup_distrib_right
6373 add_meet_join_distribs ~> add_sup_inf_distribs
6374 join_eq_neg_meet ~> sup_eq_neg_inf
6375 meet_eq_neg_join ~> inf_eq_neg_sup
6376 add_eq_meet_join ~> add_eq_inf_sup
6377 meet_0_imp_0 ~> inf_0_imp_0
6378 join_0_imp_0 ~> sup_0_imp_0
6379 meet_0_eq_0 ~> inf_0_eq_0
6380 join_0_eq_0 ~> sup_0_eq_0
6381 neg_meet_eq_join ~> neg_inf_eq_sup
6382 neg_join_eq_meet ~> neg_sup_eq_inf
6383 join_eq_if ~> sup_eq_if
6385 mono_meet ~> mono_inf
6386 mono_join ~> mono_sup
6387 meet_bool_eq ~> inf_bool_eq
6388 join_bool_eq ~> sup_bool_eq
6389 meet_fun_eq ~> inf_fun_eq
6390 join_fun_eq ~> sup_fun_eq
6391 meet_set_eq ~> inf_set_eq
6392 join_set_eq ~> sup_set_eq
6393 meet1_iff ~> inf1_iff
6394 meet2_iff ~> inf2_iff
6403 join1_iff ~> sup1_iff
6404 join2_iff ~> sup2_iff
6414 is_meet_Meet ~> is_meet_Inf
6415 Meet_bool_def ~> Inf_bool_def
6416 Meet_fun_def ~> Inf_fun_def
6417 Meet_greatest ~> Inf_greatest
6418 Meet_lower ~> Inf_lower
6419 Meet_set_def ~> Inf_set_def
6422 Sup_bool_eq ~> Sup_bool_def
6423 Sup_fun_eq ~> Sup_fun_def
6424 Sup_set_eq ~> Sup_set_def
6426 listsp_meetI ~> listsp_infI
6427 listsp_meet_eq ~> listsp_inf_eq
6432 * Added syntactic class "size"; overloaded constant "size" now has
6433 type "'a::size ==> bool"
6435 * Internal reorganisation of `size' of datatypes: size theorems
6436 "foo.size" are no longer subsumed by "foo.simps" (but are still
6437 simplification rules by default!); theorems "prod.size" now named
6440 * Class "div" now inherits from class "times" rather than "type".
6443 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
6444 Linorder etc. have disappeared; operations defined in terms of
6445 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
6447 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
6449 * HOL-Word: New extensive library and type for generic, fixed size
6450 machine words, with arithmetic, bit-wise, shifting and rotating
6451 operations, reflection into int, nat, and bool lists, automation for
6452 linear arithmetic (by automatic reflection into nat or int), including
6453 lemmas on overflow and monotonicity. Instantiated to all appropriate
6454 arithmetic type classes, supporting automatic simplification of
6455 numerals on all operations.
6457 * Library/Boolean_Algebra: locales for abstract boolean algebras.
6459 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
6461 * Code generator library theories:
6462 - Code_Integer represents HOL integers by big integer literals in target
6464 - Code_Char represents HOL characters by character literals in target
6466 - Code_Char_chr like Code_Char, but also offers treatment of character
6467 codes; includes Code_Integer.
6468 - Executable_Set allows to generate code for finite sets using lists.
6469 - Executable_Rat implements rational numbers as triples (sign, enumerator,
6471 - Executable_Real implements a subset of real numbers, namly those
6472 representable by rational numbers.
6473 - Efficient_Nat implements natural numbers by integers, which in general will
6474 result in higher efficency; pattern matching with 0/Suc is eliminated;
6475 includes Code_Integer.
6476 - Code_Index provides an additional datatype index which is mapped to
6477 target-language built-in integers.
6478 - Code_Message provides an additional datatype message_string which is isomorphic to
6479 strings; messages are mapped to target-language strings.
6481 * New package for inductive predicates
6483 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
6486 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
6487 for z_1 :: U_1 and ... and z_n :: U_m
6489 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
6492 with full support for type-inference, rather than
6494 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
6496 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
6497 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
6499 inductive "s z_1 ... z_m"
6501 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
6504 For backward compatibility, there is a wrapper allowing inductive
6505 sets to be defined with the new package via
6508 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
6509 for z_1 :: U_1 and ... and z_n :: U_m
6511 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
6517 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
6518 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
6519 for z_1 :: U_1 and ... and z_n :: U_m
6521 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
6522 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
6525 if the additional syntax "p ..." is required.
6527 Numerous examples can be found in the subdirectories src/HOL/Auth,
6528 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
6532 - Since declaration and definition of inductive sets or predicates
6533 is no longer separated, abbreviations involving the newly
6534 introduced sets or predicates must be specified together with the
6535 introduction rules after the 'where' keyword (see above), rather
6536 than before the actual inductive definition.
6538 - The variables in induction and elimination rules are now
6539 quantified in the order of their occurrence in the introduction
6540 rules, rather than in alphabetical order. Since this may break
6541 some proofs, these proofs either have to be repaired, e.g. by
6542 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
6543 statements of the form
6545 case (rule_i a_i_1 ... a_i_{k_i})
6547 or the old order of quantification has to be restored by explicitly adding
6548 meta-level quantifiers in the introduction rules, i.e.
6550 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
6552 - The format of the elimination rules is now
6554 p z_1 ... z_m x_1 ... x_n ==>
6555 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
6560 (x_1, ..., x_n) : s z_1 ... z_m ==>
6561 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
6564 for sets rather than
6566 x : s z_1 ... z_m ==>
6567 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
6570 This may require terms in goals to be expanded to n-tuples
6571 (e.g. using case_tac or simplification with the split_paired_all
6572 rule) before the above elimination rule is applicable.
6574 - The elimination or case analysis rules for (mutually) inductive
6575 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
6576 list of rules "p_1_..._p_k.elims" is no longer available.
6578 * New package "function"/"fun" for general recursive functions,
6579 supporting mutual and nested recursion, definitions in local contexts,
6580 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
6581 for small examples, and the separate tutorial on the function
6582 package. The old recdef "package" is still available as before, but
6583 users are encouraged to use the new package.
6585 * Method "lexicographic_order" automatically synthesizes termination
6586 relations as lexicographic combinations of size measures.
6588 * Case-expressions allow arbitrary constructor-patterns (including
6589 "_") and take their order into account, like in functional
6590 programming. Internally, this is translated into nested
6591 case-expressions; missing cases are added and mapped to the predefined
6592 constant "undefined". In complicated cases printing may no longer show
6593 the original input but the internal form. Lambda-abstractions allow
6594 the same form of pattern matching: "% pat1 => e1 | ..." is an
6595 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
6598 * IntDef: The constant "int :: nat => int" has been removed; now "int"
6599 is an abbreviation for "of_nat :: nat => int". The simplification
6600 rules for "of_nat" have been changed to work like "int" did
6601 previously. Potential INCOMPATIBILITY:
6602 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
6603 - of_nat_diff and of_nat_mult are no longer default simp rules
6605 * Method "algebra" solves polynomial equations over (semi)rings using
6606 Groebner bases. The (semi)ring structure is defined by locales and the
6607 tool setup depends on that generic context. Installing the method for
6608 a specific type involves instantiating the locale and possibly adding
6609 declarations for computation on the coefficients. The method is
6610 already instantiated for natural numbers and for the axiomatic class
6611 of idoms with numerals. See also the paper by Chaieb and Wenzel at
6612 CALCULEMUS 2007 for the general principles underlying this
6613 architecture of context-aware proof-tools.
6615 * Method "ferrack" implements quantifier elimination over
6616 special-purpose dense linear orders using locales (analogous to
6617 "algebra"). The method is already installed for class
6618 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
6621 * Former constant "List.op @" now named "List.append". Use ML
6622 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
6623 circumvent possible incompatibilities when working on ML level.
6625 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
6627 * New function listsum :: 'a list => 'a for arbitrary monoids.
6628 Special syntax: "SUM x <- xs. f x" (and latex variants)
6630 * New syntax for Haskell-like list comprehension (input only), eg.
6631 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
6633 * The special syntax for function "filter" has changed from [x :
6634 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
6635 comprehension syntax, and for uniformity. INCOMPATIBILITY.
6637 * [a..b] is now defined for arbitrary linear orders. It used to be
6638 defined on nat only, as an abbreviation for [a..<Suc b]
6641 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
6643 * New functions "sorted" and "sort" in src/HOL/List.thy.
6645 * New lemma collection field_simps (an extension of ring_simps) for
6646 manipulating (in)equations involving division. Multiplies with all
6647 denominators that can be proved to be non-zero (in equations) or
6648 positive/negative (in inequations).
6650 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
6651 have been improved and renamed to ring_simps, group_simps and
6652 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
6653 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
6655 * Theory Library/Commutative_Ring: switched from recdef to function
6656 package; constants add, mul, pow now curried. Infix syntax for
6657 algebraic operations.
6659 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
6662 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
6665 * HOL/records: generalised field-update to take a function on the
6666 field rather than the new value: r(|A := x|) is translated to A_update
6667 (K x) r The K-combinator that is internally used is called K_record.
6668 INCOMPATIBILITY: Usage of the plain update functions has to be
6671 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
6672 * x = 0, which are required for a semiring. Richer structures do not
6673 inherit from semiring_0 anymore, because this property is a theorem
6674 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
6675 there is more to prove, but this is mostly trivial.
6677 * Class "recpower" is generalized to arbitrary monoids, not just
6678 commutative semirings. INCOMPATIBILITY: may need to incorporate
6679 commutativity or semiring properties additionally.
6681 * Constant "List.list_all2" in List.thy now uses authentic syntax.
6682 INCOMPATIBILITY: translations containing list_all2 may go wrong,
6683 better use 'abbreviation'.
6685 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
6687 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
6688 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
6689 significant changes for setting up numeral syntax for types:
6690 - New constants Numeral.pred and Numeral.succ instead
6691 of former Numeral.bin_pred and Numeral.bin_succ.
6692 - Use integer operations instead of bin_add, bin_mult and so on.
6693 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
6694 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
6696 See src/HOL/Integ/IntArith.thy for an example setup.
6698 * Command 'normal_form' computes the normal form of a term that may
6699 contain free variables. For example ``normal_form "rev [a, b, c]"''
6700 produces ``[b, c, a]'' (without proof). This command is suitable for
6701 heavy-duty computations because the functions are compiled to ML
6702 first. Correspondingly, a method "normalization" is provided. See
6703 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
6705 * Alternative iff syntax "A <-> B" for equality on bool (with priority
6706 25 like -->); output depends on the "iff" print_mode, the default is
6707 "A = B" (with priority 50).
6709 * Relations less (<) and less_eq (<=) are also available on type bool.
6710 Modified syntax to disallow nesting without explicit parentheses,
6711 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
6714 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
6716 * Relation composition operator "op O" now has precedence 75 and binds
6717 stronger than union and intersection. INCOMPATIBILITY.
6719 * The old set interval syntax "{m..n(}" (and relatives) has been
6720 removed. Use "{m..<n}" (and relatives) instead.
6722 * In the context of the assumption "~(s = t)" the Simplifier rewrites
6723 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
6724 ``declare [[simproc del: neq]]''.
6726 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
6729 * Theorem Cons_eq_map_conv no longer declared as "simp".
6731 * Theorem setsum_mult renamed to setsum_right_distrib.
6733 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
6736 * Reimplemented methods "sat" and "satx", with several improvements:
6737 goals no longer need to be stated as "<prems> ==> False", equivalences
6738 (i.e. "=" on type bool) are handled, variable names of the form
6739 "lit_<n>" are no longer reserved, significant speedup.
6741 * Methods "sat" and "satx" can now replay MiniSat proof traces.
6742 zChaff is still supported as well.
6744 * 'inductive' and 'datatype': provide projections of mutual rules,
6745 bundled as foo_bar.inducts;
6747 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
6750 * Library: moved theory Accessible_Part to main HOL.
6752 * Library: added theory Coinductive_List of potentially infinite lists
6753 as greatest fixed-point.
6755 * Library: added theory AssocList which implements (finite) maps as
6758 * Method "evaluation" solves goals (i.e. a boolean expression)
6759 efficiently by compiling it to ML. The goal is "proved" (via an
6760 oracle) if it evaluates to True.
6762 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
6763 also when invoked by the simplifier. This results in the Simplifier
6764 being more powerful on arithmetic goals. INCOMPATIBILITY.
6765 Configuration option fast_arith_split_limit=0 recovers the old
6768 * Support for hex (0x20) and binary (0b1001) numerals.
6770 * New method: reify eqs (t), where eqs are equations for an
6771 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
6772 parameter, computes a term s::'b and a list xs::'a list and proves the
6773 theorem I xs s = t. This is also known as reification or quoting. The
6774 resulting theorem is applied to the subgoal to substitute t with I xs
6775 s. If t is omitted, the subgoal itself is reified.
6777 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
6778 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
6779 where f is supposed to be a computable function (in the sense of code
6780 generattion). The method uses reify to compute s and xs as above then
6781 applies corr_thm and uses normalization by evaluation to "prove" f s =
6782 r and finally gets the theorem t = r, which is again applied to the
6783 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
6785 * Reflection: Automatic reification now handels binding, an example is
6786 available in src/HOL/ex/ReflectionEx.thy
6788 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
6789 command 'statespace' that is similar to 'record', but introduces an
6790 abstract specification based on the locale infrastructure instead of
6791 HOL types. This leads to extra flexibility in composing state spaces,
6792 in particular multiple inheritance and renaming of components.
6797 * Hyperreal: Functions root and sqrt are now defined on negative real
6798 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
6799 Nonnegativity side conditions have been removed from many lemmas, so
6800 that more subgoals may now be solved by simplification; potential
6803 * Real: new type classes formalize real normed vector spaces and
6804 algebras, using new overloaded constants scaleR :: real => 'a => 'a
6805 and norm :: 'a => real.
6807 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
6808 reals into other types. The overloaded constant Reals :: 'a set is now
6809 defined as range of_real; potential INCOMPATIBILITY.
6811 * Real: proper support for ML code generation, including 'quickcheck'.
6812 Reals are implemented as arbitrary precision rationals.
6814 * Hyperreal: Several constants that previously worked only for the
6815 reals have been generalized, so they now work over arbitrary vector
6816 spaces. Type annotations may need to be added in some cases; potential
6819 Infinitesimal :: ('a::real_normed_vector) star set
6820 HFinite :: ('a::real_normed_vector) star set
6821 HInfinite :: ('a::real_normed_vector) star set
6822 approx :: ('a::real_normed_vector) star => 'a star => bool
6823 monad :: ('a::real_normed_vector) star => 'a star set
6824 galaxy :: ('a::real_normed_vector) star => 'a star set
6825 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
6826 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
6827 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
6828 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
6829 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
6830 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
6831 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
6832 sgn :: 'a::real_normed_vector => 'a
6833 exp :: 'a::{recpower,real_normed_field,banach} => 'a
6835 * Complex: Some complex-specific constants are now abbreviations for
6836 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
6837 hnorm. Other constants have been entirely removed in favor of the
6838 polymorphic versions (INCOMPATIBILITY):
6842 HInfinite <-- CInfinite
6843 Infinitesimal <-- CInfinitesimal
6846 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
6847 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
6848 (ns)deriv <-- (ns)cderiv
6853 * Formalisation of ideals and the quotient construction over rings.
6855 * Order and lattice theory no longer based on records.
6858 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
6859 greatest_closed. INCOMPATIBILITY.
6861 * Method algebra is now set up via an attribute. For examples see
6862 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
6863 of algebraic structures.
6865 * Renamed theory CRing to Ring.
6870 * Substantial, yet incomplete support for nominal datatypes (binding
6871 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
6872 src/HOL/Nominal/Examples. Prospective users should consult
6873 http://isabelle.in.tum.de/nominal/
6878 * ML basics: just one true type int, which coincides with IntInf.int
6881 * ML within Isar: antiquotations allow to embed statically-checked
6882 formal entities in the source, referring to the context available at
6883 compile-time. For example:
6885 ML {* @{sort "{zero,one}"} *}
6886 ML {* @{typ "'a => 'b"} *}
6887 ML {* @{term "%x. x"} *}
6888 ML {* @{prop "x == y"} *}
6889 ML {* @{ctyp "'a => 'b"} *}
6890 ML {* @{cterm "%x. x"} *}
6891 ML {* @{cprop "x == y"} *}
6892 ML {* @{thm asm_rl} *}
6893 ML {* @{thms asm_rl} *}
6894 ML {* @{type_name c} *}
6895 ML {* @{type_syntax c} *}
6896 ML {* @{const_name c} *}
6897 ML {* @{const_syntax c} *}
6900 ML {* @{theory Pure} *}
6901 ML {* @{theory_ref} *}
6902 ML {* @{theory_ref Pure} *}
6905 ML {* @{clasimpset} *}
6907 The same works for sources being ``used'' within an Isar context.
6909 * ML in Isar: improved error reporting; extra verbosity with
6910 ML_Context.trace enabled.
6912 * Pure/General/table.ML: the join operations now works via exceptions
6913 DUP/SAME instead of type option. This is simpler in simple cases, and
6914 admits slightly more efficient complex applications.
6916 * Pure: 'advanced' translation functions (parse_translation etc.) now
6917 use Context.generic instead of just theory.
6919 * Pure: datatype Context.generic joins theory/Proof.context and
6920 provides some facilities for code that works in either kind of
6921 context, notably GenericDataFun for uniform theory and proof data.
6923 * Pure: simplified internal attribute type, which is now always
6924 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
6925 local (Proof.context) attributes have been discontinued, while
6926 minimizing code duplication. Thm.rule_attribute and
6927 Thm.declaration_attribute build canonical attributes; see also structure
6928 Context for further operations on Context.generic, notably
6929 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
6930 declarations and definitions.
6932 * Context data interfaces (Theory/Proof/GenericDataFun): removed
6933 name/print, uninitialized data defaults to ad-hoc copy of empty value,
6934 init only required for impure data. INCOMPATIBILITY: empty really need
6935 to be empty (no dependencies on theory content!)
6937 * Pure/kernel: consts certification ignores sort constraints given in
6938 signature declarations. (This information is not relevant to the
6939 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
6940 potential INCOMPATIBILITY.
6942 * Pure: axiomatic type classes are now purely definitional, with
6943 explicit proofs of class axioms and super class relations performed
6944 internally. See Pure/axclass.ML for the main internal interfaces --
6945 notably AxClass.define_class supercedes AxClass.add_axclass, and
6946 AxClass.axiomatize_class/classrel/arity supersede
6947 Sign.add_classes/classrel/arities.
6949 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
6950 global/local versions on theory vs. Proof.context have been
6951 discontinued; Attrib.syntax and Method.syntax have been adapted
6952 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
6953 attributes, methods, etc.
6955 * Pure: several functions of signature "... -> theory -> theory * ..."
6956 have been reoriented to "... -> theory -> ... * theory" in order to
6957 allow natural usage in combination with the ||>, ||>>, |-> and
6958 fold_map combinators.
6960 * Pure: official theorem names (closed derivations) and additional
6961 comments (tags) are now strictly separate. Name hints -- which are
6962 maintained as tags -- may be attached any time without affecting the
6965 * Pure: primitive rule lift_rule now takes goal cterm instead of an
6966 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
6967 achieve the old behaviour.
6969 * Pure: the "Goal" constant is now called "prop", supporting a
6970 slightly more general idea of ``protecting'' meta-level rule
6973 * Pure: Logic.(un)varify only works in a global context, which is now
6974 enforced instead of silently assumed. INCOMPATIBILITY, may use
6975 Logic.legacy_(un)varify as temporary workaround.
6977 * Pure: structure Name provides scalable operations for generating
6978 internal variable names, notably Name.variants etc. This replaces
6979 some popular functions from term.ML:
6981 Term.variant -> Name.variant
6982 Term.variantlist -> Name.variant_list
6983 Term.invent_names -> Name.invent_list
6985 Note that low-level renaming rarely occurs in new code -- operations
6986 from structure Variable are used instead (see below).
6988 * Pure: structure Variable provides fundamental operations for proper
6989 treatment of fixed/schematic variables in a context. For example,
6990 Variable.import introduces fixes for schematics of given facts and
6991 Variable.export reverses the effect (up to renaming) -- this replaces
6992 various freeze_thaw operations.
6994 * Pure: structure Goal provides simple interfaces for
6995 init/conclude/finish and tactical prove operations (replacing former
6996 Tactic.prove). Goal.prove is the canonical way to prove results
6997 within a given context; Goal.prove_global is a degraded version for
6998 theory level goals, including a global Drule.standard. Note that
6999 OldGoals.prove_goalw_cterm has long been obsolete, since it is
7000 ill-behaved in a local proof context (e.g. with local fixes/assumes or
7001 in a locale context).
7003 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
7004 and type checking (Syntax.check_term etc.), with common combinations
7005 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
7006 which are considered legacy and await removal.
7008 * Pure/Syntax: generic interfaces for type unchecking
7009 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
7010 with common combinations (Syntax.pretty_term, Syntax.string_of_term
7011 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
7012 available for convenience, but refer to the very same operations using
7013 a mere theory instead of a full context.
7015 * Isar: simplified treatment of user-level errors, using exception
7016 ERROR of string uniformly. Function error now merely raises ERROR,
7017 without any side effect on output channels. The Isar toplevel takes
7018 care of proper display of ERROR exceptions. ML code may use plain
7019 handle/can/try; cat_error may be used to concatenate errors like this:
7021 ... handle ERROR msg => cat_error msg "..."
7023 Toplevel ML code (run directly or through the Isar toplevel) may be
7024 embedded into the Isar toplevel with exception display/debug like
7027 Isar.toplevel (fn () => ...)
7029 INCOMPATIBILITY, removed special transform_error facilities, removed
7030 obsolete variants of user-level exceptions (ERROR_MESSAGE,
7031 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
7032 -- use plain ERROR instead.
7034 * Isar: theory setup now has type (theory -> theory), instead of a
7035 list. INCOMPATIBILITY, may use #> to compose setup functions.
7037 * Isar: ML toplevel pretty printer for type Proof.context, subject to
7038 ProofContext.debug/verbose flags.
7040 * Isar: Toplevel.theory_to_proof admits transactions that modify the
7041 theory before entering a proof state. Transactions now always see a
7042 quasi-functional intermediate checkpoint, both in interactive and
7045 * Isar: simplified interfaces for outer syntax. Renamed
7046 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
7047 OuterSyntax.add_parsers -- this functionality is now included in
7048 OuterSyntax.command etc. INCOMPATIBILITY.
7050 * Simplifier: the simpset of a running simplification process now
7051 contains a proof context (cf. Simplifier.the_context), which is the
7052 very context that the initial simpset has been retrieved from (by
7053 simpset_of/local_simpset_of). Consequently, all plug-in components
7054 (solver, looper etc.) may depend on arbitrary proof data.
7056 * Simplifier.inherit_context inherits the proof context (plus the
7057 local bounds) of the current simplification process; any simproc
7058 etc. that calls the Simplifier recursively should do this! Removed
7059 former Simplifier.inherit_bounds, which is already included here --
7060 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
7061 specify an explicit context using Simplifier.context/theory_context.
7063 * Simplifier/Classical Reasoner: more abstract interfaces
7064 change_simpset/claset for modifying the simpset/claset reference of a
7065 theory; raw versions simpset/claset_ref etc. have been discontinued --
7068 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
7074 * settings: the default heap location within ISABELLE_HOME_USER now
7075 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
7076 Isabelle installations.
7078 * isabelle-process: option -S (secure mode) disables some critical
7079 operations, notably runtime compilation and evaluation of ML source
7082 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
7084 * Support for parallel execution, using native multicore support of
7085 Poly/ML 5.1. The theory loader exploits parallelism when processing
7086 independent theories, according to the given theory header
7087 specifications. The maximum number of worker threads is specified via
7088 usedir option -M or the "max-threads" setting in Proof General. A
7089 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
7090 to 6 on a 8-core machine. User-code needs to observe certain
7091 guidelines for thread-safe programming, see appendix A in the Isar
7092 Implementation manual.
7096 New in Isabelle2005 (October 2005)
7097 ----------------------------------
7101 * Theory headers: the new header syntax for Isar theories is
7104 imports <theory1> ... <theoryN>
7105 uses <file1> ... <fileM>
7108 where the 'uses' part is optional. The previous syntax
7110 theory <name> = <theory1> + ... + <theoryN>:
7112 will disappear in the next release. Use isatool fixheaders to convert
7113 existing theory files. Note that there is no change in ancient
7114 non-Isar theories now, but these will disappear soon.
7116 * Theory loader: parent theories can now also be referred to via
7117 relative and absolute paths.
7119 * Command 'find_theorems' searches for a list of criteria instead of a
7120 list of constants. Known criteria are: intro, elim, dest, name:string,
7121 simp:term, and any term. Criteria can be preceded by '-' to select
7122 theorems that do not match. Intro, elim, dest select theorems that
7123 match the current goal, name:s selects theorems whose fully qualified
7124 name contain s, and simp:term selects all simplification rules whose
7125 lhs match term. Any other term is interpreted as pattern and selects
7126 all theorems matching the pattern. Available in ProofGeneral under
7127 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
7129 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
7131 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
7132 matching the current goal as introduction rule and not having "HOL."
7133 in their name (i.e. not being defined in theory HOL).
7135 * Command 'thms_containing' has been discontinued in favour of
7136 'find_theorems'; INCOMPATIBILITY.
7138 * Communication with Proof General is now 8bit clean, which means that
7139 Unicode text in UTF-8 encoding may be used within theory texts (both
7140 formal and informal parts). Cf. option -U of the Isabelle Proof
7141 General interface. Here are some simple examples (cf. src/HOL/ex):
7143 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
7144 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
7146 * Improved efficiency of the Simplifier and, to a lesser degree, the
7147 Classical Reasoner. Typical big applications run around 2 times
7151 *** Document preparation ***
7153 * Commands 'display_drafts' and 'print_drafts' perform simple output
7154 of raw sources. Only those symbols that do not require additional
7155 LaTeX packages (depending on comments in isabellesym.sty) are
7156 displayed properly, everything else is left verbatim. isatool display
7157 and isatool print are used as front ends (these are subject to the
7158 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
7160 * Command tags control specific markup of certain regions of text,
7161 notably folding and hiding. Predefined tags include "theory" (for
7162 theory begin and end), "proof" for proof commands, and "ML" for
7163 commands involving ML code; the additional tags "visible" and
7164 "invisible" are unused by default. Users may give explicit tag
7165 specifications in the text, e.g. ''by %invisible (auto)''. The
7166 interpretation of tags is determined by the LaTeX job during document
7167 preparation: see option -V of isatool usedir, or options -n and -t of
7168 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
7171 Several document versions may be produced at the same time via isatool
7172 usedir (the generated index.html will link all of them). Typical
7173 specifications include ''-V document=theory,proof,ML'' to present
7174 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
7175 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
7176 these parts without any formal replacement text. The Isabelle site
7177 default settings produce ''document'' and ''outline'' versions as
7180 * Several new antiquotations:
7182 @{term_type term} prints a term with its type annotated;
7184 @{typeof term} prints the type of a term;
7186 @{const const} is the same as @{term const}, but checks that the
7187 argument is a known logical constant;
7189 @{term_style style term} and @{thm_style style thm} print a term or
7190 theorem applying a "style" to it
7194 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
7195 definitions, equations, inequations etc., 'concl' printing only the
7196 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
7197 to print the specified premise. TermStyle.add_style provides an ML
7198 interface for introducing further styles. See also the "LaTeX Sugar"
7199 document practical applications. The ML antiquotation prints
7200 type-checked ML expressions verbatim.
7202 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
7203 and 'text' support optional locale specification '(in loc)', which
7204 specifies the default context for interpreting antiquotations. For
7205 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
7207 * Option 'locale=NAME' of antiquotations specifies an alternative
7208 context interpreting the subsequent argument. For example: @{thm
7209 [locale=lattice] inf_assoc}.
7211 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
7214 * Proper output of antiquotations for theory commands involving a
7215 proof context (such as 'locale' or 'theorem (in loc) ...').
7217 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
7218 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
7220 * isatool usedir: new option -C (default true) controls whether option
7221 -D should include a copy of the original document directory; -C false
7222 prevents unwanted effects such as copying of administrative CVS data.
7227 * Considerably improved version of 'constdefs' command. Now performs
7228 automatic type-inference of declared constants; additional support for
7229 local structure declarations (cf. locales and HOL records), see also
7230 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
7231 sequential dependencies of definitions within a single 'constdefs'
7232 section; moreover, the declared name needs to be an identifier. If
7233 all fails, consider to fall back on 'consts' and 'defs' separately.
7235 * Improved indexed syntax and implicit structures. First of all,
7236 indexed syntax provides a notational device for subscripted
7237 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
7238 expressions. Secondly, in a local context with structure
7239 declarations, number indexes \<^sub>n or the empty index (default
7240 number 1) refer to a certain fixed variable implicitly; option
7241 show_structs controls printing of implicit structures. Typical
7242 applications of these concepts involve record types and locales.
7244 * New command 'no_syntax' removes grammar declarations (and
7245 translations) resulting from the given syntax specification, which is
7246 interpreted in the same manner as for the 'syntax' command.
7248 * 'Advanced' translation functions (parse_translation etc.) may depend
7249 on the signature of the theory context being presently used for
7250 parsing/printing, see also isar-ref manual.
7252 * Improved 'oracle' command provides a type-safe interface to turn an
7253 ML expression of type theory -> T -> term into a primitive rule of
7254 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
7255 is already included here); see also FOL/ex/IffExample.thy;
7258 * axclass: name space prefix for class "c" is now "c_class" (was "c"
7259 before); "cI" is no longer bound, use "c.intro" instead.
7260 INCOMPATIBILITY. This change avoids clashes of fact bindings for
7261 axclasses vs. locales.
7263 * Improved internal renaming of symbolic identifiers -- attach primes
7264 instead of base 26 numbers.
7266 * New flag show_question_marks controls printing of leading question
7267 marks in schematic variable names.
7269 * In schematic variable names, *any* symbol following \<^isub> or
7270 \<^isup> is now treated as part of the base name. For example, the
7271 following works without printing of awkward ".0" indexes:
7273 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
7276 * Inner syntax includes (*(*nested*) comments*).
7278 * Pretty printer now supports unbreakable blocks, specified in mixfix
7279 annotations as "(00...)".
7281 * Clear separation of logical types and nonterminals, where the latter
7282 may only occur in 'syntax' specifications or type abbreviations.
7283 Before that distinction was only partially implemented via type class
7284 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
7285 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
7286 exotic syntax specifications may require further adaption
7287 (e.g. Cube/Cube.thy).
7289 * Removed obsolete type class "logic", use the top sort {} instead.
7290 Note that non-logical types should be declared as 'nonterminals'
7291 rather than 'types'. INCOMPATIBILITY for new object-logic
7294 * Attributes 'induct' and 'cases': type or set names may now be
7295 locally fixed variables as well.
7297 * Simplifier: can now control the depth to which conditional rewriting
7298 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
7301 * Simplifier: simplification procedures may now take the current
7302 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
7303 interface), which is very useful for calling the Simplifier
7304 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
7305 is gone -- use prems_of_ss on the simpset instead. Moreover, the
7306 low-level mk_simproc no longer applies Logic.varify internally, to
7307 allow for use in a context of fixed variables.
7309 * thin_tac now works even if the assumption being deleted contains !!
7310 or ==>. More generally, erule now works even if the major premise of
7311 the elimination rule contains !! or ==>.
7313 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
7315 * Reorganized bootstrapping of the Pure theories; CPure is now derived
7316 from Pure, which contains all common declarations already. Both
7317 theories are defined via plain Isabelle/Isar .thy files.
7318 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
7319 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
7320 use isatool fixcpure to adapt your theory and ML sources.
7322 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
7323 selections of theorems in named facts via index ranges.
7325 * 'print_theorems': in theory mode, really print the difference
7326 wrt. the last state (works for interactive theory development only),
7327 in proof mode print all local facts (cf. 'print_facts');
7329 * 'hide': option '(open)' hides only base names.
7331 * More efficient treatment of intermediate checkpoints in interactive
7334 * Code generator is now invoked via code_module (incremental code
7335 generation) and code_library (modular code generation, ML structures
7336 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
7337 must be quoted when used as identifiers.
7339 * New 'value' command for reading, evaluating and printing terms using
7340 the code generator. INCOMPATIBILITY: command keyword 'value' must be
7341 quoted when used as identifier.
7346 * New commands for the interpretation of locale expressions in
7347 theories (1), locales (2) and proof contexts (3). These generate
7348 proof obligations from the expression specification. After the
7349 obligations have been discharged, theorems of the expression are added
7350 to the theory, target locale or proof context. The synopsis of the
7351 commands is a follows:
7353 (1) interpretation expr inst
7354 (2) interpretation target < expr
7355 (3) interpret expr inst
7357 Interpretation in theories and proof contexts require a parameter
7358 instantiation of terms from the current context. This is applied to
7359 specifications and theorems of the interpreted expression.
7360 Interpretation in locales only permits parameter renaming through the
7361 locale expression. Interpretation is smart in that interpretations
7362 that are active already do not occur in proof obligations, neither are
7363 instantiated theorems stored in duplicate. Use 'print_interps' to
7364 inspect active interpretations of a particular locale. For details,
7365 see the Isar Reference manual. Examples can be found in
7366 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
7368 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
7369 'interpret' instead.
7371 * New context element 'constrains' for adding type constraints to
7374 * Context expressions: renaming of parameters with syntax
7377 * Locale declaration: 'includes' disallowed.
7379 * Proper static binding of attribute syntax -- i.e. types / terms /
7380 facts mentioned as arguments are always those of the locale definition
7381 context, independently of the context of later invocations. Moreover,
7382 locale operations (renaming and type / term instantiation) are applied
7383 to attribute arguments as expected.
7385 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
7386 actual attributes; rare situations may require Attrib.attribute to
7387 embed those attributes into Attrib.src that lack concrete syntax.
7388 Attribute implementations need to cooperate properly with the static
7389 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
7390 Attrib.XXX_thm etc. already do the right thing without further
7391 intervention. Only unusual applications -- such as "where" or "of"
7392 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
7393 on the context and the facts involved -- may have to assign parsed
7394 values to argument tokens explicitly.
7396 * Changed parameter management in theorem generation for long goal
7397 statements with 'includes'. INCOMPATIBILITY: produces a different
7398 theorem statement in rare situations.
7400 * Locale inspection command 'print_locale' omits notes elements. Use
7401 'print_locale!' to have them included in the output.
7406 * Provers/hypsubst.ML: improved version of the subst method, for
7407 single-step rewriting: it now works in bound variable contexts. New is
7408 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
7409 rewrite a different subterm than the original subst method, which is
7410 still available as 'simplesubst'.
7412 * Provers/quasi.ML: new transitivity reasoners for transitivity only
7415 * Provers/trancl.ML: new transitivity reasoner for transitive and
7416 reflexive-transitive closure of relations.
7418 * Provers/blast.ML: new reference depth_limit to make blast's depth
7419 limit (previously hard-coded with a value of 20) user-definable.
7421 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
7422 is peformed already. Object-logics merely need to finish their
7423 initial simpset configuration as before. INCOMPATIBILITY.
7428 * Symbolic syntax of Hilbert Choice Operator is now as follows:
7431 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
7433 The symbol \<some> is displayed as the alternative epsilon of LaTeX
7434 and x-symbol; use option '-m epsilon' to get it actually printed.
7435 Moreover, the mathematically important symbolic identifier \<epsilon>
7436 becomes available as variable, constant etc. INCOMPATIBILITY,
7438 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
7439 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
7440 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
7441 support corresponding Isar calculations.
7443 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
7446 * theory SetInterval: changed the syntax for open intervals:
7455 The old syntax is still supported but will disappear in the next
7456 release. For conversion use the following Emacs search and replace
7457 patterns (these are not perfect but work quite well):
7459 {)\([^\.]*\)\.\. -> {\1<\.\.}
7460 \.\.\([^(}]*\)(} -> \.\.<\1}
7462 * Theory Commutative_Ring (in Library): method comm_ring for proving
7463 equalities in commutative rings; method 'algebra' provides a generic
7466 * Theory Finite_Set: changed the syntax for 'setsum', summation over
7467 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
7468 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
7471 Some new syntax forms are available:
7473 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
7474 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
7475 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
7476 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
7478 The latter form "\<Sum>x < k. e" used to be based on a separate
7479 function "Summation", which has been discontinued.
7481 * theory Finite_Set: in structured induction proofs, the insert case
7482 is now 'case (insert x F)' instead of the old counterintuitive 'case
7485 * The 'refute' command has been extended to support a much larger
7486 fragment of HOL, including axiomatic type classes, constdefs and
7487 typedefs, inductive datatypes and recursion.
7489 * New tactics 'sat' and 'satx' to prove propositional tautologies.
7490 Requires zChaff with proof generation to be installed. See
7491 HOL/ex/SAT_Examples.thy for examples.
7493 * Datatype induction via method 'induct' now preserves the name of the
7494 induction variable. For example, when proving P(xs::'a list) by
7495 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
7496 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
7497 in unstructured proof scripts.
7499 * Reworked implementation of records. Improved scalability for
7500 records with many fields, avoiding performance problems for type
7501 inference. Records are no longer composed of nested field types, but
7502 of nested extension types. Therefore the record type only grows linear
7503 in the number of extensions and not in the number of fields. The
7504 top-level (users) view on records is preserved. Potential
7505 INCOMPATIBILITY only in strange cases, where the theory depends on the
7506 old record representation. The type generated for a record is called
7507 <record_name>_ext_type.
7509 Flag record_quick_and_dirty_sensitive can be enabled to skip the
7510 proofs triggered by a record definition or a simproc (if
7511 quick_and_dirty is enabled). Definitions of large records can take
7514 New simproc record_upd_simproc for simplification of multiple record
7515 updates enabled by default. Moreover, trivial updates are also
7516 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
7517 occasionally, since simplification is more powerful by default.
7519 * typedef: proper support for polymorphic sets, which contain extra
7520 type-variables in the term.
7522 * Simplifier: automatically reasons about transitivity chains
7523 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
7524 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
7525 old proofs break occasionally as simplification may now solve more
7526 goals than previously.
7528 * Simplifier: converts x <= y into x = y if assumption y <= x is
7529 present. Works for all partial orders (class "order"), in particular
7530 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
7533 * Simplifier: new simproc for "let x = a in f x". If a is a free or
7534 bound variable or a constant then the let is unfolded. Otherwise
7535 first a is simplified to b, and then f b is simplified to g. If
7536 possible we abstract b from g arriving at "let x = b in h x",
7537 otherwise we unfold the let and arrive at g. The simproc can be
7538 enabled/disabled by the reference use_let_simproc. Potential
7539 INCOMPATIBILITY since simplification is more powerful by default.
7541 * Classical reasoning: the meson method now accepts theorems as arguments.
7543 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
7544 jobs to provide advice on the provability of subgoals.
7546 * Theory OrderedGroup and Ring_and_Field: various additions and
7547 improvements to faciliate calculations involving equalities and
7550 The following theorems have been eliminated or modified
7553 abs_eq now named abs_of_nonneg
7554 abs_of_ge_0 now named abs_of_nonneg
7555 abs_minus_eq now named abs_of_nonpos
7556 imp_abs_id now named abs_of_nonneg
7557 imp_abs_neg_id now named abs_of_nonpos
7558 mult_pos now named mult_pos_pos
7559 mult_pos_le now named mult_nonneg_nonneg
7560 mult_pos_neg_le now named mult_nonneg_nonpos
7561 mult_pos_neg2_le now named mult_nonneg_nonpos2
7562 mult_neg now named mult_neg_neg
7563 mult_neg_le now named mult_nonpos_nonpos
7565 * The following lemmas in Ring_and_Field have been added to the simplifier:
7568 not_square_less_zero
7570 The following lemmas have been deleted from Real/RealPow:
7580 * Theory Parity: added rules for simplifying exponents.
7584 The following theorems have been eliminated or modified
7587 list_all_Nil now named list_all.simps(1)
7588 list_all_Cons now named list_all.simps(2)
7589 list_all_conv now named list_all_iff
7590 set_mem_eq now named mem_iff
7592 * Theories SetsAndFunctions and BigO (see HOL/Library) support
7593 asymptotic "big O" calculations. See the notes in BigO.thy.
7598 * Theory RealDef: better support for embedding natural numbers and
7599 integers in the reals.
7601 The following theorems have been eliminated or modified
7604 exp_ge_add_one_self now requires no hypotheses
7605 real_of_int_add reversed direction of equality (use [symmetric])
7606 real_of_int_minus reversed direction of equality (use [symmetric])
7607 real_of_int_diff reversed direction of equality (use [symmetric])
7608 real_of_int_mult reversed direction of equality (use [symmetric])
7610 * Theory RComplete: expanded support for floor and ceiling functions.
7612 * Theory Ln is new, with properties of the natural logarithm
7614 * Hyperreal: There is a new type constructor "star" for making
7615 nonstandard types. The old type names are now type synonyms:
7619 hcomplex = complex star
7621 * Hyperreal: Many groups of similarly-defined constants have been
7622 replaced by polymorphic versions (INCOMPATIBILITY):
7624 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
7626 starset <-- starsetNat, starsetC
7627 *s* <-- *sNat*, *sc*
7628 starset_n <-- starsetNat_n, starsetC_n
7629 *sn* <-- *sNatn*, *scn*
7630 InternalSets <-- InternalNatSets, InternalCSets
7632 starfun <-- starfun{Nat,Nat2,C,RC,CR}
7633 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
7634 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
7635 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
7636 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
7638 * Hyperreal: Many type-specific theorems have been removed in favor of
7639 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
7641 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
7642 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
7643 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
7644 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
7645 right_minus <-- hypreal_add_minus
7646 left_minus <-- {hypreal,hcomplex}_add_minus_left
7647 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
7648 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
7649 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
7650 mult_1_right <-- hcomplex_mult_one_right
7651 mult_zero_left <-- hcomplex_mult_zero_left
7652 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
7653 right_distrib <-- hypnat_add_mult_distrib2
7654 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
7655 right_inverse <-- hypreal_mult_inverse
7656 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
7657 order_refl <-- {hypreal,hypnat}_le_refl
7658 order_trans <-- {hypreal,hypnat}_le_trans
7659 order_antisym <-- {hypreal,hypnat}_le_anti_sym
7660 order_less_le <-- {hypreal,hypnat}_less_le
7661 linorder_linear <-- {hypreal,hypnat}_le_linear
7662 add_left_mono <-- {hypreal,hypnat}_add_left_mono
7663 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
7664 add_nonneg_nonneg <-- hypreal_le_add_order
7666 * Hyperreal: Separate theorems having to do with type-specific
7667 versions of constants have been merged into theorems that apply to the
7668 new polymorphic constants (INCOMPATIBILITY):
7670 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
7671 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
7672 STAR_Un <-- {STAR,NatStar,STARC}_Un
7673 STAR_Int <-- {STAR,NatStar,STARC}_Int
7674 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
7675 STAR_subset <-- {STAR,NatStar,STARC}_subset
7676 STAR_mem <-- {STAR,NatStar,STARC}_mem
7677 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
7678 STAR_diff <-- {STAR,STARC}_diff
7679 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
7680 STARC_hcomplex_of_complex}_image_subset
7681 starset_n_Un <-- starset{Nat,C}_n_Un
7682 starset_n_Int <-- starset{Nat,C}_n_Int
7683 starset_n_Compl <-- starset{Nat,C}_n_Compl
7684 starset_n_diff <-- starset{Nat,C}_n_diff
7685 InternalSets_Un <-- Internal{Nat,C}Sets_Un
7686 InternalSets_Int <-- Internal{Nat,C}Sets_Int
7687 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
7688 InternalSets_diff <-- Internal{Nat,C}Sets_diff
7689 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
7690 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
7691 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
7692 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
7693 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
7694 starfun <-- starfun{Nat,Nat2,C,RC,CR}
7695 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
7696 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
7697 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
7698 starfun_diff <-- starfun{C,RC,CR}_diff
7699 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
7700 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
7701 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
7702 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
7703 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
7704 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
7705 starfun_Id <-- starfunC_Id
7706 starfun_approx <-- starfun{Nat,CR}_approx
7707 starfun_capprox <-- starfun{C,RC}_capprox
7708 starfun_abs <-- starfunNat_rabs
7709 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
7710 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
7711 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
7712 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
7713 starfun_add_capprox <-- starfun{C,RC}_add_capprox
7714 starfun_add_approx <-- starfunCR_add_approx
7715 starfun_inverse_inverse <-- starfunC_inverse_inverse
7716 starfun_divide <-- starfun{C,CR,RC}_divide
7717 starfun_n <-- starfun{Nat,C}_n
7718 starfun_n_mult <-- starfun{Nat,C}_n_mult
7719 starfun_n_add <-- starfun{Nat,C}_n_add
7720 starfun_n_add_minus <-- starfunNat_n_add_minus
7721 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
7722 starfun_n_minus <-- starfun{Nat,C}_n_minus
7723 starfun_n_eq <-- starfun{Nat,C}_n_eq
7725 star_n_add <-- {hypreal,hypnat,hcomplex}_add
7726 star_n_minus <-- {hypreal,hcomplex}_minus
7727 star_n_diff <-- {hypreal,hcomplex}_diff
7728 star_n_mult <-- {hypreal,hcomplex}_mult
7729 star_n_inverse <-- {hypreal,hcomplex}_inverse
7730 star_n_le <-- {hypreal,hypnat}_le
7731 star_n_less <-- {hypreal,hypnat}_less
7732 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
7733 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
7734 star_n_abs <-- hypreal_hrabs
7735 star_n_divide <-- hcomplex_divide
7737 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
7738 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
7739 star_of_diff <-- hypreal_of_real_diff
7740 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
7741 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
7742 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
7743 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
7744 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
7745 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
7746 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
7747 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
7748 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
7749 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
7750 star_of_number_of <-- {hypreal,hcomplex}_number_of
7751 star_of_number_less <-- number_of_less_hypreal_of_real_iff
7752 star_of_number_le <-- number_of_le_hypreal_of_real_iff
7753 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
7754 star_of_less_number <-- hypreal_of_real_less_number_of_iff
7755 star_of_le_number <-- hypreal_of_real_le_number_of_iff
7756 star_of_power <-- hypreal_of_real_power
7757 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
7759 * Hyperreal: new method "transfer" that implements the transfer
7760 principle of nonstandard analysis. With a subgoal that mentions
7761 nonstandard types like "'a star", the command "apply transfer"
7762 replaces it with an equivalent one that mentions only standard types.
7763 To be successful, all free variables must have standard types; non-
7764 standard variables must have explicit universal quantifiers.
7766 * Hyperreal: A theory of Taylor series.
7771 * Discontinued special version of 'constdefs' (which used to support
7772 continuous functions) in favor of the general Pure one with full
7775 * New simplification procedure for solving continuity conditions; it
7776 is much faster on terms with many nested lambda abstractions (cubic
7777 instead of exponential time).
7779 * New syntax for domain package: selector names are now optional.
7780 Parentheses should be omitted unless argument is lazy, for example:
7782 domain 'a stream = cons "'a" (lazy "'a stream")
7784 * New command 'fixrec' for defining recursive functions with pattern
7785 matching; defining multiple functions with mutual recursion is also
7786 supported. Patterns may include the constants cpair, spair, up, sinl,
7787 sinr, or any data constructor defined by the domain package. The given
7788 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
7789 syntax and examples.
7791 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
7792 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
7793 but the proof obligation additionally includes an admissibility
7794 requirement. The packages generate instances of class cpo or pcpo,
7795 with continuity and strictness theorems for Rep and Abs.
7797 * HOLCF: Many theorems have been renamed according to a more standard naming
7798 scheme (INCOMPATIBILITY):
7800 foo_inject: "foo$x = foo$y ==> x = y"
7801 foo_eq: "(foo$x = foo$y) = (x = y)"
7802 foo_less: "(foo$x << foo$y) = (x << y)"
7803 foo_strict: "foo$UU = UU"
7804 foo_defined: "... ==> foo$x ~= UU"
7805 foo_defined_iff: "(foo$x = UU) = (x = UU)"
7810 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
7811 including the First Isomorphism Theorem (on quotienting by the kernel
7814 * ZF/Simplifier: install second copy of type solver that actually
7815 makes use of TC rules declared to Isar proof contexts (or locales);
7816 the old version is still required for ML proof scripts.
7821 * Converted to Isar theory format; use locales instead of axiomatic
7827 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
7830 * Pure/library.ML no longer defines its own option datatype, but uses
7831 that of the SML basis, which has constructors NONE and SOME instead of
7832 None and Some, as well as exception Option.Option instead of OPTION.
7833 The functions the, if_none, is_some, is_none have been adapted
7834 accordingly, while Option.map replaces apsome.
7836 * Pure/library.ML: the exception LIST has been given up in favour of
7837 the standard exceptions Empty and Subscript, as well as
7838 Library.UnequalLengths. Function like Library.hd and Library.tl are
7839 superceded by the standard hd and tl functions etc.
7841 A number of basic list functions are no longer exported to the ML
7842 toplevel, as they are variants of predefined functions. The following
7843 suggests how one can translate existing code:
7845 rev_append xs ys = List.revAppend (xs, ys)
7846 nth_elem (i, xs) = List.nth (xs, i)
7847 last_elem xs = List.last xs
7848 flat xss = List.concat xss
7849 seq fs = List.app fs
7850 partition P xs = List.partition P xs
7851 mapfilter f xs = List.mapPartial f xs
7853 * Pure/library.ML: several combinators for linear functional
7854 transformations, notably reverse application and composition:
7857 (x, y) |-> f f #-> g
7859 * Pure/library.ML: introduced/changed precedence of infix operators:
7861 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
7863 infix 3 o oo ooo oooo;
7864 infix 4 ~~ upto downto;
7866 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
7869 * Pure/library.ML: natural list combinators fold, fold_rev, and
7870 fold_map support linear functional transformations and nesting. For
7873 fold f [x1, ..., xN] y =
7874 y |> f x1 |> ... |> f xN
7876 (fold o fold) f [xs1, ..., xsN] y =
7877 y |> fold f xs1 |> ... |> fold f xsN
7879 fold f [x1, ..., xN] =
7882 (fold o fold) f [xs1, ..., xsN] =
7883 fold f xs1 #> ... #> fold f xsN
7885 * Pure/library.ML: the following selectors on type 'a option are
7888 the: 'a option -> 'a (*partial*)
7889 these: 'a option -> 'a where 'a = 'b list
7890 the_default: 'a -> 'a option -> 'a
7891 the_list: 'a option -> 'a list
7893 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
7894 basic operations for association lists, following natural argument
7895 order; moreover the explicit equality predicate passed here avoids
7896 potentially expensive polymorphic runtime equality checks.
7897 The old functions may be expressed as follows:
7899 assoc = uncurry (AList.lookup (op =))
7900 assocs = these oo AList.lookup (op =)
7901 overwrite = uncurry (AList.update (op =)) o swap
7903 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
7905 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
7906 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
7908 replacing make_keylist and keyfilter (occassionally used)
7911 make_keylist = AList.make
7912 keyfilter = AList.find (op =)
7914 * eq_fst and eq_snd now take explicit equality parameter, thus
7915 avoiding eqtypes. Naive rewrites:
7917 eq_fst = eq_fst (op =)
7918 eq_snd = eq_snd (op =)
7920 * Removed deprecated apl and apr (rarely used).
7923 apl (n, op) =>>= curry op n
7924 apr (op, m) =>>= fn n => op (n, m)
7926 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
7927 provides a reasonably efficient light-weight implementation of sets as
7930 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
7931 few new operations; existing lookup and update are now curried to
7932 follow natural argument order (for use with fold etc.);
7933 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
7935 * Pure/General: output via the Isabelle channels of
7936 writeln/warning/error etc. is now passed through Output.output, with a
7937 hook for arbitrary transformations depending on the print_mode
7938 (cf. Output.add_mode -- the first active mode that provides a output
7939 function wins). Already formatted output may be embedded into further
7940 text via Output.raw; the result of Pretty.string_of/str_of and derived
7941 functions (string_of_term/cterm/thm etc.) is already marked raw to
7942 accommodate easy composition of diagnostic messages etc. Programmers
7943 rarely need to care about Output.output or Output.raw at all, with
7944 some notable exceptions: Output.output is required when bypassing the
7945 standard channels (writeln etc.), or in token translations to produce
7946 properly formatted results; Output.raw is required when capturing
7947 already output material that will eventually be presented to the user
7948 a second time. For the default print mode, both Output.output and
7949 Output.raw have no effect.
7951 * Pure/General: Output.time_accumulator NAME creates an operator ('a
7952 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
7953 cumulative results are displayed at the end of a batch session.
7955 * Pure/General: File.sysify_path and File.quote_sysify path have been
7956 replaced by File.platform_path and File.shell_path (with appropriate
7957 hooks). This provides a clean interface for unusual systems where the
7958 internal and external process view of file names are different.
7960 * Pure: more efficient orders for basic syntactic entities: added
7961 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
7962 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
7963 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
7964 orders now -- potential INCOMPATIBILITY for code that depends on a
7965 particular order for Symtab.keys, Symtab.dest, etc. (consider using
7966 Library.sort_strings on result).
7968 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
7969 fold_types traverse types/terms from left to right, observing natural
7970 argument order. Supercedes previous foldl_XXX versions, add_frees,
7971 add_vars etc. have been adapted as well: INCOMPATIBILITY.
7973 * Pure: name spaces have been refined, with significant changes of the
7974 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
7975 to extern(_table). The plain name entry path is superceded by a
7976 general 'naming' context, which also includes the 'policy' to produce
7977 a fully qualified name and external accesses of a fully qualified
7978 name; NameSpace.extend is superceded by context dependent
7979 Sign.declare_name. Several theory and proof context operations modify
7980 the naming context. Especially note Theory.restore_naming and
7981 ProofContext.restore_naming to get back to a sane state; note that
7982 Theory.add_path is no longer sufficient to recover from
7983 Theory.absolute_path in particular.
7985 * Pure: new flags short_names (default false) and unique_names
7986 (default true) for controlling output of qualified names. If
7987 short_names is set, names are printed unqualified. If unique_names is
7988 reset, the name prefix is reduced to the minimum required to achieve
7989 the original result when interning again, even if there is an overlap
7990 with earlier declarations.
7992 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
7993 now 'extend', and 'merge' gets an additional Pretty.pp argument
7994 (useful for printing error messages). INCOMPATIBILITY.
7996 * Pure: major reorganization of the theory context. Type Sign.sg and
7997 Theory.theory are now identified, referring to the universal
7998 Context.theory (see Pure/context.ML). Actual signature and theory
7999 content is managed as theory data. The old code and interfaces were
8000 spread over many files and structures; the new arrangement introduces
8001 considerable INCOMPATIBILITY to gain more clarity:
8003 Context -- theory management operations (name, identity, inclusion,
8004 parents, ancestors, merge, etc.), plus generic theory data;
8006 Sign -- logical signature and syntax operations (declaring consts,
8007 types, etc.), plus certify/read for common entities;
8009 Theory -- logical theory operations (stating axioms, definitions,
8010 oracles), plus a copy of logical signature operations (consts,
8011 types, etc.); also a few basic management operations (Theory.copy,
8014 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
8015 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
8016 for convenience -- they merely return the theory.
8018 * Pure: type Type.tsig is superceded by theory in most interfaces.
8020 * Pure: the Isar proof context type is already defined early in Pure
8021 as Context.proof (note that ProofContext.context and Proof.context are
8022 aliases, where the latter is the preferred name). This enables other
8023 Isabelle components to refer to that type even before Isar is present.
8025 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
8026 typeK, constK, axiomK, oracleK), but provide explicit operations for
8027 any of these kinds. For example, Sign.intern typeK is now
8028 Sign.intern_type, Theory.hide_space Sign.typeK is now
8029 Theory.hide_types. Also note that former
8030 Theory.hide_classes/types/consts are now
8031 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
8032 internalize their arguments! INCOMPATIBILITY.
8034 * Pure: get_thm interface (of PureThy and ProofContext) expects
8035 datatype thmref (with constructors Name and NameSelection) instead of
8036 plain string -- INCOMPATIBILITY;
8038 * Pure: cases produced by proof methods specify options, where NONE
8039 means to remove case bindings -- INCOMPATIBILITY in
8042 * Pure: the following operations retrieve axioms or theorems from a
8043 theory node or theory hierarchy, respectively:
8045 Theory.axioms_of: theory -> (string * term) list
8046 Theory.all_axioms_of: theory -> (string * term) list
8047 PureThy.thms_of: theory -> (string * thm) list
8048 PureThy.all_thms_of: theory -> (string * thm) list
8050 * Pure: print_tac now outputs the goal through the trace channel.
8052 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
8053 Reference Toplevel.debug (default false) controls detailed printing
8054 and tracing of low-level exceptions; Toplevel.profiling (default 0)
8055 controls execution profiling -- set to 1 for time and 2 for space
8056 (both increase the runtime).
8058 * Isar session: The initial use of ROOT.ML is now always timed,
8059 i.e. the log will show the actual process times, in contrast to the
8060 elapsed wall-clock time that the outer shell wrapper produces.
8062 * Simplifier: improved handling of bound variables (nameless
8063 representation, avoid allocating new strings). Simprocs that invoke
8064 the Simplifier recursively should use Simplifier.inherit_bounds to
8065 avoid local name clashes. Failure to do so produces warnings
8066 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
8067 for further details.
8069 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
8070 bindings for all theorems stored within a given theory; this may help
8071 in porting non-Isar theories to Isar ones, while keeping ML proof
8072 scripts for the time being.
8074 * ML operator HTML.with_charset specifies the charset begin used for
8075 generated HTML files. For example:
8077 HTML.with_charset "utf-8" use_thy "Hebrew";
8078 HTML.with_charset "utf-8" use_thy "Chinese";
8083 * Allow symlinks to all proper Isabelle executables (Isabelle,
8084 isabelle, isatool etc.).
8086 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
8087 isatool doc, isatool mkdir, display_drafts etc.).
8089 * isatool usedir: option -f allows specification of the ML file to be
8090 used by Isabelle; default is ROOT.ML.
8092 * New isatool version outputs the version identifier of the Isabelle
8093 distribution being used.
8095 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
8096 (containing Boolean satisfiability problems) into Isabelle/HOL
8101 New in Isabelle2004 (April 2004)
8102 --------------------------------
8106 * Provers/order.ML: new efficient reasoner for partial and linear orders.
8107 Replaces linorder.ML.
8109 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
8110 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
8111 (\<a>...\<z>), are now considered normal letters, and can therefore
8112 be used anywhere where an ASCII letter (a...zA...Z) has until
8113 now. COMPATIBILITY: This obviously changes the parsing of some
8114 terms, especially where a symbol has been used as a binder, say
8115 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
8116 as an identifier. Fix it by inserting a space around former
8117 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
8118 existing theory and ML files.
8120 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
8122 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
8123 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
8124 a normal (but invisible) letter. For multiple letter subscripts repeat
8125 \<^isub> like this: x\<^isub>1\<^isub>2.
8127 * Pure: There are now sub-/superscripts that can span more than one
8128 character. Text between \<^bsub> and \<^esub> is set in subscript in
8129 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
8130 superscript. The new control characters are not identifier parts.
8132 * Pure: Control-symbols of the form \<^raw:...> will literally print the
8133 content of "..." to the latex file instead of \isacntrl... . The "..."
8134 may consist of any printable characters excluding the end bracket >.
8136 * Pure: Using new Isar command "finalconsts" (or the ML functions
8137 Theory.add_finals or Theory.add_finals_i) it is now possible to
8138 declare constants "final", which prevents their being given a definition
8139 later. It is useful for constants whose behaviour is fixed axiomatically
8140 rather than definitionally, such as the meta-logic connectives.
8142 * Pure: 'instance' now handles general arities with general sorts
8143 (i.e. intersections of classes),
8145 * Presentation: generated HTML now uses a CSS style sheet to make layout
8146 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
8147 It can be changed to alter the colors/layout of generated pages.
8152 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
8153 cut_tac, subgoal_tac and thin_tac:
8154 - Now understand static (Isar) contexts. As a consequence, users of Isar
8155 locales are no longer forced to write Isar proof scripts.
8156 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
8158 - INCOMPATIBILITY: names of variables to be instantiated may no
8159 longer be enclosed in quotes. Instead, precede variable name with `?'.
8160 This is consistent with the instantiation attribute "where".
8162 * Attributes "where" and "of":
8163 - Now take type variables of instantiated theorem into account when reading
8164 the instantiation string. This fixes a bug that caused instantiated
8165 theorems to have too special types in some circumstances.
8166 - "where" permits explicit instantiations of type variables.
8168 * Calculation commands "moreover" and "also" no longer interfere with
8169 current facts ("this"), admitting arbitrary combinations with "then"
8173 - Goal statements involving the context element "includes" no longer
8174 generate theorems with internal delta predicates (those ending on
8175 "_axioms") in the premise.
8176 Resolve particular premise with <locale>.intro to obtain old form.
8177 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
8178 specification and "includes" elements in goal statement.
8179 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
8180 [intro?] and [elim?] (respectively) by default.
8181 - Experimental command for instantiation of locales in proof contexts:
8182 instantiate <label>[<attrs>]: <loc>
8183 Instantiates locale <loc> and adds all its theorems to the current context
8184 taking into account their attributes. Label and attrs are optional
8185 modifiers, like in theorem declarations. If present, names of
8186 instantiated theorems are qualified with <label>, and the attributes
8187 <attrs> are applied after any attributes these theorems might have already.
8188 If the locale has assumptions, a chained fact of the form
8189 "<loc> t1 ... tn" is expected from which instantiations of the parameters
8190 are derived. The command does not support old-style locales declared
8191 with "locale (open)".
8192 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
8194 * HOL: Tactic emulation methods induct_tac and case_tac understand static
8200 * Proof import: new image HOL4 contains the imported library from
8201 the HOL4 system with about 2500 theorems. It is imported by
8202 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
8203 can be used like any other Isabelle image. See
8204 HOL/Import/HOL/README for more information.
8207 - Much improved handling of linear and partial orders.
8208 Reasoners for linear and partial orders are set up for type classes
8209 "linorder" and "order" respectively, and are added to the default simpset
8210 as solvers. This means that the simplifier can build transitivity chains
8211 to solve goals from the assumptions.
8212 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
8213 of blast or auto after simplification become unnecessary because the goal
8214 is solved by simplification already.
8216 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
8217 all proved in axiomatic type classes for semirings, rings and fields.
8220 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
8221 now formalized using the Ring_and_Field theory mentioned above.
8222 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
8223 than before, because now they are set up once in a generic manner.
8224 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
8225 Look for the general versions in Ring_and_Field (and Power if they concern
8228 * Type "rat" of the rational numbers is now available in HOL-Complex.
8231 - Record types are now by default printed with their type abbreviation
8232 instead of the list of all field types. This can be configured via
8233 the reference "print_record_type_abbr".
8234 - Simproc "record_upd_simproc" for simplification of multiple updates added
8235 (not enabled by default).
8236 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
8237 EX x. x = sel r to True (not enabled by default).
8238 - Tactic "record_split_simp_tac" to split and simplify records added.
8240 * 'specification' command added, allowing for definition by
8241 specification. There is also an 'ax_specification' command that
8242 introduces the new constants axiomatically.
8244 * arith(_tac) is now able to generate counterexamples for reals as well.
8246 * HOL-Algebra: new locale "ring" for non-commutative rings.
8248 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
8249 definitions, thanks to Sava Krsti\'{c} and John Matthews.
8251 * HOL-Matrix: a first theory for matrices in HOL with an application of
8252 matrix theory to linear programming.
8254 * Unions and Intersections:
8255 The latex output syntax of UN and INT has been changed
8256 from "\Union x \in A. B" to "\Union_{x \in A} B"
8257 i.e. the index formulae has become a subscript.
8258 Similarly for "\Union x. B", and for \Inter instead of \Union.
8260 * Unions and Intersections over Intervals:
8261 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
8262 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
8263 like in normal math, and corresponding versions for < and for intersection.
8265 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
8266 lexicographic dictonary ordering has been added as "lexord".
8268 * ML: the legacy theory structures Int and List have been removed. They had
8269 conflicted with ML Basis Library structures having the same names.
8271 * 'refute' command added to search for (finite) countermodels. Only works
8272 for a fragment of HOL. The installation of an external SAT solver is
8273 highly recommended. See "HOL/Refute.thy" for details.
8275 * 'quickcheck' command: Allows to find counterexamples by evaluating
8276 formulae under an assignment of free variables to random values.
8277 In contrast to 'refute', it can deal with inductive datatypes,
8278 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
8284 * Streams now come with concatenation and are part of the HOLCF image
8288 New in Isabelle2003 (May 2003)
8289 ------------------------------
8293 * Provers/simplifier:
8295 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
8296 Assumptions are now subject to complete mutual simplification,
8297 not just from left to right. The simplifier now preserves
8298 the order of assumptions.
8300 Potential INCOMPATIBILITY:
8302 -- simp sometimes diverges where the old version did
8303 not, e.g. invoking simp on the goal
8305 [| P (f x); y = x; f x = f y |] ==> Q
8307 now gives rise to the infinite reduction sequence
8309 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
8311 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
8314 -- Tactics combining classical reasoner and simplification (such as auto)
8315 are also affected by this change, because many of them rely on
8316 simp. They may sometimes diverge as well or yield a different numbers
8317 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
8318 in case of problems. Sometimes subsequent calls to the classical
8319 reasoner will fail because a preceeding call to the simplifier too
8320 eagerly simplified the goal, e.g. deleted redundant premises.
8322 - The simplifier trace now shows the names of the applied rewrite rules
8324 - You can limit the number of recursive invocations of the simplifier
8325 during conditional rewriting (where the simplifie tries to solve the
8326 conditions before applying the rewrite rule):
8327 ML "simp_depth_limit := n"
8328 where n is an integer. Thus you can force termination where previously
8329 the simplifier would diverge.
8331 - Accepts free variables as head terms in congruence rules. Useful in Isar.
8333 - No longer aborts on failed congruence proof. Instead, the
8334 congruence is ignored.
8336 * Pure: New generic framework for extracting programs from constructive
8337 proofs. See HOL/Extraction.thy for an example instantiation, as well
8338 as HOL/Extraction for some case studies.
8340 * Pure: The main goal of the proof state is no longer shown by default, only
8341 the subgoals. This behaviour is controlled by a new flag.
8342 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
8343 (ML: Proof.show_main_goal).
8345 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
8346 rules whose conclusion matches subgoal 1:
8347 PG menu: Isabelle/Isar -> Show me -> matching rules
8348 The rules are ordered by how closely they match the subgoal.
8349 In particular, rules that solve a subgoal outright are displayed first
8350 (or rather last, the way they are printed).
8351 (ML: ProofGeneral.print_intros())
8353 * Pure: New flag trace_unify_fail causes unification to print
8354 diagnostic information (PG: in trace buffer) when it fails. This is
8355 useful for figuring out why single step proofs like rule, erule or
8358 * Pure: Locale specifications now produce predicate definitions
8359 according to the body of text (covering assumptions modulo local
8360 definitions); predicate "loc_axioms" covers newly introduced text,
8361 while "loc" is cumulative wrt. all included locale expressions; the
8362 latter view is presented only on export into the global theory
8363 context; potential INCOMPATIBILITY, use "(open)" option to fall back
8364 on the old view without predicates;
8366 * Pure: predefined locales "var" and "struct" are useful for sharing
8367 parameters (as in CASL, for example); just specify something like
8368 ``var x + var y + struct M'' as import;
8370 * Pure: improved thms_containing: proper indexing of facts instead of
8371 raw theorems; check validity of results wrt. current name space;
8372 include local facts of proof configuration (also covers active
8373 locales), cover fixed variables in index; may use "_" in term
8374 specification; an optional limit for the number of printed facts may
8375 be given (the default is 40);
8377 * Pure: disallow duplicate fact bindings within new-style theory files
8380 * Provers: improved induct method: assumptions introduced by case
8381 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
8382 the goal statement); "foo" still refers to all facts collectively;
8384 * Provers: the function blast.overloaded has been removed: all constants
8385 are regarded as potentially overloaded, which improves robustness in exchange
8386 for slight decrease in efficiency;
8388 * Provers/linorder: New generic prover for transitivity reasoning over
8389 linear orders. Note: this prover is not efficient!
8391 * Isar: preview of problems to finish 'show' now produce an error
8392 rather than just a warning (in interactive mode);
8399 - Produces a counter example if it cannot prove a goal.
8400 Note that the counter example may be spurious if the goal is not a formula
8401 of quantifier-free linear arithmetic.
8402 In ProofGeneral the counter example appears in the trace buffer.
8404 - Knows about div k and mod k where k is a numeral of type nat or int.
8406 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
8407 linear arithmetic fails. This takes account of quantifiers and divisibility.
8408 Presburger arithmetic can also be called explicitly via presburger(_tac).
8410 * simp's arithmetic capabilities have been enhanced a bit: it now
8411 takes ~= in premises into account (by performing a case split);
8413 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
8414 are distributed over a sum of terms;
8416 * New tactic "trans_tac" and method "trans" instantiate
8417 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
8420 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
8421 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
8423 * 'typedef' command has new option "open" to suppress the set
8426 * functions Min and Max on finite sets have been introduced (theory
8429 * attribute [symmetric] now works for relations as well; it turns
8430 (x,y) : R^-1 into (y,x) : R, and vice versa;
8432 * induct over a !!-quantified statement (say !!x1..xn):
8433 each "case" automatically performs "fix x1 .. xn" with exactly those names.
8435 * Map: `empty' is no longer a constant but a syntactic abbreviation for
8436 %x. None. Warning: empty_def now refers to the previously hidden definition
8439 * Algebra: formalization of classical algebra. Intended as base for
8440 any algebraic development in Isabelle. Currently covers group theory
8441 (up to Sylow's theorem) and ring theory (Universal Property of
8442 Univariate Polynomials). Contributions welcome;
8444 * GroupTheory: deleted, since its material has been moved to Algebra;
8446 * Complex: new directory of the complex numbers with numeric constants,
8447 nonstandard complex numbers, and some complex analysis, standard and
8448 nonstandard (Jacques Fleuriot);
8450 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
8452 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
8455 * Real/HahnBanach: updated and adapted to locales;
8457 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
8460 * UNITY: added the Meier-Sanders theory of progress sets;
8462 * MicroJava: bytecode verifier and lightweight bytecode verifier
8463 as abstract algorithms, instantiated to the JVM;
8465 * Bali: Java source language formalization. Type system, operational
8466 semantics, axiomatic semantics. Supported language features:
8467 classes, interfaces, objects,virtual methods, static methods,
8468 static/instance fields, arrays, access modifiers, definite
8469 assignment, exceptions.
8474 * ZF/Constructible: consistency proof for AC (Gdel's constructible
8477 * Main ZF: virtually all theories converted to new-style format;
8482 * Pure: Tactic.prove provides sane interface for internal proofs;
8483 omits the infamous "standard" operation, so this is more appropriate
8484 than prove_goalw_cterm in many situations (e.g. in simprocs);
8486 * Pure: improved error reporting of simprocs;
8488 * Provers: Simplifier.simproc(_i) provides sane interface for setting
8492 *** Document preparation ***
8494 * uses \par instead of \\ for line breaks in theory text. This may
8495 shift some page breaks in large documents. To get the old behaviour
8496 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
8498 * minimized dependencies of isabelle.sty and isabellesym.sty on
8501 * \<euro> now needs package babel/greek instead of marvosym (which
8504 * normal size for \<zero>...\<nine> (uses \mathbf instead of
8509 New in Isabelle2002 (March 2002)
8510 --------------------------------
8512 *** Document preparation ***
8514 * greatly simplified document preparation setup, including more
8515 graceful interpretation of isatool usedir -i/-d/-D options, and more
8516 instructive isatool mkdir; users should basically be able to get
8517 started with "isatool mkdir HOL Test && isatool make"; alternatively,
8518 users may run a separate document processing stage manually like this:
8519 "isatool usedir -D output HOL Test && isatool document Test/output";
8521 * theory dependency graph may now be incorporated into documents;
8522 isatool usedir -g true will produce session_graph.eps/.pdf for use
8523 with \includegraphics of LaTeX;
8525 * proper spacing of consecutive markup elements, especially text
8526 blocks after section headings;
8528 * support bold style (for single symbols only), input syntax is like
8529 this: "\<^bold>\<alpha>" or "\<^bold>A";
8531 * \<bullet> is now output as bold \cdot by default, which looks much
8532 better in printed text;
8534 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
8535 note that these symbols are currently unavailable in Proof General /
8536 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
8538 * isatool latex no longer depends on changed TEXINPUTS, instead
8539 isatool document copies the Isabelle style files to the target
8545 * Pure/Provers: improved proof by cases and induction;
8546 - 'case' command admits impromptu naming of parameters (such as
8548 - 'induct' method divinates rule instantiation from the inductive
8549 claim; no longer requires excessive ?P bindings for proper
8550 instantiation of cases;
8551 - 'induct' method properly enumerates all possibilities of set/type
8552 rules; as a consequence facts may be also passed through *type*
8553 rules without further ado;
8554 - 'induct' method now derives symbolic cases from the *rulified*
8555 rule (before it used to rulify cases stemming from the internal
8556 atomized version); this means that the context of a non-atomic
8557 statement becomes is included in the hypothesis, avoiding the
8558 slightly cumbersome show "PROP ?case" form;
8559 - 'induct' may now use elim-style induction rules without chaining
8560 facts, using ``missing'' premises from the goal state; this allows
8561 rules stemming from inductive sets to be applied in unstructured
8562 scripts, while still benefitting from proper handling of non-atomic
8563 statements; NB: major inductive premises need to be put first, all
8564 the rest of the goal is passed through the induction;
8565 - 'induct' proper support for mutual induction involving non-atomic
8566 rule statements (uses the new concept of simultaneous goals, see
8568 - append all possible rule selections, but only use the first
8569 success (no backtracking);
8570 - removed obsolete "(simplified)" and "(stripped)" options of methods;
8571 - undeclared rule case names default to numbers 1, 2, 3, ...;
8572 - added 'print_induct_rules' (covered by help item in recent Proof
8574 - moved induct/cases attributes to Pure, methods to Provers;
8575 - generic method setup instantiated for FOL and HOL;
8577 * Pure: support multiple simultaneous goal statements, for example
8578 "have a: A and b: B" (same for 'theorem' etc.); being a pure
8579 meta-level mechanism, this acts as if several individual goals had
8580 been stated separately; in particular common proof methods need to be
8581 repeated in order to cover all claims; note that a single elimination
8582 step is *not* sufficient to establish the two conjunctions, so this
8585 assume "A & B" then have A and B .. (*".." fails*)
8587 better use "obtain" in situations as above; alternative refer to
8588 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
8590 * Pure: proper integration with ``locales''; unlike the original
8591 version by Florian Kammller, Isar locales package high-level proof
8592 contexts rather than raw logical ones (e.g. we admit to include
8593 attributes everywhere); operations on locales include merge and
8594 rename; support for implicit arguments (``structures''); simultaneous
8595 type-inference over imports and text; see also HOL/ex/Locales.thy for
8598 * Pure: the following commands have been ``localized'', supporting a
8599 target locale specification "(in name)": 'lemma', 'theorem',
8600 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
8601 stored both within the locale and at the theory level (exported and
8602 qualified by the locale name);
8604 * Pure: theory goals may now be specified in ``long'' form, with
8605 ad-hoc contexts consisting of arbitrary locale elements. for example
8606 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
8607 definitions may be given, too); the result is a meta-level rule with
8608 the context elements being discharged in the obvious way;
8610 * Pure: new proof command 'using' allows to augment currently used
8611 facts after a goal statement ('using' is syntactically analogous to
8612 'apply', but acts on the goal's facts only); this allows chained facts
8613 to be separated into parts given before and after a claim, as in
8614 ``from a and b have C using d and e <proof>'';
8616 * Pure: renamed "antecedent" case to "rule_context";
8618 * Pure: new 'judgment' command records explicit information about the
8619 object-logic embedding (used by several tools internally); no longer
8620 use hard-wired "Trueprop";
8622 * Pure: added 'corollary' command;
8624 * Pure: fixed 'token_translation' command;
8626 * Pure: removed obsolete 'exported' attribute;
8628 * Pure: dummy pattern "_" in is/let is now automatically lifted over
8629 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
8630 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
8632 * Pure: method 'atomize' presents local goal premises as object-level
8633 statements (atomic meta-level propositions); setup controlled via
8634 rewrite rules declarations of 'atomize' attribute; example
8635 application: 'induct' method with proper rule statements in improper
8638 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
8639 now consider the syntactic context of assumptions, giving a better
8640 chance to get type-inference of the arguments right (this is
8641 especially important for locales);
8643 * Pure: "sorry" no longer requires quick_and_dirty in interactive
8646 * Pure/obtain: the formal conclusion "thesis", being marked as
8647 ``internal'', may no longer be reference directly in the text;
8648 potential INCOMPATIBILITY, may need to use "?thesis" in rare
8651 * Pure: generic 'sym' attribute which declares a rule both as pure
8652 'elim?' and for the 'symmetric' operation;
8654 * Pure: marginal comments ``--'' may now occur just anywhere in the
8655 text; the fixed correlation with particular command syntax has been
8658 * Pure: new method 'rules' is particularly well-suited for proof
8659 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
8660 but often produces more compact proof terms with less detours;
8662 * Pure/Provers/classical: simplified integration with pure rule
8663 attributes and methods; the classical "intro?/elim?/dest?"
8664 declarations coincide with the pure ones; the "rule" method no longer
8665 includes classically swapped intros; "intro" and "elim" methods no
8666 longer pick rules from the context; also got rid of ML declarations
8667 AddXIs/AddXEs/AddXDs; all of this has some potential for
8670 * Provers/classical: attribute 'swapped' produces classical inversions
8671 of introduction rules;
8673 * Provers/simplifier: 'simplified' attribute may refer to explicit
8674 rules instead of full simplifier context; 'iff' attribute handles
8677 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
8679 * HOL: 'recdef' now fails on unfinished automated proofs, use
8680 "(permissive)" option to recover old behavior;
8682 * HOL: 'inductive' no longer features separate (collective) attributes
8683 for 'intros' (was found too confusing);
8685 * HOL: properly declared induction rules less_induct and
8691 * HOL: moved over to sane numeral syntax; the new policy is as
8694 - 0 and 1 are polymorphic constants, which are defined on any
8695 numeric type (nat, int, real etc.);
8697 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
8698 binary representation internally;
8700 - type nat has special constructor Suc, and generally prefers Suc 0
8701 over 1::nat and Suc (Suc 0) over 2::nat;
8703 This change may cause significant problems of INCOMPATIBILITY; here
8704 are some hints on converting existing sources:
8706 - due to the new "num" token, "-0" and "-1" etc. are now atomic
8707 entities, so expressions involving "-" (unary or binary minus) need
8708 to be spaced properly;
8710 - existing occurrences of "1" may need to be constraint "1::nat" or
8711 even replaced by Suc 0; similar for old "2";
8713 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
8715 - remove all special provisions on numerals in proofs;
8717 * HOL: simp rules nat_number expand numerals on nat to Suc/0
8718 representation (depends on bin_arith_simps in the default context);
8720 * HOL: symbolic syntax for x^2 (numeral 2);
8722 * HOL: the class of all HOL types is now called "type" rather than
8723 "term"; INCOMPATIBILITY, need to adapt references to this type class
8724 in axclass/classes, instance/arities, and (usually rare) occurrences
8725 in typings (of consts etc.); internally the class is called
8726 "HOL.type", ML programs should refer to HOLogic.typeS;
8728 * HOL/record package improvements:
8729 - new derived operations "fields" to build a partial record section,
8730 "extend" to promote a fixed record to a record scheme, and
8731 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
8732 declared as simp by default;
8733 - shared operations ("more", "fields", etc.) now need to be always
8734 qualified) --- potential INCOMPATIBILITY;
8735 - removed "make_scheme" operations (use "make" with "extend") --
8737 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
8738 - provides cases/induct rules for use with corresponding Isar
8739 methods (for concrete records, record schemes, concrete more
8740 parts, and schematic more parts -- in that order);
8741 - internal definitions directly based on a light-weight abstract
8742 theory of product types over typedef rather than datatype;
8744 * HOL: generic code generator for generating executable ML code from
8745 specifications; specific support for HOL constructs such as inductive
8746 datatypes and sets, as well as recursive functions; can be invoked
8747 via 'generate_code' theory section;
8749 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
8751 * HOL: consolidated and renamed several theories. In particular:
8752 Ord.thy has been absorbed into HOL.thy
8753 String.thy has been absorbed into List.thy
8755 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
8756 (beware of argument permutation!);
8758 * HOL: linorder_less_split superseded by linorder_cases;
8760 * HOL/List: "nodups" renamed to "distinct";
8762 * HOL: added "The" definite description operator; move Hilbert's "Eps"
8763 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
8764 - Ex_def has changed, now need to use some_eq_ex
8766 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
8767 in this (rare) case use:
8769 delSWrapper "split_all_tac"
8770 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
8772 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
8775 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
8776 Isabelle's type classes, ^ on functions and relations has too general
8777 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
8778 necessary to attach explicit type constraints;
8780 * HOL/Relation: the prefix name of the infix "O" has been changed from
8781 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
8782 renamed accordingly (eg "compI" -> "rel_compI").
8784 * HOL: syntax translations now work properly with numerals and records
8787 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
8788 of "lam" -- INCOMPATIBILITY;
8790 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
8791 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
8792 renamed "Product_Type.unit";
8794 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
8796 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
8797 the "cases" method);
8799 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
8802 * HOL/IMP: updated and converted to new-style theory format; several
8803 parts turned into readable document, with proper Isar proof texts and
8804 some explanations (by Gerwin Klein);
8806 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
8808 * HOL-Hyperreal is now a logic image;
8813 * Isar: consts/constdefs supports mixfix syntax for continuous
8816 * Isar: domain package adapted to new-style theory format, e.g. see
8819 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
8820 potential INCOMPATIBILITY; now use plain induct_tac instead of former
8821 lift.induct_tac, always use UU instead of Undef;
8823 * HOLCF/IMP: updated and converted to new-style theory;
8828 * Isar: proper integration of logic-specific tools and packages,
8829 including theory commands '(co)inductive', '(co)datatype',
8830 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
8831 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
8833 * theory Main no longer includes AC; for the Axiom of Choice, base
8834 your theory on Main_ZFC;
8836 * the integer library now covers quotients and remainders, with many
8837 laws relating division to addition, multiplication, etc.;
8839 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
8840 typeless version of the formalism;
8842 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
8845 * ZF/Induct: new directory for examples of inductive definitions,
8846 including theory Multiset for multiset orderings; converted to
8847 new-style theory format;
8849 * ZF: many new theorems about lists, ordinals, etc.;
8854 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
8855 variable proof controls level of detail: 0 = no proofs (only oracle
8856 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
8857 also ref manual for further ML interfaces;
8859 * Pure/axclass: removed obsolete ML interface
8860 goal_subclass/goal_arity;
8862 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
8863 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
8864 separate tokens, so expressions involving minus need to be spaced
8867 * Pure/syntax: support non-oriented infixes, using keyword "infix"
8868 rather than "infixl" or "infixr";
8870 * Pure/syntax: concrete syntax for dummy type variables admits genuine
8871 sort constraint specifications in type inference; e.g. "x::_::foo"
8872 ensures that the type of "x" is of sort "foo" (but not necessarily a
8875 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
8876 control output of nested => (types); the default behavior is
8879 * Pure/syntax: builtin parse translation for "_constify" turns valued
8880 tokens into AST constants;
8882 * Pure/syntax: prefer later declarations of translations and print
8883 translation functions; potential INCOMPATIBILITY: need to reverse
8884 multiple declarations for same syntax element constant;
8886 * Pure/show_hyps reset by default (in accordance to existing Isar
8889 * Provers/classical: renamed addaltern to addafter, addSaltern to
8892 * Provers/clasimp: ``iff'' declarations now handle conditional rules
8895 * system: tested support for MacOS X; should be able to get Isabelle +
8896 Proof General to work in a plain Terminal after installing Poly/ML
8897 (e.g. from the Isabelle distribution area) and GNU bash alone
8898 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
8899 support requires further installations, e.g. from
8900 http://fink.sourceforge.net/);
8902 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
8904 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
8905 of 40 MB), cf. ML_OPTIONS;
8907 * system: Proof General keywords specification is now part of the
8908 Isabelle distribution (see etc/isar-keywords.el);
8910 * system: support for persistent Proof General sessions (refrain from
8911 outdating all loaded theories on startup); user may create writable
8912 logic images like this: ``isabelle -q HOL Test'';
8914 * system: smart selection of Isabelle process versus Isabelle
8915 interface, accommodates case-insensitive file systems (e.g. HFS+); may
8916 run both "isabelle" and "Isabelle" even if file names are badly
8917 damaged (executable inspects the case of the first letter of its own
8918 name); added separate "isabelle-process" and "isabelle-interface";
8920 * system: refrain from any attempt at filtering input streams; no
8921 longer support ``8bit'' encoding of old isabelle font, instead proper
8922 iso-latin characters may now be used; the related isatools
8923 "symbolinput" and "nonascii" have disappeared as well;
8925 * system: removed old "xterm" interface (the print modes "xterm" and
8926 "xterm_color" are still available for direct use in a suitable
8931 New in Isabelle99-2 (February 2001)
8932 -----------------------------------
8934 *** Overview of INCOMPATIBILITIES ***
8936 * HOL: please note that theories in the Library and elsewhere often use the
8937 new-style (Isar) format; to refer to their theorems in an ML script you must
8938 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
8940 * HOL: inductive package no longer splits induction rule aggressively,
8941 but only as far as specified by the introductions given; the old
8942 format may be recovered via ML function complete_split_rule or attribute
8943 'split_rule (complete)';
8945 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
8946 gfp_Tarski to gfp_unfold;
8948 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
8950 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
8951 relation); infix "^^" has been renamed "``"; infix "``" has been
8952 renamed "`"; "univalent" has been renamed "single_valued";
8954 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
8957 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
8959 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
8961 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
8962 consequence, it is no longer monotonic wrt. the local goal context
8963 (which is now passed through the inductive cases);
8965 * Document preparation: renamed standard symbols \<ll> to \<lless> and
8966 \<gg> to \<ggreater>;
8969 *** Document preparation ***
8971 * \isabellestyle{NAME} selects version of Isabelle output (currently
8972 available: are "it" for near math-mode best-style output, "sl" for
8973 slanted text style, and "tt" for plain type-writer; if no
8974 \isabellestyle command is given, output is according to slanted
8977 * support sub/super scripts (for single symbols only), input syntax is
8978 like this: "A\<^sup>*" or "A\<^sup>\<star>";
8980 * some more standard symbols; see Appendix A of the system manual for
8981 the complete list of symbols defined in isabellesym.sty;
8983 * improved isabelle style files; more abstract symbol implementation
8984 (should now use \isamath{...} and \isatext{...} in custom symbol
8987 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
8988 state; Note that presentation of goal states does not conform to
8989 actual human-readable proof documents. Please do not include goal
8990 states into document output unless you really know what you are doing!
8992 * proper indentation of antiquoted output with proportional LaTeX
8995 * no_document ML operator temporarily disables LaTeX document
8998 * isatool unsymbolize tunes sources for plain ASCII communication;
9003 * Pure: Isar now suffers initial goal statements to contain unbound
9004 schematic variables (this does not conform to actual readable proof
9005 documents, due to unpredictable outcome and non-compositional proof
9006 checking); users who know what they are doing may use schematic goals
9007 for Prolog-style synthesis of proven results;
9009 * Pure: assumption method (an implicit finishing) now handles actual
9012 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
9013 initial goal, declare "that" only as Pure intro (only for single
9014 steps); the "that" rule assumption may now be involved in implicit
9015 finishing, thus ".." becomes a feasible for trivial obtains;
9017 * Pure: default proof step now includes 'intro_classes'; thus trivial
9018 instance proofs may be performed by "..";
9020 * Pure: ?thesis / ?this / "..." now work for pure meta-level
9023 * Pure: more robust selection of calculational rules;
9025 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
9026 rule (as well as the assumption rule);
9028 * Pure: 'thm_deps' command visualizes dependencies of theorems and
9029 lemmas, using the graph browser tool;
9031 * Pure: predict failure of "show" in interactive mode;
9033 * Pure: 'thms_containing' now takes actual terms as arguments;
9035 * HOL: improved method 'induct' --- now handles non-atomic goals
9036 (potential INCOMPATIBILITY); tuned error handling;
9038 * HOL: cases and induct rules now provide explicit hints about the
9039 number of facts to be consumed (0 for "type" and 1 for "set" rules);
9040 any remaining facts are inserted into the goal verbatim;
9042 * HOL: local contexts (aka cases) may now contain term bindings as
9043 well; the 'cases' and 'induct' methods new provide a ?case binding for
9044 the result to be shown in each case;
9046 * HOL: added 'recdef_tc' command;
9048 * isatool convert assists in eliminating legacy ML scripts;
9053 * HOL/Library: a collection of generic theories to be used together
9054 with main HOL; the theory loader path already includes this directory
9055 by default; the following existing theories have been moved here:
9056 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
9057 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
9059 * HOL/Unix: "Some aspects of Unix file-system security", a typical
9060 modelling and verification task performed in Isabelle/HOL +
9061 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
9063 * HOL/Algebra: special summation operator SUM no longer exists, it has
9064 been replaced by setsum; infix 'assoc' now has priority 50 (like
9065 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
9066 'domain', this makes the theory consistent with mathematical
9069 * HOL basics: added overloaded operations "inverse" and "divide"
9070 (infix "/"), syntax for generic "abs" operation, generic summation
9073 * HOL/typedef: simplified package, provide more useful rules (see also
9076 * HOL/datatype: induction rule for arbitrarily branching datatypes is
9077 now expressed as a proper nested rule (old-style tactic scripts may
9078 require atomize_strip_tac to cope with non-atomic premises);
9080 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
9081 to "split_conv" (old name still available for compatibility);
9083 * HOL: improved concrete syntax for strings (e.g. allows translation
9084 rules with string literals);
9086 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
9087 and Fleuriot's mechanization of analysis, including the transcendental
9088 functions for the reals;
9090 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
9095 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
9096 "lam" is displayed as TWO lambda-symbols
9098 * CTT: theory Main now available, containing everything (that is, Bool
9104 * Pure: the Simplifier has been implemented properly as a derived rule
9105 outside of the actual kernel (at last!); the overall performance
9106 penalty in practical applications is about 50%, while reliability of
9107 the Isabelle inference kernel has been greatly improved;
9109 * print modes "brackets" and "no_brackets" control output of nested =>
9110 (types) and ==> (props); the default behaviour is "brackets";
9112 * Provers: fast_tac (and friends) now handle actual object-logic rules
9113 as assumptions as well;
9115 * system: support Poly/ML 4.0;
9117 * system: isatool install handles KDE version 1 or 2;
9121 New in Isabelle99-1 (October 2000)
9122 ----------------------------------
9124 *** Overview of INCOMPATIBILITIES ***
9126 * HOL: simplification of natural numbers is much changed; to partly
9127 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
9128 issue the following ML commands:
9130 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
9131 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
9133 * HOL: simplification no longer dives into case-expressions; this is
9134 controlled by "t.weak_case_cong" for each datatype t;
9136 * HOL: nat_less_induct renamed to less_induct;
9138 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
9139 fixsome to patch .thy and .ML sources automatically;
9141 select_equality -> some_equality
9142 select_eq_Ex -> some_eq_ex
9143 selectI2EX -> someI2_ex
9146 select1_equality -> some1_equality
9147 Eps_sym_eq -> some_sym_eq_trivial
9148 Eps_eq -> some_eq_trivial
9150 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
9152 * HOL: removed obsolete theorem binding expand_if (refer to split_if
9155 * HOL: the recursion equations generated by 'recdef' are now called
9156 f.simps instead of f.rules;
9158 * HOL: qed_spec_mp now also handles bounded ALL as well;
9160 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
9161 sometimes be needed;
9163 * HOL: the constant for "f``x" is now "image" rather than "op ``";
9165 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
9167 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
9168 product is now "<*>" instead of "Times"; the lexicographic product is
9169 now "<*lex*>" instead of "**";
9171 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
9172 of main HOL, but was unused); better use HOL's datatype package;
9174 * HOL: removed "symbols" syntax for constant "override" of theory Map;
9175 the old syntax may be recovered as follows:
9178 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
9179 (infixl "\\<oplus>" 100)
9181 * HOL/Real: "rabs" replaced by overloaded "abs" function;
9183 * HOL/ML: even fewer consts are declared as global (see theories Ord,
9184 Lfp, Gfp, WF); this only affects ML packages that refer to const names
9187 * HOL and ZF: syntax for quotienting wrt an equivalence relation
9188 changed from A/r to A//r;
9190 * ZF: new treatment of arithmetic (nat & int) may break some old
9193 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
9194 rulify -> rule_format, elimify -> elim_format, ...);
9196 * Isar/Provers: intro/elim/dest attributes changed; renamed
9197 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
9198 should have to change intro!! to intro? only); replaced "delrule" by
9201 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
9203 * Provers: strengthened force_tac by using new first_best_tac;
9205 * LaTeX document preparation: several changes of isabelle.sty (see
9209 *** Document preparation ***
9211 * formal comments (text blocks etc.) in new-style theories may now
9212 contain antiquotations of thm/prop/term/typ/text to be presented
9213 according to latex print mode; concrete syntax is like this:
9214 @{term[show_types] "f(x) = a + x"};
9216 * isatool mkdir provides easy setup of Isabelle session directories,
9217 including proper document sources;
9219 * generated LaTeX sources are now deleted after successful run
9220 (isatool document -c); may retain a copy somewhere else via -D option
9223 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
9224 style files, achieving self-contained LaTeX sources and simplifying
9227 * old-style theories now produce (crude) LaTeX output as well;
9229 * browser info session directories are now self-contained (may be put
9230 on WWW server seperately); improved graphs of nested sessions; removed
9231 graph for 'all sessions';
9233 * several improvements in isabelle style files; \isabellestyle{it}
9234 produces fake math mode output; \isamarkupheader is now \section by
9235 default; see lib/texinputs/isabelle.sty etc.;
9240 * Isar/Pure: local results and corresponding term bindings are now
9241 subject to Hindley-Milner polymorphism (similar to ML); this
9242 accommodates incremental type-inference very nicely;
9244 * Isar/Pure: new derived language element 'obtain' supports
9245 generalized existence reasoning;
9247 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
9248 support accumulation of results, without applying any rules yet;
9249 useful to collect intermediate results without explicit name
9250 references, and for use with transitivity rules with more than 2
9253 * Isar/Pure: scalable support for case-analysis type proofs: new
9254 'case' language element refers to local contexts symbolically, as
9255 produced by certain proof methods; internally, case names are attached
9256 to theorems as "tags";
9258 * Isar/Pure: theory command 'hide' removes declarations from
9259 class/type/const name spaces;
9261 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
9262 indicate potential overloading;
9264 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
9266 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
9267 "{a,b,c}" instead of {a,b,c};
9269 * Isar/Pure now provides its own version of intro/elim/dest
9270 attributes; useful for building new logics, but beware of confusion
9271 with the version in Provers/classical;
9273 * Isar/Pure: the local context of (non-atomic) goals is provided via
9274 case name 'antecedent';
9276 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
9277 to the current context is now done automatically);
9279 * Isar/Pure: theory command 'method_setup' provides a simple interface
9280 for definining proof methods in ML;
9282 * Isar/Provers: intro/elim/dest attributes changed; renamed
9283 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
9284 most cases, one should have to change intro!! to intro? only);
9285 replaced "delrule" by "rule del";
9287 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
9288 'symmetric' attribute (the latter supercedes [RS sym]);
9290 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
9291 method modifier); 'simp' method: 'only:' modifier removes loopers as
9292 well (including splits);
9294 * Isar/Provers: Simplifier and Classical methods now support all kind
9295 of modifiers used in the past, including 'cong', 'iff', etc.
9297 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
9298 of Simplifier and Classical reasoner);
9300 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
9301 now support named cases; major packages (inductive, datatype, primrec,
9302 recdef) support case names and properly name parameters;
9304 * Isar/HOL: new transitivity rules for substitution in inequalities --
9305 monotonicity conditions are extracted to be proven at end of
9308 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
9311 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
9312 split_if split_if_asm; datatype package provides theorems foo.splits =
9313 foo.split foo.split_asm for each datatype;
9315 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
9316 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
9317 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
9318 use "(cases (simplified))" method in proper proof texts);
9320 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
9322 * Isar: names of theorems etc. may be natural numbers as well;
9324 * Isar: 'pr' command: optional arguments for goals_limit and
9325 ProofContext.prems_limit; no longer prints theory contexts, but only
9328 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
9329 additional print modes to be specified; e.g. "pr(latex)" will print
9330 proof state according to the Isabelle LaTeX style;
9332 * Isar: improved support for emulating tactic scripts, including proof
9333 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
9334 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
9335 (for HOL datatypes);
9337 * Isar: simplified (more robust) goal selection of proof methods: 1st
9338 goal, all goals, or explicit goal specifier (tactic emulation); thus
9339 'proof method scripts' have to be in depth-first order;
9341 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
9343 * Isar: removed 'help' command, which hasn't been too helpful anyway;
9344 should instead use individual commands for printing items
9345 (print_commands, print_methods etc.);
9347 * Isar: added 'nothing' --- the empty list of theorems;
9352 * HOL/MicroJava: formalization of a fragment of Java, together with a
9353 corresponding virtual machine and a specification of its bytecode
9354 verifier and a lightweight bytecode verifier, including proofs of
9355 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
9356 Cornelia Pusch (see also the homepage of project Bali at
9357 http://isabelle.in.tum.de/Bali/);
9359 * HOL/Algebra: new theory of rings and univariate polynomials, by
9362 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
9363 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
9366 * HOL/Lattice: fundamental concepts of lattice theory and order
9367 structures, including duals, properties of bounds versus algebraic
9368 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
9369 Theorem for complete lattices etc.; may also serve as a demonstration
9370 for abstract algebraic reasoning using axiomatic type classes, and
9371 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
9373 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
9376 * HOL/IMPP: extension of IMP with local variables and mutually
9377 recursive procedures, by David von Oheimb;
9379 * HOL/Lambda: converted into new-style theory and document;
9381 * HOL/ex/Multiquote: example of multiple nested quotations and
9382 anti-quotations -- basically a generalized version of de-Bruijn
9383 representation; very useful in avoiding lifting of operations;
9385 * HOL/record: added general record equality rule to simpset; fixed
9386 select-update simplification procedure to handle extended records as
9387 well; admit "r" as field name;
9389 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
9390 other numeric types and also as the identity of groups, rings, etc.;
9392 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
9393 Types nat and int belong to this axclass;
9395 * HOL: greatly improved simplification involving numerals of type nat, int, real:
9396 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
9397 i*j + k + j*#3*i simplifies to #4*(i*j) + k
9398 two terms #m*u and #n*u are replaced by #(m+n)*u
9399 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
9400 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
9401 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
9403 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
9404 powerful prover for predicate logic but knows nothing of clasets; see
9405 ex/mesontest.ML and ex/mesontest2.ML for example applications;
9407 * HOL: new version of "case_tac" subsumes both boolean case split and
9408 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
9409 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
9411 * HOL: simplification no longer dives into case-expressions: only the
9412 selector expression is simplified, but not the remaining arms; to
9413 enable full simplification of case-expressions for datatype t, you may
9414 remove t.weak_case_cong from the simpset, either globally (Delcongs
9415 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
9417 * HOL/recdef: the recursion equations generated by 'recdef' for
9418 function 'f' are now called f.simps instead of f.rules; if all
9419 termination conditions are proved automatically, these simplification
9420 rules are added to the simpset, as in primrec; rules may be named
9421 individually as well, resulting in a separate list of theorems for
9424 * HOL/While is a new theory that provides a while-combinator. It
9425 permits the definition of tail-recursive functions without the
9426 provision of a termination measure. The latter is necessary once the
9427 invariant proof rule for while is applied.
9429 * HOL: new (overloaded) notation for the set of elements below/above
9430 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
9432 * HOL: theorems impI, allI, ballI bound as "strip";
9434 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
9435 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
9436 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
9438 * HOL/Real: "rabs" replaced by overloaded "abs" function;
9440 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
9441 main HOL, but was unused);
9443 * HOL: fewer consts declared as global (e.g. have to refer to
9444 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
9446 * HOL: tuned AST representation of nested pairs, avoiding bogus output
9447 in case of overlap with user translations (e.g. judgements over
9448 tuples); (note that the underlying logical represenation is still
9454 * ZF: simplification automatically cancels common terms in arithmetic
9455 expressions over nat and int;
9457 * ZF: new treatment of nat to minimize type-checking: all operators
9458 coerce their operands to a natural number using the function natify,
9459 making the algebraic laws unconditional;
9461 * ZF: as above, for int: operators coerce their operands to an integer
9462 using the function intify;
9464 * ZF: the integer library now contains many of the usual laws for the
9465 orderings, including $<=, and monotonicity laws for $+ and $*;
9467 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
9470 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
9471 to the simplifier and classical reasoner simultaneously;
9476 * Provers: blast_tac now handles actual object-logic rules as
9477 assumptions; note that auto_tac uses blast_tac internally as well;
9479 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
9480 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
9482 * Provers: delrules now handles destruct rules as well (no longer need
9483 explicit make_elim);
9485 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
9486 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
9487 use instead the strong form,
9488 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
9489 in HOL, FOL and ZF the function cla_make_elim will create such rules
9490 from destruct-rules;
9492 * Provers: Simplifier.easy_setup provides a fast path to basic
9493 Simplifier setup for new object-logics;
9495 * Pure: AST translation rules no longer require constant head on LHS;
9497 * Pure: improved name spaces: ambiguous output is qualified; support
9498 for hiding of names;
9500 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
9501 XSYMBOL_HOME; no longer need to do manual configuration in most
9504 * system: compression of ML heaps images may now be controlled via -c
9505 option of isabelle and isatool usedir (currently only observed by
9508 * system: isatool installfonts may handle X-Symbol fonts as well (very
9509 useful for remote X11);
9511 * system: provide TAGS file for Isabelle sources;
9513 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
9516 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
9517 timing flag supersedes proof_timing and Toplevel.trace;
9519 * ML: new combinators |>> and |>>> for incremental transformations
9520 with secondary results (e.g. certain theory extensions):
9522 * ML: PureThy.add_defs gets additional argument to indicate potential
9523 overloading (usually false);
9525 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
9530 New in Isabelle99 (October 1999)
9531 --------------------------------
9533 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9535 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
9536 are no longer simplified. (This allows the simplifier to unfold recursive
9537 functional programs.) To restore the old behaviour, declare
9539 Delcongs [if_weak_cong];
9541 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
9544 * HOL: the predicate "inj" is now defined by translation to "inj_on";
9546 * HOL/datatype: mutual_induct_tac no longer exists --
9547 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
9549 * HOL/typedef: fixed type inference for representing set; type
9550 arguments now have to occur explicitly on the rhs as type constraints;
9552 * ZF: The con_defs part of an inductive definition may no longer refer
9553 to constants declared in the same theory;
9555 * HOL, ZF: the function mk_cases, generated by the inductive
9556 definition package, has lost an argument. To simplify its result, it
9557 uses the default simpset instead of a supplied list of theorems.
9559 * HOL/List: the constructors of type list are now Nil and Cons;
9561 * Simplifier: the type of the infix ML functions
9562 setSSolver addSSolver setSolver addSolver
9563 is now simpset * solver -> simpset where `solver' is a new abstract type
9564 for packaging solvers. A solver is created via
9565 mk_solver: string -> (thm list -> int -> tactic) -> solver
9566 where the string argument is only a comment.
9571 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
9572 decision procedure for linear arithmetic. Currently it is used for
9573 types `nat', `int', and `real' in HOL (see below); it can, should and
9574 will be instantiated for other types and logics as well.
9576 * The simplifier now accepts rewrite rules with flexible heads, eg
9577 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
9578 They are applied like any rule with a non-pattern lhs, i.e. by first-order
9584 * New Isabelle/Isar subsystem provides an alternative to traditional
9585 tactical theorem proving; together with the ProofGeneral/isar user
9586 interface it offers an interactive environment for developing human
9587 readable proof documents (Isar == Intelligible semi-automated
9588 reasoning); for further information see isatool doc isar-ref,
9589 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
9591 * improved and simplified presentation of theories: better HTML markup
9592 (including colors), graph views in several sizes; isatool usedir now
9593 provides a proper interface for user theories (via -P option); actual
9594 document preparation based on (PDF)LaTeX is available as well (for
9595 new-style theories only); see isatool doc system for more information;
9597 * native support for Proof General, both for classic Isabelle and
9600 * ML function thm_deps visualizes dependencies of theorems and lemmas,
9601 using the graph browser tool;
9603 * Isabelle manuals now also available as PDF;
9605 * theory loader rewritten from scratch (may not be fully
9606 bug-compatible); old loadpath variable has been replaced by show_path,
9607 add_path, del_path, reset_path functions; new operations such as
9608 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
9611 * improved isatool install: option -k creates KDE application icon,
9612 option -p DIR installs standalone binaries;
9614 * added ML_PLATFORM setting (useful for cross-platform installations);
9615 more robust handling of platform specific ML images for SML/NJ;
9617 * the settings environment is now statically scoped, i.e. it is never
9618 created again in sub-processes invoked from isabelle, isatool, or
9621 * path element specification '~~' refers to '$ISABELLE_HOME';
9623 * in locales, the "assumes" and "defines" parts may be omitted if
9626 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
9629 * new print_mode "HTML";
9631 * new flag show_tags controls display of tags of theorems (which are
9632 basically just comments that may be attached by some tools);
9634 * Isamode 2.6 requires patch to accomodate change of Isabelle font
9635 mode and goal output format:
9637 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
9639 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
9641 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
9642 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
9644 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
9646 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
9648 * function bind_thms stores lists of theorems (cf. bind_thm);
9650 * new shorthand tactics ftac, eatac, datac, fatac;
9652 * qed (and friends) now accept "" as result name; in that case the
9653 theorem is not stored, but proper checks and presentation of the
9656 * theorem database now also indexes constants "Trueprop", "all",
9657 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
9662 ** HOL arithmetic **
9664 * There are now decision procedures for linear arithmetic over nat and
9667 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
9668 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
9669 are treated as atomic; subformulae not involving type `nat' or `int'
9670 are ignored; quantified subformulae are ignored unless they are
9671 positive universal or negative existential. The tactic has to be
9672 invoked by hand and can be a little bit slow. In particular, the
9673 running time is exponential in the number of occurrences of `min' and
9674 `max', and `-' on `nat'.
9676 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
9677 (negated) (in)equalities among the premises and the conclusion into
9678 account (i.e. no compound formulae) and does not know about `min' and
9679 `max', and `-' on `nat'. It is fast and is used automatically by the
9682 NB: At the moment, these decision procedures do not cope with mixed
9683 nat/int formulae where the two parts interact, such as `m < n ==>
9686 * HOL/Numeral provides a generic theory of numerals (encoded
9687 efficiently as bit strings); setup for types nat/int/real is in place;
9688 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
9689 int, existing theories and proof scripts may require a few additional
9692 * integer division and remainder can now be performed on constant
9695 * many properties of integer multiplication, division and remainder
9698 * An interface to the Stanford Validity Checker (SVC) is available through the
9699 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
9700 are proved automatically. SVC must be installed separately, and its results
9701 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
9702 invocation of the underlying oracle). For SVC see
9703 http://verify.stanford.edu/SVC
9705 * IsaMakefile: the HOL-Real target now builds an actual image;
9710 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
9711 (in Isabelle/Isar) -- by Gertrud Bauer;
9713 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
9714 analysis for assembly languages with subtypes;
9716 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
9717 -- avoids syntactic ambiguities and treats state, transition, and
9718 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
9719 changed syntax and (many) tactics;
9721 * HOL/inductive: Now also handles more general introduction rules such
9722 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
9723 theorems are now maintained within the theory (maintained via the
9726 * HOL/datatype: Now also handles arbitrarily branching datatypes
9727 (using function types) such as
9729 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
9731 * HOL/record: record_simproc (part of the default simpset) takes care
9732 of selectors applied to updated records; record_split_tac is no longer
9733 part of the default claset; update_defs may now be removed from the
9734 simpset in many cases; COMPATIBILITY: old behavior achieved by
9736 claset_ref () := claset() addSWrapper record_split_wrapper;
9737 Delsimprocs [record_simproc]
9739 * HOL/typedef: fixed type inference for representing set; type
9740 arguments now have to occur explicitly on the rhs as type constraints;
9742 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
9743 names rather than an ML expression;
9745 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
9746 supplied later. Program schemes can be defined, such as
9747 "While B C s = (if B s then While B C (C s) else s)"
9748 where the well-founded relation can be chosen after B and C have been given.
9750 * HOL/List: the constructors of type list are now Nil and Cons;
9751 INCOMPATIBILITY: while [] and infix # syntax is still there, of
9752 course, ML tools referring to List.list.op # etc. have to be adapted;
9754 * HOL_quantifiers flag superseded by "HOL" print mode, which is
9755 disabled by default; run isabelle with option -m HOL to get back to
9756 the original Gordon/HOL-style output;
9758 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
9759 ALL x<=y. P, EX x<y. P, EX x<=y. P;
9761 * HOL basic syntax simplified (more orthogonal): all variants of
9762 All/Ex now support plain / symbolic / HOL notation; plain syntax for
9763 Eps operator is provided as well: "SOME x. P[x]";
9765 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
9767 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
9768 thus available for user theories;
9770 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
9771 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
9774 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
9775 several times and then mp;
9780 * the notation <<...>> is now available as a notation for sequences of
9783 * the simplifier is now installed
9785 * the axiom system has been generalized (thanks to Soren Heilmann)
9787 * the classical reasoner now has a default rule database
9792 * new primrec section allows primitive recursive functions to be given
9793 directly (as in HOL) over datatypes and the natural numbers;
9795 * new tactics induct_tac and exhaust_tac for induction (or case
9796 analysis) over datatypes and the natural numbers;
9798 * the datatype declaration of type T now defines the recursor T_rec;
9800 * simplification automatically does freeness reasoning for datatype
9803 * automatic type-inference, with AddTCs command to insert new
9804 type-checking rules;
9806 * datatype introduction rules are now added as Safe Introduction rules
9809 * the syntax "if P then x else y" is now available in addition to
9813 *** Internal programming interfaces ***
9815 * tuned simplifier trace output; new flag debug_simp;
9817 * structures Vartab / Termtab (instances of TableFun) offer efficient
9818 tables indexed by indexname_ord / term_ord (compatible with aconv);
9820 * AxClass.axclass_tac lost the theory argument;
9822 * tuned current_goals_markers semantics: begin / end goal avoids
9823 printing empty lines;
9825 * removed prs and prs_fn hook, which was broken because it did not
9826 include \n in its semantics, forcing writeln to add one
9827 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
9828 string -> unit if you really want to output text without newline;
9830 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
9831 plain output, interface builders may have to enable 'isabelle_font'
9832 mode to get Isabelle font glyphs as before;
9834 * refined token_translation interface; INCOMPATIBILITY: output length
9835 now of type real instead of int;
9837 * theory loader actions may be traced via new ThyInfo.add_hook
9838 interface (see src/Pure/Thy/thy_info.ML); example application: keep
9839 your own database of information attached to *whole* theories -- as
9840 opposed to intra-theory data slots offered via TheoryDataFun;
9842 * proper handling of dangling sort hypotheses (at last!);
9843 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
9844 extra sort hypotheses that can be witnessed from the type signature;
9845 the force_strip_shyps flag is gone, any remaining shyps are simply
9846 left in the theorem (with a warning issued by strip_shyps_warning);
9850 New in Isabelle98-1 (October 1998)
9851 ----------------------------------
9853 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9855 * several changes of automated proof tools;
9857 * HOL: major changes to the inductive and datatype packages, including
9858 some minor incompatibilities of theory syntax;
9860 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
9863 * HOL: removed duplicate thms in Arith:
9864 less_imp_add_less should be replaced by trans_less_add1
9865 le_imp_add_le should be replaced by trans_le_add1
9867 * HOL: unary minus is now overloaded (new type constraints may be
9870 * HOL and ZF: unary minus for integers is now #- instead of #~. In
9871 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
9872 now taken as an integer constant.
9874 * Pure: ML function 'theory_of' renamed to 'theory';
9880 1. Asm_full_simp_tac is now more aggressive.
9881 1. It will sometimes reorient premises if that increases their power to
9883 2. It does no longer proceed strictly from left to right but may also
9884 rotate premises to achieve further simplification.
9885 For compatibility reasons there is now Asm_lr_simp_tac which is like the
9886 old Asm_full_simp_tac in that it does not rotate premises.
9887 2. The simplifier now knows a little bit about nat-arithmetic.
9889 * Classical reasoner: wrapper mechanism for the classical reasoner now
9890 allows for selected deletion of wrappers, by introduction of names for
9891 wrapper functionals. This implies that addbefore, addSbefore,
9892 addaltern, and addSaltern now take a pair (name, tactic) as argument,
9893 and that adding two tactics with the same name overwrites the first
9894 one (emitting a warning).
9895 type wrapper = (int -> tactic) -> (int -> tactic)
9896 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
9897 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
9898 delWrapper, delSWrapper: claset * string -> claset
9899 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
9901 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
9902 semantics; addbefore now affects only the unsafe part of step_tac
9903 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
9904 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
9907 * Classical reasoner: setwrapper to setWrapper and compwrapper to
9908 compWrapper; added safe wrapper (and access functions for it);
9910 * HOL/split_all_tac is now much faster and fails if there is nothing
9911 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
9912 and the names of the automatically generated variables have changed.
9913 split_all_tac has moved within claset() from unsafe wrappers to safe
9914 wrappers, which means that !!-bound variables are split much more
9915 aggressively, and safe_tac and clarify_tac now split such variables.
9916 If this splitting is not appropriate, use delSWrapper "split_all_tac".
9917 Note: the same holds for record_split_tac, which does the job of
9918 split_all_tac for record fields.
9920 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
9921 permanently to the default simpset using Addsplits just like
9922 Addsimps. They can be removed via Delsplits just like
9923 Delsimps. Lower-case versions are also available.
9925 * HOL/Simplifier: The rule split_if is now part of the default
9926 simpset. This means that the simplifier will eliminate all occurrences
9927 of if-then-else in the conclusion of a goal. To prevent this, you can
9928 either remove split_if completely from the default simpset by
9929 `Delsplits [split_if]' or remove it in a specific call of the
9930 simplifier using `... delsplits [split_if]'. You can also add/delete
9931 other case splitting rules to/from the default simpset: every datatype
9932 generates suitable rules `split_t_case' and `split_t_case_asm' (where
9933 t is the name of the datatype).
9935 * Classical reasoner / Simplifier combination: new force_tac (and
9936 derivatives Force_tac, force) combines rewriting and classical
9937 reasoning (and whatever other tools) similarly to auto_tac, but is
9938 aimed to solve the given subgoal completely.
9943 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
9944 and `goalw': the theory is no longer needed as an explicit argument -
9945 the current theory context is used; assumptions are no longer returned
9946 at the ML-level unless one of them starts with ==> or !!; it is
9947 recommended to convert to these new commands using isatool fixgoal
9948 (backup your sources first!);
9950 * new top-level commands 'thm' and 'thms' for retrieving theorems from
9951 the current theory context, and 'theory' to lookup stored theories;
9953 * new theory section 'locale' for declaring constants, assumptions and
9954 definitions that have local scope;
9956 * new theory section 'nonterminals' for purely syntactic types;
9958 * new theory section 'setup' for generic ML setup functions
9959 (e.g. package initialization);
9961 * the distribution now includes Isabelle icons: see
9962 lib/logo/isabelle-{small,tiny}.xpm;
9964 * isatool install - install binaries with absolute references to
9967 * isatool logo -- create instances of the Isabelle logo (as EPS);
9969 * print mode 'emacs' reserved for Isamode;
9971 * support multiple print (ast) translations per constant name;
9973 * theorems involving oracles are now printed with a suffixed [!];
9978 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
9980 * HOL/inductive package reorganized and improved: now supports mutual
9986 oddI "n : EVEN ==> Suc n : ODD"
9987 evenI "n : ODD ==> Suc n : EVEN"
9989 new theorem list "elims" contains an elimination rule for each of the
9990 recursive sets; inductive definitions now handle disjunctive premises
9991 correctly (also ZF);
9993 INCOMPATIBILITIES: requires Inductive as an ancestor; component
9994 "mutual_induct" no longer exists - the induction rule is always
9995 contained in "induct";
9998 * HOL/datatype package re-implemented and greatly improved: now
9999 supports mutually recursive datatypes such as
10002 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
10003 | SUM ('a aexp) ('a aexp)
10004 | DIFF ('a aexp) ('a aexp)
10007 'a bexp = LESS ('a aexp) ('a aexp)
10008 | AND ('a bexp) ('a bexp)
10009 | OR ('a bexp) ('a bexp)
10011 as well as indirectly recursive datatypes such as
10014 ('a, 'b) term = Var 'a
10015 | App 'b ((('a, 'b) term) list)
10017 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
10018 induction on mutually / indirectly recursive datatypes.
10020 Primrec equations are now stored in theory and can be accessed via
10021 <function_name>.simps.
10025 - Theories using datatypes must now have theory Datatype as an
10027 - The specific <typename>.induct_tac no longer exists - use the
10028 generic induct_tac instead.
10029 - natE has been renamed to nat.exhaust - use exhaust_tac
10030 instead of res_inst_tac ... natE. Note that the variable
10031 names in nat.exhaust differ from the names in natE, this
10032 may cause some "fragile" proofs to fail.
10033 - The theorems split_<typename>_case and split_<typename>_case_asm
10034 have been renamed to <typename>.split and <typename>.split_asm.
10035 - Since default sorts of type variables are now handled correctly,
10036 some datatype definitions may have to be annotated with explicit
10038 - Primrec definitions no longer require function name and type
10039 of recursive argument.
10041 Consider using isatool fixdatatype to adapt your theories and proof
10042 scripts to the new package (backup your sources first!).
10045 * HOL/record package: considerably improved implementation; now
10046 includes concrete syntax for record types, terms, updates; theorems
10047 for surjective pairing and splitting !!-bound record variables; proof
10048 support is as follows:
10050 1) standard conversions (selectors or updates applied to record
10051 constructor terms) are part of the standard simpset;
10053 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
10054 made part of standard simpset and claset via addIffs;
10056 3) a tactic for record field splitting (record_split_tac) is part of
10057 the standard claset (addSWrapper);
10059 To get a better idea about these rules you may retrieve them via
10060 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
10061 the name of your record type.
10063 The split tactic 3) conceptually simplifies by the following rule:
10065 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
10067 Thus any record variable that is bound by meta-all will automatically
10068 blow up into some record constructor term, consequently the
10069 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
10070 solve record problems automatically.
10073 * reorganized the main HOL image: HOL/Integ and String loaded by
10074 default; theory Main includes everything;
10076 * automatic simplification of integer sums and comparisons, using cancellation;
10078 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
10080 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
10082 * many new identities for unions, intersections, set difference, etc.;
10084 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
10085 called split_if, split_split, split_sum_case and split_nat_case (to go
10086 with add/delsplits);
10088 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
10089 (?x::unit) = (); this is made part of the default simpset, which COULD
10090 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
10091 'Delsimprocs [unit_eq_proc];' as last resort); also note that
10092 unit_abs_eta_conv is added in order to counter the effect of
10093 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
10096 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
10099 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
10100 It and 'sym RS equals0D' are now in the default claset, giving automatic
10101 disjointness reasoning but breaking a few old proofs.
10103 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
10104 to 'converse' from 'inverse' (for compatibility with ZF and some
10107 * HOL/recdef can now declare non-recursive functions, with {} supplied as
10108 the well-founded relation;
10110 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
10111 Compl A. The "Compl" syntax remains available as input syntax for this
10114 * HOL/Update: new theory of function updates:
10115 f(a:=b) == %x. if x=a then b else f x
10116 may also be iterated as in f(a:=b,c:=d,...);
10118 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
10121 - new function list_update written xs[i:=v] that updates the i-th
10122 list position. May also be iterated as in xs[i:=a,j:=b,...].
10123 - new function `upt' written [i..j(] which generates the list
10124 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
10125 bound write [i..j], which is a shorthand for [i..j+1(].
10126 - new lexicographic orderings and corresponding wellfoundedness theorems.
10129 - removed 'pred' (predecessor) function;
10130 - generalized some theorems about n-1;
10131 - many new laws about "div" and "mod";
10132 - new laws about greatest common divisors (see theory ex/Primes);
10134 * HOL/Relation: renamed the relational operator r^-1 "converse"
10135 instead of "inverse";
10137 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
10138 of the multiset ordering;
10140 * directory HOL/Real: a construction of the reals using Dedekind cuts
10141 (not included by default);
10143 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
10145 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
10146 programs, i.e. different program variables may have different types.
10148 * calling (stac rew i) now fails if "rew" has no effect on the goal
10149 [previously, this check worked only if the rewrite rule was unconditional]
10150 Now rew can involve either definitions or equalities (either == or =).
10155 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
10156 only the theorems proved on ZF.ML;
10158 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
10159 It and 'sym RS equals0D' are now in the default claset, giving automatic
10160 disjointness reasoning but breaking a few old proofs.
10162 * ZF/Update: new theory of function updates
10163 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
10164 may also be iterated as in f(a:=b,c:=d,...);
10166 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
10168 * calling (stac rew i) now fails if "rew" has no effect on the goal
10169 [previously, this check worked only if the rewrite rule was unconditional]
10170 Now rew can involve either definitions or equalities (either == or =).
10172 * case_tac provided for compatibility with HOL
10173 (like the old excluded_middle_tac, but with subgoals swapped)
10176 *** Internal programming interfaces ***
10178 * Pure: several new basic modules made available for general use, see
10179 also src/Pure/README;
10181 * improved the theory data mechanism to support encapsulation (data
10182 kind name replaced by private Object.kind, acting as authorization
10183 key); new type-safe user interface via functor TheoryDataFun; generic
10184 print_data function becomes basically useless;
10186 * removed global_names compatibility flag -- all theory declarations
10187 are qualified by default;
10189 * module Pure/Syntax now offers quote / antiquote translation
10190 functions (useful for Hoare logic etc. with implicit dependencies);
10191 see HOL/ex/Antiquote for an example use;
10193 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
10196 * new tactical CHANGED_GOAL for checking that a tactic modifies a
10199 * Display.print_goals function moved to Locale.print_goals;
10201 * standard print function for goals supports current_goals_markers
10202 variable for marking begin of proof, end of proof, start of goal; the
10203 default is ("", "", ""); setting current_goals_markers := ("<proof>",
10204 "</proof>", "<goal>") causes SGML like tagged proof state printing,
10209 New in Isabelle98 (January 1998)
10210 --------------------------------
10212 *** Overview of INCOMPATIBILITIES (see below for more details) ***
10214 * changed lexical syntax of terms / types: dots made part of long
10215 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
10217 * simpset (and claset) reference variable replaced by functions
10218 simpset / simpset_ref;
10220 * no longer supports theory aliases (via merge) and non-trivial
10221 implicit merge of thms' signatures;
10223 * most internal names of constants changed due to qualified names;
10225 * changed Pure/Sequence interface (see Pure/seq.ML);
10228 *** General Changes ***
10230 * hierachically structured name spaces (for consts, types, axms, thms
10231 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
10232 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
10233 isatool fixdots ensures space after dots (e.g. "%x. x"); set
10234 long_names for fully qualified output names; NOTE: ML programs
10235 (special tactics, packages etc.) referring to internal names may have
10236 to be adapted to cope with fully qualified names; in case of severe
10237 backward campatibility problems try setting 'global_names' at compile
10238 time to have enrything declared within a flat name space; one may also
10239 fine tune name declarations in theories via the 'global' and 'local'
10242 * reimplemented the implicit simpset and claset using the new anytype
10243 data filed in signatures; references simpset:simpset ref etc. are
10244 replaced by functions simpset:unit->simpset and
10245 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
10246 to patch your ML files accordingly;
10248 * HTML output now includes theory graph data for display with Java
10249 applet or isatool browser; data generated automatically via isatool
10250 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
10252 * defs may now be conditional; improved rewrite_goals_tac to handle
10253 conditional equations;
10255 * defs now admits additional type arguments, using TYPE('a) syntax;
10257 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
10258 creates a new theory node; implicit merge of thms' signatures is
10259 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
10260 transfer:theory->thm->thm in (rare) cases;
10262 * improved handling of draft signatures / theories; draft thms (and
10263 ctyps, cterms) are automatically promoted to real ones;
10265 * slightly changed interfaces for oracles: admit many per theory, named
10266 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
10268 * print_goals: optional output of const types (set show_consts and
10271 * improved output of warnings (###) and errors (***);
10273 * subgoal_tac displays a warning if the new subgoal has type variables;
10275 * removed old README and Makefiles;
10277 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
10279 * removed obsolete init_pps and init_database;
10281 * deleted the obsolete tactical STATE, which was declared by
10282 fun STATE tacfun st = tacfun st st;
10284 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
10285 (which abbreviates $HOME);
10287 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
10288 use isatool fixseq to adapt your ML programs (this works for fully
10289 qualified references to the Sequence structure only!);
10291 * use_thy no longer requires writable current directory; it always
10292 reloads .ML *and* .thy file, if either one is out of date;
10295 *** Classical Reasoner ***
10297 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
10298 tactics that use classical reasoning to simplify a subgoal without
10299 splitting it into several subgoals;
10301 * Safe_tac: like safe_tac but uses the default claset;
10306 * added simplification meta rules:
10307 (asm_)(full_)simplify: simpset -> thm -> thm;
10309 * simplifier.ML no longer part of Pure -- has to be loaded by object
10312 * added prems argument to simplification procedures;
10314 * HOL, FOL, ZF: added infix function `addsplits':
10315 instead of `<simpset> setloop (split_tac <thms>)'
10316 you can simply write `<simpset> addsplits <thms>'
10321 * TYPE('a) syntax for type reflection terms;
10323 * no longer handles consts with name "" -- declare as 'syntax' instead;
10325 * pretty printer: changed order of mixfix annotation preference (again!);
10327 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
10332 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
10333 with `addloop' of the simplifier to faciliate case splitting in premises.
10335 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
10337 * HOL/Auth: new protocol proofs including some for the Internet
10340 * HOL/Map: new theory of `maps' a la VDM;
10342 * HOL/simplifier: simplification procedures nat_cancel_sums for
10343 cancelling out common nat summands from =, <, <= (in)equalities, or
10344 differences; simplification procedures nat_cancel_factor for
10345 cancelling common factor from =, <, <= (in)equalities over natural
10346 sums; nat_cancel contains both kinds of procedures, it is installed by
10347 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
10349 * HOL/simplifier: terms of the form
10350 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
10352 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
10353 and those of the form
10354 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
10356 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
10359 Each datatype `t' now comes with a theorem `split_t_case' of the form
10361 P(t_case f1 ... fn x) =
10362 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
10364 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
10367 and a theorem `split_t_case_asm' of the form
10369 P(t_case f1 ... fn x) =
10370 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
10372 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
10374 which can be added to a simpset via `addsplits'. The existing theorems
10375 expand_list_case and expand_option_case have been renamed to
10376 split_list_case and split_option_case.
10379 - `pred n' is automatically converted to `n-1'.
10380 Users are strongly encouraged not to use `pred' any longer,
10381 because it will disappear altogether at some point.
10382 - Users are strongly encouraged to write "0 < n" rather than
10383 "n ~= 0". Theorems and proof tools have been modified towards this
10387 the function "set_of_list" has been renamed "set" (and its theorems too);
10388 the function "nth" now takes its arguments in the reverse order and
10389 has acquired the infix notation "!" as in "xs!n".
10391 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
10393 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
10394 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
10396 * HOL/record: extensible records with schematic structural subtyping
10397 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
10398 still lacks various theorems and concrete record syntax;
10403 * removed "axioms" and "generated by" sections;
10405 * replaced "ops" section by extended "consts" section, which is capable of
10406 handling the continuous function space "->" directly;
10409 . proves theorems immediately and stores them in the theory,
10410 . creates hierachical name space,
10411 . now uses normal mixfix annotations (instead of cinfix...),
10412 . minor changes to some names and values (for consistency),
10413 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
10414 . separator between mutual domain defs: changed "," to "and",
10415 . improved handling of sort constraints; now they have to
10416 appear on the left-hand side of the equations only;
10418 * fixed LAM <x,y,zs>.b syntax;
10420 * added extended adm_tac to simplifier in HOLCF -- can now discharge
10421 adm (%x. P (t x)), where P is chainfinite and t continuous;
10426 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
10427 with `addloop' of the simplifier to faciliate case splitting in premises.
10429 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
10430 in HOL, they strip ALL and --> from proved theorems;
10434 New in Isabelle94-8 (May 1997)
10435 ------------------------------
10437 *** General Changes ***
10439 * new utilities to build / run / maintain Isabelle etc. (in parts
10440 still somewhat experimental); old Makefiles etc. still functional;
10442 * new 'Isabelle System Manual';
10444 * INSTALL text, together with ./configure and ./build scripts;
10446 * reimplemented type inference for greater efficiency, better error
10447 messages and clean internal interface;
10449 * prlim command for dealing with lots of subgoals (an easier way of
10450 setting goals_limit);
10455 * supports alternative (named) syntax tables (parser and pretty
10456 printer); internal interface is provided by add_modesyntax(_i);
10458 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
10459 be used in conjunction with the Isabelle symbol font; uses the
10460 "symbols" syntax table;
10462 * added token_translation interface (may translate name tokens in
10463 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
10464 the current print_mode); IMPORTANT: user print translation functions
10465 are responsible for marking newly introduced bounds
10466 (Syntax.mark_boundT);
10468 * token translations for modes "xterm" and "xterm_color" that display
10469 names in bold, underline etc. or colors (which requires a color
10472 * infixes may now be declared with names independent of their syntax;
10474 * added typed_print_translation (like print_translation, but may
10475 access type of constant);
10478 *** Classical Reasoner ***
10480 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
10481 some limitations. Blast_tac...
10482 + ignores addss, addbefore, addafter; this restriction is intrinsic
10483 + ignores elimination rules that don't have the correct format
10484 (the conclusion MUST be a formula variable)
10485 + ignores types, which can make HOL proofs fail
10486 + rules must not require higher-order unification, e.g. apply_type in ZF
10487 [message "Function Var's argument not a bound variable" relates to this]
10488 + its proof strategy is more general but can actually be slower
10490 * substitution with equality assumptions no longer permutes other
10493 * minor changes in semantics of addafter (now called addaltern); renamed
10494 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
10495 (and access functions for it);
10497 * improved combination of classical reasoner and simplifier:
10498 + functions for handling clasimpsets
10499 + improvement of addss: now the simplifier is called _after_ the
10501 + safe variant of addss called addSss: uses safe simplifications
10502 _during_ the safe steps. It is more complete as it allows multiple
10503 instantiations of unknowns (e.g. with slow_tac).
10507 * added interface for simplification procedures (functions that
10508 produce *proven* rewrite rules on the fly, depending on current
10511 * ordering on terms as parameter (used for ordered rewriting);
10513 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
10515 * the solver is now split into a safe and an unsafe part.
10516 This should be invisible for the normal user, except that the
10517 functions setsolver and addsolver have been renamed to setSolver and
10518 addSolver; added safe_asm_full_simp_tac;
10523 * a generic induction tactic `induct_tac' which works for all datatypes and
10524 also for type `nat';
10526 * a generic case distinction tactic `exhaust_tac' which works for all
10527 datatypes and also for type `nat';
10529 * each datatype comes with a function `size';
10531 * patterns in case expressions allow tuple patterns as arguments to
10532 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
10534 * primrec now also works with type nat;
10536 * recdef: a new declaration form, allows general recursive functions to be
10537 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
10539 * the constant for negation has been renamed from "not" to "Not" to
10540 harmonize with FOL, ZF, LK, etc.;
10542 * HOL/ex/LFilter theory of a corecursive "filter" functional for
10545 * HOL/Modelcheck demonstrates invocation of model checker oracle;
10547 * HOL/ex/Ring.thy declares cring_simp, which solves equational
10548 problems in commutative rings, using axiomatic type classes for + and *;
10550 * more examples in HOL/MiniML and HOL/Auth;
10552 * more default rewrite rules for quantifiers, union/intersection;
10554 * a new constant `arbitrary == @x.False';
10556 * HOLCF/IOA replaces old HOL/IOA;
10558 * HOLCF changes: derived all rules and arities
10559 + axiomatic type classes instead of classes
10560 + typedef instead of faking type definitions
10561 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
10562 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
10563 + eliminated the types void, one, tr
10564 + use unit lift and bool lift (with translations) instead of one and tr
10565 + eliminated blift from Lift3.thy (use Def instead of blift)
10566 all eliminated rules are derived as theorems --> no visible changes ;
10571 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
10572 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
10573 as ZF_cs addSIs [equalityI];
10577 New in Isabelle94-7 (November 96)
10578 ---------------------------------
10580 * allowing negative levels (as offsets) in prlev and choplev;
10582 * super-linear speedup for large simplifications;
10584 * FOL, ZF and HOL now use miniscoping: rewriting pushes
10585 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
10586 FAIL); can suppress it using the command Delsimps (ex_simps @
10587 all_simps); De Morgan laws are also now included, by default;
10589 * improved printing of ==> : ~:
10591 * new object-logic "Sequents" adds linear logic, while replacing LK
10592 and Modal (thanks to Sara Kalvala);
10594 * HOL/Auth: correctness proofs for authentication protocols;
10596 * HOL: new auto_tac combines rewriting and classical reasoning (many
10597 examples on HOL/Auth);
10599 * HOL: new command AddIffs for declaring theorems of the form P=Q to
10600 the rewriter and classical reasoner simultaneously;
10602 * function uresult no longer returns theorems in "standard" format;
10603 regain previous version by: val uresult = standard o uresult;
10607 New in Isabelle94-6
10608 -------------------
10610 * oracles -- these establish an interface between Isabelle and trusted
10611 external reasoners, which may deliver results as theorems;
10613 * proof objects (in particular record all uses of oracles);
10615 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
10617 * "constdefs" section in theory files;
10619 * "primrec" section (HOL) no longer requires names;
10621 * internal type "tactic" now simply "thm -> thm Sequence.seq";
10625 New in Isabelle94-5
10626 -------------------
10628 * reduced space requirements;
10630 * automatic HTML generation from theories;
10632 * theory files no longer require "..." (quotes) around most types;
10634 * new examples, including two proofs of the Church-Rosser theorem;
10636 * non-curried (1994) version of HOL is no longer distributed;
10640 New in Isabelle94-4
10641 -------------------
10643 * greatly reduced space requirements;
10645 * theory files (.thy) no longer require \...\ escapes at line breaks;
10647 * searchable theorem database (see the section "Retrieving theorems" on
10648 page 8 of the Reference Manual);
10650 * new examples, including Grabczewski's monumental case study of the
10653 * The previous version of HOL renamed to Old_HOL;
10655 * The new version of HOL (previously called CHOL) uses a curried syntax
10656 for functions. Application looks like f a b instead of f(a,b);
10658 * Mutually recursive inductive definitions finally work in HOL;
10660 * In ZF, pattern-matching on tuples is now available in all abstractions and
10661 translates to the operator "split";
10665 New in Isabelle94-3
10666 -------------------
10668 * new infix operator, addss, allowing the classical reasoner to
10669 perform simplification at each step of its search. Example:
10670 fast_tac (cs addss ss)
10672 * a new logic, CHOL, the same as HOL, but with a curried syntax
10673 for functions. Application looks like f a b instead of f(a,b). Also pairs
10674 look like (a,b) instead of <a,b>;
10676 * PLEASE NOTE: CHOL will eventually replace HOL!
10678 * In CHOL, pattern-matching on tuples is now available in all abstractions.
10679 It translates to the operator "split". A new theory of integers is available;
10681 * In ZF, integer numerals now denote two's-complement binary integers.
10682 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
10684 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
10685 of the Axiom of Choice;
10689 New in Isabelle94-2
10690 -------------------
10692 * Significantly faster resolution;
10694 * the different sections in a .thy file can now be mixed and repeated
10697 * Database of theorems for FOL, HOL and ZF. New
10698 commands including qed, qed_goal and bind_thm store theorems in the database.
10700 * Simple database queries: return a named theorem (get_thm) or all theorems of
10701 a given theory (thms_of), or find out what theory a theorem was proved in
10704 * Bugs fixed in the inductive definition and datatype packages;
10706 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
10707 and HOL_dup_cs obsolete;
10709 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
10712 * Simpler definition of function space in ZF;
10714 * new results about cardinal and ordinal arithmetic in ZF;
10716 * 'subtype' facility in HOL for introducing new types as subsets of existing
10719 :mode=isabelle-news:wrap=hard:maxLineLen=72: