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
67 timing information, depending on option jedit_timing_threshold. The
68 same timing information is shown in the extended tooltip of the
69 command keyword, when hovering the mouse over it while the CONTROL or
70 COMMAND modifier is pressed.
72 * Improved dockable window "Theories": Continuous checking of proof
73 document (visible and required parts) may be controlled explicitly,
74 using check box or shortcut "C+e ENTER". Individual theory nodes may
75 be marked explicitly as required and checked in full, using check box
76 or shortcut "C+e SPACE".
78 * Improved completion mechanism, which is now managed by the
79 Isabelle/jEdit plugin instead of SideKick. Refined table of Isabelle
80 symbol abbreviations (see $ISABELLE_HOME/etc/symbols).
82 * Standard jEdit keyboard shortcut C+b complete-word is remapped to
83 isabelle.complete for explicit completion in Isabelle sources.
84 INCOMPATIBILITY wrt. jEdit defaults, may have to invent new shortcuts
87 * Improved support of various "minor modes" for Isabelle NEWS,
88 options, session ROOT etc., with completion and SideKick tree view.
90 * Strictly monotonic document update, without premature cancellation of
91 running transactions that are still needed: avoid reset/restart of
92 such command executions while editing.
94 * Support for asynchronous print functions, as overlay to existing
97 * Support for automatic tools in HOL, which try to prove or disprove
98 toplevel theorem statements.
100 * Action isabelle.reset-font-size resets main text area font size
101 according to Isabelle/Scala plugin option "jedit_font_reset_size"
102 (cf. keyboard shortcut C+0).
104 * File specifications in jEdit (e.g. file browser) may refer to
105 $ISABELLE_HOME and $ISABELLE_HOME_USER on all platforms. Discontinued
106 obsolete $ISABELLE_HOME_WINDOWS variable.
108 * Improved support for Linux look-and-feel "GTK+", see also "Utilities
109 / Global Options / Appearance".
111 * Improved support of native Mac OS X functionality via "MacOSX"
112 plugin, which is now enabled by default.
117 * Commands 'interpretation' and 'sublocale' are now target-sensitive.
118 In particular, 'interpretation' allows for non-persistent
119 interpretation within "context ... begin ... end" blocks offering a
120 light-weight alternative to 'sublocale'. See "isar-ref" manual for
123 * Improved locales diagnostic command 'print_dependencies'.
125 * Discontinued obsolete 'axioms' command, which has been marked as
126 legacy since Isabelle2009-2. INCOMPATIBILITY, use 'axiomatization'
127 instead, while observing its uniform scope for polymorphism.
129 * Discontinued empty name bindings in 'axiomatization'.
132 * System option "proofs" has been discontinued. Instead the global
133 state of Proofterm.proofs is persistently compiled into logic images
134 as required, notably HOL-Proofs. Users no longer need to change
135 Proofterm.proofs dynamically. Minor INCOMPATIBILITY.
137 * Syntax translation functions (print_translation etc.) always depend
138 on Proof.context. Discontinued former "(advanced)" option -- this is
139 now the default. Minor INCOMPATIBILITY.
141 * Former global reference trace_unify_fail is now available as
142 configuration option "unify_trace_failure" (global context only).
144 * SELECT_GOAL now retains the syntactic context of the overall goal
145 state (schematic variables etc.). Potential INCOMPATIBILITY in rare
151 * Stronger precedence of syntax for big intersection and union on
152 sets, in accordance with corresponding lattice operations.
155 * Notation "{p:A. P}" now allows tuple patterns as well.
157 * Nested case expressions are now translated in a separate check phase
158 rather than during parsing. The data for case combinators is separated
159 from the datatype package. The declaration attribute
160 "case_translation" can be used to register new case combinators:
162 declare [[case_translation case_combinator constructor1 ... constructorN]]
165 - 'code_printing' unifies 'code_const' / 'code_type' / 'code_class' /
167 - 'code_identifier' declares name hints for arbitrary identifiers in
168 generated code, subsuming 'code_modulename'.
170 See the isar-ref manual for syntax diagrams, and the HOL theories for
173 * Attibute 'code': 'code' now declares concrete and abstract code
174 equations uniformly. Use explicit 'code equation' and 'code abstract'
175 to distinguish both when desired.
177 * Discontinued theories Code_Integer and Efficient_Nat by a more
178 fine-grain stack of theories Code_Target_Int, Code_Binary_Nat,
179 Code_Target_Nat and Code_Target_Numeral. See the tutorial on code
180 generation for details. INCOMPATIBILITY.
182 * Numeric types are mapped by default to target language numerals:
183 natural (replaces former code_numeral) and integer (replaces former
184 code_int). Conversions are available as integer_of_natural /
185 natural_of_integer / integer_of_nat / nat_of_integer (in HOL) and
186 Code_Numeral.integer_of_natural / Code_Numeral.natural_of_integer (in
187 ML). INCOMPATIBILITY.
189 * Function package: For mutually recursive functions f and g, separate
190 cases rules f.cases and g.cases are generated instead of unusable
191 f_g.cases which exposed internal sum types. Potential INCOMPATIBILITY,
192 in the case that the unusable rule was used nevertheless.
194 * Function package: For each function f, new rules f.elims are
195 generated, which eliminate equalities of the form "f x = t".
197 * New command 'fun_cases' derives ad-hoc elimination rules for
198 function equations as simplified instances of f.elims, analogous to
199 inductive_cases. See ~~/src/HOL/ex/Fundefs.thy for some examples.
202 - parametrized correspondence relations are now supported:
203 + parametricity theorems for the raw term can be specified in
204 the command lift_definition, which allow us to generate stronger
206 + setup_lifting generates stronger transfer rules if parametric
207 correspondence relation can be generated
208 + various new properties of the relator must be specified to support
210 + parametricity theorem for the Quotient relation can be specified
211 - setup_lifting generates domain rules for the Transfer package
212 - stronger reflexivity prover of respectfulness theorems for type
214 - ===> and --> are now local. The symbols can be introduced
215 by interpreting the locale lifting_syntax (typically in an
217 - Lifting/Transfer relevant parts of Library/Quotient_* are now in
218 Main. Potential INCOMPATIBILITY
219 - new commands for restoring and deleting Lifting/Transfer context:
220 lifting_forget, lifting_update
221 - the command print_quotmaps was renamed to print_quot_maps.
225 - better support for domains in Transfer: replace Domainp T
226 by the actual invariant in a transferred goal
227 - transfer rules can have as assumptions other transfer rules
228 - Experimental support for transferring from the raw level to the
229 abstract level: Transfer.transferred attribute
230 - Attribute version of the transfer method: untransferred attribute
232 * Reification and reflection:
233 - Reification is now directly available in HOL-Main in structure
235 - Reflection now handles multiple lists with variables also.
236 - The whole reflection stack has been decomposed into conversions.
239 * Revised devices for recursive definitions over finite sets:
240 - Only one fundamental fold combinator on finite set remains:
241 Finite_Set.fold :: ('a => 'b => 'b) => 'b => 'a set => 'b
242 This is now identity on infinite sets.
243 - Locales ("mini packages") for fundamental definitions with
244 Finite_Set.fold: folding, folding_idem.
245 - Locales comm_monoid_set, semilattice_order_set and
246 semilattice_neutr_order_set for big operators on sets.
247 See theory Big_Operators for canonical examples.
248 Note that foundational constants comm_monoid_set.F and
249 semilattice_set.F correspond to former combinators fold_image
250 and fold1 respectively. These are now gone. You may use
251 those foundational constants as substitutes, but it is
252 preferable to interpret the above locales accordingly.
253 - Dropped class ab_semigroup_idem_mult (special case of lattice,
254 no longer needed in connection with Finite_Set.fold etc.)
256 card.union_inter ~> card_Un_Int [symmetric]
257 card.union_disjoint ~> card_Un_disjoint
260 * Locale hierarchy for abstract orderings and (semi)lattices.
262 * Complete_Partial_Order.admissible is defined outside the type class
263 ccpo, but with mandatory prefix ccpo. Admissibility theorems lose the
264 class predicate assumption or sort constraint when possible.
267 * Introduce type class "conditionally_complete_lattice": Like a
268 complete lattice but does not assume the existence of the top and
269 bottom elements. Allows to generalize some lemmas about reals and
270 extended reals. Removed SupInf and replaced it by the instantiation
271 of conditionally_complete_lattice for real. Renamed lemmas about
272 conditionally-complete lattice from Sup_... to cSup_... and from
273 Inf_... to cInf_... to avoid hidding of similar complete lattice
276 * Introduce type class linear_continuum as combination of
277 conditionally-complete lattices and inner dense linorders which have
278 more than one element. INCOMPATIBILITY.
280 * Introduced type classes order_top and order_bot. The old classes top
281 and bot only contain the syntax without assumptions. INCOMPATIBILITY:
282 Rename bot -> order_bot, top -> order_top
284 * Introduce type classes "no_top" and "no_bot" for orderings without
285 top and bottom elements.
287 * Split dense_linorder into inner_dense_order and no_top, no_bot.
289 * Complex_Main: Unify and move various concepts from
290 HOL-Multivariate_Analysis to HOL-Complex_Main.
292 - Introduce type class (lin)order_topology and
293 linear_continuum_topology. Allows to generalize theorems about
294 limits and order. Instances are reals and extended reals.
296 - continuous and continuos_on from Multivariate_Analysis:
297 "continuous" is the continuity of a function at a filter. "isCont"
298 is now an abbrevitation: "isCont x f == continuous (at _) f".
300 Generalized continuity lemmas from isCont to continuous on an
303 - compact from Multivariate_Analysis. Use Bolzano's lemma to prove
304 compactness of closed intervals on reals. Continuous functions
305 attain infimum and supremum on compact sets. The inverse of a
306 continuous function is continuous, when the function is continuous
309 - connected from Multivariate_Analysis. Use it to prove the
310 intermediate value theorem. Show connectedness of intervals on
311 linear_continuum_topology).
313 - first_countable_topology from Multivariate_Analysis. Is used to
314 show equivalence of properties on the neighbourhood filter of x and
315 on all sequences converging to x.
317 - FDERIV: Definition of has_derivative moved to Deriv.thy. Moved
318 theorems from Library/FDERIV.thy to Deriv.thy and base the
319 definition of DERIV on FDERIV. Add variants of DERIV and FDERIV
320 which are restricted to sets, i.e. to represent derivatives from
323 - Removed the within-filter. It is replaced by the principal filter:
325 F within X = inf F (principal X)
327 - Introduce "at x within U" as a single constant, "at x" is now an
328 abbreviation for "at x within UNIV"
330 - Introduce named theorem collections tendsto_intros,
331 continuous_intros, continuous_on_intros and FDERIV_intros. Theorems
332 in tendsto_intros (or FDERIV_intros) are also available as
333 tendsto_eq_intros (or FDERIV_eq_intros) where the right-hand side
334 is replaced by a congruence rule. This allows to apply them as
335 intro rules and then proving equivalence by the simplifier.
337 - Restructured theories in HOL-Complex_Main:
339 + Moved RealDef and RComplete into Real
341 + Introduced Topological_Spaces and moved theorems about
342 topological spaces, filters, limits and continuity to it
344 + Renamed RealVector to Real_Vector_Spaces
346 + Split Lim, SEQ, Series into Topological_Spaces,
347 Real_Vector_Spaces, and Limits
349 + Moved Ln and Log to Transcendental
351 + Moved theorems about continuity from Deriv to Topological_Spaces
353 - Remove various auxiliary lemmas.
359 - Reduce incidence of "too high arity" errors
363 isar_shrink ~> isar_compress
365 - Added options "isar_try0", "spy"
366 - Better support for "isar_proofs"
367 - MaSh has been fined-tuned and now runs as a local server
369 * Improved support for ad hoc overloading of constants (see also
370 isar-ref manual and ~~/src/HOL/ex/Adhoc_Overloading_Examples.thy).
372 * Library/Polynomial.thy:
373 - Use lifting for primitive definitions.
374 - Explicit conversions from and to lists of coefficients, used for
376 - Replaced recursion operator poly_rec by fold_coeffs.
377 - Prefer pre-existing gcd operation for gcd.
379 poly_eq_iff ~> poly_eq_poly_eq_iff
381 expand_poly_eq ~> poly_eq_iff
384 * New Library/Simps_Case_Conv.thy: Provides commands simps_of_case and
385 case_of_simps to convert function definitions between a list of
386 equations with patterns on the lhs and a single equation with case
387 expressions on the rhs. See also Ex/Simps_Case_Conv_Examples.thy.
389 * New Library/FSet.thy: type of finite sets defined as a subtype of
390 sets defined by Lifting/Transfer.
392 * Discontinued theory src/HOL/Library/Eval_Witness. INCOMPATIBILITY.
394 * Consolidation of library theories on product orders:
396 Product_Lattice ~> Product_Order -- pointwise order on products
397 Product_ord ~> Product_Lexorder -- lexicographic order on products
401 * Imperative-HOL: The MREC combinator is considered legacy and no
402 longer included by default. INCOMPATIBILITY, use partial_function
403 instead, or import theory Legacy_Mrec as a fallback.
405 * HOL-Algebra: Discontinued theories ~~/src/HOL/Algebra/abstract and
406 ~~/src/HOL/Algebra/poly. Existing theories should be based on
407 ~~/src/HOL/Library/Polynomial instead. The latter provides
408 integration with HOL's type classes for rings. INCOMPATIBILITY.
411 - Various improvements to BNF-based (co)datatype package, including
412 new commands "primrec_new", "primcorec", and
413 "datatype_new_compat", as well as documentation. See
414 "datatypes.pdf" for details.
415 - New "coinduction" method to avoid some boilerplate (compared to
421 - Renamed many generated theorems, including
423 map_comp' ~> map_comp
433 * Spec_Check is a Quickcheck tool for Isabelle/ML. The ML function
434 "check_property" allows to check specifications of the form "ALL x y
435 z. prop x y z". See also ~~/src/Tools/Spec_Check/ with its
436 Examples.thy in particular.
438 * Improved printing of exception trace in Poly/ML 5.5.1, with regular
439 tracing output in the command transaction context instead of physical
440 stdout. See also Toplevel.debug, Toplevel.debugging and
441 ML_Compiler.exn_trace.
443 * ML type "theory" is now immutable, without any special treatment of
444 drafts or linear updates (which could lead to "stale theory" errors in
445 the past). Discontinued obsolete operations like Theory.copy,
446 Theory.checkpoint, and the auxiliary type theory_ref. Minor
449 * More uniform naming of goal functions for skipped proofs:
451 Skip_Proof.prove ~> Goal.prove_sorry
452 Skip_Proof.prove_global ~> Goal.prove_sorry_global
454 Minor INCOMPATIBILITY.
456 * Simplifier tactics and tools use proper Proof.context instead of
457 historic type simpset. Old-style declarations like addsimps,
458 addsimprocs etc. operate directly on Proof.context. Raw type simpset
459 retains its use as snapshot of the main Simplifier context, using
460 simpset_of and put_simpset on Proof.context. INCOMPATIBILITY -- port
461 old tools by making them depend on (ctxt : Proof.context) instead of
462 (ss : simpset), then turn (simpset_of ctxt) into ctxt.
464 * Modifiers for classical wrappers (e.g. addWrapper, delWrapper)
465 operate on Proof.context instead of claset, for uniformity with addIs,
466 addEs, addDs etc. Note that claset_of and put_claset allow to manage
467 clasets separately from the context.
469 * Discontinued obsolete ML antiquotations @{claset} and @{simpset}.
470 INCOMPATIBILITY, use @{context} instead.
472 * Antiquotation @{theory_context A} is similar to @{theory A}, but
473 presents the result as initial Proof.context.
478 * Discontinued obsolete isabelle usedir, mkdir, make -- superseded by
479 "isabelle build" in Isabelle2013. INCOMPATIBILITY.
481 * Discontinued obsolete isabelle-process options -f and -u (former
482 administrative aliases of option -e). Minor INCOMPATIBILITY.
484 * Discontinued obsolete isabelle print tool, and PRINT_COMMAND
487 * Discontinued ISABELLE_DOC_FORMAT settings variable and historic
488 document formats: dvi.gz, ps, ps.gz -- the default document format is
491 * Isabelle settings variable ISABELLE_BUILD_JAVA_OPTIONS allows to
492 specify global resources of the JVM process run by isabelle build.
494 * Toplevel executable $ISABELLE_HOME/bin/isabelle_scala_script allows
495 to run Isabelle/Scala source files as standalone programs.
497 * Improved "isabelle keywords" tool (for old-style ProofGeneral
498 keyword tables): use Isabelle/Scala operations, which inspect outer
499 syntax without requiring to build sessions first.
501 * Sessions may be organized via 'chapter' specifications in the ROOT
502 file, which determines a two-level hierarchy of browser info. The old
503 tree-like organization via implicit sub-session relation (with its
504 tendency towards erratic fluctuation of URLs) has been discontinued.
505 The default chapter is called "Unsorted". Potential INCOMPATIBILITY
506 for HTML presentation of theories.
510 New in Isabelle2013 (February 2013)
511 -----------------------------------
515 * Theorem status about oracles and unfinished/failed future proofs is
516 no longer printed by default, since it is incompatible with
517 incremental / parallel checking of the persistent document model. ML
518 function Thm.peek_status may be used to inspect a snapshot of the
519 ongoing evaluation process. Note that in batch mode --- notably
520 isabelle build --- the system ensures that future proofs of all
521 accessible theorems in the theory context are finished (as before).
523 * Configuration option show_markup controls direct inlining of markup
524 into the printed representation of formal entities --- notably type
525 and sort constraints. This enables Prover IDE users to retrieve that
526 information via tooltips in the output window, for example.
528 * Command 'ML_file' evaluates ML text from a file directly within the
529 theory, without any predeclaration via 'uses' in the theory header.
531 * Old command 'use' command and corresponding keyword 'uses' in the
532 theory header are legacy features and will be discontinued soon.
533 Tools that load their additional source files may imitate the
534 'ML_file' implementation, such that the system can take care of
535 dependencies properly.
537 * Discontinued obsolete method fastsimp / tactic fast_simp_tac, which
538 is called fastforce / fast_force_tac already since Isabelle2011-1.
540 * Updated and extended "isar-ref" and "implementation" manual, reduced
541 remaining material in old "ref" manual.
543 * Improved support for auxiliary contexts that indicate block structure
544 for specifications. Nesting of "context fixes ... context assumes ..."
545 and "class ... context ...".
547 * Attribute "consumes" allows a negative value as well, which is
548 interpreted relatively to the total number of premises of the rule in
549 the target context. This form of declaration is stable when exported
550 from a nested 'context' with additional assumptions. It is the
551 preferred form for definitional packages, notably cases/rules produced
552 in HOL/inductive and HOL/function.
554 * More informative error messages for Isar proof commands involving
555 lazy enumerations (method applications etc.).
557 * Refined 'help' command to retrieve outer syntax commands according
558 to name patterns (with clickable results).
561 *** Prover IDE -- Isabelle/Scala/jEdit ***
563 * Parallel terminal proofs ('by') are enabled by default, likewise
564 proofs that are built into packages like 'datatype', 'function'. This
565 allows to "run ahead" checking the theory specifications on the
566 surface, while the prover is still crunching on internal
567 justifications. Unfinished / cancelled proofs are restarted as
568 required to complete full proof checking eventually.
570 * Improved output panel with tooltips, hyperlinks etc. based on the
571 same Rich_Text_Area as regular Isabelle/jEdit buffers. Activation of
572 tooltips leads to some window that supports the same recursively,
573 which can lead to stacks of tooltips as the semantic document content
574 is explored. ESCAPE closes the whole stack, individual windows may be
575 closed separately, or detached to become independent jEdit dockables.
577 * Improved support for commands that produce graph output: the text
578 message contains a clickable area to open a new instance of the graph
581 * More robust incremental parsing of outer syntax (partial comments,
582 malformed symbols). Changing the balance of open/close quotes and
583 comment delimiters works more conveniently with unfinished situations
584 that frequently occur in user interaction.
586 * More efficient painting and improved reactivity when editing large
587 files. More scalable management of formal document content.
589 * Smarter handling of tracing messages: prover process pauses after
590 certain number of messages per command transaction, with some user
591 dialog to stop or continue. This avoids swamping the front-end with
592 potentially infinite message streams.
594 * More plugin options and preferences, based on Isabelle/Scala. The
595 jEdit plugin option panel provides access to some Isabelle/Scala
596 options, including tuning parameters for editor reactivity and color
599 * Dockable window "Symbols" provides some editing support for Isabelle
602 * Dockable window "Monitor" shows ML runtime statistics. Note that
603 continuous display of the chart slows down the system.
605 * Improved editing support for control styles: subscript, superscript,
606 bold, reset of style -- operating on single symbols or text
607 selections. Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT.
609 * Actions isabelle.increase-font-size and isabelle.decrease-font-size
610 adjust the main text area font size, and its derivatives for output,
611 tooltips etc. Cf. keyboard shortcuts C-PLUS and C-MINUS, which often
612 need to be adapted to local keyboard layouts.
614 * More reactive completion popup by default: use \t (TAB) instead of
615 \n (NEWLINE) to minimize intrusion into regular flow of editing. See
616 also "Plugin Options / SideKick / General / Code Completion Options".
618 * Implicit check and build dialog of the specified logic session
619 image. For example, HOL, HOLCF, HOL-Nominal can be produced on
620 demand, without bundling big platform-dependent heap images in the
621 Isabelle distribution.
623 * Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates
624 from Oracle provide better multi-platform experience. This version is
625 now bundled exclusively with Isabelle.
630 * Code generation for Haskell: restrict unqualified imports from
631 Haskell Prelude to a small set of fundamental operations.
633 * Command 'export_code': relative file names are interpreted
634 relatively to master directory of current theory rather than the
635 rather arbitrary current working directory. INCOMPATIBILITY.
637 * Discontinued obsolete attribute "COMP". Potential INCOMPATIBILITY,
638 use regular rule composition via "OF" / "THEN", or explicit proof
639 structure instead. Note that Isabelle/ML provides a variety of
640 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied
641 with some care where this is really required.
643 * Command 'typ' supports an additional variant with explicit sort
644 constraint, to infer and check the most general type conforming to a
645 given sort. Example (in HOL):
647 typ "_ * _ * bool * unit" :: finite
649 * Command 'locale_deps' visualizes all locales and their relations as
657 - Added MaSh relevance filter based on machine-learning; see the
658 Sledgehammer manual for details.
659 - Polished Isar proofs generated with "isar_proofs" option.
660 - Rationalized type encodings ("type_enc" option).
661 - Renamed "kill_provers" subcommand to "kill_all".
663 isar_proof ~> isar_proofs
664 isar_shrink_factor ~> isar_shrink
665 max_relevant ~> max_facts
666 relevance_thresholds ~> fact_thresholds
668 * Quickcheck: added an optimisation for equality premises. It is
669 switched on by default, and can be switched off by setting the
670 configuration quickcheck_optimise_equality to false.
672 * Quotient: only one quotient can be defined by quotient_type
676 - generation of an abstraction function equation in lift_definition
678 - renamed no_abs_code -> no_code (INCOMPATIBILITY.)
680 * Simproc "finite_Collect" rewrites set comprehensions into pointfree
683 * Preprocessing of the code generator rewrites set comprehensions into
684 pointfree expressions.
686 * The SMT solver Z3 has now by default a restricted set of directly
687 supported features. For the full set of features (div/mod, nonlinear
688 arithmetic, datatypes/records) with potential proof reconstruction
689 failures, enable the configuration option "z3_with_extensions". Minor
692 * Simplified 'typedef' specifications: historical options for implicit
693 set definition and alternative name have been discontinued. The
694 former behavior of "typedef (open) t = A" is now the default, but
695 written just "typedef t = A". INCOMPATIBILITY, need to adapt theories
698 * Removed constant "chars"; prefer "Enum.enum" on type "char"
699 directly. INCOMPATIBILITY.
701 * Moved operation product, sublists and n_lists from theory Enum to
702 List. INCOMPATIBILITY.
704 * Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY.
706 * Class "comm_monoid_diff" formalises properties of bounded
707 subtraction, with natural numbers and multisets as typical instances.
709 * Added combinator "Option.these" with type "'a option set => 'a set".
711 * Theory "Transitive_Closure": renamed lemmas
713 reflcl_tranclp -> reflclp_tranclp
714 rtranclp_reflcl -> rtranclp_reflclp
718 * Theory "Rings": renamed lemmas (in class semiring)
720 left_distrib ~> distrib_right
721 right_distrib ~> distrib_left
725 * Generalized the definition of limits:
727 - Introduced the predicate filterlim (LIM x F. f x :> G) which
728 expresses that when the input values x converge to F then the
729 output f x converges to G.
731 - Added filters for convergence to positive (at_top) and negative
734 - Moved infinity in the norm (at_infinity) from
735 Multivariate_Analysis to Complex_Main.
737 - Removed real_tendsto_inf, it is superseded by "LIM x F. f x :>
742 * Theory "Library/Option_ord" provides instantiation of option type to
743 lattice type classes.
745 * Theory "Library/Multiset": renamed
747 constant fold_mset ~> Multiset.fold
748 fact fold_mset_commute ~> fold_mset_comm
752 * Renamed theory Library/List_Prefix to Library/Sublist, with related
755 - Renamed constants (and related lemmas)
758 strict_prefix ~> prefix
760 - Replaced constant "postfix" by "suffixeq" with swapped argument
761 order (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped
762 old infix syntax "xs >>= ys"; use "suffixeq ys xs" instead.
763 Renamed lemmas accordingly.
765 - Added constant "list_hembeq" for homeomorphic embedding on
766 lists. Added abbreviation "sublisteq" for special case
767 "list_hembeq (op =)".
769 - Theory Library/Sublist no longer provides "order" and "bot" type
770 class instances for the prefix order (merely corresponding locale
771 interpretations). The type class instances are now in theory
772 Library/Prefix_Order.
774 - The sublist relation of theory Library/Sublist_Order is now based
775 on "Sublist.sublisteq". Renamed lemmas accordingly:
777 le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff
778 le_list_append_mono ~> Sublist.list_hembeq_append_mono
779 le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2
780 le_list_Cons_EX ~> Sublist.list_hembeq_ConsD
781 le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2'
782 le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq
783 le_list_drop_Cons ~> Sublist.sublisteq_Cons'
784 le_list_drop_many ~> Sublist.sublisteq_drop_many
785 le_list_filter_left ~> Sublist.sublisteq_filter_left
786 le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many
787 le_list_rev_take_iff ~> Sublist.sublisteq_append
788 le_list_same_length ~> Sublist.sublisteq_same_length
789 le_list_take_many_iff ~> Sublist.sublisteq_append'
790 less_eq_list.drop ~> less_eq_list_drop
791 less_eq_list.induct ~> less_eq_list_induct
792 not_le_list_length ~> Sublist.not_sublisteq_length
796 * New theory Library/Countable_Set.
798 * Theory Library/Debug and Library/Parallel provide debugging and
799 parallel execution for code generated towards Isabelle/ML.
801 * Theory Library/FuncSet: Extended support for Pi and extensional and
802 introduce the extensional dependent function space "PiE". Replaced
803 extensional_funcset by an abbreviation, and renamed lemmas from
804 extensional_funcset to PiE as follows:
806 extensional_empty ~> PiE_empty
807 extensional_funcset_empty_domain ~> PiE_empty_domain
808 extensional_funcset_empty_range ~> PiE_empty_range
809 extensional_funcset_arb ~> PiE_arb
810 extensional_funcset_mem ~> PiE_mem
811 extensional_funcset_extend_domainI ~> PiE_fun_upd
812 extensional_funcset_restrict_domain ~> fun_upd_in_PiE
813 extensional_funcset_extend_domain_eq ~> PiE_insert_eq
814 card_extensional_funcset ~> card_PiE
815 finite_extensional_funcset ~> finite_PiE
819 * Theory Library/FinFun: theory of almost everywhere constant
820 functions (supersedes the AFP entry "Code Generation for Functions as
823 * Theory Library/Phantom: generic phantom type to make a type
824 parameter appear in a constant's type. This alternative to adding
825 TYPE('a) as another parameter avoids unnecessary closures in generated
828 * Theory Library/RBT_Impl: efficient construction of red-black trees
829 from sorted associative lists. Merging two trees with rbt_union may
830 return a structurally different tree than before. Potential
833 * Theory Library/IArray: immutable arrays with code generation.
835 * Theory Library/Finite_Lattice: theory of finite lattices.
837 * HOL/Multivariate_Analysis: replaced
839 "basis :: 'a::euclidean_space => nat => real"
840 "\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space"
842 on euclidean spaces by using the inner product "_ \<bullet> _" with
843 vectors from the Basis set: "\<Chi>\<Chi> i. f i" is superseded by
844 "SUM i : Basis. f i * r i".
846 With this change the following constants are also changed or removed:
848 DIM('a) :: nat ~> card (Basis :: 'a set) (is an abbreviation)
849 a $$ i ~> inner a i (where i : Basis)
851 \<pi>, \<pi>' removed
853 Theorems about these constants where removed.
857 component_le_norm ~> Basis_le_norm
858 euclidean_eq ~> euclidean_eq_iff
859 differential_zero_maxmin_component ~> differential_zero_maxmin_cart
860 euclidean_simps ~> inner_simps
861 independent_basis ~> independent_Basis
862 span_basis ~> span_Basis
863 in_span_basis ~> in_span_Basis
864 norm_bound_component_le ~> norm_boound_Basis_le
865 norm_bound_component_lt ~> norm_boound_Basis_lt
866 component_le_infnorm ~> Basis_le_infnorm
872 - Added simproc "measurable" to automatically prove measurability.
874 - Added induction rules for sigma sets with disjoint union
875 (sigma_sets_induct_disjoint) and for Borel-measurable functions
876 (borel_measurable_induct).
878 - Added the Daniell-Kolmogorov theorem (the existence the limit of a
881 * HOL/Cardinals: Theories of ordinals and cardinals (supersedes the
882 AFP entry "Ordinals_and_Cardinals").
884 * HOL/BNF: New (co)datatype package based on bounded natural functors
885 with support for mixed, nested recursion and interesting non-free
888 * HOL/Finite_Set and Relation: added new set and relation operations
889 expressed by Finite_Set.fold.
891 * New theory HOL/Library/RBT_Set: implementation of sets by red-black
892 trees for the code generator.
894 * HOL/Library/RBT and HOL/Library/Mapping have been converted to
896 possible INCOMPATIBILITY.
898 * HOL/Set: renamed Set.project -> Set.filter
902 *** Document preparation ***
904 * Dropped legacy antiquotations "term_style" and "thm_style", since
905 styles may be given as arguments to "term" and "thm" already.
906 Discontinued legacy styles "prem1" .. "prem19".
908 * Default LaTeX rendering for \<euro> is now based on eurosym package,
909 instead of slightly exotic babel/greek.
911 * Document variant NAME may use different LaTeX entry point
912 document/root_NAME.tex if that file exists, instead of the common
915 * Simplified custom document/build script, instead of old-style
916 document/IsaMakefile. Minor INCOMPATIBILITY.
921 * The default limit for maximum number of worker threads is now 8,
922 instead of 4, in correspondence to capabilities of contemporary
923 hardware and Poly/ML runtime system.
925 * Type Seq.results and related operations support embedded error
926 messages within lazy enumerations, and thus allow to provide
927 informative errors in the absence of any usable results.
929 * Renamed Position.str_of to Position.here to emphasize that this is a
930 formal device to inline positions into message text, but not
931 necessarily printing visible text.
936 * Advanced support for Isabelle sessions and build management, see
937 "system" manual for the chapter of that name, especially the "isabelle
938 build" tool and its examples. The "isabelle mkroot" tool prepares
939 session root directories for use with "isabelle build", similar to
940 former "isabelle mkdir" for "isabelle usedir". Note that this affects
941 document preparation as well. INCOMPATIBILITY, isabelle usedir /
942 mkdir / make are rendered obsolete.
944 * Discontinued obsolete Isabelle/build script, it is superseded by the
945 regular isabelle build tool. For example:
947 isabelle build -s -b HOL
949 * Discontinued obsolete "isabelle makeall".
951 * Discontinued obsolete IsaMakefile and ROOT.ML files from the
952 Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that
953 provides some traditional targets that invoke "isabelle build". Note
954 that this is inefficient! Applications of Isabelle/HOL involving
955 "isabelle make" should be upgraded to use "isabelle build" directly.
957 * The "isabelle options" tool prints Isabelle system options, as
958 required for "isabelle build", for example.
960 * The "isabelle logo" tool produces EPS and PDF format simultaneously.
961 Minor INCOMPATIBILITY in command-line options.
963 * The "isabelle install" tool has now a simpler command-line. Minor
966 * The "isabelle components" tool helps to resolve add-on components
967 that are not bundled, or referenced from a bare-bones repository
970 * Settings variable ISABELLE_PLATFORM_FAMILY refers to the general
971 platform family: "linux", "macos", "windows".
973 * The ML system is configured as regular component, and no longer
974 picked up from some surrounding directory. Potential INCOMPATIBILITY
975 for home-made settings.
977 * Improved ML runtime statistics (heap, threads, future tasks etc.).
979 * Discontinued support for Poly/ML 5.2.1, which was the last version
980 without exception positions and advanced ML compiler/toplevel
983 * Discontinued special treatment of Proof General -- no longer guess
984 PROOFGENERAL_HOME based on accidental file-system layout. Minor
985 INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS
986 settings manually, or use a Proof General version that has been
987 bundled as Isabelle component.
991 New in Isabelle2012 (May 2012)
992 ------------------------------
996 * Prover IDE (PIDE) improvements:
998 - more robust Sledgehammer integration (as before the sledgehammer
999 command-line needs to be typed into the source buffer)
1000 - markup for bound variables
1001 - markup for types of term variables (displayed as tooltips)
1002 - support for user-defined Isar commands within the running session
1003 - improved support for Unicode outside original 16bit range
1004 e.g. glyph for \<A> (thanks to jEdit 4.5.1)
1006 * Forward declaration of outer syntax keywords within the theory
1007 header -- minor INCOMPATIBILITY for user-defined commands. Allow new
1008 commands to be used in the same theory where defined.
1010 * Auxiliary contexts indicate block structure for specifications with
1011 additional parameters and assumptions. Such unnamed contexts may be
1012 nested within other targets, like 'theory', 'locale', 'class',
1013 'instantiation' etc. Results from the local context are generalized
1014 accordingly and applied to the enclosing target context. Example:
1018 assumes xy: "x = y" and yz: "y = z"
1021 lemma my_trans: "x = z" using xy yz by simp
1027 The most basic application is to factor-out context elements of
1028 several fixes/assumes/shows theorem statements, e.g. see
1029 ~~/src/HOL/Isar_Examples/Group_Context.thy
1031 Any other local theory specification element works within the "context
1032 ... begin ... end" block as well.
1034 * Bundled declarations associate attributed fact expressions with a
1035 given name in the context. These may be later included in other
1036 contexts. This allows to manage context extensions casually, without
1037 the logical dependencies of locales and locale interpretation. See
1038 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.
1040 * Commands 'lemmas' and 'theorems' allow local variables using 'for'
1041 declaration, and results are standardized before being stored. Thus
1042 old-style "standard" after instantiation or composition of facts
1043 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of
1044 indices of schematic variables.
1046 * Rule attributes in local theory declarations (e.g. locale or class)
1047 are now statically evaluated: the resulting theorem is stored instead
1048 of the original expression. INCOMPATIBILITY in rare situations, where
1049 the historic accident of dynamic re-evaluation in interpretations
1052 * New tutorial "Programming and Proving in Isabelle/HOL"
1053 ("prog-prove"). It completely supersedes "A Tutorial Introduction to
1054 Structured Isar Proofs" ("isar-overview"), which has been removed. It
1055 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order
1056 Logic" as the recommended beginners tutorial, but does not cover all
1057 of the material of that old tutorial.
1059 * Updated and extended reference manuals: "isar-ref",
1060 "implementation", "system"; reduced remaining material in old "ref"
1066 * Command 'definition' no longer exports the foundational "raw_def"
1067 into the user context. Minor INCOMPATIBILITY, may use the regular
1068 "def" result with attribute "abs_def" to imitate the old version.
1070 * Attribute "abs_def" turns an equation of the form "f x y == t" into
1071 "f == %x y. t", which ensures that "simp" or "unfold" steps always
1072 expand it. This also works for object-logic equality. (Formerly
1073 undocumented feature.)
1075 * Sort constraints are now propagated in simultaneous statements, just
1076 like type constraints. INCOMPATIBILITY in rare situations, where
1077 distinct sorts used to be assigned accidentally. For example:
1079 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"
1081 lemma "P (x::'a)" and "Q (y::'a::bar)"
1082 -- "now uniform 'a::bar instead of default sort for first occurrence (!)"
1084 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more
1085 tolerant against multiple unifiers, as long as the final result is
1086 unique. (As before, rules are composed in canonical right-to-left
1087 order to accommodate newly introduced premises.)
1089 * Renamed some inner syntax categories:
1095 Minor INCOMPATIBILITY. Note that in practice "num_const" or
1096 "num_position" etc. are mainly used instead (which also include
1097 position information via constraints).
1099 * Simplified configuration options for syntax ambiguity: see
1100 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
1101 manual. Minor INCOMPATIBILITY.
1103 * Discontinued configuration option "syntax_positions": atomic terms
1104 in parse trees are always annotated by position constraints.
1106 * Old code generator for SML and its commands 'code_module',
1107 'code_library', 'consts_code', 'types_code' have been discontinued.
1108 Use commands of the generic code generator instead. INCOMPATIBILITY.
1110 * Redundant attribute "code_inline" has been discontinued. Use
1111 "code_unfold" instead. INCOMPATIBILITY.
1113 * Dropped attribute "code_unfold_post" in favor of the its dual
1114 "code_abbrev", which yields a common pattern in definitions like
1116 definition [code_abbrev]: "f = t"
1120 * Obsolete 'types' command has been discontinued. Use 'type_synonym'
1121 instead. INCOMPATIBILITY.
1123 * Discontinued old "prems" fact, which used to refer to the accidental
1124 collection of foundational premises in the context (already marked as
1125 legacy since Isabelle2011).
1130 * Type 'a set is now a proper type constructor (just as before
1131 Isabelle2008). Definitions mem_def and Collect_def have disappeared.
1132 Non-trivial INCOMPATIBILITY. For developments keeping predicates and
1133 sets separate, it is often sufficient to rephrase some set S that has
1134 been accidentally used as predicates by "%x. x : S", and some
1135 predicate P that has been accidentally used as set by "{x. P x}".
1136 Corresponding proofs in a first step should be pruned from any
1137 tinkering with former theorems mem_def and Collect_def as far as
1140 For developments which deliberately mix predicates and sets, a
1141 planning step is necessary to determine what should become a predicate
1142 and what a set. It can be helpful to carry out that step in
1143 Isabelle2011-1 before jumping right into the current release.
1145 * Code generation by default implements sets as container type rather
1146 than predicates. INCOMPATIBILITY.
1148 * New type synonym 'a rel = ('a * 'a) set
1150 * The representation of numerals has changed. Datatype "num"
1151 represents strictly positive binary numerals, along with functions
1152 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent
1153 positive and negated numeric literals, respectively. See also
1154 definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some
1155 user theories may require adaptations as follows:
1157 - Theorems with number_ring or number_semiring constraints: These
1158 classes are gone; use comm_ring_1 or comm_semiring_1 instead.
1160 - Theories defining numeric types: Remove number, number_semiring,
1161 and number_ring instances. Defer all theorems about numerals until
1162 after classes one and semigroup_add have been instantiated.
1164 - Numeral-only simp rules: Replace each rule having a "number_of v"
1165 pattern with two copies, one for numeral and one for neg_numeral.
1167 - Theorems about subclasses of semiring_1 or ring_1: These classes
1168 automatically support numerals now, so more simp rules and
1169 simprocs may now apply within the proof.
1171 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:
1172 Redefine using other integer operations.
1174 * Transfer: New package intended to generalize the existing
1175 "descending" method and related theorem attributes from the Quotient
1176 package. (Not all functionality is implemented yet, but future
1177 development will focus on Transfer as an eventual replacement for the
1178 corresponding parts of the Quotient package.)
1180 - transfer_rule attribute: Maintains a collection of transfer rules,
1181 which relate constants at two different types. Transfer rules may
1182 relate different type instances of the same polymorphic constant,
1183 or they may relate an operation on a raw type to a corresponding
1184 operation on an abstract type (quotient or subtype). For example:
1186 ((A ===> B) ===> list_all2 A ===> list_all2 B) map map
1187 (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int
1189 - transfer method: Replaces a subgoal on abstract types with an
1190 equivalent subgoal on the corresponding raw types. Constants are
1191 replaced with corresponding ones according to the transfer rules.
1192 Goals are generalized over all free variables by default; this is
1193 necessary for variables whose types change, but can be overridden
1194 for specific variables with e.g. "transfer fixing: x y z". The
1195 variant transfer' method allows replacing a subgoal with one that
1196 is logically stronger (rather than equivalent).
1198 - relator_eq attribute: Collects identity laws for relators of
1199 various type constructors, e.g. "list_all2 (op =) = (op =)". The
1200 transfer method uses these lemmas to infer transfer rules for
1201 non-polymorphic constants on the fly.
1203 - transfer_prover method: Assists with proving a transfer rule for a
1204 new constant, provided the constant is defined in terms of other
1205 constants that already have transfer rules. It should be applied
1206 after unfolding the constant definitions.
1208 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer
1209 from type nat to type int.
1211 * Lifting: New package intended to generalize the quotient_definition
1212 facility of the Quotient package; designed to work with Transfer.
1214 - lift_definition command: Defines operations on an abstract type in
1215 terms of a corresponding operation on a representation
1216 type. Example syntax:
1218 lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"
1221 Users must discharge a respectfulness proof obligation when each
1222 constant is defined. (For a type copy, i.e. a typedef with UNIV,
1223 the proof is discharged automatically.) The obligation is
1224 presented in a user-friendly, readable form; a respectfulness
1225 theorem in the standard format and a transfer rule are generated
1228 - Integration with code_abstype: For typedefs (e.g. subtypes
1229 corresponding to a datatype invariant, such as dlist),
1230 lift_definition generates a code certificate theorem and sets up
1231 code generation for each constant.
1233 - setup_lifting command: Sets up the Lifting package to work with a
1234 user-defined type. The user must provide either a quotient theorem
1235 or a type_definition theorem. The package configures transfer
1236 rules for equality and quantifiers on the type, and sets up the
1237 lift_definition command to work with the type.
1239 - Usage examples: See Quotient_Examples/Lift_DList.thy,
1240 Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,
1241 Word/Word.thy and Library/Float.thy.
1245 - The 'quotient_type' command now supports a 'morphisms' option with
1246 rep and abs functions, similar to typedef.
1248 - 'quotient_type' sets up new types to work with the Lifting and
1249 Transfer packages, as with 'setup_lifting'.
1251 - The 'quotient_definition' command now requires the user to prove a
1252 respectfulness property at the point where the constant is
1253 defined, similar to lift_definition; INCOMPATIBILITY.
1255 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems
1256 accordingly, INCOMPATIBILITY.
1258 * New diagnostic command 'find_unused_assms' to find potentially
1259 superfluous assumptions in theorems using Quickcheck.
1263 - Quickcheck returns variable assignments as counterexamples, which
1264 allows to reveal the underspecification of functions under test.
1265 For example, refuting "hd xs = x", it presents the variable
1266 assignment xs = [] and x = a1 as a counterexample, assuming that
1267 any property is false whenever "hd []" occurs in it.
1269 These counterexample are marked as potentially spurious, as
1270 Quickcheck also returns "xs = []" as a counterexample to the
1271 obvious theorem "hd xs = hd xs".
1273 After finding a potentially spurious counterexample, Quickcheck
1274 continues searching for genuine ones.
1276 By default, Quickcheck shows potentially spurious and genuine
1277 counterexamples. The option "genuine_only" sets quickcheck to only
1278 show genuine counterexamples.
1280 - The command 'quickcheck_generator' creates random and exhaustive
1281 value generators for a given type and operations.
1283 It generates values by using the operations as if they were
1284 constructors of that type.
1286 - Support for multisets.
1288 - Added "use_subtype" options.
1290 - Added "quickcheck_locale" configuration to specify how to process
1291 conjectures in a locale context.
1293 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option
1294 and affecting 'rat' and 'real'.
1297 - Integrated more tightly with SPASS, as described in the ITP 2012
1298 paper "More SPASS with Isabelle".
1299 - Made it try "smt" as a fallback if "metis" fails or times out.
1300 - Added support for the following provers: Alt-Ergo (via Why3 and
1301 TFF1), iProver, iProver-Eq.
1302 - Sped up the minimizer.
1303 - Added "lam_trans", "uncurry_aliases", and "minimize" options.
1304 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
1305 - Renamed "sound" option to "strict".
1307 * Metis: Added possibility to specify lambda translations scheme as a
1308 parenthesized argument (e.g., "by (metis (lifting) ...)").
1310 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".
1312 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.
1314 * New "case_product" attribute to generate a case rule doing multiple
1315 case distinctions at the same time. E.g.
1317 list.exhaust [case_product nat.exhaust]
1319 produces a rule which can be used to perform case distinction on both
1322 * New "eventually_elim" method as a generalized variant of the
1323 eventually_elim* rules. Supports structured proofs.
1325 * Typedef with implicit set definition is considered legacy. Use
1326 "typedef (open)" form instead, which will eventually become the
1329 * Record: code generation can be switched off manually with
1331 declare [[record_coden = false]] -- "default true"
1333 * Datatype: type parameters allow explicit sort constraints.
1335 * Concrete syntax for case expressions includes constraints for source
1336 positions, and thus produces Prover IDE markup for its bindings.
1337 INCOMPATIBILITY for old-style syntax translations that augment the
1338 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
1341 * Clarified attribute "mono_set": pure declaration without modifying
1342 the result of the fact expression.
1344 * More default pred/set conversions on a couple of relation operations
1345 and predicates. Added powers of predicate relations. Consolidation
1346 of some relation theorems:
1348 converse_def ~> converse_unfold
1349 rel_comp_def ~> relcomp_unfold
1350 symp_def ~> (modified, use symp_def and sym_def instead)
1351 transp_def ~> transp_trans
1352 Domain_def ~> Domain_unfold
1353 Range_def ~> Domain_converse [symmetric]
1355 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.
1357 See theory "Relation" for examples for making use of pred/set
1358 conversions by means of attributes "to_set" and "to_pred".
1362 * Renamed facts about the power operation on relations, i.e., relpow
1363 to match the constant's name:
1365 rel_pow_1 ~> relpow_1
1366 rel_pow_0_I ~> relpow_0_I
1367 rel_pow_Suc_I ~> relpow_Suc_I
1368 rel_pow_Suc_I2 ~> relpow_Suc_I2
1369 rel_pow_0_E ~> relpow_0_E
1370 rel_pow_Suc_E ~> relpow_Suc_E
1371 rel_pow_E ~> relpow_E
1372 rel_pow_Suc_D2 ~> relpow_Suc_D2
1373 rel_pow_Suc_E2 ~> relpow_Suc_E2
1374 rel_pow_Suc_D2' ~> relpow_Suc_D2'
1375 rel_pow_E2 ~> relpow_E2
1376 rel_pow_add ~> relpow_add
1377 rel_pow_commute ~> relpow
1378 rel_pow_empty ~> relpow_empty:
1379 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
1380 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
1381 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
1382 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
1383 rel_pow_fun_conv ~> relpow_fun_conv
1384 rel_pow_finite_bounded1 ~> relpow_finite_bounded1
1385 rel_pow_finite_bounded ~> relpow_finite_bounded
1386 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
1387 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
1388 single_valued_rel_pow ~> single_valued_relpow
1392 * Theory Relation: Consolidated constant name for relation composition
1393 and corresponding theorem names:
1395 - Renamed constant rel_comp to relcomp.
1397 - Dropped abbreviation pred_comp. Use relcompp instead.
1401 rel_compI ~> relcompI
1402 rel_compEpair ~> relcompEpair
1403 rel_compE ~> relcompE
1404 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq
1405 rel_comp_empty1 ~> relcomp_empty1
1406 rel_comp_mono ~> relcomp_mono
1407 rel_comp_subset_Sigma ~> relcomp_subset_Sigma
1408 rel_comp_distrib ~> relcomp_distrib
1409 rel_comp_distrib2 ~> relcomp_distrib2
1410 rel_comp_UNION_distrib ~> relcomp_UNION_distrib
1411 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2
1412 single_valued_rel_comp ~> single_valued_relcomp
1413 rel_comp_def ~> relcomp_unfold
1414 converse_rel_comp ~> converse_relcomp
1415 pred_compI ~> relcomppI
1416 pred_compE ~> relcomppE
1417 pred_comp_bot1 ~> relcompp_bot1
1418 pred_comp_bot2 ~> relcompp_bot2
1419 transp_pred_comp_less_eq ~> transp_relcompp_less_eq
1420 pred_comp_mono ~> relcompp_mono
1421 pred_comp_distrib ~> relcompp_distrib
1422 pred_comp_distrib2 ~> relcompp_distrib2
1423 converse_pred_comp ~> converse_relcompp
1425 finite_rel_comp ~> finite_relcomp
1427 set_rel_comp ~> set_relcomp
1431 * Theory Divides: Discontinued redundant theorems about div and mod.
1432 INCOMPATIBILITY, use the corresponding generic theorems instead.
1434 DIVISION_BY_ZERO ~> div_by_0, mod_by_0
1435 zdiv_self ~> div_self
1436 zmod_self ~> mod_self
1439 zdiv_zmod_equality ~> div_mod_equality2
1440 zdiv_zmod_equality2 ~> div_mod_equality
1441 zmod_zdiv_trivial ~> mod_div_trivial
1442 zdiv_zminus_zminus ~> div_minus_minus
1443 zmod_zminus_zminus ~> mod_minus_minus
1444 zdiv_zminus2 ~> div_minus_right
1445 zmod_zminus2 ~> mod_minus_right
1446 zdiv_minus1_right ~> div_minus1_right
1447 zmod_minus1_right ~> mod_minus1_right
1448 zdvd_mult_div_cancel ~> dvd_mult_div_cancel
1449 zmod_zmult1_eq ~> mod_mult_right_eq
1450 zpower_zmod ~> power_mod
1451 zdvd_zmod ~> dvd_mod
1452 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd
1453 mod_mult_distrib ~> mult_mod_left
1454 mod_mult_distrib2 ~> mult_mod_right
1456 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use
1457 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.
1459 * Finite_Set.fold now qualified. INCOMPATIBILITY.
1461 * Consolidated theorem names concerning fold combinators:
1463 inf_INFI_fold_inf ~> inf_INF_fold_inf
1464 sup_SUPR_fold_sup ~> sup_SUP_fold_sup
1465 INFI_fold_inf ~> INF_fold_inf
1466 SUPR_fold_sup ~> SUP_fold_sup
1467 union_set ~> union_set_fold
1468 minus_set ~> minus_set_fold
1469 INFI_set_fold ~> INF_set_fold
1470 SUPR_set_fold ~> SUP_set_fold
1471 INF_code ~> INF_set_foldr
1472 SUP_code ~> SUP_set_foldr
1473 foldr.simps ~> foldr.simps (in point-free formulation)
1474 foldr_fold_rev ~> foldr_conv_fold
1475 foldl_fold ~> foldl_conv_fold
1476 foldr_foldr ~> foldr_conv_foldl
1477 foldl_foldr ~> foldl_conv_foldr
1478 fold_set_remdups ~> fold_set_fold_remdups
1479 fold_set ~> fold_set_fold
1480 fold1_set ~> fold1_set_fold
1484 * Dropped rarely useful theorems concerning fold combinators:
1485 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
1486 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
1487 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
1488 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
1489 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,
1490 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.
1491 INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0"
1492 and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be
1493 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by
1494 unfolding "foldr_conv_fold" and "foldl_conv_fold".
1496 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,
1497 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,
1498 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,
1499 INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding
1500 lemmas over fold rather than foldr, or make use of lemmas
1501 fold_conv_foldr and fold_rev.
1503 * Congruence rules Option.map_cong and Option.bind_cong for recursion
1504 through option types.
1506 * "Transitive_Closure.ntrancl": bounded transitive closure on
1509 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.
1511 * Theory Int: Discontinued many legacy theorems specific to type int.
1512 INCOMPATIBILITY, use the corresponding generic theorems instead.
1514 zminus_zminus ~> minus_minus
1515 zminus_0 ~> minus_zero
1516 zminus_zadd_distrib ~> minus_add_distrib
1517 zadd_commute ~> add_commute
1518 zadd_assoc ~> add_assoc
1519 zadd_left_commute ~> add_left_commute
1522 zadd_0 ~> add_0_left
1523 zadd_0_right ~> add_0_right
1524 zadd_zminus_inverse2 ~> left_minus
1525 zmult_zminus ~> mult_minus_left
1526 zmult_commute ~> mult_commute
1527 zmult_assoc ~> mult_assoc
1528 zadd_zmult_distrib ~> left_distrib
1529 zadd_zmult_distrib2 ~> right_distrib
1530 zdiff_zmult_distrib ~> left_diff_distrib
1531 zdiff_zmult_distrib2 ~> right_diff_distrib
1532 zmult_1 ~> mult_1_left
1533 zmult_1_right ~> mult_1_right
1534 zle_refl ~> order_refl
1535 zle_trans ~> order_trans
1536 zle_antisym ~> order_antisym
1537 zle_linear ~> linorder_linear
1538 zless_linear ~> linorder_less_linear
1539 zadd_left_mono ~> add_left_mono
1540 zadd_strict_right_mono ~> add_strict_right_mono
1541 zadd_zless_mono ~> add_less_le_mono
1542 int_0_less_1 ~> zero_less_one
1543 int_0_neq_1 ~> zero_neq_one
1545 zpower_zadd_distrib ~> power_add
1546 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
1547 zero_le_zpower_abs ~> zero_le_power_abs
1549 * Theory Deriv: Renamed
1551 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
1553 * Theory Library/Multiset: Improved code generation of multisets.
1555 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets
1556 are expressed via type classes again. The special syntax
1557 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant
1558 setsum_set, which is now subsumed by Big_Operators.setsum.
1561 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
1562 use theory HOL/Library/Nat_Bijection instead.
1564 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black
1565 trees is now inside a type class context. Names of affected
1566 operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for
1567 theories working directly with raw red-black trees, adapt the names as
1571 bulkload -> rbt_bulkload
1572 del_from_left -> rbt_del_from_left
1573 del_from_right -> rbt_del_from_right
1575 delete -> rbt_delete
1577 insert -> rbt_insert
1578 insertw -> rbt_insert_with
1579 insert_with_key -> rbt_insert_with_key
1580 map_entry -> rbt_map_entry
1581 lookup -> rbt_lookup
1582 sorted -> rbt_sorted
1583 tree_greater -> rbt_greater
1584 tree_less -> rbt_less
1585 tree_less_symbol -> rbt_less_symbol
1587 union_with -> rbt_union_with
1588 union_with_key -> rbt_union_with_key
1591 balance_left_sorted -> balance_left_rbt_sorted
1592 balance_left_tree_greater -> balance_left_rbt_greater
1593 balance_left_tree_less -> balance_left_rbt_less
1594 balance_right_sorted -> balance_right_rbt_sorted
1595 balance_right_tree_greater -> balance_right_rbt_greater
1596 balance_right_tree_less -> balance_right_rbt_less
1597 balance_sorted -> balance_rbt_sorted
1598 balance_tree_greater -> balance_rbt_greater
1599 balance_tree_less -> balance_rbt_less
1600 bulkload_is_rbt -> rbt_bulkload_is_rbt
1601 combine_sorted -> combine_rbt_sorted
1602 combine_tree_greater -> combine_rbt_greater
1603 combine_tree_less -> combine_rbt_less
1604 delete_in_tree -> rbt_delete_in_tree
1605 delete_is_rbt -> rbt_delete_is_rbt
1606 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater
1607 del_from_left_tree_less -> rbt_del_from_left_rbt_less
1608 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater
1609 del_from_right_tree_less -> rbt_del_from_right_rbt_less
1610 del_in_tree -> rbt_del_in_tree
1611 del_inv1_inv2 -> rbt_del_inv1_inv2
1612 del_sorted -> rbt_del_rbt_sorted
1613 del_tree_greater -> rbt_del_rbt_greater
1614 del_tree_less -> rbt_del_rbt_less
1615 dom_lookup_Branch -> dom_rbt_lookup_Branch
1616 entries_lookup -> entries_rbt_lookup
1617 finite_dom_lookup -> finite_dom_rbt_lookup
1618 insert_sorted -> rbt_insert_rbt_sorted
1619 insertw_is_rbt -> rbt_insertw_is_rbt
1620 insertwk_is_rbt -> rbt_insertwk_is_rbt
1621 insertwk_sorted -> rbt_insertwk_rbt_sorted
1622 insertw_sorted -> rbt_insertw_rbt_sorted
1623 ins_sorted -> ins_rbt_sorted
1624 ins_tree_greater -> ins_rbt_greater
1625 ins_tree_less -> ins_rbt_less
1626 is_rbt_sorted -> is_rbt_rbt_sorted
1627 lookup_balance -> rbt_lookup_balance
1628 lookup_bulkload -> rbt_lookup_rbt_bulkload
1629 lookup_delete -> rbt_lookup_rbt_delete
1630 lookup_Empty -> rbt_lookup_Empty
1631 lookup_from_in_tree -> rbt_lookup_from_in_tree
1632 lookup_in_tree -> rbt_lookup_in_tree
1633 lookup_ins -> rbt_lookup_ins
1634 lookup_insert -> rbt_lookup_rbt_insert
1635 lookup_insertw -> rbt_lookup_rbt_insertw
1636 lookup_insertwk -> rbt_lookup_rbt_insertwk
1637 lookup_keys -> rbt_lookup_keys
1638 lookup_map -> rbt_lookup_map
1639 lookup_map_entry -> rbt_lookup_rbt_map_entry
1640 lookup_tree_greater -> rbt_lookup_rbt_greater
1641 lookup_tree_less -> rbt_lookup_rbt_less
1642 lookup_union -> rbt_lookup_rbt_union
1643 map_entry_color_of -> rbt_map_entry_color_of
1644 map_entry_inv1 -> rbt_map_entry_inv1
1645 map_entry_inv2 -> rbt_map_entry_inv2
1646 map_entry_is_rbt -> rbt_map_entry_is_rbt
1647 map_entry_sorted -> rbt_map_entry_rbt_sorted
1648 map_entry_tree_greater -> rbt_map_entry_rbt_greater
1649 map_entry_tree_less -> rbt_map_entry_rbt_less
1650 map_tree_greater -> map_rbt_greater
1651 map_tree_less -> map_rbt_less
1652 map_sorted -> map_rbt_sorted
1653 paint_sorted -> paint_rbt_sorted
1654 paint_lookup -> paint_rbt_lookup
1655 paint_tree_greater -> paint_rbt_greater
1656 paint_tree_less -> paint_rbt_less
1657 sorted_entries -> rbt_sorted_entries
1658 tree_greater_eq_trans -> rbt_greater_eq_trans
1659 tree_greater_nit -> rbt_greater_nit
1660 tree_greater_prop -> rbt_greater_prop
1661 tree_greater_simps -> rbt_greater_simps
1662 tree_greater_trans -> rbt_greater_trans
1663 tree_less_eq_trans -> rbt_less_eq_trans
1664 tree_less_nit -> rbt_less_nit
1665 tree_less_prop -> rbt_less_prop
1666 tree_less_simps -> rbt_less_simps
1667 tree_less_trans -> rbt_less_trans
1668 tree_ord_props -> rbt_ord_props
1669 union_Branch -> rbt_union_Branch
1670 union_is_rbt -> rbt_union_is_rbt
1671 unionw_is_rbt -> rbt_unionw_is_rbt
1672 unionwk_is_rbt -> rbt_unionwk_is_rbt
1673 unionwk_sorted -> rbt_unionwk_rbt_sorted
1675 * Theory HOL/Library/Float: Floating point numbers are now defined as
1676 a subset of the real numbers. All operations are defined using the
1677 lifing-framework and proofs use the transfer method. INCOMPATIBILITY.
1684 round_down -> float_round_down
1685 round_up -> float_round_up
1689 ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod
1692 abs_float_def -> Float.compute_float_abs
1693 bitlen_ge0 -> bitlen_nonneg
1694 bitlen.simps -> Float.compute_bitlen
1695 float_components -> Float_mantissa_exponent
1696 float_divl.simps -> Float.compute_float_divl
1697 float_divr.simps -> Float.compute_float_divr
1698 float_eq_odd -> mult_powr_eq_mult_powr_iff
1699 float_power -> real_of_float_power
1700 lapprox_posrat_def -> Float.compute_lapprox_posrat
1701 lapprox_rat.simps -> Float.compute_lapprox_rat
1702 le_float_def' -> Float.compute_float_le
1703 le_float_def -> less_eq_float.rep_eq
1704 less_float_def' -> Float.compute_float_less
1705 less_float_def -> less_float.rep_eq
1706 normfloat_def -> Float.compute_normfloat
1707 normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0
1708 normfloat -> normfloat_def
1709 normfloat_unique -> use normfloat_def
1710 number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral
1711 one_float_def -> Float.compute_float_one
1712 plus_float_def -> Float.compute_float_plus
1713 rapprox_posrat_def -> Float.compute_rapprox_posrat
1714 rapprox_rat.simps -> Float.compute_rapprox_rat
1715 real_of_float_0 -> zero_float.rep_eq
1716 real_of_float_1 -> one_float.rep_eq
1717 real_of_float_abs -> abs_float.rep_eq
1718 real_of_float_add -> plus_float.rep_eq
1719 real_of_float_minus -> uminus_float.rep_eq
1720 real_of_float_mult -> times_float.rep_eq
1721 real_of_float_simp -> Float.rep_eq
1722 real_of_float_sub -> minus_float.rep_eq
1723 round_down.simps -> Float.compute_float_round_down
1724 round_up.simps -> Float.compute_float_round_up
1725 times_float_def -> Float.compute_float_times
1726 uminus_float_def -> Float.compute_float_uminus
1727 zero_float_def -> Float.compute_float_zero
1729 Lemmas not necessary anymore, use the transfer method:
1730 bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,
1731 float_divr, float_le_simp, float_less1_mantissa_bound,
1732 float_less_simp, float_less_zero, float_le_zero,
1733 float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,
1734 floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,
1735 lapprox_rat_bottom, normalized_float, rapprox_posrat,
1736 rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,
1737 real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,
1738 round_up, zero_le_float, zero_less_float
1740 * New theory HOL/Library/DAList provides an abstract type for
1741 association lists with distinct keys.
1743 * Session HOL/IMP: Added new theory of abstract interpretation of
1746 * Session HOL-Import: Re-implementation from scratch is faster,
1747 simpler, and more scalable. Requires a proof bundle, which is
1748 available as an external component. Discontinued old (and mostly
1749 dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY.
1751 * Session HOL-Word: Discontinued many redundant theorems specific to
1752 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
1755 word_sub_alt ~> word_sub_wi
1756 word_add_alt ~> word_add_def
1757 word_mult_alt ~> word_mult_def
1758 word_minus_alt ~> word_minus_def
1759 word_0_alt ~> word_0_wi
1760 word_1_alt ~> word_1_wi
1761 word_add_0 ~> add_0_left
1762 word_add_0_right ~> add_0_right
1763 word_mult_1 ~> mult_1_left
1764 word_mult_1_right ~> mult_1_right
1765 word_add_commute ~> add_commute
1766 word_add_assoc ~> add_assoc
1767 word_add_left_commute ~> add_left_commute
1768 word_mult_commute ~> mult_commute
1769 word_mult_assoc ~> mult_assoc
1770 word_mult_left_commute ~> mult_left_commute
1771 word_left_distrib ~> left_distrib
1772 word_right_distrib ~> right_distrib
1773 word_left_minus ~> left_minus
1774 word_diff_0_right ~> diff_0_right
1775 word_diff_self ~> diff_self
1776 word_sub_def ~> diff_minus
1777 word_diff_minus ~> diff_minus
1778 word_add_ac ~> add_ac
1779 word_mult_ac ~> mult_ac
1780 word_plus_ac0 ~> add_0_left add_0_right add_ac
1781 word_times_ac1 ~> mult_1_left mult_1_right mult_ac
1782 word_order_trans ~> order_trans
1783 word_order_refl ~> order_refl
1784 word_order_antisym ~> order_antisym
1785 word_order_linear ~> linorder_linear
1786 lenw1_zero_neq_one ~> zero_neq_one
1787 word_number_of_eq ~> number_of_eq
1788 word_of_int_add_hom ~> wi_hom_add
1789 word_of_int_sub_hom ~> wi_hom_sub
1790 word_of_int_mult_hom ~> wi_hom_mult
1791 word_of_int_minus_hom ~> wi_hom_neg
1792 word_of_int_succ_hom ~> wi_hom_succ
1793 word_of_int_pred_hom ~> wi_hom_pred
1794 word_of_int_0_hom ~> word_0_wi
1795 word_of_int_1_hom ~> word_1_wi
1797 * Session HOL-Word: New proof method "word_bitwise" for splitting
1798 machine word equalities and inequalities into logical circuits,
1799 defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction,
1800 multiplication, shifting by constants, bitwise operators and numeric
1801 constants. Requires fixed-length word types, not 'a word. Solves
1802 many standard word identities outright and converts more into first
1803 order problems amenable to blast or similar. See also examples in
1804 HOL/Word/Examples/WordExamples.thy.
1806 * Session HOL-Probability: Introduced the type "'a measure" to
1807 represent measures, this replaces the records 'a algebra and 'a
1808 measure_space. The locales based on subset_class now have two
1809 locale-parameters the space \<Omega> and the set of measurable sets M.
1810 The product of probability spaces uses now the same constant as the
1811 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)
1812 measure". Most constants are defined now outside of locales and gain
1813 an additional parameter, like null_sets, almost_eventually or \<mu>'.
1814 Measure space constructions for distributions and densities now got
1815 their own constants distr and density. Instead of using locales to
1816 describe measure spaces with a finite space, the measure count_space
1817 and point_measure is introduced. INCOMPATIBILITY.
1821 finite_measure.\<mu>' -> measure
1822 product_algebra_generator -> prod_algebra
1823 product_prob_space.emb -> prod_emb
1824 product_prob_space.infprod_algebra -> PiM
1827 completeable_measure_space
1828 finite_measure_space
1830 finite_product_finite_prob_space
1831 finite_product_sigma_algebra
1832 finite_sigma_algebra
1834 pair_finite_prob_space
1835 pair_finite_sigma_algebra
1838 product_sigma_algebra
1842 distribution -> use distr measure, or distributed predicate
1844 joint_distribution -> use distr measure, or distributed predicate
1845 pair_measure_generator
1846 product_prob_space.infprod_algebra -> use PiM
1849 Replacement theorems:
1850 finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite
1851 finite_measure.empty_measure -> measure_empty
1852 finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq
1853 finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq
1854 finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably
1855 finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure
1856 finite_measure.finite_measure -> finite_measure.emeasure_finite
1857 finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton
1858 finite_measure.positive_measure' -> measure_nonneg
1859 finite_measure.real_measure -> finite_measure.emeasure_real
1860 finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb
1861 finite_product_sigma_algebra.in_P -> sets_PiM_I_finite
1862 finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty
1863 information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed
1864 information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple
1865 information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple
1866 information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple
1867 information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple
1868 information_space.entropy_commute -> information_space.entropy_commute_simple
1869 information_space.entropy_eq -> information_space.entropy_simple_distributed
1870 information_space.entropy_generic_eq -> information_space.entropy_simple_distributed
1871 information_space.entropy_positive -> information_space.entropy_nonneg_simple
1872 information_space.entropy_uniform_max -> information_space.entropy_uniform
1873 information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq
1874 information_space.KL_eq_0 -> information_space.KL_same_eq_0
1875 information_space.KL_ge_0 -> information_space.KL_nonneg
1876 information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed
1877 information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple
1878 Int_stable_cuboids -> Int_stable_atLeastAtMost
1879 Int_stable_product_algebra_generator -> positive_integral
1880 measure_preserving -> equality "distr M N f = N" "f : measurable M N"
1881 measure_space.additive -> emeasure_additive
1882 measure_space.AE_iff_null_set -> AE_iff_null
1883 measure_space.almost_everywhere_def -> eventually_ae_filter
1884 measure_space.almost_everywhere_vimage -> AE_distrD
1885 measure_space.continuity_from_above -> INF_emeasure_decseq
1886 measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq
1887 measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq
1888 measure_space.continuity_from_below -> SUP_emeasure_incseq
1889 measure_space_density -> emeasure_density
1890 measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density
1891 measure_space.integrable_vimage -> integrable_distr
1892 measure_space.integral_translated_density -> integral_density
1893 measure_space.integral_vimage -> integral_distr
1894 measure_space.measure_additive -> plus_emeasure
1895 measure_space.measure_compl -> emeasure_compl
1896 measure_space.measure_countable_increasing -> emeasure_countable_increasing
1897 measure_space.measure_countably_subadditive -> emeasure_subadditive_countably
1898 measure_space.measure_decseq -> decseq_emeasure
1899 measure_space.measure_Diff -> emeasure_Diff
1900 measure_space.measure_Diff_null_set -> emeasure_Diff_null_set
1901 measure_space.measure_eq_0 -> emeasure_eq_0
1902 measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite
1903 measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton
1904 measure_space.measure_incseq -> incseq_emeasure
1905 measure_space.measure_insert -> emeasure_insert
1906 measure_space.measure_mono -> emeasure_mono
1907 measure_space.measure_not_negative -> emeasure_not_MInf
1908 measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq
1909 measure_space.measure_setsum -> setsum_emeasure
1910 measure_space.measure_setsum_split -> setsum_emeasure_cover
1911 measure_space.measure_space_vimage -> emeasure_distr
1912 measure_space.measure_subadditive_finite -> emeasure_subadditive_finite
1913 measure_space.measure_subadditive -> subadditive
1914 measure_space.measure_top -> emeasure_space
1915 measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0
1916 measure_space.measure_Un_null_set -> emeasure_Un_null_set
1917 measure_space.positive_integral_translated_density -> positive_integral_density
1918 measure_space.positive_integral_vimage -> positive_integral_distr
1919 measure_space.real_continuity_from_above -> Lim_measure_decseq
1920 measure_space.real_continuity_from_below -> Lim_measure_incseq
1921 measure_space.real_measure_countably_subadditive -> measure_subadditive_countably
1922 measure_space.real_measure_Diff -> measure_Diff
1923 measure_space.real_measure_finite_Union -> measure_finite_Union
1924 measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton
1925 measure_space.real_measure_subadditive -> measure_subadditive
1926 measure_space.real_measure_Union -> measure_Union
1927 measure_space.real_measure_UNION -> measure_UNION
1928 measure_space.simple_function_vimage -> simple_function_comp
1929 measure_space.simple_integral_vimage -> simple_integral_distr
1930 measure_space.simple_integral_vimage -> simple_integral_distr
1931 measure_unique_Int_stable -> measure_eqI_generator_eq
1932 measure_unique_Int_stable_vimage -> measure_eqI_generator_eq
1933 pair_sigma_algebra.measurable_cut_fst -> sets_Pair1
1934 pair_sigma_algebra.measurable_cut_snd -> sets_Pair2
1935 pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1
1936 pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2
1937 pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff
1938 pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap
1939 pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'
1940 pair_sigma_algebra.sets_swap -> sets_pair_swap
1941 pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1
1942 pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2
1943 pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap
1944 pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2
1945 pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt
1946 pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times
1947 prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM
1948 prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq
1949 prob_space.measure_space_1 -> prob_space.emeasure_space_1
1950 prob_space.prob_space_vimage -> prob_space_distr
1951 prob_space.random_variable_restrict -> measurable_restrict
1952 prob_space_unique_Int_stable -> measure_eqI_prob_space
1953 product_algebraE -> prod_algebraE_all
1954 product_algebra_generator_der -> prod_algebra_eq_finite
1955 product_algebra_generator_into_space -> prod_algebra_sets_into_space
1956 product_algebraI -> sets_PiM_I_finite
1957 product_measure_exists -> product_sigma_finite.sigma_finite
1958 product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator
1959 product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb
1960 product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty
1961 product_prob_space.measurable_component -> measurable_component_singleton
1962 product_prob_space.measurable_emb -> measurable_prod_emb
1963 product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single
1964 product_prob_space.measurable_singleton_infprod -> measurable_component_singleton
1965 product_prob_space.measure_emb -> emeasure_prod_emb
1966 product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict
1967 product_sigma_algebra.product_algebra_into_space -> space_closed
1968 product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge
1969 product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton
1970 product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge
1971 sequence_space.measure_infprod -> sequence_space.measure_PiM_countable
1972 sets_product_algebra -> sets_PiM
1973 sigma_algebra.measurable_sigma -> measurable_measure_of
1974 sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint
1975 sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr
1976 sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq
1977 space_product_algebra -> space_PiM
1979 * Session HOL-TPTP: support to parse and import TPTP problems (all
1980 languages) into Isabelle/HOL.
1985 * New "case_product" attribute (see HOL).
1990 * Greater support for structured proofs involving induction or case
1993 * Much greater use of mathematical symbols.
1995 * Removal of many ML theorem bindings. INCOMPATIBILITY.
2000 * Antiquotation @{keyword "name"} produces a parser for outer syntax
2001 from a minor keyword introduced via theory header declaration.
2003 * Antiquotation @{command_spec "name"} produces the
2004 Outer_Syntax.command_spec from a major keyword introduced via theory
2005 header declaration; it can be passed to Outer_Syntax.command etc.
2007 * Local_Theory.define no longer hard-wires default theorem name
2008 "foo_def", but retains the binding as given. If that is Binding.empty
2009 / Attrib.empty_binding, the result is not registered as user-level
2010 fact. The Local_Theory.define_internal variant allows to specify a
2011 non-empty name (used for the foundation in the background theory),
2012 while omitting the fact binding in the user-context. Potential
2013 INCOMPATIBILITY for derived definitional packages: need to specify
2014 naming policy for primitive definitions more explicitly.
2016 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
2017 conformance with similar operations in structure Term and Logic.
2019 * Antiquotation @{attributes [...]} embeds attribute source
2020 representation into the ML text, which is particularly useful with
2021 declarations like Local_Theory.note.
2023 * Structure Proof_Context follows standard naming scheme. Old
2024 ProofContext has been discontinued. INCOMPATIBILITY.
2026 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
2027 change of semantics: update is applied to auxiliary local theory
2030 * Modernized some old-style infix operations:
2032 addeqcongs ~> Simplifier.add_eqcong
2033 deleqcongs ~> Simplifier.del_eqcong
2034 addcongs ~> Simplifier.add_cong
2035 delcongs ~> Simplifier.del_cong
2036 setmksimps ~> Simplifier.set_mksimps
2037 setmkcong ~> Simplifier.set_mkcong
2038 setmksym ~> Simplifier.set_mksym
2039 setmkeqTrue ~> Simplifier.set_mkeqTrue
2040 settermless ~> Simplifier.set_termless
2041 setsubgoaler ~> Simplifier.set_subgoaler
2042 addsplits ~> Splitter.add_split
2043 delsplits ~> Splitter.del_split
2048 * USER_HOME settings variable points to cross-platform user home
2049 directory, which coincides with HOME on POSIX systems only. Likewise,
2050 the Isabelle path specification "~" now expands to $USER_HOME, instead
2051 of former $HOME. A different default for USER_HOME may be set
2052 explicitly in shell environment, before Isabelle settings are
2053 evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where
2054 the generic user home was intended.
2056 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
2057 notation, which is useful for the jEdit file browser, for example.
2059 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
2064 New in Isabelle2011-1 (October 2011)
2065 ------------------------------------
2069 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
2070 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
2072 - Management of multiple theory files directly from the editor
2073 buffer store -- bypassing the file-system (no requirement to save
2074 files for checking).
2076 - Markup of formal entities within the text buffer, with semantic
2077 highlighting, tooltips and hyperlinks to jump to defining source
2080 - Improved text rendering, with sub/superscripts in the source
2081 buffer (including support for copy/paste wrt. output panel, HTML
2082 theory output and other non-Isabelle text boxes).
2084 - Refined scheduling of proof checking and printing of results,
2085 based on interactive editor view. (Note: jEdit folding and
2086 narrowing allows to restrict buffer perspectives explicitly.)
2088 - Reduced CPU performance requirements, usable on machines with few
2091 - Reduced memory requirements due to pruning of unused document
2092 versions (garbage collection).
2094 See also ~~/src/Tools/jEdit/README.html for further information,
2095 including some remaining limitations.
2097 * Theory loader: source files are exclusively located via the master
2098 directory of each theory node (where the .thy file itself resides).
2099 The global load path (such as src/HOL/Library) has been discontinued.
2100 Note that the path element ~~ may be used to reference theories in the
2101 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
2104 * Theory loader: source files are identified by content via SHA1
2105 digests. Discontinued former path/modtime identification and optional
2106 ISABELLE_FILE_IDENT plugin scripts.
2108 * Parallelization of nested Isar proofs is subject to
2109 Goal.parallel_proofs_threshold (default 100). See also isabelle
2112 * Name space: former unsynchronized references are now proper
2113 configuration options, with more conventional names:
2115 long_names ~> names_long
2116 short_names ~> names_short
2117 unique_names ~> names_unique
2119 Minor INCOMPATIBILITY, need to declare options in context like this:
2121 declare [[names_unique = false]]
2123 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note
2124 that the result needs to be unique, which means fact specifications
2125 may have to be refined after enriching a proof context.
2127 * Attribute "case_names" has been refined: the assumptions in each case
2128 can be named now by following the case name with [name1 name2 ...].
2130 * Isabelle/Isar reference manual has been updated and extended:
2131 - "Synopsis" provides a catalog of main Isar language concepts.
2132 - Formal references in syntax diagrams, via @{rail} antiquotation.
2133 - Updated material from classic "ref" manual, notably about
2134 "Classical Reasoner".
2139 * Class bot and top require underlying partial order rather than
2140 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.
2142 * Class complete_lattice: generalized a couple of lemmas from sets;
2143 generalized theorems INF_cong and SUP_cong. New type classes for
2144 complete boolean algebras and complete linear orders. Lemmas
2145 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
2146 class complete_linorder.
2148 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
2149 Sup_fun_def, Inf_apply, Sup_apply.
2151 Removed redundant lemmas (the right hand side gives hints how to
2152 replace them for (metis ...), or (simp only: ...) proofs):
2154 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
2155 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
2156 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
2157 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
2158 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
2159 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
2160 Inter_def ~> INF_def, image_def
2161 Union_def ~> SUP_def, image_def
2162 INT_eq ~> INF_def, and image_def
2163 UN_eq ~> SUP_def, and image_def
2164 INF_subset ~> INF_superset_mono [OF _ order_refl]
2166 More consistent and comprehensive names:
2168 INTER_eq_Inter_image ~> INF_def
2169 UNION_eq_Union_image ~> SUP_def
2172 INF_leI ~> INF_lower
2173 INF_leI2 ~> INF_lower2
2174 le_INFI ~> INF_greatest
2175 le_SUPI ~> SUP_upper
2176 le_SUPI2 ~> SUP_upper2
2177 SUP_leI ~> SUP_least
2178 INFI_bool_eq ~> INF_bool_eq
2179 SUPR_bool_eq ~> SUP_bool_eq
2180 INFI_apply ~> INF_apply
2181 SUPR_apply ~> SUP_apply
2182 INTER_def ~> INTER_eq
2183 UNION_def ~> UNION_eq
2187 * Renamed theory Complete_Lattice to Complete_Lattices.
2190 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
2191 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
2192 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
2193 Sup_insert are now declared as [simp]. INCOMPATIBILITY.
2195 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
2196 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
2197 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor
2200 * Added syntactic classes "inf" and "sup" for the respective
2201 constants. INCOMPATIBILITY: Changes in the argument order of the
2202 (mostly internal) locale predicates for some derived classes.
2204 * Theorem collections ball_simps and bex_simps do not contain theorems
2205 referring to UNION any longer; these have been moved to collection
2206 UN_ball_bex_simps. INCOMPATIBILITY.
2208 * Theory Archimedean_Field: floor now is defined as parameter of a
2209 separate type class floor_ceiling.
2211 * Theory Finite_Set: more coherent development of fold_set locales:
2213 locale fun_left_comm ~> locale comp_fun_commute
2214 locale fun_left_comm_idem ~> locale comp_fun_idem
2216 Both use point-free characterization; interpretation proofs may need
2217 adjustment. INCOMPATIBILITY.
2219 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
2220 accordance with standard mathematical terminology. INCOMPATIBILITY.
2222 * Theory Complex_Main: The locale interpretations for the
2223 bounded_linear and bounded_bilinear locales have been removed, in
2224 order to reduce the number of duplicate lemmas. Users must use the
2225 original names for distributivity theorems, potential INCOMPATIBILITY.
2227 divide.add ~> add_divide_distrib
2228 divide.diff ~> diff_divide_distrib
2229 divide.setsum ~> setsum_divide_distrib
2230 mult.add_right ~> right_distrib
2231 mult.diff_right ~> right_diff_distrib
2232 mult_right.setsum ~> setsum_right_distrib
2233 mult_left.diff ~> left_diff_distrib
2235 * Theory Complex_Main: Several redundant theorems have been removed or
2236 replaced by more general versions. INCOMPATIBILITY.
2238 real_diff_def ~> minus_real_def
2239 real_divide_def ~> divide_real_def
2240 real_less_def ~> less_le
2241 real_abs_def ~> abs_real_def
2242 real_sgn_def ~> sgn_real_def
2243 real_mult_commute ~> mult_commute
2244 real_mult_assoc ~> mult_assoc
2245 real_mult_1 ~> mult_1_left
2246 real_add_mult_distrib ~> left_distrib
2247 real_zero_not_eq_one ~> zero_neq_one
2248 real_mult_inverse_left ~> left_inverse
2249 INVERSE_ZERO ~> inverse_zero
2250 real_le_refl ~> order_refl
2251 real_le_antisym ~> order_antisym
2252 real_le_trans ~> order_trans
2253 real_le_linear ~> linear
2254 real_le_eq_diff ~> le_iff_diff_le_0
2255 real_add_left_mono ~> add_left_mono
2256 real_mult_order ~> mult_pos_pos
2257 real_mult_less_mono2 ~> mult_strict_left_mono
2258 real_of_int_real_of_nat ~> real_of_int_of_nat_eq
2259 real_0_le_divide_iff ~> zero_le_divide_iff
2260 realpow_two_disj ~> power2_eq_iff
2261 real_squared_diff_one_factored ~> square_diff_one_factored
2262 realpow_two_diff ~> square_diff_square_factored
2263 reals_complete2 ~> complete_real
2264 real_sum_squared_expand ~> power2_sum
2265 exp_ln_eq ~> ln_unique
2267 expi_zero ~> exp_zero
2268 lemma_DERIV_subst ~> DERIV_cong
2269 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
2270 LIMSEQ_const ~> tendsto_const
2271 LIMSEQ_norm ~> tendsto_norm
2272 LIMSEQ_add ~> tendsto_add
2273 LIMSEQ_minus ~> tendsto_minus
2274 LIMSEQ_minus_cancel ~> tendsto_minus_cancel
2275 LIMSEQ_diff ~> tendsto_diff
2276 bounded_linear.LIMSEQ ~> bounded_linear.tendsto
2277 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
2278 LIMSEQ_mult ~> tendsto_mult
2279 LIMSEQ_inverse ~> tendsto_inverse
2280 LIMSEQ_divide ~> tendsto_divide
2281 LIMSEQ_pow ~> tendsto_power
2282 LIMSEQ_setsum ~> tendsto_setsum
2283 LIMSEQ_setprod ~> tendsto_setprod
2284 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
2285 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
2286 LIMSEQ_imp_rabs ~> tendsto_rabs
2287 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
2288 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
2289 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
2290 LIMSEQ_Complex ~> tendsto_Complex
2291 LIM_ident ~> tendsto_ident_at
2292 LIM_const ~> tendsto_const
2293 LIM_add ~> tendsto_add
2294 LIM_add_zero ~> tendsto_add_zero
2295 LIM_minus ~> tendsto_minus
2296 LIM_diff ~> tendsto_diff
2297 LIM_norm ~> tendsto_norm
2298 LIM_norm_zero ~> tendsto_norm_zero
2299 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
2300 LIM_norm_zero_iff ~> tendsto_norm_zero_iff
2301 LIM_rabs ~> tendsto_rabs
2302 LIM_rabs_zero ~> tendsto_rabs_zero
2303 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
2304 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
2305 LIM_compose ~> tendsto_compose
2306 LIM_mult ~> tendsto_mult
2307 LIM_scaleR ~> tendsto_scaleR
2308 LIM_of_real ~> tendsto_of_real
2309 LIM_power ~> tendsto_power
2310 LIM_inverse ~> tendsto_inverse
2311 LIM_sgn ~> tendsto_sgn
2312 isCont_LIM_compose ~> isCont_tendsto_compose
2313 bounded_linear.LIM ~> bounded_linear.tendsto
2314 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
2315 bounded_bilinear.LIM ~> bounded_bilinear.tendsto
2316 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
2317 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
2318 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
2319 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
2321 * Theory Complex_Main: The definition of infinite series was
2322 generalized. Now it is defined on the type class {topological_space,
2323 comm_monoid_add}. Hence it is useable also for extended real numbers.
2325 * Theory Complex_Main: The complex exponential function "expi" is now
2326 a type-constrained abbreviation for "exp :: complex => complex"; thus
2327 several polymorphic lemmas about "exp" are now applicable to "expi".
2331 - Theory Library/Code_Char_ord provides native ordering of
2332 characters in the target language.
2334 - Commands code_module and code_library are legacy, use export_code
2337 - Method "evaluation" is legacy, use method "eval" instead.
2339 - Legacy evaluator "SML" is deactivated by default. May be
2340 reactivated by the following theory command:
2342 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
2344 * Declare ext [intro] by default. Rare INCOMPATIBILITY.
2346 * New proof method "induction" that gives induction hypotheses the
2347 name "IH", thus distinguishing them from further hypotheses that come
2348 from rule induction. The latter are still called "hyps". Method
2349 "induction" is a thin wrapper around "induct" and follows the same
2352 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
2353 still available as a legacy feature for some time.
2356 - Added "need" and "total_consts" options.
2357 - Reintroduced "show_skolems" option by popular demand.
2358 - Renamed attribute: nitpick_def ~> nitpick_unfold.
2362 - Use quasi-sound (and efficient) translations by default.
2363 - Added support for the following provers: E-ToFoF, LEO-II,
2364 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
2365 - Automatically preplay and minimize proofs before showing them if
2366 this can be done within reasonable time.
2367 - sledgehammer available_provers ~> sledgehammer supported_provers.
2369 - Added "preplay_timeout", "slicing", "type_enc", "sound",
2370 "max_mono_iters", and "max_new_mono_instances" options.
2371 - Removed "explicit_apply" and "full_types" options as well as "Full
2372 Types" Proof General menu item. INCOMPATIBILITY.
2375 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
2376 - Obsoleted "metisFT" -- use "metis (full_types)" instead.
2380 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
2381 "elim:" options. INCOMPATIBILITY.
2382 - Introduced 'try' that not only runs 'try_methods' but also
2383 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
2386 - Added "eval" option to evaluate terms for the found counterexample
2387 (currently only supported by the default (exhaustive) tester).
2388 - Added post-processing of terms to obtain readable counterexamples
2389 (currently only supported by the default (exhaustive) tester).
2390 - New counterexample generator quickcheck[narrowing] enables
2391 narrowing-based testing. Requires the Glasgow Haskell compiler
2392 with its installation location defined in the Isabelle settings
2393 environment as ISABELLE_GHC.
2394 - Removed quickcheck tester "SML" based on the SML code generator
2395 (formly in HOL/Library).
2397 * Function package: discontinued option "tailrec". INCOMPATIBILITY,
2398 use 'partial_function' instead.
2400 * Theory Library/Extended_Reals replaces now the positive extended
2401 reals found in probability theory. This file is extended by
2402 Multivariate_Analysis/Extended_Real_Limits.
2404 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,
2405 from where it must be imported explicitly if it is really required.
2408 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
2409 been moved here. INCOMPATIBILITY.
2411 * Theory Library/Saturated provides type of numbers with saturated
2414 * Theory Library/Product_Lattice defines a pointwise ordering for the
2415 product type 'a * 'b, and provides instance proofs for various order
2416 and lattice type classes.
2418 * Theory Library/Countable now provides the "countable_datatype" proof
2419 method for proving "countable" class instances for datatypes.
2421 * Theory Library/Cset_Monad allows do notation for computable sets
2422 (cset) via the generic monad ad-hoc overloading facility.
2424 * Library: Theories of common data structures are split into theories
2425 for implementation, an invariant-ensuring type, and connection to an
2426 abstract type. INCOMPATIBILITY.
2428 - RBT is split into RBT and RBT_Mapping.
2429 - AssocList is split and renamed into AList and AList_Mapping.
2430 - DList is split into DList_Impl, DList, and DList_Cset.
2431 - Cset is split into Cset and List_Cset.
2433 * Theory Library/Nat_Infinity has been renamed to
2434 Library/Extended_Nat, with name changes of the following types and
2437 type inat ~> type enat
2439 Infty ~> infinity (overloaded)
2443 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
2444 been renamed accordingly. INCOMPATIBILITY.
2446 * Session Multivariate_Analysis: The euclidean_space type class now
2447 fixes a constant "Basis :: 'a set" consisting of the standard
2448 orthonormal basis for the type. Users now have the option of
2449 quantifying over this set instead of using the "basis" function, e.g.
2450 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
2452 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
2453 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
2454 "Cart_nth" and "Cart_lambda" have been respectively renamed to
2455 "vec_nth" and "vec_lambda"; theorems mentioning those names have
2456 changed to match. Definition theorems for overloaded constants now use
2457 the standard "foo_vec_def" naming scheme. A few other theorems have
2458 been renamed as follows (INCOMPATIBILITY):
2460 Cart_eq ~> vec_eq_iff
2461 dist_nth_le_cart ~> dist_vec_nth_le
2462 tendsto_vector ~> vec_tendstoI
2463 Cauchy_vector ~> vec_CauchyI
2465 * Session Multivariate_Analysis: Several duplicate theorems have been
2466 removed, and other theorems have been renamed or replaced with more
2467 general versions. INCOMPATIBILITY.
2469 finite_choice ~> finite_set_choice
2470 eventually_conjI ~> eventually_conj
2471 eventually_and ~> eventually_conj_iff
2472 eventually_false ~> eventually_False
2473 setsum_norm ~> norm_setsum
2474 Lim_sequentially ~> LIMSEQ_def
2475 Lim_ident_at ~> LIM_ident
2476 Lim_const ~> tendsto_const
2477 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
2478 Lim_neg ~> tendsto_minus
2479 Lim_add ~> tendsto_add
2480 Lim_sub ~> tendsto_diff
2481 Lim_mul ~> tendsto_scaleR
2482 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
2483 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
2484 Lim_linear ~> bounded_linear.tendsto
2485 Lim_component ~> tendsto_euclidean_component
2486 Lim_component_cart ~> tendsto_vec_nth
2487 Lim_inner ~> tendsto_inner [OF tendsto_const]
2488 dot_lsum ~> inner_setsum_left
2489 dot_rsum ~> inner_setsum_right
2490 continuous_cmul ~> continuous_scaleR [OF continuous_const]
2491 continuous_neg ~> continuous_minus
2492 continuous_sub ~> continuous_diff
2493 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
2494 continuous_mul ~> continuous_scaleR
2495 continuous_inv ~> continuous_inverse
2496 continuous_at_within_inv ~> continuous_at_within_inverse
2497 continuous_at_inv ~> continuous_at_inverse
2498 continuous_at_norm ~> continuous_norm [OF continuous_at_id]
2499 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
2500 continuous_at_component ~> continuous_component [OF continuous_at_id]
2501 continuous_on_neg ~> continuous_on_minus
2502 continuous_on_sub ~> continuous_on_diff
2503 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
2504 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
2505 continuous_on_mul ~> continuous_on_scaleR
2506 continuous_on_mul_real ~> continuous_on_mult
2507 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
2508 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
2509 continuous_on_inverse ~> continuous_on_inv
2510 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
2511 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
2512 subset_interior ~> interior_mono
2513 subset_closure ~> closure_mono
2514 closure_univ ~> closure_UNIV
2515 real_arch_lt ~> reals_Archimedean2
2516 real_arch ~> reals_Archimedean3
2517 real_abs_norm ~> abs_norm_cancel
2518 real_abs_sub_norm ~> norm_triangle_ineq3
2519 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
2521 * Session HOL-Probability:
2522 - Caratheodory's extension lemma is now proved for ring_of_sets.
2523 - Infinite products of probability measures are now available.
2524 - Sigma closure is independent, if the generator is independent
2525 - Use extended reals instead of positive extended
2526 reals. INCOMPATIBILITY.
2528 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
2530 expand_fun_below ~> fun_below_iff
2531 below_fun_ext ~> fun_belowI
2532 expand_cfun_eq ~> cfun_eq_iff
2533 ext_cfun ~> cfun_eqI
2534 expand_cfun_below ~> cfun_below_iff
2535 below_cfun_ext ~> cfun_belowI
2536 monofun_fun_fun ~> fun_belowD
2537 monofun_fun_arg ~> monofunE
2538 monofun_lub_fun ~> adm_monofun [THEN admD]
2539 cont_lub_fun ~> adm_cont [THEN admD]
2540 cont2cont_Rep_CFun ~> cont2cont_APP
2541 cont_Rep_CFun_app ~> cont_APP_app
2542 cont_Rep_CFun_app_app ~> cont_APP_app_app
2543 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
2544 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
2545 contlub_cfun ~> lub_APP [symmetric]
2546 contlub_LAM ~> lub_LAM [symmetric]
2549 lift_distinct1 ~> lift.distinct(1)
2550 lift_distinct2 ~> lift.distinct(2)
2551 Def_not_UU ~> lift.distinct(2)
2552 Def_inject ~> lift.inject
2553 below_UU_iff ~> below_bottom_iff
2554 eq_UU_iff ~> eq_bottom_iff
2557 *** Document preparation ***
2559 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
2560 isar-ref manual, both for description and actual application of the
2563 * Antiquotation @{value} evaluates the given term and presents its
2566 * Antiquotations: term style "isub" provides ad-hoc conversion of
2567 variables x1, y23 into subscripted form x\<^isub>1,
2568 y\<^isub>2\<^isub>3.
2570 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
2571 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
2573 * Localized \isabellestyle switch can be used within blocks or groups
2576 \isabellestyle{it} %preferred default
2577 {\isabellestylett @{text "typewriter stuff"}}
2579 * Discontinued special treatment of hard tabulators. Implicit
2580 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual
2586 * The inner syntax of sort/type/term/prop supports inlined YXML
2587 representations within quoted string tokens. By encoding logical
2588 entities via Term_XML (in ML or Scala) concrete syntax can be
2589 bypassed, which is particularly useful for producing bits of text
2590 under external program control.
2592 * Antiquotations for ML and document preparation are managed as theory
2593 data, which requires explicit setup.
2595 * Isabelle_Process.is_active allows tools to check if the official
2596 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
2597 (better known as Proof General).
2599 * Structure Proof_Context follows standard naming scheme. Old
2600 ProofContext is still available for some time as legacy alias.
2602 * Structure Timing provides various operations for timing; supersedes
2603 former start_timing/end_timing etc.
2605 * Path.print is the official way to show file-system paths to users
2606 (including quotes etc.).
2608 * Inner syntax: identifiers in parse trees of generic categories
2609 "logic", "aprop", "idt" etc. carry position information (disguised as
2610 type constraints). Occasional INCOMPATIBILITY with non-compliant
2611 translations that choke on unexpected type constraints. Positions can
2612 be stripped in ML translations via Syntax.strip_positions /
2613 Syntax.strip_positions_ast, or via the syntax constant
2614 "_strip_positions" within parse trees. As last resort, positions can
2615 be disabled via the configuration option Syntax.positions, which is
2616 called "syntax_positions" in Isar attribute syntax.
2618 * Discontinued special status of various ML structures that contribute
2619 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
2620 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
2621 refer directly to Ast.Constant, Lexicon.is_identifier,
2622 Syntax_Trans.mk_binder_tr etc.
2624 * Typed print translation: discontinued show_sorts argument, which is
2625 already available via context of "advanced" translation.
2627 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
2628 goal states; body tactic needs to address all subgoals uniformly.
2630 * Slightly more special eq_list/eq_set, with shortcut involving
2631 pointer equality (assumes that eq relation is reflexive).
2633 * Classical tactics use proper Proof.context instead of historic types
2634 claset/clasimpset. Old-style declarations like addIs, addEs, addDs
2635 operate directly on Proof.context. Raw type claset retains its use as
2636 snapshot of the classical context, which can be recovered via
2637 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.
2638 INCOMPATIBILITY, classical tactics and derived proof methods require
2639 proper Proof.context.
2644 * Discontinued support for Poly/ML 5.2, which was the last version
2645 without proper multithreading and TimeLimit implementation.
2647 * Discontinued old lib/scripts/polyml-platform, which has been
2648 obsolete since Isabelle2009-2.
2650 * Various optional external tools are referenced more robustly and
2651 uniformly by explicit Isabelle settings as follows:
2653 ISABELLE_CSDP (formerly CSDP_EXE)
2654 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)
2655 ISABELLE_OCAML (formerly EXEC_OCAML)
2656 ISABELLE_SWIPL (formerly EXEC_SWIPL)
2657 ISABELLE_YAP (formerly EXEC_YAP)
2659 Note that automated detection from the file-system or search path has
2660 been discontinued. INCOMPATIBILITY.
2662 * Scala layer provides JVM method invocation service for static
2663 methods of type (String)String, see Invoke_Scala.method in ML. For
2666 Invoke_Scala.method "java.lang.System.getProperty" "java.home"
2668 Together with YXML.string_of_body/parse_body and XML.Encode/Decode
2669 this allows to pass structured values between ML and Scala.
2671 * The IsabelleText fonts includes some further glyphs to support the
2672 Prover IDE. Potential INCOMPATIBILITY: users who happen to have
2673 installed a local copy (which is normally *not* required) need to
2674 delete or update it from ~~/lib/fonts/.
2678 New in Isabelle2011 (January 2011)
2679 ----------------------------------
2683 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
2684 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
2685 useful tooltips and hyperlinks produced from its static analysis. The
2686 bundled component provides an executable Isabelle tool that can be run
2689 Isabelle2011/bin/isabelle jedit
2691 * Significantly improved Isabelle/Isar implementation manual.
2693 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
2694 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
2695 while the default heap location within that directory lacks that extra
2696 suffix. This isolates multiple Isabelle installations from each
2697 other, avoiding problems with old settings in new versions.
2698 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
2700 * Source files are always encoded as UTF-8, instead of old-fashioned
2701 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
2702 the following package declarations:
2704 \usepackage[utf8]{inputenc}
2705 \usepackage{textcomp}
2707 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
2708 a Unicode character is treated as a single symbol, not a sequence of
2709 non-ASCII bytes as before. Since Isabelle/ML string literals may
2710 contain symbols without further backslash escapes, Unicode can now be
2711 used here as well. Recall that Symbol.explode in ML provides a
2712 consistent view on symbols, while raw explode (or String.explode)
2713 merely give a byte-oriented representation.
2715 * Theory loader: source files are primarily located via the master
2716 directory of each theory node (where the .thy file itself resides).
2717 The global load path is still partially available as legacy feature.
2718 Minor INCOMPATIBILITY due to subtle change in file lookup: use
2719 explicit paths, relatively to the theory.
2721 * Special treatment of ML file names has been discontinued.
2722 Historically, optional extensions .ML or .sml were added on demand --
2723 at the cost of clarity of file dependencies. Recall that Isabelle/ML
2724 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
2726 * Various options that affect pretty printing etc. are now properly
2727 handled within the context via configuration options, instead of
2728 unsynchronized references or print modes. There are both ML Config.T
2729 entities and Isar declaration attributes to access these.
2731 ML (Config.T) Isar (attribute)
2733 eta_contract eta_contract
2734 show_brackets show_brackets
2735 show_sorts show_sorts
2736 show_types show_types
2737 show_question_marks show_question_marks
2738 show_consts show_consts
2739 show_abbrevs show_abbrevs
2741 Syntax.ast_trace syntax_ast_trace
2742 Syntax.ast_stat syntax_ast_stat
2743 Syntax.ambiguity_level syntax_ambiguity_level
2745 Goal_Display.goals_limit goals_limit
2746 Goal_Display.show_main_goal show_main_goal
2748 Method.rule_trace rule_trace
2750 Thy_Output.display thy_output_display
2751 Thy_Output.quotes thy_output_quotes
2752 Thy_Output.indent thy_output_indent
2753 Thy_Output.source thy_output_source
2754 Thy_Output.break thy_output_break
2756 Note that corresponding "..._default" references in ML may only be
2757 changed globally at the ROOT session setup, but *not* within a theory.
2758 The option "show_abbrevs" supersedes the former print mode
2759 "no_abbrevs" with inverted meaning.
2761 * More systematic naming of some configuration options.
2764 trace_simp ~> simp_trace
2765 debug_simp ~> simp_debug
2767 * Support for real valued configuration options, using simplistic
2768 floating-point notation that coincides with the inner syntax for
2771 * Support for real valued preferences (with approximative PGIP type):
2772 front-ends need to accept "pgint" values in float notation.
2775 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
2778 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
2783 * Command 'type_synonym' (with single argument) replaces somewhat
2784 outdated 'types', which is still available as legacy feature for some
2787 * Command 'nonterminal' (with 'and' separated list of arguments)
2788 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
2790 * Command 'notepad' replaces former 'example_proof' for
2791 experimentation in Isar without any result. INCOMPATIBILITY.
2793 * Locale interpretation commands 'interpret' and 'sublocale' accept
2794 lists of equations to map definitions in a locale to appropriate
2795 entities in the context of the interpretation. The 'interpretation'
2796 command already provided this functionality.
2798 * Diagnostic command 'print_dependencies' prints the locale instances
2799 that would be activated if the specified expression was interpreted in
2800 the current context. Variant "print_dependencies!" assumes a context
2801 without interpretations.
2803 * Diagnostic command 'print_interps' prints interpretations in proofs
2804 in addition to interpretations in theories.
2806 * Discontinued obsolete 'global' and 'local' commands to manipulate
2807 the theory name space. Rare INCOMPATIBILITY. The ML functions
2808 Sign.root_path and Sign.local_path may be applied directly where this
2809 feature is still required for historical reasons.
2811 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
2812 'definition' instead.
2814 * The "prems" fact, which refers to the accidental collection of
2815 foundational premises in the context, is now explicitly marked as
2816 legacy feature and will be discontinued soon. Consider using "assms"
2817 of the head statement or reference facts by explicit names.
2819 * Document antiquotations @{class} and @{type} print classes and type
2822 * Document antiquotation @{file} checks file/directory entries within
2823 the local file system.
2828 * Coercive subtyping: functions can be declared as coercions and type
2829 inference will add them as necessary upon input of a term. Theory
2830 Complex_Main declares real :: nat => real and real :: int => real as
2831 coercions. A coercion function f is declared like this:
2833 declare [[coercion f]]
2835 To lift coercions through type constructors (e.g. from nat => real to
2836 nat list => real list), map functions can be declared, e.g.
2838 declare [[coercion_map map]]
2840 Currently coercion inference is activated only in theories including
2841 real numbers, i.e. descendants of Complex_Main. This is controlled by
2842 the configuration option "coercion_enabled", e.g. it can be enabled in
2843 other theories like this:
2845 declare [[coercion_enabled]]
2847 * Command 'partial_function' provides basic support for recursive
2848 function definitions over complete partial orders. Concrete instances
2849 are provided for i) the option type, ii) tail recursion on arbitrary
2850 types, and iii) the heap monad of Imperative_HOL. See
2851 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
2854 * Function package: f.psimps rules are no longer implicitly declared
2855 as [simp]. INCOMPATIBILITY.
2857 * Datatype package: theorems generated for executable equality (class
2858 "eq") carry proper names and are treated as default code equations.
2860 * Inductive package: now offers command 'inductive_simps' to
2861 automatically derive instantiated and simplified equations for
2862 inductive predicates, similar to 'inductive_cases'.
2864 * Command 'enriched_type' allows to register properties of the
2865 functorial structure of types.
2867 * Improved infrastructure for term evaluation using code generator
2868 techniques, in particular static evaluation conversions.
2870 * Code generator: Scala (2.8 or higher) has been added to the target
2873 * Code generator: globbing constant expressions "*" and "Theory.*"
2874 have been replaced by the more idiomatic "_" and "Theory._".
2877 * Code generator: export_code without explicit file declaration prints
2878 to standard output. INCOMPATIBILITY.
2880 * Code generator: do not print function definitions for case
2881 combinators any longer.
2883 * Code generator: simplification with rules determined with
2884 src/Tools/Code/code_simp.ML and method "code_simp".
2886 * Code generator for records: more idiomatic representation of record
2887 types. Warning: records are not covered by ancient SML code
2888 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
2889 rep_datatype declaration helps to succeed then:
2893 rep_datatype foo_ext ...
2895 * Records: logical foundation type for records does not carry a
2896 '_type' suffix any longer (obsolete due to authentic syntax).
2899 * Quickcheck now by default uses exhaustive testing instead of random
2900 testing. Random testing can be invoked by "quickcheck [random]",
2901 exhaustive testing by "quickcheck [exhaustive]".
2903 * Quickcheck instantiates polymorphic types with small finite
2904 datatypes by default. This enables a simple execution mechanism to
2905 handle quantifiers and function equality over the finite datatypes.
2907 * Quickcheck random generator has been renamed from "code" to
2908 "random". INCOMPATIBILITY.
2910 * Quickcheck now has a configurable time limit which is set to 30
2911 seconds by default. This can be changed by adding [timeout = n] to the
2912 quickcheck command. The time limit for Auto Quickcheck is still set
2915 * Quickcheck in locales considers interpretations of that locale for
2916 counter example search.
2919 - Added "smt" and "remote_smt" provers based on the "smt" proof
2920 method. See the Sledgehammer manual for details ("isabelle doc
2923 sledgehammer atp_info ~> sledgehammer running_provers
2924 sledgehammer atp_kill ~> sledgehammer kill_provers
2925 sledgehammer available_atps ~> sledgehammer available_provers
2928 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
2929 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
2930 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
2931 (and "ms" and "min" are no longer supported)
2936 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
2937 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
2939 - Added support for partial quotient types.
2940 - Added local versions of the "Nitpick.register_xxx" functions.
2941 - Added "whack" option.
2942 - Allow registration of quotient types as codatatypes.
2943 - Improved "merge_type_vars" option to merge more types.
2944 - Removed unsound "fast_descrs" option.
2945 - Added custom symmetry breaking for datatypes, making it possible to reach
2946 higher cardinalities.
2947 - Prevent the expansion of too large definitions.
2949 * Proof methods "metis" and "meson" now have configuration options
2950 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
2951 to diagnose these tools. E.g.
2953 using [[metis_trace = true]]
2955 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
2956 manually as command 'solve_direct'.
2958 * The default SMT solver Z3 must be enabled explicitly (due to
2959 licensing issues) by setting the environment variable
2960 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
2961 commercial applications, the SMT solver CVC3 is provided as fall-back;
2962 changing the SMT solver is done via the configuration option
2965 * Remote SMT solvers need to be referred to by the "remote_" prefix,
2966 i.e. "remote_cvc3" and "remote_z3".
2968 * Added basic SMT support for datatypes, records, and typedefs using
2969 the oracle mode (no proofs). Direct support of pairs has been dropped
2970 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
2971 support for a similar behavior). Minor INCOMPATIBILITY.
2973 * Changed SMT configuration options:
2975 z3_proofs ~> smt_oracle (with inverted meaning)
2976 z3_trace_assms ~> smt_trace_used_facts
2989 * Boogie output files (.b2i files) need to be declared in the theory
2992 * Simplification procedure "list_to_set_comprehension" rewrites list
2993 comprehensions applied to List.set to set comprehensions. Occasional
2994 INCOMPATIBILITY, may be deactivated like this:
2996 declare [[simproc del: list_to_set_comprehension]]
2998 * Removed old version of primrec package. INCOMPATIBILITY.
3000 * Removed simplifier congruence rule of "prod_case", as has for long
3001 been the case with "split". INCOMPATIBILITY.
3003 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
3005 * Removed [split_format ... and ... and ...] version of
3006 [split_format]. Potential INCOMPATIBILITY.
3008 * Predicate "sorted" now defined inductively, with nice induction
3009 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
3011 * Constant "contents" renamed to "the_elem", to free the generic name
3012 contents for other uses. INCOMPATIBILITY.
3014 * Renamed class eq and constant eq (for code generation) to class
3015 equal and constant equal, plus renaming of related facts and various
3016 tuning. INCOMPATIBILITY.
3018 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
3020 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
3023 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
3024 avoid confusion with finite sets. INCOMPATIBILITY.
3026 * Abandoned locales equiv, congruent and congruent2 for equivalence
3027 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
3030 * Some previously unqualified names have been qualified:
3037 Trueprop ~> HOL.Trueprop
3042 op --> ~> HOL.implies
3054 Pair ~> Product_Type.Pair
3055 fst ~> Product_Type.fst
3056 snd ~> Product_Type.snd
3057 curry ~> Product_Type.curry
3059 Collect ~> Set.Collect
3063 * More canonical naming convention for some fundamental definitions:
3065 bot_bool_eq ~> bot_bool_def
3066 top_bool_eq ~> top_bool_def
3067 inf_bool_eq ~> inf_bool_def
3068 sup_bool_eq ~> sup_bool_def
3069 bot_fun_eq ~> bot_fun_def
3070 top_fun_eq ~> top_fun_def
3071 inf_fun_eq ~> inf_fun_def
3072 sup_fun_eq ~> sup_fun_def
3076 * More stylized fact names:
3078 expand_fun_eq ~> fun_eq_iff
3079 expand_set_eq ~> set_eq_iff
3081 nat_number ~> eval_nat_numeral
3085 * Refactoring of code-generation specific operations in theory List:
3091 mem_iff ~> member_def
3092 null_empty ~> null_def
3094 INCOMPATIBILITY. Note that these were not supposed to be used
3095 regularly unless for striking reasons; their main purpose was code
3098 Various operations from the Haskell prelude are used for generating
3101 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
3102 "surj f" is now an abbreviation of "range f = UNIV". The theorems
3103 bij_def and surj_def are unchanged. INCOMPATIBILITY.
3105 * Abolished some non-alphabetic type names: "prod" and "sum" replace
3106 "*" and "+" respectively. INCOMPATIBILITY.
3108 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
3109 "Sum_Type.Plus" instead.
3111 * Constant "split" has been merged with constant "prod_case"; names of
3112 ML functions, facts etc. involving split have been retained so far,
3113 though. INCOMPATIBILITY.
3115 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
3116 instead. INCOMPATIBILITY.
3118 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
3121 * Former theory Library/Enum is now part of the HOL-Main image.
3122 INCOMPATIBILITY: all constants of the Enum theory now have to be
3123 referred to by its qualified name.
3126 nlists ~> Enum.nlists
3127 product ~> Enum.product
3129 * Theory Library/Monad_Syntax provides do-syntax for monad types.
3130 Syntax in Library/State_Monad has been changed to avoid ambiguities.
3133 * Theory Library/SetsAndFunctions has been split into
3134 Library/Function_Algebras and Library/Set_Algebras; canonical names
3135 for instance definitions for functions; various improvements.
3138 * Theory Library/Multiset provides stable quicksort implementation of
3141 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
3144 * Session Multivariate_Analysis: introduced a type class for euclidean
3145 space. Most theorems are now stated in terms of euclidean spaces
3146 instead of finite cartesian products.
3149 real ^ 'n ~> 'a::real_vector
3150 ~> 'a::euclidean_space
3151 ~> 'a::ordered_euclidean_space
3152 (depends on your needs)
3156 \<chi> x. _ ~> \<chi>\<chi> x. _
3159 Also note that the indices are now natural numbers and not from some
3160 finite type. Finite cartesian products of euclidean spaces, products
3161 of euclidean spaces the real and complex numbers are instantiated to
3162 be euclidean_spaces. INCOMPATIBILITY.
3164 * Session Probability: introduced pextreal as positive extended real
3165 numbers. Use pextreal as value for measures. Introduce the
3166 Radon-Nikodym derivative, product spaces and Fubini's theorem for
3167 arbitrary sigma finite measures. Introduces Lebesgue measure based on
3168 the integral in Multivariate Analysis. INCOMPATIBILITY.
3170 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
3173 * Session SPARK (with image HOL-SPARK) provides commands to load and
3174 prove verification conditions generated by the SPARK Ada program
3175 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
3180 * Theorems for additive ring operations (locale abelian_monoid and
3181 descendants) are generated by interpretation from their multiplicative
3182 counterparts. Names (in particular theorem names) have the mandatory
3183 qualifier 'add'. Previous theorem names are redeclared for
3186 * Structure "int_ring" is now an abbreviation (previously a
3187 definition). This fits more natural with advanced interpretations.
3192 * The domain package now runs in definitional mode by default: The
3193 former command 'new_domain' is now called 'domain'. To use the domain
3194 package in its original axiomatic mode, use 'domain (unsafe)'.
3197 * The new class "domain" is now the default sort. Class "predomain"
3198 is an unpointed version of "domain". Theories can be updated by
3199 replacing sort annotations as shown below. INCOMPATIBILITY.
3201 'a::type ~> 'a::countable
3202 'a::cpo ~> 'a::predomain
3203 'a::pcpo ~> 'a::domain
3205 * The old type class "rep" has been superseded by class "domain".
3206 Accordingly, users of the definitional package must remove any
3207 "default_sort rep" declarations. INCOMPATIBILITY.
3209 * The domain package (definitional mode) now supports unpointed
3210 predomain argument types, as long as they are marked 'lazy'. (Strict
3211 arguments must be in class "domain".) For example, the following
3212 domain definition now works:
3214 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
3216 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
3217 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
3218 'a option, and 'a list. Additionally, it configures fixrec and the
3219 domain package to work with these types. For example:
3221 fixrec isInl :: "('a + 'b) u -> tr"
3222 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
3224 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
3226 * The "(permissive)" option of fixrec has been replaced with a
3227 per-equation "(unchecked)" option. See
3228 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
3230 * The "bifinite" class no longer fixes a constant "approx"; the class
3231 now just asserts that such a function exists. INCOMPATIBILITY.
3233 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
3234 defines an embedding of type 'a defl into udom by default; instances
3235 of "bifinite" and "domain" classes are available in
3236 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
3238 * The syntax "REP('a)" has been replaced with "DEFL('a)".
3240 * The predicate "directed" has been removed. INCOMPATIBILITY.
3242 * The type class "finite_po" has been removed. INCOMPATIBILITY.
3244 * The function "cprod_map" has been renamed to "prod_map".
3247 * The monadic bind operator on each powerdomain has new binder syntax
3248 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
3249 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
3251 * The infix syntax for binary union on each powerdomain has changed
3252 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
3253 syntax. INCOMPATIBILITY.
3255 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
3256 still supported as an input translation.
3258 * Renamed some theorems (the original names are also still available).
3260 expand_fun_below ~> fun_below_iff
3261 below_fun_ext ~> fun_belowI
3262 expand_cfun_eq ~> cfun_eq_iff
3263 ext_cfun ~> cfun_eqI
3264 expand_cfun_below ~> cfun_below_iff
3265 below_cfun_ext ~> cfun_belowI
3266 cont2cont_Rep_CFun ~> cont2cont_APP
3268 * The Abs and Rep functions for various types have changed names.
3269 Related theorem names have also changed to match. INCOMPATIBILITY.
3271 Rep_CFun ~> Rep_cfun
3272 Abs_CFun ~> Abs_cfun
3273 Rep_Sprod ~> Rep_sprod
3274 Abs_Sprod ~> Abs_sprod
3275 Rep_Ssum ~> Rep_ssum
3276 Abs_Ssum ~> Abs_ssum
3278 * Lemmas with names of the form *_defined_iff or *_strict_iff have
3279 been renamed to *_bottom_iff. INCOMPATIBILITY.
3281 * Various changes to bisimulation/coinduction with domain package:
3283 - Definitions of "bisim" constants no longer mention definedness.
3284 - With mutual recursion, "bisim" predicate is now curried.
3285 - With mutual recursion, each type gets a separate coind theorem.
3286 - Variable names in bisim_def and coinduct rules have changed.
3290 * Case combinators generated by the domain package for type "foo" are
3291 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
3293 * Several theorems have been renamed to more accurately reflect the
3294 names of constants and types involved. INCOMPATIBILITY.
3296 thelub_const ~> lub_const
3297 lub_const ~> is_lub_const
3299 is_lub_lub ~> is_lubD2
3301 unique_lub ~> is_lub_unique
3302 is_ub_lub ~> is_lub_rangeD1
3303 lub_bin_chain ~> is_lub_bin_chain
3304 lub_fun ~> is_lub_fun
3305 thelub_fun ~> lub_fun
3306 thelub_cfun ~> lub_cfun
3307 thelub_Pair ~> lub_Pair
3308 lub_cprod ~> is_lub_prod
3309 thelub_cprod ~> lub_prod
3310 minimal_cprod ~> minimal_prod
3311 inst_cprod_pcpo ~> inst_prod_pcpo
3313 compact_UU ~> compact_bottom
3314 deflation_UU ~> deflation_bottom
3315 finite_deflation_UU ~> finite_deflation_bottom
3317 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
3319 sq_ord_less_eq_trans ~> below_eq_trans
3320 sq_ord_eq_less_trans ~> eq_below_trans
3321 refl_less ~> below_refl
3322 trans_less ~> below_trans
3323 antisym_less ~> below_antisym
3324 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
3325 box_less ~> box_below
3326 rev_trans_less ~> rev_below_trans
3327 not_less2not_eq ~> not_below2not_eq
3328 less_UU_iff ~> below_UU_iff
3329 flat_less_iff ~> flat_below_iff
3330 adm_less ~> adm_below
3331 adm_not_less ~> adm_not_below
3332 adm_compact_not_less ~> adm_compact_not_below
3333 less_fun_def ~> below_fun_def
3334 expand_fun_less ~> fun_below_iff
3335 less_fun_ext ~> fun_belowI
3336 less_discr_def ~> below_discr_def
3337 discr_less_eq ~> discr_below_eq
3338 less_unit_def ~> below_unit_def
3339 less_cprod_def ~> below_prod_def
3340 prod_lessI ~> prod_belowI
3341 Pair_less_iff ~> Pair_below_iff
3342 fst_less_iff ~> fst_below_iff
3343 snd_less_iff ~> snd_below_iff
3344 expand_cfun_less ~> cfun_below_iff
3345 less_cfun_ext ~> cfun_belowI
3346 injection_less ~> injection_below
3347 less_up_def ~> below_up_def
3348 not_Iup_less ~> not_Iup_below
3349 Iup_less ~> Iup_below
3351 Def_inject_less_eq ~> Def_below_Def
3352 Def_less_is_eq ~> Def_below_iff
3353 spair_less_iff ~> spair_below_iff
3354 less_sprod ~> below_sprod
3355 spair_less ~> spair_below
3356 sfst_less_iff ~> sfst_below_iff
3357 ssnd_less_iff ~> ssnd_below_iff
3358 fix_least_less ~> fix_least_below
3359 dist_less_one ~> dist_below_one
3360 less_ONE ~> below_ONE
3361 ONE_less_iff ~> ONE_below_iff
3362 less_sinlD ~> below_sinlD
3363 less_sinrD ~> below_sinrD
3368 * All constant names are now qualified internally and use proper
3369 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
3374 * Antiquotation @{assert} inlines a function bool -> unit that raises
3375 Fail if the argument is false. Due to inlining the source position of
3376 failed assertions is included in the error output.
3378 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
3379 text is in practice always evaluated with a stable theory checkpoint.
3380 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
3382 * Antiquotation @{theory A} refers to theory A from the ancestry of
3383 the current context, not any accidental theory loader state as before.
3384 Potential INCOMPATIBILITY, subtle change in semantics.
3386 * Syntax.pretty_priority (default 0) configures the required priority
3387 of pretty-printed output and thus affects insertion of parentheses.
3389 * Syntax.default_root (default "any") configures the inner syntax
3390 category (nonterminal symbol) for parsing of terms.
3392 * Former exception Library.UnequalLengths now coincides with
3393 ListPair.UnequalLengths.
3395 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
3396 main functionality is provided by structure Simplifier.
3398 * Renamed raw "explode" function to "raw_explode" to emphasize its
3399 meaning. Note that internally to Isabelle, Symbol.explode is used in
3400 almost all situations.
3402 * Discontinued obsolete function sys_error and exception SYS_ERROR.
3403 See implementation manual for further details on exceptions in
3406 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
3409 * Renamed structure PureThy to Pure_Thy and moved most of its
3410 operations to structure Global_Theory, to emphasize that this is
3411 rarely-used global-only stuff.
3413 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
3414 instead (or tracing for high-volume output).
3416 * Configuration option show_question_marks only affects regular pretty
3417 printing of types and terms, not raw Term.string_of_vname.
3419 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
3420 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
3421 @{thms} for most purposes.
3423 * ML structure Unsynchronized is never opened, not even in Isar
3424 interaction mode as before. Old Unsynchronized.set etc. have been
3425 discontinued -- use plain := instead. This should be *rare* anyway,
3426 since modern tools always work via official context data, notably
3427 configuration options.
3429 * Parallel and asynchronous execution requires special care concerning
3430 interrupts. Structure Exn provides some convenience functions that
3431 avoid working directly with raw Interrupt. User code must not absorb
3432 interrupts -- intermediate handling (for cleanup etc.) needs to be
3433 followed by re-raising of the original exception. Another common
3434 source of mistakes are "handle _" patterns, which make the meaning of
3435 the program subject to physical effects of the environment.
3439 New in Isabelle2009-2 (June 2010)
3440 ---------------------------------
3444 * Authentic syntax for *all* logical entities (type classes, type
3445 constructors, term constants): provides simple and robust
3446 correspondence between formal entities and concrete syntax. Within
3447 the parse tree / AST representations, "constants" are decorated by
3448 their category (class, type, const) and spelled out explicitly with
3449 their full internal name.
3451 Substantial INCOMPATIBILITY concerning low-level syntax declarations
3452 and translations (translation rules and translation functions in ML).
3453 Some hints on upgrading:
3455 - Many existing uses of 'syntax' and 'translations' can be replaced
3456 by more modern 'type_notation', 'notation' and 'abbreviation',
3457 which are independent of this issue.
3459 - 'translations' require markup within the AST; the term syntax
3460 provides the following special forms:
3462 CONST c -- produces syntax version of constant c from context
3463 XCONST c -- literally c, checked as constant from context
3464 c -- literally c, if declared by 'syntax'
3466 Plain identifiers are treated as AST variables -- occasionally the
3467 system indicates accidental variables via the error "rhs contains
3470 Type classes and type constructors are marked according to their
3471 concrete syntax. Some old translations rules need to be written
3472 for the "type" category, using type constructor application
3473 instead of pseudo-term application of the default category
3476 - 'parse_translation' etc. in ML may use the following
3479 @{class_syntax c} -- type class c within parse tree / AST
3480 @{term_syntax c} -- type constructor c within parse tree / AST
3481 @{const_syntax c} -- ML version of "CONST c" above
3482 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
3484 - Literal types within 'typed_print_translations', i.e. those *not*
3485 represented as pseudo-terms are represented verbatim. Use @{class
3486 c} or @{type_name c} here instead of the above syntax
3489 Note that old non-authentic syntax was based on unqualified base
3490 names, so all of the above "constant" names would coincide. Recall
3491 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
3492 diagnose syntax problems.
3494 * Type constructors admit general mixfix syntax, not just infix.
3496 * Concrete syntax may be attached to local entities without a proof
3497 body, too. This works via regular mixfix annotations for 'fix',
3498 'def', 'obtain' etc. or via the explicit 'write' command, which is
3499 similar to the 'notation' command in theory specifications.
3501 * Discontinued unnamed infix syntax (legacy feature for many years) --
3502 need to specify constant name and syntax separately. Internal ML
3503 datatype constructors have been renamed from InfixName to Infix etc.
3504 Minor INCOMPATIBILITY.
3506 * Schematic theorem statements need to be explicitly markup as such,
3507 via commands 'schematic_lemma', 'schematic_theorem',
3508 'schematic_corollary'. Thus the relevance of the proof is made
3509 syntactically clear, which impacts performance in a parallel or
3510 asynchronous interactive environment. Minor INCOMPATIBILITY.
3512 * Use of cumulative prems via "!" in some proof methods has been
3513 discontinued (old legacy feature).
3515 * References 'trace_simp' and 'debug_simp' have been replaced by
3516 configuration options stored in the context. Enabling tracing (the
3517 case of debugging is similar) in proofs works via
3519 using [[trace_simp = true]]
3521 Tracing is then active for all invocations of the simplifier in
3522 subsequent goal refinement steps. Tracing may also still be enabled or
3523 disabled via the ProofGeneral settings menu.
3525 * Separate commands 'hide_class', 'hide_type', 'hide_const',
3526 'hide_fact' replace the former 'hide' KIND command. Minor
3529 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
3530 more efficient than combinations with -q1 or -q2.
3535 * Proofterms record type-class reasoning explicitly, using the
3536 "unconstrain" operation internally. This eliminates all sort
3537 constraints from a theorem and proof, introducing explicit
3538 OFCLASS-premises. On the proof term level, this operation is
3539 automatically applied at theorem boundaries, such that closed proofs
3540 are always free of sort constraints. INCOMPATIBILITY for tools that
3541 inspect proof terms.
3543 * Local theory specifications may depend on extra type variables that
3544 are not present in the result type -- arguments TYPE('a) :: 'a itself
3545 are added internally. For example:
3547 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
3549 * Predicates of locales introduced by classes carry a mandatory
3550 "class" prefix. INCOMPATIBILITY.
3552 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
3554 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
3557 * Command 'code_reflect' allows to incorporate generated ML code into
3558 runtime environment; replaces immature code_datatype antiquotation.
3561 * Code generator: simple concept for abstract datatypes obeying
3564 * Code generator: details of internal data cache have no impact on the
3565 user space functionality any longer.
3567 * Methods "unfold_locales" and "intro_locales" ignore non-locale
3568 subgoals. This is more appropriate for interpretations with 'where'.
3571 * Command 'example_proof' opens an empty proof body. This allows to
3572 experiment with Isar, without producing any persistent result.
3574 * Commands 'type_notation' and 'no_type_notation' declare type syntax
3575 within a local theory context, with explicit checking of the
3576 constructors involved (in contrast to the raw 'syntax' versions).
3578 * Commands 'types' and 'typedecl' now work within a local theory
3579 context -- without introducing dependencies on parameters or
3580 assumptions, which is not possible in Isabelle/Pure.
3582 * Command 'defaultsort' has been renamed to 'default_sort', it works
3583 within a local theory context. Minor INCOMPATIBILITY.
3588 * Command 'typedef' now works within a local theory context -- without
3589 introducing dependencies on parameters or assumptions, which is not
3590 possible in Isabelle/Pure/HOL. Note that the logical environment may
3591 contain multiple interpretations of local typedefs (with different
3592 non-emptiness proofs), even in a global theory context.
3594 * New package for quotient types. Commands 'quotient_type' and
3595 'quotient_definition' may be used for defining types and constants by
3596 quotient constructions. An example is the type of integers created by
3597 quotienting pairs of natural numbers:
3600 intrel :: "(nat * nat) => (nat * nat) => bool"
3602 "intrel (x, y) (u, v) = (x + v = u + y)"
3604 quotient_type int = "nat * nat" / intrel
3605 by (auto simp add: equivp_def expand_fun_eq)
3608 "0::int" is "(0::nat, 0::nat)"
3610 The method "lifting" can be used to lift of theorems from the
3611 underlying "raw" type to the quotient type. The example
3612 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
3613 construction and provides a reasoning infrastructure for finite sets.
3615 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
3616 clash with new theory Quotient in Main HOL.
3618 * Moved the SMT binding into the main HOL session, eliminating
3619 separate HOL-SMT session.
3621 * List membership infix mem operation is only an input abbreviation.
3624 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
3625 for future developements; former Library/Word.thy is still present in
3626 the AFP entry RSAPPS.
3628 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
3629 longer shadowed. INCOMPATIBILITY.
3631 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
3634 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
3637 * Dropped normalizing_semiring etc; use the facts in semiring classes
3638 instead. INCOMPATIBILITY.
3640 * Dropped several real-specific versions of lemmas about floor and
3641 ceiling; use the generic lemmas from theory "Archimedean_Field"
3642 instead. INCOMPATIBILITY.
3644 floor_number_of_eq ~> floor_number_of
3645 le_floor_eq_number_of ~> number_of_le_floor
3646 le_floor_eq_zero ~> zero_le_floor
3647 le_floor_eq_one ~> one_le_floor
3648 floor_less_eq_number_of ~> floor_less_number_of
3649 floor_less_eq_zero ~> floor_less_zero
3650 floor_less_eq_one ~> floor_less_one
3651 less_floor_eq_number_of ~> number_of_less_floor
3652 less_floor_eq_zero ~> zero_less_floor
3653 less_floor_eq_one ~> one_less_floor
3654 floor_le_eq_number_of ~> floor_le_number_of
3655 floor_le_eq_zero ~> floor_le_zero
3656 floor_le_eq_one ~> floor_le_one
3657 floor_subtract_number_of ~> floor_diff_number_of
3658 floor_subtract_one ~> floor_diff_one
3659 ceiling_number_of_eq ~> ceiling_number_of
3660 ceiling_le_eq_number_of ~> ceiling_le_number_of
3661 ceiling_le_zero_eq ~> ceiling_le_zero
3662 ceiling_le_eq_one ~> ceiling_le_one
3663 less_ceiling_eq_number_of ~> number_of_less_ceiling
3664 less_ceiling_eq_zero ~> zero_less_ceiling
3665 less_ceiling_eq_one ~> one_less_ceiling
3666 ceiling_less_eq_number_of ~> ceiling_less_number_of
3667 ceiling_less_eq_zero ~> ceiling_less_zero
3668 ceiling_less_eq_one ~> ceiling_less_one
3669 le_ceiling_eq_number_of ~> number_of_le_ceiling
3670 le_ceiling_eq_zero ~> zero_le_ceiling
3671 le_ceiling_eq_one ~> one_le_ceiling
3672 ceiling_subtract_number_of ~> ceiling_diff_number_of
3673 ceiling_subtract_one ~> ceiling_diff_one
3675 * Theory "Finite_Set": various folding_XXX locales facilitate the
3676 application of the various fold combinators on finite sets.
3678 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
3679 provides abstract red-black tree type which is backed by "RBT_Impl" as
3680 implementation. INCOMPATIBILTY.
3682 * Theory Library/Coinductive_List has been removed -- superseded by
3683 AFP/thys/Coinductive.
3685 * Theory PReal, including the type "preal" and related operations, has
3686 been removed. INCOMPATIBILITY.
3688 * Real: new development using Cauchy Sequences.
3690 * Split off theory "Big_Operators" containing setsum, setprod,
3691 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
3693 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
3694 "Int" etc. INCOMPATIBILITY.
3696 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
3698 * New set of rules "ac_simps" provides combined assoc / commute
3699 rewrites for all interpretations of the appropriate generic locales.
3701 * Renamed theory "OrderedGroup" to "Groups" and split theory
3702 "Ring_and_Field" into theories "Rings" and "Fields"; for more
3703 appropriate and more consistent names suitable for name prefixes
3704 within the HOL theories. INCOMPATIBILITY.
3706 * Some generic constants have been put to appropriate theories:
3707 - less_eq, less: Orderings
3708 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
3709 - inverse, divide: Rings
3712 * More consistent naming of type classes involving orderings (and
3715 lower_semilattice ~> semilattice_inf
3716 upper_semilattice ~> semilattice_sup
3718 dense_linear_order ~> dense_linorder
3720 pordered_ab_group_add ~> ordered_ab_group_add
3721 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
3722 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
3723 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
3724 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
3725 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
3726 pordered_cancel_semiring ~> ordered_cancel_semiring
3727 pordered_comm_monoid_add ~> ordered_comm_monoid_add
3728 pordered_comm_ring ~> ordered_comm_ring
3729 pordered_comm_semiring ~> ordered_comm_semiring
3730 pordered_ring ~> ordered_ring
3731 pordered_ring_abs ~> ordered_ring_abs
3732 pordered_semiring ~> ordered_semiring
3734 ordered_ab_group_add ~> linordered_ab_group_add
3735 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
3736 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
3737 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
3738 ordered_field ~> linordered_field
3739 ordered_field_no_lb ~> linordered_field_no_lb
3740 ordered_field_no_ub ~> linordered_field_no_ub
3741 ordered_field_dense_linear_order ~> dense_linordered_field
3742 ordered_idom ~> linordered_idom
3743 ordered_ring ~> linordered_ring
3744 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
3745 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
3746 ordered_ring_strict ~> linordered_ring_strict
3747 ordered_semidom ~> linordered_semidom
3748 ordered_semiring ~> linordered_semiring
3749 ordered_semiring_1 ~> linordered_semiring_1
3750 ordered_semiring_1_strict ~> linordered_semiring_1_strict
3751 ordered_semiring_strict ~> linordered_semiring_strict
3753 The following slightly odd type classes have been moved to a
3754 separate theory Library/Lattice_Algebras:
3756 lordered_ab_group_add ~> lattice_ab_group_add
3757 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
3758 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
3759 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
3760 lordered_ring ~> lattice_ring
3764 * Refined field classes:
3765 - classes division_ring_inverse_zero, field_inverse_zero,
3766 linordered_field_inverse_zero include rule inverse 0 = 0 --
3767 subsumes former division_by_zero class;
3768 - numerous lemmas have been ported from field to division_ring.
3771 * Refined algebra theorem collections:
3772 - dropped theorem group group_simps, use algebra_simps instead;
3773 - dropped theorem group ring_simps, use field_simps instead;
3774 - proper theorem collection field_simps subsumes former theorem
3775 groups field_eq_simps and field_simps;
3776 - dropped lemma eq_minus_self_iff which is a duplicate for
3780 * Theory Finite_Set and List: some lemmas have been generalized from
3783 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
3784 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
3785 inter_Inter_fold_inter ~> inf_Inf_fold_inf
3786 union_Union_fold_union ~> sup_Sup_fold_sup
3787 Inter_fold_inter ~> Inf_fold_inf
3788 Union_fold_union ~> Sup_fold_sup
3789 inter_INTER_fold_inter ~> inf_INFI_fold_inf
3790 union_UNION_fold_union ~> sup_SUPR_fold_sup
3791 INTER_fold_inter ~> INFI_fold_inf
3792 UNION_fold_union ~> SUPR_fold_sup
3794 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
3795 replaced by the more convenient lemmas Inf_empty and Sup_empty.
3796 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
3797 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
3798 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
3799 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
3801 * Reorganized theory Multiset: swapped notation of pointwise and
3804 - pointwise ordering is instance of class order with standard syntax
3806 - multiset ordering has syntax <=# and <#; partial order properties
3807 are provided by means of interpretation with prefix
3809 - less duplication, less historical organization of sections,
3810 conversion from associations lists to multisets, rudimentary code
3812 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
3817 multiset_eq_conv_count_eq ~> multiset_ext_iff
3818 multi_count_ext ~> multiset_ext
3819 diff_union_inverse2 ~> diff_union_cancelR
3823 * Theory Permutation: replaced local "remove" by List.remove1.
3825 * Code generation: ML and OCaml code is decorated with signatures.
3827 * Theory List: added transpose.
3829 * Library/Nat_Bijection.thy is a collection of bijective functions
3830 between nat and other types, which supersedes the older libraries
3831 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
3834 Nat_Int_Bij.nat2_to_nat ~> prod_encode
3835 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
3836 Nat_Int_Bij.int_to_nat_bij ~> int_encode
3837 Nat_Int_Bij.nat_to_int_bij ~> int_decode
3838 Countable.pair_encode ~> prod_encode
3839 NatIso.prod2nat ~> prod_encode
3840 NatIso.nat2prod ~> prod_decode
3841 NatIso.sum2nat ~> sum_encode
3842 NatIso.nat2sum ~> sum_decode
3843 NatIso.list2nat ~> list_encode
3844 NatIso.nat2list ~> list_decode
3845 NatIso.set2nat ~> set_encode
3846 NatIso.nat2set ~> set_decode
3849 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
3850 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
3851 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
3852 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
3853 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
3854 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
3855 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
3856 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
3857 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
3858 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
3859 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
3860 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
3861 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
3864 - Renamed ATP commands:
3865 atp_info ~> sledgehammer running_atps
3866 atp_kill ~> sledgehammer kill_atps
3867 atp_messages ~> sledgehammer messages
3868 atp_minimize ~> sledgehammer minimize
3869 print_atps ~> sledgehammer available_atps
3871 - Added user's manual ("isabelle doc sledgehammer").
3872 - Added option syntax and "sledgehammer_params" to customize
3873 Sledgehammer's behavior. See the manual for details.
3874 - Modified the Isar proof reconstruction code so that it produces
3875 direct proofs rather than proofs by contradiction. (This feature
3876 is still experimental.)
3877 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
3879 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
3882 - Added and implemented "binary_ints" and "bits" options.
3883 - Added "std" option and implemented support for nonstandard models.
3884 - Added and implemented "finitize" option to improve the precision
3885 of infinite datatypes based on a monotonicity analysis.
3886 - Added support for quotient types.
3887 - Added support for "specification" and "ax_specification"
3889 - Added support for local definitions (for "function" and
3890 "termination" proofs).
3891 - Added support for term postprocessors.
3892 - Optimized "Multiset.multiset" and "FinFun.finfun".
3893 - Improved efficiency of "destroy_constrs" optimization.
3894 - Fixed soundness bugs related to "destroy_constrs" optimization and
3896 - Fixed soundness bug related to higher-order constructors.
3897 - Fixed soundness bug when "full_descrs" is enabled.
3898 - Improved precision of set constructs.
3899 - Added "atoms" option.
3900 - Added cache to speed up repeated Kodkod invocations on the same
3902 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
3903 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
3904 "SAT4J_Light". INCOMPATIBILITY.
3905 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
3906 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
3907 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
3909 * Method "induct" now takes instantiations of the form t, where t is not
3910 a variable, as a shorthand for "x == t", where x is a fresh variable.
3911 If this is not intended, t has to be enclosed in parentheses.
3912 By default, the equalities generated by definitional instantiations
3913 are pre-simplified, which may cause parameters of inductive cases
3914 to disappear, or may even delete some of the inductive cases.
3915 Use "induct (no_simp)" instead of "induct" to restore the old
3916 behaviour. The (no_simp) option is also understood by the "cases"
3917 and "nominal_induct" methods, which now perform pre-simplification, too.
3923 * Variable names in lemmas generated by the domain package have
3924 changed; the naming scheme is now consistent with the HOL datatype
3925 package. Some proof scripts may be affected, INCOMPATIBILITY.
3927 * The domain package no longer defines the function "foo_copy" for
3928 recursive domain "foo". The reach lemma is now stated directly in
3929 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
3930 be reformulated in terms of "foo_take", INCOMPATIBILITY.
3932 * Most definedness lemmas generated by the domain package (previously
3933 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
3934 like "foo$x = UU <-> x = UU", which works better as a simp rule.
3935 Proofs that used definedness lemmas as intro rules may break,
3936 potential INCOMPATIBILITY.
3938 * Induction and casedist rules generated by the domain package now
3939 declare proper case_names (one called "bottom", and one named for each
3940 constructor). INCOMPATIBILITY.
3942 * For mutually-recursive domains, separate "reach" and "take_lemma"
3943 rules are generated for each domain, INCOMPATIBILITY.
3945 foo_bar.reach ~> foo.reach bar.reach
3946 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
3948 * Some lemmas generated by the domain package have been renamed for
3949 consistency with the datatype package, INCOMPATIBILITY.
3951 foo.ind ~> foo.induct
3952 foo.finite_ind ~> foo.finite_induct
3953 foo.coind ~> foo.coinduct
3954 foo.casedist ~> foo.exhaust
3955 foo.exhaust ~> foo.nchotomy
3957 * For consistency with other definition packages, the fixrec package
3958 now generates qualified theorem names, INCOMPATIBILITY.
3960 foo_simps ~> foo.simps
3961 foo_unfold ~> foo.unfold
3962 foo_induct ~> foo.induct
3964 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
3965 method and internal fixrec proofs now use the default simpset instead.
3968 * The "contlub" predicate has been removed. Proof scripts should use
3969 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
3971 * The "admw" predicate has been removed, INCOMPATIBILITY.
3973 * The constants cpair, cfst, and csnd have been removed in favor of
3974 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
3979 * Antiquotations for basic formal entities:
3981 @{class NAME} -- type class
3982 @{class_syntax NAME} -- syntax representation of the above
3984 @{type_name NAME} -- logical type
3985 @{type_abbrev NAME} -- type abbreviation
3986 @{nonterminal NAME} -- type of concrete syntactic category
3987 @{type_syntax NAME} -- syntax representation of any of the above
3989 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
3990 @{const_abbrev NAME} -- abbreviated constant
3991 @{const_syntax NAME} -- syntax representation of any of the above
3993 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
3994 syntax constant (cf. 'syntax' command).
3996 * Antiquotation @{make_string} inlines a function to print arbitrary
3997 values similar to the ML toplevel. The result is compiler dependent
3998 and may fall back on "?" in certain situations.
4000 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
4001 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
4002 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
4003 not work with the asynchronous Isar document model.
4005 * Configuration options now admit dynamic default values, depending on
4006 the context or even global references.
4008 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
4009 uses an efficient external library if available (for Poly/ML).
4011 * Renamed some important ML structures, while keeping the old names
4012 for some time as aliases within the structure Legacy:
4014 OuterKeyword ~> Keyword
4017 OuterSyntax ~> Outer_Syntax
4018 PrintMode ~> Print_Mode
4019 SpecParse ~> Parse_Spec
4022 ThyOutput ~> Thy_Output
4023 TypeInfer ~> Type_Infer
4025 Note that "open Legacy" simplifies porting of sources, but forgetting
4026 to remove it again will complicate porting again in the future.
4028 * Most operations that refer to a global context are named
4029 accordingly, e.g. Simplifier.global_context or
4030 ProofContext.init_global. There are some situations where a global
4031 context actually works, but under normal circumstances one needs to
4032 pass the proper local context through the code!
4034 * Discontinued old TheoryDataFun with its copy/init operation -- data
4035 needs to be pure. Functor Theory_Data_PP retains the traditional
4036 Pretty.pp argument to merge, which is absent in the standard
4037 Theory_Data version.
4039 * Sorts.certify_sort and derived "cert" operations for types and terms
4040 no longer minimize sorts. Thus certification at the boundary of the
4041 inference kernel becomes invariant under addition of class relations,
4042 which is an important monotonicity principle. Sorts are now minimized
4043 in the syntax layer only, at the boundary between the end-user and the
4044 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
4045 explicitly in rare situations.
4047 * Renamed old-style Drule.standard to Drule.export_without_context, to
4048 emphasize that this is in no way a standard operation.
4051 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
4052 usual for resolution. Rare INCOMPATIBILITY.
4054 * Renamed varify/unvarify operations to varify_global/unvarify_global
4055 to emphasize that these only work in a global situation (which is
4058 * Curried take and drop in library.ML; negative length is interpreted
4059 as infinity (as in chop). Subtle INCOMPATIBILITY.
4061 * Proof terms: type substitutions on proof constants now use canonical
4062 order of type variables. INCOMPATIBILITY for tools working with proof
4065 * Raw axioms/defs may no longer carry sort constraints, and raw defs
4066 may no longer carry premises. User-level specifications are
4067 transformed accordingly by Thm.add_axiom/add_def.
4072 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
4073 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
4074 proof terms are enabled unconditionally in the new HOL-Proofs image.
4076 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
4077 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
4080 * Old lib/scripts/polyml-platform is superseded by the
4081 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
4082 variant, even on a 64 bit machine. The following example setting
4083 prefers 64 bit if available:
4085 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
4087 * The preliminary Isabelle/jEdit application demonstrates the emerging
4088 Isabelle/Scala layer for advanced prover interaction and integration.
4089 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
4092 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
4093 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
4094 similar to the default assignment of the document preparation system
4095 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
4096 provides some operations for direct access to the font without asking
4097 the user for manual installation.
4101 New in Isabelle2009-1 (December 2009)
4102 -------------------------------------
4106 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
4107 one backslash should be used, even in ML sources.
4112 * Locale interpretation propagates mixins along the locale hierarchy.
4113 The currently only available mixins are the equations used to map
4114 local definitions to terms of the target domain of an interpretation.
4116 * Reactivated diagnostic command 'print_interps'. Use "print_interps
4117 loc" to print all interpretations of locale "loc" in the theory.
4118 Interpretations in proofs are not shown.
4120 * Thoroughly revised locales tutorial. New section on conditional
4123 * On instantiation of classes, remaining undefined class parameters
4124 are formally declared. INCOMPATIBILITY.
4127 *** Document preparation ***
4129 * New generalized style concept for printing terms: @{foo (style) ...}
4130 instead of @{foo_style style ...} (old form is still retained for
4131 backward compatibility). Styles can be also applied for
4132 antiquotations prop, term_type and typeof.
4137 * New proof method "smt" for a combination of first-order logic with
4138 equality, linear and nonlinear (natural/integer/real) arithmetic, and
4139 fixed-size bitvectors; there is also basic support for higher-order
4140 features (esp. lambda abstractions). It is an incomplete decision
4141 procedure based on external SMT solvers using the oracle mechanism;
4142 for the SMT solver Z3, this method is proof-producing. Certificates
4143 are provided to avoid calling the external solvers solely for
4144 re-checking proofs. Due to a remote SMT service there is no need for
4145 installing SMT solvers locally. See src/HOL/SMT.
4147 * New commands to load and prove verification conditions generated by
4148 the Boogie program verifier or derived systems (e.g. the Verifying C
4149 Compiler (VCC) or Spec#). See src/HOL/Boogie.
4151 * New counterexample generator tool 'nitpick' based on the Kodkod
4152 relational model finder. See src/HOL/Tools/Nitpick and
4153 src/HOL/Nitpick_Examples.
4155 * New commands 'code_pred' and 'values' to invoke the predicate
4156 compiler and to enumerate values of inductive predicates.
4158 * A tabled implementation of the reflexive transitive closure.
4160 * New implementation of quickcheck uses generic code generator;
4161 default generators are provided for all suitable HOL types, records
4162 and datatypes. Old quickcheck can be re-activated importing theory
4163 Library/SML_Quickcheck.
4165 * New testing tool Mirabelle for automated proof tools. Applies
4166 several tools and tactics like sledgehammer, metis, or quickcheck, to
4167 every proof step in a theory. To be used in batch mode via the
4168 "mirabelle" utility.
4170 * New proof method "sos" (sum of squares) for nonlinear real
4171 arithmetic (originally due to John Harison). It requires theory
4172 Library/Sum_Of_Squares. It is not a complete decision procedure but
4173 works well in practice on quantifier-free real arithmetic with +, -,
4174 *, ^, =, <= and <, i.e. boolean combinations of equalities and
4175 inequalities between polynomials. It makes use of external
4176 semidefinite programming solvers. Method "sos" generates a
4177 certificate that can be pasted into the proof thus avoiding the need
4178 to call an external tool every time the proof is checked. See
4179 src/HOL/Library/Sum_Of_Squares.
4181 * New method "linarith" invokes existing linear arithmetic decision
4184 * New command 'atp_minimal' reduces result produced by Sledgehammer.
4186 * New Sledgehammer option "Full Types" in Proof General settings menu.
4187 Causes full type information to be output to the ATPs. This slows
4188 ATPs down considerably but eliminates a source of unsound "proofs"
4191 * New method "metisFT": A version of metis that uses full type
4192 information in order to avoid failures of proof reconstruction.
4194 * New evaluator "approximate" approximates an real valued term using
4195 the same method as the approximation method.
4197 * Method "approximate" now supports arithmetic expressions as
4198 boundaries of intervals and implements interval splitting and Taylor
4201 * ML antiquotation @{code_datatype} inserts definition of a datatype
4202 generated by the code generator; e.g. see src/HOL/Predicate.thy.
4204 * New theory SupInf of the supremum and infimum operators for sets of
4207 * New theory Probability, which contains a development of measure
4208 theory, eventually leading to Lebesgue integration and probability.
4210 * Extended Multivariate Analysis to include derivation and Brouwer's
4213 * Reorganization of number theory, INCOMPATIBILITY:
4214 - new number theory development for nat and int, in theories Divides
4215 and GCD as well as in new session Number_Theory
4216 - some constants and facts now suffixed with _nat and _int
4218 - former session NumberTheory now named Old_Number_Theory, including
4219 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
4220 - moved theory Pocklington from src/HOL/Library to
4221 src/HOL/Old_Number_Theory
4223 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
4224 lcm of finite and infinite sets. It is shown that they form a complete
4227 * Class semiring_div requires superclass no_zero_divisors and proof of
4228 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
4229 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
4230 generalized to class semiring_div, subsuming former theorems
4231 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
4232 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
4235 * Refinements to lattice classes and sets:
4236 - less default intro/elim rules in locale variant, more default
4237 intro/elim rules in class variant: more uniformity
4238 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
4240 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
4242 - renamed ACI to inf_sup_aci
4243 - new class "boolean_algebra"
4244 - class "complete_lattice" moved to separate theory
4245 "Complete_Lattice"; corresponding constants (and abbreviations)
4246 renamed and with authentic syntax:
4247 Set.Inf ~> Complete_Lattice.Inf
4248 Set.Sup ~> Complete_Lattice.Sup
4249 Set.INFI ~> Complete_Lattice.INFI
4250 Set.SUPR ~> Complete_Lattice.SUPR
4251 Set.Inter ~> Complete_Lattice.Inter
4252 Set.Union ~> Complete_Lattice.Union
4253 Set.INTER ~> Complete_Lattice.INTER
4254 Set.UNION ~> Complete_Lattice.UNION
4255 - authentic syntax for
4258 - mere abbreviations:
4261 Set.inter (for inf, formerly Set.Int)
4262 Set.union (for sup, formerly Set.Un)
4263 Complete_Lattice.Inter (for Inf)
4264 Complete_Lattice.Union (for Sup)
4265 Complete_Lattice.INTER (for INFI)
4266 Complete_Lattice.UNION (for SUPR)
4267 - object-logic definitions as far as appropriate
4269 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
4270 Un_subset_iff are explicitly deleted as default simp rules; then also
4271 their lattice counterparts le_inf_iff and le_sup_iff have to be
4272 deleted to achieve the desired effect.
4274 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
4275 rules by default any longer; the same applies to min_max.inf_absorb1
4276 etc. INCOMPATIBILITY.
4278 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
4279 pred_set_conv by default. INCOMPATIBILITY.
4281 * Power operations on relations and functions are now one dedicated
4282 constant "compow" with infix syntax "^^". Power operation on
4283 multiplicative monoids retains syntax "^" and is now defined generic
4284 in class power. INCOMPATIBILITY.
4286 * Relation composition "R O S" now has a more standard argument order:
4287 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
4288 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
4289 break, since the O_assoc rule was not rewritten like this. Fix using
4290 O_assoc[symmetric]. The same applies to the curried version "R OO S".
4292 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
4293 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
4296 * Most rules produced by inductive and datatype package have mandatory
4297 prefixes. INCOMPATIBILITY.
4299 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
4300 the attribute of the same name. Each of the theorems in the list
4301 DERIV_intros assumes composition with an additional function and
4302 matches a variable to the derivative, which has to be solved by the
4303 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
4304 of most elementary terms. Former Maclauren.DERIV_tac and
4305 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
4308 * Code generator attributes follow the usual underscore convention:
4309 code_unfold replaces code unfold
4310 code_post replaces code post
4315 sizechange -> size_change
4316 induct_scheme -> induction_schema
4319 * Discontinued abbreviation "arbitrary" of constant "undefined".
4320 INCOMPATIBILITY, use "undefined" directly.
4323 Suc_eq_add_numeral_1 -> Suc_eq_plus1
4324 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
4325 Suc_plus1 -> Suc_eq_plus1
4326 *anti_sym -> *antisym*
4327 vector_less_eq_def -> vector_le_def
4330 * Added theorem List.map_map as [simp]. Removed List.map_compose.
4333 * Removed predicate "M hassize n" (<--> card M = n & finite M).
4339 * Theory Representable defines a class "rep" of domains that are
4340 representable (via an ep-pair) in the universal domain type "udom".
4341 Instances are provided for all type constructors defined in HOLCF.
4343 * The 'new_domain' command is a purely definitional version of the
4344 domain package, for representable domains. Syntax is identical to the
4345 old domain package. The 'new_domain' package also supports indirect
4346 recursion using previously-defined type constructors. See
4347 src/HOLCF/ex/New_Domain.thy for examples.
4349 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
4350 on the left-hand side of an equation, and then performs
4351 simplification. Rewriting is done using rules declared with the
4352 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
4353 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
4355 * The pattern-match compiler in 'fixrec' can now handle constructors
4356 with HOL function types. Pattern-match combinators for the Pair
4357 constructor are pre-configured.
4359 * The 'fixrec' package now produces better fixed-point induction rules
4360 for mutually-recursive definitions: Induction rules have conclusions
4361 of the form "P foo bar" instead of "P <foo, bar>".
4363 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
4364 been renamed to "below". The name "below" now replaces "less" in many
4365 theorem names. (Legacy theorem names using "less" are still supported
4368 * The 'fixrec' package now supports "bottom patterns". Bottom
4369 patterns can be used to generate strictness rules, or to make
4370 functions more strict (much like the bang-patterns supported by the
4371 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
4377 * Support for Poly/ML 5.3.0, with improved reporting of compiler
4378 errors and run-time exceptions, including detailed source positions.
4380 * Structure Name_Space (formerly NameSpace) now manages uniquely
4381 identified entries, with some additional information such as source
4382 position, logical grouping etc.
4384 * Theory and context data is now introduced by the simplified and
4385 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
4386 to be pure, but the old TheoryDataFun for mutable data (with explicit
4387 copy operation) is still available for some time.
4389 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
4390 provides a high-level programming interface to synchronized state
4391 variables with atomic update. This works via pure function
4392 application within a critical section -- its runtime should be as
4393 short as possible; beware of deadlocks if critical code is nested,
4394 either directly or indirectly via other synchronized variables!
4396 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
4397 wraps raw ML references, explicitly indicating their non-thread-safe
4398 behaviour. The Isar toplevel keeps this structure open, to
4399 accommodate Proof General as well as quick and dirty interactive
4400 experiments with references.
4402 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
4403 parallel tactical reasoning.
4405 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
4406 are similar to SUBPROOF, but are slightly more flexible: only the
4407 specified parts of the subgoal are imported into the context, and the
4408 body tactic may introduce new subgoals and schematic variables.
4410 * Old tactical METAHYPS, which does not observe the proof context, has
4411 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
4412 or Subgoal.FOCUS etc.
4414 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
4415 functors have their own ML name space there is no point to mark them
4416 separately.) Minor INCOMPATIBILITY.
4418 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
4420 * Renamed several structures FooBar to Foo_Bar. Occasional,
4423 * Operations of structure Skip_Proof no longer require quick_and_dirty
4424 mode, which avoids critical setmp.
4426 * Eliminated old Attrib.add_attributes, Method.add_methods and related
4427 combinators for "args". INCOMPATIBILITY, need to use simplified
4428 Attrib/Method.setup introduced in Isabelle2009.
4430 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
4431 back on global_simpset_of, global_claset_of, global_clasimpset_of as
4432 last resort. INCOMPATIBILITY.
4434 * Display.pretty_thm now requires a proper context (cf. former
4435 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
4436 or even Display.pretty_thm_without_context as last resort.
4439 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
4440 Syntax.pretty_typ/term directly, preferably with proper context
4441 instead of global theory.
4446 * Further fine tuning of parallel proof checking, scales up to 8 cores
4447 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
4450 * Support for additional "Isabelle components" via etc/components, see
4451 also the system manual.
4453 * The isabelle makeall tool now operates on all components with
4454 IsaMakefile, not just hardwired "logics".
4456 * Removed "compress" option from isabelle-process and isabelle usedir;
4457 this is always enabled.
4459 * Discontinued support for Poly/ML 4.x versions.
4461 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
4462 on a given logic image. This requires the lighttpd webserver and is
4463 currently supported on Linux only.
4467 New in Isabelle2009 (April 2009)
4468 --------------------------------
4472 * Simplified main Isabelle executables, with less surprises on
4473 case-insensitive file-systems (such as Mac OS).
4475 - The main Isabelle tool wrapper is now called "isabelle" instead of
4478 - The former "isabelle" alias for "isabelle-process" has been
4479 removed (should rarely occur to regular users).
4481 - The former "isabelle-interface" and its alias "Isabelle" have been
4482 removed (interfaces are now regular Isabelle tools).
4484 Within scripts and make files, the Isabelle environment variables
4485 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
4486 respectively. (The latter are still available as legacy feature.)
4488 The old isabelle-interface wrapper could react in confusing ways if
4489 the interface was uninstalled or changed otherwise. Individual
4490 interface tool configuration is now more explicit, see also the
4491 Isabelle system manual. In particular, Proof General is now available
4492 via "isabelle emacs".
4494 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
4495 purge installed copies of Isabelle executables and re-run "isabelle
4496 install -p ...", or use symlinks.
4498 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
4499 old ~/isabelle, which was slightly non-standard and apt to cause
4500 surprises on case-insensitive file-systems (such as Mac OS).
4502 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
4503 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
4504 care is required when using older releases of Isabelle. Note that
4505 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
4506 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
4508 * Proofs of fully specified statements are run in parallel on
4509 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
4510 a regular 4-core machine, if the initial heap space is made reasonably
4511 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
4513 * The main reference manuals ("isar-ref", "implementation", and
4514 "system") have been updated and extended. Formally checked references
4515 as hyperlinks are now available uniformly.
4520 * Complete re-implementation of locales. INCOMPATIBILITY in several
4521 respects. The most important changes are listed below. See the
4522 Tutorial on Locales ("locales" manual) for details.
4524 - In locale expressions, instantiation replaces renaming. Parameters
4525 must be declared in a for clause. To aid compatibility with previous
4526 parameter inheritance, in locale declarations, parameters that are not
4527 'touched' (instantiation position "_" or omitted) are implicitly added
4528 with their syntax at the beginning of the for clause.
4530 - Syntax from abbreviations and definitions in locales is available in
4531 locale expressions and context elements. The latter is particularly
4532 useful in locale declarations.
4534 - More flexible mechanisms to qualify names generated by locale
4535 expressions. Qualifiers (prefixes) may be specified in locale
4536 expressions, and can be marked as mandatory (syntax: "name!:") or
4537 optional (syntax "name?:"). The default depends for plain "name:"
4538 depends on the situation where a locale expression is used: in
4539 commands 'locale' and 'sublocale' prefixes are optional, in
4540 'interpretation' and 'interpret' prefixes are mandatory. The old
4541 implicit qualifiers derived from the parameter names of a locale are
4542 no longer generated.
4544 - Command "sublocale l < e" replaces "interpretation l < e". The
4545 instantiation clause in "interpretation" and "interpret" (square
4546 brackets) is no longer available. Use locale expressions.
4548 - When converting proof scripts, mandatory qualifiers in
4549 'interpretation' and 'interpret' should be retained by default, even
4550 if this is an INCOMPATIBILITY compared to former behavior. In the
4551 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
4552 in locale expressions range over a single locale instance only.
4554 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
4555 In existing theorem specifications replace the includes element by the
4556 respective context elements of the included locale, omitting those
4557 that are already present in the theorem specification. Multiple
4558 assume elements of a locale should be replaced by a single one
4559 involving the locale predicate. In the proof body, declarations (most
4560 notably theorems) may be regained by interpreting the respective
4561 locales in the proof context as required (command "interpret").
4563 If using "includes" in replacement of a target solely because the
4564 parameter types in the theorem are not as general as in the target,
4565 consider declaring a new locale with additional type constraints on
4566 the parameters (context element "constrains").
4568 - Discontinued "locale (open)". INCOMPATIBILITY.
4570 - Locale interpretation commands no longer attempt to simplify goal.
4571 INCOMPATIBILITY: in rare situations the generated goal differs. Use
4572 methods intro_locales and unfold_locales to clarify.
4574 - Locale interpretation commands no longer accept interpretation
4575 attributes. INCOMPATIBILITY.
4577 * Class declaration: so-called "base sort" must not be given in import
4578 list any longer, but is inferred from the specification. Particularly
4585 class foo = type + ...
4587 * Class target: global versions of theorems stemming do not carry a
4588 parameter prefix any longer. INCOMPATIBILITY.
4590 * Class 'instance' command no longer accepts attached definitions.
4591 INCOMPATIBILITY, use proper 'instantiation' target instead.
4593 * Recovered hiding of consts, which was accidentally broken in
4594 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
4595 makes c inaccessible; consider using ``hide (open) const c'' instead.
4597 * Slightly more coherent Pure syntax, with updated documentation in
4598 isar-ref manual. Removed locales meta_term_syntax and
4599 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
4600 INCOMPATIBILITY in rare situations. Note that &&& should not be used
4601 directly in regular applications.
4603 * There is a new syntactic category "float_const" for signed decimal
4604 fractions (e.g. 123.45 or -123.45).
4606 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
4607 interface with 'setup' command instead.
4609 * Command 'local_setup' is similar to 'setup', but operates on a local
4612 * The 'axiomatization' command now only works within a global theory
4613 context. INCOMPATIBILITY.
4615 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
4616 hypotheses. Sorts required in the course of reasoning need to be
4617 covered by the constraints in the initial statement, completed by the
4618 type instance information of the background theory. Non-trivial sort
4619 hypotheses, which rarely occur in practice, may be specified via
4620 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
4622 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
4624 The result contains an implicit sort hypotheses as before --
4625 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
4628 * Generalized Isar history, with support for linear undo, direct state
4631 * Changed defaults for unify configuration options:
4633 unify_trace_bound = 50 (formerly 25)
4634 unify_search_bound = 60 (formerly 30)
4636 * Different bookkeeping for code equations (INCOMPATIBILITY):
4638 a) On theory merge, the last set of code equations for a particular
4639 constant is taken (in accordance with the policy applied by other
4640 parts of the code generator framework).
4642 b) Code equations stemming from explicit declarations (e.g. code
4643 attribute) gain priority over default code equations stemming
4644 from definition, primrec, fun etc.
4646 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
4648 * Unified theorem tables for both code generators. Thus [code
4649 func] has disappeared and only [code] remains. INCOMPATIBILITY.
4651 * Command 'find_consts' searches for constants based on type and name
4654 find_consts "_ => bool"
4656 By default, matching is against subtypes, but it may be restricted to
4657 the whole type. Searching by name is possible. Multiple queries are
4658 conjunctive and queries may be negated by prefixing them with a
4661 find_consts strict: "_ => bool" name: "Int" -"int => int"
4663 * New 'find_theorems' criterion "solves" matches theorems that
4664 directly solve the current goal (modulo higher-order unification).
4666 * Auto solve feature for main theorem statements: whenever a new goal
4667 is stated, "find_theorems solves" is called; any theorems that could
4668 solve the lemma directly are listed as part of the goal state.
4669 Cf. associated options in Proof General Isabelle settings menu,
4670 enabled by default, with reasonable timeout for pathological cases of
4671 higher-order unification.
4674 *** Document preparation ***
4676 * Antiquotation @{lemma} now imitates a regular terminal proof,
4677 demanding keyword 'by' and supporting the full method expression
4678 syntax just like the Isar command 'by'.
4683 * Integrated main parts of former image HOL-Complex with HOL. Entry
4684 points Main and Complex_Main remain as before.
4686 * Logic image HOL-Plain provides a minimal HOL with the most important
4687 tools available (inductive, datatype, primrec, ...). This facilitates
4688 experimentation and tool development. Note that user applications
4689 (and library theories) should never refer to anything below theory
4692 * Logic image HOL-Main stops at theory Main, and thus facilitates
4693 experimentation due to shorter build times.
4695 * Logic image HOL-NSA contains theories of nonstandard analysis which
4696 were previously part of former HOL-Complex. Entry point Hyperreal
4697 remains valid, but theories formerly using Complex_Main should now use
4698 new entry point Hypercomplex.
4700 * Generic ATP manager for Sledgehammer, based on ML threads instead of
4701 Posix processes. Avoids potentially expensive forking of the ML
4702 process. New thread-based implementation also works on non-Unix
4703 platforms (Cygwin). Provers are no longer hardwired, but defined
4704 within the theory via plain ML wrapper functions. Basic Sledgehammer
4705 commands are covered in the isar-ref manual.
4707 * Wrapper scripts for remote SystemOnTPTP service allows to use
4708 sledgehammer without local ATP installation (Vampire etc.). Other
4709 provers may be included via suitable ML wrappers, see also
4710 src/HOL/ATP_Linkup.thy.
4712 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
4715 * The metis method no longer fails because the theorem is too trivial
4716 (contains the empty clause).
4718 * The metis method now fails in the usual manner, rather than raising
4719 an exception, if it determines that it cannot prove the theorem.
4721 * Method "coherent" implements a prover for coherent logic (see also
4722 src/Tools/coherent.ML).
4724 * Constants "undefined" and "default" replace "arbitrary". Usually
4725 "undefined" is the right choice to replace "arbitrary", though
4726 logically there is no difference. INCOMPATIBILITY.
4728 * Command "value" now integrates different evaluation mechanisms. The
4729 result of the first successful evaluation mechanism is printed. In
4730 square brackets a particular named evaluation mechanisms may be
4731 specified (currently, [SML], [code] or [nbe]). See further
4732 src/HOL/ex/Eval_Examples.thy.
4734 * Normalization by evaluation now allows non-leftlinear equations.
4735 Declare with attribute [code nbe].
4737 * Methods "case_tac" and "induct_tac" now refer to the very same rules
4738 as the structured Isar versions "cases" and "induct", cf. the
4739 corresponding "cases" and "induct" attributes. Mutual induction rules
4740 are now presented as a list of individual projections
4741 (e.g. foo_bar.inducts for types foo and bar); the old format with
4742 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
4743 rare situations a different rule is selected --- notably nested tuple
4744 elimination instead of former prod.exhaust: use explicit (case_tac t
4745 rule: prod.exhaust) here.
4747 * Attributes "cases", "induct", "coinduct" support "del" option.
4749 * Removed fact "case_split_thm", which duplicates "case_split".
4751 * The option datatype has been moved to a new theory Option. Renamed
4752 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
4754 * New predicate "strict_mono" classifies strict functions on partial
4755 orders. With strict functions on linear orders, reasoning about
4756 (in)equalities is facilitated by theorems "strict_mono_eq",
4757 "strict_mono_less_eq" and "strict_mono_less".
4759 * Some set operations are now proper qualified constants with
4760 authentic syntax. INCOMPATIBILITY:
4771 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
4774 * Auxiliary class "itself" has disappeared -- classes without any
4775 parameter are treated as expected by the 'class' command.
4777 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
4779 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
4780 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
4782 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
4783 method "approximation". It proves formulas on real values by using
4784 interval arithmetic. In the formulas are also the transcendental
4785 functions sin, cos, tan, atan, ln, exp and the constant pi are
4786 allowed. For examples see
4787 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
4789 * Theory "Reflection" now resides in HOL/Library.
4791 * Entry point to Word library now simply named "Word".
4794 * Made source layout more coherent with logical distribution
4797 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
4798 src/HOL/Library/Code_Message.thy ~> src/HOL/
4799 src/HOL/Library/GCD.thy ~> src/HOL/
4800 src/HOL/Library/Order_Relation.thy ~> src/HOL/
4801 src/HOL/Library/Parity.thy ~> src/HOL/
4802 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
4803 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
4804 src/HOL/Real/Lubs.thy ~> src/HOL/
4805 src/HOL/Real/PReal.thy ~> src/HOL/
4806 src/HOL/Real/Rational.thy ~> src/HOL/
4807 src/HOL/Real/RComplete.thy ~> src/HOL/
4808 src/HOL/Real/RealDef.thy ~> src/HOL/
4809 src/HOL/Real/RealPow.thy ~> src/HOL/
4810 src/HOL/Real/Real.thy ~> src/HOL/
4811 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
4812 src/HOL/Complex/Complex.thy ~> src/HOL/
4813 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
4814 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
4815 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
4816 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
4817 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
4818 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
4819 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
4820 src/HOL/Hyperreal/Log.thy ~> src/HOL/
4821 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
4822 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
4823 src/HOL/Hyperreal/Series.thy ~> src/HOL/
4824 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
4825 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
4826 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
4827 src/HOL/Real/Float ~> src/HOL/Library/
4828 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
4829 src/HOL/Real/RealVector.thy ~> src/HOL/
4831 src/HOL/arith_data.ML ~> src/HOL/Tools
4832 src/HOL/hologic.ML ~> src/HOL/Tools
4833 src/HOL/simpdata.ML ~> src/HOL/Tools
4834 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
4835 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
4836 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
4837 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
4838 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
4839 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
4840 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
4842 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
4843 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
4844 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
4845 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
4846 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
4847 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
4849 * If methods "eval" and "evaluation" encounter a structured proof
4850 state with !!/==>, only the conclusion is evaluated to True (if
4851 possible), avoiding strange error messages.
4853 * Method "sizechange" automates termination proofs using (a
4854 modification of) the size-change principle. Requires SAT solver. See
4855 src/HOL/ex/Termination.thy for examples.
4857 * Simplifier: simproc for let expressions now unfolds if bound
4858 variable occurs at most once in let expression body. INCOMPATIBILITY.
4860 * Method "arith": Linear arithmetic now ignores all inequalities when
4861 fast_arith_neq_limit is exceeded, instead of giving up entirely.
4863 * New attribute "arith" for facts that should always be used
4864 automatically by arithmetic. It is intended to be used locally in
4867 assumes [arith]: "x > 0"
4869 Global usage is discouraged because of possible performance impact.
4871 * New classes "top" and "bot" with corresponding operations "top" and
4872 "bot" in theory Orderings; instantiation of class "complete_lattice"
4873 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
4875 * Changed definition lemma "less_fun_def" in order to provide an
4876 instance for preorders on functions; use lemma "less_le" instead.
4879 * Theory Orderings: class "wellorder" moved here, with explicit
4880 induction rule "less_induct" as assumption. For instantiation of
4881 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
4884 * Theory Orderings: added class "preorder" as superclass of "order".
4885 INCOMPATIBILITY: Instantiation proofs for order, linorder
4886 etc. slightly changed. Some theorems named order_class.* now named
4889 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
4892 * Theory Finite_Set: added a new fold combinator of type
4894 ('a => 'b => 'b) => 'b => 'a set => 'b
4896 Occasionally this is more convenient than the old fold combinator
4897 which is now defined in terms of the new one and renamed to
4900 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
4901 and "ring_simps" have been replaced by "algebra_simps" (which can be
4902 extended with further lemmas!). At the moment both still exist but
4903 the former will disappear at some point.
4905 * Theory Power: Lemma power_Suc is now declared as a simp rule in
4906 class recpower. Type-specific simp rules for various recpower types
4907 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
4909 rat_power_0 -> power_0
4910 rat_power_Suc -> power_Suc
4911 realpow_0 -> power_0
4912 realpow_Suc -> power_Suc
4913 complexpow_0 -> power_0
4914 complexpow_Suc -> power_Suc
4915 power_poly_0 -> power_0
4916 power_poly_Suc -> power_Suc
4918 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
4919 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
4920 dvd has been generalized to class comm_semiring_1. Likewise a bunch
4921 of lemmas from Divides has been generalized from nat to class
4922 semiring_div. INCOMPATIBILITY. This involves the following theorem
4923 renames resulting from duplicate elimination:
4925 dvd_def_mod ~> dvd_eq_mod_eq_0
4926 zero_dvd_iff ~> dvd_0_left_iff
4927 dvd_0 ~> dvd_0_right
4928 DIVISION_BY_ZERO_DIV ~> div_by_0
4929 DIVISION_BY_ZERO_MOD ~> mod_by_0
4930 mult_div ~> div_mult_self2_is_id
4931 mult_mod ~> mod_mult_self2_is_0
4933 * Theory IntDiv: removed many lemmas that are instances of class-based
4934 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
4935 rename old lemmas as follows:
4937 dvd_diff -> nat_dvd_diff
4938 dvd_zminus_iff -> dvd_minus_iff
4939 mod_add1_eq -> mod_add_eq
4940 mod_mult1_eq -> mod_mult_right_eq
4941 mod_mult1_eq' -> mod_mult_left_eq
4942 mod_mult_distrib_mod -> mod_mult_eq
4943 nat_mod_add_left_eq -> mod_add_left_eq
4944 nat_mod_add_right_eq -> mod_add_right_eq
4945 nat_mod_div_trivial -> mod_div_trivial
4946 nat_mod_mod_trivial -> mod_mod_trivial
4947 zdiv_zadd_self1 -> div_add_self1
4948 zdiv_zadd_self2 -> div_add_self2
4949 zdiv_zmult_self1 -> div_mult_self2_is_id
4950 zdiv_zmult_self2 -> div_mult_self1_is_id
4951 zdvd_triv_left -> dvd_triv_left
4952 zdvd_triv_right -> dvd_triv_right
4953 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
4954 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
4955 zmod_zadd_left_eq -> mod_add_left_eq
4956 zmod_zadd_right_eq -> mod_add_right_eq
4957 zmod_zadd_self1 -> mod_add_self1
4958 zmod_zadd_self2 -> mod_add_self2
4959 zmod_zadd1_eq -> mod_add_eq
4960 zmod_zdiff1_eq -> mod_diff_eq
4961 zmod_zdvd_zmod -> mod_mod_cancel
4962 zmod_zmod_cancel -> mod_mod_cancel
4963 zmod_zmult_self1 -> mod_mult_self2_is_0
4964 zmod_zmult_self2 -> mod_mult_self1_is_0
4967 zdvd_abs1 -> abs_dvd_iff
4968 zdvd_abs2 -> dvd_abs_iff
4969 zdvd_refl -> dvd_refl
4970 zdvd_trans -> dvd_trans
4971 zdvd_zadd -> dvd_add
4972 zdvd_zdiff -> dvd_diff
4973 zdvd_zminus_iff -> dvd_minus_iff
4974 zdvd_zminus2_iff -> minus_dvd_iff
4975 zdvd_zmultD -> dvd_mult_right
4976 zdvd_zmultD2 -> dvd_mult_left
4977 zdvd_zmult_mono -> mult_dvd_mono
4978 zdvd_0_right -> dvd_0_right
4979 zdvd_0_left -> dvd_0_left_iff
4980 zdvd_1_left -> one_dvd
4981 zminus_dvd_iff -> minus_dvd_iff
4983 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
4985 * The real numbers offer decimal input syntax: 12.34 is translated
4986 into 1234/10^2. This translation is not reversed upon output.
4988 * Theory Library/Polynomial defines an abstract type 'a poly of
4989 univariate polynomials with coefficients of type 'a. In addition to
4990 the standard ring operations, it also supports div and mod. Code
4991 generation is also supported, using list-style constructors.
4993 * Theory Library/Inner_Product defines a class of real_inner for real
4994 inner product spaces, with an overloaded operation inner :: 'a => 'a
4995 => real. Class real_inner is a subclass of real_normed_vector from
4998 * Theory Library/Product_Vector provides instances for the product
4999 type 'a * 'b of several classes from RealVector and Inner_Product.
5000 Definitions of addition, subtraction, scalar multiplication, norms,
5001 and inner products are included.
5003 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
5004 addition to the field operations, numerals and case syntax are also
5007 * Theory Library/Diagonalize provides constructive version of Cantor's
5008 first diagonalization argument.
5010 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
5011 zlcm (for int); carried together from various gcd/lcm developements in
5012 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
5013 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
5014 may recover tupled syntax as follows:
5016 hide (open) const gcd
5017 abbreviation gcd where
5018 "gcd == (%(a, b). GCD.gcd a b)"
5020 GCD.gcd ("gcd '(_, _')")
5022 The same works for lcm, zgcd, zlcm.
5024 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
5025 instantiations for algebraic structures. Removed some duplicate
5026 theorems. Changes in simp rules. INCOMPATIBILITY.
5028 * ML antiquotation @{code} takes a constant as argument and generates
5029 corresponding code in background and inserts name of the corresponding
5030 resulting ML value/function/datatype constructor binding in place.
5031 All occurrences of @{code} with a single ML block are generated
5032 simultaneously. Provides a generic and safe interface for
5033 instrumentalizing code generation. See
5034 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
5035 In future you ought to refrain from ad-hoc compiling generated SML
5036 code on the ML toplevel. Note that (for technical reasons) @{code}
5037 cannot refer to constants for which user-defined serializations are
5038 set. Refer to the corresponding ML counterpart directly in that
5041 * Command 'rep_datatype': instead of theorem names the command now
5042 takes a list of terms denoting the constructors of the type to be
5043 represented as datatype. The characteristic theorems have to be
5044 proven. INCOMPATIBILITY. Also observe that the following theorems
5045 have disappeared in favour of existing ones:
5047 unit_induct ~> unit.induct
5048 prod_induct ~> prod.induct
5049 sum_induct ~> sum.induct
5050 Suc_Suc_eq ~> nat.inject
5051 Suc_not_Zero Zero_not_Suc ~> nat.distinct
5056 * New locales for orders and lattices where the equivalence relation
5057 is not restricted to equality. INCOMPATIBILITY: all order and lattice
5058 locales use a record structure with field eq for the equivalence.
5060 * New theory of factorial domains.
5062 * Units_l_inv and Units_r_inv are now simp rules by default.
5063 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
5064 and/or r_inv will now also require deletion of these lemmas.
5066 * Renamed the following theorems, INCOMPATIBILITY:
5068 UpperD ~> Upper_memD
5069 LowerD ~> Lower_memD
5070 least_carrier ~> least_closed
5071 greatest_carrier ~> greatest_closed
5072 greatest_Lower_above ~> greatest_Lower_below
5073 one_zero ~> carrier_one_zero
5074 one_not_zero ~> carrier_one_not_zero (collision with assumption)
5079 * Nominal datatypes can now contain type-variables.
5081 * Commands 'nominal_inductive' and 'equivariance' work with local
5084 * Nominal primrec can now works with local theory targets and its
5085 specification syntax now conforms to the general format as seen in
5088 * Method "perm_simp" honours the standard simplifier attributes
5089 (no_asm), (no_asm_use) etc.
5091 * The new predicate #* is defined like freshness, except that on the
5092 left hand side can be a set or list of atoms.
5094 * Experimental command 'nominal_inductive2' derives strong induction
5095 principles for inductive definitions. In contrast to
5096 'nominal_inductive', which can only deal with a fixed number of
5097 binders, it can deal with arbitrary expressions standing for sets of
5098 atoms to be avoided. The only inductive definition we have at the
5099 moment that needs this generalisation is the typing rule for Lets in
5102 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
5103 -----------------------------------------------------------------
5104 Gamma |- Let x be t1 in t2 : T2
5106 In this rule one wants to avoid all the binders that are introduced by
5107 "close Gamma T1". We are looking for other examples where this
5108 feature might be useful. Please let us know.
5113 * Reimplemented the simplification procedure for proving continuity
5114 subgoals. The new simproc is extensible; users can declare additional
5115 continuity introduction rules with the attribute [cont2cont].
5117 * The continuity simproc now uses a different introduction rule for
5118 solving continuity subgoals on terms with lambda abstractions. In
5119 some rare cases the new simproc may fail to solve subgoals that the
5120 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
5121 Potential INCOMPATIBILITY.
5123 * Command 'fixrec': specification syntax now conforms to the general
5124 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
5125 examples. INCOMPATIBILITY.
5130 * Proof of Zorn's Lemma for partial orders.
5135 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
5136 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
5137 depends on multithreading, so timouts will not work before Poly/ML
5140 * High-level support for concurrent ML programming, see
5141 src/Pure/Cuncurrent. The data-oriented model of "future values" is
5142 particularly convenient to organize independent functional
5143 computations. The concept of "synchronized variables" provides a
5144 higher-order interface for components with shared state, avoiding the
5145 delicate details of mutexes and condition variables. (Requires
5146 Poly/ML 5.2.1 or later.)
5148 * ML bindings produced via Isar commands are stored within the Isar
5149 context (theory or proof). Consequently, commands like 'use' and 'ML'
5150 become thread-safe and work with undo as expected (concerning
5151 top-level bindings, not side-effects on global references).
5152 INCOMPATIBILITY, need to provide proper Isar context when invoking the
5153 compiler at runtime; really global bindings need to be given outside a
5154 theory. (Requires Poly/ML 5.2 or later.)
5156 * Command 'ML_prf' is analogous to 'ML' but works within a proof
5157 context. Top-level ML bindings are stored within the proof context in
5158 a purely sequential fashion, disregarding the nested proof structure.
5159 ML bindings introduced by 'ML_prf' are discarded at the end of the
5160 proof. (Requires Poly/ML 5.2 or later.)
5162 * Simplified ML attribute and method setup, cf. functions Attrib.setup
5163 and Method.setup, as well as Isar commands 'attribute_setup' and
5164 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
5165 existing code accordingly, or use plain 'setup' together with old
5168 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
5169 to 'a -> thm, while results are always tagged with an authentic oracle
5170 name. The Isar command 'oracle' is now polymorphic, no argument type
5171 is specified. INCOMPATIBILITY, need to simplify existing oracle code
5172 accordingly. Note that extra performance may be gained by producing
5173 the cterm carefully, avoiding slow Thm.cterm_of.
5175 * Simplified interface for defining document antiquotations via
5176 ThyOutput.antiquotation, ThyOutput.output, and optionally
5177 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
5178 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
5181 * More systematic treatment of long names, abstract name bindings, and
5182 name space operations. Basic operations on qualified names have been
5183 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
5184 Long_Name.append. Old type bstring has been mostly replaced by
5185 abstract type binding (see structure Binding), which supports precise
5186 qualification by packages and local theory targets, as well as proper
5187 tracking of source positions. INCOMPATIBILITY, need to wrap old
5188 bstring values into Binding.name, or better pass through abstract
5189 bindings everywhere. See further src/Pure/General/long_name.ML,
5190 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
5192 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
5193 LocalTheory.note etc.) now refer to the *full* internal name, not the
5194 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
5196 * Disposed old type and term read functions (Sign.read_def_typ,
5197 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
5198 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
5199 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
5200 Syntax.read_term_global etc.; see also OldGoals.read_term as last
5201 resort for legacy applications.
5203 * Disposed old declarations, tactics, tactic combinators that refer to
5204 the simpset or claset of an implicit theory (such as Addsimps,
5205 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
5206 embedded ML text, or local_simpset_of with a proper context passed as
5207 explicit runtime argument.
5209 * Rules and tactics that read instantiations (read_instantiate,
5210 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
5211 context, which is required for parsing and type-checking. Moreover,
5212 the variables are specified as plain indexnames, not string encodings
5213 thereof. INCOMPATIBILITY.
5215 * Generic Toplevel.add_hook interface allows to analyze the result of
5216 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
5217 for theorem dependency output of transactions resulting in a new
5220 * ML antiquotations: block-structured compilation context indicated by
5221 \<lbrace> ... \<rbrace>; additional antiquotation forms:
5223 @{binding name} - basic name binding
5224 @{let ?pat = term} - term abbreviation (HO matching)
5225 @{note name = fact} - fact abbreviation
5226 @{thm fact} - singleton fact (with attributes)
5227 @{thms fact} - general fact (with attributes)
5228 @{lemma prop by method} - singleton goal
5229 @{lemma prop by meth1 meth2} - singleton goal
5230 @{lemma prop1 ... propN by method} - general goal
5231 @{lemma prop1 ... propN by meth1 meth2} - general goal
5232 @{lemma (open) ...} - open derivation
5237 * The Isabelle "emacs" tool provides a specific interface to invoke
5238 Proof General / Emacs, with more explicit failure if that is not
5239 installed (the old isabelle-interface script silently falls back on
5240 isabelle-process). The PROOFGENERAL_HOME setting determines the
5241 installation location of the Proof General distribution.
5243 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
5244 the Isabelle process into a JVM/Scala application. See
5245 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
5246 process wrapper has been discontinued.)
5248 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
5250 * Various status messages (with exact source position information) are
5251 emitted, if proper markup print mode is enabled. This allows
5252 user-interface components to provide detailed feedback on internal
5257 New in Isabelle2008 (June 2008)
5258 -------------------------------
5262 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
5263 and updated, with formally checked references as hyperlinks.
5265 * Theory loader: use_thy (and similar operations) no longer set the
5266 implicit ML context, which was occasionally hard to predict and in
5267 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
5268 provides a proper context already.
5270 * Theory loader: old-style ML proof scripts being *attached* to a thy
5271 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
5272 'use' within a theory file will do the job.
5274 * Name space merge now observes canonical order, i.e. the second space
5275 is inserted into the first one, while existing entries in the first
5276 space take precedence. INCOMPATIBILITY in rare situations, may try to
5277 swap theory imports.
5279 * Syntax: symbol \<chi> is now considered a letter. Potential
5280 INCOMPATIBILITY in identifier syntax etc.
5282 * Outer syntax: string tokens no longer admit escaped white space,
5283 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
5284 white space without escapes.
5286 * Outer syntax: string tokens may contain arbitrary character codes
5287 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
5293 * Context-dependent token translations. Default setup reverts locally
5294 fixed variables, and adds hilite markup for undeclared frees.
5296 * Unused theorems can be found using the new command 'unused_thms'.
5297 There are three ways of invoking it:
5300 Only finds unused theorems in the current theory.
5302 (2) unused_thms thy_1 ... thy_n -
5303 Finds unused theorems in the current theory and all of its ancestors,
5304 excluding the theories thy_1 ... thy_n and all of their ancestors.
5306 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
5307 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
5308 their ancestors, excluding the theories thy_1 ... thy_n and all of
5311 In order to increase the readability of the list produced by
5312 unused_thms, theorems that have been created by a particular instance
5313 of a theory command such as 'inductive' or 'function' are considered
5314 to belong to the same "group", meaning that if at least one theorem in
5315 this group is used, the other theorems in the same group are no longer
5316 reported as unused. Moreover, if all theorems in the group are
5317 unused, only one theorem in the group is displayed.
5319 Note that proof objects have to be switched on in order for
5320 unused_thms to work properly (i.e. !proofs must be >= 1, which is
5321 usually the case when using Proof General with the default settings).
5323 * Authentic naming of facts disallows ad-hoc overwriting of previous
5324 theorems within the same name space. INCOMPATIBILITY, need to remove
5325 duplicate fact bindings, or even accidental fact duplications. Note
5326 that tools may maintain dynamically scoped facts systematically, using
5327 PureThy.add_thms_dynamic.
5329 * Command 'hide' now allows to hide from "fact" name space as well.
5331 * Eliminated destructive theorem database, simpset, claset, and
5332 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
5333 update of theories within ML code.
5335 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
5336 INCOMPATIBILITY, object-logics depending on former Pure require
5337 additional setup PureThy.old_appl_syntax_setup; object-logics
5338 depending on former CPure need to refer to Pure.
5340 * Commands 'use' and 'ML' are now purely functional, operating on
5341 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
5342 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
5345 * Command 'setup': discontinued implicit version with ML reference.
5347 * Instantiation target allows for simultaneous specification of class
5348 instance operations together with an instantiation proof.
5349 Type-checking phase allows to refer to class operations uniformly.
5350 See src/HOL/Complex/Complex.thy for an Isar example and
5351 src/HOL/Library/Eval.thy for an ML example.
5353 * Indexing of literal facts: be more serious about including only
5354 facts from the visible specification/proof context, but not the
5355 background context (locale etc.). Affects `prop` notation and method
5356 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
5359 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
5360 "(open)" option, which used to expose internal bound variables to the
5363 * Isar statements: removed obsolete case "rule_context".
5364 INCOMPATIBILITY, better use explicit fixes/assumes.
5366 * Locale proofs: default proof step now includes 'unfold_locales';
5367 hence 'proof' without argument may be used to unfold locale
5371 *** Document preparation ***
5373 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
5374 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
5375 obsolete thumbpdf setup (contemporary PDF viewers do this on the
5376 spot); renamed link color from "darkblue" to "linkcolor" (default
5377 value unchanged, can be redefined via \definecolor); no longer sets
5378 "a4paper" option (unnecessary or even intrusive).
5380 * Antiquotation @{lemma A method} proves proposition A by the given
5381 method (either a method name or a method name plus (optional) method
5382 arguments in parentheses) and prints A just like @{prop A}.
5387 * New primrec package. Specification syntax conforms in style to
5388 definition/function/.... No separate induction rule is provided. The
5389 "primrec" command distinguishes old-style and new-style specifications
5390 by syntax. The former primrec package is now named OldPrimrecPackage.
5391 When adjusting theories, beware: constants stemming from new-style
5392 primrec specifications have authentic syntax.
5394 * Metis prover is now an order of magnitude faster, and also works
5395 with multithreading.
5397 * Metis: the maximum number of clauses that can be produced from a
5398 theorem is now given by the attribute max_clauses. Theorems that
5399 exceed this number are ignored, with a warning printed.
5401 * Sledgehammer no longer produces structured proofs by default. To
5402 enable, declare [[sledgehammer_full = true]]. Attributes
5403 reconstruction_modulus, reconstruction_sorts renamed
5404 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
5406 * Method "induct_scheme" derives user-specified induction rules
5407 from well-founded induction and completeness of patterns. This factors
5408 out some operations that are done internally by the function package
5409 and makes them available separately. See
5410 src/HOL/ex/Induction_Scheme.thy for examples.
5412 * More flexible generation of measure functions for termination
5413 proofs: Measure functions can be declared by proving a rule of the
5414 form "is_measure f" and giving it the [measure_function] attribute.
5415 The "is_measure" predicate is logically meaningless (always true), and
5416 just guides the heuristic. To find suitable measure functions, the
5417 termination prover sets up the goal "is_measure ?f" of the appropriate
5418 type and generates all solutions by prolog-style backwards proof using
5421 This setup also deals with rules like
5423 "is_measure f ==> is_measure (list_size f)"
5425 which accommodates nested datatypes that recurse through lists.
5426 Similar rules are predeclared for products and option types.
5428 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
5432 - Definitions of overloaded constants on sets have to be replaced by
5433 definitions on => and bool.
5435 - Some definitions of overloaded operators on sets can now be proved
5436 using the definitions of the operators on => and bool. Therefore,
5437 the following theorems have been renamed:
5439 subset_def -> subset_eq
5440 psubset_def -> psubset_eq
5441 set_diff_def -> set_diff_eq
5442 Compl_def -> Compl_eq
5443 Sup_set_def -> Sup_set_eq
5444 Inf_set_def -> Inf_set_eq
5445 sup_set_def -> sup_set_eq
5446 inf_set_def -> inf_set_eq
5448 - Due to the incompleteness of the HO unification algorithm, some
5449 rules such as subst may require manual instantiation, if some of
5450 the unknowns in the rule is a set.
5452 - Higher order unification and forward proofs:
5455 have "P (S::'a set)" <...>
5456 then have "EX S. P S" ..
5458 no longer works (due to the incompleteness of the HO unification
5459 algorithm) and must be replaced by the pattern
5466 - Calculational reasoning with subst (or similar rules):
5469 have "P (S::'a set)" <...>
5470 also have "S = T" <...>
5471 finally have "P T" .
5473 no longer works (for similar reasons as the previous example) and
5474 must be replaced by something like
5476 have "P (S::'a set)" <...>
5477 moreover have "S = T" <...>
5478 ultimately have "P T" by simp
5480 - Tactics or packages written in ML code:
5481 Code performing pattern matching on types via
5483 Type ("set", [T]) => ...
5485 must be rewritten. Moreover, functions like strip_type or
5486 binder_types no longer return the right value when applied to a
5489 T1 => ... => Tn => U => bool
5493 T1 => ... => Tn => U set
5495 * Merged theories Wellfounded_Recursion, Accessible_Part and
5496 Wellfounded_Relations to theory Wellfounded.
5498 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
5500 * Class finite no longer treats UNIV as class parameter. Use class
5501 enum from theory Library/Enum instead to achieve a similar effect.
5504 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
5505 and "Cons". INCOMPATIBILITY.
5507 * HOL (and FOL): renamed variables in rules imp_elim and swap.
5508 Potential INCOMPATIBILITY.
5510 * Theory Product_Type: duplicated lemmas split_Pair_apply and
5511 injective_fst_snd removed, use split_eta and prod_eqI instead.
5512 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
5514 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
5515 the same name in theory Orderings:
5525 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
5526 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
5527 and different variable names.
5529 * Library/Option_ord.thy: Canonical order on option type.
5531 * Library/RBT.thy: Red-black trees, an efficient implementation of
5534 * Library/Countable.thy: Type class for countable types.
5536 * Theory Int: The representation of numerals has changed. The infix
5537 operator BIT and the bit datatype with constructors B0 and B1 have
5538 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
5539 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
5540 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
5543 * Theory Nat: definition of <= and < on natural numbers no longer
5544 depend on well-founded relations. INCOMPATIBILITY. Definitions
5545 le_def and less_def have disappeared. Consider lemmas not_less
5546 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
5548 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
5549 (whose purpose mainly is for various fold_set functionals) have been
5550 abandoned in favor of the existing algebraic classes
5551 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
5552 lower_semilattice (resp. upper_semilattice) and linorder.
5555 * Theory Transitive_Closure: induct and cases rules now declare proper
5556 case_names ("base" and "step"). INCOMPATIBILITY.
5558 * Theorem Inductive.lfp_ordinal_induct generalized to complete
5559 lattices. The form set-specific version is available as
5560 Inductive.lfp_ordinal_induct_set.
5562 * Renamed theorems "power.simps" to "power_int.simps".
5565 * Class semiring_div provides basic abstract properties of semirings
5566 with division and modulo operations. Subsumes former class dvd_mod.
5568 * Merged theories IntDef, Numeral and IntArith into unified theory
5569 Int. INCOMPATIBILITY.
5571 * Theory Library/Code_Index: type "index" now represents natural
5572 numbers rather than integers. INCOMPATIBILITY.
5574 * New class "uminus" with operation "uminus" (split of from class
5575 "minus" which now only has operation "minus", binary).
5578 * Constants "card", "internal_split", "option_map" now with authentic
5579 syntax. INCOMPATIBILITY.
5581 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
5582 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
5583 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
5584 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
5585 Sup_set_def, le_def, less_def, option_map_def now with object
5586 equality. INCOMPATIBILITY.
5588 * Records. Removed K_record, and replaced it by pure lambda term
5589 %x. c. The simplifier setup is now more robust against eta expansion.
5590 INCOMPATIBILITY: in cases explicitly referring to K_record.
5592 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
5594 * Library/ListVector: new theory of arithmetic vector operations.
5596 * Library/Order_Relation: new theory of various orderings as sets of
5597 pairs. Defines preorders, partial orders, linear orders and
5598 well-orders on sets and on types.
5603 * Renamed some theories to allow to loading both ZF and HOL in the
5606 Datatype -> Datatype_ZF
5607 Inductive -> Inductive_ZF
5614 INCOMPATIBILITY: ZF theories that import individual theories below
5615 Main might need to be adapted. Regular theory Main is still
5616 available, as trivial extension of Main_ZF.
5621 * ML within Isar: antiquotation @{const name} or @{const
5622 name(typargs)} produces statically-checked Const term.
5624 * Functor NamedThmsFun: data is available to the user as dynamic fact
5625 (of the same name). Removed obsolete print command.
5627 * Removed obsolete "use_legacy_bindings" function.
5629 * The ``print mode'' is now a thread-local value derived from a global
5630 template (the former print_mode reference), thus access becomes
5631 non-critical. The global print_mode reference is for session
5632 management only; user-code should use print_mode_value,
5633 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
5635 * Functions system/system_out provide a robust way to invoke external
5636 shell commands, with propagation of interrupts (requires Poly/ML
5637 5.2.1). Do not use OS.Process.system etc. from the basis library!
5642 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
5643 in accordance with Proof General 3.7, which prefers GNU emacs.
5645 * isatool tty runs Isabelle process with plain tty interaction;
5646 optional line editor may be specified via ISABELLE_LINE_EDITOR
5647 setting, the default settings attempt to locate "ledit" and "rlwrap".
5649 * isatool browser now works with Cygwin as well, using general
5650 "javapath" function defined in Isabelle process environment.
5652 * YXML notation provides a simple and efficient alternative to
5653 standard XML transfer syntax. See src/Pure/General/yxml.ML and
5654 isatool yxml as described in the Isabelle system manual.
5656 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
5657 provides general wrapper for managing an Isabelle process in a robust
5658 fashion, with ``cooked'' output from stdin/stderr.
5660 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
5661 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
5663 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
5664 way of changing the user's settings is via
5665 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
5668 * Multithreading.max_threads := 0 refers to the number of actual CPU
5669 cores of the underlying machine, which is a good starting point for
5670 optimal performance tuning. The corresponding usedir option -M allows
5671 "max" as an alias for "0". WARNING: does not work on certain versions
5672 of Mac OS (with Poly/ML 5.1).
5674 * isabelle-process: non-ML sessions are run with "nice", to reduce the
5675 adverse effect of Isabelle flooding interactive front-ends (notably
5676 ProofGeneral / XEmacs).
5680 New in Isabelle2007 (November 2007)
5681 -----------------------------------
5685 * More uniform information about legacy features, notably a
5686 warning/error of "Legacy feature: ...", depending on the state of the
5687 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
5688 legacy features will disappear eventually.
5690 * Theory syntax: the header format ``theory A = B + C:'' has been
5691 discontinued in favour of ``theory A imports B C begin''. Use isatool
5692 fixheaders to convert existing theory files. INCOMPATIBILITY.
5694 * Theory syntax: the old non-Isar theory file format has been
5695 discontinued altogether. Note that ML proof scripts may still be used
5696 with Isar theories; migration is usually quite simple with the ML
5697 function use_legacy_bindings. INCOMPATIBILITY.
5699 * Theory syntax: some popular names (e.g. 'class', 'declaration',
5700 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
5703 * Theory loader: be more serious about observing the static theory
5704 header specifications (including optional directories), but not the
5705 accidental file locations of previously successful loads. The strict
5706 update policy of former update_thy is now already performed by
5707 use_thy, so the former has been removed; use_thys updates several
5708 theories simultaneously, just as 'imports' within a theory header
5709 specification, but without merging the results. Potential
5710 INCOMPATIBILITY: may need to refine theory headers and commands
5711 ROOT.ML which depend on load order.
5713 * Theory loader: optional support for content-based file
5714 identification, instead of the traditional scheme of full physical
5715 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
5716 (cf. the system manual). The new scheme allows to work with
5717 non-finished theories in persistent session images, such that source
5718 files may be moved later on without requiring reloads.
5720 * Theory loader: old-style ML proof scripts being *attached* to a thy
5721 file (with the same base name as the theory) are considered a legacy
5722 feature, which will disappear eventually. Even now, the theory loader
5723 no longer maintains dependencies on such files.
5725 * Syntax: the scope for resolving ambiguities via type-inference is
5726 now limited to individual terms, instead of whole simultaneous
5727 specifications as before. This greatly reduces the complexity of the
5728 syntax module and improves flexibility by separating parsing and
5729 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
5730 'fixes' etc.) are required in rare situations.
5732 * Syntax: constants introduced by new-style packages ('definition',
5733 'abbreviation' etc.) are passed through the syntax module in
5734 ``authentic mode''. This means that associated mixfix annotations
5735 really stick to such constants, independently of potential name space
5736 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
5737 trees are represented slightly differently, may need to adapt syntax
5738 translations accordingly. Use CONST marker in 'translations' and
5739 @{const_syntax} antiquotation in 'parse_translation' etc.
5741 * Legacy goal package: reduced interface to the bare minimum required
5742 to keep existing proof scripts running. Most other user-level
5743 functions are now part of the OldGoals structure, which is *not* open
5744 by default (consider isatool expandshort before open OldGoals).
5745 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
5746 these tend to cause confusion about the actual goal (!) context being
5747 used here, which is not necessarily the same as the_context().
5749 * Command 'find_theorems': supports "*" wild-card in "name:"
5750 criterion; "with_dups" option. Certain ProofGeneral versions might
5751 support a specific search form (see ProofGeneral/CHANGES).
5753 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
5754 by default, which means that "prems" (and also "fixed variables") are
5755 suppressed from proof state output. Note that the ProofGeneral
5756 settings mechanism allows to change and save options persistently, but
5757 older versions of Isabelle will fail to start up if a negative prems
5760 * Local theory targets may be specified by non-nested blocks of
5761 ``context/locale/class ... begin'' followed by ``end''. The body may
5762 contain definitions, theorems etc., including any derived mechanism
5763 that has been implemented on top of these primitives. This concept
5764 generalizes the existing ``theorem (in ...)'' towards more versatility
5767 * Proof General interface: proper undo of final 'end' command;
5768 discontinued Isabelle/classic mode (ML proof scripts).
5771 *** Document preparation ***
5773 * Added antiquotation @{theory name} which prints the given name,
5774 after checking that it refers to a valid ancestor theory in the
5777 * Added antiquotations @{ML_type text} and @{ML_struct text} which
5778 check the given source text as ML type/structure, printing verbatim.
5780 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
5781 "c args == rhs" given in the current context. (Any number of
5782 arguments may be given on the LHS.)
5787 * The 'class' package offers a combination of axclass and locale to
5788 achieve Haskell-like type classes in Isabelle. Definitions and
5789 theorems within a class context produce both relative results (with
5790 implicit parameters according to the locale context), and polymorphic
5791 constants with qualified polymorphism (according to the class
5792 context). Within the body context of a 'class' target, a separate
5793 syntax layer ("user space type system") takes care of converting
5794 between global polymorphic consts and internal locale representation.
5795 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
5796 "isatool doc classes" provides a tutorial.
5798 * Generic code generator framework allows to generate executable
5799 code for ML and Haskell (including Isabelle classes). A short usage
5802 internal compilation:
5803 export_code <list of constants (term syntax)> in SML
5804 writing SML code to a file:
5805 export_code <list of constants (term syntax)> in SML <filename>
5806 writing OCaml code to a file:
5807 export_code <list of constants (term syntax)> in OCaml <filename>
5808 writing Haskell code to a bunch of files:
5809 export_code <list of constants (term syntax)> in Haskell <filename>
5811 evaluating closed propositions to True/False using code generation:
5814 Reasonable default setup of framework in HOL.
5816 Theorem attributs for selecting and transforming function equations theorems:
5818 [code fun]: select a theorem as function equation for a specific constant
5819 [code fun del]: deselect a theorem as function equation for a specific constant
5820 [code inline]: select an equation theorem for unfolding (inlining) in place
5821 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
5823 User-defined serializations (target in {SML, OCaml, Haskell}):
5825 code_const <and-list of constants (term syntax)>
5826 {(target) <and-list of const target syntax>}+
5828 code_type <and-list of type constructors>
5829 {(target) <and-list of type target syntax>}+
5831 code_instance <and-list of instances>
5833 where instance ::= <type constructor> :: <class>
5835 code_class <and_list of classes>
5836 {(target) <and-list of class target syntax>}+
5837 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
5839 code_instance and code_class only are effective to target Haskell.
5841 For example usage see src/HOL/ex/Codegenerator.thy and
5842 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
5843 generation from Isabelle/HOL theories is available via "isatool doc
5846 * Code generator: consts in 'consts_code' Isar commands are now
5847 referred to by usual term syntax (including optional type
5850 * Command 'no_translations' removes translation rules from theory
5853 * Overloaded definitions are now actually checked for acyclic
5854 dependencies. The overloading scheme is slightly more general than
5855 that of Haskell98, although Isabelle does not demand an exact
5856 correspondence to type class and instance declarations.
5857 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
5858 exotic versions of overloading -- at the discretion of the user!
5860 Polymorphic constants are represented via type arguments, i.e. the
5861 instantiation that matches an instance against the most general
5862 declaration given in the signature. For example, with the declaration
5863 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
5864 as c(nat). Overloading is essentially simultaneous structural
5865 recursion over such type arguments. Incomplete specification patterns
5866 impose global constraints on all occurrences, e.g. c('a * 'a) on the
5867 LHS means that more general c('a * 'b) will be disallowed on any RHS.
5868 Command 'print_theory' outputs the normalized system of recursive
5869 equations, see section "definitions".
5871 * Configuration options are maintained within the theory or proof
5872 context (with name and type bool/int/string), providing a very simple
5873 interface to a poor-man's version of general context data. Tools may
5874 declare options in ML (e.g. using Attrib.config_int) and then refer to
5875 these values using Config.get etc. Users may change options via an
5876 associated attribute of the same name. This form of context
5877 declaration works particularly well with commands 'declare' or
5878 'using', for example ``declare [[foo = 42]]''. Thus it has become
5879 very easy to avoid global references, which would not observe Isar
5880 toplevel undo/redo and fail to work with multithreading.
5882 Various global ML references of Pure and HOL have been turned into
5883 configuration options:
5885 Unify.search_bound unify_search_bound
5886 Unify.trace_bound unify_trace_bound
5887 Unify.trace_simp unify_trace_simp
5888 Unify.trace_types unify_trace_types
5889 Simplifier.simp_depth_limit simp_depth_limit
5890 Blast.depth_limit blast_depth_limit
5891 DatatypeProp.dtK datatype_distinctness_limit
5892 fast_arith_neq_limit fast_arith_neq_limit
5893 fast_arith_split_limit fast_arith_split_limit
5895 * Named collections of theorems may be easily installed as context
5896 data using the functor NamedThmsFun (see also
5897 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
5898 attributes; there is also a toplevel print command. This facility is
5899 just a common case of general context data, which is the preferred way
5900 for anything more complex than just a list of facts in canonical
5903 * Isar: command 'declaration' augments a local theory by generic
5904 declaration functions written in ML. This enables arbitrary content
5905 being added to the context, depending on a morphism that tells the
5906 difference of the original declaration context wrt. the application
5907 context encountered later on.
5909 * Isar: proper interfaces for simplification procedures. Command
5910 'simproc_setup' declares named simprocs (with match patterns, and body
5911 text in ML). Attribute "simproc" adds/deletes simprocs in the current
5912 context. ML antiquotation @{simproc name} retrieves named simprocs.
5914 * Isar: an extra pair of brackets around attribute declarations
5915 abbreviates a theorem reference involving an internal dummy fact,
5916 which will be ignored later --- only the effect of the attribute on
5917 the background context will persist. This form of in-place
5918 declarations is particularly useful with commands like 'declare' and
5919 'using', for example ``have A using [[simproc a]] by simp''.
5921 * Isar: method "assumption" (and implicit closing of subproofs) now
5922 takes simple non-atomic goal assumptions into account: after applying
5923 an assumption as a rule the resulting subgoals are solved by atomic
5924 assumption steps. This is particularly useful to finish 'obtain'
5925 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
5926 without referring to the original premise "!!x. P x ==> thesis" in the
5927 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
5930 * Isar: implicit use of prems from the Isar proof context is
5931 considered a legacy feature. Common applications like ``have A .''
5932 may be replaced by ``have A by fact'' or ``note `A`''. In general,
5933 referencing facts explicitly here improves readability and
5934 maintainability of proof texts.
5936 * Isar: improper proof element 'guess' is like 'obtain', but derives
5937 the obtained context from the course of reasoning! For example:
5939 assume "EX x y. A x & B y" -- "any previous fact"
5940 then guess x and y by clarify
5942 This technique is potentially adventurous, depending on the facts and
5943 proof tools being involved here.
5945 * Isar: known facts from the proof context may be specified as literal
5946 propositions, using ASCII back-quote syntax. This works wherever
5947 named facts used to be allowed so far, in proof commands, proof
5948 methods, attributes etc. Literal facts are retrieved from the context
5949 according to unification of type and term parameters. For example,
5950 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
5951 theorems in the current context, then these are valid literal facts:
5952 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
5954 There is also a proof method "fact" which does the same composition
5955 for explicit goal states, e.g. the following proof texts coincide with
5956 certain special cases of literal facts:
5958 have "A" by fact == note `A`
5959 have "A ==> B" by fact == note `A ==> B`
5960 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
5961 have "P a ==> Q a" by fact == note `P a ==> Q a`
5963 * Isar: ":" (colon) is no longer a symbolic identifier character in
5964 outer syntax. Thus symbolic identifiers may be used without
5965 additional white space in declarations like this: ``assume *: A''.
5967 * Isar: 'print_facts' prints all local facts of the current context,
5968 both named and unnamed ones.
5970 * Isar: 'def' now admits simultaneous definitions, e.g.:
5972 def x == "t" and y == "u"
5974 * Isar: added command 'unfolding', which is structurally similar to
5975 'using', but affects both the goal state and facts by unfolding given
5976 rewrite rules. Thus many occurrences of the 'unfold' method or
5977 'unfolded' attribute may be replaced by first-class proof text.
5979 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
5980 and command 'unfolding' now all support object-level equalities
5981 (potentially conditional). The underlying notion of rewrite rule is
5982 analogous to the 'rule_format' attribute, but *not* that of the
5983 Simplifier (which is usually more generous).
5985 * Isar: the new attribute [rotated n] (default n = 1) rotates the
5986 premises of a theorem by n. Useful in conjunction with drule.
5988 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
5989 method expression within a sandbox consisting of the first N
5990 sub-goals, which need to exist. For example, ``simp_all [3]''
5991 simplifies the first three sub-goals, while (rule foo, simp_all)[]
5992 simplifies all new goals that emerge from applying rule foo to the
5993 originally first one.
5995 * Isar: schematic goals are no longer restricted to higher-order
5996 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
5999 * Isar: the conclusion of a long theorem statement is now either
6000 'shows' (a simultaneous conjunction, as before), or 'obtains'
6001 (essentially a disjunction of cases with local parameters and
6002 assumptions). The latter allows to express general elimination rules
6003 adequately; in this notation common elimination rules look like this:
6005 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
6007 obtains x where "P x"
6009 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
6013 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
6019 The subsequent classical rules even refer to the formal "thesis"
6022 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
6025 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
6026 obtains "thesis ==> something"
6028 The actual proof of an 'obtains' statement is analogous to that of the
6029 Isar proof element 'obtain', only that there may be several cases.
6030 Optional case names may be specified in parentheses; these will be
6031 available both in the present proof and as annotations in the
6032 resulting rule, for later use with the 'cases' method (cf. attribute
6035 * Isar: the assumptions of a long theorem statement are available as
6036 "assms" fact in the proof context. This is more appropriate than the
6037 (historical) "prems", which refers to all assumptions of the current
6038 context, including those from the target locale, proof body etc.
6040 * Isar: 'print_statement' prints theorems from the current theory or
6041 proof context in long statement form, according to the syntax of a
6044 * Isar: 'obtain' takes an optional case name for the local context
6045 introduction rule (default "that").
6047 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
6048 explicit (is "_ ==> ?foo") in the rare cases where this still happens
6051 * Pure: syntax "CONST name" produces a fully internalized constant
6052 according to the current context. This is particularly useful for
6053 syntax translations that should refer to internal constant
6054 representations independently of name spaces.
6056 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
6057 instead of "FOO ". This allows multiple binder declarations to coexist
6058 in the same context. INCOMPATIBILITY.
6060 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
6061 primitive that also works in a locale context (both for constants and
6062 fixed variables). Type declaration and internal syntactic representation
6063 of given constants retrieved from the context. Likewise, the
6064 'no_notation' command allows to remove given syntax annotations from the
6067 * Isar/locales: new derived specification elements 'axiomatization',
6068 'definition', 'abbreviation', which support type-inference, admit
6069 object-level specifications (equality, equivalence). See also the
6070 isar-ref manual. Examples:
6073 eq (infix "===" 50) where
6074 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
6076 definition "f x y = x + y + 1"
6077 definition g where "g x = f x x"
6080 neq (infix "=!=" 50) where
6081 "x =!= y == ~ (x === y)"
6083 These specifications may be also used in a locale context. Then the
6084 constants being introduced depend on certain fixed parameters, and the
6085 constant name is qualified by the locale base name. An internal
6086 abbreviation takes care for convenient input and output, making the
6087 parameters implicit and using the original short name. See also
6088 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
6089 entities from a monomorphic theory.
6091 Presently, abbreviations are only available 'in' a target locale, but
6092 not inherited by general import expressions. Also note that
6093 'abbreviation' may be used as a type-safe replacement for 'syntax' +
6094 'translations' in common applications. The "no_abbrevs" print mode
6095 prevents folding of abbreviations in term output.
6097 Concrete syntax is attached to specified constants in internal form,
6098 independently of name spaces. The parse tree representation is
6099 slightly different -- use 'notation' instead of raw 'syntax', and
6100 'translations' with explicit "CONST" markup to accommodate this.
6102 * Pure/Isar: unified syntax for new-style specification mechanisms
6103 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
6104 full type inference and dummy patterns ("_"). For example:
6106 definition "K x _ = x"
6108 inductive conj for A B
6109 where "A ==> B ==> conj A B"
6111 * Pure: command 'print_abbrevs' prints all constant abbreviations of
6112 the current context. Print mode "no_abbrevs" prevents inversion of
6113 abbreviations on output.
6115 * Isar/locales: improved parameter handling: use of locales "var" and
6116 "struct" no longer necessary; - parameter renamings are no longer
6117 required to be injective. For example, this allows to define
6118 endomorphisms as locale endom = homom mult mult h.
6120 * Isar/locales: changed the way locales with predicates are defined.
6121 Instead of accumulating the specification, the imported expression is
6122 now an interpretation. INCOMPATIBILITY: different normal form of
6123 locale expressions. In particular, in interpretations of locales with
6124 predicates, goals repesenting already interpreted fragments are not
6125 removed automatically. Use methods `intro_locales' and
6126 `unfold_locales'; see below.
6128 * Isar/locales: new methods `intro_locales' and `unfold_locales'
6129 provide backward reasoning on locales predicates. The methods are
6130 aware of interpretations and discharge corresponding goals.
6131 `intro_locales' is less aggressive then `unfold_locales' and does not
6132 unfold predicates to assumptions.
6134 * Isar/locales: the order in which locale fragments are accumulated
6135 has changed. This enables to override declarations from fragments due
6136 to interpretations -- for example, unwanted simp rules.
6138 * Isar/locales: interpretation in theories and proof contexts has been
6139 extended. One may now specify (and prove) equations, which are
6140 unfolded in interpreted theorems. This is useful for replacing
6141 defined concepts (constants depending on locale parameters) by
6142 concepts already existing in the target context. Example:
6144 interpretation partial_order ["op <= :: [int, int] => bool"]
6145 where "partial_order.less (op <=) (x::int) y = (x < y)"
6147 Typically, the constant `partial_order.less' is created by a
6148 definition specification element in the context of locale
6151 * Method "induct": improved internal context management to support
6152 local fixes and defines on-the-fly. Thus explicit meta-level
6153 connectives !! and ==> are rarely required anymore in inductive goals
6154 (using object-logic connectives for this purpose has been long
6155 obsolete anyway). Common proof patterns are explained in
6156 src/HOL/Induct/Common_Patterns.thy, see also
6157 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
6160 * Method "induct": improved handling of simultaneous goals. Instead of
6161 introducing object-level conjunction, the statement is now split into
6162 several conclusions, while the corresponding symbolic cases are nested
6163 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
6164 see src/HOL/Induct/Common_Patterns.thy, for example.
6166 * Method "induct": mutual induction rules are now specified as a list
6167 of rule sharing the same induction cases. HOL packages usually provide
6168 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
6169 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
6170 mutual induction rules differently, i.e. like this:
6172 (induct rule: foo_bar.inducts)
6173 (induct set: foo bar)
6174 (induct pred: foo bar)
6175 (induct type: foo bar)
6177 The ML function ProjectRule.projections turns old-style rules into the
6180 * Method "coinduct": dual of induction, see
6181 src/HOL/Library/Coinductive_List.thy for various examples.
6183 * Method "cases", "induct", "coinduct": the ``(open)'' option is
6184 considered a legacy feature.
6186 * Attribute "symmetric" produces result with standardized schematic
6187 variables (index 0). Potential INCOMPATIBILITY.
6189 * Simplifier: by default the simplifier trace only shows top level
6190 rewrites now. That is, trace_simp_depth_limit is set to 1 by
6191 default. Thus there is less danger of being flooded by the trace. The
6192 trace indicates where parts have been suppressed.
6194 * Provers/classical: removed obsolete classical version of elim_format
6195 attribute; classical elim/dest rules are now treated uniformly when
6196 manipulating the claset.
6198 * Provers/classical: stricter checks to ensure that supplied intro,
6199 dest and elim rules are well-formed; dest and elim rules must have at
6202 * Provers/classical: attributes dest/elim/intro take an optional
6203 weight argument for the rule (just as the Pure versions). Weights are
6204 ignored by automated tools, but determine the search order of single
6207 * Syntax: input syntax now supports dummy variable binding "%_. b",
6208 where the body does not mention the bound variable. Note that dummy
6209 patterns implicitly depend on their context of bounds, which makes
6210 "{_. _}" match any set comprehension as expected. Potential
6211 INCOMPATIBILITY -- parse translations need to cope with syntactic
6212 constant "_idtdummy" in the binding position.
6214 * Syntax: removed obsolete syntactic constant "_K" and its associated
6215 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
6216 for example "A -> B" => "Pi A (%_. B)".
6218 * Pure: 'class_deps' command visualizes the subclass relation, using
6219 the graph browser tool.
6221 * Pure: 'print_theory' now suppresses certain internal declarations by
6222 default; use '!' option for full details.
6227 * Method "metis" proves goals by applying the Metis general-purpose
6228 resolution prover (see also http://gilith.com/software/metis/).
6229 Examples are in the directory MetisExamples. WARNING: the
6230 Isabelle/HOL-Metis integration does not yet work properly with
6233 * Command 'sledgehammer' invokes external automatic theorem provers as
6234 background processes. It generates calls to the "metis" method if
6235 successful. These can be pasted into the proof. Users do not have to
6236 wait for the automatic provers to return. WARNING: does not really
6237 work with multi-threading.
6239 * New "auto_quickcheck" feature tests outermost goal statements for
6240 potential counter-examples. Controlled by ML references
6241 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
6242 5000 milliseconds). Fails silently if statements is outside of
6243 executable fragment, or any other codgenerator problem occurs.
6245 * New constant "undefined" with axiom "undefined x = undefined".
6247 * Added class "HOL.eq", allowing for code generation with polymorphic
6250 * Some renaming of class constants due to canonical name prefixing in
6251 the new 'class' package:
6253 HOL.abs ~> HOL.abs_class.abs
6254 HOL.divide ~> HOL.divide_class.divide
6255 0 ~> HOL.zero_class.zero
6256 1 ~> HOL.one_class.one
6257 op + ~> HOL.plus_class.plus
6258 op - ~> HOL.minus_class.minus
6259 uminus ~> HOL.minus_class.uminus
6260 op * ~> HOL.times_class.times
6261 op < ~> HOL.ord_class.less
6262 op <= > HOL.ord_class.less_eq
6263 Nat.power ~> Power.power_class.power
6264 Nat.size ~> Nat.size_class.size
6265 Numeral.number_of ~> Numeral.number_class.number_of
6266 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
6267 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
6268 Orderings.min ~> Orderings.ord_class.min
6269 Orderings.max ~> Orderings.ord_class.max
6270 Divides.op div ~> Divides.div_class.div
6271 Divides.op mod ~> Divides.div_class.mod
6272 Divides.op dvd ~> Divides.div_class.dvd
6274 INCOMPATIBILITY. Adaptions may be required in the following cases:
6276 a) User-defined constants using any of the names "plus", "minus",
6277 "times", "less" or "less_eq". The standard syntax translations for
6278 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
6281 b) Variables named "plus", "minus", "times", "less", "less_eq"
6282 INCOMPATIBILITY: use more specific names.
6284 c) Permutative equations (e.g. "a + b = b + a")
6285 Since the change of names also changes the order of terms, permutative
6286 rewrite rules may get applied in a different order. Experience shows
6287 that this is rarely the case (only two adaptions in the whole Isabelle
6288 distribution). INCOMPATIBILITY: rewrite proofs
6290 d) ML code directly refering to constant names
6291 This in general only affects hand-written proof tactics, simprocs and
6292 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
6293 Consider using @{const_name} antiquotation.
6295 * New class "default" with associated constant "default".
6297 * Function "sgn" is now overloaded and available on int, real, complex
6298 (and other numeric types), using class "sgn". Two possible defs of
6299 sgn are given as equational assumptions in the classes sgn_if and
6300 sgn_div_norm; ordered_idom now also inherits from sgn_if.
6303 * Locale "partial_order" now unified with class "order" (cf. theory
6304 Orderings), added parameter "less". INCOMPATIBILITY.
6306 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
6307 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
6308 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
6310 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
6311 changed order of proof goals in instance proofs.
6313 * The transitivity reasoner for partial and linear orders is set up
6314 for classes "order" and "linorder". Instances of the reasoner are available
6315 in all contexts importing or interpreting the corresponding locales.
6316 Method "order" invokes the reasoner separately; the reasoner
6317 is also integrated with the Simplifier as a solver. Diagnostic
6318 command 'print_orders' shows the available instances of the reasoner
6319 in the current context.
6321 * Localized monotonicity predicate in theory "Orderings"; integrated
6322 lemmas max_of_mono and min_of_mono with this predicate.
6325 * Formulation of theorem "dense" changed slightly due to integration
6326 with new class dense_linear_order.
6328 * Uniform lattice theory development in HOL.
6330 constants "meet" and "join" now named "inf" and "sup"
6331 constant "Meet" now named "Inf"
6333 classes "meet_semilorder" and "join_semilorder" now named
6334 "lower_semilattice" and "upper_semilattice"
6335 class "lorder" now named "lattice"
6336 class "comp_lat" now named "complete_lattice"
6338 Instantiation of lattice classes allows explicit definitions
6339 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
6341 INCOMPATIBILITY. Theorem renames:
6343 meet_left_le ~> inf_le1
6344 meet_right_le ~> inf_le2
6345 join_left_le ~> sup_ge1
6346 join_right_le ~> sup_ge2
6347 meet_join_le ~> inf_sup_ord
6350 le_meet ~> le_inf_iff
6351 le_join ~> ge_sup_conv
6352 meet_idempotent ~> inf_idem
6353 join_idempotent ~> sup_idem
6354 meet_comm ~> inf_commute
6355 join_comm ~> sup_commute
6356 meet_leI1 ~> le_infI1
6357 meet_leI2 ~> le_infI2
6358 le_joinI1 ~> le_supI1
6359 le_joinI2 ~> le_supI2
6360 meet_assoc ~> inf_assoc
6361 join_assoc ~> sup_assoc
6362 meet_left_comm ~> inf_left_commute
6363 meet_left_idempotent ~> inf_left_idem
6364 join_left_comm ~> sup_left_commute
6365 join_left_idempotent ~> sup_left_idem
6368 le_def_meet ~> le_iff_inf
6369 le_def_join ~> le_iff_sup
6370 join_absorp2 ~> sup_absorb2
6371 join_absorp1 ~> sup_absorb1
6372 meet_absorp1 ~> inf_absorb1
6373 meet_absorp2 ~> inf_absorb2
6374 meet_join_absorp ~> inf_sup_absorb
6375 join_meet_absorp ~> sup_inf_absorb
6376 distrib_join_le ~> distrib_sup_le
6377 distrib_meet_le ~> distrib_inf_le
6379 add_meet_distrib_left ~> add_inf_distrib_left
6380 add_join_distrib_left ~> add_sup_distrib_left
6381 is_join_neg_meet ~> is_join_neg_inf
6382 is_meet_neg_join ~> is_meet_neg_sup
6383 add_meet_distrib_right ~> add_inf_distrib_right
6384 add_join_distrib_right ~> add_sup_distrib_right
6385 add_meet_join_distribs ~> add_sup_inf_distribs
6386 join_eq_neg_meet ~> sup_eq_neg_inf
6387 meet_eq_neg_join ~> inf_eq_neg_sup
6388 add_eq_meet_join ~> add_eq_inf_sup
6389 meet_0_imp_0 ~> inf_0_imp_0
6390 join_0_imp_0 ~> sup_0_imp_0
6391 meet_0_eq_0 ~> inf_0_eq_0
6392 join_0_eq_0 ~> sup_0_eq_0
6393 neg_meet_eq_join ~> neg_inf_eq_sup
6394 neg_join_eq_meet ~> neg_sup_eq_inf
6395 join_eq_if ~> sup_eq_if
6397 mono_meet ~> mono_inf
6398 mono_join ~> mono_sup
6399 meet_bool_eq ~> inf_bool_eq
6400 join_bool_eq ~> sup_bool_eq
6401 meet_fun_eq ~> inf_fun_eq
6402 join_fun_eq ~> sup_fun_eq
6403 meet_set_eq ~> inf_set_eq
6404 join_set_eq ~> sup_set_eq
6405 meet1_iff ~> inf1_iff
6406 meet2_iff ~> inf2_iff
6415 join1_iff ~> sup1_iff
6416 join2_iff ~> sup2_iff
6426 is_meet_Meet ~> is_meet_Inf
6427 Meet_bool_def ~> Inf_bool_def
6428 Meet_fun_def ~> Inf_fun_def
6429 Meet_greatest ~> Inf_greatest
6430 Meet_lower ~> Inf_lower
6431 Meet_set_def ~> Inf_set_def
6434 Sup_bool_eq ~> Sup_bool_def
6435 Sup_fun_eq ~> Sup_fun_def
6436 Sup_set_eq ~> Sup_set_def
6438 listsp_meetI ~> listsp_infI
6439 listsp_meet_eq ~> listsp_inf_eq
6444 * Added syntactic class "size"; overloaded constant "size" now has
6445 type "'a::size ==> bool"
6447 * Internal reorganisation of `size' of datatypes: size theorems
6448 "foo.size" are no longer subsumed by "foo.simps" (but are still
6449 simplification rules by default!); theorems "prod.size" now named
6452 * Class "div" now inherits from class "times" rather than "type".
6455 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
6456 Linorder etc. have disappeared; operations defined in terms of
6457 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
6459 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
6461 * HOL-Word: New extensive library and type for generic, fixed size
6462 machine words, with arithmetic, bit-wise, shifting and rotating
6463 operations, reflection into int, nat, and bool lists, automation for
6464 linear arithmetic (by automatic reflection into nat or int), including
6465 lemmas on overflow and monotonicity. Instantiated to all appropriate
6466 arithmetic type classes, supporting automatic simplification of
6467 numerals on all operations.
6469 * Library/Boolean_Algebra: locales for abstract boolean algebras.
6471 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
6473 * Code generator library theories:
6474 - Code_Integer represents HOL integers by big integer literals in target
6476 - Code_Char represents HOL characters by character literals in target
6478 - Code_Char_chr like Code_Char, but also offers treatment of character
6479 codes; includes Code_Integer.
6480 - Executable_Set allows to generate code for finite sets using lists.
6481 - Executable_Rat implements rational numbers as triples (sign, enumerator,
6483 - Executable_Real implements a subset of real numbers, namly those
6484 representable by rational numbers.
6485 - Efficient_Nat implements natural numbers by integers, which in general will
6486 result in higher efficency; pattern matching with 0/Suc is eliminated;
6487 includes Code_Integer.
6488 - Code_Index provides an additional datatype index which is mapped to
6489 target-language built-in integers.
6490 - Code_Message provides an additional datatype message_string which is isomorphic to
6491 strings; messages are mapped to target-language strings.
6493 * New package for inductive predicates
6495 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
6498 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
6499 for z_1 :: U_1 and ... and z_n :: U_m
6501 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
6504 with full support for type-inference, rather than
6506 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
6508 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
6509 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
6511 inductive "s z_1 ... z_m"
6513 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
6516 For backward compatibility, there is a wrapper allowing inductive
6517 sets to be defined with the new package via
6520 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
6521 for z_1 :: U_1 and ... and z_n :: U_m
6523 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
6529 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
6530 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
6531 for z_1 :: U_1 and ... and z_n :: U_m
6533 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
6534 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
6537 if the additional syntax "p ..." is required.
6539 Numerous examples can be found in the subdirectories src/HOL/Auth,
6540 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
6544 - Since declaration and definition of inductive sets or predicates
6545 is no longer separated, abbreviations involving the newly
6546 introduced sets or predicates must be specified together with the
6547 introduction rules after the 'where' keyword (see above), rather
6548 than before the actual inductive definition.
6550 - The variables in induction and elimination rules are now
6551 quantified in the order of their occurrence in the introduction
6552 rules, rather than in alphabetical order. Since this may break
6553 some proofs, these proofs either have to be repaired, e.g. by
6554 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
6555 statements of the form
6557 case (rule_i a_i_1 ... a_i_{k_i})
6559 or the old order of quantification has to be restored by explicitly adding
6560 meta-level quantifiers in the introduction rules, i.e.
6562 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
6564 - The format of the elimination rules is now
6566 p z_1 ... z_m x_1 ... x_n ==>
6567 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
6572 (x_1, ..., x_n) : s z_1 ... z_m ==>
6573 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
6576 for sets rather than
6578 x : s z_1 ... z_m ==>
6579 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
6582 This may require terms in goals to be expanded to n-tuples
6583 (e.g. using case_tac or simplification with the split_paired_all
6584 rule) before the above elimination rule is applicable.
6586 - The elimination or case analysis rules for (mutually) inductive
6587 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
6588 list of rules "p_1_..._p_k.elims" is no longer available.
6590 * New package "function"/"fun" for general recursive functions,
6591 supporting mutual and nested recursion, definitions in local contexts,
6592 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
6593 for small examples, and the separate tutorial on the function
6594 package. The old recdef "package" is still available as before, but
6595 users are encouraged to use the new package.
6597 * Method "lexicographic_order" automatically synthesizes termination
6598 relations as lexicographic combinations of size measures.
6600 * Case-expressions allow arbitrary constructor-patterns (including
6601 "_") and take their order into account, like in functional
6602 programming. Internally, this is translated into nested
6603 case-expressions; missing cases are added and mapped to the predefined
6604 constant "undefined". In complicated cases printing may no longer show
6605 the original input but the internal form. Lambda-abstractions allow
6606 the same form of pattern matching: "% pat1 => e1 | ..." is an
6607 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
6610 * IntDef: The constant "int :: nat => int" has been removed; now "int"
6611 is an abbreviation for "of_nat :: nat => int". The simplification
6612 rules for "of_nat" have been changed to work like "int" did
6613 previously. Potential INCOMPATIBILITY:
6614 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
6615 - of_nat_diff and of_nat_mult are no longer default simp rules
6617 * Method "algebra" solves polynomial equations over (semi)rings using
6618 Groebner bases. The (semi)ring structure is defined by locales and the
6619 tool setup depends on that generic context. Installing the method for
6620 a specific type involves instantiating the locale and possibly adding
6621 declarations for computation on the coefficients. The method is
6622 already instantiated for natural numbers and for the axiomatic class
6623 of idoms with numerals. See also the paper by Chaieb and Wenzel at
6624 CALCULEMUS 2007 for the general principles underlying this
6625 architecture of context-aware proof-tools.
6627 * Method "ferrack" implements quantifier elimination over
6628 special-purpose dense linear orders using locales (analogous to
6629 "algebra"). The method is already installed for class
6630 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
6633 * Former constant "List.op @" now named "List.append". Use ML
6634 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
6635 circumvent possible incompatibilities when working on ML level.
6637 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
6639 * New function listsum :: 'a list => 'a for arbitrary monoids.
6640 Special syntax: "SUM x <- xs. f x" (and latex variants)
6642 * New syntax for Haskell-like list comprehension (input only), eg.
6643 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
6645 * The special syntax for function "filter" has changed from [x :
6646 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
6647 comprehension syntax, and for uniformity. INCOMPATIBILITY.
6649 * [a..b] is now defined for arbitrary linear orders. It used to be
6650 defined on nat only, as an abbreviation for [a..<Suc b]
6653 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
6655 * New functions "sorted" and "sort" in src/HOL/List.thy.
6657 * New lemma collection field_simps (an extension of ring_simps) for
6658 manipulating (in)equations involving division. Multiplies with all
6659 denominators that can be proved to be non-zero (in equations) or
6660 positive/negative (in inequations).
6662 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
6663 have been improved and renamed to ring_simps, group_simps and
6664 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
6665 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
6667 * Theory Library/Commutative_Ring: switched from recdef to function
6668 package; constants add, mul, pow now curried. Infix syntax for
6669 algebraic operations.
6671 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
6674 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
6677 * HOL/records: generalised field-update to take a function on the
6678 field rather than the new value: r(|A := x|) is translated to A_update
6679 (K x) r The K-combinator that is internally used is called K_record.
6680 INCOMPATIBILITY: Usage of the plain update functions has to be
6683 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
6684 * x = 0, which are required for a semiring. Richer structures do not
6685 inherit from semiring_0 anymore, because this property is a theorem
6686 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
6687 there is more to prove, but this is mostly trivial.
6689 * Class "recpower" is generalized to arbitrary monoids, not just
6690 commutative semirings. INCOMPATIBILITY: may need to incorporate
6691 commutativity or semiring properties additionally.
6693 * Constant "List.list_all2" in List.thy now uses authentic syntax.
6694 INCOMPATIBILITY: translations containing list_all2 may go wrong,
6695 better use 'abbreviation'.
6697 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
6699 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
6700 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
6701 significant changes for setting up numeral syntax for types:
6702 - New constants Numeral.pred and Numeral.succ instead
6703 of former Numeral.bin_pred and Numeral.bin_succ.
6704 - Use integer operations instead of bin_add, bin_mult and so on.
6705 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
6706 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
6708 See src/HOL/Integ/IntArith.thy for an example setup.
6710 * Command 'normal_form' computes the normal form of a term that may
6711 contain free variables. For example ``normal_form "rev [a, b, c]"''
6712 produces ``[b, c, a]'' (without proof). This command is suitable for
6713 heavy-duty computations because the functions are compiled to ML
6714 first. Correspondingly, a method "normalization" is provided. See
6715 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
6717 * Alternative iff syntax "A <-> B" for equality on bool (with priority
6718 25 like -->); output depends on the "iff" print_mode, the default is
6719 "A = B" (with priority 50).
6721 * Relations less (<) and less_eq (<=) are also available on type bool.
6722 Modified syntax to disallow nesting without explicit parentheses,
6723 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
6726 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
6728 * Relation composition operator "op O" now has precedence 75 and binds
6729 stronger than union and intersection. INCOMPATIBILITY.
6731 * The old set interval syntax "{m..n(}" (and relatives) has been
6732 removed. Use "{m..<n}" (and relatives) instead.
6734 * In the context of the assumption "~(s = t)" the Simplifier rewrites
6735 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
6736 ``declare [[simproc del: neq]]''.
6738 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
6741 * Theorem Cons_eq_map_conv no longer declared as "simp".
6743 * Theorem setsum_mult renamed to setsum_right_distrib.
6745 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
6748 * Reimplemented methods "sat" and "satx", with several improvements:
6749 goals no longer need to be stated as "<prems> ==> False", equivalences
6750 (i.e. "=" on type bool) are handled, variable names of the form
6751 "lit_<n>" are no longer reserved, significant speedup.
6753 * Methods "sat" and "satx" can now replay MiniSat proof traces.
6754 zChaff is still supported as well.
6756 * 'inductive' and 'datatype': provide projections of mutual rules,
6757 bundled as foo_bar.inducts;
6759 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
6762 * Library: moved theory Accessible_Part to main HOL.
6764 * Library: added theory Coinductive_List of potentially infinite lists
6765 as greatest fixed-point.
6767 * Library: added theory AssocList which implements (finite) maps as
6770 * Method "evaluation" solves goals (i.e. a boolean expression)
6771 efficiently by compiling it to ML. The goal is "proved" (via an
6772 oracle) if it evaluates to True.
6774 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
6775 also when invoked by the simplifier. This results in the Simplifier
6776 being more powerful on arithmetic goals. INCOMPATIBILITY.
6777 Configuration option fast_arith_split_limit=0 recovers the old
6780 * Support for hex (0x20) and binary (0b1001) numerals.
6782 * New method: reify eqs (t), where eqs are equations for an
6783 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
6784 parameter, computes a term s::'b and a list xs::'a list and proves the
6785 theorem I xs s = t. This is also known as reification or quoting. The
6786 resulting theorem is applied to the subgoal to substitute t with I xs
6787 s. If t is omitted, the subgoal itself is reified.
6789 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
6790 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
6791 where f is supposed to be a computable function (in the sense of code
6792 generattion). The method uses reify to compute s and xs as above then
6793 applies corr_thm and uses normalization by evaluation to "prove" f s =
6794 r and finally gets the theorem t = r, which is again applied to the
6795 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
6797 * Reflection: Automatic reification now handels binding, an example is
6798 available in src/HOL/ex/ReflectionEx.thy
6800 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
6801 command 'statespace' that is similar to 'record', but introduces an
6802 abstract specification based on the locale infrastructure instead of
6803 HOL types. This leads to extra flexibility in composing state spaces,
6804 in particular multiple inheritance and renaming of components.
6809 * Hyperreal: Functions root and sqrt are now defined on negative real
6810 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
6811 Nonnegativity side conditions have been removed from many lemmas, so
6812 that more subgoals may now be solved by simplification; potential
6815 * Real: new type classes formalize real normed vector spaces and
6816 algebras, using new overloaded constants scaleR :: real => 'a => 'a
6817 and norm :: 'a => real.
6819 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
6820 reals into other types. The overloaded constant Reals :: 'a set is now
6821 defined as range of_real; potential INCOMPATIBILITY.
6823 * Real: proper support for ML code generation, including 'quickcheck'.
6824 Reals are implemented as arbitrary precision rationals.
6826 * Hyperreal: Several constants that previously worked only for the
6827 reals have been generalized, so they now work over arbitrary vector
6828 spaces. Type annotations may need to be added in some cases; potential
6831 Infinitesimal :: ('a::real_normed_vector) star set
6832 HFinite :: ('a::real_normed_vector) star set
6833 HInfinite :: ('a::real_normed_vector) star set
6834 approx :: ('a::real_normed_vector) star => 'a star => bool
6835 monad :: ('a::real_normed_vector) star => 'a star set
6836 galaxy :: ('a::real_normed_vector) star => 'a star set
6837 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
6838 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
6839 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
6840 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
6841 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
6842 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
6843 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
6844 sgn :: 'a::real_normed_vector => 'a
6845 exp :: 'a::{recpower,real_normed_field,banach} => 'a
6847 * Complex: Some complex-specific constants are now abbreviations for
6848 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
6849 hnorm. Other constants have been entirely removed in favor of the
6850 polymorphic versions (INCOMPATIBILITY):
6854 HInfinite <-- CInfinite
6855 Infinitesimal <-- CInfinitesimal
6858 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
6859 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
6860 (ns)deriv <-- (ns)cderiv
6865 * Formalisation of ideals and the quotient construction over rings.
6867 * Order and lattice theory no longer based on records.
6870 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
6871 greatest_closed. INCOMPATIBILITY.
6873 * Method algebra is now set up via an attribute. For examples see
6874 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
6875 of algebraic structures.
6877 * Renamed theory CRing to Ring.
6882 * Substantial, yet incomplete support for nominal datatypes (binding
6883 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
6884 src/HOL/Nominal/Examples. Prospective users should consult
6885 http://isabelle.in.tum.de/nominal/
6890 * ML basics: just one true type int, which coincides with IntInf.int
6893 * ML within Isar: antiquotations allow to embed statically-checked
6894 formal entities in the source, referring to the context available at
6895 compile-time. For example:
6897 ML {* @{sort "{zero,one}"} *}
6898 ML {* @{typ "'a => 'b"} *}
6899 ML {* @{term "%x. x"} *}
6900 ML {* @{prop "x == y"} *}
6901 ML {* @{ctyp "'a => 'b"} *}
6902 ML {* @{cterm "%x. x"} *}
6903 ML {* @{cprop "x == y"} *}
6904 ML {* @{thm asm_rl} *}
6905 ML {* @{thms asm_rl} *}
6906 ML {* @{type_name c} *}
6907 ML {* @{type_syntax c} *}
6908 ML {* @{const_name c} *}
6909 ML {* @{const_syntax c} *}
6912 ML {* @{theory Pure} *}
6913 ML {* @{theory_ref} *}
6914 ML {* @{theory_ref Pure} *}
6917 ML {* @{clasimpset} *}
6919 The same works for sources being ``used'' within an Isar context.
6921 * ML in Isar: improved error reporting; extra verbosity with
6922 ML_Context.trace enabled.
6924 * Pure/General/table.ML: the join operations now works via exceptions
6925 DUP/SAME instead of type option. This is simpler in simple cases, and
6926 admits slightly more efficient complex applications.
6928 * Pure: 'advanced' translation functions (parse_translation etc.) now
6929 use Context.generic instead of just theory.
6931 * Pure: datatype Context.generic joins theory/Proof.context and
6932 provides some facilities for code that works in either kind of
6933 context, notably GenericDataFun for uniform theory and proof data.
6935 * Pure: simplified internal attribute type, which is now always
6936 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
6937 local (Proof.context) attributes have been discontinued, while
6938 minimizing code duplication. Thm.rule_attribute and
6939 Thm.declaration_attribute build canonical attributes; see also structure
6940 Context for further operations on Context.generic, notably
6941 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
6942 declarations and definitions.
6944 * Context data interfaces (Theory/Proof/GenericDataFun): removed
6945 name/print, uninitialized data defaults to ad-hoc copy of empty value,
6946 init only required for impure data. INCOMPATIBILITY: empty really need
6947 to be empty (no dependencies on theory content!)
6949 * Pure/kernel: consts certification ignores sort constraints given in
6950 signature declarations. (This information is not relevant to the
6951 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
6952 potential INCOMPATIBILITY.
6954 * Pure: axiomatic type classes are now purely definitional, with
6955 explicit proofs of class axioms and super class relations performed
6956 internally. See Pure/axclass.ML for the main internal interfaces --
6957 notably AxClass.define_class supercedes AxClass.add_axclass, and
6958 AxClass.axiomatize_class/classrel/arity supersede
6959 Sign.add_classes/classrel/arities.
6961 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
6962 global/local versions on theory vs. Proof.context have been
6963 discontinued; Attrib.syntax and Method.syntax have been adapted
6964 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
6965 attributes, methods, etc.
6967 * Pure: several functions of signature "... -> theory -> theory * ..."
6968 have been reoriented to "... -> theory -> ... * theory" in order to
6969 allow natural usage in combination with the ||>, ||>>, |-> and
6970 fold_map combinators.
6972 * Pure: official theorem names (closed derivations) and additional
6973 comments (tags) are now strictly separate. Name hints -- which are
6974 maintained as tags -- may be attached any time without affecting the
6977 * Pure: primitive rule lift_rule now takes goal cterm instead of an
6978 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
6979 achieve the old behaviour.
6981 * Pure: the "Goal" constant is now called "prop", supporting a
6982 slightly more general idea of ``protecting'' meta-level rule
6985 * Pure: Logic.(un)varify only works in a global context, which is now
6986 enforced instead of silently assumed. INCOMPATIBILITY, may use
6987 Logic.legacy_(un)varify as temporary workaround.
6989 * Pure: structure Name provides scalable operations for generating
6990 internal variable names, notably Name.variants etc. This replaces
6991 some popular functions from term.ML:
6993 Term.variant -> Name.variant
6994 Term.variantlist -> Name.variant_list
6995 Term.invent_names -> Name.invent_list
6997 Note that low-level renaming rarely occurs in new code -- operations
6998 from structure Variable are used instead (see below).
7000 * Pure: structure Variable provides fundamental operations for proper
7001 treatment of fixed/schematic variables in a context. For example,
7002 Variable.import introduces fixes for schematics of given facts and
7003 Variable.export reverses the effect (up to renaming) -- this replaces
7004 various freeze_thaw operations.
7006 * Pure: structure Goal provides simple interfaces for
7007 init/conclude/finish and tactical prove operations (replacing former
7008 Tactic.prove). Goal.prove is the canonical way to prove results
7009 within a given context; Goal.prove_global is a degraded version for
7010 theory level goals, including a global Drule.standard. Note that
7011 OldGoals.prove_goalw_cterm has long been obsolete, since it is
7012 ill-behaved in a local proof context (e.g. with local fixes/assumes or
7013 in a locale context).
7015 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
7016 and type checking (Syntax.check_term etc.), with common combinations
7017 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
7018 which are considered legacy and await removal.
7020 * Pure/Syntax: generic interfaces for type unchecking
7021 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
7022 with common combinations (Syntax.pretty_term, Syntax.string_of_term
7023 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
7024 available for convenience, but refer to the very same operations using
7025 a mere theory instead of a full context.
7027 * Isar: simplified treatment of user-level errors, using exception
7028 ERROR of string uniformly. Function error now merely raises ERROR,
7029 without any side effect on output channels. The Isar toplevel takes
7030 care of proper display of ERROR exceptions. ML code may use plain
7031 handle/can/try; cat_error may be used to concatenate errors like this:
7033 ... handle ERROR msg => cat_error msg "..."
7035 Toplevel ML code (run directly or through the Isar toplevel) may be
7036 embedded into the Isar toplevel with exception display/debug like
7039 Isar.toplevel (fn () => ...)
7041 INCOMPATIBILITY, removed special transform_error facilities, removed
7042 obsolete variants of user-level exceptions (ERROR_MESSAGE,
7043 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
7044 -- use plain ERROR instead.
7046 * Isar: theory setup now has type (theory -> theory), instead of a
7047 list. INCOMPATIBILITY, may use #> to compose setup functions.
7049 * Isar: ML toplevel pretty printer for type Proof.context, subject to
7050 ProofContext.debug/verbose flags.
7052 * Isar: Toplevel.theory_to_proof admits transactions that modify the
7053 theory before entering a proof state. Transactions now always see a
7054 quasi-functional intermediate checkpoint, both in interactive and
7057 * Isar: simplified interfaces for outer syntax. Renamed
7058 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
7059 OuterSyntax.add_parsers -- this functionality is now included in
7060 OuterSyntax.command etc. INCOMPATIBILITY.
7062 * Simplifier: the simpset of a running simplification process now
7063 contains a proof context (cf. Simplifier.the_context), which is the
7064 very context that the initial simpset has been retrieved from (by
7065 simpset_of/local_simpset_of). Consequently, all plug-in components
7066 (solver, looper etc.) may depend on arbitrary proof data.
7068 * Simplifier.inherit_context inherits the proof context (plus the
7069 local bounds) of the current simplification process; any simproc
7070 etc. that calls the Simplifier recursively should do this! Removed
7071 former Simplifier.inherit_bounds, which is already included here --
7072 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
7073 specify an explicit context using Simplifier.context/theory_context.
7075 * Simplifier/Classical Reasoner: more abstract interfaces
7076 change_simpset/claset for modifying the simpset/claset reference of a
7077 theory; raw versions simpset/claset_ref etc. have been discontinued --
7080 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
7086 * settings: the default heap location within ISABELLE_HOME_USER now
7087 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
7088 Isabelle installations.
7090 * isabelle-process: option -S (secure mode) disables some critical
7091 operations, notably runtime compilation and evaluation of ML source
7094 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
7096 * Support for parallel execution, using native multicore support of
7097 Poly/ML 5.1. The theory loader exploits parallelism when processing
7098 independent theories, according to the given theory header
7099 specifications. The maximum number of worker threads is specified via
7100 usedir option -M or the "max-threads" setting in Proof General. A
7101 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
7102 to 6 on a 8-core machine. User-code needs to observe certain
7103 guidelines for thread-safe programming, see appendix A in the Isar
7104 Implementation manual.
7108 New in Isabelle2005 (October 2005)
7109 ----------------------------------
7113 * Theory headers: the new header syntax for Isar theories is
7116 imports <theory1> ... <theoryN>
7117 uses <file1> ... <fileM>
7120 where the 'uses' part is optional. The previous syntax
7122 theory <name> = <theory1> + ... + <theoryN>:
7124 will disappear in the next release. Use isatool fixheaders to convert
7125 existing theory files. Note that there is no change in ancient
7126 non-Isar theories now, but these will disappear soon.
7128 * Theory loader: parent theories can now also be referred to via
7129 relative and absolute paths.
7131 * Command 'find_theorems' searches for a list of criteria instead of a
7132 list of constants. Known criteria are: intro, elim, dest, name:string,
7133 simp:term, and any term. Criteria can be preceded by '-' to select
7134 theorems that do not match. Intro, elim, dest select theorems that
7135 match the current goal, name:s selects theorems whose fully qualified
7136 name contain s, and simp:term selects all simplification rules whose
7137 lhs match term. Any other term is interpreted as pattern and selects
7138 all theorems matching the pattern. Available in ProofGeneral under
7139 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
7141 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
7143 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
7144 matching the current goal as introduction rule and not having "HOL."
7145 in their name (i.e. not being defined in theory HOL).
7147 * Command 'thms_containing' has been discontinued in favour of
7148 'find_theorems'; INCOMPATIBILITY.
7150 * Communication with Proof General is now 8bit clean, which means that
7151 Unicode text in UTF-8 encoding may be used within theory texts (both
7152 formal and informal parts). Cf. option -U of the Isabelle Proof
7153 General interface. Here are some simple examples (cf. src/HOL/ex):
7155 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
7156 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
7158 * Improved efficiency of the Simplifier and, to a lesser degree, the
7159 Classical Reasoner. Typical big applications run around 2 times
7163 *** Document preparation ***
7165 * Commands 'display_drafts' and 'print_drafts' perform simple output
7166 of raw sources. Only those symbols that do not require additional
7167 LaTeX packages (depending on comments in isabellesym.sty) are
7168 displayed properly, everything else is left verbatim. isatool display
7169 and isatool print are used as front ends (these are subject to the
7170 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
7172 * Command tags control specific markup of certain regions of text,
7173 notably folding and hiding. Predefined tags include "theory" (for
7174 theory begin and end), "proof" for proof commands, and "ML" for
7175 commands involving ML code; the additional tags "visible" and
7176 "invisible" are unused by default. Users may give explicit tag
7177 specifications in the text, e.g. ''by %invisible (auto)''. The
7178 interpretation of tags is determined by the LaTeX job during document
7179 preparation: see option -V of isatool usedir, or options -n and -t of
7180 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
7183 Several document versions may be produced at the same time via isatool
7184 usedir (the generated index.html will link all of them). Typical
7185 specifications include ''-V document=theory,proof,ML'' to present
7186 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
7187 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
7188 these parts without any formal replacement text. The Isabelle site
7189 default settings produce ''document'' and ''outline'' versions as
7192 * Several new antiquotations:
7194 @{term_type term} prints a term with its type annotated;
7196 @{typeof term} prints the type of a term;
7198 @{const const} is the same as @{term const}, but checks that the
7199 argument is a known logical constant;
7201 @{term_style style term} and @{thm_style style thm} print a term or
7202 theorem applying a "style" to it
7206 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
7207 definitions, equations, inequations etc., 'concl' printing only the
7208 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
7209 to print the specified premise. TermStyle.add_style provides an ML
7210 interface for introducing further styles. See also the "LaTeX Sugar"
7211 document practical applications. The ML antiquotation prints
7212 type-checked ML expressions verbatim.
7214 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
7215 and 'text' support optional locale specification '(in loc)', which
7216 specifies the default context for interpreting antiquotations. For
7217 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
7219 * Option 'locale=NAME' of antiquotations specifies an alternative
7220 context interpreting the subsequent argument. For example: @{thm
7221 [locale=lattice] inf_assoc}.
7223 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
7226 * Proper output of antiquotations for theory commands involving a
7227 proof context (such as 'locale' or 'theorem (in loc) ...').
7229 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
7230 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
7232 * isatool usedir: new option -C (default true) controls whether option
7233 -D should include a copy of the original document directory; -C false
7234 prevents unwanted effects such as copying of administrative CVS data.
7239 * Considerably improved version of 'constdefs' command. Now performs
7240 automatic type-inference of declared constants; additional support for
7241 local structure declarations (cf. locales and HOL records), see also
7242 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
7243 sequential dependencies of definitions within a single 'constdefs'
7244 section; moreover, the declared name needs to be an identifier. If
7245 all fails, consider to fall back on 'consts' and 'defs' separately.
7247 * Improved indexed syntax and implicit structures. First of all,
7248 indexed syntax provides a notational device for subscripted
7249 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
7250 expressions. Secondly, in a local context with structure
7251 declarations, number indexes \<^sub>n or the empty index (default
7252 number 1) refer to a certain fixed variable implicitly; option
7253 show_structs controls printing of implicit structures. Typical
7254 applications of these concepts involve record types and locales.
7256 * New command 'no_syntax' removes grammar declarations (and
7257 translations) resulting from the given syntax specification, which is
7258 interpreted in the same manner as for the 'syntax' command.
7260 * 'Advanced' translation functions (parse_translation etc.) may depend
7261 on the signature of the theory context being presently used for
7262 parsing/printing, see also isar-ref manual.
7264 * Improved 'oracle' command provides a type-safe interface to turn an
7265 ML expression of type theory -> T -> term into a primitive rule of
7266 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
7267 is already included here); see also FOL/ex/IffExample.thy;
7270 * axclass: name space prefix for class "c" is now "c_class" (was "c"
7271 before); "cI" is no longer bound, use "c.intro" instead.
7272 INCOMPATIBILITY. This change avoids clashes of fact bindings for
7273 axclasses vs. locales.
7275 * Improved internal renaming of symbolic identifiers -- attach primes
7276 instead of base 26 numbers.
7278 * New flag show_question_marks controls printing of leading question
7279 marks in schematic variable names.
7281 * In schematic variable names, *any* symbol following \<^isub> or
7282 \<^isup> is now treated as part of the base name. For example, the
7283 following works without printing of awkward ".0" indexes:
7285 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
7288 * Inner syntax includes (*(*nested*) comments*).
7290 * Pretty printer now supports unbreakable blocks, specified in mixfix
7291 annotations as "(00...)".
7293 * Clear separation of logical types and nonterminals, where the latter
7294 may only occur in 'syntax' specifications or type abbreviations.
7295 Before that distinction was only partially implemented via type class
7296 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
7297 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
7298 exotic syntax specifications may require further adaption
7299 (e.g. Cube/Cube.thy).
7301 * Removed obsolete type class "logic", use the top sort {} instead.
7302 Note that non-logical types should be declared as 'nonterminals'
7303 rather than 'types'. INCOMPATIBILITY for new object-logic
7306 * Attributes 'induct' and 'cases': type or set names may now be
7307 locally fixed variables as well.
7309 * Simplifier: can now control the depth to which conditional rewriting
7310 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
7313 * Simplifier: simplification procedures may now take the current
7314 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
7315 interface), which is very useful for calling the Simplifier
7316 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
7317 is gone -- use prems_of_ss on the simpset instead. Moreover, the
7318 low-level mk_simproc no longer applies Logic.varify internally, to
7319 allow for use in a context of fixed variables.
7321 * thin_tac now works even if the assumption being deleted contains !!
7322 or ==>. More generally, erule now works even if the major premise of
7323 the elimination rule contains !! or ==>.
7325 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
7327 * Reorganized bootstrapping of the Pure theories; CPure is now derived
7328 from Pure, which contains all common declarations already. Both
7329 theories are defined via plain Isabelle/Isar .thy files.
7330 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
7331 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
7332 use isatool fixcpure to adapt your theory and ML sources.
7334 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
7335 selections of theorems in named facts via index ranges.
7337 * 'print_theorems': in theory mode, really print the difference
7338 wrt. the last state (works for interactive theory development only),
7339 in proof mode print all local facts (cf. 'print_facts');
7341 * 'hide': option '(open)' hides only base names.
7343 * More efficient treatment of intermediate checkpoints in interactive
7346 * Code generator is now invoked via code_module (incremental code
7347 generation) and code_library (modular code generation, ML structures
7348 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
7349 must be quoted when used as identifiers.
7351 * New 'value' command for reading, evaluating and printing terms using
7352 the code generator. INCOMPATIBILITY: command keyword 'value' must be
7353 quoted when used as identifier.
7358 * New commands for the interpretation of locale expressions in
7359 theories (1), locales (2) and proof contexts (3). These generate
7360 proof obligations from the expression specification. After the
7361 obligations have been discharged, theorems of the expression are added
7362 to the theory, target locale or proof context. The synopsis of the
7363 commands is a follows:
7365 (1) interpretation expr inst
7366 (2) interpretation target < expr
7367 (3) interpret expr inst
7369 Interpretation in theories and proof contexts require a parameter
7370 instantiation of terms from the current context. This is applied to
7371 specifications and theorems of the interpreted expression.
7372 Interpretation in locales only permits parameter renaming through the
7373 locale expression. Interpretation is smart in that interpretations
7374 that are active already do not occur in proof obligations, neither are
7375 instantiated theorems stored in duplicate. Use 'print_interps' to
7376 inspect active interpretations of a particular locale. For details,
7377 see the Isar Reference manual. Examples can be found in
7378 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
7380 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
7381 'interpret' instead.
7383 * New context element 'constrains' for adding type constraints to
7386 * Context expressions: renaming of parameters with syntax
7389 * Locale declaration: 'includes' disallowed.
7391 * Proper static binding of attribute syntax -- i.e. types / terms /
7392 facts mentioned as arguments are always those of the locale definition
7393 context, independently of the context of later invocations. Moreover,
7394 locale operations (renaming and type / term instantiation) are applied
7395 to attribute arguments as expected.
7397 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
7398 actual attributes; rare situations may require Attrib.attribute to
7399 embed those attributes into Attrib.src that lack concrete syntax.
7400 Attribute implementations need to cooperate properly with the static
7401 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
7402 Attrib.XXX_thm etc. already do the right thing without further
7403 intervention. Only unusual applications -- such as "where" or "of"
7404 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
7405 on the context and the facts involved -- may have to assign parsed
7406 values to argument tokens explicitly.
7408 * Changed parameter management in theorem generation for long goal
7409 statements with 'includes'. INCOMPATIBILITY: produces a different
7410 theorem statement in rare situations.
7412 * Locale inspection command 'print_locale' omits notes elements. Use
7413 'print_locale!' to have them included in the output.
7418 * Provers/hypsubst.ML: improved version of the subst method, for
7419 single-step rewriting: it now works in bound variable contexts. New is
7420 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
7421 rewrite a different subterm than the original subst method, which is
7422 still available as 'simplesubst'.
7424 * Provers/quasi.ML: new transitivity reasoners for transitivity only
7427 * Provers/trancl.ML: new transitivity reasoner for transitive and
7428 reflexive-transitive closure of relations.
7430 * Provers/blast.ML: new reference depth_limit to make blast's depth
7431 limit (previously hard-coded with a value of 20) user-definable.
7433 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
7434 is peformed already. Object-logics merely need to finish their
7435 initial simpset configuration as before. INCOMPATIBILITY.
7440 * Symbolic syntax of Hilbert Choice Operator is now as follows:
7443 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
7445 The symbol \<some> is displayed as the alternative epsilon of LaTeX
7446 and x-symbol; use option '-m epsilon' to get it actually printed.
7447 Moreover, the mathematically important symbolic identifier \<epsilon>
7448 becomes available as variable, constant etc. INCOMPATIBILITY,
7450 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
7451 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
7452 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
7453 support corresponding Isar calculations.
7455 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
7458 * theory SetInterval: changed the syntax for open intervals:
7467 The old syntax is still supported but will disappear in the next
7468 release. For conversion use the following Emacs search and replace
7469 patterns (these are not perfect but work quite well):
7471 {)\([^\.]*\)\.\. -> {\1<\.\.}
7472 \.\.\([^(}]*\)(} -> \.\.<\1}
7474 * Theory Commutative_Ring (in Library): method comm_ring for proving
7475 equalities in commutative rings; method 'algebra' provides a generic
7478 * Theory Finite_Set: changed the syntax for 'setsum', summation over
7479 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
7480 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
7483 Some new syntax forms are available:
7485 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
7486 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
7487 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
7488 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
7490 The latter form "\<Sum>x < k. e" used to be based on a separate
7491 function "Summation", which has been discontinued.
7493 * theory Finite_Set: in structured induction proofs, the insert case
7494 is now 'case (insert x F)' instead of the old counterintuitive 'case
7497 * The 'refute' command has been extended to support a much larger
7498 fragment of HOL, including axiomatic type classes, constdefs and
7499 typedefs, inductive datatypes and recursion.
7501 * New tactics 'sat' and 'satx' to prove propositional tautologies.
7502 Requires zChaff with proof generation to be installed. See
7503 HOL/ex/SAT_Examples.thy for examples.
7505 * Datatype induction via method 'induct' now preserves the name of the
7506 induction variable. For example, when proving P(xs::'a list) by
7507 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
7508 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
7509 in unstructured proof scripts.
7511 * Reworked implementation of records. Improved scalability for
7512 records with many fields, avoiding performance problems for type
7513 inference. Records are no longer composed of nested field types, but
7514 of nested extension types. Therefore the record type only grows linear
7515 in the number of extensions and not in the number of fields. The
7516 top-level (users) view on records is preserved. Potential
7517 INCOMPATIBILITY only in strange cases, where the theory depends on the
7518 old record representation. The type generated for a record is called
7519 <record_name>_ext_type.
7521 Flag record_quick_and_dirty_sensitive can be enabled to skip the
7522 proofs triggered by a record definition or a simproc (if
7523 quick_and_dirty is enabled). Definitions of large records can take
7526 New simproc record_upd_simproc for simplification of multiple record
7527 updates enabled by default. Moreover, trivial updates are also
7528 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
7529 occasionally, since simplification is more powerful by default.
7531 * typedef: proper support for polymorphic sets, which contain extra
7532 type-variables in the term.
7534 * Simplifier: automatically reasons about transitivity chains
7535 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
7536 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
7537 old proofs break occasionally as simplification may now solve more
7538 goals than previously.
7540 * Simplifier: converts x <= y into x = y if assumption y <= x is
7541 present. Works for all partial orders (class "order"), in particular
7542 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
7545 * Simplifier: new simproc for "let x = a in f x". If a is a free or
7546 bound variable or a constant then the let is unfolded. Otherwise
7547 first a is simplified to b, and then f b is simplified to g. If
7548 possible we abstract b from g arriving at "let x = b in h x",
7549 otherwise we unfold the let and arrive at g. The simproc can be
7550 enabled/disabled by the reference use_let_simproc. Potential
7551 INCOMPATIBILITY since simplification is more powerful by default.
7553 * Classical reasoning: the meson method now accepts theorems as arguments.
7555 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
7556 jobs to provide advice on the provability of subgoals.
7558 * Theory OrderedGroup and Ring_and_Field: various additions and
7559 improvements to faciliate calculations involving equalities and
7562 The following theorems have been eliminated or modified
7565 abs_eq now named abs_of_nonneg
7566 abs_of_ge_0 now named abs_of_nonneg
7567 abs_minus_eq now named abs_of_nonpos
7568 imp_abs_id now named abs_of_nonneg
7569 imp_abs_neg_id now named abs_of_nonpos
7570 mult_pos now named mult_pos_pos
7571 mult_pos_le now named mult_nonneg_nonneg
7572 mult_pos_neg_le now named mult_nonneg_nonpos
7573 mult_pos_neg2_le now named mult_nonneg_nonpos2
7574 mult_neg now named mult_neg_neg
7575 mult_neg_le now named mult_nonpos_nonpos
7577 * The following lemmas in Ring_and_Field have been added to the simplifier:
7580 not_square_less_zero
7582 The following lemmas have been deleted from Real/RealPow:
7592 * Theory Parity: added rules for simplifying exponents.
7596 The following theorems have been eliminated or modified
7599 list_all_Nil now named list_all.simps(1)
7600 list_all_Cons now named list_all.simps(2)
7601 list_all_conv now named list_all_iff
7602 set_mem_eq now named mem_iff
7604 * Theories SetsAndFunctions and BigO (see HOL/Library) support
7605 asymptotic "big O" calculations. See the notes in BigO.thy.
7610 * Theory RealDef: better support for embedding natural numbers and
7611 integers in the reals.
7613 The following theorems have been eliminated or modified
7616 exp_ge_add_one_self now requires no hypotheses
7617 real_of_int_add reversed direction of equality (use [symmetric])
7618 real_of_int_minus reversed direction of equality (use [symmetric])
7619 real_of_int_diff reversed direction of equality (use [symmetric])
7620 real_of_int_mult reversed direction of equality (use [symmetric])
7622 * Theory RComplete: expanded support for floor and ceiling functions.
7624 * Theory Ln is new, with properties of the natural logarithm
7626 * Hyperreal: There is a new type constructor "star" for making
7627 nonstandard types. The old type names are now type synonyms:
7631 hcomplex = complex star
7633 * Hyperreal: Many groups of similarly-defined constants have been
7634 replaced by polymorphic versions (INCOMPATIBILITY):
7636 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
7638 starset <-- starsetNat, starsetC
7639 *s* <-- *sNat*, *sc*
7640 starset_n <-- starsetNat_n, starsetC_n
7641 *sn* <-- *sNatn*, *scn*
7642 InternalSets <-- InternalNatSets, InternalCSets
7644 starfun <-- starfun{Nat,Nat2,C,RC,CR}
7645 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
7646 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
7647 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
7648 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
7650 * Hyperreal: Many type-specific theorems have been removed in favor of
7651 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
7653 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
7654 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
7655 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
7656 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
7657 right_minus <-- hypreal_add_minus
7658 left_minus <-- {hypreal,hcomplex}_add_minus_left
7659 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
7660 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
7661 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
7662 mult_1_right <-- hcomplex_mult_one_right
7663 mult_zero_left <-- hcomplex_mult_zero_left
7664 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
7665 right_distrib <-- hypnat_add_mult_distrib2
7666 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
7667 right_inverse <-- hypreal_mult_inverse
7668 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
7669 order_refl <-- {hypreal,hypnat}_le_refl
7670 order_trans <-- {hypreal,hypnat}_le_trans
7671 order_antisym <-- {hypreal,hypnat}_le_anti_sym
7672 order_less_le <-- {hypreal,hypnat}_less_le
7673 linorder_linear <-- {hypreal,hypnat}_le_linear
7674 add_left_mono <-- {hypreal,hypnat}_add_left_mono
7675 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
7676 add_nonneg_nonneg <-- hypreal_le_add_order
7678 * Hyperreal: Separate theorems having to do with type-specific
7679 versions of constants have been merged into theorems that apply to the
7680 new polymorphic constants (INCOMPATIBILITY):
7682 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
7683 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
7684 STAR_Un <-- {STAR,NatStar,STARC}_Un
7685 STAR_Int <-- {STAR,NatStar,STARC}_Int
7686 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
7687 STAR_subset <-- {STAR,NatStar,STARC}_subset
7688 STAR_mem <-- {STAR,NatStar,STARC}_mem
7689 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
7690 STAR_diff <-- {STAR,STARC}_diff
7691 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
7692 STARC_hcomplex_of_complex}_image_subset
7693 starset_n_Un <-- starset{Nat,C}_n_Un
7694 starset_n_Int <-- starset{Nat,C}_n_Int
7695 starset_n_Compl <-- starset{Nat,C}_n_Compl
7696 starset_n_diff <-- starset{Nat,C}_n_diff
7697 InternalSets_Un <-- Internal{Nat,C}Sets_Un
7698 InternalSets_Int <-- Internal{Nat,C}Sets_Int
7699 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
7700 InternalSets_diff <-- Internal{Nat,C}Sets_diff
7701 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
7702 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
7703 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
7704 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
7705 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
7706 starfun <-- starfun{Nat,Nat2,C,RC,CR}
7707 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
7708 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
7709 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
7710 starfun_diff <-- starfun{C,RC,CR}_diff
7711 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
7712 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
7713 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
7714 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
7715 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
7716 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
7717 starfun_Id <-- starfunC_Id
7718 starfun_approx <-- starfun{Nat,CR}_approx
7719 starfun_capprox <-- starfun{C,RC}_capprox
7720 starfun_abs <-- starfunNat_rabs
7721 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
7722 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
7723 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
7724 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
7725 starfun_add_capprox <-- starfun{C,RC}_add_capprox
7726 starfun_add_approx <-- starfunCR_add_approx
7727 starfun_inverse_inverse <-- starfunC_inverse_inverse
7728 starfun_divide <-- starfun{C,CR,RC}_divide
7729 starfun_n <-- starfun{Nat,C}_n
7730 starfun_n_mult <-- starfun{Nat,C}_n_mult
7731 starfun_n_add <-- starfun{Nat,C}_n_add
7732 starfun_n_add_minus <-- starfunNat_n_add_minus
7733 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
7734 starfun_n_minus <-- starfun{Nat,C}_n_minus
7735 starfun_n_eq <-- starfun{Nat,C}_n_eq
7737 star_n_add <-- {hypreal,hypnat,hcomplex}_add
7738 star_n_minus <-- {hypreal,hcomplex}_minus
7739 star_n_diff <-- {hypreal,hcomplex}_diff
7740 star_n_mult <-- {hypreal,hcomplex}_mult
7741 star_n_inverse <-- {hypreal,hcomplex}_inverse
7742 star_n_le <-- {hypreal,hypnat}_le
7743 star_n_less <-- {hypreal,hypnat}_less
7744 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
7745 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
7746 star_n_abs <-- hypreal_hrabs
7747 star_n_divide <-- hcomplex_divide
7749 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
7750 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
7751 star_of_diff <-- hypreal_of_real_diff
7752 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
7753 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
7754 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
7755 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
7756 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
7757 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
7758 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
7759 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
7760 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
7761 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
7762 star_of_number_of <-- {hypreal,hcomplex}_number_of
7763 star_of_number_less <-- number_of_less_hypreal_of_real_iff
7764 star_of_number_le <-- number_of_le_hypreal_of_real_iff
7765 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
7766 star_of_less_number <-- hypreal_of_real_less_number_of_iff
7767 star_of_le_number <-- hypreal_of_real_le_number_of_iff
7768 star_of_power <-- hypreal_of_real_power
7769 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
7771 * Hyperreal: new method "transfer" that implements the transfer
7772 principle of nonstandard analysis. With a subgoal that mentions
7773 nonstandard types like "'a star", the command "apply transfer"
7774 replaces it with an equivalent one that mentions only standard types.
7775 To be successful, all free variables must have standard types; non-
7776 standard variables must have explicit universal quantifiers.
7778 * Hyperreal: A theory of Taylor series.
7783 * Discontinued special version of 'constdefs' (which used to support
7784 continuous functions) in favor of the general Pure one with full
7787 * New simplification procedure for solving continuity conditions; it
7788 is much faster on terms with many nested lambda abstractions (cubic
7789 instead of exponential time).
7791 * New syntax for domain package: selector names are now optional.
7792 Parentheses should be omitted unless argument is lazy, for example:
7794 domain 'a stream = cons "'a" (lazy "'a stream")
7796 * New command 'fixrec' for defining recursive functions with pattern
7797 matching; defining multiple functions with mutual recursion is also
7798 supported. Patterns may include the constants cpair, spair, up, sinl,
7799 sinr, or any data constructor defined by the domain package. The given
7800 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
7801 syntax and examples.
7803 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
7804 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
7805 but the proof obligation additionally includes an admissibility
7806 requirement. The packages generate instances of class cpo or pcpo,
7807 with continuity and strictness theorems for Rep and Abs.
7809 * HOLCF: Many theorems have been renamed according to a more standard naming
7810 scheme (INCOMPATIBILITY):
7812 foo_inject: "foo$x = foo$y ==> x = y"
7813 foo_eq: "(foo$x = foo$y) = (x = y)"
7814 foo_less: "(foo$x << foo$y) = (x << y)"
7815 foo_strict: "foo$UU = UU"
7816 foo_defined: "... ==> foo$x ~= UU"
7817 foo_defined_iff: "(foo$x = UU) = (x = UU)"
7822 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
7823 including the First Isomorphism Theorem (on quotienting by the kernel
7826 * ZF/Simplifier: install second copy of type solver that actually
7827 makes use of TC rules declared to Isar proof contexts (or locales);
7828 the old version is still required for ML proof scripts.
7833 * Converted to Isar theory format; use locales instead of axiomatic
7839 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
7842 * Pure/library.ML no longer defines its own option datatype, but uses
7843 that of the SML basis, which has constructors NONE and SOME instead of
7844 None and Some, as well as exception Option.Option instead of OPTION.
7845 The functions the, if_none, is_some, is_none have been adapted
7846 accordingly, while Option.map replaces apsome.
7848 * Pure/library.ML: the exception LIST has been given up in favour of
7849 the standard exceptions Empty and Subscript, as well as
7850 Library.UnequalLengths. Function like Library.hd and Library.tl are
7851 superceded by the standard hd and tl functions etc.
7853 A number of basic list functions are no longer exported to the ML
7854 toplevel, as they are variants of predefined functions. The following
7855 suggests how one can translate existing code:
7857 rev_append xs ys = List.revAppend (xs, ys)
7858 nth_elem (i, xs) = List.nth (xs, i)
7859 last_elem xs = List.last xs
7860 flat xss = List.concat xss
7861 seq fs = List.app fs
7862 partition P xs = List.partition P xs
7863 mapfilter f xs = List.mapPartial f xs
7865 * Pure/library.ML: several combinators for linear functional
7866 transformations, notably reverse application and composition:
7869 (x, y) |-> f f #-> g
7871 * Pure/library.ML: introduced/changed precedence of infix operators:
7873 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
7875 infix 3 o oo ooo oooo;
7876 infix 4 ~~ upto downto;
7878 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
7881 * Pure/library.ML: natural list combinators fold, fold_rev, and
7882 fold_map support linear functional transformations and nesting. For
7885 fold f [x1, ..., xN] y =
7886 y |> f x1 |> ... |> f xN
7888 (fold o fold) f [xs1, ..., xsN] y =
7889 y |> fold f xs1 |> ... |> fold f xsN
7891 fold f [x1, ..., xN] =
7894 (fold o fold) f [xs1, ..., xsN] =
7895 fold f xs1 #> ... #> fold f xsN
7897 * Pure/library.ML: the following selectors on type 'a option are
7900 the: 'a option -> 'a (*partial*)
7901 these: 'a option -> 'a where 'a = 'b list
7902 the_default: 'a -> 'a option -> 'a
7903 the_list: 'a option -> 'a list
7905 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
7906 basic operations for association lists, following natural argument
7907 order; moreover the explicit equality predicate passed here avoids
7908 potentially expensive polymorphic runtime equality checks.
7909 The old functions may be expressed as follows:
7911 assoc = uncurry (AList.lookup (op =))
7912 assocs = these oo AList.lookup (op =)
7913 overwrite = uncurry (AList.update (op =)) o swap
7915 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
7917 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
7918 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
7920 replacing make_keylist and keyfilter (occassionally used)
7923 make_keylist = AList.make
7924 keyfilter = AList.find (op =)
7926 * eq_fst and eq_snd now take explicit equality parameter, thus
7927 avoiding eqtypes. Naive rewrites:
7929 eq_fst = eq_fst (op =)
7930 eq_snd = eq_snd (op =)
7932 * Removed deprecated apl and apr (rarely used).
7935 apl (n, op) =>>= curry op n
7936 apr (op, m) =>>= fn n => op (n, m)
7938 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
7939 provides a reasonably efficient light-weight implementation of sets as
7942 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
7943 few new operations; existing lookup and update are now curried to
7944 follow natural argument order (for use with fold etc.);
7945 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
7947 * Pure/General: output via the Isabelle channels of
7948 writeln/warning/error etc. is now passed through Output.output, with a
7949 hook for arbitrary transformations depending on the print_mode
7950 (cf. Output.add_mode -- the first active mode that provides a output
7951 function wins). Already formatted output may be embedded into further
7952 text via Output.raw; the result of Pretty.string_of/str_of and derived
7953 functions (string_of_term/cterm/thm etc.) is already marked raw to
7954 accommodate easy composition of diagnostic messages etc. Programmers
7955 rarely need to care about Output.output or Output.raw at all, with
7956 some notable exceptions: Output.output is required when bypassing the
7957 standard channels (writeln etc.), or in token translations to produce
7958 properly formatted results; Output.raw is required when capturing
7959 already output material that will eventually be presented to the user
7960 a second time. For the default print mode, both Output.output and
7961 Output.raw have no effect.
7963 * Pure/General: Output.time_accumulator NAME creates an operator ('a
7964 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
7965 cumulative results are displayed at the end of a batch session.
7967 * Pure/General: File.sysify_path and File.quote_sysify path have been
7968 replaced by File.platform_path and File.shell_path (with appropriate
7969 hooks). This provides a clean interface for unusual systems where the
7970 internal and external process view of file names are different.
7972 * Pure: more efficient orders for basic syntactic entities: added
7973 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
7974 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
7975 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
7976 orders now -- potential INCOMPATIBILITY for code that depends on a
7977 particular order for Symtab.keys, Symtab.dest, etc. (consider using
7978 Library.sort_strings on result).
7980 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
7981 fold_types traverse types/terms from left to right, observing natural
7982 argument order. Supercedes previous foldl_XXX versions, add_frees,
7983 add_vars etc. have been adapted as well: INCOMPATIBILITY.
7985 * Pure: name spaces have been refined, with significant changes of the
7986 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
7987 to extern(_table). The plain name entry path is superceded by a
7988 general 'naming' context, which also includes the 'policy' to produce
7989 a fully qualified name and external accesses of a fully qualified
7990 name; NameSpace.extend is superceded by context dependent
7991 Sign.declare_name. Several theory and proof context operations modify
7992 the naming context. Especially note Theory.restore_naming and
7993 ProofContext.restore_naming to get back to a sane state; note that
7994 Theory.add_path is no longer sufficient to recover from
7995 Theory.absolute_path in particular.
7997 * Pure: new flags short_names (default false) and unique_names
7998 (default true) for controlling output of qualified names. If
7999 short_names is set, names are printed unqualified. If unique_names is
8000 reset, the name prefix is reduced to the minimum required to achieve
8001 the original result when interning again, even if there is an overlap
8002 with earlier declarations.
8004 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
8005 now 'extend', and 'merge' gets an additional Pretty.pp argument
8006 (useful for printing error messages). INCOMPATIBILITY.
8008 * Pure: major reorganization of the theory context. Type Sign.sg and
8009 Theory.theory are now identified, referring to the universal
8010 Context.theory (see Pure/context.ML). Actual signature and theory
8011 content is managed as theory data. The old code and interfaces were
8012 spread over many files and structures; the new arrangement introduces
8013 considerable INCOMPATIBILITY to gain more clarity:
8015 Context -- theory management operations (name, identity, inclusion,
8016 parents, ancestors, merge, etc.), plus generic theory data;
8018 Sign -- logical signature and syntax operations (declaring consts,
8019 types, etc.), plus certify/read for common entities;
8021 Theory -- logical theory operations (stating axioms, definitions,
8022 oracles), plus a copy of logical signature operations (consts,
8023 types, etc.); also a few basic management operations (Theory.copy,
8026 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
8027 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
8028 for convenience -- they merely return the theory.
8030 * Pure: type Type.tsig is superceded by theory in most interfaces.
8032 * Pure: the Isar proof context type is already defined early in Pure
8033 as Context.proof (note that ProofContext.context and Proof.context are
8034 aliases, where the latter is the preferred name). This enables other
8035 Isabelle components to refer to that type even before Isar is present.
8037 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
8038 typeK, constK, axiomK, oracleK), but provide explicit operations for
8039 any of these kinds. For example, Sign.intern typeK is now
8040 Sign.intern_type, Theory.hide_space Sign.typeK is now
8041 Theory.hide_types. Also note that former
8042 Theory.hide_classes/types/consts are now
8043 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
8044 internalize their arguments! INCOMPATIBILITY.
8046 * Pure: get_thm interface (of PureThy and ProofContext) expects
8047 datatype thmref (with constructors Name and NameSelection) instead of
8048 plain string -- INCOMPATIBILITY;
8050 * Pure: cases produced by proof methods specify options, where NONE
8051 means to remove case bindings -- INCOMPATIBILITY in
8054 * Pure: the following operations retrieve axioms or theorems from a
8055 theory node or theory hierarchy, respectively:
8057 Theory.axioms_of: theory -> (string * term) list
8058 Theory.all_axioms_of: theory -> (string * term) list
8059 PureThy.thms_of: theory -> (string * thm) list
8060 PureThy.all_thms_of: theory -> (string * thm) list
8062 * Pure: print_tac now outputs the goal through the trace channel.
8064 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
8065 Reference Toplevel.debug (default false) controls detailed printing
8066 and tracing of low-level exceptions; Toplevel.profiling (default 0)
8067 controls execution profiling -- set to 1 for time and 2 for space
8068 (both increase the runtime).
8070 * Isar session: The initial use of ROOT.ML is now always timed,
8071 i.e. the log will show the actual process times, in contrast to the
8072 elapsed wall-clock time that the outer shell wrapper produces.
8074 * Simplifier: improved handling of bound variables (nameless
8075 representation, avoid allocating new strings). Simprocs that invoke
8076 the Simplifier recursively should use Simplifier.inherit_bounds to
8077 avoid local name clashes. Failure to do so produces warnings
8078 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
8079 for further details.
8081 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
8082 bindings for all theorems stored within a given theory; this may help
8083 in porting non-Isar theories to Isar ones, while keeping ML proof
8084 scripts for the time being.
8086 * ML operator HTML.with_charset specifies the charset begin used for
8087 generated HTML files. For example:
8089 HTML.with_charset "utf-8" use_thy "Hebrew";
8090 HTML.with_charset "utf-8" use_thy "Chinese";
8095 * Allow symlinks to all proper Isabelle executables (Isabelle,
8096 isabelle, isatool etc.).
8098 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
8099 isatool doc, isatool mkdir, display_drafts etc.).
8101 * isatool usedir: option -f allows specification of the ML file to be
8102 used by Isabelle; default is ROOT.ML.
8104 * New isatool version outputs the version identifier of the Isabelle
8105 distribution being used.
8107 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
8108 (containing Boolean satisfiability problems) into Isabelle/HOL
8113 New in Isabelle2004 (April 2004)
8114 --------------------------------
8118 * Provers/order.ML: new efficient reasoner for partial and linear orders.
8119 Replaces linorder.ML.
8121 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
8122 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
8123 (\<a>...\<z>), are now considered normal letters, and can therefore
8124 be used anywhere where an ASCII letter (a...zA...Z) has until
8125 now. COMPATIBILITY: This obviously changes the parsing of some
8126 terms, especially where a symbol has been used as a binder, say
8127 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
8128 as an identifier. Fix it by inserting a space around former
8129 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
8130 existing theory and ML files.
8132 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
8134 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
8135 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
8136 a normal (but invisible) letter. For multiple letter subscripts repeat
8137 \<^isub> like this: x\<^isub>1\<^isub>2.
8139 * Pure: There are now sub-/superscripts that can span more than one
8140 character. Text between \<^bsub> and \<^esub> is set in subscript in
8141 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
8142 superscript. The new control characters are not identifier parts.
8144 * Pure: Control-symbols of the form \<^raw:...> will literally print the
8145 content of "..." to the latex file instead of \isacntrl... . The "..."
8146 may consist of any printable characters excluding the end bracket >.
8148 * Pure: Using new Isar command "finalconsts" (or the ML functions
8149 Theory.add_finals or Theory.add_finals_i) it is now possible to
8150 declare constants "final", which prevents their being given a definition
8151 later. It is useful for constants whose behaviour is fixed axiomatically
8152 rather than definitionally, such as the meta-logic connectives.
8154 * Pure: 'instance' now handles general arities with general sorts
8155 (i.e. intersections of classes),
8157 * Presentation: generated HTML now uses a CSS style sheet to make layout
8158 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
8159 It can be changed to alter the colors/layout of generated pages.
8164 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
8165 cut_tac, subgoal_tac and thin_tac:
8166 - Now understand static (Isar) contexts. As a consequence, users of Isar
8167 locales are no longer forced to write Isar proof scripts.
8168 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
8170 - INCOMPATIBILITY: names of variables to be instantiated may no
8171 longer be enclosed in quotes. Instead, precede variable name with `?'.
8172 This is consistent with the instantiation attribute "where".
8174 * Attributes "where" and "of":
8175 - Now take type variables of instantiated theorem into account when reading
8176 the instantiation string. This fixes a bug that caused instantiated
8177 theorems to have too special types in some circumstances.
8178 - "where" permits explicit instantiations of type variables.
8180 * Calculation commands "moreover" and "also" no longer interfere with
8181 current facts ("this"), admitting arbitrary combinations with "then"
8185 - Goal statements involving the context element "includes" no longer
8186 generate theorems with internal delta predicates (those ending on
8187 "_axioms") in the premise.
8188 Resolve particular premise with <locale>.intro to obtain old form.
8189 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
8190 specification and "includes" elements in goal statement.
8191 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
8192 [intro?] and [elim?] (respectively) by default.
8193 - Experimental command for instantiation of locales in proof contexts:
8194 instantiate <label>[<attrs>]: <loc>
8195 Instantiates locale <loc> and adds all its theorems to the current context
8196 taking into account their attributes. Label and attrs are optional
8197 modifiers, like in theorem declarations. If present, names of
8198 instantiated theorems are qualified with <label>, and the attributes
8199 <attrs> are applied after any attributes these theorems might have already.
8200 If the locale has assumptions, a chained fact of the form
8201 "<loc> t1 ... tn" is expected from which instantiations of the parameters
8202 are derived. The command does not support old-style locales declared
8203 with "locale (open)".
8204 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
8206 * HOL: Tactic emulation methods induct_tac and case_tac understand static
8212 * Proof import: new image HOL4 contains the imported library from
8213 the HOL4 system with about 2500 theorems. It is imported by
8214 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
8215 can be used like any other Isabelle image. See
8216 HOL/Import/HOL/README for more information.
8219 - Much improved handling of linear and partial orders.
8220 Reasoners for linear and partial orders are set up for type classes
8221 "linorder" and "order" respectively, and are added to the default simpset
8222 as solvers. This means that the simplifier can build transitivity chains
8223 to solve goals from the assumptions.
8224 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
8225 of blast or auto after simplification become unnecessary because the goal
8226 is solved by simplification already.
8228 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
8229 all proved in axiomatic type classes for semirings, rings and fields.
8232 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
8233 now formalized using the Ring_and_Field theory mentioned above.
8234 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
8235 than before, because now they are set up once in a generic manner.
8236 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
8237 Look for the general versions in Ring_and_Field (and Power if they concern
8240 * Type "rat" of the rational numbers is now available in HOL-Complex.
8243 - Record types are now by default printed with their type abbreviation
8244 instead of the list of all field types. This can be configured via
8245 the reference "print_record_type_abbr".
8246 - Simproc "record_upd_simproc" for simplification of multiple updates added
8247 (not enabled by default).
8248 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
8249 EX x. x = sel r to True (not enabled by default).
8250 - Tactic "record_split_simp_tac" to split and simplify records added.
8252 * 'specification' command added, allowing for definition by
8253 specification. There is also an 'ax_specification' command that
8254 introduces the new constants axiomatically.
8256 * arith(_tac) is now able to generate counterexamples for reals as well.
8258 * HOL-Algebra: new locale "ring" for non-commutative rings.
8260 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
8261 definitions, thanks to Sava Krsti\'{c} and John Matthews.
8263 * HOL-Matrix: a first theory for matrices in HOL with an application of
8264 matrix theory to linear programming.
8266 * Unions and Intersections:
8267 The latex output syntax of UN and INT has been changed
8268 from "\Union x \in A. B" to "\Union_{x \in A} B"
8269 i.e. the index formulae has become a subscript.
8270 Similarly for "\Union x. B", and for \Inter instead of \Union.
8272 * Unions and Intersections over Intervals:
8273 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
8274 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
8275 like in normal math, and corresponding versions for < and for intersection.
8277 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
8278 lexicographic dictonary ordering has been added as "lexord".
8280 * ML: the legacy theory structures Int and List have been removed. They had
8281 conflicted with ML Basis Library structures having the same names.
8283 * 'refute' command added to search for (finite) countermodels. Only works
8284 for a fragment of HOL. The installation of an external SAT solver is
8285 highly recommended. See "HOL/Refute.thy" for details.
8287 * 'quickcheck' command: Allows to find counterexamples by evaluating
8288 formulae under an assignment of free variables to random values.
8289 In contrast to 'refute', it can deal with inductive datatypes,
8290 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
8296 * Streams now come with concatenation and are part of the HOLCF image
8300 New in Isabelle2003 (May 2003)
8301 ------------------------------
8305 * Provers/simplifier:
8307 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
8308 Assumptions are now subject to complete mutual simplification,
8309 not just from left to right. The simplifier now preserves
8310 the order of assumptions.
8312 Potential INCOMPATIBILITY:
8314 -- simp sometimes diverges where the old version did
8315 not, e.g. invoking simp on the goal
8317 [| P (f x); y = x; f x = f y |] ==> Q
8319 now gives rise to the infinite reduction sequence
8321 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
8323 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
8326 -- Tactics combining classical reasoner and simplification (such as auto)
8327 are also affected by this change, because many of them rely on
8328 simp. They may sometimes diverge as well or yield a different numbers
8329 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
8330 in case of problems. Sometimes subsequent calls to the classical
8331 reasoner will fail because a preceeding call to the simplifier too
8332 eagerly simplified the goal, e.g. deleted redundant premises.
8334 - The simplifier trace now shows the names of the applied rewrite rules
8336 - You can limit the number of recursive invocations of the simplifier
8337 during conditional rewriting (where the simplifie tries to solve the
8338 conditions before applying the rewrite rule):
8339 ML "simp_depth_limit := n"
8340 where n is an integer. Thus you can force termination where previously
8341 the simplifier would diverge.
8343 - Accepts free variables as head terms in congruence rules. Useful in Isar.
8345 - No longer aborts on failed congruence proof. Instead, the
8346 congruence is ignored.
8348 * Pure: New generic framework for extracting programs from constructive
8349 proofs. See HOL/Extraction.thy for an example instantiation, as well
8350 as HOL/Extraction for some case studies.
8352 * Pure: The main goal of the proof state is no longer shown by default, only
8353 the subgoals. This behaviour is controlled by a new flag.
8354 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
8355 (ML: Proof.show_main_goal).
8357 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
8358 rules whose conclusion matches subgoal 1:
8359 PG menu: Isabelle/Isar -> Show me -> matching rules
8360 The rules are ordered by how closely they match the subgoal.
8361 In particular, rules that solve a subgoal outright are displayed first
8362 (or rather last, the way they are printed).
8363 (ML: ProofGeneral.print_intros())
8365 * Pure: New flag trace_unify_fail causes unification to print
8366 diagnostic information (PG: in trace buffer) when it fails. This is
8367 useful for figuring out why single step proofs like rule, erule or
8370 * Pure: Locale specifications now produce predicate definitions
8371 according to the body of text (covering assumptions modulo local
8372 definitions); predicate "loc_axioms" covers newly introduced text,
8373 while "loc" is cumulative wrt. all included locale expressions; the
8374 latter view is presented only on export into the global theory
8375 context; potential INCOMPATIBILITY, use "(open)" option to fall back
8376 on the old view without predicates;
8378 * Pure: predefined locales "var" and "struct" are useful for sharing
8379 parameters (as in CASL, for example); just specify something like
8380 ``var x + var y + struct M'' as import;
8382 * Pure: improved thms_containing: proper indexing of facts instead of
8383 raw theorems; check validity of results wrt. current name space;
8384 include local facts of proof configuration (also covers active
8385 locales), cover fixed variables in index; may use "_" in term
8386 specification; an optional limit for the number of printed facts may
8387 be given (the default is 40);
8389 * Pure: disallow duplicate fact bindings within new-style theory files
8392 * Provers: improved induct method: assumptions introduced by case
8393 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
8394 the goal statement); "foo" still refers to all facts collectively;
8396 * Provers: the function blast.overloaded has been removed: all constants
8397 are regarded as potentially overloaded, which improves robustness in exchange
8398 for slight decrease in efficiency;
8400 * Provers/linorder: New generic prover for transitivity reasoning over
8401 linear orders. Note: this prover is not efficient!
8403 * Isar: preview of problems to finish 'show' now produce an error
8404 rather than just a warning (in interactive mode);
8411 - Produces a counter example if it cannot prove a goal.
8412 Note that the counter example may be spurious if the goal is not a formula
8413 of quantifier-free linear arithmetic.
8414 In ProofGeneral the counter example appears in the trace buffer.
8416 - Knows about div k and mod k where k is a numeral of type nat or int.
8418 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
8419 linear arithmetic fails. This takes account of quantifiers and divisibility.
8420 Presburger arithmetic can also be called explicitly via presburger(_tac).
8422 * simp's arithmetic capabilities have been enhanced a bit: it now
8423 takes ~= in premises into account (by performing a case split);
8425 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
8426 are distributed over a sum of terms;
8428 * New tactic "trans_tac" and method "trans" instantiate
8429 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
8432 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
8433 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
8435 * 'typedef' command has new option "open" to suppress the set
8438 * functions Min and Max on finite sets have been introduced (theory
8441 * attribute [symmetric] now works for relations as well; it turns
8442 (x,y) : R^-1 into (y,x) : R, and vice versa;
8444 * induct over a !!-quantified statement (say !!x1..xn):
8445 each "case" automatically performs "fix x1 .. xn" with exactly those names.
8447 * Map: `empty' is no longer a constant but a syntactic abbreviation for
8448 %x. None. Warning: empty_def now refers to the previously hidden definition
8451 * Algebra: formalization of classical algebra. Intended as base for
8452 any algebraic development in Isabelle. Currently covers group theory
8453 (up to Sylow's theorem) and ring theory (Universal Property of
8454 Univariate Polynomials). Contributions welcome;
8456 * GroupTheory: deleted, since its material has been moved to Algebra;
8458 * Complex: new directory of the complex numbers with numeric constants,
8459 nonstandard complex numbers, and some complex analysis, standard and
8460 nonstandard (Jacques Fleuriot);
8462 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
8464 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
8467 * Real/HahnBanach: updated and adapted to locales;
8469 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
8472 * UNITY: added the Meier-Sanders theory of progress sets;
8474 * MicroJava: bytecode verifier and lightweight bytecode verifier
8475 as abstract algorithms, instantiated to the JVM;
8477 * Bali: Java source language formalization. Type system, operational
8478 semantics, axiomatic semantics. Supported language features:
8479 classes, interfaces, objects,virtual methods, static methods,
8480 static/instance fields, arrays, access modifiers, definite
8481 assignment, exceptions.
8486 * ZF/Constructible: consistency proof for AC (Gdel's constructible
8489 * Main ZF: virtually all theories converted to new-style format;
8494 * Pure: Tactic.prove provides sane interface for internal proofs;
8495 omits the infamous "standard" operation, so this is more appropriate
8496 than prove_goalw_cterm in many situations (e.g. in simprocs);
8498 * Pure: improved error reporting of simprocs;
8500 * Provers: Simplifier.simproc(_i) provides sane interface for setting
8504 *** Document preparation ***
8506 * uses \par instead of \\ for line breaks in theory text. This may
8507 shift some page breaks in large documents. To get the old behaviour
8508 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
8510 * minimized dependencies of isabelle.sty and isabellesym.sty on
8513 * \<euro> now needs package babel/greek instead of marvosym (which
8516 * normal size for \<zero>...\<nine> (uses \mathbf instead of
8521 New in Isabelle2002 (March 2002)
8522 --------------------------------
8524 *** Document preparation ***
8526 * greatly simplified document preparation setup, including more
8527 graceful interpretation of isatool usedir -i/-d/-D options, and more
8528 instructive isatool mkdir; users should basically be able to get
8529 started with "isatool mkdir HOL Test && isatool make"; alternatively,
8530 users may run a separate document processing stage manually like this:
8531 "isatool usedir -D output HOL Test && isatool document Test/output";
8533 * theory dependency graph may now be incorporated into documents;
8534 isatool usedir -g true will produce session_graph.eps/.pdf for use
8535 with \includegraphics of LaTeX;
8537 * proper spacing of consecutive markup elements, especially text
8538 blocks after section headings;
8540 * support bold style (for single symbols only), input syntax is like
8541 this: "\<^bold>\<alpha>" or "\<^bold>A";
8543 * \<bullet> is now output as bold \cdot by default, which looks much
8544 better in printed text;
8546 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
8547 note that these symbols are currently unavailable in Proof General /
8548 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
8550 * isatool latex no longer depends on changed TEXINPUTS, instead
8551 isatool document copies the Isabelle style files to the target
8557 * Pure/Provers: improved proof by cases and induction;
8558 - 'case' command admits impromptu naming of parameters (such as
8560 - 'induct' method divinates rule instantiation from the inductive
8561 claim; no longer requires excessive ?P bindings for proper
8562 instantiation of cases;
8563 - 'induct' method properly enumerates all possibilities of set/type
8564 rules; as a consequence facts may be also passed through *type*
8565 rules without further ado;
8566 - 'induct' method now derives symbolic cases from the *rulified*
8567 rule (before it used to rulify cases stemming from the internal
8568 atomized version); this means that the context of a non-atomic
8569 statement becomes is included in the hypothesis, avoiding the
8570 slightly cumbersome show "PROP ?case" form;
8571 - 'induct' may now use elim-style induction rules without chaining
8572 facts, using ``missing'' premises from the goal state; this allows
8573 rules stemming from inductive sets to be applied in unstructured
8574 scripts, while still benefitting from proper handling of non-atomic
8575 statements; NB: major inductive premises need to be put first, all
8576 the rest of the goal is passed through the induction;
8577 - 'induct' proper support for mutual induction involving non-atomic
8578 rule statements (uses the new concept of simultaneous goals, see
8580 - append all possible rule selections, but only use the first
8581 success (no backtracking);
8582 - removed obsolete "(simplified)" and "(stripped)" options of methods;
8583 - undeclared rule case names default to numbers 1, 2, 3, ...;
8584 - added 'print_induct_rules' (covered by help item in recent Proof
8586 - moved induct/cases attributes to Pure, methods to Provers;
8587 - generic method setup instantiated for FOL and HOL;
8589 * Pure: support multiple simultaneous goal statements, for example
8590 "have a: A and b: B" (same for 'theorem' etc.); being a pure
8591 meta-level mechanism, this acts as if several individual goals had
8592 been stated separately; in particular common proof methods need to be
8593 repeated in order to cover all claims; note that a single elimination
8594 step is *not* sufficient to establish the two conjunctions, so this
8597 assume "A & B" then have A and B .. (*".." fails*)
8599 better use "obtain" in situations as above; alternative refer to
8600 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
8602 * Pure: proper integration with ``locales''; unlike the original
8603 version by Florian Kammller, Isar locales package high-level proof
8604 contexts rather than raw logical ones (e.g. we admit to include
8605 attributes everywhere); operations on locales include merge and
8606 rename; support for implicit arguments (``structures''); simultaneous
8607 type-inference over imports and text; see also HOL/ex/Locales.thy for
8610 * Pure: the following commands have been ``localized'', supporting a
8611 target locale specification "(in name)": 'lemma', 'theorem',
8612 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
8613 stored both within the locale and at the theory level (exported and
8614 qualified by the locale name);
8616 * Pure: theory goals may now be specified in ``long'' form, with
8617 ad-hoc contexts consisting of arbitrary locale elements. for example
8618 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
8619 definitions may be given, too); the result is a meta-level rule with
8620 the context elements being discharged in the obvious way;
8622 * Pure: new proof command 'using' allows to augment currently used
8623 facts after a goal statement ('using' is syntactically analogous to
8624 'apply', but acts on the goal's facts only); this allows chained facts
8625 to be separated into parts given before and after a claim, as in
8626 ``from a and b have C using d and e <proof>'';
8628 * Pure: renamed "antecedent" case to "rule_context";
8630 * Pure: new 'judgment' command records explicit information about the
8631 object-logic embedding (used by several tools internally); no longer
8632 use hard-wired "Trueprop";
8634 * Pure: added 'corollary' command;
8636 * Pure: fixed 'token_translation' command;
8638 * Pure: removed obsolete 'exported' attribute;
8640 * Pure: dummy pattern "_" in is/let is now automatically lifted over
8641 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
8642 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
8644 * Pure: method 'atomize' presents local goal premises as object-level
8645 statements (atomic meta-level propositions); setup controlled via
8646 rewrite rules declarations of 'atomize' attribute; example
8647 application: 'induct' method with proper rule statements in improper
8650 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
8651 now consider the syntactic context of assumptions, giving a better
8652 chance to get type-inference of the arguments right (this is
8653 especially important for locales);
8655 * Pure: "sorry" no longer requires quick_and_dirty in interactive
8658 * Pure/obtain: the formal conclusion "thesis", being marked as
8659 ``internal'', may no longer be reference directly in the text;
8660 potential INCOMPATIBILITY, may need to use "?thesis" in rare
8663 * Pure: generic 'sym' attribute which declares a rule both as pure
8664 'elim?' and for the 'symmetric' operation;
8666 * Pure: marginal comments ``--'' may now occur just anywhere in the
8667 text; the fixed correlation with particular command syntax has been
8670 * Pure: new method 'rules' is particularly well-suited for proof
8671 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
8672 but often produces more compact proof terms with less detours;
8674 * Pure/Provers/classical: simplified integration with pure rule
8675 attributes and methods; the classical "intro?/elim?/dest?"
8676 declarations coincide with the pure ones; the "rule" method no longer
8677 includes classically swapped intros; "intro" and "elim" methods no
8678 longer pick rules from the context; also got rid of ML declarations
8679 AddXIs/AddXEs/AddXDs; all of this has some potential for
8682 * Provers/classical: attribute 'swapped' produces classical inversions
8683 of introduction rules;
8685 * Provers/simplifier: 'simplified' attribute may refer to explicit
8686 rules instead of full simplifier context; 'iff' attribute handles
8689 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
8691 * HOL: 'recdef' now fails on unfinished automated proofs, use
8692 "(permissive)" option to recover old behavior;
8694 * HOL: 'inductive' no longer features separate (collective) attributes
8695 for 'intros' (was found too confusing);
8697 * HOL: properly declared induction rules less_induct and
8703 * HOL: moved over to sane numeral syntax; the new policy is as
8706 - 0 and 1 are polymorphic constants, which are defined on any
8707 numeric type (nat, int, real etc.);
8709 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
8710 binary representation internally;
8712 - type nat has special constructor Suc, and generally prefers Suc 0
8713 over 1::nat and Suc (Suc 0) over 2::nat;
8715 This change may cause significant problems of INCOMPATIBILITY; here
8716 are some hints on converting existing sources:
8718 - due to the new "num" token, "-0" and "-1" etc. are now atomic
8719 entities, so expressions involving "-" (unary or binary minus) need
8720 to be spaced properly;
8722 - existing occurrences of "1" may need to be constraint "1::nat" or
8723 even replaced by Suc 0; similar for old "2";
8725 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
8727 - remove all special provisions on numerals in proofs;
8729 * HOL: simp rules nat_number expand numerals on nat to Suc/0
8730 representation (depends on bin_arith_simps in the default context);
8732 * HOL: symbolic syntax for x^2 (numeral 2);
8734 * HOL: the class of all HOL types is now called "type" rather than
8735 "term"; INCOMPATIBILITY, need to adapt references to this type class
8736 in axclass/classes, instance/arities, and (usually rare) occurrences
8737 in typings (of consts etc.); internally the class is called
8738 "HOL.type", ML programs should refer to HOLogic.typeS;
8740 * HOL/record package improvements:
8741 - new derived operations "fields" to build a partial record section,
8742 "extend" to promote a fixed record to a record scheme, and
8743 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
8744 declared as simp by default;
8745 - shared operations ("more", "fields", etc.) now need to be always
8746 qualified) --- potential INCOMPATIBILITY;
8747 - removed "make_scheme" operations (use "make" with "extend") --
8749 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
8750 - provides cases/induct rules for use with corresponding Isar
8751 methods (for concrete records, record schemes, concrete more
8752 parts, and schematic more parts -- in that order);
8753 - internal definitions directly based on a light-weight abstract
8754 theory of product types over typedef rather than datatype;
8756 * HOL: generic code generator for generating executable ML code from
8757 specifications; specific support for HOL constructs such as inductive
8758 datatypes and sets, as well as recursive functions; can be invoked
8759 via 'generate_code' theory section;
8761 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
8763 * HOL: consolidated and renamed several theories. In particular:
8764 Ord.thy has been absorbed into HOL.thy
8765 String.thy has been absorbed into List.thy
8767 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
8768 (beware of argument permutation!);
8770 * HOL: linorder_less_split superseded by linorder_cases;
8772 * HOL/List: "nodups" renamed to "distinct";
8774 * HOL: added "The" definite description operator; move Hilbert's "Eps"
8775 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
8776 - Ex_def has changed, now need to use some_eq_ex
8778 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
8779 in this (rare) case use:
8781 delSWrapper "split_all_tac"
8782 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
8784 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
8787 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
8788 Isabelle's type classes, ^ on functions and relations has too general
8789 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
8790 necessary to attach explicit type constraints;
8792 * HOL/Relation: the prefix name of the infix "O" has been changed from
8793 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
8794 renamed accordingly (eg "compI" -> "rel_compI").
8796 * HOL: syntax translations now work properly with numerals and records
8799 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
8800 of "lam" -- INCOMPATIBILITY;
8802 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
8803 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
8804 renamed "Product_Type.unit";
8806 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
8808 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
8809 the "cases" method);
8811 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
8814 * HOL/IMP: updated and converted to new-style theory format; several
8815 parts turned into readable document, with proper Isar proof texts and
8816 some explanations (by Gerwin Klein);
8818 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
8820 * HOL-Hyperreal is now a logic image;
8825 * Isar: consts/constdefs supports mixfix syntax for continuous
8828 * Isar: domain package adapted to new-style theory format, e.g. see
8831 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
8832 potential INCOMPATIBILITY; now use plain induct_tac instead of former
8833 lift.induct_tac, always use UU instead of Undef;
8835 * HOLCF/IMP: updated and converted to new-style theory;
8840 * Isar: proper integration of logic-specific tools and packages,
8841 including theory commands '(co)inductive', '(co)datatype',
8842 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
8843 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
8845 * theory Main no longer includes AC; for the Axiom of Choice, base
8846 your theory on Main_ZFC;
8848 * the integer library now covers quotients and remainders, with many
8849 laws relating division to addition, multiplication, etc.;
8851 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
8852 typeless version of the formalism;
8854 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
8857 * ZF/Induct: new directory for examples of inductive definitions,
8858 including theory Multiset for multiset orderings; converted to
8859 new-style theory format;
8861 * ZF: many new theorems about lists, ordinals, etc.;
8866 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
8867 variable proof controls level of detail: 0 = no proofs (only oracle
8868 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
8869 also ref manual for further ML interfaces;
8871 * Pure/axclass: removed obsolete ML interface
8872 goal_subclass/goal_arity;
8874 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
8875 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
8876 separate tokens, so expressions involving minus need to be spaced
8879 * Pure/syntax: support non-oriented infixes, using keyword "infix"
8880 rather than "infixl" or "infixr";
8882 * Pure/syntax: concrete syntax for dummy type variables admits genuine
8883 sort constraint specifications in type inference; e.g. "x::_::foo"
8884 ensures that the type of "x" is of sort "foo" (but not necessarily a
8887 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
8888 control output of nested => (types); the default behavior is
8891 * Pure/syntax: builtin parse translation for "_constify" turns valued
8892 tokens into AST constants;
8894 * Pure/syntax: prefer later declarations of translations and print
8895 translation functions; potential INCOMPATIBILITY: need to reverse
8896 multiple declarations for same syntax element constant;
8898 * Pure/show_hyps reset by default (in accordance to existing Isar
8901 * Provers/classical: renamed addaltern to addafter, addSaltern to
8904 * Provers/clasimp: ``iff'' declarations now handle conditional rules
8907 * system: tested support for MacOS X; should be able to get Isabelle +
8908 Proof General to work in a plain Terminal after installing Poly/ML
8909 (e.g. from the Isabelle distribution area) and GNU bash alone
8910 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
8911 support requires further installations, e.g. from
8912 http://fink.sourceforge.net/);
8914 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
8916 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
8917 of 40 MB), cf. ML_OPTIONS;
8919 * system: Proof General keywords specification is now part of the
8920 Isabelle distribution (see etc/isar-keywords.el);
8922 * system: support for persistent Proof General sessions (refrain from
8923 outdating all loaded theories on startup); user may create writable
8924 logic images like this: ``isabelle -q HOL Test'';
8926 * system: smart selection of Isabelle process versus Isabelle
8927 interface, accommodates case-insensitive file systems (e.g. HFS+); may
8928 run both "isabelle" and "Isabelle" even if file names are badly
8929 damaged (executable inspects the case of the first letter of its own
8930 name); added separate "isabelle-process" and "isabelle-interface";
8932 * system: refrain from any attempt at filtering input streams; no
8933 longer support ``8bit'' encoding of old isabelle font, instead proper
8934 iso-latin characters may now be used; the related isatools
8935 "symbolinput" and "nonascii" have disappeared as well;
8937 * system: removed old "xterm" interface (the print modes "xterm" and
8938 "xterm_color" are still available for direct use in a suitable
8943 New in Isabelle99-2 (February 2001)
8944 -----------------------------------
8946 *** Overview of INCOMPATIBILITIES ***
8948 * HOL: please note that theories in the Library and elsewhere often use the
8949 new-style (Isar) format; to refer to their theorems in an ML script you must
8950 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
8952 * HOL: inductive package no longer splits induction rule aggressively,
8953 but only as far as specified by the introductions given; the old
8954 format may be recovered via ML function complete_split_rule or attribute
8955 'split_rule (complete)';
8957 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
8958 gfp_Tarski to gfp_unfold;
8960 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
8962 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
8963 relation); infix "^^" has been renamed "``"; infix "``" has been
8964 renamed "`"; "univalent" has been renamed "single_valued";
8966 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
8969 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
8971 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
8973 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
8974 consequence, it is no longer monotonic wrt. the local goal context
8975 (which is now passed through the inductive cases);
8977 * Document preparation: renamed standard symbols \<ll> to \<lless> and
8978 \<gg> to \<ggreater>;
8981 *** Document preparation ***
8983 * \isabellestyle{NAME} selects version of Isabelle output (currently
8984 available: are "it" for near math-mode best-style output, "sl" for
8985 slanted text style, and "tt" for plain type-writer; if no
8986 \isabellestyle command is given, output is according to slanted
8989 * support sub/super scripts (for single symbols only), input syntax is
8990 like this: "A\<^sup>*" or "A\<^sup>\<star>";
8992 * some more standard symbols; see Appendix A of the system manual for
8993 the complete list of symbols defined in isabellesym.sty;
8995 * improved isabelle style files; more abstract symbol implementation
8996 (should now use \isamath{...} and \isatext{...} in custom symbol
8999 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
9000 state; Note that presentation of goal states does not conform to
9001 actual human-readable proof documents. Please do not include goal
9002 states into document output unless you really know what you are doing!
9004 * proper indentation of antiquoted output with proportional LaTeX
9007 * no_document ML operator temporarily disables LaTeX document
9010 * isatool unsymbolize tunes sources for plain ASCII communication;
9015 * Pure: Isar now suffers initial goal statements to contain unbound
9016 schematic variables (this does not conform to actual readable proof
9017 documents, due to unpredictable outcome and non-compositional proof
9018 checking); users who know what they are doing may use schematic goals
9019 for Prolog-style synthesis of proven results;
9021 * Pure: assumption method (an implicit finishing) now handles actual
9024 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
9025 initial goal, declare "that" only as Pure intro (only for single
9026 steps); the "that" rule assumption may now be involved in implicit
9027 finishing, thus ".." becomes a feasible for trivial obtains;
9029 * Pure: default proof step now includes 'intro_classes'; thus trivial
9030 instance proofs may be performed by "..";
9032 * Pure: ?thesis / ?this / "..." now work for pure meta-level
9035 * Pure: more robust selection of calculational rules;
9037 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
9038 rule (as well as the assumption rule);
9040 * Pure: 'thm_deps' command visualizes dependencies of theorems and
9041 lemmas, using the graph browser tool;
9043 * Pure: predict failure of "show" in interactive mode;
9045 * Pure: 'thms_containing' now takes actual terms as arguments;
9047 * HOL: improved method 'induct' --- now handles non-atomic goals
9048 (potential INCOMPATIBILITY); tuned error handling;
9050 * HOL: cases and induct rules now provide explicit hints about the
9051 number of facts to be consumed (0 for "type" and 1 for "set" rules);
9052 any remaining facts are inserted into the goal verbatim;
9054 * HOL: local contexts (aka cases) may now contain term bindings as
9055 well; the 'cases' and 'induct' methods new provide a ?case binding for
9056 the result to be shown in each case;
9058 * HOL: added 'recdef_tc' command;
9060 * isatool convert assists in eliminating legacy ML scripts;
9065 * HOL/Library: a collection of generic theories to be used together
9066 with main HOL; the theory loader path already includes this directory
9067 by default; the following existing theories have been moved here:
9068 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
9069 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
9071 * HOL/Unix: "Some aspects of Unix file-system security", a typical
9072 modelling and verification task performed in Isabelle/HOL +
9073 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
9075 * HOL/Algebra: special summation operator SUM no longer exists, it has
9076 been replaced by setsum; infix 'assoc' now has priority 50 (like
9077 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
9078 'domain', this makes the theory consistent with mathematical
9081 * HOL basics: added overloaded operations "inverse" and "divide"
9082 (infix "/"), syntax for generic "abs" operation, generic summation
9085 * HOL/typedef: simplified package, provide more useful rules (see also
9088 * HOL/datatype: induction rule for arbitrarily branching datatypes is
9089 now expressed as a proper nested rule (old-style tactic scripts may
9090 require atomize_strip_tac to cope with non-atomic premises);
9092 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
9093 to "split_conv" (old name still available for compatibility);
9095 * HOL: improved concrete syntax for strings (e.g. allows translation
9096 rules with string literals);
9098 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
9099 and Fleuriot's mechanization of analysis, including the transcendental
9100 functions for the reals;
9102 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
9107 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
9108 "lam" is displayed as TWO lambda-symbols
9110 * CTT: theory Main now available, containing everything (that is, Bool
9116 * Pure: the Simplifier has been implemented properly as a derived rule
9117 outside of the actual kernel (at last!); the overall performance
9118 penalty in practical applications is about 50%, while reliability of
9119 the Isabelle inference kernel has been greatly improved;
9121 * print modes "brackets" and "no_brackets" control output of nested =>
9122 (types) and ==> (props); the default behaviour is "brackets";
9124 * Provers: fast_tac (and friends) now handle actual object-logic rules
9125 as assumptions as well;
9127 * system: support Poly/ML 4.0;
9129 * system: isatool install handles KDE version 1 or 2;
9133 New in Isabelle99-1 (October 2000)
9134 ----------------------------------
9136 *** Overview of INCOMPATIBILITIES ***
9138 * HOL: simplification of natural numbers is much changed; to partly
9139 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
9140 issue the following ML commands:
9142 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
9143 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
9145 * HOL: simplification no longer dives into case-expressions; this is
9146 controlled by "t.weak_case_cong" for each datatype t;
9148 * HOL: nat_less_induct renamed to less_induct;
9150 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
9151 fixsome to patch .thy and .ML sources automatically;
9153 select_equality -> some_equality
9154 select_eq_Ex -> some_eq_ex
9155 selectI2EX -> someI2_ex
9158 select1_equality -> some1_equality
9159 Eps_sym_eq -> some_sym_eq_trivial
9160 Eps_eq -> some_eq_trivial
9162 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
9164 * HOL: removed obsolete theorem binding expand_if (refer to split_if
9167 * HOL: the recursion equations generated by 'recdef' are now called
9168 f.simps instead of f.rules;
9170 * HOL: qed_spec_mp now also handles bounded ALL as well;
9172 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
9173 sometimes be needed;
9175 * HOL: the constant for "f``x" is now "image" rather than "op ``";
9177 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
9179 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
9180 product is now "<*>" instead of "Times"; the lexicographic product is
9181 now "<*lex*>" instead of "**";
9183 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
9184 of main HOL, but was unused); better use HOL's datatype package;
9186 * HOL: removed "symbols" syntax for constant "override" of theory Map;
9187 the old syntax may be recovered as follows:
9190 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
9191 (infixl "\\<oplus>" 100)
9193 * HOL/Real: "rabs" replaced by overloaded "abs" function;
9195 * HOL/ML: even fewer consts are declared as global (see theories Ord,
9196 Lfp, Gfp, WF); this only affects ML packages that refer to const names
9199 * HOL and ZF: syntax for quotienting wrt an equivalence relation
9200 changed from A/r to A//r;
9202 * ZF: new treatment of arithmetic (nat & int) may break some old
9205 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
9206 rulify -> rule_format, elimify -> elim_format, ...);
9208 * Isar/Provers: intro/elim/dest attributes changed; renamed
9209 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
9210 should have to change intro!! to intro? only); replaced "delrule" by
9213 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
9215 * Provers: strengthened force_tac by using new first_best_tac;
9217 * LaTeX document preparation: several changes of isabelle.sty (see
9221 *** Document preparation ***
9223 * formal comments (text blocks etc.) in new-style theories may now
9224 contain antiquotations of thm/prop/term/typ/text to be presented
9225 according to latex print mode; concrete syntax is like this:
9226 @{term[show_types] "f(x) = a + x"};
9228 * isatool mkdir provides easy setup of Isabelle session directories,
9229 including proper document sources;
9231 * generated LaTeX sources are now deleted after successful run
9232 (isatool document -c); may retain a copy somewhere else via -D option
9235 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
9236 style files, achieving self-contained LaTeX sources and simplifying
9239 * old-style theories now produce (crude) LaTeX output as well;
9241 * browser info session directories are now self-contained (may be put
9242 on WWW server seperately); improved graphs of nested sessions; removed
9243 graph for 'all sessions';
9245 * several improvements in isabelle style files; \isabellestyle{it}
9246 produces fake math mode output; \isamarkupheader is now \section by
9247 default; see lib/texinputs/isabelle.sty etc.;
9252 * Isar/Pure: local results and corresponding term bindings are now
9253 subject to Hindley-Milner polymorphism (similar to ML); this
9254 accommodates incremental type-inference very nicely;
9256 * Isar/Pure: new derived language element 'obtain' supports
9257 generalized existence reasoning;
9259 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
9260 support accumulation of results, without applying any rules yet;
9261 useful to collect intermediate results without explicit name
9262 references, and for use with transitivity rules with more than 2
9265 * Isar/Pure: scalable support for case-analysis type proofs: new
9266 'case' language element refers to local contexts symbolically, as
9267 produced by certain proof methods; internally, case names are attached
9268 to theorems as "tags";
9270 * Isar/Pure: theory command 'hide' removes declarations from
9271 class/type/const name spaces;
9273 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
9274 indicate potential overloading;
9276 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
9278 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
9279 "{a,b,c}" instead of {a,b,c};
9281 * Isar/Pure now provides its own version of intro/elim/dest
9282 attributes; useful for building new logics, but beware of confusion
9283 with the version in Provers/classical;
9285 * Isar/Pure: the local context of (non-atomic) goals is provided via
9286 case name 'antecedent';
9288 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
9289 to the current context is now done automatically);
9291 * Isar/Pure: theory command 'method_setup' provides a simple interface
9292 for definining proof methods in ML;
9294 * Isar/Provers: intro/elim/dest attributes changed; renamed
9295 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
9296 most cases, one should have to change intro!! to intro? only);
9297 replaced "delrule" by "rule del";
9299 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
9300 'symmetric' attribute (the latter supercedes [RS sym]);
9302 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
9303 method modifier); 'simp' method: 'only:' modifier removes loopers as
9304 well (including splits);
9306 * Isar/Provers: Simplifier and Classical methods now support all kind
9307 of modifiers used in the past, including 'cong', 'iff', etc.
9309 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
9310 of Simplifier and Classical reasoner);
9312 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
9313 now support named cases; major packages (inductive, datatype, primrec,
9314 recdef) support case names and properly name parameters;
9316 * Isar/HOL: new transitivity rules for substitution in inequalities --
9317 monotonicity conditions are extracted to be proven at end of
9320 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
9323 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
9324 split_if split_if_asm; datatype package provides theorems foo.splits =
9325 foo.split foo.split_asm for each datatype;
9327 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
9328 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
9329 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
9330 use "(cases (simplified))" method in proper proof texts);
9332 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
9334 * Isar: names of theorems etc. may be natural numbers as well;
9336 * Isar: 'pr' command: optional arguments for goals_limit and
9337 ProofContext.prems_limit; no longer prints theory contexts, but only
9340 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
9341 additional print modes to be specified; e.g. "pr(latex)" will print
9342 proof state according to the Isabelle LaTeX style;
9344 * Isar: improved support for emulating tactic scripts, including proof
9345 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
9346 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
9347 (for HOL datatypes);
9349 * Isar: simplified (more robust) goal selection of proof methods: 1st
9350 goal, all goals, or explicit goal specifier (tactic emulation); thus
9351 'proof method scripts' have to be in depth-first order;
9353 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
9355 * Isar: removed 'help' command, which hasn't been too helpful anyway;
9356 should instead use individual commands for printing items
9357 (print_commands, print_methods etc.);
9359 * Isar: added 'nothing' --- the empty list of theorems;
9364 * HOL/MicroJava: formalization of a fragment of Java, together with a
9365 corresponding virtual machine and a specification of its bytecode
9366 verifier and a lightweight bytecode verifier, including proofs of
9367 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
9368 Cornelia Pusch (see also the homepage of project Bali at
9369 http://isabelle.in.tum.de/Bali/);
9371 * HOL/Algebra: new theory of rings and univariate polynomials, by
9374 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
9375 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
9378 * HOL/Lattice: fundamental concepts of lattice theory and order
9379 structures, including duals, properties of bounds versus algebraic
9380 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
9381 Theorem for complete lattices etc.; may also serve as a demonstration
9382 for abstract algebraic reasoning using axiomatic type classes, and
9383 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
9385 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
9388 * HOL/IMPP: extension of IMP with local variables and mutually
9389 recursive procedures, by David von Oheimb;
9391 * HOL/Lambda: converted into new-style theory and document;
9393 * HOL/ex/Multiquote: example of multiple nested quotations and
9394 anti-quotations -- basically a generalized version of de-Bruijn
9395 representation; very useful in avoiding lifting of operations;
9397 * HOL/record: added general record equality rule to simpset; fixed
9398 select-update simplification procedure to handle extended records as
9399 well; admit "r" as field name;
9401 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
9402 other numeric types and also as the identity of groups, rings, etc.;
9404 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
9405 Types nat and int belong to this axclass;
9407 * HOL: greatly improved simplification involving numerals of type nat, int, real:
9408 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
9409 i*j + k + j*#3*i simplifies to #4*(i*j) + k
9410 two terms #m*u and #n*u are replaced by #(m+n)*u
9411 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
9412 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
9413 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
9415 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
9416 powerful prover for predicate logic but knows nothing of clasets; see
9417 ex/mesontest.ML and ex/mesontest2.ML for example applications;
9419 * HOL: new version of "case_tac" subsumes both boolean case split and
9420 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
9421 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
9423 * HOL: simplification no longer dives into case-expressions: only the
9424 selector expression is simplified, but not the remaining arms; to
9425 enable full simplification of case-expressions for datatype t, you may
9426 remove t.weak_case_cong from the simpset, either globally (Delcongs
9427 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
9429 * HOL/recdef: the recursion equations generated by 'recdef' for
9430 function 'f' are now called f.simps instead of f.rules; if all
9431 termination conditions are proved automatically, these simplification
9432 rules are added to the simpset, as in primrec; rules may be named
9433 individually as well, resulting in a separate list of theorems for
9436 * HOL/While is a new theory that provides a while-combinator. It
9437 permits the definition of tail-recursive functions without the
9438 provision of a termination measure. The latter is necessary once the
9439 invariant proof rule for while is applied.
9441 * HOL: new (overloaded) notation for the set of elements below/above
9442 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
9444 * HOL: theorems impI, allI, ballI bound as "strip";
9446 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
9447 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
9448 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
9450 * HOL/Real: "rabs" replaced by overloaded "abs" function;
9452 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
9453 main HOL, but was unused);
9455 * HOL: fewer consts declared as global (e.g. have to refer to
9456 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
9458 * HOL: tuned AST representation of nested pairs, avoiding bogus output
9459 in case of overlap with user translations (e.g. judgements over
9460 tuples); (note that the underlying logical represenation is still
9466 * ZF: simplification automatically cancels common terms in arithmetic
9467 expressions over nat and int;
9469 * ZF: new treatment of nat to minimize type-checking: all operators
9470 coerce their operands to a natural number using the function natify,
9471 making the algebraic laws unconditional;
9473 * ZF: as above, for int: operators coerce their operands to an integer
9474 using the function intify;
9476 * ZF: the integer library now contains many of the usual laws for the
9477 orderings, including $<=, and monotonicity laws for $+ and $*;
9479 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
9482 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
9483 to the simplifier and classical reasoner simultaneously;
9488 * Provers: blast_tac now handles actual object-logic rules as
9489 assumptions; note that auto_tac uses blast_tac internally as well;
9491 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
9492 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
9494 * Provers: delrules now handles destruct rules as well (no longer need
9495 explicit make_elim);
9497 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
9498 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
9499 use instead the strong form,
9500 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
9501 in HOL, FOL and ZF the function cla_make_elim will create such rules
9502 from destruct-rules;
9504 * Provers: Simplifier.easy_setup provides a fast path to basic
9505 Simplifier setup for new object-logics;
9507 * Pure: AST translation rules no longer require constant head on LHS;
9509 * Pure: improved name spaces: ambiguous output is qualified; support
9510 for hiding of names;
9512 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
9513 XSYMBOL_HOME; no longer need to do manual configuration in most
9516 * system: compression of ML heaps images may now be controlled via -c
9517 option of isabelle and isatool usedir (currently only observed by
9520 * system: isatool installfonts may handle X-Symbol fonts as well (very
9521 useful for remote X11);
9523 * system: provide TAGS file for Isabelle sources;
9525 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
9528 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
9529 timing flag supersedes proof_timing and Toplevel.trace;
9531 * ML: new combinators |>> and |>>> for incremental transformations
9532 with secondary results (e.g. certain theory extensions):
9534 * ML: PureThy.add_defs gets additional argument to indicate potential
9535 overloading (usually false);
9537 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
9542 New in Isabelle99 (October 1999)
9543 --------------------------------
9545 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9547 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
9548 are no longer simplified. (This allows the simplifier to unfold recursive
9549 functional programs.) To restore the old behaviour, declare
9551 Delcongs [if_weak_cong];
9553 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
9556 * HOL: the predicate "inj" is now defined by translation to "inj_on";
9558 * HOL/datatype: mutual_induct_tac no longer exists --
9559 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
9561 * HOL/typedef: fixed type inference for representing set; type
9562 arguments now have to occur explicitly on the rhs as type constraints;
9564 * ZF: The con_defs part of an inductive definition may no longer refer
9565 to constants declared in the same theory;
9567 * HOL, ZF: the function mk_cases, generated by the inductive
9568 definition package, has lost an argument. To simplify its result, it
9569 uses the default simpset instead of a supplied list of theorems.
9571 * HOL/List: the constructors of type list are now Nil and Cons;
9573 * Simplifier: the type of the infix ML functions
9574 setSSolver addSSolver setSolver addSolver
9575 is now simpset * solver -> simpset where `solver' is a new abstract type
9576 for packaging solvers. A solver is created via
9577 mk_solver: string -> (thm list -> int -> tactic) -> solver
9578 where the string argument is only a comment.
9583 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
9584 decision procedure for linear arithmetic. Currently it is used for
9585 types `nat', `int', and `real' in HOL (see below); it can, should and
9586 will be instantiated for other types and logics as well.
9588 * The simplifier now accepts rewrite rules with flexible heads, eg
9589 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
9590 They are applied like any rule with a non-pattern lhs, i.e. by first-order
9596 * New Isabelle/Isar subsystem provides an alternative to traditional
9597 tactical theorem proving; together with the ProofGeneral/isar user
9598 interface it offers an interactive environment for developing human
9599 readable proof documents (Isar == Intelligible semi-automated
9600 reasoning); for further information see isatool doc isar-ref,
9601 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
9603 * improved and simplified presentation of theories: better HTML markup
9604 (including colors), graph views in several sizes; isatool usedir now
9605 provides a proper interface for user theories (via -P option); actual
9606 document preparation based on (PDF)LaTeX is available as well (for
9607 new-style theories only); see isatool doc system for more information;
9609 * native support for Proof General, both for classic Isabelle and
9612 * ML function thm_deps visualizes dependencies of theorems and lemmas,
9613 using the graph browser tool;
9615 * Isabelle manuals now also available as PDF;
9617 * theory loader rewritten from scratch (may not be fully
9618 bug-compatible); old loadpath variable has been replaced by show_path,
9619 add_path, del_path, reset_path functions; new operations such as
9620 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
9623 * improved isatool install: option -k creates KDE application icon,
9624 option -p DIR installs standalone binaries;
9626 * added ML_PLATFORM setting (useful for cross-platform installations);
9627 more robust handling of platform specific ML images for SML/NJ;
9629 * the settings environment is now statically scoped, i.e. it is never
9630 created again in sub-processes invoked from isabelle, isatool, or
9633 * path element specification '~~' refers to '$ISABELLE_HOME';
9635 * in locales, the "assumes" and "defines" parts may be omitted if
9638 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
9641 * new print_mode "HTML";
9643 * new flag show_tags controls display of tags of theorems (which are
9644 basically just comments that may be attached by some tools);
9646 * Isamode 2.6 requires patch to accomodate change of Isabelle font
9647 mode and goal output format:
9649 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
9651 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
9653 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
9654 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
9656 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
9658 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
9660 * function bind_thms stores lists of theorems (cf. bind_thm);
9662 * new shorthand tactics ftac, eatac, datac, fatac;
9664 * qed (and friends) now accept "" as result name; in that case the
9665 theorem is not stored, but proper checks and presentation of the
9668 * theorem database now also indexes constants "Trueprop", "all",
9669 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
9674 ** HOL arithmetic **
9676 * There are now decision procedures for linear arithmetic over nat and
9679 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
9680 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
9681 are treated as atomic; subformulae not involving type `nat' or `int'
9682 are ignored; quantified subformulae are ignored unless they are
9683 positive universal or negative existential. The tactic has to be
9684 invoked by hand and can be a little bit slow. In particular, the
9685 running time is exponential in the number of occurrences of `min' and
9686 `max', and `-' on `nat'.
9688 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
9689 (negated) (in)equalities among the premises and the conclusion into
9690 account (i.e. no compound formulae) and does not know about `min' and
9691 `max', and `-' on `nat'. It is fast and is used automatically by the
9694 NB: At the moment, these decision procedures do not cope with mixed
9695 nat/int formulae where the two parts interact, such as `m < n ==>
9698 * HOL/Numeral provides a generic theory of numerals (encoded
9699 efficiently as bit strings); setup for types nat/int/real is in place;
9700 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
9701 int, existing theories and proof scripts may require a few additional
9704 * integer division and remainder can now be performed on constant
9707 * many properties of integer multiplication, division and remainder
9710 * An interface to the Stanford Validity Checker (SVC) is available through the
9711 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
9712 are proved automatically. SVC must be installed separately, and its results
9713 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
9714 invocation of the underlying oracle). For SVC see
9715 http://verify.stanford.edu/SVC
9717 * IsaMakefile: the HOL-Real target now builds an actual image;
9722 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
9723 (in Isabelle/Isar) -- by Gertrud Bauer;
9725 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
9726 analysis for assembly languages with subtypes;
9728 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
9729 -- avoids syntactic ambiguities and treats state, transition, and
9730 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
9731 changed syntax and (many) tactics;
9733 * HOL/inductive: Now also handles more general introduction rules such
9734 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
9735 theorems are now maintained within the theory (maintained via the
9738 * HOL/datatype: Now also handles arbitrarily branching datatypes
9739 (using function types) such as
9741 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
9743 * HOL/record: record_simproc (part of the default simpset) takes care
9744 of selectors applied to updated records; record_split_tac is no longer
9745 part of the default claset; update_defs may now be removed from the
9746 simpset in many cases; COMPATIBILITY: old behavior achieved by
9748 claset_ref () := claset() addSWrapper record_split_wrapper;
9749 Delsimprocs [record_simproc]
9751 * HOL/typedef: fixed type inference for representing set; type
9752 arguments now have to occur explicitly on the rhs as type constraints;
9754 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
9755 names rather than an ML expression;
9757 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
9758 supplied later. Program schemes can be defined, such as
9759 "While B C s = (if B s then While B C (C s) else s)"
9760 where the well-founded relation can be chosen after B and C have been given.
9762 * HOL/List: the constructors of type list are now Nil and Cons;
9763 INCOMPATIBILITY: while [] and infix # syntax is still there, of
9764 course, ML tools referring to List.list.op # etc. have to be adapted;
9766 * HOL_quantifiers flag superseded by "HOL" print mode, which is
9767 disabled by default; run isabelle with option -m HOL to get back to
9768 the original Gordon/HOL-style output;
9770 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
9771 ALL x<=y. P, EX x<y. P, EX x<=y. P;
9773 * HOL basic syntax simplified (more orthogonal): all variants of
9774 All/Ex now support plain / symbolic / HOL notation; plain syntax for
9775 Eps operator is provided as well: "SOME x. P[x]";
9777 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
9779 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
9780 thus available for user theories;
9782 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
9783 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
9786 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
9787 several times and then mp;
9792 * the notation <<...>> is now available as a notation for sequences of
9795 * the simplifier is now installed
9797 * the axiom system has been generalized (thanks to Soren Heilmann)
9799 * the classical reasoner now has a default rule database
9804 * new primrec section allows primitive recursive functions to be given
9805 directly (as in HOL) over datatypes and the natural numbers;
9807 * new tactics induct_tac and exhaust_tac for induction (or case
9808 analysis) over datatypes and the natural numbers;
9810 * the datatype declaration of type T now defines the recursor T_rec;
9812 * simplification automatically does freeness reasoning for datatype
9815 * automatic type-inference, with AddTCs command to insert new
9816 type-checking rules;
9818 * datatype introduction rules are now added as Safe Introduction rules
9821 * the syntax "if P then x else y" is now available in addition to
9825 *** Internal programming interfaces ***
9827 * tuned simplifier trace output; new flag debug_simp;
9829 * structures Vartab / Termtab (instances of TableFun) offer efficient
9830 tables indexed by indexname_ord / term_ord (compatible with aconv);
9832 * AxClass.axclass_tac lost the theory argument;
9834 * tuned current_goals_markers semantics: begin / end goal avoids
9835 printing empty lines;
9837 * removed prs and prs_fn hook, which was broken because it did not
9838 include \n in its semantics, forcing writeln to add one
9839 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
9840 string -> unit if you really want to output text without newline;
9842 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
9843 plain output, interface builders may have to enable 'isabelle_font'
9844 mode to get Isabelle font glyphs as before;
9846 * refined token_translation interface; INCOMPATIBILITY: output length
9847 now of type real instead of int;
9849 * theory loader actions may be traced via new ThyInfo.add_hook
9850 interface (see src/Pure/Thy/thy_info.ML); example application: keep
9851 your own database of information attached to *whole* theories -- as
9852 opposed to intra-theory data slots offered via TheoryDataFun;
9854 * proper handling of dangling sort hypotheses (at last!);
9855 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
9856 extra sort hypotheses that can be witnessed from the type signature;
9857 the force_strip_shyps flag is gone, any remaining shyps are simply
9858 left in the theorem (with a warning issued by strip_shyps_warning);
9862 New in Isabelle98-1 (October 1998)
9863 ----------------------------------
9865 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9867 * several changes of automated proof tools;
9869 * HOL: major changes to the inductive and datatype packages, including
9870 some minor incompatibilities of theory syntax;
9872 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
9875 * HOL: removed duplicate thms in Arith:
9876 less_imp_add_less should be replaced by trans_less_add1
9877 le_imp_add_le should be replaced by trans_le_add1
9879 * HOL: unary minus is now overloaded (new type constraints may be
9882 * HOL and ZF: unary minus for integers is now #- instead of #~. In
9883 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
9884 now taken as an integer constant.
9886 * Pure: ML function 'theory_of' renamed to 'theory';
9892 1. Asm_full_simp_tac is now more aggressive.
9893 1. It will sometimes reorient premises if that increases their power to
9895 2. It does no longer proceed strictly from left to right but may also
9896 rotate premises to achieve further simplification.
9897 For compatibility reasons there is now Asm_lr_simp_tac which is like the
9898 old Asm_full_simp_tac in that it does not rotate premises.
9899 2. The simplifier now knows a little bit about nat-arithmetic.
9901 * Classical reasoner: wrapper mechanism for the classical reasoner now
9902 allows for selected deletion of wrappers, by introduction of names for
9903 wrapper functionals. This implies that addbefore, addSbefore,
9904 addaltern, and addSaltern now take a pair (name, tactic) as argument,
9905 and that adding two tactics with the same name overwrites the first
9906 one (emitting a warning).
9907 type wrapper = (int -> tactic) -> (int -> tactic)
9908 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
9909 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
9910 delWrapper, delSWrapper: claset * string -> claset
9911 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
9913 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
9914 semantics; addbefore now affects only the unsafe part of step_tac
9915 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
9916 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
9919 * Classical reasoner: setwrapper to setWrapper and compwrapper to
9920 compWrapper; added safe wrapper (and access functions for it);
9922 * HOL/split_all_tac is now much faster and fails if there is nothing
9923 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
9924 and the names of the automatically generated variables have changed.
9925 split_all_tac has moved within claset() from unsafe wrappers to safe
9926 wrappers, which means that !!-bound variables are split much more
9927 aggressively, and safe_tac and clarify_tac now split such variables.
9928 If this splitting is not appropriate, use delSWrapper "split_all_tac".
9929 Note: the same holds for record_split_tac, which does the job of
9930 split_all_tac for record fields.
9932 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
9933 permanently to the default simpset using Addsplits just like
9934 Addsimps. They can be removed via Delsplits just like
9935 Delsimps. Lower-case versions are also available.
9937 * HOL/Simplifier: The rule split_if is now part of the default
9938 simpset. This means that the simplifier will eliminate all occurrences
9939 of if-then-else in the conclusion of a goal. To prevent this, you can
9940 either remove split_if completely from the default simpset by
9941 `Delsplits [split_if]' or remove it in a specific call of the
9942 simplifier using `... delsplits [split_if]'. You can also add/delete
9943 other case splitting rules to/from the default simpset: every datatype
9944 generates suitable rules `split_t_case' and `split_t_case_asm' (where
9945 t is the name of the datatype).
9947 * Classical reasoner / Simplifier combination: new force_tac (and
9948 derivatives Force_tac, force) combines rewriting and classical
9949 reasoning (and whatever other tools) similarly to auto_tac, but is
9950 aimed to solve the given subgoal completely.
9955 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
9956 and `goalw': the theory is no longer needed as an explicit argument -
9957 the current theory context is used; assumptions are no longer returned
9958 at the ML-level unless one of them starts with ==> or !!; it is
9959 recommended to convert to these new commands using isatool fixgoal
9960 (backup your sources first!);
9962 * new top-level commands 'thm' and 'thms' for retrieving theorems from
9963 the current theory context, and 'theory' to lookup stored theories;
9965 * new theory section 'locale' for declaring constants, assumptions and
9966 definitions that have local scope;
9968 * new theory section 'nonterminals' for purely syntactic types;
9970 * new theory section 'setup' for generic ML setup functions
9971 (e.g. package initialization);
9973 * the distribution now includes Isabelle icons: see
9974 lib/logo/isabelle-{small,tiny}.xpm;
9976 * isatool install - install binaries with absolute references to
9979 * isatool logo -- create instances of the Isabelle logo (as EPS);
9981 * print mode 'emacs' reserved for Isamode;
9983 * support multiple print (ast) translations per constant name;
9985 * theorems involving oracles are now printed with a suffixed [!];
9990 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
9992 * HOL/inductive package reorganized and improved: now supports mutual
9998 oddI "n : EVEN ==> Suc n : ODD"
9999 evenI "n : ODD ==> Suc n : EVEN"
10001 new theorem list "elims" contains an elimination rule for each of the
10002 recursive sets; inductive definitions now handle disjunctive premises
10003 correctly (also ZF);
10005 INCOMPATIBILITIES: requires Inductive as an ancestor; component
10006 "mutual_induct" no longer exists - the induction rule is always
10007 contained in "induct";
10010 * HOL/datatype package re-implemented and greatly improved: now
10011 supports mutually recursive datatypes such as
10014 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
10015 | SUM ('a aexp) ('a aexp)
10016 | DIFF ('a aexp) ('a aexp)
10019 'a bexp = LESS ('a aexp) ('a aexp)
10020 | AND ('a bexp) ('a bexp)
10021 | OR ('a bexp) ('a bexp)
10023 as well as indirectly recursive datatypes such as
10026 ('a, 'b) term = Var 'a
10027 | App 'b ((('a, 'b) term) list)
10029 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
10030 induction on mutually / indirectly recursive datatypes.
10032 Primrec equations are now stored in theory and can be accessed via
10033 <function_name>.simps.
10037 - Theories using datatypes must now have theory Datatype as an
10039 - The specific <typename>.induct_tac no longer exists - use the
10040 generic induct_tac instead.
10041 - natE has been renamed to nat.exhaust - use exhaust_tac
10042 instead of res_inst_tac ... natE. Note that the variable
10043 names in nat.exhaust differ from the names in natE, this
10044 may cause some "fragile" proofs to fail.
10045 - The theorems split_<typename>_case and split_<typename>_case_asm
10046 have been renamed to <typename>.split and <typename>.split_asm.
10047 - Since default sorts of type variables are now handled correctly,
10048 some datatype definitions may have to be annotated with explicit
10050 - Primrec definitions no longer require function name and type
10051 of recursive argument.
10053 Consider using isatool fixdatatype to adapt your theories and proof
10054 scripts to the new package (backup your sources first!).
10057 * HOL/record package: considerably improved implementation; now
10058 includes concrete syntax for record types, terms, updates; theorems
10059 for surjective pairing and splitting !!-bound record variables; proof
10060 support is as follows:
10062 1) standard conversions (selectors or updates applied to record
10063 constructor terms) are part of the standard simpset;
10065 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
10066 made part of standard simpset and claset via addIffs;
10068 3) a tactic for record field splitting (record_split_tac) is part of
10069 the standard claset (addSWrapper);
10071 To get a better idea about these rules you may retrieve them via
10072 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
10073 the name of your record type.
10075 The split tactic 3) conceptually simplifies by the following rule:
10077 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
10079 Thus any record variable that is bound by meta-all will automatically
10080 blow up into some record constructor term, consequently the
10081 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
10082 solve record problems automatically.
10085 * reorganized the main HOL image: HOL/Integ and String loaded by
10086 default; theory Main includes everything;
10088 * automatic simplification of integer sums and comparisons, using cancellation;
10090 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
10092 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
10094 * many new identities for unions, intersections, set difference, etc.;
10096 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
10097 called split_if, split_split, split_sum_case and split_nat_case (to go
10098 with add/delsplits);
10100 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
10101 (?x::unit) = (); this is made part of the default simpset, which COULD
10102 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
10103 'Delsimprocs [unit_eq_proc];' as last resort); also note that
10104 unit_abs_eta_conv is added in order to counter the effect of
10105 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
10108 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
10111 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
10112 It and 'sym RS equals0D' are now in the default claset, giving automatic
10113 disjointness reasoning but breaking a few old proofs.
10115 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
10116 to 'converse' from 'inverse' (for compatibility with ZF and some
10119 * HOL/recdef can now declare non-recursive functions, with {} supplied as
10120 the well-founded relation;
10122 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
10123 Compl A. The "Compl" syntax remains available as input syntax for this
10126 * HOL/Update: new theory of function updates:
10127 f(a:=b) == %x. if x=a then b else f x
10128 may also be iterated as in f(a:=b,c:=d,...);
10130 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
10133 - new function list_update written xs[i:=v] that updates the i-th
10134 list position. May also be iterated as in xs[i:=a,j:=b,...].
10135 - new function `upt' written [i..j(] which generates the list
10136 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
10137 bound write [i..j], which is a shorthand for [i..j+1(].
10138 - new lexicographic orderings and corresponding wellfoundedness theorems.
10141 - removed 'pred' (predecessor) function;
10142 - generalized some theorems about n-1;
10143 - many new laws about "div" and "mod";
10144 - new laws about greatest common divisors (see theory ex/Primes);
10146 * HOL/Relation: renamed the relational operator r^-1 "converse"
10147 instead of "inverse";
10149 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
10150 of the multiset ordering;
10152 * directory HOL/Real: a construction of the reals using Dedekind cuts
10153 (not included by default);
10155 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
10157 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
10158 programs, i.e. different program variables may have different types.
10160 * calling (stac rew i) now fails if "rew" has no effect on the goal
10161 [previously, this check worked only if the rewrite rule was unconditional]
10162 Now rew can involve either definitions or equalities (either == or =).
10167 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
10168 only the theorems proved on ZF.ML;
10170 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
10171 It and 'sym RS equals0D' are now in the default claset, giving automatic
10172 disjointness reasoning but breaking a few old proofs.
10174 * ZF/Update: new theory of function updates
10175 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
10176 may also be iterated as in f(a:=b,c:=d,...);
10178 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
10180 * calling (stac rew i) now fails if "rew" has no effect on the goal
10181 [previously, this check worked only if the rewrite rule was unconditional]
10182 Now rew can involve either definitions or equalities (either == or =).
10184 * case_tac provided for compatibility with HOL
10185 (like the old excluded_middle_tac, but with subgoals swapped)
10188 *** Internal programming interfaces ***
10190 * Pure: several new basic modules made available for general use, see
10191 also src/Pure/README;
10193 * improved the theory data mechanism to support encapsulation (data
10194 kind name replaced by private Object.kind, acting as authorization
10195 key); new type-safe user interface via functor TheoryDataFun; generic
10196 print_data function becomes basically useless;
10198 * removed global_names compatibility flag -- all theory declarations
10199 are qualified by default;
10201 * module Pure/Syntax now offers quote / antiquote translation
10202 functions (useful for Hoare logic etc. with implicit dependencies);
10203 see HOL/ex/Antiquote for an example use;
10205 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
10208 * new tactical CHANGED_GOAL for checking that a tactic modifies a
10211 * Display.print_goals function moved to Locale.print_goals;
10213 * standard print function for goals supports current_goals_markers
10214 variable for marking begin of proof, end of proof, start of goal; the
10215 default is ("", "", ""); setting current_goals_markers := ("<proof>",
10216 "</proof>", "<goal>") causes SGML like tagged proof state printing,
10221 New in Isabelle98 (January 1998)
10222 --------------------------------
10224 *** Overview of INCOMPATIBILITIES (see below for more details) ***
10226 * changed lexical syntax of terms / types: dots made part of long
10227 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
10229 * simpset (and claset) reference variable replaced by functions
10230 simpset / simpset_ref;
10232 * no longer supports theory aliases (via merge) and non-trivial
10233 implicit merge of thms' signatures;
10235 * most internal names of constants changed due to qualified names;
10237 * changed Pure/Sequence interface (see Pure/seq.ML);
10240 *** General Changes ***
10242 * hierachically structured name spaces (for consts, types, axms, thms
10243 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
10244 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
10245 isatool fixdots ensures space after dots (e.g. "%x. x"); set
10246 long_names for fully qualified output names; NOTE: ML programs
10247 (special tactics, packages etc.) referring to internal names may have
10248 to be adapted to cope with fully qualified names; in case of severe
10249 backward campatibility problems try setting 'global_names' at compile
10250 time to have enrything declared within a flat name space; one may also
10251 fine tune name declarations in theories via the 'global' and 'local'
10254 * reimplemented the implicit simpset and claset using the new anytype
10255 data filed in signatures; references simpset:simpset ref etc. are
10256 replaced by functions simpset:unit->simpset and
10257 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
10258 to patch your ML files accordingly;
10260 * HTML output now includes theory graph data for display with Java
10261 applet or isatool browser; data generated automatically via isatool
10262 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
10264 * defs may now be conditional; improved rewrite_goals_tac to handle
10265 conditional equations;
10267 * defs now admits additional type arguments, using TYPE('a) syntax;
10269 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
10270 creates a new theory node; implicit merge of thms' signatures is
10271 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
10272 transfer:theory->thm->thm in (rare) cases;
10274 * improved handling of draft signatures / theories; draft thms (and
10275 ctyps, cterms) are automatically promoted to real ones;
10277 * slightly changed interfaces for oracles: admit many per theory, named
10278 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
10280 * print_goals: optional output of const types (set show_consts and
10283 * improved output of warnings (###) and errors (***);
10285 * subgoal_tac displays a warning if the new subgoal has type variables;
10287 * removed old README and Makefiles;
10289 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
10291 * removed obsolete init_pps and init_database;
10293 * deleted the obsolete tactical STATE, which was declared by
10294 fun STATE tacfun st = tacfun st st;
10296 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
10297 (which abbreviates $HOME);
10299 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
10300 use isatool fixseq to adapt your ML programs (this works for fully
10301 qualified references to the Sequence structure only!);
10303 * use_thy no longer requires writable current directory; it always
10304 reloads .ML *and* .thy file, if either one is out of date;
10307 *** Classical Reasoner ***
10309 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
10310 tactics that use classical reasoning to simplify a subgoal without
10311 splitting it into several subgoals;
10313 * Safe_tac: like safe_tac but uses the default claset;
10318 * added simplification meta rules:
10319 (asm_)(full_)simplify: simpset -> thm -> thm;
10321 * simplifier.ML no longer part of Pure -- has to be loaded by object
10324 * added prems argument to simplification procedures;
10326 * HOL, FOL, ZF: added infix function `addsplits':
10327 instead of `<simpset> setloop (split_tac <thms>)'
10328 you can simply write `<simpset> addsplits <thms>'
10333 * TYPE('a) syntax for type reflection terms;
10335 * no longer handles consts with name "" -- declare as 'syntax' instead;
10337 * pretty printer: changed order of mixfix annotation preference (again!);
10339 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
10344 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
10345 with `addloop' of the simplifier to faciliate case splitting in premises.
10347 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
10349 * HOL/Auth: new protocol proofs including some for the Internet
10352 * HOL/Map: new theory of `maps' a la VDM;
10354 * HOL/simplifier: simplification procedures nat_cancel_sums for
10355 cancelling out common nat summands from =, <, <= (in)equalities, or
10356 differences; simplification procedures nat_cancel_factor for
10357 cancelling common factor from =, <, <= (in)equalities over natural
10358 sums; nat_cancel contains both kinds of procedures, it is installed by
10359 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
10361 * HOL/simplifier: terms of the form
10362 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
10364 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
10365 and those of the form
10366 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
10368 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
10371 Each datatype `t' now comes with a theorem `split_t_case' of the form
10373 P(t_case f1 ... fn x) =
10374 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
10376 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
10379 and a theorem `split_t_case_asm' of the form
10381 P(t_case f1 ... fn x) =
10382 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
10384 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
10386 which can be added to a simpset via `addsplits'. The existing theorems
10387 expand_list_case and expand_option_case have been renamed to
10388 split_list_case and split_option_case.
10391 - `pred n' is automatically converted to `n-1'.
10392 Users are strongly encouraged not to use `pred' any longer,
10393 because it will disappear altogether at some point.
10394 - Users are strongly encouraged to write "0 < n" rather than
10395 "n ~= 0". Theorems and proof tools have been modified towards this
10399 the function "set_of_list" has been renamed "set" (and its theorems too);
10400 the function "nth" now takes its arguments in the reverse order and
10401 has acquired the infix notation "!" as in "xs!n".
10403 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
10405 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
10406 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
10408 * HOL/record: extensible records with schematic structural subtyping
10409 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
10410 still lacks various theorems and concrete record syntax;
10415 * removed "axioms" and "generated by" sections;
10417 * replaced "ops" section by extended "consts" section, which is capable of
10418 handling the continuous function space "->" directly;
10421 . proves theorems immediately and stores them in the theory,
10422 . creates hierachical name space,
10423 . now uses normal mixfix annotations (instead of cinfix...),
10424 . minor changes to some names and values (for consistency),
10425 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
10426 . separator between mutual domain defs: changed "," to "and",
10427 . improved handling of sort constraints; now they have to
10428 appear on the left-hand side of the equations only;
10430 * fixed LAM <x,y,zs>.b syntax;
10432 * added extended adm_tac to simplifier in HOLCF -- can now discharge
10433 adm (%x. P (t x)), where P is chainfinite and t continuous;
10438 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
10439 with `addloop' of the simplifier to faciliate case splitting in premises.
10441 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
10442 in HOL, they strip ALL and --> from proved theorems;
10446 New in Isabelle94-8 (May 1997)
10447 ------------------------------
10449 *** General Changes ***
10451 * new utilities to build / run / maintain Isabelle etc. (in parts
10452 still somewhat experimental); old Makefiles etc. still functional;
10454 * new 'Isabelle System Manual';
10456 * INSTALL text, together with ./configure and ./build scripts;
10458 * reimplemented type inference for greater efficiency, better error
10459 messages and clean internal interface;
10461 * prlim command for dealing with lots of subgoals (an easier way of
10462 setting goals_limit);
10467 * supports alternative (named) syntax tables (parser and pretty
10468 printer); internal interface is provided by add_modesyntax(_i);
10470 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
10471 be used in conjunction with the Isabelle symbol font; uses the
10472 "symbols" syntax table;
10474 * added token_translation interface (may translate name tokens in
10475 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
10476 the current print_mode); IMPORTANT: user print translation functions
10477 are responsible for marking newly introduced bounds
10478 (Syntax.mark_boundT);
10480 * token translations for modes "xterm" and "xterm_color" that display
10481 names in bold, underline etc. or colors (which requires a color
10484 * infixes may now be declared with names independent of their syntax;
10486 * added typed_print_translation (like print_translation, but may
10487 access type of constant);
10490 *** Classical Reasoner ***
10492 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
10493 some limitations. Blast_tac...
10494 + ignores addss, addbefore, addafter; this restriction is intrinsic
10495 + ignores elimination rules that don't have the correct format
10496 (the conclusion MUST be a formula variable)
10497 + ignores types, which can make HOL proofs fail
10498 + rules must not require higher-order unification, e.g. apply_type in ZF
10499 [message "Function Var's argument not a bound variable" relates to this]
10500 + its proof strategy is more general but can actually be slower
10502 * substitution with equality assumptions no longer permutes other
10505 * minor changes in semantics of addafter (now called addaltern); renamed
10506 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
10507 (and access functions for it);
10509 * improved combination of classical reasoner and simplifier:
10510 + functions for handling clasimpsets
10511 + improvement of addss: now the simplifier is called _after_ the
10513 + safe variant of addss called addSss: uses safe simplifications
10514 _during_ the safe steps. It is more complete as it allows multiple
10515 instantiations of unknowns (e.g. with slow_tac).
10519 * added interface for simplification procedures (functions that
10520 produce *proven* rewrite rules on the fly, depending on current
10523 * ordering on terms as parameter (used for ordered rewriting);
10525 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
10527 * the solver is now split into a safe and an unsafe part.
10528 This should be invisible for the normal user, except that the
10529 functions setsolver and addsolver have been renamed to setSolver and
10530 addSolver; added safe_asm_full_simp_tac;
10535 * a generic induction tactic `induct_tac' which works for all datatypes and
10536 also for type `nat';
10538 * a generic case distinction tactic `exhaust_tac' which works for all
10539 datatypes and also for type `nat';
10541 * each datatype comes with a function `size';
10543 * patterns in case expressions allow tuple patterns as arguments to
10544 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
10546 * primrec now also works with type nat;
10548 * recdef: a new declaration form, allows general recursive functions to be
10549 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
10551 * the constant for negation has been renamed from "not" to "Not" to
10552 harmonize with FOL, ZF, LK, etc.;
10554 * HOL/ex/LFilter theory of a corecursive "filter" functional for
10557 * HOL/Modelcheck demonstrates invocation of model checker oracle;
10559 * HOL/ex/Ring.thy declares cring_simp, which solves equational
10560 problems in commutative rings, using axiomatic type classes for + and *;
10562 * more examples in HOL/MiniML and HOL/Auth;
10564 * more default rewrite rules for quantifiers, union/intersection;
10566 * a new constant `arbitrary == @x.False';
10568 * HOLCF/IOA replaces old HOL/IOA;
10570 * HOLCF changes: derived all rules and arities
10571 + axiomatic type classes instead of classes
10572 + typedef instead of faking type definitions
10573 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
10574 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
10575 + eliminated the types void, one, tr
10576 + use unit lift and bool lift (with translations) instead of one and tr
10577 + eliminated blift from Lift3.thy (use Def instead of blift)
10578 all eliminated rules are derived as theorems --> no visible changes ;
10583 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
10584 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
10585 as ZF_cs addSIs [equalityI];
10589 New in Isabelle94-7 (November 96)
10590 ---------------------------------
10592 * allowing negative levels (as offsets) in prlev and choplev;
10594 * super-linear speedup for large simplifications;
10596 * FOL, ZF and HOL now use miniscoping: rewriting pushes
10597 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
10598 FAIL); can suppress it using the command Delsimps (ex_simps @
10599 all_simps); De Morgan laws are also now included, by default;
10601 * improved printing of ==> : ~:
10603 * new object-logic "Sequents" adds linear logic, while replacing LK
10604 and Modal (thanks to Sara Kalvala);
10606 * HOL/Auth: correctness proofs for authentication protocols;
10608 * HOL: new auto_tac combines rewriting and classical reasoning (many
10609 examples on HOL/Auth);
10611 * HOL: new command AddIffs for declaring theorems of the form P=Q to
10612 the rewriter and classical reasoner simultaneously;
10614 * function uresult no longer returns theorems in "standard" format;
10615 regain previous version by: val uresult = standard o uresult;
10619 New in Isabelle94-6
10620 -------------------
10622 * oracles -- these establish an interface between Isabelle and trusted
10623 external reasoners, which may deliver results as theorems;
10625 * proof objects (in particular record all uses of oracles);
10627 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
10629 * "constdefs" section in theory files;
10631 * "primrec" section (HOL) no longer requires names;
10633 * internal type "tactic" now simply "thm -> thm Sequence.seq";
10637 New in Isabelle94-5
10638 -------------------
10640 * reduced space requirements;
10642 * automatic HTML generation from theories;
10644 * theory files no longer require "..." (quotes) around most types;
10646 * new examples, including two proofs of the Church-Rosser theorem;
10648 * non-curried (1994) version of HOL is no longer distributed;
10652 New in Isabelle94-4
10653 -------------------
10655 * greatly reduced space requirements;
10657 * theory files (.thy) no longer require \...\ escapes at line breaks;
10659 * searchable theorem database (see the section "Retrieving theorems" on
10660 page 8 of the Reference Manual);
10662 * new examples, including Grabczewski's monumental case study of the
10665 * The previous version of HOL renamed to Old_HOL;
10667 * The new version of HOL (previously called CHOL) uses a curried syntax
10668 for functions. Application looks like f a b instead of f(a,b);
10670 * Mutually recursive inductive definitions finally work in HOL;
10672 * In ZF, pattern-matching on tuples is now available in all abstractions and
10673 translates to the operator "split";
10677 New in Isabelle94-3
10678 -------------------
10680 * new infix operator, addss, allowing the classical reasoner to
10681 perform simplification at each step of its search. Example:
10682 fast_tac (cs addss ss)
10684 * a new logic, CHOL, the same as HOL, but with a curried syntax
10685 for functions. Application looks like f a b instead of f(a,b). Also pairs
10686 look like (a,b) instead of <a,b>;
10688 * PLEASE NOTE: CHOL will eventually replace HOL!
10690 * In CHOL, pattern-matching on tuples is now available in all abstractions.
10691 It translates to the operator "split". A new theory of integers is available;
10693 * In ZF, integer numerals now denote two's-complement binary integers.
10694 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
10696 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
10697 of the Axiom of Choice;
10701 New in Isabelle94-2
10702 -------------------
10704 * Significantly faster resolution;
10706 * the different sections in a .thy file can now be mixed and repeated
10709 * Database of theorems for FOL, HOL and ZF. New
10710 commands including qed, qed_goal and bind_thm store theorems in the database.
10712 * Simple database queries: return a named theorem (get_thm) or all theorems of
10713 a given theory (thms_of), or find out what theory a theorem was proved in
10716 * Bugs fixed in the inductive definition and datatype packages;
10718 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
10719 and HOL_dup_cs obsolete;
10721 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
10724 * Simpler definition of function space in ZF;
10726 * new results about cardinal and ordinal arithmetic in ZF;
10728 * 'subtype' facility in HOL for introducing new types as subsets of existing
10731 :mode=isabelle-news:wrap=hard:maxLineLen=72: