1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in Isabelle2013-1 (November 2013)
5 -------------------------------------
9 * Discontinued obsolete 'uses' within theory header. Note that
10 commands like 'ML_file' work without separate declaration of file
11 dependencies. Minor INCOMPATIBILITY.
13 * Discontinued redundant 'use' command, which was superseded by
14 'ML_file' in Isabelle2013. Minor INCOMPATIBILITY.
16 * Simplified subscripts within identifiers, using plain \<^sub>
17 instead of the second copy \<^isub> and \<^isup>. Superscripts are
18 only for literal tokens within notation; explicit mixfix annotations
19 for consts or fixed variables may be used as fall-back for unusual
20 names. Obsolete \<twosuperior> has been expanded to \<^sup>2 in
21 Isabelle/HOL. INCOMPATIBILITY, use "isabelle update_sub_sup" to
22 standardize symbols as a starting point for further manual cleanup.
23 The ML reference variable "legacy_isub_isup" may be set as temporary
24 workaround, to make the prover accept a subset of the old identifier
27 * Document antiquotations: term style "isub" has been renamed to
28 "sub". Minor INCOMPATIBILITY.
30 * Uniform management of "quick_and_dirty" as system option (see also
31 "isabelle options"), configuration option within the context (see also
32 Config.get in Isabelle/ML), and attribute in Isabelle/Isar. Minor
33 INCOMPATIBILITY, need to use more official Isabelle means to access
34 quick_and_dirty, instead of historical poking into mutable reference.
36 * Renamed command 'print_configs' to 'print_options'. Minor
39 * Proper diagnostic command 'print_state'. Old 'pr' (with its
40 implicit change of some global references) is retained for now as
41 control command, e.g. for ProofGeneral 3.7.x.
43 * Discontinued 'print_drafts' command with its old-fashioned PS output
44 and Unix command-line print spooling. Minor INCOMPATIBILITY: use
45 'display_drafts' instead and print via the regular document viewer.
47 * Updated and extended "isar-ref" and "implementation" manual,
48 eliminated old "ref" manual.
51 *** Prover IDE -- Isabelle/Scala/jEdit ***
53 * New manual "jedit" for Isabelle/jEdit, see isabelle doc or
56 * Dockable window "Documentation" provides access to Isabelle
59 * Dockable window "Find" provides query operations for formal entities
60 (GUI front-end to 'find_theorems' command).
62 * Dockable window "Sledgehammer" manages asynchronous / parallel
63 sledgehammer runs over existing document sources, independently of
64 normal editing and checking process.
66 * Dockable window "Timing" provides an overview of relevant command
69 * Improved dockable window "Theories": Continuous checking of proof
70 document (visible and required parts) may be controlled explicitly,
71 using check box or shortcut "C+e ENTER". Individual theory nodes may
72 be marked explicitly as required and checked in full, using check box
73 or shortcut "C+e SPACE".
75 * Improved completion mechanism, which is now managed by the
76 Isabelle/jEdit plugin instead of SideKick. Refined table of Isabelle
77 symbol abbreviations (see $ISABELLE_HOME/etc/symbols).
79 * Standard jEdit keyboard shortcut C+b complete-word is remapped to
80 isabelle.complete for explicit completion in Isabelle sources.
81 INCOMPATIBILITY wrt. jEdit defaults, may have to invent new shortcuts
84 * Improved support of various "minor modes" for Isabelle NEWS,
85 options, session ROOT etc., with completion and SideKick tree view.
87 * Strictly monotonic document update, without premature cancellation of
88 running transactions that are still needed: avoid reset/restart of
89 such command executions while editing.
91 * Support for asynchronous print functions, as overlay to existing
94 * Support for automatic tools in HOL, which try to prove or disprove
95 toplevel theorem statements.
97 * Action isabelle.reset-font-size resets main text area font size
98 according to Isabelle/Scala plugin option "jedit_font_reset_size"
99 (cf. keyboard shortcut C+0).
101 * File specifications in jEdit (e.g. file browser) may refer to
102 $ISABELLE_HOME on all platforms. Discontinued obsolete
103 $ISABELLE_HOME_WINDOWS variable.
105 * Improved support for Linux look-and-feel "GTK+", see also "Utilities
106 / Global Options / Appearance".
108 * Improved support of native Mac OS X functionality via "MacOSX"
109 plugin, which is now enabled by default.
114 * Commands 'interpretation' and 'sublocale' are now target-sensitive.
115 In particular, 'interpretation' allows for non-persistent
116 interpretation within "context ... begin ... end" blocks offering a
117 light-weight alternative to 'sublocale'. See "isar-ref" manual for
120 * Improved locales diagnostic command 'print_dependencies'.
122 * Discontinued obsolete 'axioms' command, which has been marked as
123 legacy since Isabelle2009-2. INCOMPATIBILITY, use 'axiomatization'
124 instead, while observing its uniform scope for polymorphism.
126 * Discontinued empty name bindings in 'axiomatization'.
129 * System option "proofs" has been discontinued. Instead the global
130 state of Proofterm.proofs is persistently compiled into logic images
131 as required, notably HOL-Proofs. Users no longer need to change
132 Proofterm.proofs dynamically. Minor INCOMPATIBILITY.
134 * Syntax translation functions (print_translation etc.) always depend
135 on Proof.context. Discontinued former "(advanced)" option -- this is
136 now the default. Minor INCOMPATIBILITY.
138 * Former global reference trace_unify_fail is now available as
139 configuration option "unify_trace_failure" (global context only).
141 * SELECT_GOAL now retains the syntactic context of the overall goal
142 state (schematic variables etc.). Potential INCOMPATIBILITY in rare
148 * Stronger precedence of syntax for big intersection and union on
149 sets, in accordance with corresponding lattice operations.
152 * Notation "{p:A. P}" now allows tuple patterns as well.
154 * Nested case expressions are now translated in a separate check phase
155 rather than during parsing. The data for case combinators is separated
156 from the datatype package. The declaration attribute
157 "case_translation" can be used to register new case combinators:
159 declare [[case_translation case_combinator constructor1 ... constructorN]]
162 - 'code_printing' unifies 'code_const' / 'code_type' / 'code_class' /
164 - 'code_identifier' declares name hints for arbitrary identifiers in
165 generated code, subsuming 'code_modulename'.
167 See the isar-ref manual for syntax diagrams, and the HOL theories for
170 * Attibute 'code': 'code' now declares concrete and abstract code
171 equations uniformly. Use explicit 'code equation' and 'code abstract'
172 to distinguish both when desired.
174 * Discontinued theories Code_Integer and Efficient_Nat by a more
175 fine-grain stack of theories Code_Target_Int, Code_Binary_Nat,
176 Code_Target_Nat and Code_Target_Numeral. See the tutorial on code
177 generation for details. INCOMPATIBILITY.
179 * Numeric types are mapped by default to target language numerals:
180 natural (replaces former code_numeral) and integer (replaces former
181 code_int). Conversions are available as integer_of_natural /
182 natural_of_integer / integer_of_nat / nat_of_integer (in HOL) and
183 Code_Numeral.integer_of_natural / Code_Numeral.natural_of_integer (in
184 ML). INCOMPATIBILITY.
186 * Function package: For mutually recursive functions f and g, separate
187 cases rules f.cases and g.cases are generated instead of unusable
188 f_g.cases which exposed internal sum types. Potential INCOMPATIBILITY,
189 in the case that the unusable rule was used nevertheless.
191 * Function package: For each function f, new rules f.elims are
192 generated, which eliminate equalities of the form "f x = t".
194 * New command 'fun_cases' derives ad-hoc elimination rules for
195 function equations as simplified instances of f.elims, analogous to
196 inductive_cases. See ~~/src/HOL/ex/Fundefs.thy for some examples.
199 - parametrized correspondence relations are now supported:
200 + parametricity theorems for the raw term can be specified in
201 the command lift_definition, which allow us to generate stronger
203 + setup_lifting generates stronger transfer rules if parametric
204 correspondence relation can be generated
205 + various new properties of the relator must be specified to support
207 + parametricity theorem for the Quotient relation can be specified
208 - setup_lifting generates domain rules for the Transfer package
209 - stronger reflexivity prover of respectfulness theorems for type
211 - ===> and --> are now local. The symbols can be introduced
212 by interpreting the locale lifting_syntax (typically in an
214 - Lifting/Transfer relevant parts of Library/Quotient_* are now in
215 Main. Potential INCOMPATIBILITY
216 - new commands for restoring and deleting Lifting/Transfer context:
217 lifting_forget, lifting_update
218 - the command print_quotmaps was renamed to print_quot_maps.
222 - better support for domains in Transfer: replace Domainp T
223 by the actual invariant in a transferred goal
224 - transfer rules can have as assumptions other transfer rules
225 - Experimental support for transferring from the raw level to the
226 abstract level: Transfer.transferred attribute
227 - Attribute version of the transfer method: untransferred attribute
229 * Reification and reflection:
230 - Reification is now directly available in HOL-Main in structure
232 - Reflection now handles multiple lists with variables also.
233 - The whole reflection stack has been decomposed into conversions.
236 * Revised devices for recursive definitions over finite sets:
237 - Only one fundamental fold combinator on finite set remains:
238 Finite_Set.fold :: ('a => 'b => 'b) => 'b => 'a set => 'b
239 This is now identity on infinite sets.
240 - Locales ("mini packages") for fundamental definitions with
241 Finite_Set.fold: folding, folding_idem.
242 - Locales comm_monoid_set, semilattice_order_set and
243 semilattice_neutr_order_set for big operators on sets.
244 See theory Big_Operators for canonical examples.
245 Note that foundational constants comm_monoid_set.F and
246 semilattice_set.F correspond to former combinators fold_image
247 and fold1 respectively. These are now gone. You may use
248 those foundational constants as substitutes, but it is
249 preferable to interpret the above locales accordingly.
250 - Dropped class ab_semigroup_idem_mult (special case of lattice,
251 no longer needed in connection with Finite_Set.fold etc.)
253 card.union_inter ~> card_Un_Int [symmetric]
254 card.union_disjoint ~> card_Un_disjoint
257 * Locale hierarchy for abstract orderings and (semi)lattices.
259 * Complete_Partial_Order.admissible is defined outside the type class
260 ccpo, but with mandatory prefix ccpo. Admissibility theorems lose the
261 class predicate assumption or sort constraint when possible.
264 * Introduce type class "conditionally_complete_lattice": Like a
265 complete lattice but does not assume the existence of the top and
266 bottom elements. Allows to generalize some lemmas about reals and
267 extended reals. Removed SupInf and replaced it by the instantiation
268 of conditionally_complete_lattice for real. Renamed lemmas about
269 conditionally-complete lattice from Sup_... to cSup_... and from
270 Inf_... to cInf_... to avoid hidding of similar complete lattice
273 * Introduce type class linear_continuum as combination of
274 conditionally-complete lattices and inner dense linorders which have
275 more than one element. INCOMPATIBILITY.
277 * Introduced type classes order_top and order_bot. The old classes top
278 and bot only contain the syntax without assumptions. INCOMPATIBILITY:
279 Rename bot -> order_bot, top -> order_top
281 * Introduce type classes "no_top" and "no_bot" for orderings without
282 top and bottom elements.
284 * Split dense_linorder into inner_dense_order and no_top, no_bot.
286 * Complex_Main: Unify and move various concepts from
287 HOL-Multivariate_Analysis to HOL-Complex_Main.
289 - Introduce type class (lin)order_topology and
290 linear_continuum_topology. Allows to generalize theorems about
291 limits and order. Instances are reals and extended reals.
293 - continuous and continuos_on from Multivariate_Analysis:
294 "continuous" is the continuity of a function at a filter. "isCont"
295 is now an abbrevitation: "isCont x f == continuous (at _) f".
297 Generalized continuity lemmas from isCont to continuous on an
300 - compact from Multivariate_Analysis. Use Bolzano's lemma to prove
301 compactness of closed intervals on reals. Continuous functions
302 attain infimum and supremum on compact sets. The inverse of a
303 continuous function is continuous, when the function is continuous
306 - connected from Multivariate_Analysis. Use it to prove the
307 intermediate value theorem. Show connectedness of intervals on
308 linear_continuum_topology).
310 - first_countable_topology from Multivariate_Analysis. Is used to
311 show equivalence of properties on the neighbourhood filter of x and
312 on all sequences converging to x.
314 - FDERIV: Definition of has_derivative moved to Deriv.thy. Moved
315 theorems from Library/FDERIV.thy to Deriv.thy and base the
316 definition of DERIV on FDERIV. Add variants of DERIV and FDERIV
317 which are restricted to sets, i.e. to represent derivatives from
320 - Removed the within-filter. It is replaced by the principal filter:
322 F within X = inf F (principal X)
324 - Introduce "at x within U" as a single constant, "at x" is now an
325 abbreviation for "at x within UNIV"
327 - Introduce named theorem collections tendsto_intros,
328 continuous_intros, continuous_on_intros and FDERIV_intros. Theorems
329 in tendsto_intros (or FDERIV_intros) are also available as
330 tendsto_eq_intros (or FDERIV_eq_intros) where the right-hand side
331 is replaced by a congruence rule. This allows to apply them as
332 intro rules and then proving equivalence by the simplifier.
334 - Restructured theories in HOL-Complex_Main:
336 + Moved RealDef and RComplete into Real
338 + Introduced Topological_Spaces and moved theorems about
339 topological spaces, filters, limits and continuity to it
341 + Renamed RealVector to Real_Vector_Spaces
343 + Split Lim, SEQ, Series into Topological_Spaces,
344 Real_Vector_Spaces, and Limits
346 + Moved Ln and Log to Transcendental
348 + Moved theorems about continuity from Deriv to Topological_Spaces
350 - Remove various auxiliary lemmas.
356 - Reduce incidence of "too high arity" errors
360 isar_shrink ~> isar_compress
362 - Added options "isar_try0", "spy"
363 - Better support for "isar_proofs"
364 - MaSh has been fined-tuned and now runs as a local server
366 * Improved support for ad hoc overloading of constants (see also
367 isar-ref manual and ~~/src/HOL/ex/Adhoc_Overloading_Examples.thy).
369 * Library/Polynomial.thy:
370 - Use lifting for primitive definitions.
371 - Explicit conversions from and to lists of coefficients, used for
373 - Replaced recursion operator poly_rec by fold_coeffs.
374 - Prefer pre-existing gcd operation for gcd.
376 poly_eq_iff ~> poly_eq_poly_eq_iff
378 expand_poly_eq ~> poly_eq_iff
381 * New Library/Simps_Case_Conv.thy: Provides commands simps_of_case and
382 case_of_simps to convert function definitions between a list of
383 equations with patterns on the lhs and a single equation with case
384 expressions on the rhs. See also Ex/Simps_Case_Conv_Examples.thy.
386 * New Library/FSet.thy: type of finite sets defined as a subtype of
387 sets defined by Lifting/Transfer.
389 * Discontinued theory src/HOL/Library/Eval_Witness. INCOMPATIBILITY.
391 * Consolidation of library theories on product orders:
393 Product_Lattice ~> Product_Order -- pointwise order on products
394 Product_ord ~> Product_Lexorder -- lexicographic order on products
398 * Imperative-HOL: The MREC combinator is considered legacy and no
399 longer included by default. INCOMPATIBILITY, use partial_function
400 instead, or import theory Legacy_Mrec as a fallback.
402 * HOL-Algebra: Discontinued theories ~~/src/HOL/Algebra/abstract and
403 ~~/src/HOL/Algebra/poly. Existing theories should be based on
404 ~~/src/HOL/Library/Polynomial instead. The latter provides
405 integration with HOL's type classes for rings. INCOMPATIBILITY.
408 - Various improvements to BNF-based (co)datatype package, including
409 new commands "primrec_new", "primcorec", and
410 "datatype_new_compat", as well as documentation. See
411 "datatypes.pdf" for details.
412 - New "coinduction" method to avoid some boilerplate (compared to
418 - Renamed many generated theorems, including
420 map_comp' ~> map_comp
430 * Spec_Check is a Quickcheck tool for Isabelle/ML. The ML function
431 "check_property" allows to check specifications of the form "ALL x y
432 z. prop x y z". See also ~~/src/Tools/Spec_Check/ with its
433 Examples.thy in particular.
435 * Improved printing of exception trace in Poly/ML 5.5.1, with regular
436 tracing output in the command transaction context instead of physical
437 stdout. See also Toplevel.debug, Toplevel.debugging and
438 ML_Compiler.exn_trace.
440 * ML type "theory" is now immutable, without any special treatment of
441 drafts or linear updates (which could lead to "stale theory" errors in
442 the past). Discontinued obsolete operations like Theory.copy,
443 Theory.checkpoint, and the auxiliary type theory_ref. Minor
446 * More uniform naming of goal functions for skipped proofs:
448 Skip_Proof.prove ~> Goal.prove_sorry
449 Skip_Proof.prove_global ~> Goal.prove_sorry_global
451 Minor INCOMPATIBILITY.
453 * Simplifier tactics and tools use proper Proof.context instead of
454 historic type simpset. Old-style declarations like addsimps,
455 addsimprocs etc. operate directly on Proof.context. Raw type simpset
456 retains its use as snapshot of the main Simplifier context, using
457 simpset_of and put_simpset on Proof.context. INCOMPATIBILITY -- port
458 old tools by making them depend on (ctxt : Proof.context) instead of
459 (ss : simpset), then turn (simpset_of ctxt) into ctxt.
461 * Modifiers for classical wrappers (e.g. addWrapper, delWrapper)
462 operate on Proof.context instead of claset, for uniformity with addIs,
463 addEs, addDs etc. Note that claset_of and put_claset allow to manage
464 clasets separately from the context.
466 * Discontinued obsolete ML antiquotations @{claset} and @{simpset}.
467 INCOMPATIBILITY, use @{context} instead.
469 * Antiquotation @{theory_context A} is similar to @{theory A}, but
470 presents the result as initial Proof.context.
475 * Discontinued obsolete isabelle usedir, mkdir, make -- superseded by
476 "isabelle build" in Isabelle2013. INCOMPATIBILITY.
478 * Discontinued obsolete isabelle-process options -f and -u (former
479 administrative aliases of option -e). Minor INCOMPATIBILITY.
481 * Discontinued obsolete isabelle print tool, and PRINT_COMMAND
484 * Discontinued ISABELLE_DOC_FORMAT settings variable and historic
485 document formats: dvi.gz, ps, ps.gz -- the default document format is
488 * Isabelle settings variable ISABELLE_BUILD_JAVA_OPTIONS allows to
489 specify global resources of the JVM process run by isabelle build.
491 * Toplevel executable $ISABELLE_HOME/bin/isabelle_scala_script allows
492 to run Isabelle/Scala source files as standalone programs.
494 * Improved "isabelle keywords" tool (for old-style ProofGeneral
495 keyword tables): use Isabelle/Scala operations, which inspect outer
496 syntax without requiring to build sessions first.
498 * Sessions may be organized via 'chapter' specifications in the ROOT
499 file, which determines a two-level hierarchy of browser info. The old
500 tree-like organization via implicit sub-session relation (with its
501 tendency towards erratic fluctuation of URLs) has been discontinued.
502 The default chapter is called "Unsorted". Potential INCOMPATIBILITY
503 for HTML presentation of theories.
507 New in Isabelle2013 (February 2013)
508 -----------------------------------
512 * Theorem status about oracles and unfinished/failed future proofs is
513 no longer printed by default, since it is incompatible with
514 incremental / parallel checking of the persistent document model. ML
515 function Thm.peek_status may be used to inspect a snapshot of the
516 ongoing evaluation process. Note that in batch mode --- notably
517 isabelle build --- the system ensures that future proofs of all
518 accessible theorems in the theory context are finished (as before).
520 * Configuration option show_markup controls direct inlining of markup
521 into the printed representation of formal entities --- notably type
522 and sort constraints. This enables Prover IDE users to retrieve that
523 information via tooltips in the output window, for example.
525 * Command 'ML_file' evaluates ML text from a file directly within the
526 theory, without any predeclaration via 'uses' in the theory header.
528 * Old command 'use' command and corresponding keyword 'uses' in the
529 theory header are legacy features and will be discontinued soon.
530 Tools that load their additional source files may imitate the
531 'ML_file' implementation, such that the system can take care of
532 dependencies properly.
534 * Discontinued obsolete method fastsimp / tactic fast_simp_tac, which
535 is called fastforce / fast_force_tac already since Isabelle2011-1.
537 * Updated and extended "isar-ref" and "implementation" manual, reduced
538 remaining material in old "ref" manual.
540 * Improved support for auxiliary contexts that indicate block structure
541 for specifications. Nesting of "context fixes ... context assumes ..."
542 and "class ... context ...".
544 * Attribute "consumes" allows a negative value as well, which is
545 interpreted relatively to the total number of premises of the rule in
546 the target context. This form of declaration is stable when exported
547 from a nested 'context' with additional assumptions. It is the
548 preferred form for definitional packages, notably cases/rules produced
549 in HOL/inductive and HOL/function.
551 * More informative error messages for Isar proof commands involving
552 lazy enumerations (method applications etc.).
554 * Refined 'help' command to retrieve outer syntax commands according
555 to name patterns (with clickable results).
558 *** Prover IDE -- Isabelle/Scala/jEdit ***
560 * Parallel terminal proofs ('by') are enabled by default, likewise
561 proofs that are built into packages like 'datatype', 'function'. This
562 allows to "run ahead" checking the theory specifications on the
563 surface, while the prover is still crunching on internal
564 justifications. Unfinished / cancelled proofs are restarted as
565 required to complete full proof checking eventually.
567 * Improved output panel with tooltips, hyperlinks etc. based on the
568 same Rich_Text_Area as regular Isabelle/jEdit buffers. Activation of
569 tooltips leads to some window that supports the same recursively,
570 which can lead to stacks of tooltips as the semantic document content
571 is explored. ESCAPE closes the whole stack, individual windows may be
572 closed separately, or detached to become independent jEdit dockables.
574 * Improved support for commands that produce graph output: the text
575 message contains a clickable area to open a new instance of the graph
578 * More robust incremental parsing of outer syntax (partial comments,
579 malformed symbols). Changing the balance of open/close quotes and
580 comment delimiters works more conveniently with unfinished situations
581 that frequently occur in user interaction.
583 * More efficient painting and improved reactivity when editing large
584 files. More scalable management of formal document content.
586 * Smarter handling of tracing messages: prover process pauses after
587 certain number of messages per command transaction, with some user
588 dialog to stop or continue. This avoids swamping the front-end with
589 potentially infinite message streams.
591 * More plugin options and preferences, based on Isabelle/Scala. The
592 jEdit plugin option panel provides access to some Isabelle/Scala
593 options, including tuning parameters for editor reactivity and color
596 * Dockable window "Symbols" provides some editing support for Isabelle
599 * Dockable window "Monitor" shows ML runtime statistics. Note that
600 continuous display of the chart slows down the system.
602 * Improved editing support for control styles: subscript, superscript,
603 bold, reset of style -- operating on single symbols or text
604 selections. Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT.
606 * Actions isabelle.increase-font-size and isabelle.decrease-font-size
607 adjust the main text area font size, and its derivatives for output,
608 tooltips etc. Cf. keyboard shortcuts C-PLUS and C-MINUS, which often
609 need to be adapted to local keyboard layouts.
611 * More reactive completion popup by default: use \t (TAB) instead of
612 \n (NEWLINE) to minimize intrusion into regular flow of editing. See
613 also "Plugin Options / SideKick / General / Code Completion Options".
615 * Implicit check and build dialog of the specified logic session
616 image. For example, HOL, HOLCF, HOL-Nominal can be produced on
617 demand, without bundling big platform-dependent heap images in the
618 Isabelle distribution.
620 * Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates
621 from Oracle provide better multi-platform experience. This version is
622 now bundled exclusively with Isabelle.
627 * Code generation for Haskell: restrict unqualified imports from
628 Haskell Prelude to a small set of fundamental operations.
630 * Command 'export_code': relative file names are interpreted
631 relatively to master directory of current theory rather than the
632 rather arbitrary current working directory. INCOMPATIBILITY.
634 * Discontinued obsolete attribute "COMP". Potential INCOMPATIBILITY,
635 use regular rule composition via "OF" / "THEN", or explicit proof
636 structure instead. Note that Isabelle/ML provides a variety of
637 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied
638 with some care where this is really required.
640 * Command 'typ' supports an additional variant with explicit sort
641 constraint, to infer and check the most general type conforming to a
642 given sort. Example (in HOL):
644 typ "_ * _ * bool * unit" :: finite
646 * Command 'locale_deps' visualizes all locales and their relations as
654 - Added MaSh relevance filter based on machine-learning; see the
655 Sledgehammer manual for details.
656 - Polished Isar proofs generated with "isar_proofs" option.
657 - Rationalized type encodings ("type_enc" option).
658 - Renamed "kill_provers" subcommand to "kill_all".
660 isar_proof ~> isar_proofs
661 isar_shrink_factor ~> isar_shrink
662 max_relevant ~> max_facts
663 relevance_thresholds ~> fact_thresholds
665 * Quickcheck: added an optimisation for equality premises. It is
666 switched on by default, and can be switched off by setting the
667 configuration quickcheck_optimise_equality to false.
669 * Quotient: only one quotient can be defined by quotient_type
673 - generation of an abstraction function equation in lift_definition
675 - renamed no_abs_code -> no_code (INCOMPATIBILITY.)
677 * Simproc "finite_Collect" rewrites set comprehensions into pointfree
680 * Preprocessing of the code generator rewrites set comprehensions into
681 pointfree expressions.
683 * The SMT solver Z3 has now by default a restricted set of directly
684 supported features. For the full set of features (div/mod, nonlinear
685 arithmetic, datatypes/records) with potential proof reconstruction
686 failures, enable the configuration option "z3_with_extensions". Minor
689 * Simplified 'typedef' specifications: historical options for implicit
690 set definition and alternative name have been discontinued. The
691 former behavior of "typedef (open) t = A" is now the default, but
692 written just "typedef t = A". INCOMPATIBILITY, need to adapt theories
695 * Removed constant "chars"; prefer "Enum.enum" on type "char"
696 directly. INCOMPATIBILITY.
698 * Moved operation product, sublists and n_lists from theory Enum to
699 List. INCOMPATIBILITY.
701 * Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY.
703 * Class "comm_monoid_diff" formalises properties of bounded
704 subtraction, with natural numbers and multisets as typical instances.
706 * Added combinator "Option.these" with type "'a option set => 'a set".
708 * Theory "Transitive_Closure": renamed lemmas
710 reflcl_tranclp -> reflclp_tranclp
711 rtranclp_reflcl -> rtranclp_reflclp
715 * Theory "Rings": renamed lemmas (in class semiring)
717 left_distrib ~> distrib_right
718 right_distrib ~> distrib_left
722 * Generalized the definition of limits:
724 - Introduced the predicate filterlim (LIM x F. f x :> G) which
725 expresses that when the input values x converge to F then the
726 output f x converges to G.
728 - Added filters for convergence to positive (at_top) and negative
731 - Moved infinity in the norm (at_infinity) from
732 Multivariate_Analysis to Complex_Main.
734 - Removed real_tendsto_inf, it is superseded by "LIM x F. f x :>
739 * Theory "Library/Option_ord" provides instantiation of option type to
740 lattice type classes.
742 * Theory "Library/Multiset": renamed
744 constant fold_mset ~> Multiset.fold
745 fact fold_mset_commute ~> fold_mset_comm
749 * Renamed theory Library/List_Prefix to Library/Sublist, with related
752 - Renamed constants (and related lemmas)
755 strict_prefix ~> prefix
757 - Replaced constant "postfix" by "suffixeq" with swapped argument
758 order (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped
759 old infix syntax "xs >>= ys"; use "suffixeq ys xs" instead.
760 Renamed lemmas accordingly.
762 - Added constant "list_hembeq" for homeomorphic embedding on
763 lists. Added abbreviation "sublisteq" for special case
764 "list_hembeq (op =)".
766 - Theory Library/Sublist no longer provides "order" and "bot" type
767 class instances for the prefix order (merely corresponding locale
768 interpretations). The type class instances are now in theory
769 Library/Prefix_Order.
771 - The sublist relation of theory Library/Sublist_Order is now based
772 on "Sublist.sublisteq". Renamed lemmas accordingly:
774 le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff
775 le_list_append_mono ~> Sublist.list_hembeq_append_mono
776 le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2
777 le_list_Cons_EX ~> Sublist.list_hembeq_ConsD
778 le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2'
779 le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq
780 le_list_drop_Cons ~> Sublist.sublisteq_Cons'
781 le_list_drop_many ~> Sublist.sublisteq_drop_many
782 le_list_filter_left ~> Sublist.sublisteq_filter_left
783 le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many
784 le_list_rev_take_iff ~> Sublist.sublisteq_append
785 le_list_same_length ~> Sublist.sublisteq_same_length
786 le_list_take_many_iff ~> Sublist.sublisteq_append'
787 less_eq_list.drop ~> less_eq_list_drop
788 less_eq_list.induct ~> less_eq_list_induct
789 not_le_list_length ~> Sublist.not_sublisteq_length
793 * New theory Library/Countable_Set.
795 * Theory Library/Debug and Library/Parallel provide debugging and
796 parallel execution for code generated towards Isabelle/ML.
798 * Theory Library/FuncSet: Extended support for Pi and extensional and
799 introduce the extensional dependent function space "PiE". Replaced
800 extensional_funcset by an abbreviation, and renamed lemmas from
801 extensional_funcset to PiE as follows:
803 extensional_empty ~> PiE_empty
804 extensional_funcset_empty_domain ~> PiE_empty_domain
805 extensional_funcset_empty_range ~> PiE_empty_range
806 extensional_funcset_arb ~> PiE_arb
807 extensional_funcset_mem ~> PiE_mem
808 extensional_funcset_extend_domainI ~> PiE_fun_upd
809 extensional_funcset_restrict_domain ~> fun_upd_in_PiE
810 extensional_funcset_extend_domain_eq ~> PiE_insert_eq
811 card_extensional_funcset ~> card_PiE
812 finite_extensional_funcset ~> finite_PiE
816 * Theory Library/FinFun: theory of almost everywhere constant
817 functions (supersedes the AFP entry "Code Generation for Functions as
820 * Theory Library/Phantom: generic phantom type to make a type
821 parameter appear in a constant's type. This alternative to adding
822 TYPE('a) as another parameter avoids unnecessary closures in generated
825 * Theory Library/RBT_Impl: efficient construction of red-black trees
826 from sorted associative lists. Merging two trees with rbt_union may
827 return a structurally different tree than before. Potential
830 * Theory Library/IArray: immutable arrays with code generation.
832 * Theory Library/Finite_Lattice: theory of finite lattices.
834 * HOL/Multivariate_Analysis: replaced
836 "basis :: 'a::euclidean_space => nat => real"
837 "\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space"
839 on euclidean spaces by using the inner product "_ \<bullet> _" with
840 vectors from the Basis set: "\<Chi>\<Chi> i. f i" is superseded by
841 "SUM i : Basis. f i * r i".
843 With this change the following constants are also changed or removed:
845 DIM('a) :: nat ~> card (Basis :: 'a set) (is an abbreviation)
846 a $$ i ~> inner a i (where i : Basis)
848 \<pi>, \<pi>' removed
850 Theorems about these constants where removed.
854 component_le_norm ~> Basis_le_norm
855 euclidean_eq ~> euclidean_eq_iff
856 differential_zero_maxmin_component ~> differential_zero_maxmin_cart
857 euclidean_simps ~> inner_simps
858 independent_basis ~> independent_Basis
859 span_basis ~> span_Basis
860 in_span_basis ~> in_span_Basis
861 norm_bound_component_le ~> norm_boound_Basis_le
862 norm_bound_component_lt ~> norm_boound_Basis_lt
863 component_le_infnorm ~> Basis_le_infnorm
869 - Added simproc "measurable" to automatically prove measurability.
871 - Added induction rules for sigma sets with disjoint union
872 (sigma_sets_induct_disjoint) and for Borel-measurable functions
873 (borel_measurable_induct).
875 - Added the Daniell-Kolmogorov theorem (the existence the limit of a
878 * HOL/Cardinals: Theories of ordinals and cardinals (supersedes the
879 AFP entry "Ordinals_and_Cardinals").
881 * HOL/BNF: New (co)datatype package based on bounded natural functors
882 with support for mixed, nested recursion and interesting non-free
885 * HOL/Finite_Set and Relation: added new set and relation operations
886 expressed by Finite_Set.fold.
888 * New theory HOL/Library/RBT_Set: implementation of sets by red-black
889 trees for the code generator.
891 * HOL/Library/RBT and HOL/Library/Mapping have been converted to
893 possible INCOMPATIBILITY.
895 * HOL/Set: renamed Set.project -> Set.filter
899 *** Document preparation ***
901 * Dropped legacy antiquotations "term_style" and "thm_style", since
902 styles may be given as arguments to "term" and "thm" already.
903 Discontinued legacy styles "prem1" .. "prem19".
905 * Default LaTeX rendering for \<euro> is now based on eurosym package,
906 instead of slightly exotic babel/greek.
908 * Document variant NAME may use different LaTeX entry point
909 document/root_NAME.tex if that file exists, instead of the common
912 * Simplified custom document/build script, instead of old-style
913 document/IsaMakefile. Minor INCOMPATIBILITY.
918 * The default limit for maximum number of worker threads is now 8,
919 instead of 4, in correspondence to capabilities of contemporary
920 hardware and Poly/ML runtime system.
922 * Type Seq.results and related operations support embedded error
923 messages within lazy enumerations, and thus allow to provide
924 informative errors in the absence of any usable results.
926 * Renamed Position.str_of to Position.here to emphasize that this is a
927 formal device to inline positions into message text, but not
928 necessarily printing visible text.
933 * Advanced support for Isabelle sessions and build management, see
934 "system" manual for the chapter of that name, especially the "isabelle
935 build" tool and its examples. The "isabelle mkroot" tool prepares
936 session root directories for use with "isabelle build", similar to
937 former "isabelle mkdir" for "isabelle usedir". Note that this affects
938 document preparation as well. INCOMPATIBILITY, isabelle usedir /
939 mkdir / make are rendered obsolete.
941 * Discontinued obsolete Isabelle/build script, it is superseded by the
942 regular isabelle build tool. For example:
944 isabelle build -s -b HOL
946 * Discontinued obsolete "isabelle makeall".
948 * Discontinued obsolete IsaMakefile and ROOT.ML files from the
949 Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that
950 provides some traditional targets that invoke "isabelle build". Note
951 that this is inefficient! Applications of Isabelle/HOL involving
952 "isabelle make" should be upgraded to use "isabelle build" directly.
954 * The "isabelle options" tool prints Isabelle system options, as
955 required for "isabelle build", for example.
957 * The "isabelle logo" tool produces EPS and PDF format simultaneously.
958 Minor INCOMPATIBILITY in command-line options.
960 * The "isabelle install" tool has now a simpler command-line. Minor
963 * The "isabelle components" tool helps to resolve add-on components
964 that are not bundled, or referenced from a bare-bones repository
967 * Settings variable ISABELLE_PLATFORM_FAMILY refers to the general
968 platform family: "linux", "macos", "windows".
970 * The ML system is configured as regular component, and no longer
971 picked up from some surrounding directory. Potential INCOMPATIBILITY
972 for home-made settings.
974 * Improved ML runtime statistics (heap, threads, future tasks etc.).
976 * Discontinued support for Poly/ML 5.2.1, which was the last version
977 without exception positions and advanced ML compiler/toplevel
980 * Discontinued special treatment of Proof General -- no longer guess
981 PROOFGENERAL_HOME based on accidental file-system layout. Minor
982 INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS
983 settings manually, or use a Proof General version that has been
984 bundled as Isabelle component.
988 New in Isabelle2012 (May 2012)
989 ------------------------------
993 * Prover IDE (PIDE) improvements:
995 - more robust Sledgehammer integration (as before the sledgehammer
996 command-line needs to be typed into the source buffer)
997 - markup for bound variables
998 - markup for types of term variables (displayed as tooltips)
999 - support for user-defined Isar commands within the running session
1000 - improved support for Unicode outside original 16bit range
1001 e.g. glyph for \<A> (thanks to jEdit 4.5.1)
1003 * Forward declaration of outer syntax keywords within the theory
1004 header -- minor INCOMPATIBILITY for user-defined commands. Allow new
1005 commands to be used in the same theory where defined.
1007 * Auxiliary contexts indicate block structure for specifications with
1008 additional parameters and assumptions. Such unnamed contexts may be
1009 nested within other targets, like 'theory', 'locale', 'class',
1010 'instantiation' etc. Results from the local context are generalized
1011 accordingly and applied to the enclosing target context. Example:
1015 assumes xy: "x = y" and yz: "y = z"
1018 lemma my_trans: "x = z" using xy yz by simp
1024 The most basic application is to factor-out context elements of
1025 several fixes/assumes/shows theorem statements, e.g. see
1026 ~~/src/HOL/Isar_Examples/Group_Context.thy
1028 Any other local theory specification element works within the "context
1029 ... begin ... end" block as well.
1031 * Bundled declarations associate attributed fact expressions with a
1032 given name in the context. These may be later included in other
1033 contexts. This allows to manage context extensions casually, without
1034 the logical dependencies of locales and locale interpretation. See
1035 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.
1037 * Commands 'lemmas' and 'theorems' allow local variables using 'for'
1038 declaration, and results are standardized before being stored. Thus
1039 old-style "standard" after instantiation or composition of facts
1040 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of
1041 indices of schematic variables.
1043 * Rule attributes in local theory declarations (e.g. locale or class)
1044 are now statically evaluated: the resulting theorem is stored instead
1045 of the original expression. INCOMPATIBILITY in rare situations, where
1046 the historic accident of dynamic re-evaluation in interpretations
1049 * New tutorial "Programming and Proving in Isabelle/HOL"
1050 ("prog-prove"). It completely supersedes "A Tutorial Introduction to
1051 Structured Isar Proofs" ("isar-overview"), which has been removed. It
1052 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order
1053 Logic" as the recommended beginners tutorial, but does not cover all
1054 of the material of that old tutorial.
1056 * Updated and extended reference manuals: "isar-ref",
1057 "implementation", "system"; reduced remaining material in old "ref"
1063 * Command 'definition' no longer exports the foundational "raw_def"
1064 into the user context. Minor INCOMPATIBILITY, may use the regular
1065 "def" result with attribute "abs_def" to imitate the old version.
1067 * Attribute "abs_def" turns an equation of the form "f x y == t" into
1068 "f == %x y. t", which ensures that "simp" or "unfold" steps always
1069 expand it. This also works for object-logic equality. (Formerly
1070 undocumented feature.)
1072 * Sort constraints are now propagated in simultaneous statements, just
1073 like type constraints. INCOMPATIBILITY in rare situations, where
1074 distinct sorts used to be assigned accidentally. For example:
1076 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"
1078 lemma "P (x::'a)" and "Q (y::'a::bar)"
1079 -- "now uniform 'a::bar instead of default sort for first occurrence (!)"
1081 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more
1082 tolerant against multiple unifiers, as long as the final result is
1083 unique. (As before, rules are composed in canonical right-to-left
1084 order to accommodate newly introduced premises.)
1086 * Renamed some inner syntax categories:
1092 Minor INCOMPATIBILITY. Note that in practice "num_const" or
1093 "num_position" etc. are mainly used instead (which also include
1094 position information via constraints).
1096 * Simplified configuration options for syntax ambiguity: see
1097 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
1098 manual. Minor INCOMPATIBILITY.
1100 * Discontinued configuration option "syntax_positions": atomic terms
1101 in parse trees are always annotated by position constraints.
1103 * Old code generator for SML and its commands 'code_module',
1104 'code_library', 'consts_code', 'types_code' have been discontinued.
1105 Use commands of the generic code generator instead. INCOMPATIBILITY.
1107 * Redundant attribute "code_inline" has been discontinued. Use
1108 "code_unfold" instead. INCOMPATIBILITY.
1110 * Dropped attribute "code_unfold_post" in favor of the its dual
1111 "code_abbrev", which yields a common pattern in definitions like
1113 definition [code_abbrev]: "f = t"
1117 * Obsolete 'types' command has been discontinued. Use 'type_synonym'
1118 instead. INCOMPATIBILITY.
1120 * Discontinued old "prems" fact, which used to refer to the accidental
1121 collection of foundational premises in the context (already marked as
1122 legacy since Isabelle2011).
1127 * Type 'a set is now a proper type constructor (just as before
1128 Isabelle2008). Definitions mem_def and Collect_def have disappeared.
1129 Non-trivial INCOMPATIBILITY. For developments keeping predicates and
1130 sets separate, it is often sufficient to rephrase some set S that has
1131 been accidentally used as predicates by "%x. x : S", and some
1132 predicate P that has been accidentally used as set by "{x. P x}".
1133 Corresponding proofs in a first step should be pruned from any
1134 tinkering with former theorems mem_def and Collect_def as far as
1137 For developments which deliberately mix predicates and sets, a
1138 planning step is necessary to determine what should become a predicate
1139 and what a set. It can be helpful to carry out that step in
1140 Isabelle2011-1 before jumping right into the current release.
1142 * Code generation by default implements sets as container type rather
1143 than predicates. INCOMPATIBILITY.
1145 * New type synonym 'a rel = ('a * 'a) set
1147 * The representation of numerals has changed. Datatype "num"
1148 represents strictly positive binary numerals, along with functions
1149 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent
1150 positive and negated numeric literals, respectively. See also
1151 definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some
1152 user theories may require adaptations as follows:
1154 - Theorems with number_ring or number_semiring constraints: These
1155 classes are gone; use comm_ring_1 or comm_semiring_1 instead.
1157 - Theories defining numeric types: Remove number, number_semiring,
1158 and number_ring instances. Defer all theorems about numerals until
1159 after classes one and semigroup_add have been instantiated.
1161 - Numeral-only simp rules: Replace each rule having a "number_of v"
1162 pattern with two copies, one for numeral and one for neg_numeral.
1164 - Theorems about subclasses of semiring_1 or ring_1: These classes
1165 automatically support numerals now, so more simp rules and
1166 simprocs may now apply within the proof.
1168 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:
1169 Redefine using other integer operations.
1171 * Transfer: New package intended to generalize the existing
1172 "descending" method and related theorem attributes from the Quotient
1173 package. (Not all functionality is implemented yet, but future
1174 development will focus on Transfer as an eventual replacement for the
1175 corresponding parts of the Quotient package.)
1177 - transfer_rule attribute: Maintains a collection of transfer rules,
1178 which relate constants at two different types. Transfer rules may
1179 relate different type instances of the same polymorphic constant,
1180 or they may relate an operation on a raw type to a corresponding
1181 operation on an abstract type (quotient or subtype). For example:
1183 ((A ===> B) ===> list_all2 A ===> list_all2 B) map map
1184 (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int
1186 - transfer method: Replaces a subgoal on abstract types with an
1187 equivalent subgoal on the corresponding raw types. Constants are
1188 replaced with corresponding ones according to the transfer rules.
1189 Goals are generalized over all free variables by default; this is
1190 necessary for variables whose types change, but can be overridden
1191 for specific variables with e.g. "transfer fixing: x y z". The
1192 variant transfer' method allows replacing a subgoal with one that
1193 is logically stronger (rather than equivalent).
1195 - relator_eq attribute: Collects identity laws for relators of
1196 various type constructors, e.g. "list_all2 (op =) = (op =)". The
1197 transfer method uses these lemmas to infer transfer rules for
1198 non-polymorphic constants on the fly.
1200 - transfer_prover method: Assists with proving a transfer rule for a
1201 new constant, provided the constant is defined in terms of other
1202 constants that already have transfer rules. It should be applied
1203 after unfolding the constant definitions.
1205 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer
1206 from type nat to type int.
1208 * Lifting: New package intended to generalize the quotient_definition
1209 facility of the Quotient package; designed to work with Transfer.
1211 - lift_definition command: Defines operations on an abstract type in
1212 terms of a corresponding operation on a representation
1213 type. Example syntax:
1215 lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"
1218 Users must discharge a respectfulness proof obligation when each
1219 constant is defined. (For a type copy, i.e. a typedef with UNIV,
1220 the proof is discharged automatically.) The obligation is
1221 presented in a user-friendly, readable form; a respectfulness
1222 theorem in the standard format and a transfer rule are generated
1225 - Integration with code_abstype: For typedefs (e.g. subtypes
1226 corresponding to a datatype invariant, such as dlist),
1227 lift_definition generates a code certificate theorem and sets up
1228 code generation for each constant.
1230 - setup_lifting command: Sets up the Lifting package to work with a
1231 user-defined type. The user must provide either a quotient theorem
1232 or a type_definition theorem. The package configures transfer
1233 rules for equality and quantifiers on the type, and sets up the
1234 lift_definition command to work with the type.
1236 - Usage examples: See Quotient_Examples/Lift_DList.thy,
1237 Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,
1238 Word/Word.thy and Library/Float.thy.
1242 - The 'quotient_type' command now supports a 'morphisms' option with
1243 rep and abs functions, similar to typedef.
1245 - 'quotient_type' sets up new types to work with the Lifting and
1246 Transfer packages, as with 'setup_lifting'.
1248 - The 'quotient_definition' command now requires the user to prove a
1249 respectfulness property at the point where the constant is
1250 defined, similar to lift_definition; INCOMPATIBILITY.
1252 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems
1253 accordingly, INCOMPATIBILITY.
1255 * New diagnostic command 'find_unused_assms' to find potentially
1256 superfluous assumptions in theorems using Quickcheck.
1260 - Quickcheck returns variable assignments as counterexamples, which
1261 allows to reveal the underspecification of functions under test.
1262 For example, refuting "hd xs = x", it presents the variable
1263 assignment xs = [] and x = a1 as a counterexample, assuming that
1264 any property is false whenever "hd []" occurs in it.
1266 These counterexample are marked as potentially spurious, as
1267 Quickcheck also returns "xs = []" as a counterexample to the
1268 obvious theorem "hd xs = hd xs".
1270 After finding a potentially spurious counterexample, Quickcheck
1271 continues searching for genuine ones.
1273 By default, Quickcheck shows potentially spurious and genuine
1274 counterexamples. The option "genuine_only" sets quickcheck to only
1275 show genuine counterexamples.
1277 - The command 'quickcheck_generator' creates random and exhaustive
1278 value generators for a given type and operations.
1280 It generates values by using the operations as if they were
1281 constructors of that type.
1283 - Support for multisets.
1285 - Added "use_subtype" options.
1287 - Added "quickcheck_locale" configuration to specify how to process
1288 conjectures in a locale context.
1290 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option
1291 and affecting 'rat' and 'real'.
1294 - Integrated more tightly with SPASS, as described in the ITP 2012
1295 paper "More SPASS with Isabelle".
1296 - Made it try "smt" as a fallback if "metis" fails or times out.
1297 - Added support for the following provers: Alt-Ergo (via Why3 and
1298 TFF1), iProver, iProver-Eq.
1299 - Sped up the minimizer.
1300 - Added "lam_trans", "uncurry_aliases", and "minimize" options.
1301 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
1302 - Renamed "sound" option to "strict".
1304 * Metis: Added possibility to specify lambda translations scheme as a
1305 parenthesized argument (e.g., "by (metis (lifting) ...)").
1307 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".
1309 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.
1311 * New "case_product" attribute to generate a case rule doing multiple
1312 case distinctions at the same time. E.g.
1314 list.exhaust [case_product nat.exhaust]
1316 produces a rule which can be used to perform case distinction on both
1319 * New "eventually_elim" method as a generalized variant of the
1320 eventually_elim* rules. Supports structured proofs.
1322 * Typedef with implicit set definition is considered legacy. Use
1323 "typedef (open)" form instead, which will eventually become the
1326 * Record: code generation can be switched off manually with
1328 declare [[record_coden = false]] -- "default true"
1330 * Datatype: type parameters allow explicit sort constraints.
1332 * Concrete syntax for case expressions includes constraints for source
1333 positions, and thus produces Prover IDE markup for its bindings.
1334 INCOMPATIBILITY for old-style syntax translations that augment the
1335 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
1338 * Clarified attribute "mono_set": pure declaration without modifying
1339 the result of the fact expression.
1341 * More default pred/set conversions on a couple of relation operations
1342 and predicates. Added powers of predicate relations. Consolidation
1343 of some relation theorems:
1345 converse_def ~> converse_unfold
1346 rel_comp_def ~> relcomp_unfold
1347 symp_def ~> (modified, use symp_def and sym_def instead)
1348 transp_def ~> transp_trans
1349 Domain_def ~> Domain_unfold
1350 Range_def ~> Domain_converse [symmetric]
1352 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.
1354 See theory "Relation" for examples for making use of pred/set
1355 conversions by means of attributes "to_set" and "to_pred".
1359 * Renamed facts about the power operation on relations, i.e., relpow
1360 to match the constant's name:
1362 rel_pow_1 ~> relpow_1
1363 rel_pow_0_I ~> relpow_0_I
1364 rel_pow_Suc_I ~> relpow_Suc_I
1365 rel_pow_Suc_I2 ~> relpow_Suc_I2
1366 rel_pow_0_E ~> relpow_0_E
1367 rel_pow_Suc_E ~> relpow_Suc_E
1368 rel_pow_E ~> relpow_E
1369 rel_pow_Suc_D2 ~> relpow_Suc_D2
1370 rel_pow_Suc_E2 ~> relpow_Suc_E2
1371 rel_pow_Suc_D2' ~> relpow_Suc_D2'
1372 rel_pow_E2 ~> relpow_E2
1373 rel_pow_add ~> relpow_add
1374 rel_pow_commute ~> relpow
1375 rel_pow_empty ~> relpow_empty:
1376 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
1377 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
1378 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
1379 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
1380 rel_pow_fun_conv ~> relpow_fun_conv
1381 rel_pow_finite_bounded1 ~> relpow_finite_bounded1
1382 rel_pow_finite_bounded ~> relpow_finite_bounded
1383 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
1384 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
1385 single_valued_rel_pow ~> single_valued_relpow
1389 * Theory Relation: Consolidated constant name for relation composition
1390 and corresponding theorem names:
1392 - Renamed constant rel_comp to relcomp.
1394 - Dropped abbreviation pred_comp. Use relcompp instead.
1398 rel_compI ~> relcompI
1399 rel_compEpair ~> relcompEpair
1400 rel_compE ~> relcompE
1401 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq
1402 rel_comp_empty1 ~> relcomp_empty1
1403 rel_comp_mono ~> relcomp_mono
1404 rel_comp_subset_Sigma ~> relcomp_subset_Sigma
1405 rel_comp_distrib ~> relcomp_distrib
1406 rel_comp_distrib2 ~> relcomp_distrib2
1407 rel_comp_UNION_distrib ~> relcomp_UNION_distrib
1408 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2
1409 single_valued_rel_comp ~> single_valued_relcomp
1410 rel_comp_def ~> relcomp_unfold
1411 converse_rel_comp ~> converse_relcomp
1412 pred_compI ~> relcomppI
1413 pred_compE ~> relcomppE
1414 pred_comp_bot1 ~> relcompp_bot1
1415 pred_comp_bot2 ~> relcompp_bot2
1416 transp_pred_comp_less_eq ~> transp_relcompp_less_eq
1417 pred_comp_mono ~> relcompp_mono
1418 pred_comp_distrib ~> relcompp_distrib
1419 pred_comp_distrib2 ~> relcompp_distrib2
1420 converse_pred_comp ~> converse_relcompp
1422 finite_rel_comp ~> finite_relcomp
1424 set_rel_comp ~> set_relcomp
1428 * Theory Divides: Discontinued redundant theorems about div and mod.
1429 INCOMPATIBILITY, use the corresponding generic theorems instead.
1431 DIVISION_BY_ZERO ~> div_by_0, mod_by_0
1432 zdiv_self ~> div_self
1433 zmod_self ~> mod_self
1436 zdiv_zmod_equality ~> div_mod_equality2
1437 zdiv_zmod_equality2 ~> div_mod_equality
1438 zmod_zdiv_trivial ~> mod_div_trivial
1439 zdiv_zminus_zminus ~> div_minus_minus
1440 zmod_zminus_zminus ~> mod_minus_minus
1441 zdiv_zminus2 ~> div_minus_right
1442 zmod_zminus2 ~> mod_minus_right
1443 zdiv_minus1_right ~> div_minus1_right
1444 zmod_minus1_right ~> mod_minus1_right
1445 zdvd_mult_div_cancel ~> dvd_mult_div_cancel
1446 zmod_zmult1_eq ~> mod_mult_right_eq
1447 zpower_zmod ~> power_mod
1448 zdvd_zmod ~> dvd_mod
1449 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd
1450 mod_mult_distrib ~> mult_mod_left
1451 mod_mult_distrib2 ~> mult_mod_right
1453 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use
1454 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.
1456 * Finite_Set.fold now qualified. INCOMPATIBILITY.
1458 * Consolidated theorem names concerning fold combinators:
1460 inf_INFI_fold_inf ~> inf_INF_fold_inf
1461 sup_SUPR_fold_sup ~> sup_SUP_fold_sup
1462 INFI_fold_inf ~> INF_fold_inf
1463 SUPR_fold_sup ~> SUP_fold_sup
1464 union_set ~> union_set_fold
1465 minus_set ~> minus_set_fold
1466 INFI_set_fold ~> INF_set_fold
1467 SUPR_set_fold ~> SUP_set_fold
1468 INF_code ~> INF_set_foldr
1469 SUP_code ~> SUP_set_foldr
1470 foldr.simps ~> foldr.simps (in point-free formulation)
1471 foldr_fold_rev ~> foldr_conv_fold
1472 foldl_fold ~> foldl_conv_fold
1473 foldr_foldr ~> foldr_conv_foldl
1474 foldl_foldr ~> foldl_conv_foldr
1475 fold_set_remdups ~> fold_set_fold_remdups
1476 fold_set ~> fold_set_fold
1477 fold1_set ~> fold1_set_fold
1481 * Dropped rarely useful theorems concerning fold combinators:
1482 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
1483 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
1484 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
1485 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
1486 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,
1487 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.
1488 INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0"
1489 and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be
1490 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by
1491 unfolding "foldr_conv_fold" and "foldl_conv_fold".
1493 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,
1494 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,
1495 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,
1496 INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding
1497 lemmas over fold rather than foldr, or make use of lemmas
1498 fold_conv_foldr and fold_rev.
1500 * Congruence rules Option.map_cong and Option.bind_cong for recursion
1501 through option types.
1503 * "Transitive_Closure.ntrancl": bounded transitive closure on
1506 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.
1508 * Theory Int: Discontinued many legacy theorems specific to type int.
1509 INCOMPATIBILITY, use the corresponding generic theorems instead.
1511 zminus_zminus ~> minus_minus
1512 zminus_0 ~> minus_zero
1513 zminus_zadd_distrib ~> minus_add_distrib
1514 zadd_commute ~> add_commute
1515 zadd_assoc ~> add_assoc
1516 zadd_left_commute ~> add_left_commute
1519 zadd_0 ~> add_0_left
1520 zadd_0_right ~> add_0_right
1521 zadd_zminus_inverse2 ~> left_minus
1522 zmult_zminus ~> mult_minus_left
1523 zmult_commute ~> mult_commute
1524 zmult_assoc ~> mult_assoc
1525 zadd_zmult_distrib ~> left_distrib
1526 zadd_zmult_distrib2 ~> right_distrib
1527 zdiff_zmult_distrib ~> left_diff_distrib
1528 zdiff_zmult_distrib2 ~> right_diff_distrib
1529 zmult_1 ~> mult_1_left
1530 zmult_1_right ~> mult_1_right
1531 zle_refl ~> order_refl
1532 zle_trans ~> order_trans
1533 zle_antisym ~> order_antisym
1534 zle_linear ~> linorder_linear
1535 zless_linear ~> linorder_less_linear
1536 zadd_left_mono ~> add_left_mono
1537 zadd_strict_right_mono ~> add_strict_right_mono
1538 zadd_zless_mono ~> add_less_le_mono
1539 int_0_less_1 ~> zero_less_one
1540 int_0_neq_1 ~> zero_neq_one
1542 zpower_zadd_distrib ~> power_add
1543 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
1544 zero_le_zpower_abs ~> zero_le_power_abs
1546 * Theory Deriv: Renamed
1548 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
1550 * Theory Library/Multiset: Improved code generation of multisets.
1552 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets
1553 are expressed via type classes again. The special syntax
1554 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant
1555 setsum_set, which is now subsumed by Big_Operators.setsum.
1558 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
1559 use theory HOL/Library/Nat_Bijection instead.
1561 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black
1562 trees is now inside a type class context. Names of affected
1563 operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for
1564 theories working directly with raw red-black trees, adapt the names as
1568 bulkload -> rbt_bulkload
1569 del_from_left -> rbt_del_from_left
1570 del_from_right -> rbt_del_from_right
1572 delete -> rbt_delete
1574 insert -> rbt_insert
1575 insertw -> rbt_insert_with
1576 insert_with_key -> rbt_insert_with_key
1577 map_entry -> rbt_map_entry
1578 lookup -> rbt_lookup
1579 sorted -> rbt_sorted
1580 tree_greater -> rbt_greater
1581 tree_less -> rbt_less
1582 tree_less_symbol -> rbt_less_symbol
1584 union_with -> rbt_union_with
1585 union_with_key -> rbt_union_with_key
1588 balance_left_sorted -> balance_left_rbt_sorted
1589 balance_left_tree_greater -> balance_left_rbt_greater
1590 balance_left_tree_less -> balance_left_rbt_less
1591 balance_right_sorted -> balance_right_rbt_sorted
1592 balance_right_tree_greater -> balance_right_rbt_greater
1593 balance_right_tree_less -> balance_right_rbt_less
1594 balance_sorted -> balance_rbt_sorted
1595 balance_tree_greater -> balance_rbt_greater
1596 balance_tree_less -> balance_rbt_less
1597 bulkload_is_rbt -> rbt_bulkload_is_rbt
1598 combine_sorted -> combine_rbt_sorted
1599 combine_tree_greater -> combine_rbt_greater
1600 combine_tree_less -> combine_rbt_less
1601 delete_in_tree -> rbt_delete_in_tree
1602 delete_is_rbt -> rbt_delete_is_rbt
1603 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater
1604 del_from_left_tree_less -> rbt_del_from_left_rbt_less
1605 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater
1606 del_from_right_tree_less -> rbt_del_from_right_rbt_less
1607 del_in_tree -> rbt_del_in_tree
1608 del_inv1_inv2 -> rbt_del_inv1_inv2
1609 del_sorted -> rbt_del_rbt_sorted
1610 del_tree_greater -> rbt_del_rbt_greater
1611 del_tree_less -> rbt_del_rbt_less
1612 dom_lookup_Branch -> dom_rbt_lookup_Branch
1613 entries_lookup -> entries_rbt_lookup
1614 finite_dom_lookup -> finite_dom_rbt_lookup
1615 insert_sorted -> rbt_insert_rbt_sorted
1616 insertw_is_rbt -> rbt_insertw_is_rbt
1617 insertwk_is_rbt -> rbt_insertwk_is_rbt
1618 insertwk_sorted -> rbt_insertwk_rbt_sorted
1619 insertw_sorted -> rbt_insertw_rbt_sorted
1620 ins_sorted -> ins_rbt_sorted
1621 ins_tree_greater -> ins_rbt_greater
1622 ins_tree_less -> ins_rbt_less
1623 is_rbt_sorted -> is_rbt_rbt_sorted
1624 lookup_balance -> rbt_lookup_balance
1625 lookup_bulkload -> rbt_lookup_rbt_bulkload
1626 lookup_delete -> rbt_lookup_rbt_delete
1627 lookup_Empty -> rbt_lookup_Empty
1628 lookup_from_in_tree -> rbt_lookup_from_in_tree
1629 lookup_in_tree -> rbt_lookup_in_tree
1630 lookup_ins -> rbt_lookup_ins
1631 lookup_insert -> rbt_lookup_rbt_insert
1632 lookup_insertw -> rbt_lookup_rbt_insertw
1633 lookup_insertwk -> rbt_lookup_rbt_insertwk
1634 lookup_keys -> rbt_lookup_keys
1635 lookup_map -> rbt_lookup_map
1636 lookup_map_entry -> rbt_lookup_rbt_map_entry
1637 lookup_tree_greater -> rbt_lookup_rbt_greater
1638 lookup_tree_less -> rbt_lookup_rbt_less
1639 lookup_union -> rbt_lookup_rbt_union
1640 map_entry_color_of -> rbt_map_entry_color_of
1641 map_entry_inv1 -> rbt_map_entry_inv1
1642 map_entry_inv2 -> rbt_map_entry_inv2
1643 map_entry_is_rbt -> rbt_map_entry_is_rbt
1644 map_entry_sorted -> rbt_map_entry_rbt_sorted
1645 map_entry_tree_greater -> rbt_map_entry_rbt_greater
1646 map_entry_tree_less -> rbt_map_entry_rbt_less
1647 map_tree_greater -> map_rbt_greater
1648 map_tree_less -> map_rbt_less
1649 map_sorted -> map_rbt_sorted
1650 paint_sorted -> paint_rbt_sorted
1651 paint_lookup -> paint_rbt_lookup
1652 paint_tree_greater -> paint_rbt_greater
1653 paint_tree_less -> paint_rbt_less
1654 sorted_entries -> rbt_sorted_entries
1655 tree_greater_eq_trans -> rbt_greater_eq_trans
1656 tree_greater_nit -> rbt_greater_nit
1657 tree_greater_prop -> rbt_greater_prop
1658 tree_greater_simps -> rbt_greater_simps
1659 tree_greater_trans -> rbt_greater_trans
1660 tree_less_eq_trans -> rbt_less_eq_trans
1661 tree_less_nit -> rbt_less_nit
1662 tree_less_prop -> rbt_less_prop
1663 tree_less_simps -> rbt_less_simps
1664 tree_less_trans -> rbt_less_trans
1665 tree_ord_props -> rbt_ord_props
1666 union_Branch -> rbt_union_Branch
1667 union_is_rbt -> rbt_union_is_rbt
1668 unionw_is_rbt -> rbt_unionw_is_rbt
1669 unionwk_is_rbt -> rbt_unionwk_is_rbt
1670 unionwk_sorted -> rbt_unionwk_rbt_sorted
1672 * Theory HOL/Library/Float: Floating point numbers are now defined as
1673 a subset of the real numbers. All operations are defined using the
1674 lifing-framework and proofs use the transfer method. INCOMPATIBILITY.
1681 round_down -> float_round_down
1682 round_up -> float_round_up
1686 ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod
1689 abs_float_def -> Float.compute_float_abs
1690 bitlen_ge0 -> bitlen_nonneg
1691 bitlen.simps -> Float.compute_bitlen
1692 float_components -> Float_mantissa_exponent
1693 float_divl.simps -> Float.compute_float_divl
1694 float_divr.simps -> Float.compute_float_divr
1695 float_eq_odd -> mult_powr_eq_mult_powr_iff
1696 float_power -> real_of_float_power
1697 lapprox_posrat_def -> Float.compute_lapprox_posrat
1698 lapprox_rat.simps -> Float.compute_lapprox_rat
1699 le_float_def' -> Float.compute_float_le
1700 le_float_def -> less_eq_float.rep_eq
1701 less_float_def' -> Float.compute_float_less
1702 less_float_def -> less_float.rep_eq
1703 normfloat_def -> Float.compute_normfloat
1704 normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0
1705 normfloat -> normfloat_def
1706 normfloat_unique -> use normfloat_def
1707 number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral
1708 one_float_def -> Float.compute_float_one
1709 plus_float_def -> Float.compute_float_plus
1710 rapprox_posrat_def -> Float.compute_rapprox_posrat
1711 rapprox_rat.simps -> Float.compute_rapprox_rat
1712 real_of_float_0 -> zero_float.rep_eq
1713 real_of_float_1 -> one_float.rep_eq
1714 real_of_float_abs -> abs_float.rep_eq
1715 real_of_float_add -> plus_float.rep_eq
1716 real_of_float_minus -> uminus_float.rep_eq
1717 real_of_float_mult -> times_float.rep_eq
1718 real_of_float_simp -> Float.rep_eq
1719 real_of_float_sub -> minus_float.rep_eq
1720 round_down.simps -> Float.compute_float_round_down
1721 round_up.simps -> Float.compute_float_round_up
1722 times_float_def -> Float.compute_float_times
1723 uminus_float_def -> Float.compute_float_uminus
1724 zero_float_def -> Float.compute_float_zero
1726 Lemmas not necessary anymore, use the transfer method:
1727 bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,
1728 float_divr, float_le_simp, float_less1_mantissa_bound,
1729 float_less_simp, float_less_zero, float_le_zero,
1730 float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,
1731 floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,
1732 lapprox_rat_bottom, normalized_float, rapprox_posrat,
1733 rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,
1734 real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,
1735 round_up, zero_le_float, zero_less_float
1737 * New theory HOL/Library/DAList provides an abstract type for
1738 association lists with distinct keys.
1740 * Session HOL/IMP: Added new theory of abstract interpretation of
1743 * Session HOL-Import: Re-implementation from scratch is faster,
1744 simpler, and more scalable. Requires a proof bundle, which is
1745 available as an external component. Discontinued old (and mostly
1746 dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY.
1748 * Session HOL-Word: Discontinued many redundant theorems specific to
1749 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
1752 word_sub_alt ~> word_sub_wi
1753 word_add_alt ~> word_add_def
1754 word_mult_alt ~> word_mult_def
1755 word_minus_alt ~> word_minus_def
1756 word_0_alt ~> word_0_wi
1757 word_1_alt ~> word_1_wi
1758 word_add_0 ~> add_0_left
1759 word_add_0_right ~> add_0_right
1760 word_mult_1 ~> mult_1_left
1761 word_mult_1_right ~> mult_1_right
1762 word_add_commute ~> add_commute
1763 word_add_assoc ~> add_assoc
1764 word_add_left_commute ~> add_left_commute
1765 word_mult_commute ~> mult_commute
1766 word_mult_assoc ~> mult_assoc
1767 word_mult_left_commute ~> mult_left_commute
1768 word_left_distrib ~> left_distrib
1769 word_right_distrib ~> right_distrib
1770 word_left_minus ~> left_minus
1771 word_diff_0_right ~> diff_0_right
1772 word_diff_self ~> diff_self
1773 word_sub_def ~> diff_minus
1774 word_diff_minus ~> diff_minus
1775 word_add_ac ~> add_ac
1776 word_mult_ac ~> mult_ac
1777 word_plus_ac0 ~> add_0_left add_0_right add_ac
1778 word_times_ac1 ~> mult_1_left mult_1_right mult_ac
1779 word_order_trans ~> order_trans
1780 word_order_refl ~> order_refl
1781 word_order_antisym ~> order_antisym
1782 word_order_linear ~> linorder_linear
1783 lenw1_zero_neq_one ~> zero_neq_one
1784 word_number_of_eq ~> number_of_eq
1785 word_of_int_add_hom ~> wi_hom_add
1786 word_of_int_sub_hom ~> wi_hom_sub
1787 word_of_int_mult_hom ~> wi_hom_mult
1788 word_of_int_minus_hom ~> wi_hom_neg
1789 word_of_int_succ_hom ~> wi_hom_succ
1790 word_of_int_pred_hom ~> wi_hom_pred
1791 word_of_int_0_hom ~> word_0_wi
1792 word_of_int_1_hom ~> word_1_wi
1794 * Session HOL-Word: New proof method "word_bitwise" for splitting
1795 machine word equalities and inequalities into logical circuits,
1796 defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction,
1797 multiplication, shifting by constants, bitwise operators and numeric
1798 constants. Requires fixed-length word types, not 'a word. Solves
1799 many standard word identities outright and converts more into first
1800 order problems amenable to blast or similar. See also examples in
1801 HOL/Word/Examples/WordExamples.thy.
1803 * Session HOL-Probability: Introduced the type "'a measure" to
1804 represent measures, this replaces the records 'a algebra and 'a
1805 measure_space. The locales based on subset_class now have two
1806 locale-parameters the space \<Omega> and the set of measurable sets M.
1807 The product of probability spaces uses now the same constant as the
1808 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)
1809 measure". Most constants are defined now outside of locales and gain
1810 an additional parameter, like null_sets, almost_eventually or \<mu>'.
1811 Measure space constructions for distributions and densities now got
1812 their own constants distr and density. Instead of using locales to
1813 describe measure spaces with a finite space, the measure count_space
1814 and point_measure is introduced. INCOMPATIBILITY.
1818 finite_measure.\<mu>' -> measure
1819 product_algebra_generator -> prod_algebra
1820 product_prob_space.emb -> prod_emb
1821 product_prob_space.infprod_algebra -> PiM
1824 completeable_measure_space
1825 finite_measure_space
1827 finite_product_finite_prob_space
1828 finite_product_sigma_algebra
1829 finite_sigma_algebra
1831 pair_finite_prob_space
1832 pair_finite_sigma_algebra
1835 product_sigma_algebra
1839 distribution -> use distr measure, or distributed predicate
1841 joint_distribution -> use distr measure, or distributed predicate
1842 pair_measure_generator
1843 product_prob_space.infprod_algebra -> use PiM
1846 Replacement theorems:
1847 finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite
1848 finite_measure.empty_measure -> measure_empty
1849 finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq
1850 finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq
1851 finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably
1852 finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure
1853 finite_measure.finite_measure -> finite_measure.emeasure_finite
1854 finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton
1855 finite_measure.positive_measure' -> measure_nonneg
1856 finite_measure.real_measure -> finite_measure.emeasure_real
1857 finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb
1858 finite_product_sigma_algebra.in_P -> sets_PiM_I_finite
1859 finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty
1860 information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed
1861 information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple
1862 information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple
1863 information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple
1864 information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple
1865 information_space.entropy_commute -> information_space.entropy_commute_simple
1866 information_space.entropy_eq -> information_space.entropy_simple_distributed
1867 information_space.entropy_generic_eq -> information_space.entropy_simple_distributed
1868 information_space.entropy_positive -> information_space.entropy_nonneg_simple
1869 information_space.entropy_uniform_max -> information_space.entropy_uniform
1870 information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq
1871 information_space.KL_eq_0 -> information_space.KL_same_eq_0
1872 information_space.KL_ge_0 -> information_space.KL_nonneg
1873 information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed
1874 information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple
1875 Int_stable_cuboids -> Int_stable_atLeastAtMost
1876 Int_stable_product_algebra_generator -> positive_integral
1877 measure_preserving -> equality "distr M N f = N" "f : measurable M N"
1878 measure_space.additive -> emeasure_additive
1879 measure_space.AE_iff_null_set -> AE_iff_null
1880 measure_space.almost_everywhere_def -> eventually_ae_filter
1881 measure_space.almost_everywhere_vimage -> AE_distrD
1882 measure_space.continuity_from_above -> INF_emeasure_decseq
1883 measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq
1884 measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq
1885 measure_space.continuity_from_below -> SUP_emeasure_incseq
1886 measure_space_density -> emeasure_density
1887 measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density
1888 measure_space.integrable_vimage -> integrable_distr
1889 measure_space.integral_translated_density -> integral_density
1890 measure_space.integral_vimage -> integral_distr
1891 measure_space.measure_additive -> plus_emeasure
1892 measure_space.measure_compl -> emeasure_compl
1893 measure_space.measure_countable_increasing -> emeasure_countable_increasing
1894 measure_space.measure_countably_subadditive -> emeasure_subadditive_countably
1895 measure_space.measure_decseq -> decseq_emeasure
1896 measure_space.measure_Diff -> emeasure_Diff
1897 measure_space.measure_Diff_null_set -> emeasure_Diff_null_set
1898 measure_space.measure_eq_0 -> emeasure_eq_0
1899 measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite
1900 measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton
1901 measure_space.measure_incseq -> incseq_emeasure
1902 measure_space.measure_insert -> emeasure_insert
1903 measure_space.measure_mono -> emeasure_mono
1904 measure_space.measure_not_negative -> emeasure_not_MInf
1905 measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq
1906 measure_space.measure_setsum -> setsum_emeasure
1907 measure_space.measure_setsum_split -> setsum_emeasure_cover
1908 measure_space.measure_space_vimage -> emeasure_distr
1909 measure_space.measure_subadditive_finite -> emeasure_subadditive_finite
1910 measure_space.measure_subadditive -> subadditive
1911 measure_space.measure_top -> emeasure_space
1912 measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0
1913 measure_space.measure_Un_null_set -> emeasure_Un_null_set
1914 measure_space.positive_integral_translated_density -> positive_integral_density
1915 measure_space.positive_integral_vimage -> positive_integral_distr
1916 measure_space.real_continuity_from_above -> Lim_measure_decseq
1917 measure_space.real_continuity_from_below -> Lim_measure_incseq
1918 measure_space.real_measure_countably_subadditive -> measure_subadditive_countably
1919 measure_space.real_measure_Diff -> measure_Diff
1920 measure_space.real_measure_finite_Union -> measure_finite_Union
1921 measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton
1922 measure_space.real_measure_subadditive -> measure_subadditive
1923 measure_space.real_measure_Union -> measure_Union
1924 measure_space.real_measure_UNION -> measure_UNION
1925 measure_space.simple_function_vimage -> simple_function_comp
1926 measure_space.simple_integral_vimage -> simple_integral_distr
1927 measure_space.simple_integral_vimage -> simple_integral_distr
1928 measure_unique_Int_stable -> measure_eqI_generator_eq
1929 measure_unique_Int_stable_vimage -> measure_eqI_generator_eq
1930 pair_sigma_algebra.measurable_cut_fst -> sets_Pair1
1931 pair_sigma_algebra.measurable_cut_snd -> sets_Pair2
1932 pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1
1933 pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2
1934 pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff
1935 pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap
1936 pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'
1937 pair_sigma_algebra.sets_swap -> sets_pair_swap
1938 pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1
1939 pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2
1940 pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap
1941 pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2
1942 pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt
1943 pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times
1944 prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM
1945 prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq
1946 prob_space.measure_space_1 -> prob_space.emeasure_space_1
1947 prob_space.prob_space_vimage -> prob_space_distr
1948 prob_space.random_variable_restrict -> measurable_restrict
1949 prob_space_unique_Int_stable -> measure_eqI_prob_space
1950 product_algebraE -> prod_algebraE_all
1951 product_algebra_generator_der -> prod_algebra_eq_finite
1952 product_algebra_generator_into_space -> prod_algebra_sets_into_space
1953 product_algebraI -> sets_PiM_I_finite
1954 product_measure_exists -> product_sigma_finite.sigma_finite
1955 product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator
1956 product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb
1957 product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty
1958 product_prob_space.measurable_component -> measurable_component_singleton
1959 product_prob_space.measurable_emb -> measurable_prod_emb
1960 product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single
1961 product_prob_space.measurable_singleton_infprod -> measurable_component_singleton
1962 product_prob_space.measure_emb -> emeasure_prod_emb
1963 product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict
1964 product_sigma_algebra.product_algebra_into_space -> space_closed
1965 product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge
1966 product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton
1967 product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge
1968 sequence_space.measure_infprod -> sequence_space.measure_PiM_countable
1969 sets_product_algebra -> sets_PiM
1970 sigma_algebra.measurable_sigma -> measurable_measure_of
1971 sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint
1972 sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr
1973 sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq
1974 space_product_algebra -> space_PiM
1976 * Session HOL-TPTP: support to parse and import TPTP problems (all
1977 languages) into Isabelle/HOL.
1982 * New "case_product" attribute (see HOL).
1987 * Greater support for structured proofs involving induction or case
1990 * Much greater use of mathematical symbols.
1992 * Removal of many ML theorem bindings. INCOMPATIBILITY.
1997 * Antiquotation @{keyword "name"} produces a parser for outer syntax
1998 from a minor keyword introduced via theory header declaration.
2000 * Antiquotation @{command_spec "name"} produces the
2001 Outer_Syntax.command_spec from a major keyword introduced via theory
2002 header declaration; it can be passed to Outer_Syntax.command etc.
2004 * Local_Theory.define no longer hard-wires default theorem name
2005 "foo_def", but retains the binding as given. If that is Binding.empty
2006 / Attrib.empty_binding, the result is not registered as user-level
2007 fact. The Local_Theory.define_internal variant allows to specify a
2008 non-empty name (used for the foundation in the background theory),
2009 while omitting the fact binding in the user-context. Potential
2010 INCOMPATIBILITY for derived definitional packages: need to specify
2011 naming policy for primitive definitions more explicitly.
2013 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
2014 conformance with similar operations in structure Term and Logic.
2016 * Antiquotation @{attributes [...]} embeds attribute source
2017 representation into the ML text, which is particularly useful with
2018 declarations like Local_Theory.note.
2020 * Structure Proof_Context follows standard naming scheme. Old
2021 ProofContext has been discontinued. INCOMPATIBILITY.
2023 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
2024 change of semantics: update is applied to auxiliary local theory
2027 * Modernized some old-style infix operations:
2029 addeqcongs ~> Simplifier.add_eqcong
2030 deleqcongs ~> Simplifier.del_eqcong
2031 addcongs ~> Simplifier.add_cong
2032 delcongs ~> Simplifier.del_cong
2033 setmksimps ~> Simplifier.set_mksimps
2034 setmkcong ~> Simplifier.set_mkcong
2035 setmksym ~> Simplifier.set_mksym
2036 setmkeqTrue ~> Simplifier.set_mkeqTrue
2037 settermless ~> Simplifier.set_termless
2038 setsubgoaler ~> Simplifier.set_subgoaler
2039 addsplits ~> Splitter.add_split
2040 delsplits ~> Splitter.del_split
2045 * USER_HOME settings variable points to cross-platform user home
2046 directory, which coincides with HOME on POSIX systems only. Likewise,
2047 the Isabelle path specification "~" now expands to $USER_HOME, instead
2048 of former $HOME. A different default for USER_HOME may be set
2049 explicitly in shell environment, before Isabelle settings are
2050 evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where
2051 the generic user home was intended.
2053 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
2054 notation, which is useful for the jEdit file browser, for example.
2056 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
2061 New in Isabelle2011-1 (October 2011)
2062 ------------------------------------
2066 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
2067 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
2069 - Management of multiple theory files directly from the editor
2070 buffer store -- bypassing the file-system (no requirement to save
2071 files for checking).
2073 - Markup of formal entities within the text buffer, with semantic
2074 highlighting, tooltips and hyperlinks to jump to defining source
2077 - Improved text rendering, with sub/superscripts in the source
2078 buffer (including support for copy/paste wrt. output panel, HTML
2079 theory output and other non-Isabelle text boxes).
2081 - Refined scheduling of proof checking and printing of results,
2082 based on interactive editor view. (Note: jEdit folding and
2083 narrowing allows to restrict buffer perspectives explicitly.)
2085 - Reduced CPU performance requirements, usable on machines with few
2088 - Reduced memory requirements due to pruning of unused document
2089 versions (garbage collection).
2091 See also ~~/src/Tools/jEdit/README.html for further information,
2092 including some remaining limitations.
2094 * Theory loader: source files are exclusively located via the master
2095 directory of each theory node (where the .thy file itself resides).
2096 The global load path (such as src/HOL/Library) has been discontinued.
2097 Note that the path element ~~ may be used to reference theories in the
2098 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
2101 * Theory loader: source files are identified by content via SHA1
2102 digests. Discontinued former path/modtime identification and optional
2103 ISABELLE_FILE_IDENT plugin scripts.
2105 * Parallelization of nested Isar proofs is subject to
2106 Goal.parallel_proofs_threshold (default 100). See also isabelle
2109 * Name space: former unsynchronized references are now proper
2110 configuration options, with more conventional names:
2112 long_names ~> names_long
2113 short_names ~> names_short
2114 unique_names ~> names_unique
2116 Minor INCOMPATIBILITY, need to declare options in context like this:
2118 declare [[names_unique = false]]
2120 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note
2121 that the result needs to be unique, which means fact specifications
2122 may have to be refined after enriching a proof context.
2124 * Attribute "case_names" has been refined: the assumptions in each case
2125 can be named now by following the case name with [name1 name2 ...].
2127 * Isabelle/Isar reference manual has been updated and extended:
2128 - "Synopsis" provides a catalog of main Isar language concepts.
2129 - Formal references in syntax diagrams, via @{rail} antiquotation.
2130 - Updated material from classic "ref" manual, notably about
2131 "Classical Reasoner".
2136 * Class bot and top require underlying partial order rather than
2137 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.
2139 * Class complete_lattice: generalized a couple of lemmas from sets;
2140 generalized theorems INF_cong and SUP_cong. New type classes for
2141 complete boolean algebras and complete linear orders. Lemmas
2142 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
2143 class complete_linorder.
2145 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
2146 Sup_fun_def, Inf_apply, Sup_apply.
2148 Removed redundant lemmas (the right hand side gives hints how to
2149 replace them for (metis ...), or (simp only: ...) proofs):
2151 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
2152 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
2153 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
2154 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
2155 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
2156 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
2157 Inter_def ~> INF_def, image_def
2158 Union_def ~> SUP_def, image_def
2159 INT_eq ~> INF_def, and image_def
2160 UN_eq ~> SUP_def, and image_def
2161 INF_subset ~> INF_superset_mono [OF _ order_refl]
2163 More consistent and comprehensive names:
2165 INTER_eq_Inter_image ~> INF_def
2166 UNION_eq_Union_image ~> SUP_def
2169 INF_leI ~> INF_lower
2170 INF_leI2 ~> INF_lower2
2171 le_INFI ~> INF_greatest
2172 le_SUPI ~> SUP_upper
2173 le_SUPI2 ~> SUP_upper2
2174 SUP_leI ~> SUP_least
2175 INFI_bool_eq ~> INF_bool_eq
2176 SUPR_bool_eq ~> SUP_bool_eq
2177 INFI_apply ~> INF_apply
2178 SUPR_apply ~> SUP_apply
2179 INTER_def ~> INTER_eq
2180 UNION_def ~> UNION_eq
2184 * Renamed theory Complete_Lattice to Complete_Lattices.
2187 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
2188 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
2189 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
2190 Sup_insert are now declared as [simp]. INCOMPATIBILITY.
2192 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
2193 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
2194 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor
2197 * Added syntactic classes "inf" and "sup" for the respective
2198 constants. INCOMPATIBILITY: Changes in the argument order of the
2199 (mostly internal) locale predicates for some derived classes.
2201 * Theorem collections ball_simps and bex_simps do not contain theorems
2202 referring to UNION any longer; these have been moved to collection
2203 UN_ball_bex_simps. INCOMPATIBILITY.
2205 * Theory Archimedean_Field: floor now is defined as parameter of a
2206 separate type class floor_ceiling.
2208 * Theory Finite_Set: more coherent development of fold_set locales:
2210 locale fun_left_comm ~> locale comp_fun_commute
2211 locale fun_left_comm_idem ~> locale comp_fun_idem
2213 Both use point-free characterization; interpretation proofs may need
2214 adjustment. INCOMPATIBILITY.
2216 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
2217 accordance with standard mathematical terminology. INCOMPATIBILITY.
2219 * Theory Complex_Main: The locale interpretations for the
2220 bounded_linear and bounded_bilinear locales have been removed, in
2221 order to reduce the number of duplicate lemmas. Users must use the
2222 original names for distributivity theorems, potential INCOMPATIBILITY.
2224 divide.add ~> add_divide_distrib
2225 divide.diff ~> diff_divide_distrib
2226 divide.setsum ~> setsum_divide_distrib
2227 mult.add_right ~> right_distrib
2228 mult.diff_right ~> right_diff_distrib
2229 mult_right.setsum ~> setsum_right_distrib
2230 mult_left.diff ~> left_diff_distrib
2232 * Theory Complex_Main: Several redundant theorems have been removed or
2233 replaced by more general versions. INCOMPATIBILITY.
2235 real_diff_def ~> minus_real_def
2236 real_divide_def ~> divide_real_def
2237 real_less_def ~> less_le
2238 real_abs_def ~> abs_real_def
2239 real_sgn_def ~> sgn_real_def
2240 real_mult_commute ~> mult_commute
2241 real_mult_assoc ~> mult_assoc
2242 real_mult_1 ~> mult_1_left
2243 real_add_mult_distrib ~> left_distrib
2244 real_zero_not_eq_one ~> zero_neq_one
2245 real_mult_inverse_left ~> left_inverse
2246 INVERSE_ZERO ~> inverse_zero
2247 real_le_refl ~> order_refl
2248 real_le_antisym ~> order_antisym
2249 real_le_trans ~> order_trans
2250 real_le_linear ~> linear
2251 real_le_eq_diff ~> le_iff_diff_le_0
2252 real_add_left_mono ~> add_left_mono
2253 real_mult_order ~> mult_pos_pos
2254 real_mult_less_mono2 ~> mult_strict_left_mono
2255 real_of_int_real_of_nat ~> real_of_int_of_nat_eq
2256 real_0_le_divide_iff ~> zero_le_divide_iff
2257 realpow_two_disj ~> power2_eq_iff
2258 real_squared_diff_one_factored ~> square_diff_one_factored
2259 realpow_two_diff ~> square_diff_square_factored
2260 reals_complete2 ~> complete_real
2261 real_sum_squared_expand ~> power2_sum
2262 exp_ln_eq ~> ln_unique
2264 expi_zero ~> exp_zero
2265 lemma_DERIV_subst ~> DERIV_cong
2266 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
2267 LIMSEQ_const ~> tendsto_const
2268 LIMSEQ_norm ~> tendsto_norm
2269 LIMSEQ_add ~> tendsto_add
2270 LIMSEQ_minus ~> tendsto_minus
2271 LIMSEQ_minus_cancel ~> tendsto_minus_cancel
2272 LIMSEQ_diff ~> tendsto_diff
2273 bounded_linear.LIMSEQ ~> bounded_linear.tendsto
2274 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
2275 LIMSEQ_mult ~> tendsto_mult
2276 LIMSEQ_inverse ~> tendsto_inverse
2277 LIMSEQ_divide ~> tendsto_divide
2278 LIMSEQ_pow ~> tendsto_power
2279 LIMSEQ_setsum ~> tendsto_setsum
2280 LIMSEQ_setprod ~> tendsto_setprod
2281 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
2282 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
2283 LIMSEQ_imp_rabs ~> tendsto_rabs
2284 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
2285 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
2286 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
2287 LIMSEQ_Complex ~> tendsto_Complex
2288 LIM_ident ~> tendsto_ident_at
2289 LIM_const ~> tendsto_const
2290 LIM_add ~> tendsto_add
2291 LIM_add_zero ~> tendsto_add_zero
2292 LIM_minus ~> tendsto_minus
2293 LIM_diff ~> tendsto_diff
2294 LIM_norm ~> tendsto_norm
2295 LIM_norm_zero ~> tendsto_norm_zero
2296 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
2297 LIM_norm_zero_iff ~> tendsto_norm_zero_iff
2298 LIM_rabs ~> tendsto_rabs
2299 LIM_rabs_zero ~> tendsto_rabs_zero
2300 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
2301 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
2302 LIM_compose ~> tendsto_compose
2303 LIM_mult ~> tendsto_mult
2304 LIM_scaleR ~> tendsto_scaleR
2305 LIM_of_real ~> tendsto_of_real
2306 LIM_power ~> tendsto_power
2307 LIM_inverse ~> tendsto_inverse
2308 LIM_sgn ~> tendsto_sgn
2309 isCont_LIM_compose ~> isCont_tendsto_compose
2310 bounded_linear.LIM ~> bounded_linear.tendsto
2311 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
2312 bounded_bilinear.LIM ~> bounded_bilinear.tendsto
2313 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
2314 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
2315 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
2316 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
2318 * Theory Complex_Main: The definition of infinite series was
2319 generalized. Now it is defined on the type class {topological_space,
2320 comm_monoid_add}. Hence it is useable also for extended real numbers.
2322 * Theory Complex_Main: The complex exponential function "expi" is now
2323 a type-constrained abbreviation for "exp :: complex => complex"; thus
2324 several polymorphic lemmas about "exp" are now applicable to "expi".
2328 - Theory Library/Code_Char_ord provides native ordering of
2329 characters in the target language.
2331 - Commands code_module and code_library are legacy, use export_code
2334 - Method "evaluation" is legacy, use method "eval" instead.
2336 - Legacy evaluator "SML" is deactivated by default. May be
2337 reactivated by the following theory command:
2339 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
2341 * Declare ext [intro] by default. Rare INCOMPATIBILITY.
2343 * New proof method "induction" that gives induction hypotheses the
2344 name "IH", thus distinguishing them from further hypotheses that come
2345 from rule induction. The latter are still called "hyps". Method
2346 "induction" is a thin wrapper around "induct" and follows the same
2349 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
2350 still available as a legacy feature for some time.
2353 - Added "need" and "total_consts" options.
2354 - Reintroduced "show_skolems" option by popular demand.
2355 - Renamed attribute: nitpick_def ~> nitpick_unfold.
2359 - Use quasi-sound (and efficient) translations by default.
2360 - Added support for the following provers: E-ToFoF, LEO-II,
2361 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
2362 - Automatically preplay and minimize proofs before showing them if
2363 this can be done within reasonable time.
2364 - sledgehammer available_provers ~> sledgehammer supported_provers.
2366 - Added "preplay_timeout", "slicing", "type_enc", "sound",
2367 "max_mono_iters", and "max_new_mono_instances" options.
2368 - Removed "explicit_apply" and "full_types" options as well as "Full
2369 Types" Proof General menu item. INCOMPATIBILITY.
2372 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
2373 - Obsoleted "metisFT" -- use "metis (full_types)" instead.
2377 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
2378 "elim:" options. INCOMPATIBILITY.
2379 - Introduced 'try' that not only runs 'try_methods' but also
2380 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
2383 - Added "eval" option to evaluate terms for the found counterexample
2384 (currently only supported by the default (exhaustive) tester).
2385 - Added post-processing of terms to obtain readable counterexamples
2386 (currently only supported by the default (exhaustive) tester).
2387 - New counterexample generator quickcheck[narrowing] enables
2388 narrowing-based testing. Requires the Glasgow Haskell compiler
2389 with its installation location defined in the Isabelle settings
2390 environment as ISABELLE_GHC.
2391 - Removed quickcheck tester "SML" based on the SML code generator
2392 (formly in HOL/Library).
2394 * Function package: discontinued option "tailrec". INCOMPATIBILITY,
2395 use 'partial_function' instead.
2397 * Theory Library/Extended_Reals replaces now the positive extended
2398 reals found in probability theory. This file is extended by
2399 Multivariate_Analysis/Extended_Real_Limits.
2401 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,
2402 from where it must be imported explicitly if it is really required.
2405 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
2406 been moved here. INCOMPATIBILITY.
2408 * Theory Library/Saturated provides type of numbers with saturated
2411 * Theory Library/Product_Lattice defines a pointwise ordering for the
2412 product type 'a * 'b, and provides instance proofs for various order
2413 and lattice type classes.
2415 * Theory Library/Countable now provides the "countable_datatype" proof
2416 method for proving "countable" class instances for datatypes.
2418 * Theory Library/Cset_Monad allows do notation for computable sets
2419 (cset) via the generic monad ad-hoc overloading facility.
2421 * Library: Theories of common data structures are split into theories
2422 for implementation, an invariant-ensuring type, and connection to an
2423 abstract type. INCOMPATIBILITY.
2425 - RBT is split into RBT and RBT_Mapping.
2426 - AssocList is split and renamed into AList and AList_Mapping.
2427 - DList is split into DList_Impl, DList, and DList_Cset.
2428 - Cset is split into Cset and List_Cset.
2430 * Theory Library/Nat_Infinity has been renamed to
2431 Library/Extended_Nat, with name changes of the following types and
2434 type inat ~> type enat
2436 Infty ~> infinity (overloaded)
2440 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
2441 been renamed accordingly. INCOMPATIBILITY.
2443 * Session Multivariate_Analysis: The euclidean_space type class now
2444 fixes a constant "Basis :: 'a set" consisting of the standard
2445 orthonormal basis for the type. Users now have the option of
2446 quantifying over this set instead of using the "basis" function, e.g.
2447 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
2449 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
2450 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
2451 "Cart_nth" and "Cart_lambda" have been respectively renamed to
2452 "vec_nth" and "vec_lambda"; theorems mentioning those names have
2453 changed to match. Definition theorems for overloaded constants now use
2454 the standard "foo_vec_def" naming scheme. A few other theorems have
2455 been renamed as follows (INCOMPATIBILITY):
2457 Cart_eq ~> vec_eq_iff
2458 dist_nth_le_cart ~> dist_vec_nth_le
2459 tendsto_vector ~> vec_tendstoI
2460 Cauchy_vector ~> vec_CauchyI
2462 * Session Multivariate_Analysis: Several duplicate theorems have been
2463 removed, and other theorems have been renamed or replaced with more
2464 general versions. INCOMPATIBILITY.
2466 finite_choice ~> finite_set_choice
2467 eventually_conjI ~> eventually_conj
2468 eventually_and ~> eventually_conj_iff
2469 eventually_false ~> eventually_False
2470 setsum_norm ~> norm_setsum
2471 Lim_sequentially ~> LIMSEQ_def
2472 Lim_ident_at ~> LIM_ident
2473 Lim_const ~> tendsto_const
2474 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
2475 Lim_neg ~> tendsto_minus
2476 Lim_add ~> tendsto_add
2477 Lim_sub ~> tendsto_diff
2478 Lim_mul ~> tendsto_scaleR
2479 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
2480 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
2481 Lim_linear ~> bounded_linear.tendsto
2482 Lim_component ~> tendsto_euclidean_component
2483 Lim_component_cart ~> tendsto_vec_nth
2484 Lim_inner ~> tendsto_inner [OF tendsto_const]
2485 dot_lsum ~> inner_setsum_left
2486 dot_rsum ~> inner_setsum_right
2487 continuous_cmul ~> continuous_scaleR [OF continuous_const]
2488 continuous_neg ~> continuous_minus
2489 continuous_sub ~> continuous_diff
2490 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
2491 continuous_mul ~> continuous_scaleR
2492 continuous_inv ~> continuous_inverse
2493 continuous_at_within_inv ~> continuous_at_within_inverse
2494 continuous_at_inv ~> continuous_at_inverse
2495 continuous_at_norm ~> continuous_norm [OF continuous_at_id]
2496 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
2497 continuous_at_component ~> continuous_component [OF continuous_at_id]
2498 continuous_on_neg ~> continuous_on_minus
2499 continuous_on_sub ~> continuous_on_diff
2500 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
2501 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
2502 continuous_on_mul ~> continuous_on_scaleR
2503 continuous_on_mul_real ~> continuous_on_mult
2504 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
2505 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
2506 continuous_on_inverse ~> continuous_on_inv
2507 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
2508 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
2509 subset_interior ~> interior_mono
2510 subset_closure ~> closure_mono
2511 closure_univ ~> closure_UNIV
2512 real_arch_lt ~> reals_Archimedean2
2513 real_arch ~> reals_Archimedean3
2514 real_abs_norm ~> abs_norm_cancel
2515 real_abs_sub_norm ~> norm_triangle_ineq3
2516 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
2518 * Session HOL-Probability:
2519 - Caratheodory's extension lemma is now proved for ring_of_sets.
2520 - Infinite products of probability measures are now available.
2521 - Sigma closure is independent, if the generator is independent
2522 - Use extended reals instead of positive extended
2523 reals. INCOMPATIBILITY.
2525 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
2527 expand_fun_below ~> fun_below_iff
2528 below_fun_ext ~> fun_belowI
2529 expand_cfun_eq ~> cfun_eq_iff
2530 ext_cfun ~> cfun_eqI
2531 expand_cfun_below ~> cfun_below_iff
2532 below_cfun_ext ~> cfun_belowI
2533 monofun_fun_fun ~> fun_belowD
2534 monofun_fun_arg ~> monofunE
2535 monofun_lub_fun ~> adm_monofun [THEN admD]
2536 cont_lub_fun ~> adm_cont [THEN admD]
2537 cont2cont_Rep_CFun ~> cont2cont_APP
2538 cont_Rep_CFun_app ~> cont_APP_app
2539 cont_Rep_CFun_app_app ~> cont_APP_app_app
2540 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
2541 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
2542 contlub_cfun ~> lub_APP [symmetric]
2543 contlub_LAM ~> lub_LAM [symmetric]
2546 lift_distinct1 ~> lift.distinct(1)
2547 lift_distinct2 ~> lift.distinct(2)
2548 Def_not_UU ~> lift.distinct(2)
2549 Def_inject ~> lift.inject
2550 below_UU_iff ~> below_bottom_iff
2551 eq_UU_iff ~> eq_bottom_iff
2554 *** Document preparation ***
2556 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
2557 isar-ref manual, both for description and actual application of the
2560 * Antiquotation @{value} evaluates the given term and presents its
2563 * Antiquotations: term style "isub" provides ad-hoc conversion of
2564 variables x1, y23 into subscripted form x\<^isub>1,
2565 y\<^isub>2\<^isub>3.
2567 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
2568 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
2570 * Localized \isabellestyle switch can be used within blocks or groups
2573 \isabellestyle{it} %preferred default
2574 {\isabellestylett @{text "typewriter stuff"}}
2576 * Discontinued special treatment of hard tabulators. Implicit
2577 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual
2583 * The inner syntax of sort/type/term/prop supports inlined YXML
2584 representations within quoted string tokens. By encoding logical
2585 entities via Term_XML (in ML or Scala) concrete syntax can be
2586 bypassed, which is particularly useful for producing bits of text
2587 under external program control.
2589 * Antiquotations for ML and document preparation are managed as theory
2590 data, which requires explicit setup.
2592 * Isabelle_Process.is_active allows tools to check if the official
2593 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
2594 (better known as Proof General).
2596 * Structure Proof_Context follows standard naming scheme. Old
2597 ProofContext is still available for some time as legacy alias.
2599 * Structure Timing provides various operations for timing; supersedes
2600 former start_timing/end_timing etc.
2602 * Path.print is the official way to show file-system paths to users
2603 (including quotes etc.).
2605 * Inner syntax: identifiers in parse trees of generic categories
2606 "logic", "aprop", "idt" etc. carry position information (disguised as
2607 type constraints). Occasional INCOMPATIBILITY with non-compliant
2608 translations that choke on unexpected type constraints. Positions can
2609 be stripped in ML translations via Syntax.strip_positions /
2610 Syntax.strip_positions_ast, or via the syntax constant
2611 "_strip_positions" within parse trees. As last resort, positions can
2612 be disabled via the configuration option Syntax.positions, which is
2613 called "syntax_positions" in Isar attribute syntax.
2615 * Discontinued special status of various ML structures that contribute
2616 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
2617 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
2618 refer directly to Ast.Constant, Lexicon.is_identifier,
2619 Syntax_Trans.mk_binder_tr etc.
2621 * Typed print translation: discontinued show_sorts argument, which is
2622 already available via context of "advanced" translation.
2624 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
2625 goal states; body tactic needs to address all subgoals uniformly.
2627 * Slightly more special eq_list/eq_set, with shortcut involving
2628 pointer equality (assumes that eq relation is reflexive).
2630 * Classical tactics use proper Proof.context instead of historic types
2631 claset/clasimpset. Old-style declarations like addIs, addEs, addDs
2632 operate directly on Proof.context. Raw type claset retains its use as
2633 snapshot of the classical context, which can be recovered via
2634 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.
2635 INCOMPATIBILITY, classical tactics and derived proof methods require
2636 proper Proof.context.
2641 * Discontinued support for Poly/ML 5.2, which was the last version
2642 without proper multithreading and TimeLimit implementation.
2644 * Discontinued old lib/scripts/polyml-platform, which has been
2645 obsolete since Isabelle2009-2.
2647 * Various optional external tools are referenced more robustly and
2648 uniformly by explicit Isabelle settings as follows:
2650 ISABELLE_CSDP (formerly CSDP_EXE)
2651 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)
2652 ISABELLE_OCAML (formerly EXEC_OCAML)
2653 ISABELLE_SWIPL (formerly EXEC_SWIPL)
2654 ISABELLE_YAP (formerly EXEC_YAP)
2656 Note that automated detection from the file-system or search path has
2657 been discontinued. INCOMPATIBILITY.
2659 * Scala layer provides JVM method invocation service for static
2660 methods of type (String)String, see Invoke_Scala.method in ML. For
2663 Invoke_Scala.method "java.lang.System.getProperty" "java.home"
2665 Together with YXML.string_of_body/parse_body and XML.Encode/Decode
2666 this allows to pass structured values between ML and Scala.
2668 * The IsabelleText fonts includes some further glyphs to support the
2669 Prover IDE. Potential INCOMPATIBILITY: users who happen to have
2670 installed a local copy (which is normally *not* required) need to
2671 delete or update it from ~~/lib/fonts/.
2675 New in Isabelle2011 (January 2011)
2676 ----------------------------------
2680 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
2681 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
2682 useful tooltips and hyperlinks produced from its static analysis. The
2683 bundled component provides an executable Isabelle tool that can be run
2686 Isabelle2011/bin/isabelle jedit
2688 * Significantly improved Isabelle/Isar implementation manual.
2690 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
2691 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
2692 while the default heap location within that directory lacks that extra
2693 suffix. This isolates multiple Isabelle installations from each
2694 other, avoiding problems with old settings in new versions.
2695 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
2697 * Source files are always encoded as UTF-8, instead of old-fashioned
2698 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
2699 the following package declarations:
2701 \usepackage[utf8]{inputenc}
2702 \usepackage{textcomp}
2704 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
2705 a Unicode character is treated as a single symbol, not a sequence of
2706 non-ASCII bytes as before. Since Isabelle/ML string literals may
2707 contain symbols without further backslash escapes, Unicode can now be
2708 used here as well. Recall that Symbol.explode in ML provides a
2709 consistent view on symbols, while raw explode (or String.explode)
2710 merely give a byte-oriented representation.
2712 * Theory loader: source files are primarily located via the master
2713 directory of each theory node (where the .thy file itself resides).
2714 The global load path is still partially available as legacy feature.
2715 Minor INCOMPATIBILITY due to subtle change in file lookup: use
2716 explicit paths, relatively to the theory.
2718 * Special treatment of ML file names has been discontinued.
2719 Historically, optional extensions .ML or .sml were added on demand --
2720 at the cost of clarity of file dependencies. Recall that Isabelle/ML
2721 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
2723 * Various options that affect pretty printing etc. are now properly
2724 handled within the context via configuration options, instead of
2725 unsynchronized references or print modes. There are both ML Config.T
2726 entities and Isar declaration attributes to access these.
2728 ML (Config.T) Isar (attribute)
2730 eta_contract eta_contract
2731 show_brackets show_brackets
2732 show_sorts show_sorts
2733 show_types show_types
2734 show_question_marks show_question_marks
2735 show_consts show_consts
2736 show_abbrevs show_abbrevs
2738 Syntax.ast_trace syntax_ast_trace
2739 Syntax.ast_stat syntax_ast_stat
2740 Syntax.ambiguity_level syntax_ambiguity_level
2742 Goal_Display.goals_limit goals_limit
2743 Goal_Display.show_main_goal show_main_goal
2745 Method.rule_trace rule_trace
2747 Thy_Output.display thy_output_display
2748 Thy_Output.quotes thy_output_quotes
2749 Thy_Output.indent thy_output_indent
2750 Thy_Output.source thy_output_source
2751 Thy_Output.break thy_output_break
2753 Note that corresponding "..._default" references in ML may only be
2754 changed globally at the ROOT session setup, but *not* within a theory.
2755 The option "show_abbrevs" supersedes the former print mode
2756 "no_abbrevs" with inverted meaning.
2758 * More systematic naming of some configuration options.
2761 trace_simp ~> simp_trace
2762 debug_simp ~> simp_debug
2764 * Support for real valued configuration options, using simplistic
2765 floating-point notation that coincides with the inner syntax for
2768 * Support for real valued preferences (with approximative PGIP type):
2769 front-ends need to accept "pgint" values in float notation.
2772 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
2775 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
2780 * Command 'type_synonym' (with single argument) replaces somewhat
2781 outdated 'types', which is still available as legacy feature for some
2784 * Command 'nonterminal' (with 'and' separated list of arguments)
2785 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
2787 * Command 'notepad' replaces former 'example_proof' for
2788 experimentation in Isar without any result. INCOMPATIBILITY.
2790 * Locale interpretation commands 'interpret' and 'sublocale' accept
2791 lists of equations to map definitions in a locale to appropriate
2792 entities in the context of the interpretation. The 'interpretation'
2793 command already provided this functionality.
2795 * Diagnostic command 'print_dependencies' prints the locale instances
2796 that would be activated if the specified expression was interpreted in
2797 the current context. Variant "print_dependencies!" assumes a context
2798 without interpretations.
2800 * Diagnostic command 'print_interps' prints interpretations in proofs
2801 in addition to interpretations in theories.
2803 * Discontinued obsolete 'global' and 'local' commands to manipulate
2804 the theory name space. Rare INCOMPATIBILITY. The ML functions
2805 Sign.root_path and Sign.local_path may be applied directly where this
2806 feature is still required for historical reasons.
2808 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
2809 'definition' instead.
2811 * The "prems" fact, which refers to the accidental collection of
2812 foundational premises in the context, is now explicitly marked as
2813 legacy feature and will be discontinued soon. Consider using "assms"
2814 of the head statement or reference facts by explicit names.
2816 * Document antiquotations @{class} and @{type} print classes and type
2819 * Document antiquotation @{file} checks file/directory entries within
2820 the local file system.
2825 * Coercive subtyping: functions can be declared as coercions and type
2826 inference will add them as necessary upon input of a term. Theory
2827 Complex_Main declares real :: nat => real and real :: int => real as
2828 coercions. A coercion function f is declared like this:
2830 declare [[coercion f]]
2832 To lift coercions through type constructors (e.g. from nat => real to
2833 nat list => real list), map functions can be declared, e.g.
2835 declare [[coercion_map map]]
2837 Currently coercion inference is activated only in theories including
2838 real numbers, i.e. descendants of Complex_Main. This is controlled by
2839 the configuration option "coercion_enabled", e.g. it can be enabled in
2840 other theories like this:
2842 declare [[coercion_enabled]]
2844 * Command 'partial_function' provides basic support for recursive
2845 function definitions over complete partial orders. Concrete instances
2846 are provided for i) the option type, ii) tail recursion on arbitrary
2847 types, and iii) the heap monad of Imperative_HOL. See
2848 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
2851 * Function package: f.psimps rules are no longer implicitly declared
2852 as [simp]. INCOMPATIBILITY.
2854 * Datatype package: theorems generated for executable equality (class
2855 "eq") carry proper names and are treated as default code equations.
2857 * Inductive package: now offers command 'inductive_simps' to
2858 automatically derive instantiated and simplified equations for
2859 inductive predicates, similar to 'inductive_cases'.
2861 * Command 'enriched_type' allows to register properties of the
2862 functorial structure of types.
2864 * Improved infrastructure for term evaluation using code generator
2865 techniques, in particular static evaluation conversions.
2867 * Code generator: Scala (2.8 or higher) has been added to the target
2870 * Code generator: globbing constant expressions "*" and "Theory.*"
2871 have been replaced by the more idiomatic "_" and "Theory._".
2874 * Code generator: export_code without explicit file declaration prints
2875 to standard output. INCOMPATIBILITY.
2877 * Code generator: do not print function definitions for case
2878 combinators any longer.
2880 * Code generator: simplification with rules determined with
2881 src/Tools/Code/code_simp.ML and method "code_simp".
2883 * Code generator for records: more idiomatic representation of record
2884 types. Warning: records are not covered by ancient SML code
2885 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
2886 rep_datatype declaration helps to succeed then:
2890 rep_datatype foo_ext ...
2892 * Records: logical foundation type for records does not carry a
2893 '_type' suffix any longer (obsolete due to authentic syntax).
2896 * Quickcheck now by default uses exhaustive testing instead of random
2897 testing. Random testing can be invoked by "quickcheck [random]",
2898 exhaustive testing by "quickcheck [exhaustive]".
2900 * Quickcheck instantiates polymorphic types with small finite
2901 datatypes by default. This enables a simple execution mechanism to
2902 handle quantifiers and function equality over the finite datatypes.
2904 * Quickcheck random generator has been renamed from "code" to
2905 "random". INCOMPATIBILITY.
2907 * Quickcheck now has a configurable time limit which is set to 30
2908 seconds by default. This can be changed by adding [timeout = n] to the
2909 quickcheck command. The time limit for Auto Quickcheck is still set
2912 * Quickcheck in locales considers interpretations of that locale for
2913 counter example search.
2916 - Added "smt" and "remote_smt" provers based on the "smt" proof
2917 method. See the Sledgehammer manual for details ("isabelle doc
2920 sledgehammer atp_info ~> sledgehammer running_provers
2921 sledgehammer atp_kill ~> sledgehammer kill_provers
2922 sledgehammer available_atps ~> sledgehammer available_provers
2925 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
2926 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
2927 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
2928 (and "ms" and "min" are no longer supported)
2933 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
2934 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
2936 - Added support for partial quotient types.
2937 - Added local versions of the "Nitpick.register_xxx" functions.
2938 - Added "whack" option.
2939 - Allow registration of quotient types as codatatypes.
2940 - Improved "merge_type_vars" option to merge more types.
2941 - Removed unsound "fast_descrs" option.
2942 - Added custom symmetry breaking for datatypes, making it possible to reach
2943 higher cardinalities.
2944 - Prevent the expansion of too large definitions.
2946 * Proof methods "metis" and "meson" now have configuration options
2947 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
2948 to diagnose these tools. E.g.
2950 using [[metis_trace = true]]
2952 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
2953 manually as command 'solve_direct'.
2955 * The default SMT solver Z3 must be enabled explicitly (due to
2956 licensing issues) by setting the environment variable
2957 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
2958 commercial applications, the SMT solver CVC3 is provided as fall-back;
2959 changing the SMT solver is done via the configuration option
2962 * Remote SMT solvers need to be referred to by the "remote_" prefix,
2963 i.e. "remote_cvc3" and "remote_z3".
2965 * Added basic SMT support for datatypes, records, and typedefs using
2966 the oracle mode (no proofs). Direct support of pairs has been dropped
2967 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
2968 support for a similar behavior). Minor INCOMPATIBILITY.
2970 * Changed SMT configuration options:
2972 z3_proofs ~> smt_oracle (with inverted meaning)
2973 z3_trace_assms ~> smt_trace_used_facts
2986 * Boogie output files (.b2i files) need to be declared in the theory
2989 * Simplification procedure "list_to_set_comprehension" rewrites list
2990 comprehensions applied to List.set to set comprehensions. Occasional
2991 INCOMPATIBILITY, may be deactivated like this:
2993 declare [[simproc del: list_to_set_comprehension]]
2995 * Removed old version of primrec package. INCOMPATIBILITY.
2997 * Removed simplifier congruence rule of "prod_case", as has for long
2998 been the case with "split". INCOMPATIBILITY.
3000 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
3002 * Removed [split_format ... and ... and ...] version of
3003 [split_format]. Potential INCOMPATIBILITY.
3005 * Predicate "sorted" now defined inductively, with nice induction
3006 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
3008 * Constant "contents" renamed to "the_elem", to free the generic name
3009 contents for other uses. INCOMPATIBILITY.
3011 * Renamed class eq and constant eq (for code generation) to class
3012 equal and constant equal, plus renaming of related facts and various
3013 tuning. INCOMPATIBILITY.
3015 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
3017 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
3020 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
3021 avoid confusion with finite sets. INCOMPATIBILITY.
3023 * Abandoned locales equiv, congruent and congruent2 for equivalence
3024 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
3027 * Some previously unqualified names have been qualified:
3034 Trueprop ~> HOL.Trueprop
3039 op --> ~> HOL.implies
3051 Pair ~> Product_Type.Pair
3052 fst ~> Product_Type.fst
3053 snd ~> Product_Type.snd
3054 curry ~> Product_Type.curry
3056 Collect ~> Set.Collect
3060 * More canonical naming convention for some fundamental definitions:
3062 bot_bool_eq ~> bot_bool_def
3063 top_bool_eq ~> top_bool_def
3064 inf_bool_eq ~> inf_bool_def
3065 sup_bool_eq ~> sup_bool_def
3066 bot_fun_eq ~> bot_fun_def
3067 top_fun_eq ~> top_fun_def
3068 inf_fun_eq ~> inf_fun_def
3069 sup_fun_eq ~> sup_fun_def
3073 * More stylized fact names:
3075 expand_fun_eq ~> fun_eq_iff
3076 expand_set_eq ~> set_eq_iff
3078 nat_number ~> eval_nat_numeral
3082 * Refactoring of code-generation specific operations in theory List:
3088 mem_iff ~> member_def
3089 null_empty ~> null_def
3091 INCOMPATIBILITY. Note that these were not supposed to be used
3092 regularly unless for striking reasons; their main purpose was code
3095 Various operations from the Haskell prelude are used for generating
3098 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
3099 "surj f" is now an abbreviation of "range f = UNIV". The theorems
3100 bij_def and surj_def are unchanged. INCOMPATIBILITY.
3102 * Abolished some non-alphabetic type names: "prod" and "sum" replace
3103 "*" and "+" respectively. INCOMPATIBILITY.
3105 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
3106 "Sum_Type.Plus" instead.
3108 * Constant "split" has been merged with constant "prod_case"; names of
3109 ML functions, facts etc. involving split have been retained so far,
3110 though. INCOMPATIBILITY.
3112 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
3113 instead. INCOMPATIBILITY.
3115 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
3118 * Former theory Library/Enum is now part of the HOL-Main image.
3119 INCOMPATIBILITY: all constants of the Enum theory now have to be
3120 referred to by its qualified name.
3123 nlists ~> Enum.nlists
3124 product ~> Enum.product
3126 * Theory Library/Monad_Syntax provides do-syntax for monad types.
3127 Syntax in Library/State_Monad has been changed to avoid ambiguities.
3130 * Theory Library/SetsAndFunctions has been split into
3131 Library/Function_Algebras and Library/Set_Algebras; canonical names
3132 for instance definitions for functions; various improvements.
3135 * Theory Library/Multiset provides stable quicksort implementation of
3138 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
3141 * Session Multivariate_Analysis: introduced a type class for euclidean
3142 space. Most theorems are now stated in terms of euclidean spaces
3143 instead of finite cartesian products.
3146 real ^ 'n ~> 'a::real_vector
3147 ~> 'a::euclidean_space
3148 ~> 'a::ordered_euclidean_space
3149 (depends on your needs)
3153 \<chi> x. _ ~> \<chi>\<chi> x. _
3156 Also note that the indices are now natural numbers and not from some
3157 finite type. Finite cartesian products of euclidean spaces, products
3158 of euclidean spaces the real and complex numbers are instantiated to
3159 be euclidean_spaces. INCOMPATIBILITY.
3161 * Session Probability: introduced pextreal as positive extended real
3162 numbers. Use pextreal as value for measures. Introduce the
3163 Radon-Nikodym derivative, product spaces and Fubini's theorem for
3164 arbitrary sigma finite measures. Introduces Lebesgue measure based on
3165 the integral in Multivariate Analysis. INCOMPATIBILITY.
3167 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
3170 * Session SPARK (with image HOL-SPARK) provides commands to load and
3171 prove verification conditions generated by the SPARK Ada program
3172 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
3177 * Theorems for additive ring operations (locale abelian_monoid and
3178 descendants) are generated by interpretation from their multiplicative
3179 counterparts. Names (in particular theorem names) have the mandatory
3180 qualifier 'add'. Previous theorem names are redeclared for
3183 * Structure "int_ring" is now an abbreviation (previously a
3184 definition). This fits more natural with advanced interpretations.
3189 * The domain package now runs in definitional mode by default: The
3190 former command 'new_domain' is now called 'domain'. To use the domain
3191 package in its original axiomatic mode, use 'domain (unsafe)'.
3194 * The new class "domain" is now the default sort. Class "predomain"
3195 is an unpointed version of "domain". Theories can be updated by
3196 replacing sort annotations as shown below. INCOMPATIBILITY.
3198 'a::type ~> 'a::countable
3199 'a::cpo ~> 'a::predomain
3200 'a::pcpo ~> 'a::domain
3202 * The old type class "rep" has been superseded by class "domain".
3203 Accordingly, users of the definitional package must remove any
3204 "default_sort rep" declarations. INCOMPATIBILITY.
3206 * The domain package (definitional mode) now supports unpointed
3207 predomain argument types, as long as they are marked 'lazy'. (Strict
3208 arguments must be in class "domain".) For example, the following
3209 domain definition now works:
3211 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
3213 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
3214 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
3215 'a option, and 'a list. Additionally, it configures fixrec and the
3216 domain package to work with these types. For example:
3218 fixrec isInl :: "('a + 'b) u -> tr"
3219 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
3221 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
3223 * The "(permissive)" option of fixrec has been replaced with a
3224 per-equation "(unchecked)" option. See
3225 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
3227 * The "bifinite" class no longer fixes a constant "approx"; the class
3228 now just asserts that such a function exists. INCOMPATIBILITY.
3230 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
3231 defines an embedding of type 'a defl into udom by default; instances
3232 of "bifinite" and "domain" classes are available in
3233 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
3235 * The syntax "REP('a)" has been replaced with "DEFL('a)".
3237 * The predicate "directed" has been removed. INCOMPATIBILITY.
3239 * The type class "finite_po" has been removed. INCOMPATIBILITY.
3241 * The function "cprod_map" has been renamed to "prod_map".
3244 * The monadic bind operator on each powerdomain has new binder syntax
3245 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
3246 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
3248 * The infix syntax for binary union on each powerdomain has changed
3249 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
3250 syntax. INCOMPATIBILITY.
3252 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
3253 still supported as an input translation.
3255 * Renamed some theorems (the original names are also still available).
3257 expand_fun_below ~> fun_below_iff
3258 below_fun_ext ~> fun_belowI
3259 expand_cfun_eq ~> cfun_eq_iff
3260 ext_cfun ~> cfun_eqI
3261 expand_cfun_below ~> cfun_below_iff
3262 below_cfun_ext ~> cfun_belowI
3263 cont2cont_Rep_CFun ~> cont2cont_APP
3265 * The Abs and Rep functions for various types have changed names.
3266 Related theorem names have also changed to match. INCOMPATIBILITY.
3268 Rep_CFun ~> Rep_cfun
3269 Abs_CFun ~> Abs_cfun
3270 Rep_Sprod ~> Rep_sprod
3271 Abs_Sprod ~> Abs_sprod
3272 Rep_Ssum ~> Rep_ssum
3273 Abs_Ssum ~> Abs_ssum
3275 * Lemmas with names of the form *_defined_iff or *_strict_iff have
3276 been renamed to *_bottom_iff. INCOMPATIBILITY.
3278 * Various changes to bisimulation/coinduction with domain package:
3280 - Definitions of "bisim" constants no longer mention definedness.
3281 - With mutual recursion, "bisim" predicate is now curried.
3282 - With mutual recursion, each type gets a separate coind theorem.
3283 - Variable names in bisim_def and coinduct rules have changed.
3287 * Case combinators generated by the domain package for type "foo" are
3288 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
3290 * Several theorems have been renamed to more accurately reflect the
3291 names of constants and types involved. INCOMPATIBILITY.
3293 thelub_const ~> lub_const
3294 lub_const ~> is_lub_const
3296 is_lub_lub ~> is_lubD2
3298 unique_lub ~> is_lub_unique
3299 is_ub_lub ~> is_lub_rangeD1
3300 lub_bin_chain ~> is_lub_bin_chain
3301 lub_fun ~> is_lub_fun
3302 thelub_fun ~> lub_fun
3303 thelub_cfun ~> lub_cfun
3304 thelub_Pair ~> lub_Pair
3305 lub_cprod ~> is_lub_prod
3306 thelub_cprod ~> lub_prod
3307 minimal_cprod ~> minimal_prod
3308 inst_cprod_pcpo ~> inst_prod_pcpo
3310 compact_UU ~> compact_bottom
3311 deflation_UU ~> deflation_bottom
3312 finite_deflation_UU ~> finite_deflation_bottom
3314 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
3316 sq_ord_less_eq_trans ~> below_eq_trans
3317 sq_ord_eq_less_trans ~> eq_below_trans
3318 refl_less ~> below_refl
3319 trans_less ~> below_trans
3320 antisym_less ~> below_antisym
3321 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
3322 box_less ~> box_below
3323 rev_trans_less ~> rev_below_trans
3324 not_less2not_eq ~> not_below2not_eq
3325 less_UU_iff ~> below_UU_iff
3326 flat_less_iff ~> flat_below_iff
3327 adm_less ~> adm_below
3328 adm_not_less ~> adm_not_below
3329 adm_compact_not_less ~> adm_compact_not_below
3330 less_fun_def ~> below_fun_def
3331 expand_fun_less ~> fun_below_iff
3332 less_fun_ext ~> fun_belowI
3333 less_discr_def ~> below_discr_def
3334 discr_less_eq ~> discr_below_eq
3335 less_unit_def ~> below_unit_def
3336 less_cprod_def ~> below_prod_def
3337 prod_lessI ~> prod_belowI
3338 Pair_less_iff ~> Pair_below_iff
3339 fst_less_iff ~> fst_below_iff
3340 snd_less_iff ~> snd_below_iff
3341 expand_cfun_less ~> cfun_below_iff
3342 less_cfun_ext ~> cfun_belowI
3343 injection_less ~> injection_below
3344 less_up_def ~> below_up_def
3345 not_Iup_less ~> not_Iup_below
3346 Iup_less ~> Iup_below
3348 Def_inject_less_eq ~> Def_below_Def
3349 Def_less_is_eq ~> Def_below_iff
3350 spair_less_iff ~> spair_below_iff
3351 less_sprod ~> below_sprod
3352 spair_less ~> spair_below
3353 sfst_less_iff ~> sfst_below_iff
3354 ssnd_less_iff ~> ssnd_below_iff
3355 fix_least_less ~> fix_least_below
3356 dist_less_one ~> dist_below_one
3357 less_ONE ~> below_ONE
3358 ONE_less_iff ~> ONE_below_iff
3359 less_sinlD ~> below_sinlD
3360 less_sinrD ~> below_sinrD
3365 * All constant names are now qualified internally and use proper
3366 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
3371 * Antiquotation @{assert} inlines a function bool -> unit that raises
3372 Fail if the argument is false. Due to inlining the source position of
3373 failed assertions is included in the error output.
3375 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
3376 text is in practice always evaluated with a stable theory checkpoint.
3377 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
3379 * Antiquotation @{theory A} refers to theory A from the ancestry of
3380 the current context, not any accidental theory loader state as before.
3381 Potential INCOMPATIBILITY, subtle change in semantics.
3383 * Syntax.pretty_priority (default 0) configures the required priority
3384 of pretty-printed output and thus affects insertion of parentheses.
3386 * Syntax.default_root (default "any") configures the inner syntax
3387 category (nonterminal symbol) for parsing of terms.
3389 * Former exception Library.UnequalLengths now coincides with
3390 ListPair.UnequalLengths.
3392 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
3393 main functionality is provided by structure Simplifier.
3395 * Renamed raw "explode" function to "raw_explode" to emphasize its
3396 meaning. Note that internally to Isabelle, Symbol.explode is used in
3397 almost all situations.
3399 * Discontinued obsolete function sys_error and exception SYS_ERROR.
3400 See implementation manual for further details on exceptions in
3403 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
3406 * Renamed structure PureThy to Pure_Thy and moved most of its
3407 operations to structure Global_Theory, to emphasize that this is
3408 rarely-used global-only stuff.
3410 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
3411 instead (or tracing for high-volume output).
3413 * Configuration option show_question_marks only affects regular pretty
3414 printing of types and terms, not raw Term.string_of_vname.
3416 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
3417 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
3418 @{thms} for most purposes.
3420 * ML structure Unsynchronized is never opened, not even in Isar
3421 interaction mode as before. Old Unsynchronized.set etc. have been
3422 discontinued -- use plain := instead. This should be *rare* anyway,
3423 since modern tools always work via official context data, notably
3424 configuration options.
3426 * Parallel and asynchronous execution requires special care concerning
3427 interrupts. Structure Exn provides some convenience functions that
3428 avoid working directly with raw Interrupt. User code must not absorb
3429 interrupts -- intermediate handling (for cleanup etc.) needs to be
3430 followed by re-raising of the original exception. Another common
3431 source of mistakes are "handle _" patterns, which make the meaning of
3432 the program subject to physical effects of the environment.
3436 New in Isabelle2009-2 (June 2010)
3437 ---------------------------------
3441 * Authentic syntax for *all* logical entities (type classes, type
3442 constructors, term constants): provides simple and robust
3443 correspondence between formal entities and concrete syntax. Within
3444 the parse tree / AST representations, "constants" are decorated by
3445 their category (class, type, const) and spelled out explicitly with
3446 their full internal name.
3448 Substantial INCOMPATIBILITY concerning low-level syntax declarations
3449 and translations (translation rules and translation functions in ML).
3450 Some hints on upgrading:
3452 - Many existing uses of 'syntax' and 'translations' can be replaced
3453 by more modern 'type_notation', 'notation' and 'abbreviation',
3454 which are independent of this issue.
3456 - 'translations' require markup within the AST; the term syntax
3457 provides the following special forms:
3459 CONST c -- produces syntax version of constant c from context
3460 XCONST c -- literally c, checked as constant from context
3461 c -- literally c, if declared by 'syntax'
3463 Plain identifiers are treated as AST variables -- occasionally the
3464 system indicates accidental variables via the error "rhs contains
3467 Type classes and type constructors are marked according to their
3468 concrete syntax. Some old translations rules need to be written
3469 for the "type" category, using type constructor application
3470 instead of pseudo-term application of the default category
3473 - 'parse_translation' etc. in ML may use the following
3476 @{class_syntax c} -- type class c within parse tree / AST
3477 @{term_syntax c} -- type constructor c within parse tree / AST
3478 @{const_syntax c} -- ML version of "CONST c" above
3479 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
3481 - Literal types within 'typed_print_translations', i.e. those *not*
3482 represented as pseudo-terms are represented verbatim. Use @{class
3483 c} or @{type_name c} here instead of the above syntax
3486 Note that old non-authentic syntax was based on unqualified base
3487 names, so all of the above "constant" names would coincide. Recall
3488 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
3489 diagnose syntax problems.
3491 * Type constructors admit general mixfix syntax, not just infix.
3493 * Concrete syntax may be attached to local entities without a proof
3494 body, too. This works via regular mixfix annotations for 'fix',
3495 'def', 'obtain' etc. or via the explicit 'write' command, which is
3496 similar to the 'notation' command in theory specifications.
3498 * Discontinued unnamed infix syntax (legacy feature for many years) --
3499 need to specify constant name and syntax separately. Internal ML
3500 datatype constructors have been renamed from InfixName to Infix etc.
3501 Minor INCOMPATIBILITY.
3503 * Schematic theorem statements need to be explicitly markup as such,
3504 via commands 'schematic_lemma', 'schematic_theorem',
3505 'schematic_corollary'. Thus the relevance of the proof is made
3506 syntactically clear, which impacts performance in a parallel or
3507 asynchronous interactive environment. Minor INCOMPATIBILITY.
3509 * Use of cumulative prems via "!" in some proof methods has been
3510 discontinued (old legacy feature).
3512 * References 'trace_simp' and 'debug_simp' have been replaced by
3513 configuration options stored in the context. Enabling tracing (the
3514 case of debugging is similar) in proofs works via
3516 using [[trace_simp = true]]
3518 Tracing is then active for all invocations of the simplifier in
3519 subsequent goal refinement steps. Tracing may also still be enabled or
3520 disabled via the ProofGeneral settings menu.
3522 * Separate commands 'hide_class', 'hide_type', 'hide_const',
3523 'hide_fact' replace the former 'hide' KIND command. Minor
3526 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
3527 more efficient than combinations with -q1 or -q2.
3532 * Proofterms record type-class reasoning explicitly, using the
3533 "unconstrain" operation internally. This eliminates all sort
3534 constraints from a theorem and proof, introducing explicit
3535 OFCLASS-premises. On the proof term level, this operation is
3536 automatically applied at theorem boundaries, such that closed proofs
3537 are always free of sort constraints. INCOMPATIBILITY for tools that
3538 inspect proof terms.
3540 * Local theory specifications may depend on extra type variables that
3541 are not present in the result type -- arguments TYPE('a) :: 'a itself
3542 are added internally. For example:
3544 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
3546 * Predicates of locales introduced by classes carry a mandatory
3547 "class" prefix. INCOMPATIBILITY.
3549 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
3551 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
3554 * Command 'code_reflect' allows to incorporate generated ML code into
3555 runtime environment; replaces immature code_datatype antiquotation.
3558 * Code generator: simple concept for abstract datatypes obeying
3561 * Code generator: details of internal data cache have no impact on the
3562 user space functionality any longer.
3564 * Methods "unfold_locales" and "intro_locales" ignore non-locale
3565 subgoals. This is more appropriate for interpretations with 'where'.
3568 * Command 'example_proof' opens an empty proof body. This allows to
3569 experiment with Isar, without producing any persistent result.
3571 * Commands 'type_notation' and 'no_type_notation' declare type syntax
3572 within a local theory context, with explicit checking of the
3573 constructors involved (in contrast to the raw 'syntax' versions).
3575 * Commands 'types' and 'typedecl' now work within a local theory
3576 context -- without introducing dependencies on parameters or
3577 assumptions, which is not possible in Isabelle/Pure.
3579 * Command 'defaultsort' has been renamed to 'default_sort', it works
3580 within a local theory context. Minor INCOMPATIBILITY.
3585 * Command 'typedef' now works within a local theory context -- without
3586 introducing dependencies on parameters or assumptions, which is not
3587 possible in Isabelle/Pure/HOL. Note that the logical environment may
3588 contain multiple interpretations of local typedefs (with different
3589 non-emptiness proofs), even in a global theory context.
3591 * New package for quotient types. Commands 'quotient_type' and
3592 'quotient_definition' may be used for defining types and constants by
3593 quotient constructions. An example is the type of integers created by
3594 quotienting pairs of natural numbers:
3597 intrel :: "(nat * nat) => (nat * nat) => bool"
3599 "intrel (x, y) (u, v) = (x + v = u + y)"
3601 quotient_type int = "nat * nat" / intrel
3602 by (auto simp add: equivp_def expand_fun_eq)
3605 "0::int" is "(0::nat, 0::nat)"
3607 The method "lifting" can be used to lift of theorems from the
3608 underlying "raw" type to the quotient type. The example
3609 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
3610 construction and provides a reasoning infrastructure for finite sets.
3612 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
3613 clash with new theory Quotient in Main HOL.
3615 * Moved the SMT binding into the main HOL session, eliminating
3616 separate HOL-SMT session.
3618 * List membership infix mem operation is only an input abbreviation.
3621 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
3622 for future developements; former Library/Word.thy is still present in
3623 the AFP entry RSAPPS.
3625 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
3626 longer shadowed. INCOMPATIBILITY.
3628 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
3631 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
3634 * Dropped normalizing_semiring etc; use the facts in semiring classes
3635 instead. INCOMPATIBILITY.
3637 * Dropped several real-specific versions of lemmas about floor and
3638 ceiling; use the generic lemmas from theory "Archimedean_Field"
3639 instead. INCOMPATIBILITY.
3641 floor_number_of_eq ~> floor_number_of
3642 le_floor_eq_number_of ~> number_of_le_floor
3643 le_floor_eq_zero ~> zero_le_floor
3644 le_floor_eq_one ~> one_le_floor
3645 floor_less_eq_number_of ~> floor_less_number_of
3646 floor_less_eq_zero ~> floor_less_zero
3647 floor_less_eq_one ~> floor_less_one
3648 less_floor_eq_number_of ~> number_of_less_floor
3649 less_floor_eq_zero ~> zero_less_floor
3650 less_floor_eq_one ~> one_less_floor
3651 floor_le_eq_number_of ~> floor_le_number_of
3652 floor_le_eq_zero ~> floor_le_zero
3653 floor_le_eq_one ~> floor_le_one
3654 floor_subtract_number_of ~> floor_diff_number_of
3655 floor_subtract_one ~> floor_diff_one
3656 ceiling_number_of_eq ~> ceiling_number_of
3657 ceiling_le_eq_number_of ~> ceiling_le_number_of
3658 ceiling_le_zero_eq ~> ceiling_le_zero
3659 ceiling_le_eq_one ~> ceiling_le_one
3660 less_ceiling_eq_number_of ~> number_of_less_ceiling
3661 less_ceiling_eq_zero ~> zero_less_ceiling
3662 less_ceiling_eq_one ~> one_less_ceiling
3663 ceiling_less_eq_number_of ~> ceiling_less_number_of
3664 ceiling_less_eq_zero ~> ceiling_less_zero
3665 ceiling_less_eq_one ~> ceiling_less_one
3666 le_ceiling_eq_number_of ~> number_of_le_ceiling
3667 le_ceiling_eq_zero ~> zero_le_ceiling
3668 le_ceiling_eq_one ~> one_le_ceiling
3669 ceiling_subtract_number_of ~> ceiling_diff_number_of
3670 ceiling_subtract_one ~> ceiling_diff_one
3672 * Theory "Finite_Set": various folding_XXX locales facilitate the
3673 application of the various fold combinators on finite sets.
3675 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
3676 provides abstract red-black tree type which is backed by "RBT_Impl" as
3677 implementation. INCOMPATIBILTY.
3679 * Theory Library/Coinductive_List has been removed -- superseded by
3680 AFP/thys/Coinductive.
3682 * Theory PReal, including the type "preal" and related operations, has
3683 been removed. INCOMPATIBILITY.
3685 * Real: new development using Cauchy Sequences.
3687 * Split off theory "Big_Operators" containing setsum, setprod,
3688 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
3690 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
3691 "Int" etc. INCOMPATIBILITY.
3693 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
3695 * New set of rules "ac_simps" provides combined assoc / commute
3696 rewrites for all interpretations of the appropriate generic locales.
3698 * Renamed theory "OrderedGroup" to "Groups" and split theory
3699 "Ring_and_Field" into theories "Rings" and "Fields"; for more
3700 appropriate and more consistent names suitable for name prefixes
3701 within the HOL theories. INCOMPATIBILITY.
3703 * Some generic constants have been put to appropriate theories:
3704 - less_eq, less: Orderings
3705 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
3706 - inverse, divide: Rings
3709 * More consistent naming of type classes involving orderings (and
3712 lower_semilattice ~> semilattice_inf
3713 upper_semilattice ~> semilattice_sup
3715 dense_linear_order ~> dense_linorder
3717 pordered_ab_group_add ~> ordered_ab_group_add
3718 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
3719 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
3720 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
3721 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
3722 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
3723 pordered_cancel_semiring ~> ordered_cancel_semiring
3724 pordered_comm_monoid_add ~> ordered_comm_monoid_add
3725 pordered_comm_ring ~> ordered_comm_ring
3726 pordered_comm_semiring ~> ordered_comm_semiring
3727 pordered_ring ~> ordered_ring
3728 pordered_ring_abs ~> ordered_ring_abs
3729 pordered_semiring ~> ordered_semiring
3731 ordered_ab_group_add ~> linordered_ab_group_add
3732 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
3733 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
3734 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
3735 ordered_field ~> linordered_field
3736 ordered_field_no_lb ~> linordered_field_no_lb
3737 ordered_field_no_ub ~> linordered_field_no_ub
3738 ordered_field_dense_linear_order ~> dense_linordered_field
3739 ordered_idom ~> linordered_idom
3740 ordered_ring ~> linordered_ring
3741 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
3742 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
3743 ordered_ring_strict ~> linordered_ring_strict
3744 ordered_semidom ~> linordered_semidom
3745 ordered_semiring ~> linordered_semiring
3746 ordered_semiring_1 ~> linordered_semiring_1
3747 ordered_semiring_1_strict ~> linordered_semiring_1_strict
3748 ordered_semiring_strict ~> linordered_semiring_strict
3750 The following slightly odd type classes have been moved to a
3751 separate theory Library/Lattice_Algebras:
3753 lordered_ab_group_add ~> lattice_ab_group_add
3754 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
3755 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
3756 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
3757 lordered_ring ~> lattice_ring
3761 * Refined field classes:
3762 - classes division_ring_inverse_zero, field_inverse_zero,
3763 linordered_field_inverse_zero include rule inverse 0 = 0 --
3764 subsumes former division_by_zero class;
3765 - numerous lemmas have been ported from field to division_ring.
3768 * Refined algebra theorem collections:
3769 - dropped theorem group group_simps, use algebra_simps instead;
3770 - dropped theorem group ring_simps, use field_simps instead;
3771 - proper theorem collection field_simps subsumes former theorem
3772 groups field_eq_simps and field_simps;
3773 - dropped lemma eq_minus_self_iff which is a duplicate for
3777 * Theory Finite_Set and List: some lemmas have been generalized from
3780 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
3781 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
3782 inter_Inter_fold_inter ~> inf_Inf_fold_inf
3783 union_Union_fold_union ~> sup_Sup_fold_sup
3784 Inter_fold_inter ~> Inf_fold_inf
3785 Union_fold_union ~> Sup_fold_sup
3786 inter_INTER_fold_inter ~> inf_INFI_fold_inf
3787 union_UNION_fold_union ~> sup_SUPR_fold_sup
3788 INTER_fold_inter ~> INFI_fold_inf
3789 UNION_fold_union ~> SUPR_fold_sup
3791 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
3792 replaced by the more convenient lemmas Inf_empty and Sup_empty.
3793 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
3794 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
3795 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
3796 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
3798 * Reorganized theory Multiset: swapped notation of pointwise and
3801 - pointwise ordering is instance of class order with standard syntax
3803 - multiset ordering has syntax <=# and <#; partial order properties
3804 are provided by means of interpretation with prefix
3806 - less duplication, less historical organization of sections,
3807 conversion from associations lists to multisets, rudimentary code
3809 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
3814 multiset_eq_conv_count_eq ~> multiset_ext_iff
3815 multi_count_ext ~> multiset_ext
3816 diff_union_inverse2 ~> diff_union_cancelR
3820 * Theory Permutation: replaced local "remove" by List.remove1.
3822 * Code generation: ML and OCaml code is decorated with signatures.
3824 * Theory List: added transpose.
3826 * Library/Nat_Bijection.thy is a collection of bijective functions
3827 between nat and other types, which supersedes the older libraries
3828 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
3831 Nat_Int_Bij.nat2_to_nat ~> prod_encode
3832 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
3833 Nat_Int_Bij.int_to_nat_bij ~> int_encode
3834 Nat_Int_Bij.nat_to_int_bij ~> int_decode
3835 Countable.pair_encode ~> prod_encode
3836 NatIso.prod2nat ~> prod_encode
3837 NatIso.nat2prod ~> prod_decode
3838 NatIso.sum2nat ~> sum_encode
3839 NatIso.nat2sum ~> sum_decode
3840 NatIso.list2nat ~> list_encode
3841 NatIso.nat2list ~> list_decode
3842 NatIso.set2nat ~> set_encode
3843 NatIso.nat2set ~> set_decode
3846 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
3847 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
3848 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
3849 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
3850 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
3851 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
3852 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
3853 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
3854 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
3855 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
3856 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
3857 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
3858 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
3861 - Renamed ATP commands:
3862 atp_info ~> sledgehammer running_atps
3863 atp_kill ~> sledgehammer kill_atps
3864 atp_messages ~> sledgehammer messages
3865 atp_minimize ~> sledgehammer minimize
3866 print_atps ~> sledgehammer available_atps
3868 - Added user's manual ("isabelle doc sledgehammer").
3869 - Added option syntax and "sledgehammer_params" to customize
3870 Sledgehammer's behavior. See the manual for details.
3871 - Modified the Isar proof reconstruction code so that it produces
3872 direct proofs rather than proofs by contradiction. (This feature
3873 is still experimental.)
3874 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
3876 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
3879 - Added and implemented "binary_ints" and "bits" options.
3880 - Added "std" option and implemented support for nonstandard models.
3881 - Added and implemented "finitize" option to improve the precision
3882 of infinite datatypes based on a monotonicity analysis.
3883 - Added support for quotient types.
3884 - Added support for "specification" and "ax_specification"
3886 - Added support for local definitions (for "function" and
3887 "termination" proofs).
3888 - Added support for term postprocessors.
3889 - Optimized "Multiset.multiset" and "FinFun.finfun".
3890 - Improved efficiency of "destroy_constrs" optimization.
3891 - Fixed soundness bugs related to "destroy_constrs" optimization and
3893 - Fixed soundness bug related to higher-order constructors.
3894 - Fixed soundness bug when "full_descrs" is enabled.
3895 - Improved precision of set constructs.
3896 - Added "atoms" option.
3897 - Added cache to speed up repeated Kodkod invocations on the same
3899 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
3900 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
3901 "SAT4J_Light". INCOMPATIBILITY.
3902 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
3903 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
3904 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
3906 * Method "induct" now takes instantiations of the form t, where t is not
3907 a variable, as a shorthand for "x == t", where x is a fresh variable.
3908 If this is not intended, t has to be enclosed in parentheses.
3909 By default, the equalities generated by definitional instantiations
3910 are pre-simplified, which may cause parameters of inductive cases
3911 to disappear, or may even delete some of the inductive cases.
3912 Use "induct (no_simp)" instead of "induct" to restore the old
3913 behaviour. The (no_simp) option is also understood by the "cases"
3914 and "nominal_induct" methods, which now perform pre-simplification, too.
3920 * Variable names in lemmas generated by the domain package have
3921 changed; the naming scheme is now consistent with the HOL datatype
3922 package. Some proof scripts may be affected, INCOMPATIBILITY.
3924 * The domain package no longer defines the function "foo_copy" for
3925 recursive domain "foo". The reach lemma is now stated directly in
3926 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
3927 be reformulated in terms of "foo_take", INCOMPATIBILITY.
3929 * Most definedness lemmas generated by the domain package (previously
3930 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
3931 like "foo$x = UU <-> x = UU", which works better as a simp rule.
3932 Proofs that used definedness lemmas as intro rules may break,
3933 potential INCOMPATIBILITY.
3935 * Induction and casedist rules generated by the domain package now
3936 declare proper case_names (one called "bottom", and one named for each
3937 constructor). INCOMPATIBILITY.
3939 * For mutually-recursive domains, separate "reach" and "take_lemma"
3940 rules are generated for each domain, INCOMPATIBILITY.
3942 foo_bar.reach ~> foo.reach bar.reach
3943 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
3945 * Some lemmas generated by the domain package have been renamed for
3946 consistency with the datatype package, INCOMPATIBILITY.
3948 foo.ind ~> foo.induct
3949 foo.finite_ind ~> foo.finite_induct
3950 foo.coind ~> foo.coinduct
3951 foo.casedist ~> foo.exhaust
3952 foo.exhaust ~> foo.nchotomy
3954 * For consistency with other definition packages, the fixrec package
3955 now generates qualified theorem names, INCOMPATIBILITY.
3957 foo_simps ~> foo.simps
3958 foo_unfold ~> foo.unfold
3959 foo_induct ~> foo.induct
3961 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
3962 method and internal fixrec proofs now use the default simpset instead.
3965 * The "contlub" predicate has been removed. Proof scripts should use
3966 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
3968 * The "admw" predicate has been removed, INCOMPATIBILITY.
3970 * The constants cpair, cfst, and csnd have been removed in favor of
3971 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
3976 * Antiquotations for basic formal entities:
3978 @{class NAME} -- type class
3979 @{class_syntax NAME} -- syntax representation of the above
3981 @{type_name NAME} -- logical type
3982 @{type_abbrev NAME} -- type abbreviation
3983 @{nonterminal NAME} -- type of concrete syntactic category
3984 @{type_syntax NAME} -- syntax representation of any of the above
3986 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
3987 @{const_abbrev NAME} -- abbreviated constant
3988 @{const_syntax NAME} -- syntax representation of any of the above
3990 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
3991 syntax constant (cf. 'syntax' command).
3993 * Antiquotation @{make_string} inlines a function to print arbitrary
3994 values similar to the ML toplevel. The result is compiler dependent
3995 and may fall back on "?" in certain situations.
3997 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
3998 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
3999 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
4000 not work with the asynchronous Isar document model.
4002 * Configuration options now admit dynamic default values, depending on
4003 the context or even global references.
4005 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
4006 uses an efficient external library if available (for Poly/ML).
4008 * Renamed some important ML structures, while keeping the old names
4009 for some time as aliases within the structure Legacy:
4011 OuterKeyword ~> Keyword
4014 OuterSyntax ~> Outer_Syntax
4015 PrintMode ~> Print_Mode
4016 SpecParse ~> Parse_Spec
4019 ThyOutput ~> Thy_Output
4020 TypeInfer ~> Type_Infer
4022 Note that "open Legacy" simplifies porting of sources, but forgetting
4023 to remove it again will complicate porting again in the future.
4025 * Most operations that refer to a global context are named
4026 accordingly, e.g. Simplifier.global_context or
4027 ProofContext.init_global. There are some situations where a global
4028 context actually works, but under normal circumstances one needs to
4029 pass the proper local context through the code!
4031 * Discontinued old TheoryDataFun with its copy/init operation -- data
4032 needs to be pure. Functor Theory_Data_PP retains the traditional
4033 Pretty.pp argument to merge, which is absent in the standard
4034 Theory_Data version.
4036 * Sorts.certify_sort and derived "cert" operations for types and terms
4037 no longer minimize sorts. Thus certification at the boundary of the
4038 inference kernel becomes invariant under addition of class relations,
4039 which is an important monotonicity principle. Sorts are now minimized
4040 in the syntax layer only, at the boundary between the end-user and the
4041 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
4042 explicitly in rare situations.
4044 * Renamed old-style Drule.standard to Drule.export_without_context, to
4045 emphasize that this is in no way a standard operation.
4048 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
4049 usual for resolution. Rare INCOMPATIBILITY.
4051 * Renamed varify/unvarify operations to varify_global/unvarify_global
4052 to emphasize that these only work in a global situation (which is
4055 * Curried take and drop in library.ML; negative length is interpreted
4056 as infinity (as in chop). Subtle INCOMPATIBILITY.
4058 * Proof terms: type substitutions on proof constants now use canonical
4059 order of type variables. INCOMPATIBILITY for tools working with proof
4062 * Raw axioms/defs may no longer carry sort constraints, and raw defs
4063 may no longer carry premises. User-level specifications are
4064 transformed accordingly by Thm.add_axiom/add_def.
4069 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
4070 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
4071 proof terms are enabled unconditionally in the new HOL-Proofs image.
4073 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
4074 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
4077 * Old lib/scripts/polyml-platform is superseded by the
4078 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
4079 variant, even on a 64 bit machine. The following example setting
4080 prefers 64 bit if available:
4082 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
4084 * The preliminary Isabelle/jEdit application demonstrates the emerging
4085 Isabelle/Scala layer for advanced prover interaction and integration.
4086 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
4089 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
4090 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
4091 similar to the default assignment of the document preparation system
4092 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
4093 provides some operations for direct access to the font without asking
4094 the user for manual installation.
4098 New in Isabelle2009-1 (December 2009)
4099 -------------------------------------
4103 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
4104 one backslash should be used, even in ML sources.
4109 * Locale interpretation propagates mixins along the locale hierarchy.
4110 The currently only available mixins are the equations used to map
4111 local definitions to terms of the target domain of an interpretation.
4113 * Reactivated diagnostic command 'print_interps'. Use "print_interps
4114 loc" to print all interpretations of locale "loc" in the theory.
4115 Interpretations in proofs are not shown.
4117 * Thoroughly revised locales tutorial. New section on conditional
4120 * On instantiation of classes, remaining undefined class parameters
4121 are formally declared. INCOMPATIBILITY.
4124 *** Document preparation ***
4126 * New generalized style concept for printing terms: @{foo (style) ...}
4127 instead of @{foo_style style ...} (old form is still retained for
4128 backward compatibility). Styles can be also applied for
4129 antiquotations prop, term_type and typeof.
4134 * New proof method "smt" for a combination of first-order logic with
4135 equality, linear and nonlinear (natural/integer/real) arithmetic, and
4136 fixed-size bitvectors; there is also basic support for higher-order
4137 features (esp. lambda abstractions). It is an incomplete decision
4138 procedure based on external SMT solvers using the oracle mechanism;
4139 for the SMT solver Z3, this method is proof-producing. Certificates
4140 are provided to avoid calling the external solvers solely for
4141 re-checking proofs. Due to a remote SMT service there is no need for
4142 installing SMT solvers locally. See src/HOL/SMT.
4144 * New commands to load and prove verification conditions generated by
4145 the Boogie program verifier or derived systems (e.g. the Verifying C
4146 Compiler (VCC) or Spec#). See src/HOL/Boogie.
4148 * New counterexample generator tool 'nitpick' based on the Kodkod
4149 relational model finder. See src/HOL/Tools/Nitpick and
4150 src/HOL/Nitpick_Examples.
4152 * New commands 'code_pred' and 'values' to invoke the predicate
4153 compiler and to enumerate values of inductive predicates.
4155 * A tabled implementation of the reflexive transitive closure.
4157 * New implementation of quickcheck uses generic code generator;
4158 default generators are provided for all suitable HOL types, records
4159 and datatypes. Old quickcheck can be re-activated importing theory
4160 Library/SML_Quickcheck.
4162 * New testing tool Mirabelle for automated proof tools. Applies
4163 several tools and tactics like sledgehammer, metis, or quickcheck, to
4164 every proof step in a theory. To be used in batch mode via the
4165 "mirabelle" utility.
4167 * New proof method "sos" (sum of squares) for nonlinear real
4168 arithmetic (originally due to John Harison). It requires theory
4169 Library/Sum_Of_Squares. It is not a complete decision procedure but
4170 works well in practice on quantifier-free real arithmetic with +, -,
4171 *, ^, =, <= and <, i.e. boolean combinations of equalities and
4172 inequalities between polynomials. It makes use of external
4173 semidefinite programming solvers. Method "sos" generates a
4174 certificate that can be pasted into the proof thus avoiding the need
4175 to call an external tool every time the proof is checked. See
4176 src/HOL/Library/Sum_Of_Squares.
4178 * New method "linarith" invokes existing linear arithmetic decision
4181 * New command 'atp_minimal' reduces result produced by Sledgehammer.
4183 * New Sledgehammer option "Full Types" in Proof General settings menu.
4184 Causes full type information to be output to the ATPs. This slows
4185 ATPs down considerably but eliminates a source of unsound "proofs"
4188 * New method "metisFT": A version of metis that uses full type
4189 information in order to avoid failures of proof reconstruction.
4191 * New evaluator "approximate" approximates an real valued term using
4192 the same method as the approximation method.
4194 * Method "approximate" now supports arithmetic expressions as
4195 boundaries of intervals and implements interval splitting and Taylor
4198 * ML antiquotation @{code_datatype} inserts definition of a datatype
4199 generated by the code generator; e.g. see src/HOL/Predicate.thy.
4201 * New theory SupInf of the supremum and infimum operators for sets of
4204 * New theory Probability, which contains a development of measure
4205 theory, eventually leading to Lebesgue integration and probability.
4207 * Extended Multivariate Analysis to include derivation and Brouwer's
4210 * Reorganization of number theory, INCOMPATIBILITY:
4211 - new number theory development for nat and int, in theories Divides
4212 and GCD as well as in new session Number_Theory
4213 - some constants and facts now suffixed with _nat and _int
4215 - former session NumberTheory now named Old_Number_Theory, including
4216 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
4217 - moved theory Pocklington from src/HOL/Library to
4218 src/HOL/Old_Number_Theory
4220 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
4221 lcm of finite and infinite sets. It is shown that they form a complete
4224 * Class semiring_div requires superclass no_zero_divisors and proof of
4225 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
4226 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
4227 generalized to class semiring_div, subsuming former theorems
4228 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
4229 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
4232 * Refinements to lattice classes and sets:
4233 - less default intro/elim rules in locale variant, more default
4234 intro/elim rules in class variant: more uniformity
4235 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
4237 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
4239 - renamed ACI to inf_sup_aci
4240 - new class "boolean_algebra"
4241 - class "complete_lattice" moved to separate theory
4242 "Complete_Lattice"; corresponding constants (and abbreviations)
4243 renamed and with authentic syntax:
4244 Set.Inf ~> Complete_Lattice.Inf
4245 Set.Sup ~> Complete_Lattice.Sup
4246 Set.INFI ~> Complete_Lattice.INFI
4247 Set.SUPR ~> Complete_Lattice.SUPR
4248 Set.Inter ~> Complete_Lattice.Inter
4249 Set.Union ~> Complete_Lattice.Union
4250 Set.INTER ~> Complete_Lattice.INTER
4251 Set.UNION ~> Complete_Lattice.UNION
4252 - authentic syntax for
4255 - mere abbreviations:
4258 Set.inter (for inf, formerly Set.Int)
4259 Set.union (for sup, formerly Set.Un)
4260 Complete_Lattice.Inter (for Inf)
4261 Complete_Lattice.Union (for Sup)
4262 Complete_Lattice.INTER (for INFI)
4263 Complete_Lattice.UNION (for SUPR)
4264 - object-logic definitions as far as appropriate
4266 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
4267 Un_subset_iff are explicitly deleted as default simp rules; then also
4268 their lattice counterparts le_inf_iff and le_sup_iff have to be
4269 deleted to achieve the desired effect.
4271 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
4272 rules by default any longer; the same applies to min_max.inf_absorb1
4273 etc. INCOMPATIBILITY.
4275 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
4276 pred_set_conv by default. INCOMPATIBILITY.
4278 * Power operations on relations and functions are now one dedicated
4279 constant "compow" with infix syntax "^^". Power operation on
4280 multiplicative monoids retains syntax "^" and is now defined generic
4281 in class power. INCOMPATIBILITY.
4283 * Relation composition "R O S" now has a more standard argument order:
4284 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
4285 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
4286 break, since the O_assoc rule was not rewritten like this. Fix using
4287 O_assoc[symmetric]. The same applies to the curried version "R OO S".
4289 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
4290 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
4293 * Most rules produced by inductive and datatype package have mandatory
4294 prefixes. INCOMPATIBILITY.
4296 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
4297 the attribute of the same name. Each of the theorems in the list
4298 DERIV_intros assumes composition with an additional function and
4299 matches a variable to the derivative, which has to be solved by the
4300 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
4301 of most elementary terms. Former Maclauren.DERIV_tac and
4302 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
4305 * Code generator attributes follow the usual underscore convention:
4306 code_unfold replaces code unfold
4307 code_post replaces code post
4312 sizechange -> size_change
4313 induct_scheme -> induction_schema
4316 * Discontinued abbreviation "arbitrary" of constant "undefined".
4317 INCOMPATIBILITY, use "undefined" directly.
4320 Suc_eq_add_numeral_1 -> Suc_eq_plus1
4321 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
4322 Suc_plus1 -> Suc_eq_plus1
4323 *anti_sym -> *antisym*
4324 vector_less_eq_def -> vector_le_def
4327 * Added theorem List.map_map as [simp]. Removed List.map_compose.
4330 * Removed predicate "M hassize n" (<--> card M = n & finite M).
4336 * Theory Representable defines a class "rep" of domains that are
4337 representable (via an ep-pair) in the universal domain type "udom".
4338 Instances are provided for all type constructors defined in HOLCF.
4340 * The 'new_domain' command is a purely definitional version of the
4341 domain package, for representable domains. Syntax is identical to the
4342 old domain package. The 'new_domain' package also supports indirect
4343 recursion using previously-defined type constructors. See
4344 src/HOLCF/ex/New_Domain.thy for examples.
4346 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
4347 on the left-hand side of an equation, and then performs
4348 simplification. Rewriting is done using rules declared with the
4349 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
4350 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
4352 * The pattern-match compiler in 'fixrec' can now handle constructors
4353 with HOL function types. Pattern-match combinators for the Pair
4354 constructor are pre-configured.
4356 * The 'fixrec' package now produces better fixed-point induction rules
4357 for mutually-recursive definitions: Induction rules have conclusions
4358 of the form "P foo bar" instead of "P <foo, bar>".
4360 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
4361 been renamed to "below". The name "below" now replaces "less" in many
4362 theorem names. (Legacy theorem names using "less" are still supported
4365 * The 'fixrec' package now supports "bottom patterns". Bottom
4366 patterns can be used to generate strictness rules, or to make
4367 functions more strict (much like the bang-patterns supported by the
4368 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
4374 * Support for Poly/ML 5.3.0, with improved reporting of compiler
4375 errors and run-time exceptions, including detailed source positions.
4377 * Structure Name_Space (formerly NameSpace) now manages uniquely
4378 identified entries, with some additional information such as source
4379 position, logical grouping etc.
4381 * Theory and context data is now introduced by the simplified and
4382 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
4383 to be pure, but the old TheoryDataFun for mutable data (with explicit
4384 copy operation) is still available for some time.
4386 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
4387 provides a high-level programming interface to synchronized state
4388 variables with atomic update. This works via pure function
4389 application within a critical section -- its runtime should be as
4390 short as possible; beware of deadlocks if critical code is nested,
4391 either directly or indirectly via other synchronized variables!
4393 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
4394 wraps raw ML references, explicitly indicating their non-thread-safe
4395 behaviour. The Isar toplevel keeps this structure open, to
4396 accommodate Proof General as well as quick and dirty interactive
4397 experiments with references.
4399 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
4400 parallel tactical reasoning.
4402 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
4403 are similar to SUBPROOF, but are slightly more flexible: only the
4404 specified parts of the subgoal are imported into the context, and the
4405 body tactic may introduce new subgoals and schematic variables.
4407 * Old tactical METAHYPS, which does not observe the proof context, has
4408 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
4409 or Subgoal.FOCUS etc.
4411 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
4412 functors have their own ML name space there is no point to mark them
4413 separately.) Minor INCOMPATIBILITY.
4415 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
4417 * Renamed several structures FooBar to Foo_Bar. Occasional,
4420 * Operations of structure Skip_Proof no longer require quick_and_dirty
4421 mode, which avoids critical setmp.
4423 * Eliminated old Attrib.add_attributes, Method.add_methods and related
4424 combinators for "args". INCOMPATIBILITY, need to use simplified
4425 Attrib/Method.setup introduced in Isabelle2009.
4427 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
4428 back on global_simpset_of, global_claset_of, global_clasimpset_of as
4429 last resort. INCOMPATIBILITY.
4431 * Display.pretty_thm now requires a proper context (cf. former
4432 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
4433 or even Display.pretty_thm_without_context as last resort.
4436 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
4437 Syntax.pretty_typ/term directly, preferably with proper context
4438 instead of global theory.
4443 * Further fine tuning of parallel proof checking, scales up to 8 cores
4444 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
4447 * Support for additional "Isabelle components" via etc/components, see
4448 also the system manual.
4450 * The isabelle makeall tool now operates on all components with
4451 IsaMakefile, not just hardwired "logics".
4453 * Removed "compress" option from isabelle-process and isabelle usedir;
4454 this is always enabled.
4456 * Discontinued support for Poly/ML 4.x versions.
4458 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
4459 on a given logic image. This requires the lighttpd webserver and is
4460 currently supported on Linux only.
4464 New in Isabelle2009 (April 2009)
4465 --------------------------------
4469 * Simplified main Isabelle executables, with less surprises on
4470 case-insensitive file-systems (such as Mac OS).
4472 - The main Isabelle tool wrapper is now called "isabelle" instead of
4475 - The former "isabelle" alias for "isabelle-process" has been
4476 removed (should rarely occur to regular users).
4478 - The former "isabelle-interface" and its alias "Isabelle" have been
4479 removed (interfaces are now regular Isabelle tools).
4481 Within scripts and make files, the Isabelle environment variables
4482 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
4483 respectively. (The latter are still available as legacy feature.)
4485 The old isabelle-interface wrapper could react in confusing ways if
4486 the interface was uninstalled or changed otherwise. Individual
4487 interface tool configuration is now more explicit, see also the
4488 Isabelle system manual. In particular, Proof General is now available
4489 via "isabelle emacs".
4491 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
4492 purge installed copies of Isabelle executables and re-run "isabelle
4493 install -p ...", or use symlinks.
4495 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
4496 old ~/isabelle, which was slightly non-standard and apt to cause
4497 surprises on case-insensitive file-systems (such as Mac OS).
4499 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
4500 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
4501 care is required when using older releases of Isabelle. Note that
4502 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
4503 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
4505 * Proofs of fully specified statements are run in parallel on
4506 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
4507 a regular 4-core machine, if the initial heap space is made reasonably
4508 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
4510 * The main reference manuals ("isar-ref", "implementation", and
4511 "system") have been updated and extended. Formally checked references
4512 as hyperlinks are now available uniformly.
4517 * Complete re-implementation of locales. INCOMPATIBILITY in several
4518 respects. The most important changes are listed below. See the
4519 Tutorial on Locales ("locales" manual) for details.
4521 - In locale expressions, instantiation replaces renaming. Parameters
4522 must be declared in a for clause. To aid compatibility with previous
4523 parameter inheritance, in locale declarations, parameters that are not
4524 'touched' (instantiation position "_" or omitted) are implicitly added
4525 with their syntax at the beginning of the for clause.
4527 - Syntax from abbreviations and definitions in locales is available in
4528 locale expressions and context elements. The latter is particularly
4529 useful in locale declarations.
4531 - More flexible mechanisms to qualify names generated by locale
4532 expressions. Qualifiers (prefixes) may be specified in locale
4533 expressions, and can be marked as mandatory (syntax: "name!:") or
4534 optional (syntax "name?:"). The default depends for plain "name:"
4535 depends on the situation where a locale expression is used: in
4536 commands 'locale' and 'sublocale' prefixes are optional, in
4537 'interpretation' and 'interpret' prefixes are mandatory. The old
4538 implicit qualifiers derived from the parameter names of a locale are
4539 no longer generated.
4541 - Command "sublocale l < e" replaces "interpretation l < e". The
4542 instantiation clause in "interpretation" and "interpret" (square
4543 brackets) is no longer available. Use locale expressions.
4545 - When converting proof scripts, mandatory qualifiers in
4546 'interpretation' and 'interpret' should be retained by default, even
4547 if this is an INCOMPATIBILITY compared to former behavior. In the
4548 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
4549 in locale expressions range over a single locale instance only.
4551 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
4552 In existing theorem specifications replace the includes element by the
4553 respective context elements of the included locale, omitting those
4554 that are already present in the theorem specification. Multiple
4555 assume elements of a locale should be replaced by a single one
4556 involving the locale predicate. In the proof body, declarations (most
4557 notably theorems) may be regained by interpreting the respective
4558 locales in the proof context as required (command "interpret").
4560 If using "includes" in replacement of a target solely because the
4561 parameter types in the theorem are not as general as in the target,
4562 consider declaring a new locale with additional type constraints on
4563 the parameters (context element "constrains").
4565 - Discontinued "locale (open)". INCOMPATIBILITY.
4567 - Locale interpretation commands no longer attempt to simplify goal.
4568 INCOMPATIBILITY: in rare situations the generated goal differs. Use
4569 methods intro_locales and unfold_locales to clarify.
4571 - Locale interpretation commands no longer accept interpretation
4572 attributes. INCOMPATIBILITY.
4574 * Class declaration: so-called "base sort" must not be given in import
4575 list any longer, but is inferred from the specification. Particularly
4582 class foo = type + ...
4584 * Class target: global versions of theorems stemming do not carry a
4585 parameter prefix any longer. INCOMPATIBILITY.
4587 * Class 'instance' command no longer accepts attached definitions.
4588 INCOMPATIBILITY, use proper 'instantiation' target instead.
4590 * Recovered hiding of consts, which was accidentally broken in
4591 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
4592 makes c inaccessible; consider using ``hide (open) const c'' instead.
4594 * Slightly more coherent Pure syntax, with updated documentation in
4595 isar-ref manual. Removed locales meta_term_syntax and
4596 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
4597 INCOMPATIBILITY in rare situations. Note that &&& should not be used
4598 directly in regular applications.
4600 * There is a new syntactic category "float_const" for signed decimal
4601 fractions (e.g. 123.45 or -123.45).
4603 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
4604 interface with 'setup' command instead.
4606 * Command 'local_setup' is similar to 'setup', but operates on a local
4609 * The 'axiomatization' command now only works within a global theory
4610 context. INCOMPATIBILITY.
4612 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
4613 hypotheses. Sorts required in the course of reasoning need to be
4614 covered by the constraints in the initial statement, completed by the
4615 type instance information of the background theory. Non-trivial sort
4616 hypotheses, which rarely occur in practice, may be specified via
4617 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
4619 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
4621 The result contains an implicit sort hypotheses as before --
4622 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
4625 * Generalized Isar history, with support for linear undo, direct state
4628 * Changed defaults for unify configuration options:
4630 unify_trace_bound = 50 (formerly 25)
4631 unify_search_bound = 60 (formerly 30)
4633 * Different bookkeeping for code equations (INCOMPATIBILITY):
4635 a) On theory merge, the last set of code equations for a particular
4636 constant is taken (in accordance with the policy applied by other
4637 parts of the code generator framework).
4639 b) Code equations stemming from explicit declarations (e.g. code
4640 attribute) gain priority over default code equations stemming
4641 from definition, primrec, fun etc.
4643 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
4645 * Unified theorem tables for both code generators. Thus [code
4646 func] has disappeared and only [code] remains. INCOMPATIBILITY.
4648 * Command 'find_consts' searches for constants based on type and name
4651 find_consts "_ => bool"
4653 By default, matching is against subtypes, but it may be restricted to
4654 the whole type. Searching by name is possible. Multiple queries are
4655 conjunctive and queries may be negated by prefixing them with a
4658 find_consts strict: "_ => bool" name: "Int" -"int => int"
4660 * New 'find_theorems' criterion "solves" matches theorems that
4661 directly solve the current goal (modulo higher-order unification).
4663 * Auto solve feature for main theorem statements: whenever a new goal
4664 is stated, "find_theorems solves" is called; any theorems that could
4665 solve the lemma directly are listed as part of the goal state.
4666 Cf. associated options in Proof General Isabelle settings menu,
4667 enabled by default, with reasonable timeout for pathological cases of
4668 higher-order unification.
4671 *** Document preparation ***
4673 * Antiquotation @{lemma} now imitates a regular terminal proof,
4674 demanding keyword 'by' and supporting the full method expression
4675 syntax just like the Isar command 'by'.
4680 * Integrated main parts of former image HOL-Complex with HOL. Entry
4681 points Main and Complex_Main remain as before.
4683 * Logic image HOL-Plain provides a minimal HOL with the most important
4684 tools available (inductive, datatype, primrec, ...). This facilitates
4685 experimentation and tool development. Note that user applications
4686 (and library theories) should never refer to anything below theory
4689 * Logic image HOL-Main stops at theory Main, and thus facilitates
4690 experimentation due to shorter build times.
4692 * Logic image HOL-NSA contains theories of nonstandard analysis which
4693 were previously part of former HOL-Complex. Entry point Hyperreal
4694 remains valid, but theories formerly using Complex_Main should now use
4695 new entry point Hypercomplex.
4697 * Generic ATP manager for Sledgehammer, based on ML threads instead of
4698 Posix processes. Avoids potentially expensive forking of the ML
4699 process. New thread-based implementation also works on non-Unix
4700 platforms (Cygwin). Provers are no longer hardwired, but defined
4701 within the theory via plain ML wrapper functions. Basic Sledgehammer
4702 commands are covered in the isar-ref manual.
4704 * Wrapper scripts for remote SystemOnTPTP service allows to use
4705 sledgehammer without local ATP installation (Vampire etc.). Other
4706 provers may be included via suitable ML wrappers, see also
4707 src/HOL/ATP_Linkup.thy.
4709 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
4712 * The metis method no longer fails because the theorem is too trivial
4713 (contains the empty clause).
4715 * The metis method now fails in the usual manner, rather than raising
4716 an exception, if it determines that it cannot prove the theorem.
4718 * Method "coherent" implements a prover for coherent logic (see also
4719 src/Tools/coherent.ML).
4721 * Constants "undefined" and "default" replace "arbitrary". Usually
4722 "undefined" is the right choice to replace "arbitrary", though
4723 logically there is no difference. INCOMPATIBILITY.
4725 * Command "value" now integrates different evaluation mechanisms. The
4726 result of the first successful evaluation mechanism is printed. In
4727 square brackets a particular named evaluation mechanisms may be
4728 specified (currently, [SML], [code] or [nbe]). See further
4729 src/HOL/ex/Eval_Examples.thy.
4731 * Normalization by evaluation now allows non-leftlinear equations.
4732 Declare with attribute [code nbe].
4734 * Methods "case_tac" and "induct_tac" now refer to the very same rules
4735 as the structured Isar versions "cases" and "induct", cf. the
4736 corresponding "cases" and "induct" attributes. Mutual induction rules
4737 are now presented as a list of individual projections
4738 (e.g. foo_bar.inducts for types foo and bar); the old format with
4739 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
4740 rare situations a different rule is selected --- notably nested tuple
4741 elimination instead of former prod.exhaust: use explicit (case_tac t
4742 rule: prod.exhaust) here.
4744 * Attributes "cases", "induct", "coinduct" support "del" option.
4746 * Removed fact "case_split_thm", which duplicates "case_split".
4748 * The option datatype has been moved to a new theory Option. Renamed
4749 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
4751 * New predicate "strict_mono" classifies strict functions on partial
4752 orders. With strict functions on linear orders, reasoning about
4753 (in)equalities is facilitated by theorems "strict_mono_eq",
4754 "strict_mono_less_eq" and "strict_mono_less".
4756 * Some set operations are now proper qualified constants with
4757 authentic syntax. INCOMPATIBILITY:
4768 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
4771 * Auxiliary class "itself" has disappeared -- classes without any
4772 parameter are treated as expected by the 'class' command.
4774 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
4776 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
4777 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
4779 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
4780 method "approximation". It proves formulas on real values by using
4781 interval arithmetic. In the formulas are also the transcendental
4782 functions sin, cos, tan, atan, ln, exp and the constant pi are
4783 allowed. For examples see
4784 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
4786 * Theory "Reflection" now resides in HOL/Library.
4788 * Entry point to Word library now simply named "Word".
4791 * Made source layout more coherent with logical distribution
4794 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
4795 src/HOL/Library/Code_Message.thy ~> src/HOL/
4796 src/HOL/Library/GCD.thy ~> src/HOL/
4797 src/HOL/Library/Order_Relation.thy ~> src/HOL/
4798 src/HOL/Library/Parity.thy ~> src/HOL/
4799 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
4800 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
4801 src/HOL/Real/Lubs.thy ~> src/HOL/
4802 src/HOL/Real/PReal.thy ~> src/HOL/
4803 src/HOL/Real/Rational.thy ~> src/HOL/
4804 src/HOL/Real/RComplete.thy ~> src/HOL/
4805 src/HOL/Real/RealDef.thy ~> src/HOL/
4806 src/HOL/Real/RealPow.thy ~> src/HOL/
4807 src/HOL/Real/Real.thy ~> src/HOL/
4808 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
4809 src/HOL/Complex/Complex.thy ~> src/HOL/
4810 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
4811 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
4812 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
4813 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
4814 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
4815 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
4816 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
4817 src/HOL/Hyperreal/Log.thy ~> src/HOL/
4818 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
4819 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
4820 src/HOL/Hyperreal/Series.thy ~> src/HOL/
4821 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
4822 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
4823 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
4824 src/HOL/Real/Float ~> src/HOL/Library/
4825 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
4826 src/HOL/Real/RealVector.thy ~> src/HOL/
4828 src/HOL/arith_data.ML ~> src/HOL/Tools
4829 src/HOL/hologic.ML ~> src/HOL/Tools
4830 src/HOL/simpdata.ML ~> src/HOL/Tools
4831 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
4832 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
4833 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
4834 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
4835 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
4836 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
4837 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
4839 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
4840 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
4841 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
4842 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
4843 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
4844 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
4846 * If methods "eval" and "evaluation" encounter a structured proof
4847 state with !!/==>, only the conclusion is evaluated to True (if
4848 possible), avoiding strange error messages.
4850 * Method "sizechange" automates termination proofs using (a
4851 modification of) the size-change principle. Requires SAT solver. See
4852 src/HOL/ex/Termination.thy for examples.
4854 * Simplifier: simproc for let expressions now unfolds if bound
4855 variable occurs at most once in let expression body. INCOMPATIBILITY.
4857 * Method "arith": Linear arithmetic now ignores all inequalities when
4858 fast_arith_neq_limit is exceeded, instead of giving up entirely.
4860 * New attribute "arith" for facts that should always be used
4861 automatically by arithmetic. It is intended to be used locally in
4864 assumes [arith]: "x > 0"
4866 Global usage is discouraged because of possible performance impact.
4868 * New classes "top" and "bot" with corresponding operations "top" and
4869 "bot" in theory Orderings; instantiation of class "complete_lattice"
4870 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
4872 * Changed definition lemma "less_fun_def" in order to provide an
4873 instance for preorders on functions; use lemma "less_le" instead.
4876 * Theory Orderings: class "wellorder" moved here, with explicit
4877 induction rule "less_induct" as assumption. For instantiation of
4878 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
4881 * Theory Orderings: added class "preorder" as superclass of "order".
4882 INCOMPATIBILITY: Instantiation proofs for order, linorder
4883 etc. slightly changed. Some theorems named order_class.* now named
4886 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
4889 * Theory Finite_Set: added a new fold combinator of type
4891 ('a => 'b => 'b) => 'b => 'a set => 'b
4893 Occasionally this is more convenient than the old fold combinator
4894 which is now defined in terms of the new one and renamed to
4897 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
4898 and "ring_simps" have been replaced by "algebra_simps" (which can be
4899 extended with further lemmas!). At the moment both still exist but
4900 the former will disappear at some point.
4902 * Theory Power: Lemma power_Suc is now declared as a simp rule in
4903 class recpower. Type-specific simp rules for various recpower types
4904 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
4906 rat_power_0 -> power_0
4907 rat_power_Suc -> power_Suc
4908 realpow_0 -> power_0
4909 realpow_Suc -> power_Suc
4910 complexpow_0 -> power_0
4911 complexpow_Suc -> power_Suc
4912 power_poly_0 -> power_0
4913 power_poly_Suc -> power_Suc
4915 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
4916 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
4917 dvd has been generalized to class comm_semiring_1. Likewise a bunch
4918 of lemmas from Divides has been generalized from nat to class
4919 semiring_div. INCOMPATIBILITY. This involves the following theorem
4920 renames resulting from duplicate elimination:
4922 dvd_def_mod ~> dvd_eq_mod_eq_0
4923 zero_dvd_iff ~> dvd_0_left_iff
4924 dvd_0 ~> dvd_0_right
4925 DIVISION_BY_ZERO_DIV ~> div_by_0
4926 DIVISION_BY_ZERO_MOD ~> mod_by_0
4927 mult_div ~> div_mult_self2_is_id
4928 mult_mod ~> mod_mult_self2_is_0
4930 * Theory IntDiv: removed many lemmas that are instances of class-based
4931 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
4932 rename old lemmas as follows:
4934 dvd_diff -> nat_dvd_diff
4935 dvd_zminus_iff -> dvd_minus_iff
4936 mod_add1_eq -> mod_add_eq
4937 mod_mult1_eq -> mod_mult_right_eq
4938 mod_mult1_eq' -> mod_mult_left_eq
4939 mod_mult_distrib_mod -> mod_mult_eq
4940 nat_mod_add_left_eq -> mod_add_left_eq
4941 nat_mod_add_right_eq -> mod_add_right_eq
4942 nat_mod_div_trivial -> mod_div_trivial
4943 nat_mod_mod_trivial -> mod_mod_trivial
4944 zdiv_zadd_self1 -> div_add_self1
4945 zdiv_zadd_self2 -> div_add_self2
4946 zdiv_zmult_self1 -> div_mult_self2_is_id
4947 zdiv_zmult_self2 -> div_mult_self1_is_id
4948 zdvd_triv_left -> dvd_triv_left
4949 zdvd_triv_right -> dvd_triv_right
4950 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
4951 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
4952 zmod_zadd_left_eq -> mod_add_left_eq
4953 zmod_zadd_right_eq -> mod_add_right_eq
4954 zmod_zadd_self1 -> mod_add_self1
4955 zmod_zadd_self2 -> mod_add_self2
4956 zmod_zadd1_eq -> mod_add_eq
4957 zmod_zdiff1_eq -> mod_diff_eq
4958 zmod_zdvd_zmod -> mod_mod_cancel
4959 zmod_zmod_cancel -> mod_mod_cancel
4960 zmod_zmult_self1 -> mod_mult_self2_is_0
4961 zmod_zmult_self2 -> mod_mult_self1_is_0
4964 zdvd_abs1 -> abs_dvd_iff
4965 zdvd_abs2 -> dvd_abs_iff
4966 zdvd_refl -> dvd_refl
4967 zdvd_trans -> dvd_trans
4968 zdvd_zadd -> dvd_add
4969 zdvd_zdiff -> dvd_diff
4970 zdvd_zminus_iff -> dvd_minus_iff
4971 zdvd_zminus2_iff -> minus_dvd_iff
4972 zdvd_zmultD -> dvd_mult_right
4973 zdvd_zmultD2 -> dvd_mult_left
4974 zdvd_zmult_mono -> mult_dvd_mono
4975 zdvd_0_right -> dvd_0_right
4976 zdvd_0_left -> dvd_0_left_iff
4977 zdvd_1_left -> one_dvd
4978 zminus_dvd_iff -> minus_dvd_iff
4980 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
4982 * The real numbers offer decimal input syntax: 12.34 is translated
4983 into 1234/10^2. This translation is not reversed upon output.
4985 * Theory Library/Polynomial defines an abstract type 'a poly of
4986 univariate polynomials with coefficients of type 'a. In addition to
4987 the standard ring operations, it also supports div and mod. Code
4988 generation is also supported, using list-style constructors.
4990 * Theory Library/Inner_Product defines a class of real_inner for real
4991 inner product spaces, with an overloaded operation inner :: 'a => 'a
4992 => real. Class real_inner is a subclass of real_normed_vector from
4995 * Theory Library/Product_Vector provides instances for the product
4996 type 'a * 'b of several classes from RealVector and Inner_Product.
4997 Definitions of addition, subtraction, scalar multiplication, norms,
4998 and inner products are included.
5000 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
5001 addition to the field operations, numerals and case syntax are also
5004 * Theory Library/Diagonalize provides constructive version of Cantor's
5005 first diagonalization argument.
5007 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
5008 zlcm (for int); carried together from various gcd/lcm developements in
5009 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
5010 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
5011 may recover tupled syntax as follows:
5013 hide (open) const gcd
5014 abbreviation gcd where
5015 "gcd == (%(a, b). GCD.gcd a b)"
5017 GCD.gcd ("gcd '(_, _')")
5019 The same works for lcm, zgcd, zlcm.
5021 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
5022 instantiations for algebraic structures. Removed some duplicate
5023 theorems. Changes in simp rules. INCOMPATIBILITY.
5025 * ML antiquotation @{code} takes a constant as argument and generates
5026 corresponding code in background and inserts name of the corresponding
5027 resulting ML value/function/datatype constructor binding in place.
5028 All occurrences of @{code} with a single ML block are generated
5029 simultaneously. Provides a generic and safe interface for
5030 instrumentalizing code generation. See
5031 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
5032 In future you ought to refrain from ad-hoc compiling generated SML
5033 code on the ML toplevel. Note that (for technical reasons) @{code}
5034 cannot refer to constants for which user-defined serializations are
5035 set. Refer to the corresponding ML counterpart directly in that
5038 * Command 'rep_datatype': instead of theorem names the command now
5039 takes a list of terms denoting the constructors of the type to be
5040 represented as datatype. The characteristic theorems have to be
5041 proven. INCOMPATIBILITY. Also observe that the following theorems
5042 have disappeared in favour of existing ones:
5044 unit_induct ~> unit.induct
5045 prod_induct ~> prod.induct
5046 sum_induct ~> sum.induct
5047 Suc_Suc_eq ~> nat.inject
5048 Suc_not_Zero Zero_not_Suc ~> nat.distinct
5053 * New locales for orders and lattices where the equivalence relation
5054 is not restricted to equality. INCOMPATIBILITY: all order and lattice
5055 locales use a record structure with field eq for the equivalence.
5057 * New theory of factorial domains.
5059 * Units_l_inv and Units_r_inv are now simp rules by default.
5060 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
5061 and/or r_inv will now also require deletion of these lemmas.
5063 * Renamed the following theorems, INCOMPATIBILITY:
5065 UpperD ~> Upper_memD
5066 LowerD ~> Lower_memD
5067 least_carrier ~> least_closed
5068 greatest_carrier ~> greatest_closed
5069 greatest_Lower_above ~> greatest_Lower_below
5070 one_zero ~> carrier_one_zero
5071 one_not_zero ~> carrier_one_not_zero (collision with assumption)
5076 * Nominal datatypes can now contain type-variables.
5078 * Commands 'nominal_inductive' and 'equivariance' work with local
5081 * Nominal primrec can now works with local theory targets and its
5082 specification syntax now conforms to the general format as seen in
5085 * Method "perm_simp" honours the standard simplifier attributes
5086 (no_asm), (no_asm_use) etc.
5088 * The new predicate #* is defined like freshness, except that on the
5089 left hand side can be a set or list of atoms.
5091 * Experimental command 'nominal_inductive2' derives strong induction
5092 principles for inductive definitions. In contrast to
5093 'nominal_inductive', which can only deal with a fixed number of
5094 binders, it can deal with arbitrary expressions standing for sets of
5095 atoms to be avoided. The only inductive definition we have at the
5096 moment that needs this generalisation is the typing rule for Lets in
5099 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
5100 -----------------------------------------------------------------
5101 Gamma |- Let x be t1 in t2 : T2
5103 In this rule one wants to avoid all the binders that are introduced by
5104 "close Gamma T1". We are looking for other examples where this
5105 feature might be useful. Please let us know.
5110 * Reimplemented the simplification procedure for proving continuity
5111 subgoals. The new simproc is extensible; users can declare additional
5112 continuity introduction rules with the attribute [cont2cont].
5114 * The continuity simproc now uses a different introduction rule for
5115 solving continuity subgoals on terms with lambda abstractions. In
5116 some rare cases the new simproc may fail to solve subgoals that the
5117 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
5118 Potential INCOMPATIBILITY.
5120 * Command 'fixrec': specification syntax now conforms to the general
5121 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
5122 examples. INCOMPATIBILITY.
5127 * Proof of Zorn's Lemma for partial orders.
5132 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
5133 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
5134 depends on multithreading, so timouts will not work before Poly/ML
5137 * High-level support for concurrent ML programming, see
5138 src/Pure/Cuncurrent. The data-oriented model of "future values" is
5139 particularly convenient to organize independent functional
5140 computations. The concept of "synchronized variables" provides a
5141 higher-order interface for components with shared state, avoiding the
5142 delicate details of mutexes and condition variables. (Requires
5143 Poly/ML 5.2.1 or later.)
5145 * ML bindings produced via Isar commands are stored within the Isar
5146 context (theory or proof). Consequently, commands like 'use' and 'ML'
5147 become thread-safe and work with undo as expected (concerning
5148 top-level bindings, not side-effects on global references).
5149 INCOMPATIBILITY, need to provide proper Isar context when invoking the
5150 compiler at runtime; really global bindings need to be given outside a
5151 theory. (Requires Poly/ML 5.2 or later.)
5153 * Command 'ML_prf' is analogous to 'ML' but works within a proof
5154 context. Top-level ML bindings are stored within the proof context in
5155 a purely sequential fashion, disregarding the nested proof structure.
5156 ML bindings introduced by 'ML_prf' are discarded at the end of the
5157 proof. (Requires Poly/ML 5.2 or later.)
5159 * Simplified ML attribute and method setup, cf. functions Attrib.setup
5160 and Method.setup, as well as Isar commands 'attribute_setup' and
5161 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
5162 existing code accordingly, or use plain 'setup' together with old
5165 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
5166 to 'a -> thm, while results are always tagged with an authentic oracle
5167 name. The Isar command 'oracle' is now polymorphic, no argument type
5168 is specified. INCOMPATIBILITY, need to simplify existing oracle code
5169 accordingly. Note that extra performance may be gained by producing
5170 the cterm carefully, avoiding slow Thm.cterm_of.
5172 * Simplified interface for defining document antiquotations via
5173 ThyOutput.antiquotation, ThyOutput.output, and optionally
5174 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
5175 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
5178 * More systematic treatment of long names, abstract name bindings, and
5179 name space operations. Basic operations on qualified names have been
5180 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
5181 Long_Name.append. Old type bstring has been mostly replaced by
5182 abstract type binding (see structure Binding), which supports precise
5183 qualification by packages and local theory targets, as well as proper
5184 tracking of source positions. INCOMPATIBILITY, need to wrap old
5185 bstring values into Binding.name, or better pass through abstract
5186 bindings everywhere. See further src/Pure/General/long_name.ML,
5187 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
5189 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
5190 LocalTheory.note etc.) now refer to the *full* internal name, not the
5191 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
5193 * Disposed old type and term read functions (Sign.read_def_typ,
5194 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
5195 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
5196 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
5197 Syntax.read_term_global etc.; see also OldGoals.read_term as last
5198 resort for legacy applications.
5200 * Disposed old declarations, tactics, tactic combinators that refer to
5201 the simpset or claset of an implicit theory (such as Addsimps,
5202 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
5203 embedded ML text, or local_simpset_of with a proper context passed as
5204 explicit runtime argument.
5206 * Rules and tactics that read instantiations (read_instantiate,
5207 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
5208 context, which is required for parsing and type-checking. Moreover,
5209 the variables are specified as plain indexnames, not string encodings
5210 thereof. INCOMPATIBILITY.
5212 * Generic Toplevel.add_hook interface allows to analyze the result of
5213 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
5214 for theorem dependency output of transactions resulting in a new
5217 * ML antiquotations: block-structured compilation context indicated by
5218 \<lbrace> ... \<rbrace>; additional antiquotation forms:
5220 @{binding name} - basic name binding
5221 @{let ?pat = term} - term abbreviation (HO matching)
5222 @{note name = fact} - fact abbreviation
5223 @{thm fact} - singleton fact (with attributes)
5224 @{thms fact} - general fact (with attributes)
5225 @{lemma prop by method} - singleton goal
5226 @{lemma prop by meth1 meth2} - singleton goal
5227 @{lemma prop1 ... propN by method} - general goal
5228 @{lemma prop1 ... propN by meth1 meth2} - general goal
5229 @{lemma (open) ...} - open derivation
5234 * The Isabelle "emacs" tool provides a specific interface to invoke
5235 Proof General / Emacs, with more explicit failure if that is not
5236 installed (the old isabelle-interface script silently falls back on
5237 isabelle-process). The PROOFGENERAL_HOME setting determines the
5238 installation location of the Proof General distribution.
5240 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
5241 the Isabelle process into a JVM/Scala application. See
5242 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
5243 process wrapper has been discontinued.)
5245 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
5247 * Various status messages (with exact source position information) are
5248 emitted, if proper markup print mode is enabled. This allows
5249 user-interface components to provide detailed feedback on internal
5254 New in Isabelle2008 (June 2008)
5255 -------------------------------
5259 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
5260 and updated, with formally checked references as hyperlinks.
5262 * Theory loader: use_thy (and similar operations) no longer set the
5263 implicit ML context, which was occasionally hard to predict and in
5264 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
5265 provides a proper context already.
5267 * Theory loader: old-style ML proof scripts being *attached* to a thy
5268 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
5269 'use' within a theory file will do the job.
5271 * Name space merge now observes canonical order, i.e. the second space
5272 is inserted into the first one, while existing entries in the first
5273 space take precedence. INCOMPATIBILITY in rare situations, may try to
5274 swap theory imports.
5276 * Syntax: symbol \<chi> is now considered a letter. Potential
5277 INCOMPATIBILITY in identifier syntax etc.
5279 * Outer syntax: string tokens no longer admit escaped white space,
5280 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
5281 white space without escapes.
5283 * Outer syntax: string tokens may contain arbitrary character codes
5284 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
5290 * Context-dependent token translations. Default setup reverts locally
5291 fixed variables, and adds hilite markup for undeclared frees.
5293 * Unused theorems can be found using the new command 'unused_thms'.
5294 There are three ways of invoking it:
5297 Only finds unused theorems in the current theory.
5299 (2) unused_thms thy_1 ... thy_n -
5300 Finds unused theorems in the current theory and all of its ancestors,
5301 excluding the theories thy_1 ... thy_n and all of their ancestors.
5303 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
5304 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
5305 their ancestors, excluding the theories thy_1 ... thy_n and all of
5308 In order to increase the readability of the list produced by
5309 unused_thms, theorems that have been created by a particular instance
5310 of a theory command such as 'inductive' or 'function' are considered
5311 to belong to the same "group", meaning that if at least one theorem in
5312 this group is used, the other theorems in the same group are no longer
5313 reported as unused. Moreover, if all theorems in the group are
5314 unused, only one theorem in the group is displayed.
5316 Note that proof objects have to be switched on in order for
5317 unused_thms to work properly (i.e. !proofs must be >= 1, which is
5318 usually the case when using Proof General with the default settings).
5320 * Authentic naming of facts disallows ad-hoc overwriting of previous
5321 theorems within the same name space. INCOMPATIBILITY, need to remove
5322 duplicate fact bindings, or even accidental fact duplications. Note
5323 that tools may maintain dynamically scoped facts systematically, using
5324 PureThy.add_thms_dynamic.
5326 * Command 'hide' now allows to hide from "fact" name space as well.
5328 * Eliminated destructive theorem database, simpset, claset, and
5329 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
5330 update of theories within ML code.
5332 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
5333 INCOMPATIBILITY, object-logics depending on former Pure require
5334 additional setup PureThy.old_appl_syntax_setup; object-logics
5335 depending on former CPure need to refer to Pure.
5337 * Commands 'use' and 'ML' are now purely functional, operating on
5338 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
5339 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
5342 * Command 'setup': discontinued implicit version with ML reference.
5344 * Instantiation target allows for simultaneous specification of class
5345 instance operations together with an instantiation proof.
5346 Type-checking phase allows to refer to class operations uniformly.
5347 See src/HOL/Complex/Complex.thy for an Isar example and
5348 src/HOL/Library/Eval.thy for an ML example.
5350 * Indexing of literal facts: be more serious about including only
5351 facts from the visible specification/proof context, but not the
5352 background context (locale etc.). Affects `prop` notation and method
5353 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
5356 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
5357 "(open)" option, which used to expose internal bound variables to the
5360 * Isar statements: removed obsolete case "rule_context".
5361 INCOMPATIBILITY, better use explicit fixes/assumes.
5363 * Locale proofs: default proof step now includes 'unfold_locales';
5364 hence 'proof' without argument may be used to unfold locale
5368 *** Document preparation ***
5370 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
5371 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
5372 obsolete thumbpdf setup (contemporary PDF viewers do this on the
5373 spot); renamed link color from "darkblue" to "linkcolor" (default
5374 value unchanged, can be redefined via \definecolor); no longer sets
5375 "a4paper" option (unnecessary or even intrusive).
5377 * Antiquotation @{lemma A method} proves proposition A by the given
5378 method (either a method name or a method name plus (optional) method
5379 arguments in parentheses) and prints A just like @{prop A}.
5384 * New primrec package. Specification syntax conforms in style to
5385 definition/function/.... No separate induction rule is provided. The
5386 "primrec" command distinguishes old-style and new-style specifications
5387 by syntax. The former primrec package is now named OldPrimrecPackage.
5388 When adjusting theories, beware: constants stemming from new-style
5389 primrec specifications have authentic syntax.
5391 * Metis prover is now an order of magnitude faster, and also works
5392 with multithreading.
5394 * Metis: the maximum number of clauses that can be produced from a
5395 theorem is now given by the attribute max_clauses. Theorems that
5396 exceed this number are ignored, with a warning printed.
5398 * Sledgehammer no longer produces structured proofs by default. To
5399 enable, declare [[sledgehammer_full = true]]. Attributes
5400 reconstruction_modulus, reconstruction_sorts renamed
5401 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
5403 * Method "induct_scheme" derives user-specified induction rules
5404 from well-founded induction and completeness of patterns. This factors
5405 out some operations that are done internally by the function package
5406 and makes them available separately. See
5407 src/HOL/ex/Induction_Scheme.thy for examples.
5409 * More flexible generation of measure functions for termination
5410 proofs: Measure functions can be declared by proving a rule of the
5411 form "is_measure f" and giving it the [measure_function] attribute.
5412 The "is_measure" predicate is logically meaningless (always true), and
5413 just guides the heuristic. To find suitable measure functions, the
5414 termination prover sets up the goal "is_measure ?f" of the appropriate
5415 type and generates all solutions by prolog-style backwards proof using
5418 This setup also deals with rules like
5420 "is_measure f ==> is_measure (list_size f)"
5422 which accommodates nested datatypes that recurse through lists.
5423 Similar rules are predeclared for products and option types.
5425 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
5429 - Definitions of overloaded constants on sets have to be replaced by
5430 definitions on => and bool.
5432 - Some definitions of overloaded operators on sets can now be proved
5433 using the definitions of the operators on => and bool. Therefore,
5434 the following theorems have been renamed:
5436 subset_def -> subset_eq
5437 psubset_def -> psubset_eq
5438 set_diff_def -> set_diff_eq
5439 Compl_def -> Compl_eq
5440 Sup_set_def -> Sup_set_eq
5441 Inf_set_def -> Inf_set_eq
5442 sup_set_def -> sup_set_eq
5443 inf_set_def -> inf_set_eq
5445 - Due to the incompleteness of the HO unification algorithm, some
5446 rules such as subst may require manual instantiation, if some of
5447 the unknowns in the rule is a set.
5449 - Higher order unification and forward proofs:
5452 have "P (S::'a set)" <...>
5453 then have "EX S. P S" ..
5455 no longer works (due to the incompleteness of the HO unification
5456 algorithm) and must be replaced by the pattern
5463 - Calculational reasoning with subst (or similar rules):
5466 have "P (S::'a set)" <...>
5467 also have "S = T" <...>
5468 finally have "P T" .
5470 no longer works (for similar reasons as the previous example) and
5471 must be replaced by something like
5473 have "P (S::'a set)" <...>
5474 moreover have "S = T" <...>
5475 ultimately have "P T" by simp
5477 - Tactics or packages written in ML code:
5478 Code performing pattern matching on types via
5480 Type ("set", [T]) => ...
5482 must be rewritten. Moreover, functions like strip_type or
5483 binder_types no longer return the right value when applied to a
5486 T1 => ... => Tn => U => bool
5490 T1 => ... => Tn => U set
5492 * Merged theories Wellfounded_Recursion, Accessible_Part and
5493 Wellfounded_Relations to theory Wellfounded.
5495 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
5497 * Class finite no longer treats UNIV as class parameter. Use class
5498 enum from theory Library/Enum instead to achieve a similar effect.
5501 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
5502 and "Cons". INCOMPATIBILITY.
5504 * HOL (and FOL): renamed variables in rules imp_elim and swap.
5505 Potential INCOMPATIBILITY.
5507 * Theory Product_Type: duplicated lemmas split_Pair_apply and
5508 injective_fst_snd removed, use split_eta and prod_eqI instead.
5509 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
5511 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
5512 the same name in theory Orderings:
5522 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
5523 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
5524 and different variable names.
5526 * Library/Option_ord.thy: Canonical order on option type.
5528 * Library/RBT.thy: Red-black trees, an efficient implementation of
5531 * Library/Countable.thy: Type class for countable types.
5533 * Theory Int: The representation of numerals has changed. The infix
5534 operator BIT and the bit datatype with constructors B0 and B1 have
5535 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
5536 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
5537 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
5540 * Theory Nat: definition of <= and < on natural numbers no longer
5541 depend on well-founded relations. INCOMPATIBILITY. Definitions
5542 le_def and less_def have disappeared. Consider lemmas not_less
5543 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
5545 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
5546 (whose purpose mainly is for various fold_set functionals) have been
5547 abandoned in favor of the existing algebraic classes
5548 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
5549 lower_semilattice (resp. upper_semilattice) and linorder.
5552 * Theory Transitive_Closure: induct and cases rules now declare proper
5553 case_names ("base" and "step"). INCOMPATIBILITY.
5555 * Theorem Inductive.lfp_ordinal_induct generalized to complete
5556 lattices. The form set-specific version is available as
5557 Inductive.lfp_ordinal_induct_set.
5559 * Renamed theorems "power.simps" to "power_int.simps".
5562 * Class semiring_div provides basic abstract properties of semirings
5563 with division and modulo operations. Subsumes former class dvd_mod.
5565 * Merged theories IntDef, Numeral and IntArith into unified theory
5566 Int. INCOMPATIBILITY.
5568 * Theory Library/Code_Index: type "index" now represents natural
5569 numbers rather than integers. INCOMPATIBILITY.
5571 * New class "uminus" with operation "uminus" (split of from class
5572 "minus" which now only has operation "minus", binary).
5575 * Constants "card", "internal_split", "option_map" now with authentic
5576 syntax. INCOMPATIBILITY.
5578 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
5579 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
5580 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
5581 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
5582 Sup_set_def, le_def, less_def, option_map_def now with object
5583 equality. INCOMPATIBILITY.
5585 * Records. Removed K_record, and replaced it by pure lambda term
5586 %x. c. The simplifier setup is now more robust against eta expansion.
5587 INCOMPATIBILITY: in cases explicitly referring to K_record.
5589 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
5591 * Library/ListVector: new theory of arithmetic vector operations.
5593 * Library/Order_Relation: new theory of various orderings as sets of
5594 pairs. Defines preorders, partial orders, linear orders and
5595 well-orders on sets and on types.
5600 * Renamed some theories to allow to loading both ZF and HOL in the
5603 Datatype -> Datatype_ZF
5604 Inductive -> Inductive_ZF
5611 INCOMPATIBILITY: ZF theories that import individual theories below
5612 Main might need to be adapted. Regular theory Main is still
5613 available, as trivial extension of Main_ZF.
5618 * ML within Isar: antiquotation @{const name} or @{const
5619 name(typargs)} produces statically-checked Const term.
5621 * Functor NamedThmsFun: data is available to the user as dynamic fact
5622 (of the same name). Removed obsolete print command.
5624 * Removed obsolete "use_legacy_bindings" function.
5626 * The ``print mode'' is now a thread-local value derived from a global
5627 template (the former print_mode reference), thus access becomes
5628 non-critical. The global print_mode reference is for session
5629 management only; user-code should use print_mode_value,
5630 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
5632 * Functions system/system_out provide a robust way to invoke external
5633 shell commands, with propagation of interrupts (requires Poly/ML
5634 5.2.1). Do not use OS.Process.system etc. from the basis library!
5639 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
5640 in accordance with Proof General 3.7, which prefers GNU emacs.
5642 * isatool tty runs Isabelle process with plain tty interaction;
5643 optional line editor may be specified via ISABELLE_LINE_EDITOR
5644 setting, the default settings attempt to locate "ledit" and "rlwrap".
5646 * isatool browser now works with Cygwin as well, using general
5647 "javapath" function defined in Isabelle process environment.
5649 * YXML notation provides a simple and efficient alternative to
5650 standard XML transfer syntax. See src/Pure/General/yxml.ML and
5651 isatool yxml as described in the Isabelle system manual.
5653 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
5654 provides general wrapper for managing an Isabelle process in a robust
5655 fashion, with ``cooked'' output from stdin/stderr.
5657 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
5658 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
5660 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
5661 way of changing the user's settings is via
5662 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
5665 * Multithreading.max_threads := 0 refers to the number of actual CPU
5666 cores of the underlying machine, which is a good starting point for
5667 optimal performance tuning. The corresponding usedir option -M allows
5668 "max" as an alias for "0". WARNING: does not work on certain versions
5669 of Mac OS (with Poly/ML 5.1).
5671 * isabelle-process: non-ML sessions are run with "nice", to reduce the
5672 adverse effect of Isabelle flooding interactive front-ends (notably
5673 ProofGeneral / XEmacs).
5677 New in Isabelle2007 (November 2007)
5678 -----------------------------------
5682 * More uniform information about legacy features, notably a
5683 warning/error of "Legacy feature: ...", depending on the state of the
5684 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
5685 legacy features will disappear eventually.
5687 * Theory syntax: the header format ``theory A = B + C:'' has been
5688 discontinued in favour of ``theory A imports B C begin''. Use isatool
5689 fixheaders to convert existing theory files. INCOMPATIBILITY.
5691 * Theory syntax: the old non-Isar theory file format has been
5692 discontinued altogether. Note that ML proof scripts may still be used
5693 with Isar theories; migration is usually quite simple with the ML
5694 function use_legacy_bindings. INCOMPATIBILITY.
5696 * Theory syntax: some popular names (e.g. 'class', 'declaration',
5697 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
5700 * Theory loader: be more serious about observing the static theory
5701 header specifications (including optional directories), but not the
5702 accidental file locations of previously successful loads. The strict
5703 update policy of former update_thy is now already performed by
5704 use_thy, so the former has been removed; use_thys updates several
5705 theories simultaneously, just as 'imports' within a theory header
5706 specification, but without merging the results. Potential
5707 INCOMPATIBILITY: may need to refine theory headers and commands
5708 ROOT.ML which depend on load order.
5710 * Theory loader: optional support for content-based file
5711 identification, instead of the traditional scheme of full physical
5712 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
5713 (cf. the system manual). The new scheme allows to work with
5714 non-finished theories in persistent session images, such that source
5715 files may be moved later on without requiring reloads.
5717 * Theory loader: old-style ML proof scripts being *attached* to a thy
5718 file (with the same base name as the theory) are considered a legacy
5719 feature, which will disappear eventually. Even now, the theory loader
5720 no longer maintains dependencies on such files.
5722 * Syntax: the scope for resolving ambiguities via type-inference is
5723 now limited to individual terms, instead of whole simultaneous
5724 specifications as before. This greatly reduces the complexity of the
5725 syntax module and improves flexibility by separating parsing and
5726 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
5727 'fixes' etc.) are required in rare situations.
5729 * Syntax: constants introduced by new-style packages ('definition',
5730 'abbreviation' etc.) are passed through the syntax module in
5731 ``authentic mode''. This means that associated mixfix annotations
5732 really stick to such constants, independently of potential name space
5733 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
5734 trees are represented slightly differently, may need to adapt syntax
5735 translations accordingly. Use CONST marker in 'translations' and
5736 @{const_syntax} antiquotation in 'parse_translation' etc.
5738 * Legacy goal package: reduced interface to the bare minimum required
5739 to keep existing proof scripts running. Most other user-level
5740 functions are now part of the OldGoals structure, which is *not* open
5741 by default (consider isatool expandshort before open OldGoals).
5742 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
5743 these tend to cause confusion about the actual goal (!) context being
5744 used here, which is not necessarily the same as the_context().
5746 * Command 'find_theorems': supports "*" wild-card in "name:"
5747 criterion; "with_dups" option. Certain ProofGeneral versions might
5748 support a specific search form (see ProofGeneral/CHANGES).
5750 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
5751 by default, which means that "prems" (and also "fixed variables") are
5752 suppressed from proof state output. Note that the ProofGeneral
5753 settings mechanism allows to change and save options persistently, but
5754 older versions of Isabelle will fail to start up if a negative prems
5757 * Local theory targets may be specified by non-nested blocks of
5758 ``context/locale/class ... begin'' followed by ``end''. The body may
5759 contain definitions, theorems etc., including any derived mechanism
5760 that has been implemented on top of these primitives. This concept
5761 generalizes the existing ``theorem (in ...)'' towards more versatility
5764 * Proof General interface: proper undo of final 'end' command;
5765 discontinued Isabelle/classic mode (ML proof scripts).
5768 *** Document preparation ***
5770 * Added antiquotation @{theory name} which prints the given name,
5771 after checking that it refers to a valid ancestor theory in the
5774 * Added antiquotations @{ML_type text} and @{ML_struct text} which
5775 check the given source text as ML type/structure, printing verbatim.
5777 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
5778 "c args == rhs" given in the current context. (Any number of
5779 arguments may be given on the LHS.)
5784 * The 'class' package offers a combination of axclass and locale to
5785 achieve Haskell-like type classes in Isabelle. Definitions and
5786 theorems within a class context produce both relative results (with
5787 implicit parameters according to the locale context), and polymorphic
5788 constants with qualified polymorphism (according to the class
5789 context). Within the body context of a 'class' target, a separate
5790 syntax layer ("user space type system") takes care of converting
5791 between global polymorphic consts and internal locale representation.
5792 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
5793 "isatool doc classes" provides a tutorial.
5795 * Generic code generator framework allows to generate executable
5796 code for ML and Haskell (including Isabelle classes). A short usage
5799 internal compilation:
5800 export_code <list of constants (term syntax)> in SML
5801 writing SML code to a file:
5802 export_code <list of constants (term syntax)> in SML <filename>
5803 writing OCaml code to a file:
5804 export_code <list of constants (term syntax)> in OCaml <filename>
5805 writing Haskell code to a bunch of files:
5806 export_code <list of constants (term syntax)> in Haskell <filename>
5808 evaluating closed propositions to True/False using code generation:
5811 Reasonable default setup of framework in HOL.
5813 Theorem attributs for selecting and transforming function equations theorems:
5815 [code fun]: select a theorem as function equation for a specific constant
5816 [code fun del]: deselect a theorem as function equation for a specific constant
5817 [code inline]: select an equation theorem for unfolding (inlining) in place
5818 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
5820 User-defined serializations (target in {SML, OCaml, Haskell}):
5822 code_const <and-list of constants (term syntax)>
5823 {(target) <and-list of const target syntax>}+
5825 code_type <and-list of type constructors>
5826 {(target) <and-list of type target syntax>}+
5828 code_instance <and-list of instances>
5830 where instance ::= <type constructor> :: <class>
5832 code_class <and_list of classes>
5833 {(target) <and-list of class target syntax>}+
5834 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
5836 code_instance and code_class only are effective to target Haskell.
5838 For example usage see src/HOL/ex/Codegenerator.thy and
5839 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
5840 generation from Isabelle/HOL theories is available via "isatool doc
5843 * Code generator: consts in 'consts_code' Isar commands are now
5844 referred to by usual term syntax (including optional type
5847 * Command 'no_translations' removes translation rules from theory
5850 * Overloaded definitions are now actually checked for acyclic
5851 dependencies. The overloading scheme is slightly more general than
5852 that of Haskell98, although Isabelle does not demand an exact
5853 correspondence to type class and instance declarations.
5854 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
5855 exotic versions of overloading -- at the discretion of the user!
5857 Polymorphic constants are represented via type arguments, i.e. the
5858 instantiation that matches an instance against the most general
5859 declaration given in the signature. For example, with the declaration
5860 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
5861 as c(nat). Overloading is essentially simultaneous structural
5862 recursion over such type arguments. Incomplete specification patterns
5863 impose global constraints on all occurrences, e.g. c('a * 'a) on the
5864 LHS means that more general c('a * 'b) will be disallowed on any RHS.
5865 Command 'print_theory' outputs the normalized system of recursive
5866 equations, see section "definitions".
5868 * Configuration options are maintained within the theory or proof
5869 context (with name and type bool/int/string), providing a very simple
5870 interface to a poor-man's version of general context data. Tools may
5871 declare options in ML (e.g. using Attrib.config_int) and then refer to
5872 these values using Config.get etc. Users may change options via an
5873 associated attribute of the same name. This form of context
5874 declaration works particularly well with commands 'declare' or
5875 'using', for example ``declare [[foo = 42]]''. Thus it has become
5876 very easy to avoid global references, which would not observe Isar
5877 toplevel undo/redo and fail to work with multithreading.
5879 Various global ML references of Pure and HOL have been turned into
5880 configuration options:
5882 Unify.search_bound unify_search_bound
5883 Unify.trace_bound unify_trace_bound
5884 Unify.trace_simp unify_trace_simp
5885 Unify.trace_types unify_trace_types
5886 Simplifier.simp_depth_limit simp_depth_limit
5887 Blast.depth_limit blast_depth_limit
5888 DatatypeProp.dtK datatype_distinctness_limit
5889 fast_arith_neq_limit fast_arith_neq_limit
5890 fast_arith_split_limit fast_arith_split_limit
5892 * Named collections of theorems may be easily installed as context
5893 data using the functor NamedThmsFun (see also
5894 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
5895 attributes; there is also a toplevel print command. This facility is
5896 just a common case of general context data, which is the preferred way
5897 for anything more complex than just a list of facts in canonical
5900 * Isar: command 'declaration' augments a local theory by generic
5901 declaration functions written in ML. This enables arbitrary content
5902 being added to the context, depending on a morphism that tells the
5903 difference of the original declaration context wrt. the application
5904 context encountered later on.
5906 * Isar: proper interfaces for simplification procedures. Command
5907 'simproc_setup' declares named simprocs (with match patterns, and body
5908 text in ML). Attribute "simproc" adds/deletes simprocs in the current
5909 context. ML antiquotation @{simproc name} retrieves named simprocs.
5911 * Isar: an extra pair of brackets around attribute declarations
5912 abbreviates a theorem reference involving an internal dummy fact,
5913 which will be ignored later --- only the effect of the attribute on
5914 the background context will persist. This form of in-place
5915 declarations is particularly useful with commands like 'declare' and
5916 'using', for example ``have A using [[simproc a]] by simp''.
5918 * Isar: method "assumption" (and implicit closing of subproofs) now
5919 takes simple non-atomic goal assumptions into account: after applying
5920 an assumption as a rule the resulting subgoals are solved by atomic
5921 assumption steps. This is particularly useful to finish 'obtain'
5922 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
5923 without referring to the original premise "!!x. P x ==> thesis" in the
5924 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
5927 * Isar: implicit use of prems from the Isar proof context is
5928 considered a legacy feature. Common applications like ``have A .''
5929 may be replaced by ``have A by fact'' or ``note `A`''. In general,
5930 referencing facts explicitly here improves readability and
5931 maintainability of proof texts.
5933 * Isar: improper proof element 'guess' is like 'obtain', but derives
5934 the obtained context from the course of reasoning! For example:
5936 assume "EX x y. A x & B y" -- "any previous fact"
5937 then guess x and y by clarify
5939 This technique is potentially adventurous, depending on the facts and
5940 proof tools being involved here.
5942 * Isar: known facts from the proof context may be specified as literal
5943 propositions, using ASCII back-quote syntax. This works wherever
5944 named facts used to be allowed so far, in proof commands, proof
5945 methods, attributes etc. Literal facts are retrieved from the context
5946 according to unification of type and term parameters. For example,
5947 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
5948 theorems in the current context, then these are valid literal facts:
5949 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
5951 There is also a proof method "fact" which does the same composition
5952 for explicit goal states, e.g. the following proof texts coincide with
5953 certain special cases of literal facts:
5955 have "A" by fact == note `A`
5956 have "A ==> B" by fact == note `A ==> B`
5957 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
5958 have "P a ==> Q a" by fact == note `P a ==> Q a`
5960 * Isar: ":" (colon) is no longer a symbolic identifier character in
5961 outer syntax. Thus symbolic identifiers may be used without
5962 additional white space in declarations like this: ``assume *: A''.
5964 * Isar: 'print_facts' prints all local facts of the current context,
5965 both named and unnamed ones.
5967 * Isar: 'def' now admits simultaneous definitions, e.g.:
5969 def x == "t" and y == "u"
5971 * Isar: added command 'unfolding', which is structurally similar to
5972 'using', but affects both the goal state and facts by unfolding given
5973 rewrite rules. Thus many occurrences of the 'unfold' method or
5974 'unfolded' attribute may be replaced by first-class proof text.
5976 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
5977 and command 'unfolding' now all support object-level equalities
5978 (potentially conditional). The underlying notion of rewrite rule is
5979 analogous to the 'rule_format' attribute, but *not* that of the
5980 Simplifier (which is usually more generous).
5982 * Isar: the new attribute [rotated n] (default n = 1) rotates the
5983 premises of a theorem by n. Useful in conjunction with drule.
5985 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
5986 method expression within a sandbox consisting of the first N
5987 sub-goals, which need to exist. For example, ``simp_all [3]''
5988 simplifies the first three sub-goals, while (rule foo, simp_all)[]
5989 simplifies all new goals that emerge from applying rule foo to the
5990 originally first one.
5992 * Isar: schematic goals are no longer restricted to higher-order
5993 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
5996 * Isar: the conclusion of a long theorem statement is now either
5997 'shows' (a simultaneous conjunction, as before), or 'obtains'
5998 (essentially a disjunction of cases with local parameters and
5999 assumptions). The latter allows to express general elimination rules
6000 adequately; in this notation common elimination rules look like this:
6002 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
6004 obtains x where "P x"
6006 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
6010 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
6016 The subsequent classical rules even refer to the formal "thesis"
6019 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
6022 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
6023 obtains "thesis ==> something"
6025 The actual proof of an 'obtains' statement is analogous to that of the
6026 Isar proof element 'obtain', only that there may be several cases.
6027 Optional case names may be specified in parentheses; these will be
6028 available both in the present proof and as annotations in the
6029 resulting rule, for later use with the 'cases' method (cf. attribute
6032 * Isar: the assumptions of a long theorem statement are available as
6033 "assms" fact in the proof context. This is more appropriate than the
6034 (historical) "prems", which refers to all assumptions of the current
6035 context, including those from the target locale, proof body etc.
6037 * Isar: 'print_statement' prints theorems from the current theory or
6038 proof context in long statement form, according to the syntax of a
6041 * Isar: 'obtain' takes an optional case name for the local context
6042 introduction rule (default "that").
6044 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
6045 explicit (is "_ ==> ?foo") in the rare cases where this still happens
6048 * Pure: syntax "CONST name" produces a fully internalized constant
6049 according to the current context. This is particularly useful for
6050 syntax translations that should refer to internal constant
6051 representations independently of name spaces.
6053 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
6054 instead of "FOO ". This allows multiple binder declarations to coexist
6055 in the same context. INCOMPATIBILITY.
6057 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
6058 primitive that also works in a locale context (both for constants and
6059 fixed variables). Type declaration and internal syntactic representation
6060 of given constants retrieved from the context. Likewise, the
6061 'no_notation' command allows to remove given syntax annotations from the
6064 * Isar/locales: new derived specification elements 'axiomatization',
6065 'definition', 'abbreviation', which support type-inference, admit
6066 object-level specifications (equality, equivalence). See also the
6067 isar-ref manual. Examples:
6070 eq (infix "===" 50) where
6071 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
6073 definition "f x y = x + y + 1"
6074 definition g where "g x = f x x"
6077 neq (infix "=!=" 50) where
6078 "x =!= y == ~ (x === y)"
6080 These specifications may be also used in a locale context. Then the
6081 constants being introduced depend on certain fixed parameters, and the
6082 constant name is qualified by the locale base name. An internal
6083 abbreviation takes care for convenient input and output, making the
6084 parameters implicit and using the original short name. See also
6085 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
6086 entities from a monomorphic theory.
6088 Presently, abbreviations are only available 'in' a target locale, but
6089 not inherited by general import expressions. Also note that
6090 'abbreviation' may be used as a type-safe replacement for 'syntax' +
6091 'translations' in common applications. The "no_abbrevs" print mode
6092 prevents folding of abbreviations in term output.
6094 Concrete syntax is attached to specified constants in internal form,
6095 independently of name spaces. The parse tree representation is
6096 slightly different -- use 'notation' instead of raw 'syntax', and
6097 'translations' with explicit "CONST" markup to accommodate this.
6099 * Pure/Isar: unified syntax for new-style specification mechanisms
6100 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
6101 full type inference and dummy patterns ("_"). For example:
6103 definition "K x _ = x"
6105 inductive conj for A B
6106 where "A ==> B ==> conj A B"
6108 * Pure: command 'print_abbrevs' prints all constant abbreviations of
6109 the current context. Print mode "no_abbrevs" prevents inversion of
6110 abbreviations on output.
6112 * Isar/locales: improved parameter handling: use of locales "var" and
6113 "struct" no longer necessary; - parameter renamings are no longer
6114 required to be injective. For example, this allows to define
6115 endomorphisms as locale endom = homom mult mult h.
6117 * Isar/locales: changed the way locales with predicates are defined.
6118 Instead of accumulating the specification, the imported expression is
6119 now an interpretation. INCOMPATIBILITY: different normal form of
6120 locale expressions. In particular, in interpretations of locales with
6121 predicates, goals repesenting already interpreted fragments are not
6122 removed automatically. Use methods `intro_locales' and
6123 `unfold_locales'; see below.
6125 * Isar/locales: new methods `intro_locales' and `unfold_locales'
6126 provide backward reasoning on locales predicates. The methods are
6127 aware of interpretations and discharge corresponding goals.
6128 `intro_locales' is less aggressive then `unfold_locales' and does not
6129 unfold predicates to assumptions.
6131 * Isar/locales: the order in which locale fragments are accumulated
6132 has changed. This enables to override declarations from fragments due
6133 to interpretations -- for example, unwanted simp rules.
6135 * Isar/locales: interpretation in theories and proof contexts has been
6136 extended. One may now specify (and prove) equations, which are
6137 unfolded in interpreted theorems. This is useful for replacing
6138 defined concepts (constants depending on locale parameters) by
6139 concepts already existing in the target context. Example:
6141 interpretation partial_order ["op <= :: [int, int] => bool"]
6142 where "partial_order.less (op <=) (x::int) y = (x < y)"
6144 Typically, the constant `partial_order.less' is created by a
6145 definition specification element in the context of locale
6148 * Method "induct": improved internal context management to support
6149 local fixes and defines on-the-fly. Thus explicit meta-level
6150 connectives !! and ==> are rarely required anymore in inductive goals
6151 (using object-logic connectives for this purpose has been long
6152 obsolete anyway). Common proof patterns are explained in
6153 src/HOL/Induct/Common_Patterns.thy, see also
6154 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
6157 * Method "induct": improved handling of simultaneous goals. Instead of
6158 introducing object-level conjunction, the statement is now split into
6159 several conclusions, while the corresponding symbolic cases are nested
6160 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
6161 see src/HOL/Induct/Common_Patterns.thy, for example.
6163 * Method "induct": mutual induction rules are now specified as a list
6164 of rule sharing the same induction cases. HOL packages usually provide
6165 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
6166 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
6167 mutual induction rules differently, i.e. like this:
6169 (induct rule: foo_bar.inducts)
6170 (induct set: foo bar)
6171 (induct pred: foo bar)
6172 (induct type: foo bar)
6174 The ML function ProjectRule.projections turns old-style rules into the
6177 * Method "coinduct": dual of induction, see
6178 src/HOL/Library/Coinductive_List.thy for various examples.
6180 * Method "cases", "induct", "coinduct": the ``(open)'' option is
6181 considered a legacy feature.
6183 * Attribute "symmetric" produces result with standardized schematic
6184 variables (index 0). Potential INCOMPATIBILITY.
6186 * Simplifier: by default the simplifier trace only shows top level
6187 rewrites now. That is, trace_simp_depth_limit is set to 1 by
6188 default. Thus there is less danger of being flooded by the trace. The
6189 trace indicates where parts have been suppressed.
6191 * Provers/classical: removed obsolete classical version of elim_format
6192 attribute; classical elim/dest rules are now treated uniformly when
6193 manipulating the claset.
6195 * Provers/classical: stricter checks to ensure that supplied intro,
6196 dest and elim rules are well-formed; dest and elim rules must have at
6199 * Provers/classical: attributes dest/elim/intro take an optional
6200 weight argument for the rule (just as the Pure versions). Weights are
6201 ignored by automated tools, but determine the search order of single
6204 * Syntax: input syntax now supports dummy variable binding "%_. b",
6205 where the body does not mention the bound variable. Note that dummy
6206 patterns implicitly depend on their context of bounds, which makes
6207 "{_. _}" match any set comprehension as expected. Potential
6208 INCOMPATIBILITY -- parse translations need to cope with syntactic
6209 constant "_idtdummy" in the binding position.
6211 * Syntax: removed obsolete syntactic constant "_K" and its associated
6212 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
6213 for example "A -> B" => "Pi A (%_. B)".
6215 * Pure: 'class_deps' command visualizes the subclass relation, using
6216 the graph browser tool.
6218 * Pure: 'print_theory' now suppresses certain internal declarations by
6219 default; use '!' option for full details.
6224 * Method "metis" proves goals by applying the Metis general-purpose
6225 resolution prover (see also http://gilith.com/software/metis/).
6226 Examples are in the directory MetisExamples. WARNING: the
6227 Isabelle/HOL-Metis integration does not yet work properly with
6230 * Command 'sledgehammer' invokes external automatic theorem provers as
6231 background processes. It generates calls to the "metis" method if
6232 successful. These can be pasted into the proof. Users do not have to
6233 wait for the automatic provers to return. WARNING: does not really
6234 work with multi-threading.
6236 * New "auto_quickcheck" feature tests outermost goal statements for
6237 potential counter-examples. Controlled by ML references
6238 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
6239 5000 milliseconds). Fails silently if statements is outside of
6240 executable fragment, or any other codgenerator problem occurs.
6242 * New constant "undefined" with axiom "undefined x = undefined".
6244 * Added class "HOL.eq", allowing for code generation with polymorphic
6247 * Some renaming of class constants due to canonical name prefixing in
6248 the new 'class' package:
6250 HOL.abs ~> HOL.abs_class.abs
6251 HOL.divide ~> HOL.divide_class.divide
6252 0 ~> HOL.zero_class.zero
6253 1 ~> HOL.one_class.one
6254 op + ~> HOL.plus_class.plus
6255 op - ~> HOL.minus_class.minus
6256 uminus ~> HOL.minus_class.uminus
6257 op * ~> HOL.times_class.times
6258 op < ~> HOL.ord_class.less
6259 op <= > HOL.ord_class.less_eq
6260 Nat.power ~> Power.power_class.power
6261 Nat.size ~> Nat.size_class.size
6262 Numeral.number_of ~> Numeral.number_class.number_of
6263 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
6264 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
6265 Orderings.min ~> Orderings.ord_class.min
6266 Orderings.max ~> Orderings.ord_class.max
6267 Divides.op div ~> Divides.div_class.div
6268 Divides.op mod ~> Divides.div_class.mod
6269 Divides.op dvd ~> Divides.div_class.dvd
6271 INCOMPATIBILITY. Adaptions may be required in the following cases:
6273 a) User-defined constants using any of the names "plus", "minus",
6274 "times", "less" or "less_eq". The standard syntax translations for
6275 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
6278 b) Variables named "plus", "minus", "times", "less", "less_eq"
6279 INCOMPATIBILITY: use more specific names.
6281 c) Permutative equations (e.g. "a + b = b + a")
6282 Since the change of names also changes the order of terms, permutative
6283 rewrite rules may get applied in a different order. Experience shows
6284 that this is rarely the case (only two adaptions in the whole Isabelle
6285 distribution). INCOMPATIBILITY: rewrite proofs
6287 d) ML code directly refering to constant names
6288 This in general only affects hand-written proof tactics, simprocs and
6289 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
6290 Consider using @{const_name} antiquotation.
6292 * New class "default" with associated constant "default".
6294 * Function "sgn" is now overloaded and available on int, real, complex
6295 (and other numeric types), using class "sgn". Two possible defs of
6296 sgn are given as equational assumptions in the classes sgn_if and
6297 sgn_div_norm; ordered_idom now also inherits from sgn_if.
6300 * Locale "partial_order" now unified with class "order" (cf. theory
6301 Orderings), added parameter "less". INCOMPATIBILITY.
6303 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
6304 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
6305 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
6307 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
6308 changed order of proof goals in instance proofs.
6310 * The transitivity reasoner for partial and linear orders is set up
6311 for classes "order" and "linorder". Instances of the reasoner are available
6312 in all contexts importing or interpreting the corresponding locales.
6313 Method "order" invokes the reasoner separately; the reasoner
6314 is also integrated with the Simplifier as a solver. Diagnostic
6315 command 'print_orders' shows the available instances of the reasoner
6316 in the current context.
6318 * Localized monotonicity predicate in theory "Orderings"; integrated
6319 lemmas max_of_mono and min_of_mono with this predicate.
6322 * Formulation of theorem "dense" changed slightly due to integration
6323 with new class dense_linear_order.
6325 * Uniform lattice theory development in HOL.
6327 constants "meet" and "join" now named "inf" and "sup"
6328 constant "Meet" now named "Inf"
6330 classes "meet_semilorder" and "join_semilorder" now named
6331 "lower_semilattice" and "upper_semilattice"
6332 class "lorder" now named "lattice"
6333 class "comp_lat" now named "complete_lattice"
6335 Instantiation of lattice classes allows explicit definitions
6336 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
6338 INCOMPATIBILITY. Theorem renames:
6340 meet_left_le ~> inf_le1
6341 meet_right_le ~> inf_le2
6342 join_left_le ~> sup_ge1
6343 join_right_le ~> sup_ge2
6344 meet_join_le ~> inf_sup_ord
6347 le_meet ~> le_inf_iff
6348 le_join ~> ge_sup_conv
6349 meet_idempotent ~> inf_idem
6350 join_idempotent ~> sup_idem
6351 meet_comm ~> inf_commute
6352 join_comm ~> sup_commute
6353 meet_leI1 ~> le_infI1
6354 meet_leI2 ~> le_infI2
6355 le_joinI1 ~> le_supI1
6356 le_joinI2 ~> le_supI2
6357 meet_assoc ~> inf_assoc
6358 join_assoc ~> sup_assoc
6359 meet_left_comm ~> inf_left_commute
6360 meet_left_idempotent ~> inf_left_idem
6361 join_left_comm ~> sup_left_commute
6362 join_left_idempotent ~> sup_left_idem
6365 le_def_meet ~> le_iff_inf
6366 le_def_join ~> le_iff_sup
6367 join_absorp2 ~> sup_absorb2
6368 join_absorp1 ~> sup_absorb1
6369 meet_absorp1 ~> inf_absorb1
6370 meet_absorp2 ~> inf_absorb2
6371 meet_join_absorp ~> inf_sup_absorb
6372 join_meet_absorp ~> sup_inf_absorb
6373 distrib_join_le ~> distrib_sup_le
6374 distrib_meet_le ~> distrib_inf_le
6376 add_meet_distrib_left ~> add_inf_distrib_left
6377 add_join_distrib_left ~> add_sup_distrib_left
6378 is_join_neg_meet ~> is_join_neg_inf
6379 is_meet_neg_join ~> is_meet_neg_sup
6380 add_meet_distrib_right ~> add_inf_distrib_right
6381 add_join_distrib_right ~> add_sup_distrib_right
6382 add_meet_join_distribs ~> add_sup_inf_distribs
6383 join_eq_neg_meet ~> sup_eq_neg_inf
6384 meet_eq_neg_join ~> inf_eq_neg_sup
6385 add_eq_meet_join ~> add_eq_inf_sup
6386 meet_0_imp_0 ~> inf_0_imp_0
6387 join_0_imp_0 ~> sup_0_imp_0
6388 meet_0_eq_0 ~> inf_0_eq_0
6389 join_0_eq_0 ~> sup_0_eq_0
6390 neg_meet_eq_join ~> neg_inf_eq_sup
6391 neg_join_eq_meet ~> neg_sup_eq_inf
6392 join_eq_if ~> sup_eq_if
6394 mono_meet ~> mono_inf
6395 mono_join ~> mono_sup
6396 meet_bool_eq ~> inf_bool_eq
6397 join_bool_eq ~> sup_bool_eq
6398 meet_fun_eq ~> inf_fun_eq
6399 join_fun_eq ~> sup_fun_eq
6400 meet_set_eq ~> inf_set_eq
6401 join_set_eq ~> sup_set_eq
6402 meet1_iff ~> inf1_iff
6403 meet2_iff ~> inf2_iff
6412 join1_iff ~> sup1_iff
6413 join2_iff ~> sup2_iff
6423 is_meet_Meet ~> is_meet_Inf
6424 Meet_bool_def ~> Inf_bool_def
6425 Meet_fun_def ~> Inf_fun_def
6426 Meet_greatest ~> Inf_greatest
6427 Meet_lower ~> Inf_lower
6428 Meet_set_def ~> Inf_set_def
6431 Sup_bool_eq ~> Sup_bool_def
6432 Sup_fun_eq ~> Sup_fun_def
6433 Sup_set_eq ~> Sup_set_def
6435 listsp_meetI ~> listsp_infI
6436 listsp_meet_eq ~> listsp_inf_eq
6441 * Added syntactic class "size"; overloaded constant "size" now has
6442 type "'a::size ==> bool"
6444 * Internal reorganisation of `size' of datatypes: size theorems
6445 "foo.size" are no longer subsumed by "foo.simps" (but are still
6446 simplification rules by default!); theorems "prod.size" now named
6449 * Class "div" now inherits from class "times" rather than "type".
6452 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
6453 Linorder etc. have disappeared; operations defined in terms of
6454 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
6456 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
6458 * HOL-Word: New extensive library and type for generic, fixed size
6459 machine words, with arithmetic, bit-wise, shifting and rotating
6460 operations, reflection into int, nat, and bool lists, automation for
6461 linear arithmetic (by automatic reflection into nat or int), including
6462 lemmas on overflow and monotonicity. Instantiated to all appropriate
6463 arithmetic type classes, supporting automatic simplification of
6464 numerals on all operations.
6466 * Library/Boolean_Algebra: locales for abstract boolean algebras.
6468 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
6470 * Code generator library theories:
6471 - Code_Integer represents HOL integers by big integer literals in target
6473 - Code_Char represents HOL characters by character literals in target
6475 - Code_Char_chr like Code_Char, but also offers treatment of character
6476 codes; includes Code_Integer.
6477 - Executable_Set allows to generate code for finite sets using lists.
6478 - Executable_Rat implements rational numbers as triples (sign, enumerator,
6480 - Executable_Real implements a subset of real numbers, namly those
6481 representable by rational numbers.
6482 - Efficient_Nat implements natural numbers by integers, which in general will
6483 result in higher efficency; pattern matching with 0/Suc is eliminated;
6484 includes Code_Integer.
6485 - Code_Index provides an additional datatype index which is mapped to
6486 target-language built-in integers.
6487 - Code_Message provides an additional datatype message_string which is isomorphic to
6488 strings; messages are mapped to target-language strings.
6490 * New package for inductive predicates
6492 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
6495 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
6496 for z_1 :: U_1 and ... and z_n :: U_m
6498 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
6501 with full support for type-inference, rather than
6503 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
6505 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
6506 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
6508 inductive "s z_1 ... z_m"
6510 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
6513 For backward compatibility, there is a wrapper allowing inductive
6514 sets to be defined with the new package via
6517 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
6518 for z_1 :: U_1 and ... and z_n :: U_m
6520 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
6526 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
6527 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
6528 for z_1 :: U_1 and ... and z_n :: U_m
6530 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
6531 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
6534 if the additional syntax "p ..." is required.
6536 Numerous examples can be found in the subdirectories src/HOL/Auth,
6537 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
6541 - Since declaration and definition of inductive sets or predicates
6542 is no longer separated, abbreviations involving the newly
6543 introduced sets or predicates must be specified together with the
6544 introduction rules after the 'where' keyword (see above), rather
6545 than before the actual inductive definition.
6547 - The variables in induction and elimination rules are now
6548 quantified in the order of their occurrence in the introduction
6549 rules, rather than in alphabetical order. Since this may break
6550 some proofs, these proofs either have to be repaired, e.g. by
6551 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
6552 statements of the form
6554 case (rule_i a_i_1 ... a_i_{k_i})
6556 or the old order of quantification has to be restored by explicitly adding
6557 meta-level quantifiers in the introduction rules, i.e.
6559 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
6561 - The format of the elimination rules is now
6563 p z_1 ... z_m x_1 ... x_n ==>
6564 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
6569 (x_1, ..., x_n) : s z_1 ... z_m ==>
6570 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
6573 for sets rather than
6575 x : s z_1 ... z_m ==>
6576 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
6579 This may require terms in goals to be expanded to n-tuples
6580 (e.g. using case_tac or simplification with the split_paired_all
6581 rule) before the above elimination rule is applicable.
6583 - The elimination or case analysis rules for (mutually) inductive
6584 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
6585 list of rules "p_1_..._p_k.elims" is no longer available.
6587 * New package "function"/"fun" for general recursive functions,
6588 supporting mutual and nested recursion, definitions in local contexts,
6589 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
6590 for small examples, and the separate tutorial on the function
6591 package. The old recdef "package" is still available as before, but
6592 users are encouraged to use the new package.
6594 * Method "lexicographic_order" automatically synthesizes termination
6595 relations as lexicographic combinations of size measures.
6597 * Case-expressions allow arbitrary constructor-patterns (including
6598 "_") and take their order into account, like in functional
6599 programming. Internally, this is translated into nested
6600 case-expressions; missing cases are added and mapped to the predefined
6601 constant "undefined". In complicated cases printing may no longer show
6602 the original input but the internal form. Lambda-abstractions allow
6603 the same form of pattern matching: "% pat1 => e1 | ..." is an
6604 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
6607 * IntDef: The constant "int :: nat => int" has been removed; now "int"
6608 is an abbreviation for "of_nat :: nat => int". The simplification
6609 rules for "of_nat" have been changed to work like "int" did
6610 previously. Potential INCOMPATIBILITY:
6611 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
6612 - of_nat_diff and of_nat_mult are no longer default simp rules
6614 * Method "algebra" solves polynomial equations over (semi)rings using
6615 Groebner bases. The (semi)ring structure is defined by locales and the
6616 tool setup depends on that generic context. Installing the method for
6617 a specific type involves instantiating the locale and possibly adding
6618 declarations for computation on the coefficients. The method is
6619 already instantiated for natural numbers and for the axiomatic class
6620 of idoms with numerals. See also the paper by Chaieb and Wenzel at
6621 CALCULEMUS 2007 for the general principles underlying this
6622 architecture of context-aware proof-tools.
6624 * Method "ferrack" implements quantifier elimination over
6625 special-purpose dense linear orders using locales (analogous to
6626 "algebra"). The method is already installed for class
6627 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
6630 * Former constant "List.op @" now named "List.append". Use ML
6631 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
6632 circumvent possible incompatibilities when working on ML level.
6634 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
6636 * New function listsum :: 'a list => 'a for arbitrary monoids.
6637 Special syntax: "SUM x <- xs. f x" (and latex variants)
6639 * New syntax for Haskell-like list comprehension (input only), eg.
6640 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
6642 * The special syntax for function "filter" has changed from [x :
6643 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
6644 comprehension syntax, and for uniformity. INCOMPATIBILITY.
6646 * [a..b] is now defined for arbitrary linear orders. It used to be
6647 defined on nat only, as an abbreviation for [a..<Suc b]
6650 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
6652 * New functions "sorted" and "sort" in src/HOL/List.thy.
6654 * New lemma collection field_simps (an extension of ring_simps) for
6655 manipulating (in)equations involving division. Multiplies with all
6656 denominators that can be proved to be non-zero (in equations) or
6657 positive/negative (in inequations).
6659 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
6660 have been improved and renamed to ring_simps, group_simps and
6661 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
6662 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
6664 * Theory Library/Commutative_Ring: switched from recdef to function
6665 package; constants add, mul, pow now curried. Infix syntax for
6666 algebraic operations.
6668 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
6671 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
6674 * HOL/records: generalised field-update to take a function on the
6675 field rather than the new value: r(|A := x|) is translated to A_update
6676 (K x) r The K-combinator that is internally used is called K_record.
6677 INCOMPATIBILITY: Usage of the plain update functions has to be
6680 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
6681 * x = 0, which are required for a semiring. Richer structures do not
6682 inherit from semiring_0 anymore, because this property is a theorem
6683 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
6684 there is more to prove, but this is mostly trivial.
6686 * Class "recpower" is generalized to arbitrary monoids, not just
6687 commutative semirings. INCOMPATIBILITY: may need to incorporate
6688 commutativity or semiring properties additionally.
6690 * Constant "List.list_all2" in List.thy now uses authentic syntax.
6691 INCOMPATIBILITY: translations containing list_all2 may go wrong,
6692 better use 'abbreviation'.
6694 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
6696 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
6697 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
6698 significant changes for setting up numeral syntax for types:
6699 - New constants Numeral.pred and Numeral.succ instead
6700 of former Numeral.bin_pred and Numeral.bin_succ.
6701 - Use integer operations instead of bin_add, bin_mult and so on.
6702 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
6703 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
6705 See src/HOL/Integ/IntArith.thy for an example setup.
6707 * Command 'normal_form' computes the normal form of a term that may
6708 contain free variables. For example ``normal_form "rev [a, b, c]"''
6709 produces ``[b, c, a]'' (without proof). This command is suitable for
6710 heavy-duty computations because the functions are compiled to ML
6711 first. Correspondingly, a method "normalization" is provided. See
6712 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
6714 * Alternative iff syntax "A <-> B" for equality on bool (with priority
6715 25 like -->); output depends on the "iff" print_mode, the default is
6716 "A = B" (with priority 50).
6718 * Relations less (<) and less_eq (<=) are also available on type bool.
6719 Modified syntax to disallow nesting without explicit parentheses,
6720 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
6723 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
6725 * Relation composition operator "op O" now has precedence 75 and binds
6726 stronger than union and intersection. INCOMPATIBILITY.
6728 * The old set interval syntax "{m..n(}" (and relatives) has been
6729 removed. Use "{m..<n}" (and relatives) instead.
6731 * In the context of the assumption "~(s = t)" the Simplifier rewrites
6732 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
6733 ``declare [[simproc del: neq]]''.
6735 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
6738 * Theorem Cons_eq_map_conv no longer declared as "simp".
6740 * Theorem setsum_mult renamed to setsum_right_distrib.
6742 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
6745 * Reimplemented methods "sat" and "satx", with several improvements:
6746 goals no longer need to be stated as "<prems> ==> False", equivalences
6747 (i.e. "=" on type bool) are handled, variable names of the form
6748 "lit_<n>" are no longer reserved, significant speedup.
6750 * Methods "sat" and "satx" can now replay MiniSat proof traces.
6751 zChaff is still supported as well.
6753 * 'inductive' and 'datatype': provide projections of mutual rules,
6754 bundled as foo_bar.inducts;
6756 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
6759 * Library: moved theory Accessible_Part to main HOL.
6761 * Library: added theory Coinductive_List of potentially infinite lists
6762 as greatest fixed-point.
6764 * Library: added theory AssocList which implements (finite) maps as
6767 * Method "evaluation" solves goals (i.e. a boolean expression)
6768 efficiently by compiling it to ML. The goal is "proved" (via an
6769 oracle) if it evaluates to True.
6771 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
6772 also when invoked by the simplifier. This results in the Simplifier
6773 being more powerful on arithmetic goals. INCOMPATIBILITY.
6774 Configuration option fast_arith_split_limit=0 recovers the old
6777 * Support for hex (0x20) and binary (0b1001) numerals.
6779 * New method: reify eqs (t), where eqs are equations for an
6780 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
6781 parameter, computes a term s::'b and a list xs::'a list and proves the
6782 theorem I xs s = t. This is also known as reification or quoting. The
6783 resulting theorem is applied to the subgoal to substitute t with I xs
6784 s. If t is omitted, the subgoal itself is reified.
6786 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
6787 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
6788 where f is supposed to be a computable function (in the sense of code
6789 generattion). The method uses reify to compute s and xs as above then
6790 applies corr_thm and uses normalization by evaluation to "prove" f s =
6791 r and finally gets the theorem t = r, which is again applied to the
6792 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
6794 * Reflection: Automatic reification now handels binding, an example is
6795 available in src/HOL/ex/ReflectionEx.thy
6797 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
6798 command 'statespace' that is similar to 'record', but introduces an
6799 abstract specification based on the locale infrastructure instead of
6800 HOL types. This leads to extra flexibility in composing state spaces,
6801 in particular multiple inheritance and renaming of components.
6806 * Hyperreal: Functions root and sqrt are now defined on negative real
6807 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
6808 Nonnegativity side conditions have been removed from many lemmas, so
6809 that more subgoals may now be solved by simplification; potential
6812 * Real: new type classes formalize real normed vector spaces and
6813 algebras, using new overloaded constants scaleR :: real => 'a => 'a
6814 and norm :: 'a => real.
6816 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
6817 reals into other types. The overloaded constant Reals :: 'a set is now
6818 defined as range of_real; potential INCOMPATIBILITY.
6820 * Real: proper support for ML code generation, including 'quickcheck'.
6821 Reals are implemented as arbitrary precision rationals.
6823 * Hyperreal: Several constants that previously worked only for the
6824 reals have been generalized, so they now work over arbitrary vector
6825 spaces. Type annotations may need to be added in some cases; potential
6828 Infinitesimal :: ('a::real_normed_vector) star set
6829 HFinite :: ('a::real_normed_vector) star set
6830 HInfinite :: ('a::real_normed_vector) star set
6831 approx :: ('a::real_normed_vector) star => 'a star => bool
6832 monad :: ('a::real_normed_vector) star => 'a star set
6833 galaxy :: ('a::real_normed_vector) star => 'a star set
6834 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
6835 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
6836 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
6837 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
6838 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
6839 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
6840 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
6841 sgn :: 'a::real_normed_vector => 'a
6842 exp :: 'a::{recpower,real_normed_field,banach} => 'a
6844 * Complex: Some complex-specific constants are now abbreviations for
6845 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
6846 hnorm. Other constants have been entirely removed in favor of the
6847 polymorphic versions (INCOMPATIBILITY):
6851 HInfinite <-- CInfinite
6852 Infinitesimal <-- CInfinitesimal
6855 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
6856 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
6857 (ns)deriv <-- (ns)cderiv
6862 * Formalisation of ideals and the quotient construction over rings.
6864 * Order and lattice theory no longer based on records.
6867 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
6868 greatest_closed. INCOMPATIBILITY.
6870 * Method algebra is now set up via an attribute. For examples see
6871 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
6872 of algebraic structures.
6874 * Renamed theory CRing to Ring.
6879 * Substantial, yet incomplete support for nominal datatypes (binding
6880 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
6881 src/HOL/Nominal/Examples. Prospective users should consult
6882 http://isabelle.in.tum.de/nominal/
6887 * ML basics: just one true type int, which coincides with IntInf.int
6890 * ML within Isar: antiquotations allow to embed statically-checked
6891 formal entities in the source, referring to the context available at
6892 compile-time. For example:
6894 ML {* @{sort "{zero,one}"} *}
6895 ML {* @{typ "'a => 'b"} *}
6896 ML {* @{term "%x. x"} *}
6897 ML {* @{prop "x == y"} *}
6898 ML {* @{ctyp "'a => 'b"} *}
6899 ML {* @{cterm "%x. x"} *}
6900 ML {* @{cprop "x == y"} *}
6901 ML {* @{thm asm_rl} *}
6902 ML {* @{thms asm_rl} *}
6903 ML {* @{type_name c} *}
6904 ML {* @{type_syntax c} *}
6905 ML {* @{const_name c} *}
6906 ML {* @{const_syntax c} *}
6909 ML {* @{theory Pure} *}
6910 ML {* @{theory_ref} *}
6911 ML {* @{theory_ref Pure} *}
6914 ML {* @{clasimpset} *}
6916 The same works for sources being ``used'' within an Isar context.
6918 * ML in Isar: improved error reporting; extra verbosity with
6919 ML_Context.trace enabled.
6921 * Pure/General/table.ML: the join operations now works via exceptions
6922 DUP/SAME instead of type option. This is simpler in simple cases, and
6923 admits slightly more efficient complex applications.
6925 * Pure: 'advanced' translation functions (parse_translation etc.) now
6926 use Context.generic instead of just theory.
6928 * Pure: datatype Context.generic joins theory/Proof.context and
6929 provides some facilities for code that works in either kind of
6930 context, notably GenericDataFun for uniform theory and proof data.
6932 * Pure: simplified internal attribute type, which is now always
6933 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
6934 local (Proof.context) attributes have been discontinued, while
6935 minimizing code duplication. Thm.rule_attribute and
6936 Thm.declaration_attribute build canonical attributes; see also structure
6937 Context for further operations on Context.generic, notably
6938 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
6939 declarations and definitions.
6941 * Context data interfaces (Theory/Proof/GenericDataFun): removed
6942 name/print, uninitialized data defaults to ad-hoc copy of empty value,
6943 init only required for impure data. INCOMPATIBILITY: empty really need
6944 to be empty (no dependencies on theory content!)
6946 * Pure/kernel: consts certification ignores sort constraints given in
6947 signature declarations. (This information is not relevant to the
6948 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
6949 potential INCOMPATIBILITY.
6951 * Pure: axiomatic type classes are now purely definitional, with
6952 explicit proofs of class axioms and super class relations performed
6953 internally. See Pure/axclass.ML for the main internal interfaces --
6954 notably AxClass.define_class supercedes AxClass.add_axclass, and
6955 AxClass.axiomatize_class/classrel/arity supersede
6956 Sign.add_classes/classrel/arities.
6958 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
6959 global/local versions on theory vs. Proof.context have been
6960 discontinued; Attrib.syntax and Method.syntax have been adapted
6961 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
6962 attributes, methods, etc.
6964 * Pure: several functions of signature "... -> theory -> theory * ..."
6965 have been reoriented to "... -> theory -> ... * theory" in order to
6966 allow natural usage in combination with the ||>, ||>>, |-> and
6967 fold_map combinators.
6969 * Pure: official theorem names (closed derivations) and additional
6970 comments (tags) are now strictly separate. Name hints -- which are
6971 maintained as tags -- may be attached any time without affecting the
6974 * Pure: primitive rule lift_rule now takes goal cterm instead of an
6975 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
6976 achieve the old behaviour.
6978 * Pure: the "Goal" constant is now called "prop", supporting a
6979 slightly more general idea of ``protecting'' meta-level rule
6982 * Pure: Logic.(un)varify only works in a global context, which is now
6983 enforced instead of silently assumed. INCOMPATIBILITY, may use
6984 Logic.legacy_(un)varify as temporary workaround.
6986 * Pure: structure Name provides scalable operations for generating
6987 internal variable names, notably Name.variants etc. This replaces
6988 some popular functions from term.ML:
6990 Term.variant -> Name.variant
6991 Term.variantlist -> Name.variant_list
6992 Term.invent_names -> Name.invent_list
6994 Note that low-level renaming rarely occurs in new code -- operations
6995 from structure Variable are used instead (see below).
6997 * Pure: structure Variable provides fundamental operations for proper
6998 treatment of fixed/schematic variables in a context. For example,
6999 Variable.import introduces fixes for schematics of given facts and
7000 Variable.export reverses the effect (up to renaming) -- this replaces
7001 various freeze_thaw operations.
7003 * Pure: structure Goal provides simple interfaces for
7004 init/conclude/finish and tactical prove operations (replacing former
7005 Tactic.prove). Goal.prove is the canonical way to prove results
7006 within a given context; Goal.prove_global is a degraded version for
7007 theory level goals, including a global Drule.standard. Note that
7008 OldGoals.prove_goalw_cterm has long been obsolete, since it is
7009 ill-behaved in a local proof context (e.g. with local fixes/assumes or
7010 in a locale context).
7012 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
7013 and type checking (Syntax.check_term etc.), with common combinations
7014 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
7015 which are considered legacy and await removal.
7017 * Pure/Syntax: generic interfaces for type unchecking
7018 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
7019 with common combinations (Syntax.pretty_term, Syntax.string_of_term
7020 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
7021 available for convenience, but refer to the very same operations using
7022 a mere theory instead of a full context.
7024 * Isar: simplified treatment of user-level errors, using exception
7025 ERROR of string uniformly. Function error now merely raises ERROR,
7026 without any side effect on output channels. The Isar toplevel takes
7027 care of proper display of ERROR exceptions. ML code may use plain
7028 handle/can/try; cat_error may be used to concatenate errors like this:
7030 ... handle ERROR msg => cat_error msg "..."
7032 Toplevel ML code (run directly or through the Isar toplevel) may be
7033 embedded into the Isar toplevel with exception display/debug like
7036 Isar.toplevel (fn () => ...)
7038 INCOMPATIBILITY, removed special transform_error facilities, removed
7039 obsolete variants of user-level exceptions (ERROR_MESSAGE,
7040 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
7041 -- use plain ERROR instead.
7043 * Isar: theory setup now has type (theory -> theory), instead of a
7044 list. INCOMPATIBILITY, may use #> to compose setup functions.
7046 * Isar: ML toplevel pretty printer for type Proof.context, subject to
7047 ProofContext.debug/verbose flags.
7049 * Isar: Toplevel.theory_to_proof admits transactions that modify the
7050 theory before entering a proof state. Transactions now always see a
7051 quasi-functional intermediate checkpoint, both in interactive and
7054 * Isar: simplified interfaces for outer syntax. Renamed
7055 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
7056 OuterSyntax.add_parsers -- this functionality is now included in
7057 OuterSyntax.command etc. INCOMPATIBILITY.
7059 * Simplifier: the simpset of a running simplification process now
7060 contains a proof context (cf. Simplifier.the_context), which is the
7061 very context that the initial simpset has been retrieved from (by
7062 simpset_of/local_simpset_of). Consequently, all plug-in components
7063 (solver, looper etc.) may depend on arbitrary proof data.
7065 * Simplifier.inherit_context inherits the proof context (plus the
7066 local bounds) of the current simplification process; any simproc
7067 etc. that calls the Simplifier recursively should do this! Removed
7068 former Simplifier.inherit_bounds, which is already included here --
7069 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
7070 specify an explicit context using Simplifier.context/theory_context.
7072 * Simplifier/Classical Reasoner: more abstract interfaces
7073 change_simpset/claset for modifying the simpset/claset reference of a
7074 theory; raw versions simpset/claset_ref etc. have been discontinued --
7077 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
7083 * settings: the default heap location within ISABELLE_HOME_USER now
7084 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
7085 Isabelle installations.
7087 * isabelle-process: option -S (secure mode) disables some critical
7088 operations, notably runtime compilation and evaluation of ML source
7091 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
7093 * Support for parallel execution, using native multicore support of
7094 Poly/ML 5.1. The theory loader exploits parallelism when processing
7095 independent theories, according to the given theory header
7096 specifications. The maximum number of worker threads is specified via
7097 usedir option -M or the "max-threads" setting in Proof General. A
7098 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
7099 to 6 on a 8-core machine. User-code needs to observe certain
7100 guidelines for thread-safe programming, see appendix A in the Isar
7101 Implementation manual.
7105 New in Isabelle2005 (October 2005)
7106 ----------------------------------
7110 * Theory headers: the new header syntax for Isar theories is
7113 imports <theory1> ... <theoryN>
7114 uses <file1> ... <fileM>
7117 where the 'uses' part is optional. The previous syntax
7119 theory <name> = <theory1> + ... + <theoryN>:
7121 will disappear in the next release. Use isatool fixheaders to convert
7122 existing theory files. Note that there is no change in ancient
7123 non-Isar theories now, but these will disappear soon.
7125 * Theory loader: parent theories can now also be referred to via
7126 relative and absolute paths.
7128 * Command 'find_theorems' searches for a list of criteria instead of a
7129 list of constants. Known criteria are: intro, elim, dest, name:string,
7130 simp:term, and any term. Criteria can be preceded by '-' to select
7131 theorems that do not match. Intro, elim, dest select theorems that
7132 match the current goal, name:s selects theorems whose fully qualified
7133 name contain s, and simp:term selects all simplification rules whose
7134 lhs match term. Any other term is interpreted as pattern and selects
7135 all theorems matching the pattern. Available in ProofGeneral under
7136 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
7138 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
7140 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
7141 matching the current goal as introduction rule and not having "HOL."
7142 in their name (i.e. not being defined in theory HOL).
7144 * Command 'thms_containing' has been discontinued in favour of
7145 'find_theorems'; INCOMPATIBILITY.
7147 * Communication with Proof General is now 8bit clean, which means that
7148 Unicode text in UTF-8 encoding may be used within theory texts (both
7149 formal and informal parts). Cf. option -U of the Isabelle Proof
7150 General interface. Here are some simple examples (cf. src/HOL/ex):
7152 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
7153 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
7155 * Improved efficiency of the Simplifier and, to a lesser degree, the
7156 Classical Reasoner. Typical big applications run around 2 times
7160 *** Document preparation ***
7162 * Commands 'display_drafts' and 'print_drafts' perform simple output
7163 of raw sources. Only those symbols that do not require additional
7164 LaTeX packages (depending on comments in isabellesym.sty) are
7165 displayed properly, everything else is left verbatim. isatool display
7166 and isatool print are used as front ends (these are subject to the
7167 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
7169 * Command tags control specific markup of certain regions of text,
7170 notably folding and hiding. Predefined tags include "theory" (for
7171 theory begin and end), "proof" for proof commands, and "ML" for
7172 commands involving ML code; the additional tags "visible" and
7173 "invisible" are unused by default. Users may give explicit tag
7174 specifications in the text, e.g. ''by %invisible (auto)''. The
7175 interpretation of tags is determined by the LaTeX job during document
7176 preparation: see option -V of isatool usedir, or options -n and -t of
7177 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
7180 Several document versions may be produced at the same time via isatool
7181 usedir (the generated index.html will link all of them). Typical
7182 specifications include ''-V document=theory,proof,ML'' to present
7183 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
7184 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
7185 these parts without any formal replacement text. The Isabelle site
7186 default settings produce ''document'' and ''outline'' versions as
7189 * Several new antiquotations:
7191 @{term_type term} prints a term with its type annotated;
7193 @{typeof term} prints the type of a term;
7195 @{const const} is the same as @{term const}, but checks that the
7196 argument is a known logical constant;
7198 @{term_style style term} and @{thm_style style thm} print a term or
7199 theorem applying a "style" to it
7203 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
7204 definitions, equations, inequations etc., 'concl' printing only the
7205 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
7206 to print the specified premise. TermStyle.add_style provides an ML
7207 interface for introducing further styles. See also the "LaTeX Sugar"
7208 document practical applications. The ML antiquotation prints
7209 type-checked ML expressions verbatim.
7211 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
7212 and 'text' support optional locale specification '(in loc)', which
7213 specifies the default context for interpreting antiquotations. For
7214 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
7216 * Option 'locale=NAME' of antiquotations specifies an alternative
7217 context interpreting the subsequent argument. For example: @{thm
7218 [locale=lattice] inf_assoc}.
7220 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
7223 * Proper output of antiquotations for theory commands involving a
7224 proof context (such as 'locale' or 'theorem (in loc) ...').
7226 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
7227 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
7229 * isatool usedir: new option -C (default true) controls whether option
7230 -D should include a copy of the original document directory; -C false
7231 prevents unwanted effects such as copying of administrative CVS data.
7236 * Considerably improved version of 'constdefs' command. Now performs
7237 automatic type-inference of declared constants; additional support for
7238 local structure declarations (cf. locales and HOL records), see also
7239 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
7240 sequential dependencies of definitions within a single 'constdefs'
7241 section; moreover, the declared name needs to be an identifier. If
7242 all fails, consider to fall back on 'consts' and 'defs' separately.
7244 * Improved indexed syntax and implicit structures. First of all,
7245 indexed syntax provides a notational device for subscripted
7246 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
7247 expressions. Secondly, in a local context with structure
7248 declarations, number indexes \<^sub>n or the empty index (default
7249 number 1) refer to a certain fixed variable implicitly; option
7250 show_structs controls printing of implicit structures. Typical
7251 applications of these concepts involve record types and locales.
7253 * New command 'no_syntax' removes grammar declarations (and
7254 translations) resulting from the given syntax specification, which is
7255 interpreted in the same manner as for the 'syntax' command.
7257 * 'Advanced' translation functions (parse_translation etc.) may depend
7258 on the signature of the theory context being presently used for
7259 parsing/printing, see also isar-ref manual.
7261 * Improved 'oracle' command provides a type-safe interface to turn an
7262 ML expression of type theory -> T -> term into a primitive rule of
7263 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
7264 is already included here); see also FOL/ex/IffExample.thy;
7267 * axclass: name space prefix for class "c" is now "c_class" (was "c"
7268 before); "cI" is no longer bound, use "c.intro" instead.
7269 INCOMPATIBILITY. This change avoids clashes of fact bindings for
7270 axclasses vs. locales.
7272 * Improved internal renaming of symbolic identifiers -- attach primes
7273 instead of base 26 numbers.
7275 * New flag show_question_marks controls printing of leading question
7276 marks in schematic variable names.
7278 * In schematic variable names, *any* symbol following \<^isub> or
7279 \<^isup> is now treated as part of the base name. For example, the
7280 following works without printing of awkward ".0" indexes:
7282 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
7285 * Inner syntax includes (*(*nested*) comments*).
7287 * Pretty printer now supports unbreakable blocks, specified in mixfix
7288 annotations as "(00...)".
7290 * Clear separation of logical types and nonterminals, where the latter
7291 may only occur in 'syntax' specifications or type abbreviations.
7292 Before that distinction was only partially implemented via type class
7293 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
7294 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
7295 exotic syntax specifications may require further adaption
7296 (e.g. Cube/Cube.thy).
7298 * Removed obsolete type class "logic", use the top sort {} instead.
7299 Note that non-logical types should be declared as 'nonterminals'
7300 rather than 'types'. INCOMPATIBILITY for new object-logic
7303 * Attributes 'induct' and 'cases': type or set names may now be
7304 locally fixed variables as well.
7306 * Simplifier: can now control the depth to which conditional rewriting
7307 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
7310 * Simplifier: simplification procedures may now take the current
7311 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
7312 interface), which is very useful for calling the Simplifier
7313 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
7314 is gone -- use prems_of_ss on the simpset instead. Moreover, the
7315 low-level mk_simproc no longer applies Logic.varify internally, to
7316 allow for use in a context of fixed variables.
7318 * thin_tac now works even if the assumption being deleted contains !!
7319 or ==>. More generally, erule now works even if the major premise of
7320 the elimination rule contains !! or ==>.
7322 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
7324 * Reorganized bootstrapping of the Pure theories; CPure is now derived
7325 from Pure, which contains all common declarations already. Both
7326 theories are defined via plain Isabelle/Isar .thy files.
7327 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
7328 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
7329 use isatool fixcpure to adapt your theory and ML sources.
7331 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
7332 selections of theorems in named facts via index ranges.
7334 * 'print_theorems': in theory mode, really print the difference
7335 wrt. the last state (works for interactive theory development only),
7336 in proof mode print all local facts (cf. 'print_facts');
7338 * 'hide': option '(open)' hides only base names.
7340 * More efficient treatment of intermediate checkpoints in interactive
7343 * Code generator is now invoked via code_module (incremental code
7344 generation) and code_library (modular code generation, ML structures
7345 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
7346 must be quoted when used as identifiers.
7348 * New 'value' command for reading, evaluating and printing terms using
7349 the code generator. INCOMPATIBILITY: command keyword 'value' must be
7350 quoted when used as identifier.
7355 * New commands for the interpretation of locale expressions in
7356 theories (1), locales (2) and proof contexts (3). These generate
7357 proof obligations from the expression specification. After the
7358 obligations have been discharged, theorems of the expression are added
7359 to the theory, target locale or proof context. The synopsis of the
7360 commands is a follows:
7362 (1) interpretation expr inst
7363 (2) interpretation target < expr
7364 (3) interpret expr inst
7366 Interpretation in theories and proof contexts require a parameter
7367 instantiation of terms from the current context. This is applied to
7368 specifications and theorems of the interpreted expression.
7369 Interpretation in locales only permits parameter renaming through the
7370 locale expression. Interpretation is smart in that interpretations
7371 that are active already do not occur in proof obligations, neither are
7372 instantiated theorems stored in duplicate. Use 'print_interps' to
7373 inspect active interpretations of a particular locale. For details,
7374 see the Isar Reference manual. Examples can be found in
7375 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
7377 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
7378 'interpret' instead.
7380 * New context element 'constrains' for adding type constraints to
7383 * Context expressions: renaming of parameters with syntax
7386 * Locale declaration: 'includes' disallowed.
7388 * Proper static binding of attribute syntax -- i.e. types / terms /
7389 facts mentioned as arguments are always those of the locale definition
7390 context, independently of the context of later invocations. Moreover,
7391 locale operations (renaming and type / term instantiation) are applied
7392 to attribute arguments as expected.
7394 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
7395 actual attributes; rare situations may require Attrib.attribute to
7396 embed those attributes into Attrib.src that lack concrete syntax.
7397 Attribute implementations need to cooperate properly with the static
7398 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
7399 Attrib.XXX_thm etc. already do the right thing without further
7400 intervention. Only unusual applications -- such as "where" or "of"
7401 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
7402 on the context and the facts involved -- may have to assign parsed
7403 values to argument tokens explicitly.
7405 * Changed parameter management in theorem generation for long goal
7406 statements with 'includes'. INCOMPATIBILITY: produces a different
7407 theorem statement in rare situations.
7409 * Locale inspection command 'print_locale' omits notes elements. Use
7410 'print_locale!' to have them included in the output.
7415 * Provers/hypsubst.ML: improved version of the subst method, for
7416 single-step rewriting: it now works in bound variable contexts. New is
7417 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
7418 rewrite a different subterm than the original subst method, which is
7419 still available as 'simplesubst'.
7421 * Provers/quasi.ML: new transitivity reasoners for transitivity only
7424 * Provers/trancl.ML: new transitivity reasoner for transitive and
7425 reflexive-transitive closure of relations.
7427 * Provers/blast.ML: new reference depth_limit to make blast's depth
7428 limit (previously hard-coded with a value of 20) user-definable.
7430 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
7431 is peformed already. Object-logics merely need to finish their
7432 initial simpset configuration as before. INCOMPATIBILITY.
7437 * Symbolic syntax of Hilbert Choice Operator is now as follows:
7440 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
7442 The symbol \<some> is displayed as the alternative epsilon of LaTeX
7443 and x-symbol; use option '-m epsilon' to get it actually printed.
7444 Moreover, the mathematically important symbolic identifier \<epsilon>
7445 becomes available as variable, constant etc. INCOMPATIBILITY,
7447 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
7448 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
7449 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
7450 support corresponding Isar calculations.
7452 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
7455 * theory SetInterval: changed the syntax for open intervals:
7464 The old syntax is still supported but will disappear in the next
7465 release. For conversion use the following Emacs search and replace
7466 patterns (these are not perfect but work quite well):
7468 {)\([^\.]*\)\.\. -> {\1<\.\.}
7469 \.\.\([^(}]*\)(} -> \.\.<\1}
7471 * Theory Commutative_Ring (in Library): method comm_ring for proving
7472 equalities in commutative rings; method 'algebra' provides a generic
7475 * Theory Finite_Set: changed the syntax for 'setsum', summation over
7476 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
7477 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
7480 Some new syntax forms are available:
7482 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
7483 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
7484 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
7485 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
7487 The latter form "\<Sum>x < k. e" used to be based on a separate
7488 function "Summation", which has been discontinued.
7490 * theory Finite_Set: in structured induction proofs, the insert case
7491 is now 'case (insert x F)' instead of the old counterintuitive 'case
7494 * The 'refute' command has been extended to support a much larger
7495 fragment of HOL, including axiomatic type classes, constdefs and
7496 typedefs, inductive datatypes and recursion.
7498 * New tactics 'sat' and 'satx' to prove propositional tautologies.
7499 Requires zChaff with proof generation to be installed. See
7500 HOL/ex/SAT_Examples.thy for examples.
7502 * Datatype induction via method 'induct' now preserves the name of the
7503 induction variable. For example, when proving P(xs::'a list) by
7504 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
7505 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
7506 in unstructured proof scripts.
7508 * Reworked implementation of records. Improved scalability for
7509 records with many fields, avoiding performance problems for type
7510 inference. Records are no longer composed of nested field types, but
7511 of nested extension types. Therefore the record type only grows linear
7512 in the number of extensions and not in the number of fields. The
7513 top-level (users) view on records is preserved. Potential
7514 INCOMPATIBILITY only in strange cases, where the theory depends on the
7515 old record representation. The type generated for a record is called
7516 <record_name>_ext_type.
7518 Flag record_quick_and_dirty_sensitive can be enabled to skip the
7519 proofs triggered by a record definition or a simproc (if
7520 quick_and_dirty is enabled). Definitions of large records can take
7523 New simproc record_upd_simproc for simplification of multiple record
7524 updates enabled by default. Moreover, trivial updates are also
7525 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
7526 occasionally, since simplification is more powerful by default.
7528 * typedef: proper support for polymorphic sets, which contain extra
7529 type-variables in the term.
7531 * Simplifier: automatically reasons about transitivity chains
7532 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
7533 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
7534 old proofs break occasionally as simplification may now solve more
7535 goals than previously.
7537 * Simplifier: converts x <= y into x = y if assumption y <= x is
7538 present. Works for all partial orders (class "order"), in particular
7539 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
7542 * Simplifier: new simproc for "let x = a in f x". If a is a free or
7543 bound variable or a constant then the let is unfolded. Otherwise
7544 first a is simplified to b, and then f b is simplified to g. If
7545 possible we abstract b from g arriving at "let x = b in h x",
7546 otherwise we unfold the let and arrive at g. The simproc can be
7547 enabled/disabled by the reference use_let_simproc. Potential
7548 INCOMPATIBILITY since simplification is more powerful by default.
7550 * Classical reasoning: the meson method now accepts theorems as arguments.
7552 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
7553 jobs to provide advice on the provability of subgoals.
7555 * Theory OrderedGroup and Ring_and_Field: various additions and
7556 improvements to faciliate calculations involving equalities and
7559 The following theorems have been eliminated or modified
7562 abs_eq now named abs_of_nonneg
7563 abs_of_ge_0 now named abs_of_nonneg
7564 abs_minus_eq now named abs_of_nonpos
7565 imp_abs_id now named abs_of_nonneg
7566 imp_abs_neg_id now named abs_of_nonpos
7567 mult_pos now named mult_pos_pos
7568 mult_pos_le now named mult_nonneg_nonneg
7569 mult_pos_neg_le now named mult_nonneg_nonpos
7570 mult_pos_neg2_le now named mult_nonneg_nonpos2
7571 mult_neg now named mult_neg_neg
7572 mult_neg_le now named mult_nonpos_nonpos
7574 * The following lemmas in Ring_and_Field have been added to the simplifier:
7577 not_square_less_zero
7579 The following lemmas have been deleted from Real/RealPow:
7589 * Theory Parity: added rules for simplifying exponents.
7593 The following theorems have been eliminated or modified
7596 list_all_Nil now named list_all.simps(1)
7597 list_all_Cons now named list_all.simps(2)
7598 list_all_conv now named list_all_iff
7599 set_mem_eq now named mem_iff
7601 * Theories SetsAndFunctions and BigO (see HOL/Library) support
7602 asymptotic "big O" calculations. See the notes in BigO.thy.
7607 * Theory RealDef: better support for embedding natural numbers and
7608 integers in the reals.
7610 The following theorems have been eliminated or modified
7613 exp_ge_add_one_self now requires no hypotheses
7614 real_of_int_add reversed direction of equality (use [symmetric])
7615 real_of_int_minus reversed direction of equality (use [symmetric])
7616 real_of_int_diff reversed direction of equality (use [symmetric])
7617 real_of_int_mult reversed direction of equality (use [symmetric])
7619 * Theory RComplete: expanded support for floor and ceiling functions.
7621 * Theory Ln is new, with properties of the natural logarithm
7623 * Hyperreal: There is a new type constructor "star" for making
7624 nonstandard types. The old type names are now type synonyms:
7628 hcomplex = complex star
7630 * Hyperreal: Many groups of similarly-defined constants have been
7631 replaced by polymorphic versions (INCOMPATIBILITY):
7633 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
7635 starset <-- starsetNat, starsetC
7636 *s* <-- *sNat*, *sc*
7637 starset_n <-- starsetNat_n, starsetC_n
7638 *sn* <-- *sNatn*, *scn*
7639 InternalSets <-- InternalNatSets, InternalCSets
7641 starfun <-- starfun{Nat,Nat2,C,RC,CR}
7642 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
7643 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
7644 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
7645 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
7647 * Hyperreal: Many type-specific theorems have been removed in favor of
7648 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
7650 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
7651 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
7652 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
7653 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
7654 right_minus <-- hypreal_add_minus
7655 left_minus <-- {hypreal,hcomplex}_add_minus_left
7656 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
7657 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
7658 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
7659 mult_1_right <-- hcomplex_mult_one_right
7660 mult_zero_left <-- hcomplex_mult_zero_left
7661 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
7662 right_distrib <-- hypnat_add_mult_distrib2
7663 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
7664 right_inverse <-- hypreal_mult_inverse
7665 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
7666 order_refl <-- {hypreal,hypnat}_le_refl
7667 order_trans <-- {hypreal,hypnat}_le_trans
7668 order_antisym <-- {hypreal,hypnat}_le_anti_sym
7669 order_less_le <-- {hypreal,hypnat}_less_le
7670 linorder_linear <-- {hypreal,hypnat}_le_linear
7671 add_left_mono <-- {hypreal,hypnat}_add_left_mono
7672 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
7673 add_nonneg_nonneg <-- hypreal_le_add_order
7675 * Hyperreal: Separate theorems having to do with type-specific
7676 versions of constants have been merged into theorems that apply to the
7677 new polymorphic constants (INCOMPATIBILITY):
7679 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
7680 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
7681 STAR_Un <-- {STAR,NatStar,STARC}_Un
7682 STAR_Int <-- {STAR,NatStar,STARC}_Int
7683 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
7684 STAR_subset <-- {STAR,NatStar,STARC}_subset
7685 STAR_mem <-- {STAR,NatStar,STARC}_mem
7686 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
7687 STAR_diff <-- {STAR,STARC}_diff
7688 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
7689 STARC_hcomplex_of_complex}_image_subset
7690 starset_n_Un <-- starset{Nat,C}_n_Un
7691 starset_n_Int <-- starset{Nat,C}_n_Int
7692 starset_n_Compl <-- starset{Nat,C}_n_Compl
7693 starset_n_diff <-- starset{Nat,C}_n_diff
7694 InternalSets_Un <-- Internal{Nat,C}Sets_Un
7695 InternalSets_Int <-- Internal{Nat,C}Sets_Int
7696 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
7697 InternalSets_diff <-- Internal{Nat,C}Sets_diff
7698 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
7699 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
7700 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
7701 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
7702 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
7703 starfun <-- starfun{Nat,Nat2,C,RC,CR}
7704 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
7705 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
7706 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
7707 starfun_diff <-- starfun{C,RC,CR}_diff
7708 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
7709 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
7710 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
7711 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
7712 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
7713 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
7714 starfun_Id <-- starfunC_Id
7715 starfun_approx <-- starfun{Nat,CR}_approx
7716 starfun_capprox <-- starfun{C,RC}_capprox
7717 starfun_abs <-- starfunNat_rabs
7718 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
7719 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
7720 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
7721 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
7722 starfun_add_capprox <-- starfun{C,RC}_add_capprox
7723 starfun_add_approx <-- starfunCR_add_approx
7724 starfun_inverse_inverse <-- starfunC_inverse_inverse
7725 starfun_divide <-- starfun{C,CR,RC}_divide
7726 starfun_n <-- starfun{Nat,C}_n
7727 starfun_n_mult <-- starfun{Nat,C}_n_mult
7728 starfun_n_add <-- starfun{Nat,C}_n_add
7729 starfun_n_add_minus <-- starfunNat_n_add_minus
7730 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
7731 starfun_n_minus <-- starfun{Nat,C}_n_minus
7732 starfun_n_eq <-- starfun{Nat,C}_n_eq
7734 star_n_add <-- {hypreal,hypnat,hcomplex}_add
7735 star_n_minus <-- {hypreal,hcomplex}_minus
7736 star_n_diff <-- {hypreal,hcomplex}_diff
7737 star_n_mult <-- {hypreal,hcomplex}_mult
7738 star_n_inverse <-- {hypreal,hcomplex}_inverse
7739 star_n_le <-- {hypreal,hypnat}_le
7740 star_n_less <-- {hypreal,hypnat}_less
7741 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
7742 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
7743 star_n_abs <-- hypreal_hrabs
7744 star_n_divide <-- hcomplex_divide
7746 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
7747 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
7748 star_of_diff <-- hypreal_of_real_diff
7749 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
7750 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
7751 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
7752 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
7753 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
7754 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
7755 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
7756 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
7757 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
7758 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
7759 star_of_number_of <-- {hypreal,hcomplex}_number_of
7760 star_of_number_less <-- number_of_less_hypreal_of_real_iff
7761 star_of_number_le <-- number_of_le_hypreal_of_real_iff
7762 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
7763 star_of_less_number <-- hypreal_of_real_less_number_of_iff
7764 star_of_le_number <-- hypreal_of_real_le_number_of_iff
7765 star_of_power <-- hypreal_of_real_power
7766 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
7768 * Hyperreal: new method "transfer" that implements the transfer
7769 principle of nonstandard analysis. With a subgoal that mentions
7770 nonstandard types like "'a star", the command "apply transfer"
7771 replaces it with an equivalent one that mentions only standard types.
7772 To be successful, all free variables must have standard types; non-
7773 standard variables must have explicit universal quantifiers.
7775 * Hyperreal: A theory of Taylor series.
7780 * Discontinued special version of 'constdefs' (which used to support
7781 continuous functions) in favor of the general Pure one with full
7784 * New simplification procedure for solving continuity conditions; it
7785 is much faster on terms with many nested lambda abstractions (cubic
7786 instead of exponential time).
7788 * New syntax for domain package: selector names are now optional.
7789 Parentheses should be omitted unless argument is lazy, for example:
7791 domain 'a stream = cons "'a" (lazy "'a stream")
7793 * New command 'fixrec' for defining recursive functions with pattern
7794 matching; defining multiple functions with mutual recursion is also
7795 supported. Patterns may include the constants cpair, spair, up, sinl,
7796 sinr, or any data constructor defined by the domain package. The given
7797 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
7798 syntax and examples.
7800 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
7801 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
7802 but the proof obligation additionally includes an admissibility
7803 requirement. The packages generate instances of class cpo or pcpo,
7804 with continuity and strictness theorems for Rep and Abs.
7806 * HOLCF: Many theorems have been renamed according to a more standard naming
7807 scheme (INCOMPATIBILITY):
7809 foo_inject: "foo$x = foo$y ==> x = y"
7810 foo_eq: "(foo$x = foo$y) = (x = y)"
7811 foo_less: "(foo$x << foo$y) = (x << y)"
7812 foo_strict: "foo$UU = UU"
7813 foo_defined: "... ==> foo$x ~= UU"
7814 foo_defined_iff: "(foo$x = UU) = (x = UU)"
7819 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
7820 including the First Isomorphism Theorem (on quotienting by the kernel
7823 * ZF/Simplifier: install second copy of type solver that actually
7824 makes use of TC rules declared to Isar proof contexts (or locales);
7825 the old version is still required for ML proof scripts.
7830 * Converted to Isar theory format; use locales instead of axiomatic
7836 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
7839 * Pure/library.ML no longer defines its own option datatype, but uses
7840 that of the SML basis, which has constructors NONE and SOME instead of
7841 None and Some, as well as exception Option.Option instead of OPTION.
7842 The functions the, if_none, is_some, is_none have been adapted
7843 accordingly, while Option.map replaces apsome.
7845 * Pure/library.ML: the exception LIST has been given up in favour of
7846 the standard exceptions Empty and Subscript, as well as
7847 Library.UnequalLengths. Function like Library.hd and Library.tl are
7848 superceded by the standard hd and tl functions etc.
7850 A number of basic list functions are no longer exported to the ML
7851 toplevel, as they are variants of predefined functions. The following
7852 suggests how one can translate existing code:
7854 rev_append xs ys = List.revAppend (xs, ys)
7855 nth_elem (i, xs) = List.nth (xs, i)
7856 last_elem xs = List.last xs
7857 flat xss = List.concat xss
7858 seq fs = List.app fs
7859 partition P xs = List.partition P xs
7860 mapfilter f xs = List.mapPartial f xs
7862 * Pure/library.ML: several combinators for linear functional
7863 transformations, notably reverse application and composition:
7866 (x, y) |-> f f #-> g
7868 * Pure/library.ML: introduced/changed precedence of infix operators:
7870 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
7872 infix 3 o oo ooo oooo;
7873 infix 4 ~~ upto downto;
7875 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
7878 * Pure/library.ML: natural list combinators fold, fold_rev, and
7879 fold_map support linear functional transformations and nesting. For
7882 fold f [x1, ..., xN] y =
7883 y |> f x1 |> ... |> f xN
7885 (fold o fold) f [xs1, ..., xsN] y =
7886 y |> fold f xs1 |> ... |> fold f xsN
7888 fold f [x1, ..., xN] =
7891 (fold o fold) f [xs1, ..., xsN] =
7892 fold f xs1 #> ... #> fold f xsN
7894 * Pure/library.ML: the following selectors on type 'a option are
7897 the: 'a option -> 'a (*partial*)
7898 these: 'a option -> 'a where 'a = 'b list
7899 the_default: 'a -> 'a option -> 'a
7900 the_list: 'a option -> 'a list
7902 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
7903 basic operations for association lists, following natural argument
7904 order; moreover the explicit equality predicate passed here avoids
7905 potentially expensive polymorphic runtime equality checks.
7906 The old functions may be expressed as follows:
7908 assoc = uncurry (AList.lookup (op =))
7909 assocs = these oo AList.lookup (op =)
7910 overwrite = uncurry (AList.update (op =)) o swap
7912 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
7914 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
7915 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
7917 replacing make_keylist and keyfilter (occassionally used)
7920 make_keylist = AList.make
7921 keyfilter = AList.find (op =)
7923 * eq_fst and eq_snd now take explicit equality parameter, thus
7924 avoiding eqtypes. Naive rewrites:
7926 eq_fst = eq_fst (op =)
7927 eq_snd = eq_snd (op =)
7929 * Removed deprecated apl and apr (rarely used).
7932 apl (n, op) =>>= curry op n
7933 apr (op, m) =>>= fn n => op (n, m)
7935 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
7936 provides a reasonably efficient light-weight implementation of sets as
7939 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
7940 few new operations; existing lookup and update are now curried to
7941 follow natural argument order (for use with fold etc.);
7942 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
7944 * Pure/General: output via the Isabelle channels of
7945 writeln/warning/error etc. is now passed through Output.output, with a
7946 hook for arbitrary transformations depending on the print_mode
7947 (cf. Output.add_mode -- the first active mode that provides a output
7948 function wins). Already formatted output may be embedded into further
7949 text via Output.raw; the result of Pretty.string_of/str_of and derived
7950 functions (string_of_term/cterm/thm etc.) is already marked raw to
7951 accommodate easy composition of diagnostic messages etc. Programmers
7952 rarely need to care about Output.output or Output.raw at all, with
7953 some notable exceptions: Output.output is required when bypassing the
7954 standard channels (writeln etc.), or in token translations to produce
7955 properly formatted results; Output.raw is required when capturing
7956 already output material that will eventually be presented to the user
7957 a second time. For the default print mode, both Output.output and
7958 Output.raw have no effect.
7960 * Pure/General: Output.time_accumulator NAME creates an operator ('a
7961 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
7962 cumulative results are displayed at the end of a batch session.
7964 * Pure/General: File.sysify_path and File.quote_sysify path have been
7965 replaced by File.platform_path and File.shell_path (with appropriate
7966 hooks). This provides a clean interface for unusual systems where the
7967 internal and external process view of file names are different.
7969 * Pure: more efficient orders for basic syntactic entities: added
7970 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
7971 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
7972 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
7973 orders now -- potential INCOMPATIBILITY for code that depends on a
7974 particular order for Symtab.keys, Symtab.dest, etc. (consider using
7975 Library.sort_strings on result).
7977 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
7978 fold_types traverse types/terms from left to right, observing natural
7979 argument order. Supercedes previous foldl_XXX versions, add_frees,
7980 add_vars etc. have been adapted as well: INCOMPATIBILITY.
7982 * Pure: name spaces have been refined, with significant changes of the
7983 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
7984 to extern(_table). The plain name entry path is superceded by a
7985 general 'naming' context, which also includes the 'policy' to produce
7986 a fully qualified name and external accesses of a fully qualified
7987 name; NameSpace.extend is superceded by context dependent
7988 Sign.declare_name. Several theory and proof context operations modify
7989 the naming context. Especially note Theory.restore_naming and
7990 ProofContext.restore_naming to get back to a sane state; note that
7991 Theory.add_path is no longer sufficient to recover from
7992 Theory.absolute_path in particular.
7994 * Pure: new flags short_names (default false) and unique_names
7995 (default true) for controlling output of qualified names. If
7996 short_names is set, names are printed unqualified. If unique_names is
7997 reset, the name prefix is reduced to the minimum required to achieve
7998 the original result when interning again, even if there is an overlap
7999 with earlier declarations.
8001 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
8002 now 'extend', and 'merge' gets an additional Pretty.pp argument
8003 (useful for printing error messages). INCOMPATIBILITY.
8005 * Pure: major reorganization of the theory context. Type Sign.sg and
8006 Theory.theory are now identified, referring to the universal
8007 Context.theory (see Pure/context.ML). Actual signature and theory
8008 content is managed as theory data. The old code and interfaces were
8009 spread over many files and structures; the new arrangement introduces
8010 considerable INCOMPATIBILITY to gain more clarity:
8012 Context -- theory management operations (name, identity, inclusion,
8013 parents, ancestors, merge, etc.), plus generic theory data;
8015 Sign -- logical signature and syntax operations (declaring consts,
8016 types, etc.), plus certify/read for common entities;
8018 Theory -- logical theory operations (stating axioms, definitions,
8019 oracles), plus a copy of logical signature operations (consts,
8020 types, etc.); also a few basic management operations (Theory.copy,
8023 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
8024 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
8025 for convenience -- they merely return the theory.
8027 * Pure: type Type.tsig is superceded by theory in most interfaces.
8029 * Pure: the Isar proof context type is already defined early in Pure
8030 as Context.proof (note that ProofContext.context and Proof.context are
8031 aliases, where the latter is the preferred name). This enables other
8032 Isabelle components to refer to that type even before Isar is present.
8034 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
8035 typeK, constK, axiomK, oracleK), but provide explicit operations for
8036 any of these kinds. For example, Sign.intern typeK is now
8037 Sign.intern_type, Theory.hide_space Sign.typeK is now
8038 Theory.hide_types. Also note that former
8039 Theory.hide_classes/types/consts are now
8040 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
8041 internalize their arguments! INCOMPATIBILITY.
8043 * Pure: get_thm interface (of PureThy and ProofContext) expects
8044 datatype thmref (with constructors Name and NameSelection) instead of
8045 plain string -- INCOMPATIBILITY;
8047 * Pure: cases produced by proof methods specify options, where NONE
8048 means to remove case bindings -- INCOMPATIBILITY in
8051 * Pure: the following operations retrieve axioms or theorems from a
8052 theory node or theory hierarchy, respectively:
8054 Theory.axioms_of: theory -> (string * term) list
8055 Theory.all_axioms_of: theory -> (string * term) list
8056 PureThy.thms_of: theory -> (string * thm) list
8057 PureThy.all_thms_of: theory -> (string * thm) list
8059 * Pure: print_tac now outputs the goal through the trace channel.
8061 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
8062 Reference Toplevel.debug (default false) controls detailed printing
8063 and tracing of low-level exceptions; Toplevel.profiling (default 0)
8064 controls execution profiling -- set to 1 for time and 2 for space
8065 (both increase the runtime).
8067 * Isar session: The initial use of ROOT.ML is now always timed,
8068 i.e. the log will show the actual process times, in contrast to the
8069 elapsed wall-clock time that the outer shell wrapper produces.
8071 * Simplifier: improved handling of bound variables (nameless
8072 representation, avoid allocating new strings). Simprocs that invoke
8073 the Simplifier recursively should use Simplifier.inherit_bounds to
8074 avoid local name clashes. Failure to do so produces warnings
8075 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
8076 for further details.
8078 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
8079 bindings for all theorems stored within a given theory; this may help
8080 in porting non-Isar theories to Isar ones, while keeping ML proof
8081 scripts for the time being.
8083 * ML operator HTML.with_charset specifies the charset begin used for
8084 generated HTML files. For example:
8086 HTML.with_charset "utf-8" use_thy "Hebrew";
8087 HTML.with_charset "utf-8" use_thy "Chinese";
8092 * Allow symlinks to all proper Isabelle executables (Isabelle,
8093 isabelle, isatool etc.).
8095 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
8096 isatool doc, isatool mkdir, display_drafts etc.).
8098 * isatool usedir: option -f allows specification of the ML file to be
8099 used by Isabelle; default is ROOT.ML.
8101 * New isatool version outputs the version identifier of the Isabelle
8102 distribution being used.
8104 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
8105 (containing Boolean satisfiability problems) into Isabelle/HOL
8110 New in Isabelle2004 (April 2004)
8111 --------------------------------
8115 * Provers/order.ML: new efficient reasoner for partial and linear orders.
8116 Replaces linorder.ML.
8118 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
8119 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
8120 (\<a>...\<z>), are now considered normal letters, and can therefore
8121 be used anywhere where an ASCII letter (a...zA...Z) has until
8122 now. COMPATIBILITY: This obviously changes the parsing of some
8123 terms, especially where a symbol has been used as a binder, say
8124 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
8125 as an identifier. Fix it by inserting a space around former
8126 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
8127 existing theory and ML files.
8129 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
8131 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
8132 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
8133 a normal (but invisible) letter. For multiple letter subscripts repeat
8134 \<^isub> like this: x\<^isub>1\<^isub>2.
8136 * Pure: There are now sub-/superscripts that can span more than one
8137 character. Text between \<^bsub> and \<^esub> is set in subscript in
8138 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
8139 superscript. The new control characters are not identifier parts.
8141 * Pure: Control-symbols of the form \<^raw:...> will literally print the
8142 content of "..." to the latex file instead of \isacntrl... . The "..."
8143 may consist of any printable characters excluding the end bracket >.
8145 * Pure: Using new Isar command "finalconsts" (or the ML functions
8146 Theory.add_finals or Theory.add_finals_i) it is now possible to
8147 declare constants "final", which prevents their being given a definition
8148 later. It is useful for constants whose behaviour is fixed axiomatically
8149 rather than definitionally, such as the meta-logic connectives.
8151 * Pure: 'instance' now handles general arities with general sorts
8152 (i.e. intersections of classes),
8154 * Presentation: generated HTML now uses a CSS style sheet to make layout
8155 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
8156 It can be changed to alter the colors/layout of generated pages.
8161 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
8162 cut_tac, subgoal_tac and thin_tac:
8163 - Now understand static (Isar) contexts. As a consequence, users of Isar
8164 locales are no longer forced to write Isar proof scripts.
8165 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
8167 - INCOMPATIBILITY: names of variables to be instantiated may no
8168 longer be enclosed in quotes. Instead, precede variable name with `?'.
8169 This is consistent with the instantiation attribute "where".
8171 * Attributes "where" and "of":
8172 - Now take type variables of instantiated theorem into account when reading
8173 the instantiation string. This fixes a bug that caused instantiated
8174 theorems to have too special types in some circumstances.
8175 - "where" permits explicit instantiations of type variables.
8177 * Calculation commands "moreover" and "also" no longer interfere with
8178 current facts ("this"), admitting arbitrary combinations with "then"
8182 - Goal statements involving the context element "includes" no longer
8183 generate theorems with internal delta predicates (those ending on
8184 "_axioms") in the premise.
8185 Resolve particular premise with <locale>.intro to obtain old form.
8186 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
8187 specification and "includes" elements in goal statement.
8188 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
8189 [intro?] and [elim?] (respectively) by default.
8190 - Experimental command for instantiation of locales in proof contexts:
8191 instantiate <label>[<attrs>]: <loc>
8192 Instantiates locale <loc> and adds all its theorems to the current context
8193 taking into account their attributes. Label and attrs are optional
8194 modifiers, like in theorem declarations. If present, names of
8195 instantiated theorems are qualified with <label>, and the attributes
8196 <attrs> are applied after any attributes these theorems might have already.
8197 If the locale has assumptions, a chained fact of the form
8198 "<loc> t1 ... tn" is expected from which instantiations of the parameters
8199 are derived. The command does not support old-style locales declared
8200 with "locale (open)".
8201 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
8203 * HOL: Tactic emulation methods induct_tac and case_tac understand static
8209 * Proof import: new image HOL4 contains the imported library from
8210 the HOL4 system with about 2500 theorems. It is imported by
8211 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
8212 can be used like any other Isabelle image. See
8213 HOL/Import/HOL/README for more information.
8216 - Much improved handling of linear and partial orders.
8217 Reasoners for linear and partial orders are set up for type classes
8218 "linorder" and "order" respectively, and are added to the default simpset
8219 as solvers. This means that the simplifier can build transitivity chains
8220 to solve goals from the assumptions.
8221 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
8222 of blast or auto after simplification become unnecessary because the goal
8223 is solved by simplification already.
8225 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
8226 all proved in axiomatic type classes for semirings, rings and fields.
8229 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
8230 now formalized using the Ring_and_Field theory mentioned above.
8231 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
8232 than before, because now they are set up once in a generic manner.
8233 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
8234 Look for the general versions in Ring_and_Field (and Power if they concern
8237 * Type "rat" of the rational numbers is now available in HOL-Complex.
8240 - Record types are now by default printed with their type abbreviation
8241 instead of the list of all field types. This can be configured via
8242 the reference "print_record_type_abbr".
8243 - Simproc "record_upd_simproc" for simplification of multiple updates added
8244 (not enabled by default).
8245 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
8246 EX x. x = sel r to True (not enabled by default).
8247 - Tactic "record_split_simp_tac" to split and simplify records added.
8249 * 'specification' command added, allowing for definition by
8250 specification. There is also an 'ax_specification' command that
8251 introduces the new constants axiomatically.
8253 * arith(_tac) is now able to generate counterexamples for reals as well.
8255 * HOL-Algebra: new locale "ring" for non-commutative rings.
8257 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
8258 definitions, thanks to Sava Krsti\'{c} and John Matthews.
8260 * HOL-Matrix: a first theory for matrices in HOL with an application of
8261 matrix theory to linear programming.
8263 * Unions and Intersections:
8264 The latex output syntax of UN and INT has been changed
8265 from "\Union x \in A. B" to "\Union_{x \in A} B"
8266 i.e. the index formulae has become a subscript.
8267 Similarly for "\Union x. B", and for \Inter instead of \Union.
8269 * Unions and Intersections over Intervals:
8270 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
8271 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
8272 like in normal math, and corresponding versions for < and for intersection.
8274 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
8275 lexicographic dictonary ordering has been added as "lexord".
8277 * ML: the legacy theory structures Int and List have been removed. They had
8278 conflicted with ML Basis Library structures having the same names.
8280 * 'refute' command added to search for (finite) countermodels. Only works
8281 for a fragment of HOL. The installation of an external SAT solver is
8282 highly recommended. See "HOL/Refute.thy" for details.
8284 * 'quickcheck' command: Allows to find counterexamples by evaluating
8285 formulae under an assignment of free variables to random values.
8286 In contrast to 'refute', it can deal with inductive datatypes,
8287 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
8293 * Streams now come with concatenation and are part of the HOLCF image
8297 New in Isabelle2003 (May 2003)
8298 ------------------------------
8302 * Provers/simplifier:
8304 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
8305 Assumptions are now subject to complete mutual simplification,
8306 not just from left to right. The simplifier now preserves
8307 the order of assumptions.
8309 Potential INCOMPATIBILITY:
8311 -- simp sometimes diverges where the old version did
8312 not, e.g. invoking simp on the goal
8314 [| P (f x); y = x; f x = f y |] ==> Q
8316 now gives rise to the infinite reduction sequence
8318 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
8320 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
8323 -- Tactics combining classical reasoner and simplification (such as auto)
8324 are also affected by this change, because many of them rely on
8325 simp. They may sometimes diverge as well or yield a different numbers
8326 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
8327 in case of problems. Sometimes subsequent calls to the classical
8328 reasoner will fail because a preceeding call to the simplifier too
8329 eagerly simplified the goal, e.g. deleted redundant premises.
8331 - The simplifier trace now shows the names of the applied rewrite rules
8333 - You can limit the number of recursive invocations of the simplifier
8334 during conditional rewriting (where the simplifie tries to solve the
8335 conditions before applying the rewrite rule):
8336 ML "simp_depth_limit := n"
8337 where n is an integer. Thus you can force termination where previously
8338 the simplifier would diverge.
8340 - Accepts free variables as head terms in congruence rules. Useful in Isar.
8342 - No longer aborts on failed congruence proof. Instead, the
8343 congruence is ignored.
8345 * Pure: New generic framework for extracting programs from constructive
8346 proofs. See HOL/Extraction.thy for an example instantiation, as well
8347 as HOL/Extraction for some case studies.
8349 * Pure: The main goal of the proof state is no longer shown by default, only
8350 the subgoals. This behaviour is controlled by a new flag.
8351 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
8352 (ML: Proof.show_main_goal).
8354 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
8355 rules whose conclusion matches subgoal 1:
8356 PG menu: Isabelle/Isar -> Show me -> matching rules
8357 The rules are ordered by how closely they match the subgoal.
8358 In particular, rules that solve a subgoal outright are displayed first
8359 (or rather last, the way they are printed).
8360 (ML: ProofGeneral.print_intros())
8362 * Pure: New flag trace_unify_fail causes unification to print
8363 diagnostic information (PG: in trace buffer) when it fails. This is
8364 useful for figuring out why single step proofs like rule, erule or
8367 * Pure: Locale specifications now produce predicate definitions
8368 according to the body of text (covering assumptions modulo local
8369 definitions); predicate "loc_axioms" covers newly introduced text,
8370 while "loc" is cumulative wrt. all included locale expressions; the
8371 latter view is presented only on export into the global theory
8372 context; potential INCOMPATIBILITY, use "(open)" option to fall back
8373 on the old view without predicates;
8375 * Pure: predefined locales "var" and "struct" are useful for sharing
8376 parameters (as in CASL, for example); just specify something like
8377 ``var x + var y + struct M'' as import;
8379 * Pure: improved thms_containing: proper indexing of facts instead of
8380 raw theorems; check validity of results wrt. current name space;
8381 include local facts of proof configuration (also covers active
8382 locales), cover fixed variables in index; may use "_" in term
8383 specification; an optional limit for the number of printed facts may
8384 be given (the default is 40);
8386 * Pure: disallow duplicate fact bindings within new-style theory files
8389 * Provers: improved induct method: assumptions introduced by case
8390 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
8391 the goal statement); "foo" still refers to all facts collectively;
8393 * Provers: the function blast.overloaded has been removed: all constants
8394 are regarded as potentially overloaded, which improves robustness in exchange
8395 for slight decrease in efficiency;
8397 * Provers/linorder: New generic prover for transitivity reasoning over
8398 linear orders. Note: this prover is not efficient!
8400 * Isar: preview of problems to finish 'show' now produce an error
8401 rather than just a warning (in interactive mode);
8408 - Produces a counter example if it cannot prove a goal.
8409 Note that the counter example may be spurious if the goal is not a formula
8410 of quantifier-free linear arithmetic.
8411 In ProofGeneral the counter example appears in the trace buffer.
8413 - Knows about div k and mod k where k is a numeral of type nat or int.
8415 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
8416 linear arithmetic fails. This takes account of quantifiers and divisibility.
8417 Presburger arithmetic can also be called explicitly via presburger(_tac).
8419 * simp's arithmetic capabilities have been enhanced a bit: it now
8420 takes ~= in premises into account (by performing a case split);
8422 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
8423 are distributed over a sum of terms;
8425 * New tactic "trans_tac" and method "trans" instantiate
8426 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
8429 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
8430 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
8432 * 'typedef' command has new option "open" to suppress the set
8435 * functions Min and Max on finite sets have been introduced (theory
8438 * attribute [symmetric] now works for relations as well; it turns
8439 (x,y) : R^-1 into (y,x) : R, and vice versa;
8441 * induct over a !!-quantified statement (say !!x1..xn):
8442 each "case" automatically performs "fix x1 .. xn" with exactly those names.
8444 * Map: `empty' is no longer a constant but a syntactic abbreviation for
8445 %x. None. Warning: empty_def now refers to the previously hidden definition
8448 * Algebra: formalization of classical algebra. Intended as base for
8449 any algebraic development in Isabelle. Currently covers group theory
8450 (up to Sylow's theorem) and ring theory (Universal Property of
8451 Univariate Polynomials). Contributions welcome;
8453 * GroupTheory: deleted, since its material has been moved to Algebra;
8455 * Complex: new directory of the complex numbers with numeric constants,
8456 nonstandard complex numbers, and some complex analysis, standard and
8457 nonstandard (Jacques Fleuriot);
8459 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
8461 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
8464 * Real/HahnBanach: updated and adapted to locales;
8466 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
8469 * UNITY: added the Meier-Sanders theory of progress sets;
8471 * MicroJava: bytecode verifier and lightweight bytecode verifier
8472 as abstract algorithms, instantiated to the JVM;
8474 * Bali: Java source language formalization. Type system, operational
8475 semantics, axiomatic semantics. Supported language features:
8476 classes, interfaces, objects,virtual methods, static methods,
8477 static/instance fields, arrays, access modifiers, definite
8478 assignment, exceptions.
8483 * ZF/Constructible: consistency proof for AC (Gdel's constructible
8486 * Main ZF: virtually all theories converted to new-style format;
8491 * Pure: Tactic.prove provides sane interface for internal proofs;
8492 omits the infamous "standard" operation, so this is more appropriate
8493 than prove_goalw_cterm in many situations (e.g. in simprocs);
8495 * Pure: improved error reporting of simprocs;
8497 * Provers: Simplifier.simproc(_i) provides sane interface for setting
8501 *** Document preparation ***
8503 * uses \par instead of \\ for line breaks in theory text. This may
8504 shift some page breaks in large documents. To get the old behaviour
8505 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
8507 * minimized dependencies of isabelle.sty and isabellesym.sty on
8510 * \<euro> now needs package babel/greek instead of marvosym (which
8513 * normal size for \<zero>...\<nine> (uses \mathbf instead of
8518 New in Isabelle2002 (March 2002)
8519 --------------------------------
8521 *** Document preparation ***
8523 * greatly simplified document preparation setup, including more
8524 graceful interpretation of isatool usedir -i/-d/-D options, and more
8525 instructive isatool mkdir; users should basically be able to get
8526 started with "isatool mkdir HOL Test && isatool make"; alternatively,
8527 users may run a separate document processing stage manually like this:
8528 "isatool usedir -D output HOL Test && isatool document Test/output";
8530 * theory dependency graph may now be incorporated into documents;
8531 isatool usedir -g true will produce session_graph.eps/.pdf for use
8532 with \includegraphics of LaTeX;
8534 * proper spacing of consecutive markup elements, especially text
8535 blocks after section headings;
8537 * support bold style (for single symbols only), input syntax is like
8538 this: "\<^bold>\<alpha>" or "\<^bold>A";
8540 * \<bullet> is now output as bold \cdot by default, which looks much
8541 better in printed text;
8543 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
8544 note that these symbols are currently unavailable in Proof General /
8545 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
8547 * isatool latex no longer depends on changed TEXINPUTS, instead
8548 isatool document copies the Isabelle style files to the target
8554 * Pure/Provers: improved proof by cases and induction;
8555 - 'case' command admits impromptu naming of parameters (such as
8557 - 'induct' method divinates rule instantiation from the inductive
8558 claim; no longer requires excessive ?P bindings for proper
8559 instantiation of cases;
8560 - 'induct' method properly enumerates all possibilities of set/type
8561 rules; as a consequence facts may be also passed through *type*
8562 rules without further ado;
8563 - 'induct' method now derives symbolic cases from the *rulified*
8564 rule (before it used to rulify cases stemming from the internal
8565 atomized version); this means that the context of a non-atomic
8566 statement becomes is included in the hypothesis, avoiding the
8567 slightly cumbersome show "PROP ?case" form;
8568 - 'induct' may now use elim-style induction rules without chaining
8569 facts, using ``missing'' premises from the goal state; this allows
8570 rules stemming from inductive sets to be applied in unstructured
8571 scripts, while still benefitting from proper handling of non-atomic
8572 statements; NB: major inductive premises need to be put first, all
8573 the rest of the goal is passed through the induction;
8574 - 'induct' proper support for mutual induction involving non-atomic
8575 rule statements (uses the new concept of simultaneous goals, see
8577 - append all possible rule selections, but only use the first
8578 success (no backtracking);
8579 - removed obsolete "(simplified)" and "(stripped)" options of methods;
8580 - undeclared rule case names default to numbers 1, 2, 3, ...;
8581 - added 'print_induct_rules' (covered by help item in recent Proof
8583 - moved induct/cases attributes to Pure, methods to Provers;
8584 - generic method setup instantiated for FOL and HOL;
8586 * Pure: support multiple simultaneous goal statements, for example
8587 "have a: A and b: B" (same for 'theorem' etc.); being a pure
8588 meta-level mechanism, this acts as if several individual goals had
8589 been stated separately; in particular common proof methods need to be
8590 repeated in order to cover all claims; note that a single elimination
8591 step is *not* sufficient to establish the two conjunctions, so this
8594 assume "A & B" then have A and B .. (*".." fails*)
8596 better use "obtain" in situations as above; alternative refer to
8597 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
8599 * Pure: proper integration with ``locales''; unlike the original
8600 version by Florian Kammller, Isar locales package high-level proof
8601 contexts rather than raw logical ones (e.g. we admit to include
8602 attributes everywhere); operations on locales include merge and
8603 rename; support for implicit arguments (``structures''); simultaneous
8604 type-inference over imports and text; see also HOL/ex/Locales.thy for
8607 * Pure: the following commands have been ``localized'', supporting a
8608 target locale specification "(in name)": 'lemma', 'theorem',
8609 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
8610 stored both within the locale and at the theory level (exported and
8611 qualified by the locale name);
8613 * Pure: theory goals may now be specified in ``long'' form, with
8614 ad-hoc contexts consisting of arbitrary locale elements. for example
8615 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
8616 definitions may be given, too); the result is a meta-level rule with
8617 the context elements being discharged in the obvious way;
8619 * Pure: new proof command 'using' allows to augment currently used
8620 facts after a goal statement ('using' is syntactically analogous to
8621 'apply', but acts on the goal's facts only); this allows chained facts
8622 to be separated into parts given before and after a claim, as in
8623 ``from a and b have C using d and e <proof>'';
8625 * Pure: renamed "antecedent" case to "rule_context";
8627 * Pure: new 'judgment' command records explicit information about the
8628 object-logic embedding (used by several tools internally); no longer
8629 use hard-wired "Trueprop";
8631 * Pure: added 'corollary' command;
8633 * Pure: fixed 'token_translation' command;
8635 * Pure: removed obsolete 'exported' attribute;
8637 * Pure: dummy pattern "_" in is/let is now automatically lifted over
8638 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
8639 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
8641 * Pure: method 'atomize' presents local goal premises as object-level
8642 statements (atomic meta-level propositions); setup controlled via
8643 rewrite rules declarations of 'atomize' attribute; example
8644 application: 'induct' method with proper rule statements in improper
8647 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
8648 now consider the syntactic context of assumptions, giving a better
8649 chance to get type-inference of the arguments right (this is
8650 especially important for locales);
8652 * Pure: "sorry" no longer requires quick_and_dirty in interactive
8655 * Pure/obtain: the formal conclusion "thesis", being marked as
8656 ``internal'', may no longer be reference directly in the text;
8657 potential INCOMPATIBILITY, may need to use "?thesis" in rare
8660 * Pure: generic 'sym' attribute which declares a rule both as pure
8661 'elim?' and for the 'symmetric' operation;
8663 * Pure: marginal comments ``--'' may now occur just anywhere in the
8664 text; the fixed correlation with particular command syntax has been
8667 * Pure: new method 'rules' is particularly well-suited for proof
8668 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
8669 but often produces more compact proof terms with less detours;
8671 * Pure/Provers/classical: simplified integration with pure rule
8672 attributes and methods; the classical "intro?/elim?/dest?"
8673 declarations coincide with the pure ones; the "rule" method no longer
8674 includes classically swapped intros; "intro" and "elim" methods no
8675 longer pick rules from the context; also got rid of ML declarations
8676 AddXIs/AddXEs/AddXDs; all of this has some potential for
8679 * Provers/classical: attribute 'swapped' produces classical inversions
8680 of introduction rules;
8682 * Provers/simplifier: 'simplified' attribute may refer to explicit
8683 rules instead of full simplifier context; 'iff' attribute handles
8686 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
8688 * HOL: 'recdef' now fails on unfinished automated proofs, use
8689 "(permissive)" option to recover old behavior;
8691 * HOL: 'inductive' no longer features separate (collective) attributes
8692 for 'intros' (was found too confusing);
8694 * HOL: properly declared induction rules less_induct and
8700 * HOL: moved over to sane numeral syntax; the new policy is as
8703 - 0 and 1 are polymorphic constants, which are defined on any
8704 numeric type (nat, int, real etc.);
8706 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
8707 binary representation internally;
8709 - type nat has special constructor Suc, and generally prefers Suc 0
8710 over 1::nat and Suc (Suc 0) over 2::nat;
8712 This change may cause significant problems of INCOMPATIBILITY; here
8713 are some hints on converting existing sources:
8715 - due to the new "num" token, "-0" and "-1" etc. are now atomic
8716 entities, so expressions involving "-" (unary or binary minus) need
8717 to be spaced properly;
8719 - existing occurrences of "1" may need to be constraint "1::nat" or
8720 even replaced by Suc 0; similar for old "2";
8722 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
8724 - remove all special provisions on numerals in proofs;
8726 * HOL: simp rules nat_number expand numerals on nat to Suc/0
8727 representation (depends on bin_arith_simps in the default context);
8729 * HOL: symbolic syntax for x^2 (numeral 2);
8731 * HOL: the class of all HOL types is now called "type" rather than
8732 "term"; INCOMPATIBILITY, need to adapt references to this type class
8733 in axclass/classes, instance/arities, and (usually rare) occurrences
8734 in typings (of consts etc.); internally the class is called
8735 "HOL.type", ML programs should refer to HOLogic.typeS;
8737 * HOL/record package improvements:
8738 - new derived operations "fields" to build a partial record section,
8739 "extend" to promote a fixed record to a record scheme, and
8740 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
8741 declared as simp by default;
8742 - shared operations ("more", "fields", etc.) now need to be always
8743 qualified) --- potential INCOMPATIBILITY;
8744 - removed "make_scheme" operations (use "make" with "extend") --
8746 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
8747 - provides cases/induct rules for use with corresponding Isar
8748 methods (for concrete records, record schemes, concrete more
8749 parts, and schematic more parts -- in that order);
8750 - internal definitions directly based on a light-weight abstract
8751 theory of product types over typedef rather than datatype;
8753 * HOL: generic code generator for generating executable ML code from
8754 specifications; specific support for HOL constructs such as inductive
8755 datatypes and sets, as well as recursive functions; can be invoked
8756 via 'generate_code' theory section;
8758 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
8760 * HOL: consolidated and renamed several theories. In particular:
8761 Ord.thy has been absorbed into HOL.thy
8762 String.thy has been absorbed into List.thy
8764 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
8765 (beware of argument permutation!);
8767 * HOL: linorder_less_split superseded by linorder_cases;
8769 * HOL/List: "nodups" renamed to "distinct";
8771 * HOL: added "The" definite description operator; move Hilbert's "Eps"
8772 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
8773 - Ex_def has changed, now need to use some_eq_ex
8775 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
8776 in this (rare) case use:
8778 delSWrapper "split_all_tac"
8779 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
8781 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
8784 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
8785 Isabelle's type classes, ^ on functions and relations has too general
8786 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
8787 necessary to attach explicit type constraints;
8789 * HOL/Relation: the prefix name of the infix "O" has been changed from
8790 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
8791 renamed accordingly (eg "compI" -> "rel_compI").
8793 * HOL: syntax translations now work properly with numerals and records
8796 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
8797 of "lam" -- INCOMPATIBILITY;
8799 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
8800 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
8801 renamed "Product_Type.unit";
8803 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
8805 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
8806 the "cases" method);
8808 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
8811 * HOL/IMP: updated and converted to new-style theory format; several
8812 parts turned into readable document, with proper Isar proof texts and
8813 some explanations (by Gerwin Klein);
8815 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
8817 * HOL-Hyperreal is now a logic image;
8822 * Isar: consts/constdefs supports mixfix syntax for continuous
8825 * Isar: domain package adapted to new-style theory format, e.g. see
8828 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
8829 potential INCOMPATIBILITY; now use plain induct_tac instead of former
8830 lift.induct_tac, always use UU instead of Undef;
8832 * HOLCF/IMP: updated and converted to new-style theory;
8837 * Isar: proper integration of logic-specific tools and packages,
8838 including theory commands '(co)inductive', '(co)datatype',
8839 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
8840 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
8842 * theory Main no longer includes AC; for the Axiom of Choice, base
8843 your theory on Main_ZFC;
8845 * the integer library now covers quotients and remainders, with many
8846 laws relating division to addition, multiplication, etc.;
8848 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
8849 typeless version of the formalism;
8851 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
8854 * ZF/Induct: new directory for examples of inductive definitions,
8855 including theory Multiset for multiset orderings; converted to
8856 new-style theory format;
8858 * ZF: many new theorems about lists, ordinals, etc.;
8863 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
8864 variable proof controls level of detail: 0 = no proofs (only oracle
8865 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
8866 also ref manual for further ML interfaces;
8868 * Pure/axclass: removed obsolete ML interface
8869 goal_subclass/goal_arity;
8871 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
8872 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
8873 separate tokens, so expressions involving minus need to be spaced
8876 * Pure/syntax: support non-oriented infixes, using keyword "infix"
8877 rather than "infixl" or "infixr";
8879 * Pure/syntax: concrete syntax for dummy type variables admits genuine
8880 sort constraint specifications in type inference; e.g. "x::_::foo"
8881 ensures that the type of "x" is of sort "foo" (but not necessarily a
8884 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
8885 control output of nested => (types); the default behavior is
8888 * Pure/syntax: builtin parse translation for "_constify" turns valued
8889 tokens into AST constants;
8891 * Pure/syntax: prefer later declarations of translations and print
8892 translation functions; potential INCOMPATIBILITY: need to reverse
8893 multiple declarations for same syntax element constant;
8895 * Pure/show_hyps reset by default (in accordance to existing Isar
8898 * Provers/classical: renamed addaltern to addafter, addSaltern to
8901 * Provers/clasimp: ``iff'' declarations now handle conditional rules
8904 * system: tested support for MacOS X; should be able to get Isabelle +
8905 Proof General to work in a plain Terminal after installing Poly/ML
8906 (e.g. from the Isabelle distribution area) and GNU bash alone
8907 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
8908 support requires further installations, e.g. from
8909 http://fink.sourceforge.net/);
8911 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
8913 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
8914 of 40 MB), cf. ML_OPTIONS;
8916 * system: Proof General keywords specification is now part of the
8917 Isabelle distribution (see etc/isar-keywords.el);
8919 * system: support for persistent Proof General sessions (refrain from
8920 outdating all loaded theories on startup); user may create writable
8921 logic images like this: ``isabelle -q HOL Test'';
8923 * system: smart selection of Isabelle process versus Isabelle
8924 interface, accommodates case-insensitive file systems (e.g. HFS+); may
8925 run both "isabelle" and "Isabelle" even if file names are badly
8926 damaged (executable inspects the case of the first letter of its own
8927 name); added separate "isabelle-process" and "isabelle-interface";
8929 * system: refrain from any attempt at filtering input streams; no
8930 longer support ``8bit'' encoding of old isabelle font, instead proper
8931 iso-latin characters may now be used; the related isatools
8932 "symbolinput" and "nonascii" have disappeared as well;
8934 * system: removed old "xterm" interface (the print modes "xterm" and
8935 "xterm_color" are still available for direct use in a suitable
8940 New in Isabelle99-2 (February 2001)
8941 -----------------------------------
8943 *** Overview of INCOMPATIBILITIES ***
8945 * HOL: please note that theories in the Library and elsewhere often use the
8946 new-style (Isar) format; to refer to their theorems in an ML script you must
8947 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
8949 * HOL: inductive package no longer splits induction rule aggressively,
8950 but only as far as specified by the introductions given; the old
8951 format may be recovered via ML function complete_split_rule or attribute
8952 'split_rule (complete)';
8954 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
8955 gfp_Tarski to gfp_unfold;
8957 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
8959 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
8960 relation); infix "^^" has been renamed "``"; infix "``" has been
8961 renamed "`"; "univalent" has been renamed "single_valued";
8963 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
8966 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
8968 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
8970 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
8971 consequence, it is no longer monotonic wrt. the local goal context
8972 (which is now passed through the inductive cases);
8974 * Document preparation: renamed standard symbols \<ll> to \<lless> and
8975 \<gg> to \<ggreater>;
8978 *** Document preparation ***
8980 * \isabellestyle{NAME} selects version of Isabelle output (currently
8981 available: are "it" for near math-mode best-style output, "sl" for
8982 slanted text style, and "tt" for plain type-writer; if no
8983 \isabellestyle command is given, output is according to slanted
8986 * support sub/super scripts (for single symbols only), input syntax is
8987 like this: "A\<^sup>*" or "A\<^sup>\<star>";
8989 * some more standard symbols; see Appendix A of the system manual for
8990 the complete list of symbols defined in isabellesym.sty;
8992 * improved isabelle style files; more abstract symbol implementation
8993 (should now use \isamath{...} and \isatext{...} in custom symbol
8996 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
8997 state; Note that presentation of goal states does not conform to
8998 actual human-readable proof documents. Please do not include goal
8999 states into document output unless you really know what you are doing!
9001 * proper indentation of antiquoted output with proportional LaTeX
9004 * no_document ML operator temporarily disables LaTeX document
9007 * isatool unsymbolize tunes sources for plain ASCII communication;
9012 * Pure: Isar now suffers initial goal statements to contain unbound
9013 schematic variables (this does not conform to actual readable proof
9014 documents, due to unpredictable outcome and non-compositional proof
9015 checking); users who know what they are doing may use schematic goals
9016 for Prolog-style synthesis of proven results;
9018 * Pure: assumption method (an implicit finishing) now handles actual
9021 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
9022 initial goal, declare "that" only as Pure intro (only for single
9023 steps); the "that" rule assumption may now be involved in implicit
9024 finishing, thus ".." becomes a feasible for trivial obtains;
9026 * Pure: default proof step now includes 'intro_classes'; thus trivial
9027 instance proofs may be performed by "..";
9029 * Pure: ?thesis / ?this / "..." now work for pure meta-level
9032 * Pure: more robust selection of calculational rules;
9034 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
9035 rule (as well as the assumption rule);
9037 * Pure: 'thm_deps' command visualizes dependencies of theorems and
9038 lemmas, using the graph browser tool;
9040 * Pure: predict failure of "show" in interactive mode;
9042 * Pure: 'thms_containing' now takes actual terms as arguments;
9044 * HOL: improved method 'induct' --- now handles non-atomic goals
9045 (potential INCOMPATIBILITY); tuned error handling;
9047 * HOL: cases and induct rules now provide explicit hints about the
9048 number of facts to be consumed (0 for "type" and 1 for "set" rules);
9049 any remaining facts are inserted into the goal verbatim;
9051 * HOL: local contexts (aka cases) may now contain term bindings as
9052 well; the 'cases' and 'induct' methods new provide a ?case binding for
9053 the result to be shown in each case;
9055 * HOL: added 'recdef_tc' command;
9057 * isatool convert assists in eliminating legacy ML scripts;
9062 * HOL/Library: a collection of generic theories to be used together
9063 with main HOL; the theory loader path already includes this directory
9064 by default; the following existing theories have been moved here:
9065 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
9066 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
9068 * HOL/Unix: "Some aspects of Unix file-system security", a typical
9069 modelling and verification task performed in Isabelle/HOL +
9070 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
9072 * HOL/Algebra: special summation operator SUM no longer exists, it has
9073 been replaced by setsum; infix 'assoc' now has priority 50 (like
9074 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
9075 'domain', this makes the theory consistent with mathematical
9078 * HOL basics: added overloaded operations "inverse" and "divide"
9079 (infix "/"), syntax for generic "abs" operation, generic summation
9082 * HOL/typedef: simplified package, provide more useful rules (see also
9085 * HOL/datatype: induction rule for arbitrarily branching datatypes is
9086 now expressed as a proper nested rule (old-style tactic scripts may
9087 require atomize_strip_tac to cope with non-atomic premises);
9089 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
9090 to "split_conv" (old name still available for compatibility);
9092 * HOL: improved concrete syntax for strings (e.g. allows translation
9093 rules with string literals);
9095 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
9096 and Fleuriot's mechanization of analysis, including the transcendental
9097 functions for the reals;
9099 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
9104 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
9105 "lam" is displayed as TWO lambda-symbols
9107 * CTT: theory Main now available, containing everything (that is, Bool
9113 * Pure: the Simplifier has been implemented properly as a derived rule
9114 outside of the actual kernel (at last!); the overall performance
9115 penalty in practical applications is about 50%, while reliability of
9116 the Isabelle inference kernel has been greatly improved;
9118 * print modes "brackets" and "no_brackets" control output of nested =>
9119 (types) and ==> (props); the default behaviour is "brackets";
9121 * Provers: fast_tac (and friends) now handle actual object-logic rules
9122 as assumptions as well;
9124 * system: support Poly/ML 4.0;
9126 * system: isatool install handles KDE version 1 or 2;
9130 New in Isabelle99-1 (October 2000)
9131 ----------------------------------
9133 *** Overview of INCOMPATIBILITIES ***
9135 * HOL: simplification of natural numbers is much changed; to partly
9136 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
9137 issue the following ML commands:
9139 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
9140 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
9142 * HOL: simplification no longer dives into case-expressions; this is
9143 controlled by "t.weak_case_cong" for each datatype t;
9145 * HOL: nat_less_induct renamed to less_induct;
9147 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
9148 fixsome to patch .thy and .ML sources automatically;
9150 select_equality -> some_equality
9151 select_eq_Ex -> some_eq_ex
9152 selectI2EX -> someI2_ex
9155 select1_equality -> some1_equality
9156 Eps_sym_eq -> some_sym_eq_trivial
9157 Eps_eq -> some_eq_trivial
9159 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
9161 * HOL: removed obsolete theorem binding expand_if (refer to split_if
9164 * HOL: the recursion equations generated by 'recdef' are now called
9165 f.simps instead of f.rules;
9167 * HOL: qed_spec_mp now also handles bounded ALL as well;
9169 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
9170 sometimes be needed;
9172 * HOL: the constant for "f``x" is now "image" rather than "op ``";
9174 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
9176 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
9177 product is now "<*>" instead of "Times"; the lexicographic product is
9178 now "<*lex*>" instead of "**";
9180 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
9181 of main HOL, but was unused); better use HOL's datatype package;
9183 * HOL: removed "symbols" syntax for constant "override" of theory Map;
9184 the old syntax may be recovered as follows:
9187 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
9188 (infixl "\\<oplus>" 100)
9190 * HOL/Real: "rabs" replaced by overloaded "abs" function;
9192 * HOL/ML: even fewer consts are declared as global (see theories Ord,
9193 Lfp, Gfp, WF); this only affects ML packages that refer to const names
9196 * HOL and ZF: syntax for quotienting wrt an equivalence relation
9197 changed from A/r to A//r;
9199 * ZF: new treatment of arithmetic (nat & int) may break some old
9202 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
9203 rulify -> rule_format, elimify -> elim_format, ...);
9205 * Isar/Provers: intro/elim/dest attributes changed; renamed
9206 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
9207 should have to change intro!! to intro? only); replaced "delrule" by
9210 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
9212 * Provers: strengthened force_tac by using new first_best_tac;
9214 * LaTeX document preparation: several changes of isabelle.sty (see
9218 *** Document preparation ***
9220 * formal comments (text blocks etc.) in new-style theories may now
9221 contain antiquotations of thm/prop/term/typ/text to be presented
9222 according to latex print mode; concrete syntax is like this:
9223 @{term[show_types] "f(x) = a + x"};
9225 * isatool mkdir provides easy setup of Isabelle session directories,
9226 including proper document sources;
9228 * generated LaTeX sources are now deleted after successful run
9229 (isatool document -c); may retain a copy somewhere else via -D option
9232 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
9233 style files, achieving self-contained LaTeX sources and simplifying
9236 * old-style theories now produce (crude) LaTeX output as well;
9238 * browser info session directories are now self-contained (may be put
9239 on WWW server seperately); improved graphs of nested sessions; removed
9240 graph for 'all sessions';
9242 * several improvements in isabelle style files; \isabellestyle{it}
9243 produces fake math mode output; \isamarkupheader is now \section by
9244 default; see lib/texinputs/isabelle.sty etc.;
9249 * Isar/Pure: local results and corresponding term bindings are now
9250 subject to Hindley-Milner polymorphism (similar to ML); this
9251 accommodates incremental type-inference very nicely;
9253 * Isar/Pure: new derived language element 'obtain' supports
9254 generalized existence reasoning;
9256 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
9257 support accumulation of results, without applying any rules yet;
9258 useful to collect intermediate results without explicit name
9259 references, and for use with transitivity rules with more than 2
9262 * Isar/Pure: scalable support for case-analysis type proofs: new
9263 'case' language element refers to local contexts symbolically, as
9264 produced by certain proof methods; internally, case names are attached
9265 to theorems as "tags";
9267 * Isar/Pure: theory command 'hide' removes declarations from
9268 class/type/const name spaces;
9270 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
9271 indicate potential overloading;
9273 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
9275 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
9276 "{a,b,c}" instead of {a,b,c};
9278 * Isar/Pure now provides its own version of intro/elim/dest
9279 attributes; useful for building new logics, but beware of confusion
9280 with the version in Provers/classical;
9282 * Isar/Pure: the local context of (non-atomic) goals is provided via
9283 case name 'antecedent';
9285 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
9286 to the current context is now done automatically);
9288 * Isar/Pure: theory command 'method_setup' provides a simple interface
9289 for definining proof methods in ML;
9291 * Isar/Provers: intro/elim/dest attributes changed; renamed
9292 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
9293 most cases, one should have to change intro!! to intro? only);
9294 replaced "delrule" by "rule del";
9296 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
9297 'symmetric' attribute (the latter supercedes [RS sym]);
9299 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
9300 method modifier); 'simp' method: 'only:' modifier removes loopers as
9301 well (including splits);
9303 * Isar/Provers: Simplifier and Classical methods now support all kind
9304 of modifiers used in the past, including 'cong', 'iff', etc.
9306 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
9307 of Simplifier and Classical reasoner);
9309 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
9310 now support named cases; major packages (inductive, datatype, primrec,
9311 recdef) support case names and properly name parameters;
9313 * Isar/HOL: new transitivity rules for substitution in inequalities --
9314 monotonicity conditions are extracted to be proven at end of
9317 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
9320 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
9321 split_if split_if_asm; datatype package provides theorems foo.splits =
9322 foo.split foo.split_asm for each datatype;
9324 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
9325 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
9326 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
9327 use "(cases (simplified))" method in proper proof texts);
9329 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
9331 * Isar: names of theorems etc. may be natural numbers as well;
9333 * Isar: 'pr' command: optional arguments for goals_limit and
9334 ProofContext.prems_limit; no longer prints theory contexts, but only
9337 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
9338 additional print modes to be specified; e.g. "pr(latex)" will print
9339 proof state according to the Isabelle LaTeX style;
9341 * Isar: improved support for emulating tactic scripts, including proof
9342 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
9343 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
9344 (for HOL datatypes);
9346 * Isar: simplified (more robust) goal selection of proof methods: 1st
9347 goal, all goals, or explicit goal specifier (tactic emulation); thus
9348 'proof method scripts' have to be in depth-first order;
9350 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
9352 * Isar: removed 'help' command, which hasn't been too helpful anyway;
9353 should instead use individual commands for printing items
9354 (print_commands, print_methods etc.);
9356 * Isar: added 'nothing' --- the empty list of theorems;
9361 * HOL/MicroJava: formalization of a fragment of Java, together with a
9362 corresponding virtual machine and a specification of its bytecode
9363 verifier and a lightweight bytecode verifier, including proofs of
9364 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
9365 Cornelia Pusch (see also the homepage of project Bali at
9366 http://isabelle.in.tum.de/Bali/);
9368 * HOL/Algebra: new theory of rings and univariate polynomials, by
9371 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
9372 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
9375 * HOL/Lattice: fundamental concepts of lattice theory and order
9376 structures, including duals, properties of bounds versus algebraic
9377 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
9378 Theorem for complete lattices etc.; may also serve as a demonstration
9379 for abstract algebraic reasoning using axiomatic type classes, and
9380 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
9382 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
9385 * HOL/IMPP: extension of IMP with local variables and mutually
9386 recursive procedures, by David von Oheimb;
9388 * HOL/Lambda: converted into new-style theory and document;
9390 * HOL/ex/Multiquote: example of multiple nested quotations and
9391 anti-quotations -- basically a generalized version of de-Bruijn
9392 representation; very useful in avoiding lifting of operations;
9394 * HOL/record: added general record equality rule to simpset; fixed
9395 select-update simplification procedure to handle extended records as
9396 well; admit "r" as field name;
9398 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
9399 other numeric types and also as the identity of groups, rings, etc.;
9401 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
9402 Types nat and int belong to this axclass;
9404 * HOL: greatly improved simplification involving numerals of type nat, int, real:
9405 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
9406 i*j + k + j*#3*i simplifies to #4*(i*j) + k
9407 two terms #m*u and #n*u are replaced by #(m+n)*u
9408 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
9409 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
9410 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
9412 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
9413 powerful prover for predicate logic but knows nothing of clasets; see
9414 ex/mesontest.ML and ex/mesontest2.ML for example applications;
9416 * HOL: new version of "case_tac" subsumes both boolean case split and
9417 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
9418 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
9420 * HOL: simplification no longer dives into case-expressions: only the
9421 selector expression is simplified, but not the remaining arms; to
9422 enable full simplification of case-expressions for datatype t, you may
9423 remove t.weak_case_cong from the simpset, either globally (Delcongs
9424 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
9426 * HOL/recdef: the recursion equations generated by 'recdef' for
9427 function 'f' are now called f.simps instead of f.rules; if all
9428 termination conditions are proved automatically, these simplification
9429 rules are added to the simpset, as in primrec; rules may be named
9430 individually as well, resulting in a separate list of theorems for
9433 * HOL/While is a new theory that provides a while-combinator. It
9434 permits the definition of tail-recursive functions without the
9435 provision of a termination measure. The latter is necessary once the
9436 invariant proof rule for while is applied.
9438 * HOL: new (overloaded) notation for the set of elements below/above
9439 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
9441 * HOL: theorems impI, allI, ballI bound as "strip";
9443 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
9444 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
9445 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
9447 * HOL/Real: "rabs" replaced by overloaded "abs" function;
9449 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
9450 main HOL, but was unused);
9452 * HOL: fewer consts declared as global (e.g. have to refer to
9453 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
9455 * HOL: tuned AST representation of nested pairs, avoiding bogus output
9456 in case of overlap with user translations (e.g. judgements over
9457 tuples); (note that the underlying logical represenation is still
9463 * ZF: simplification automatically cancels common terms in arithmetic
9464 expressions over nat and int;
9466 * ZF: new treatment of nat to minimize type-checking: all operators
9467 coerce their operands to a natural number using the function natify,
9468 making the algebraic laws unconditional;
9470 * ZF: as above, for int: operators coerce their operands to an integer
9471 using the function intify;
9473 * ZF: the integer library now contains many of the usual laws for the
9474 orderings, including $<=, and monotonicity laws for $+ and $*;
9476 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
9479 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
9480 to the simplifier and classical reasoner simultaneously;
9485 * Provers: blast_tac now handles actual object-logic rules as
9486 assumptions; note that auto_tac uses blast_tac internally as well;
9488 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
9489 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
9491 * Provers: delrules now handles destruct rules as well (no longer need
9492 explicit make_elim);
9494 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
9495 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
9496 use instead the strong form,
9497 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
9498 in HOL, FOL and ZF the function cla_make_elim will create such rules
9499 from destruct-rules;
9501 * Provers: Simplifier.easy_setup provides a fast path to basic
9502 Simplifier setup for new object-logics;
9504 * Pure: AST translation rules no longer require constant head on LHS;
9506 * Pure: improved name spaces: ambiguous output is qualified; support
9507 for hiding of names;
9509 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
9510 XSYMBOL_HOME; no longer need to do manual configuration in most
9513 * system: compression of ML heaps images may now be controlled via -c
9514 option of isabelle and isatool usedir (currently only observed by
9517 * system: isatool installfonts may handle X-Symbol fonts as well (very
9518 useful for remote X11);
9520 * system: provide TAGS file for Isabelle sources;
9522 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
9525 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
9526 timing flag supersedes proof_timing and Toplevel.trace;
9528 * ML: new combinators |>> and |>>> for incremental transformations
9529 with secondary results (e.g. certain theory extensions):
9531 * ML: PureThy.add_defs gets additional argument to indicate potential
9532 overloading (usually false);
9534 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
9539 New in Isabelle99 (October 1999)
9540 --------------------------------
9542 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9544 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
9545 are no longer simplified. (This allows the simplifier to unfold recursive
9546 functional programs.) To restore the old behaviour, declare
9548 Delcongs [if_weak_cong];
9550 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
9553 * HOL: the predicate "inj" is now defined by translation to "inj_on";
9555 * HOL/datatype: mutual_induct_tac no longer exists --
9556 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
9558 * HOL/typedef: fixed type inference for representing set; type
9559 arguments now have to occur explicitly on the rhs as type constraints;
9561 * ZF: The con_defs part of an inductive definition may no longer refer
9562 to constants declared in the same theory;
9564 * HOL, ZF: the function mk_cases, generated by the inductive
9565 definition package, has lost an argument. To simplify its result, it
9566 uses the default simpset instead of a supplied list of theorems.
9568 * HOL/List: the constructors of type list are now Nil and Cons;
9570 * Simplifier: the type of the infix ML functions
9571 setSSolver addSSolver setSolver addSolver
9572 is now simpset * solver -> simpset where `solver' is a new abstract type
9573 for packaging solvers. A solver is created via
9574 mk_solver: string -> (thm list -> int -> tactic) -> solver
9575 where the string argument is only a comment.
9580 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
9581 decision procedure for linear arithmetic. Currently it is used for
9582 types `nat', `int', and `real' in HOL (see below); it can, should and
9583 will be instantiated for other types and logics as well.
9585 * The simplifier now accepts rewrite rules with flexible heads, eg
9586 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
9587 They are applied like any rule with a non-pattern lhs, i.e. by first-order
9593 * New Isabelle/Isar subsystem provides an alternative to traditional
9594 tactical theorem proving; together with the ProofGeneral/isar user
9595 interface it offers an interactive environment for developing human
9596 readable proof documents (Isar == Intelligible semi-automated
9597 reasoning); for further information see isatool doc isar-ref,
9598 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
9600 * improved and simplified presentation of theories: better HTML markup
9601 (including colors), graph views in several sizes; isatool usedir now
9602 provides a proper interface for user theories (via -P option); actual
9603 document preparation based on (PDF)LaTeX is available as well (for
9604 new-style theories only); see isatool doc system for more information;
9606 * native support for Proof General, both for classic Isabelle and
9609 * ML function thm_deps visualizes dependencies of theorems and lemmas,
9610 using the graph browser tool;
9612 * Isabelle manuals now also available as PDF;
9614 * theory loader rewritten from scratch (may not be fully
9615 bug-compatible); old loadpath variable has been replaced by show_path,
9616 add_path, del_path, reset_path functions; new operations such as
9617 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
9620 * improved isatool install: option -k creates KDE application icon,
9621 option -p DIR installs standalone binaries;
9623 * added ML_PLATFORM setting (useful for cross-platform installations);
9624 more robust handling of platform specific ML images for SML/NJ;
9626 * the settings environment is now statically scoped, i.e. it is never
9627 created again in sub-processes invoked from isabelle, isatool, or
9630 * path element specification '~~' refers to '$ISABELLE_HOME';
9632 * in locales, the "assumes" and "defines" parts may be omitted if
9635 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
9638 * new print_mode "HTML";
9640 * new flag show_tags controls display of tags of theorems (which are
9641 basically just comments that may be attached by some tools);
9643 * Isamode 2.6 requires patch to accomodate change of Isabelle font
9644 mode and goal output format:
9646 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
9648 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
9650 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
9651 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
9653 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
9655 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
9657 * function bind_thms stores lists of theorems (cf. bind_thm);
9659 * new shorthand tactics ftac, eatac, datac, fatac;
9661 * qed (and friends) now accept "" as result name; in that case the
9662 theorem is not stored, but proper checks and presentation of the
9665 * theorem database now also indexes constants "Trueprop", "all",
9666 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
9671 ** HOL arithmetic **
9673 * There are now decision procedures for linear arithmetic over nat and
9676 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
9677 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
9678 are treated as atomic; subformulae not involving type `nat' or `int'
9679 are ignored; quantified subformulae are ignored unless they are
9680 positive universal or negative existential. The tactic has to be
9681 invoked by hand and can be a little bit slow. In particular, the
9682 running time is exponential in the number of occurrences of `min' and
9683 `max', and `-' on `nat'.
9685 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
9686 (negated) (in)equalities among the premises and the conclusion into
9687 account (i.e. no compound formulae) and does not know about `min' and
9688 `max', and `-' on `nat'. It is fast and is used automatically by the
9691 NB: At the moment, these decision procedures do not cope with mixed
9692 nat/int formulae where the two parts interact, such as `m < n ==>
9695 * HOL/Numeral provides a generic theory of numerals (encoded
9696 efficiently as bit strings); setup for types nat/int/real is in place;
9697 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
9698 int, existing theories and proof scripts may require a few additional
9701 * integer division and remainder can now be performed on constant
9704 * many properties of integer multiplication, division and remainder
9707 * An interface to the Stanford Validity Checker (SVC) is available through the
9708 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
9709 are proved automatically. SVC must be installed separately, and its results
9710 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
9711 invocation of the underlying oracle). For SVC see
9712 http://verify.stanford.edu/SVC
9714 * IsaMakefile: the HOL-Real target now builds an actual image;
9719 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
9720 (in Isabelle/Isar) -- by Gertrud Bauer;
9722 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
9723 analysis for assembly languages with subtypes;
9725 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
9726 -- avoids syntactic ambiguities and treats state, transition, and
9727 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
9728 changed syntax and (many) tactics;
9730 * HOL/inductive: Now also handles more general introduction rules such
9731 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
9732 theorems are now maintained within the theory (maintained via the
9735 * HOL/datatype: Now also handles arbitrarily branching datatypes
9736 (using function types) such as
9738 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
9740 * HOL/record: record_simproc (part of the default simpset) takes care
9741 of selectors applied to updated records; record_split_tac is no longer
9742 part of the default claset; update_defs may now be removed from the
9743 simpset in many cases; COMPATIBILITY: old behavior achieved by
9745 claset_ref () := claset() addSWrapper record_split_wrapper;
9746 Delsimprocs [record_simproc]
9748 * HOL/typedef: fixed type inference for representing set; type
9749 arguments now have to occur explicitly on the rhs as type constraints;
9751 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
9752 names rather than an ML expression;
9754 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
9755 supplied later. Program schemes can be defined, such as
9756 "While B C s = (if B s then While B C (C s) else s)"
9757 where the well-founded relation can be chosen after B and C have been given.
9759 * HOL/List: the constructors of type list are now Nil and Cons;
9760 INCOMPATIBILITY: while [] and infix # syntax is still there, of
9761 course, ML tools referring to List.list.op # etc. have to be adapted;
9763 * HOL_quantifiers flag superseded by "HOL" print mode, which is
9764 disabled by default; run isabelle with option -m HOL to get back to
9765 the original Gordon/HOL-style output;
9767 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
9768 ALL x<=y. P, EX x<y. P, EX x<=y. P;
9770 * HOL basic syntax simplified (more orthogonal): all variants of
9771 All/Ex now support plain / symbolic / HOL notation; plain syntax for
9772 Eps operator is provided as well: "SOME x. P[x]";
9774 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
9776 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
9777 thus available for user theories;
9779 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
9780 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
9783 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
9784 several times and then mp;
9789 * the notation <<...>> is now available as a notation for sequences of
9792 * the simplifier is now installed
9794 * the axiom system has been generalized (thanks to Soren Heilmann)
9796 * the classical reasoner now has a default rule database
9801 * new primrec section allows primitive recursive functions to be given
9802 directly (as in HOL) over datatypes and the natural numbers;
9804 * new tactics induct_tac and exhaust_tac for induction (or case
9805 analysis) over datatypes and the natural numbers;
9807 * the datatype declaration of type T now defines the recursor T_rec;
9809 * simplification automatically does freeness reasoning for datatype
9812 * automatic type-inference, with AddTCs command to insert new
9813 type-checking rules;
9815 * datatype introduction rules are now added as Safe Introduction rules
9818 * the syntax "if P then x else y" is now available in addition to
9822 *** Internal programming interfaces ***
9824 * tuned simplifier trace output; new flag debug_simp;
9826 * structures Vartab / Termtab (instances of TableFun) offer efficient
9827 tables indexed by indexname_ord / term_ord (compatible with aconv);
9829 * AxClass.axclass_tac lost the theory argument;
9831 * tuned current_goals_markers semantics: begin / end goal avoids
9832 printing empty lines;
9834 * removed prs and prs_fn hook, which was broken because it did not
9835 include \n in its semantics, forcing writeln to add one
9836 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
9837 string -> unit if you really want to output text without newline;
9839 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
9840 plain output, interface builders may have to enable 'isabelle_font'
9841 mode to get Isabelle font glyphs as before;
9843 * refined token_translation interface; INCOMPATIBILITY: output length
9844 now of type real instead of int;
9846 * theory loader actions may be traced via new ThyInfo.add_hook
9847 interface (see src/Pure/Thy/thy_info.ML); example application: keep
9848 your own database of information attached to *whole* theories -- as
9849 opposed to intra-theory data slots offered via TheoryDataFun;
9851 * proper handling of dangling sort hypotheses (at last!);
9852 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
9853 extra sort hypotheses that can be witnessed from the type signature;
9854 the force_strip_shyps flag is gone, any remaining shyps are simply
9855 left in the theorem (with a warning issued by strip_shyps_warning);
9859 New in Isabelle98-1 (October 1998)
9860 ----------------------------------
9862 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9864 * several changes of automated proof tools;
9866 * HOL: major changes to the inductive and datatype packages, including
9867 some minor incompatibilities of theory syntax;
9869 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
9872 * HOL: removed duplicate thms in Arith:
9873 less_imp_add_less should be replaced by trans_less_add1
9874 le_imp_add_le should be replaced by trans_le_add1
9876 * HOL: unary minus is now overloaded (new type constraints may be
9879 * HOL and ZF: unary minus for integers is now #- instead of #~. In
9880 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
9881 now taken as an integer constant.
9883 * Pure: ML function 'theory_of' renamed to 'theory';
9889 1. Asm_full_simp_tac is now more aggressive.
9890 1. It will sometimes reorient premises if that increases their power to
9892 2. It does no longer proceed strictly from left to right but may also
9893 rotate premises to achieve further simplification.
9894 For compatibility reasons there is now Asm_lr_simp_tac which is like the
9895 old Asm_full_simp_tac in that it does not rotate premises.
9896 2. The simplifier now knows a little bit about nat-arithmetic.
9898 * Classical reasoner: wrapper mechanism for the classical reasoner now
9899 allows for selected deletion of wrappers, by introduction of names for
9900 wrapper functionals. This implies that addbefore, addSbefore,
9901 addaltern, and addSaltern now take a pair (name, tactic) as argument,
9902 and that adding two tactics with the same name overwrites the first
9903 one (emitting a warning).
9904 type wrapper = (int -> tactic) -> (int -> tactic)
9905 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
9906 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
9907 delWrapper, delSWrapper: claset * string -> claset
9908 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
9910 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
9911 semantics; addbefore now affects only the unsafe part of step_tac
9912 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
9913 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
9916 * Classical reasoner: setwrapper to setWrapper and compwrapper to
9917 compWrapper; added safe wrapper (and access functions for it);
9919 * HOL/split_all_tac is now much faster and fails if there is nothing
9920 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
9921 and the names of the automatically generated variables have changed.
9922 split_all_tac has moved within claset() from unsafe wrappers to safe
9923 wrappers, which means that !!-bound variables are split much more
9924 aggressively, and safe_tac and clarify_tac now split such variables.
9925 If this splitting is not appropriate, use delSWrapper "split_all_tac".
9926 Note: the same holds for record_split_tac, which does the job of
9927 split_all_tac for record fields.
9929 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
9930 permanently to the default simpset using Addsplits just like
9931 Addsimps. They can be removed via Delsplits just like
9932 Delsimps. Lower-case versions are also available.
9934 * HOL/Simplifier: The rule split_if is now part of the default
9935 simpset. This means that the simplifier will eliminate all occurrences
9936 of if-then-else in the conclusion of a goal. To prevent this, you can
9937 either remove split_if completely from the default simpset by
9938 `Delsplits [split_if]' or remove it in a specific call of the
9939 simplifier using `... delsplits [split_if]'. You can also add/delete
9940 other case splitting rules to/from the default simpset: every datatype
9941 generates suitable rules `split_t_case' and `split_t_case_asm' (where
9942 t is the name of the datatype).
9944 * Classical reasoner / Simplifier combination: new force_tac (and
9945 derivatives Force_tac, force) combines rewriting and classical
9946 reasoning (and whatever other tools) similarly to auto_tac, but is
9947 aimed to solve the given subgoal completely.
9952 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
9953 and `goalw': the theory is no longer needed as an explicit argument -
9954 the current theory context is used; assumptions are no longer returned
9955 at the ML-level unless one of them starts with ==> or !!; it is
9956 recommended to convert to these new commands using isatool fixgoal
9957 (backup your sources first!);
9959 * new top-level commands 'thm' and 'thms' for retrieving theorems from
9960 the current theory context, and 'theory' to lookup stored theories;
9962 * new theory section 'locale' for declaring constants, assumptions and
9963 definitions that have local scope;
9965 * new theory section 'nonterminals' for purely syntactic types;
9967 * new theory section 'setup' for generic ML setup functions
9968 (e.g. package initialization);
9970 * the distribution now includes Isabelle icons: see
9971 lib/logo/isabelle-{small,tiny}.xpm;
9973 * isatool install - install binaries with absolute references to
9976 * isatool logo -- create instances of the Isabelle logo (as EPS);
9978 * print mode 'emacs' reserved for Isamode;
9980 * support multiple print (ast) translations per constant name;
9982 * theorems involving oracles are now printed with a suffixed [!];
9987 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
9989 * HOL/inductive package reorganized and improved: now supports mutual
9995 oddI "n : EVEN ==> Suc n : ODD"
9996 evenI "n : ODD ==> Suc n : EVEN"
9998 new theorem list "elims" contains an elimination rule for each of the
9999 recursive sets; inductive definitions now handle disjunctive premises
10000 correctly (also ZF);
10002 INCOMPATIBILITIES: requires Inductive as an ancestor; component
10003 "mutual_induct" no longer exists - the induction rule is always
10004 contained in "induct";
10007 * HOL/datatype package re-implemented and greatly improved: now
10008 supports mutually recursive datatypes such as
10011 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
10012 | SUM ('a aexp) ('a aexp)
10013 | DIFF ('a aexp) ('a aexp)
10016 'a bexp = LESS ('a aexp) ('a aexp)
10017 | AND ('a bexp) ('a bexp)
10018 | OR ('a bexp) ('a bexp)
10020 as well as indirectly recursive datatypes such as
10023 ('a, 'b) term = Var 'a
10024 | App 'b ((('a, 'b) term) list)
10026 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
10027 induction on mutually / indirectly recursive datatypes.
10029 Primrec equations are now stored in theory and can be accessed via
10030 <function_name>.simps.
10034 - Theories using datatypes must now have theory Datatype as an
10036 - The specific <typename>.induct_tac no longer exists - use the
10037 generic induct_tac instead.
10038 - natE has been renamed to nat.exhaust - use exhaust_tac
10039 instead of res_inst_tac ... natE. Note that the variable
10040 names in nat.exhaust differ from the names in natE, this
10041 may cause some "fragile" proofs to fail.
10042 - The theorems split_<typename>_case and split_<typename>_case_asm
10043 have been renamed to <typename>.split and <typename>.split_asm.
10044 - Since default sorts of type variables are now handled correctly,
10045 some datatype definitions may have to be annotated with explicit
10047 - Primrec definitions no longer require function name and type
10048 of recursive argument.
10050 Consider using isatool fixdatatype to adapt your theories and proof
10051 scripts to the new package (backup your sources first!).
10054 * HOL/record package: considerably improved implementation; now
10055 includes concrete syntax for record types, terms, updates; theorems
10056 for surjective pairing and splitting !!-bound record variables; proof
10057 support is as follows:
10059 1) standard conversions (selectors or updates applied to record
10060 constructor terms) are part of the standard simpset;
10062 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
10063 made part of standard simpset and claset via addIffs;
10065 3) a tactic for record field splitting (record_split_tac) is part of
10066 the standard claset (addSWrapper);
10068 To get a better idea about these rules you may retrieve them via
10069 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
10070 the name of your record type.
10072 The split tactic 3) conceptually simplifies by the following rule:
10074 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
10076 Thus any record variable that is bound by meta-all will automatically
10077 blow up into some record constructor term, consequently the
10078 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
10079 solve record problems automatically.
10082 * reorganized the main HOL image: HOL/Integ and String loaded by
10083 default; theory Main includes everything;
10085 * automatic simplification of integer sums and comparisons, using cancellation;
10087 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
10089 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
10091 * many new identities for unions, intersections, set difference, etc.;
10093 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
10094 called split_if, split_split, split_sum_case and split_nat_case (to go
10095 with add/delsplits);
10097 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
10098 (?x::unit) = (); this is made part of the default simpset, which COULD
10099 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
10100 'Delsimprocs [unit_eq_proc];' as last resort); also note that
10101 unit_abs_eta_conv is added in order to counter the effect of
10102 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
10105 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
10108 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
10109 It and 'sym RS equals0D' are now in the default claset, giving automatic
10110 disjointness reasoning but breaking a few old proofs.
10112 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
10113 to 'converse' from 'inverse' (for compatibility with ZF and some
10116 * HOL/recdef can now declare non-recursive functions, with {} supplied as
10117 the well-founded relation;
10119 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
10120 Compl A. The "Compl" syntax remains available as input syntax for this
10123 * HOL/Update: new theory of function updates:
10124 f(a:=b) == %x. if x=a then b else f x
10125 may also be iterated as in f(a:=b,c:=d,...);
10127 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
10130 - new function list_update written xs[i:=v] that updates the i-th
10131 list position. May also be iterated as in xs[i:=a,j:=b,...].
10132 - new function `upt' written [i..j(] which generates the list
10133 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
10134 bound write [i..j], which is a shorthand for [i..j+1(].
10135 - new lexicographic orderings and corresponding wellfoundedness theorems.
10138 - removed 'pred' (predecessor) function;
10139 - generalized some theorems about n-1;
10140 - many new laws about "div" and "mod";
10141 - new laws about greatest common divisors (see theory ex/Primes);
10143 * HOL/Relation: renamed the relational operator r^-1 "converse"
10144 instead of "inverse";
10146 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
10147 of the multiset ordering;
10149 * directory HOL/Real: a construction of the reals using Dedekind cuts
10150 (not included by default);
10152 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
10154 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
10155 programs, i.e. different program variables may have different types.
10157 * calling (stac rew i) now fails if "rew" has no effect on the goal
10158 [previously, this check worked only if the rewrite rule was unconditional]
10159 Now rew can involve either definitions or equalities (either == or =).
10164 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
10165 only the theorems proved on ZF.ML;
10167 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
10168 It and 'sym RS equals0D' are now in the default claset, giving automatic
10169 disjointness reasoning but breaking a few old proofs.
10171 * ZF/Update: new theory of function updates
10172 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
10173 may also be iterated as in f(a:=b,c:=d,...);
10175 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
10177 * calling (stac rew i) now fails if "rew" has no effect on the goal
10178 [previously, this check worked only if the rewrite rule was unconditional]
10179 Now rew can involve either definitions or equalities (either == or =).
10181 * case_tac provided for compatibility with HOL
10182 (like the old excluded_middle_tac, but with subgoals swapped)
10185 *** Internal programming interfaces ***
10187 * Pure: several new basic modules made available for general use, see
10188 also src/Pure/README;
10190 * improved the theory data mechanism to support encapsulation (data
10191 kind name replaced by private Object.kind, acting as authorization
10192 key); new type-safe user interface via functor TheoryDataFun; generic
10193 print_data function becomes basically useless;
10195 * removed global_names compatibility flag -- all theory declarations
10196 are qualified by default;
10198 * module Pure/Syntax now offers quote / antiquote translation
10199 functions (useful for Hoare logic etc. with implicit dependencies);
10200 see HOL/ex/Antiquote for an example use;
10202 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
10205 * new tactical CHANGED_GOAL for checking that a tactic modifies a
10208 * Display.print_goals function moved to Locale.print_goals;
10210 * standard print function for goals supports current_goals_markers
10211 variable for marking begin of proof, end of proof, start of goal; the
10212 default is ("", "", ""); setting current_goals_markers := ("<proof>",
10213 "</proof>", "<goal>") causes SGML like tagged proof state printing,
10218 New in Isabelle98 (January 1998)
10219 --------------------------------
10221 *** Overview of INCOMPATIBILITIES (see below for more details) ***
10223 * changed lexical syntax of terms / types: dots made part of long
10224 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
10226 * simpset (and claset) reference variable replaced by functions
10227 simpset / simpset_ref;
10229 * no longer supports theory aliases (via merge) and non-trivial
10230 implicit merge of thms' signatures;
10232 * most internal names of constants changed due to qualified names;
10234 * changed Pure/Sequence interface (see Pure/seq.ML);
10237 *** General Changes ***
10239 * hierachically structured name spaces (for consts, types, axms, thms
10240 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
10241 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
10242 isatool fixdots ensures space after dots (e.g. "%x. x"); set
10243 long_names for fully qualified output names; NOTE: ML programs
10244 (special tactics, packages etc.) referring to internal names may have
10245 to be adapted to cope with fully qualified names; in case of severe
10246 backward campatibility problems try setting 'global_names' at compile
10247 time to have enrything declared within a flat name space; one may also
10248 fine tune name declarations in theories via the 'global' and 'local'
10251 * reimplemented the implicit simpset and claset using the new anytype
10252 data filed in signatures; references simpset:simpset ref etc. are
10253 replaced by functions simpset:unit->simpset and
10254 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
10255 to patch your ML files accordingly;
10257 * HTML output now includes theory graph data for display with Java
10258 applet or isatool browser; data generated automatically via isatool
10259 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
10261 * defs may now be conditional; improved rewrite_goals_tac to handle
10262 conditional equations;
10264 * defs now admits additional type arguments, using TYPE('a) syntax;
10266 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
10267 creates a new theory node; implicit merge of thms' signatures is
10268 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
10269 transfer:theory->thm->thm in (rare) cases;
10271 * improved handling of draft signatures / theories; draft thms (and
10272 ctyps, cterms) are automatically promoted to real ones;
10274 * slightly changed interfaces for oracles: admit many per theory, named
10275 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
10277 * print_goals: optional output of const types (set show_consts and
10280 * improved output of warnings (###) and errors (***);
10282 * subgoal_tac displays a warning if the new subgoal has type variables;
10284 * removed old README and Makefiles;
10286 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
10288 * removed obsolete init_pps and init_database;
10290 * deleted the obsolete tactical STATE, which was declared by
10291 fun STATE tacfun st = tacfun st st;
10293 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
10294 (which abbreviates $HOME);
10296 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
10297 use isatool fixseq to adapt your ML programs (this works for fully
10298 qualified references to the Sequence structure only!);
10300 * use_thy no longer requires writable current directory; it always
10301 reloads .ML *and* .thy file, if either one is out of date;
10304 *** Classical Reasoner ***
10306 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
10307 tactics that use classical reasoning to simplify a subgoal without
10308 splitting it into several subgoals;
10310 * Safe_tac: like safe_tac but uses the default claset;
10315 * added simplification meta rules:
10316 (asm_)(full_)simplify: simpset -> thm -> thm;
10318 * simplifier.ML no longer part of Pure -- has to be loaded by object
10321 * added prems argument to simplification procedures;
10323 * HOL, FOL, ZF: added infix function `addsplits':
10324 instead of `<simpset> setloop (split_tac <thms>)'
10325 you can simply write `<simpset> addsplits <thms>'
10330 * TYPE('a) syntax for type reflection terms;
10332 * no longer handles consts with name "" -- declare as 'syntax' instead;
10334 * pretty printer: changed order of mixfix annotation preference (again!);
10336 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
10341 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
10342 with `addloop' of the simplifier to faciliate case splitting in premises.
10344 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
10346 * HOL/Auth: new protocol proofs including some for the Internet
10349 * HOL/Map: new theory of `maps' a la VDM;
10351 * HOL/simplifier: simplification procedures nat_cancel_sums for
10352 cancelling out common nat summands from =, <, <= (in)equalities, or
10353 differences; simplification procedures nat_cancel_factor for
10354 cancelling common factor from =, <, <= (in)equalities over natural
10355 sums; nat_cancel contains both kinds of procedures, it is installed by
10356 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
10358 * HOL/simplifier: terms of the form
10359 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
10361 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
10362 and those of the form
10363 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
10365 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
10368 Each datatype `t' now comes with a theorem `split_t_case' of the form
10370 P(t_case f1 ... fn x) =
10371 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
10373 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
10376 and a theorem `split_t_case_asm' of the form
10378 P(t_case f1 ... fn x) =
10379 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
10381 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
10383 which can be added to a simpset via `addsplits'. The existing theorems
10384 expand_list_case and expand_option_case have been renamed to
10385 split_list_case and split_option_case.
10388 - `pred n' is automatically converted to `n-1'.
10389 Users are strongly encouraged not to use `pred' any longer,
10390 because it will disappear altogether at some point.
10391 - Users are strongly encouraged to write "0 < n" rather than
10392 "n ~= 0". Theorems and proof tools have been modified towards this
10396 the function "set_of_list" has been renamed "set" (and its theorems too);
10397 the function "nth" now takes its arguments in the reverse order and
10398 has acquired the infix notation "!" as in "xs!n".
10400 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
10402 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
10403 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
10405 * HOL/record: extensible records with schematic structural subtyping
10406 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
10407 still lacks various theorems and concrete record syntax;
10412 * removed "axioms" and "generated by" sections;
10414 * replaced "ops" section by extended "consts" section, which is capable of
10415 handling the continuous function space "->" directly;
10418 . proves theorems immediately and stores them in the theory,
10419 . creates hierachical name space,
10420 . now uses normal mixfix annotations (instead of cinfix...),
10421 . minor changes to some names and values (for consistency),
10422 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
10423 . separator between mutual domain defs: changed "," to "and",
10424 . improved handling of sort constraints; now they have to
10425 appear on the left-hand side of the equations only;
10427 * fixed LAM <x,y,zs>.b syntax;
10429 * added extended adm_tac to simplifier in HOLCF -- can now discharge
10430 adm (%x. P (t x)), where P is chainfinite and t continuous;
10435 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
10436 with `addloop' of the simplifier to faciliate case splitting in premises.
10438 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
10439 in HOL, they strip ALL and --> from proved theorems;
10443 New in Isabelle94-8 (May 1997)
10444 ------------------------------
10446 *** General Changes ***
10448 * new utilities to build / run / maintain Isabelle etc. (in parts
10449 still somewhat experimental); old Makefiles etc. still functional;
10451 * new 'Isabelle System Manual';
10453 * INSTALL text, together with ./configure and ./build scripts;
10455 * reimplemented type inference for greater efficiency, better error
10456 messages and clean internal interface;
10458 * prlim command for dealing with lots of subgoals (an easier way of
10459 setting goals_limit);
10464 * supports alternative (named) syntax tables (parser and pretty
10465 printer); internal interface is provided by add_modesyntax(_i);
10467 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
10468 be used in conjunction with the Isabelle symbol font; uses the
10469 "symbols" syntax table;
10471 * added token_translation interface (may translate name tokens in
10472 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
10473 the current print_mode); IMPORTANT: user print translation functions
10474 are responsible for marking newly introduced bounds
10475 (Syntax.mark_boundT);
10477 * token translations for modes "xterm" and "xterm_color" that display
10478 names in bold, underline etc. or colors (which requires a color
10481 * infixes may now be declared with names independent of their syntax;
10483 * added typed_print_translation (like print_translation, but may
10484 access type of constant);
10487 *** Classical Reasoner ***
10489 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
10490 some limitations. Blast_tac...
10491 + ignores addss, addbefore, addafter; this restriction is intrinsic
10492 + ignores elimination rules that don't have the correct format
10493 (the conclusion MUST be a formula variable)
10494 + ignores types, which can make HOL proofs fail
10495 + rules must not require higher-order unification, e.g. apply_type in ZF
10496 [message "Function Var's argument not a bound variable" relates to this]
10497 + its proof strategy is more general but can actually be slower
10499 * substitution with equality assumptions no longer permutes other
10502 * minor changes in semantics of addafter (now called addaltern); renamed
10503 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
10504 (and access functions for it);
10506 * improved combination of classical reasoner and simplifier:
10507 + functions for handling clasimpsets
10508 + improvement of addss: now the simplifier is called _after_ the
10510 + safe variant of addss called addSss: uses safe simplifications
10511 _during_ the safe steps. It is more complete as it allows multiple
10512 instantiations of unknowns (e.g. with slow_tac).
10516 * added interface for simplification procedures (functions that
10517 produce *proven* rewrite rules on the fly, depending on current
10520 * ordering on terms as parameter (used for ordered rewriting);
10522 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
10524 * the solver is now split into a safe and an unsafe part.
10525 This should be invisible for the normal user, except that the
10526 functions setsolver and addsolver have been renamed to setSolver and
10527 addSolver; added safe_asm_full_simp_tac;
10532 * a generic induction tactic `induct_tac' which works for all datatypes and
10533 also for type `nat';
10535 * a generic case distinction tactic `exhaust_tac' which works for all
10536 datatypes and also for type `nat';
10538 * each datatype comes with a function `size';
10540 * patterns in case expressions allow tuple patterns as arguments to
10541 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
10543 * primrec now also works with type nat;
10545 * recdef: a new declaration form, allows general recursive functions to be
10546 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
10548 * the constant for negation has been renamed from "not" to "Not" to
10549 harmonize with FOL, ZF, LK, etc.;
10551 * HOL/ex/LFilter theory of a corecursive "filter" functional for
10554 * HOL/Modelcheck demonstrates invocation of model checker oracle;
10556 * HOL/ex/Ring.thy declares cring_simp, which solves equational
10557 problems in commutative rings, using axiomatic type classes for + and *;
10559 * more examples in HOL/MiniML and HOL/Auth;
10561 * more default rewrite rules for quantifiers, union/intersection;
10563 * a new constant `arbitrary == @x.False';
10565 * HOLCF/IOA replaces old HOL/IOA;
10567 * HOLCF changes: derived all rules and arities
10568 + axiomatic type classes instead of classes
10569 + typedef instead of faking type definitions
10570 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
10571 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
10572 + eliminated the types void, one, tr
10573 + use unit lift and bool lift (with translations) instead of one and tr
10574 + eliminated blift from Lift3.thy (use Def instead of blift)
10575 all eliminated rules are derived as theorems --> no visible changes ;
10580 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
10581 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
10582 as ZF_cs addSIs [equalityI];
10586 New in Isabelle94-7 (November 96)
10587 ---------------------------------
10589 * allowing negative levels (as offsets) in prlev and choplev;
10591 * super-linear speedup for large simplifications;
10593 * FOL, ZF and HOL now use miniscoping: rewriting pushes
10594 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
10595 FAIL); can suppress it using the command Delsimps (ex_simps @
10596 all_simps); De Morgan laws are also now included, by default;
10598 * improved printing of ==> : ~:
10600 * new object-logic "Sequents" adds linear logic, while replacing LK
10601 and Modal (thanks to Sara Kalvala);
10603 * HOL/Auth: correctness proofs for authentication protocols;
10605 * HOL: new auto_tac combines rewriting and classical reasoning (many
10606 examples on HOL/Auth);
10608 * HOL: new command AddIffs for declaring theorems of the form P=Q to
10609 the rewriter and classical reasoner simultaneously;
10611 * function uresult no longer returns theorems in "standard" format;
10612 regain previous version by: val uresult = standard o uresult;
10616 New in Isabelle94-6
10617 -------------------
10619 * oracles -- these establish an interface between Isabelle and trusted
10620 external reasoners, which may deliver results as theorems;
10622 * proof objects (in particular record all uses of oracles);
10624 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
10626 * "constdefs" section in theory files;
10628 * "primrec" section (HOL) no longer requires names;
10630 * internal type "tactic" now simply "thm -> thm Sequence.seq";
10634 New in Isabelle94-5
10635 -------------------
10637 * reduced space requirements;
10639 * automatic HTML generation from theories;
10641 * theory files no longer require "..." (quotes) around most types;
10643 * new examples, including two proofs of the Church-Rosser theorem;
10645 * non-curried (1994) version of HOL is no longer distributed;
10649 New in Isabelle94-4
10650 -------------------
10652 * greatly reduced space requirements;
10654 * theory files (.thy) no longer require \...\ escapes at line breaks;
10656 * searchable theorem database (see the section "Retrieving theorems" on
10657 page 8 of the Reference Manual);
10659 * new examples, including Grabczewski's monumental case study of the
10662 * The previous version of HOL renamed to Old_HOL;
10664 * The new version of HOL (previously called CHOL) uses a curried syntax
10665 for functions. Application looks like f a b instead of f(a,b);
10667 * Mutually recursive inductive definitions finally work in HOL;
10669 * In ZF, pattern-matching on tuples is now available in all abstractions and
10670 translates to the operator "split";
10674 New in Isabelle94-3
10675 -------------------
10677 * new infix operator, addss, allowing the classical reasoner to
10678 perform simplification at each step of its search. Example:
10679 fast_tac (cs addss ss)
10681 * a new logic, CHOL, the same as HOL, but with a curried syntax
10682 for functions. Application looks like f a b instead of f(a,b). Also pairs
10683 look like (a,b) instead of <a,b>;
10685 * PLEASE NOTE: CHOL will eventually replace HOL!
10687 * In CHOL, pattern-matching on tuples is now available in all abstractions.
10688 It translates to the operator "split". A new theory of integers is available;
10690 * In ZF, integer numerals now denote two's-complement binary integers.
10691 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
10693 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
10694 of the Axiom of Choice;
10698 New in Isabelle94-2
10699 -------------------
10701 * Significantly faster resolution;
10703 * the different sections in a .thy file can now be mixed and repeated
10706 * Database of theorems for FOL, HOL and ZF. New
10707 commands including qed, qed_goal and bind_thm store theorems in the database.
10709 * Simple database queries: return a named theorem (get_thm) or all theorems of
10710 a given theory (thms_of), or find out what theory a theorem was proved in
10713 * Bugs fixed in the inductive definition and datatype packages;
10715 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
10716 and HOL_dup_cs obsolete;
10718 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
10721 * Simpler definition of function space in ZF;
10723 * new results about cardinal and ordinal arithmetic in ZF;
10725 * 'subtype' facility in HOL for introducing new types as subsets of existing
10728 :mode=isabelle-news:wrap=hard:maxLineLen=72: