1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in this Isabelle version
5 ----------------------------
9 * Simplified subscripts within identifiers, using plain \<^sub>
10 instead of the second copy \<^isub> and \<^isup>. Superscripts are
11 only for literal tokens within notation; explicit mixfix annotations
12 for consts or fixed variables may be used as fall-back for unusual
13 names. Obsolete \<twosuperior> has been expanded to \<^sup>2 in
14 Isabelle/HOL. INCOMPATIBILITY, use "isabelle update_sub_sup" to
15 standardize symbols as a starting point for further manual cleanup.
16 The ML reference variable "legacy_isub_isup" may be set as temporary
17 workaround, to make the prover accept a subset of the old identifier
20 * Document antiquotations: term style "isub" has been renamed to
21 "sub". Minor INCOMPATIBILITY.
23 * Uniform management of "quick_and_dirty" as system option (see also
24 "isabelle options"), configuration option within the context (see also
25 Config.get in Isabelle/ML), and attribute in Isabelle/Isar. Minor
26 INCOMPATIBILITY, need to use more official Isabelle means to access
27 quick_and_dirty, instead of historical poking into mutable reference.
29 * Renamed command 'print_configs' to 'print_options'. Minor
32 * Sessions may be organized via 'chapter' specifications in the ROOT
33 file, which determines a two-level hierarchy of browser info. The old
34 tree-like organization via implicit sub-session relation, with its
35 tendency towards erratic fluctuation of URLs, has been discontinued.
36 The default chapter is "Unsorted". Potential INCOMPATIBILITY for HTML
37 presentation of theories.
39 * Discontinued obsolete 'uses' within theory header. Note that
40 commands like 'ML_file' work without separate declaration of file
41 dependencies. Minor INCOMPATIBILITY.
43 * Discontinued redundant 'use' command, which was superseded by
44 'ML_file' in Isabelle2013. Minor INCOMPATIBILITY.
46 * Updated and extended "isar-ref" and "implementation" manual,
47 eliminated old "ref" manual.
49 * Proper diagnostic command 'print_state'. Old 'pr' (with its
50 implicit change of some global references) is retained for now as
51 control command, e.g. for ProofGeneral 3.7.x.
53 * Discontinued 'print_drafts' command with its old-fashioned PS output
54 and Unix command-line print spooling. Minor INCOMPATIBILITY: use
55 'display_drafts' instead and print via the regular document viewer.
58 *** Prover IDE -- Isabelle/Scala/jEdit ***
60 * Improved "Theories" panel: Continuous checking of proof document
61 (visible and required parts) may be controlled explicitly, using check
62 box or shortcut "C+e ENTER". Individual theory nodes may be marked
63 explicitly as required and checked in full, using check box or
66 * Strictly monotonic document update, without premature cancelation of
67 running transactions that are still needed: avoid reset/restart of
68 such command executions while editing.
70 * Support for asynchronous print functions, as overlay to existing
73 * Support for automatic tools in HOL, which try to prove or disprove
74 toplevel theorem statements.
76 * Dockable window "Find" provides query operations for formal entities
77 (GUI front-end to 'find_theorems' command).
79 * Dockable window "Documentation" provides access to Isabelle
82 * Dockable window "Sledgehammer" manages asynchronous / parallel
83 sledgehammer runs over existing document sources, independently of
84 normal editing and checking process.
86 * Dockable window "Timing" provides an overview of relevant command
89 * Action isabelle.reset-font-size resets main text area font size
90 according to Isabelle/Scala plugin option "jedit_font_reset_size"
91 (cf. keyboard shortcut C+0).
93 * More reactive and less intrusive completion. Plain words need to be
94 at least 3 characters long to be completed (was 2 before). Symbols
95 are only completed in backslash forms, e.g. \forall or \<forall> that
96 both produce the Isabelle symbol \<forall> in its Unicode rendering.
98 * Improved support for Linux look-and-feel "GTK+", see also "Utilities
99 / Global Options / Appearance".
104 * Type theory is now immutable, without any special treatment of
105 drafts or linear updates (which could lead to "stale theory" errors in
106 the past). Discontinued obsolete operations like Theory.copy,
107 Theory.checkpoint, and the auxiliary type theory_ref. Minor
110 * System option "proofs" has been discontinued. Instead the global
111 state of Proofterm.proofs is persistently compiled into logic images
112 as required, notably HOL-Proofs. Users no longer need to change
113 Proofterm.proofs dynamically. Minor INCOMPATIBILITY.
115 * Syntax translation functions (print_translation etc.) always depend
116 on Proof.context. Discontinued former "(advanced)" option -- this is
117 now the default. Minor INCOMPATIBILITY.
119 * Target-sensitive commands 'interpretation' and 'sublocale'.
120 Particulary, 'interpretation' now allows for non-persistent
121 interpretation within "context ... begin ... end" blocks. See
122 "isar-ref" manual for details.
124 * Improved locales diagnostic command 'print_dependencies'.
126 * Discontinued obsolete 'axioms' command, which has been marked as
127 legacy since Isabelle2009-2. INCOMPATIBILITY, use 'axiomatization'
128 instead, while observing its uniform scope for polymorphism.
130 * Discontinued empty name bindings in 'axiomatization'.
133 * SELECT_GOAL now retains the syntactic context of the overall goal
134 state (schematic variables etc.). Potential INCOMPATIBILITY in rare
140 * Improved support for adhoc overloading of constants (see also
141 isar-ref manual and ~~/src/HOL/ex/Adhoc_Overloading_Examples.thy).
143 * Attibute 'code': 'code' now declares concrete and abstract code
144 equations uniformly. Use explicit 'code equation' and 'code abstract'
145 to distinguish both when desired.
148 - 'code_printing' unifies 'code_const' / 'code_type' / 'code_class' /
150 - 'code_identifier' declares name hints for arbitrary identifiers in
151 generated code, subsuming 'code_modulename'.
152 See the isar-ref manual for syntax diagrams, and the HOL theories
155 * Library/Polynomial.thy:
156 - Use lifting for primitive definitions.
157 - Explicit conversions from and to lists of coefficients, used for
159 - Replaced recursion operator poly_rec by fold_coeffs.
160 - Prefer pre-existing gcd operation for gcd.
162 poly_eq_iff ~> poly_eq_poly_eq_iff
164 expand_poly_eq ~> poly_eq_iff
167 * Reification and reflection:
168 - Reification is now directly available in HOL-Main in structure
170 - Reflection now handles multiple lists with variables also.
171 - The whole reflection stack has been decomposed into conversions.
174 * Weaker precendence of syntax for big intersection and union on sets,
175 in accordance with corresponding lattice operations. INCOMPATIBILITY.
177 * Nested case expressions are now translated in a separate check phase
178 rather than during parsing. The data for case combinators is separated
179 from the datatype package. The declaration attribute
180 "case_translation" can be used to register new case combinators:
182 declare [[case_translation case_combinator constructor1 ... constructorN]]
184 * Notation "{p:A. P}" now allows tuple patterns as well.
186 * Revised devices for recursive definitions over finite sets:
187 - Only one fundamental fold combinator on finite set remains:
188 Finite_Set.fold :: ('a => 'b => 'b) => 'b => 'a set => 'b
189 This is now identity on infinite sets.
190 - Locales ("mini packages") for fundamental definitions with
191 Finite_Set.fold: folding, folding_idem.
192 - Locales comm_monoid_set, semilattice_order_set and
193 semilattice_neutr_order_set for big operators on sets.
194 See theory Big_Operators for canonical examples.
195 Note that foundational constants comm_monoid_set.F and
196 semilattice_set.F correspond to former combinators fold_image
197 and fold1 respectively. These are now gone. You may use
198 those foundational constants as substitutes, but it is
199 preferable to interpret the above locales accordingly.
200 - Dropped class ab_semigroup_idem_mult (special case of lattice,
201 no longer needed in connection with Finite_Set.fold etc.)
203 card.union_inter ~> card_Un_Int [symmetric]
204 card.union_disjoint ~> card_Un_disjoint
207 * Locale hierarchy for abstract orderings and (semi)lattices.
209 * Discontinued theory src/HOL/Library/Eval_Witness.
212 * Discontinued obsolete src/HOL/IsaMakefile (considered legacy since
213 Isabelle2013). Use "isabelle build" to operate on Isabelle sessions.
215 * Numeric types mapped by default to target language numerals: natural
216 (replaces former code_numeral) and integer (replaces former code_int).
217 Conversions are available as integer_of_natural / natural_of_integer /
218 integer_of_nat / nat_of_integer (in HOL) and
219 Code_Numeral.integer_of_natural / Code_Numeral.natural_of_integer (in
220 ML). INCOMPATIBILITY.
222 * Discontinued theories Code_Integer and Efficient_Nat by a more
223 fine-grain stack of theories Code_Target_Int, Code_Binary_Nat,
224 Code_Target_Nat and Code_Target_Numeral. See the tutorial on code
225 generation for details. INCOMPATIBILITY.
227 * Introduce type class "conditionally_complete_lattice": Like a
228 complete lattice but does not assume the existence of the top and
229 bottom elements. Allows to generalize some lemmas about reals and
230 extended reals. Removed SupInf and replaced it by the instantiation
231 of conditionally_complete_lattice for real. Renamed lemmas about
232 conditionally-complete lattice from Sup_... to cSup_... and from
233 Inf_... to cInf_... to avoid hidding of similar complete lattice
236 * Introduce type class linear_continuum as combination of
237 conditionally-complete lattices and inner dense linorders which have
238 more than one element. INCOMPATIBILITY.
240 * Introduce type classes "no_top" and "no_bot" for orderings without
241 top and bottom elements.
243 * Split dense_linorder into inner_dense_order and no_top, no_bot.
245 * Complex_Main: Unify and move various concepts from
246 HOL-Multivariate_Analysis to HOL-Complex_Main.
248 - Introduce type class (lin)order_topology and linear_continuum_topology.
249 Allows to generalize theorems about limits and order.
250 Instances are reals and extended reals.
252 - continuous and continuos_on from Multivariate_Analysis:
253 "continuous" is the continuity of a function at a filter.
254 "isCont" is now an abbrevitation: "isCont x f == continuous (at _) f".
256 Generalized continuity lemmas from isCont to continuous on an arbitrary
259 - compact from Multivariate_Analysis. Use Bolzano's lemma
260 to prove compactness of closed intervals on reals. Continuous functions
261 attain infimum and supremum on compact sets. The inverse of a continuous
262 function is continuous, when the function is continuous on a compact set.
264 - connected from Multivariate_Analysis. Use it to prove the
265 intermediate value theorem. Show connectedness of intervals on
266 linear_continuum_topology).
268 - first_countable_topology from Multivariate_Analysis. Is used to
269 show equivalence of properties on the neighbourhood filter of x and on
270 all sequences converging to x.
272 - FDERIV: Definition of has_derivative moved to Deriv.thy. Moved theorems
273 from Library/FDERIV.thy to Deriv.thy and base the definition of DERIV on
274 FDERIV. Add variants of DERIV and FDERIV which are restricted to sets,
275 i.e. to represent derivatives from left or right.
277 - Removed the within-filter. It is replaced by the principal filter:
279 F within X = inf F (principal X)
281 - Introduce "at x within U" as a single constant, "at x" is now an
282 abbreviation for "at x within UNIV"
284 - Introduce named theorem collections tendsto_intros, continuous_intros,
285 continuous_on_intros and FDERIV_intros. Theorems in tendsto_intros (or
286 FDERIV_intros) are also available as tendsto_eq_intros (or
287 FDERIV_eq_intros) where the right-hand side is replaced by a congruence
288 rule. This allows to apply them as intro rules and then proving
289 equivalence by the simplifier.
291 - Restructured theories in HOL-Complex_Main:
293 + Moved RealDef and RComplete into Real
295 + Introduced Topological_Spaces and moved theorems about
296 topological spaces, filters, limits and continuity to it
298 + Renamed RealVector to Real_Vector_Spaces
300 + Split Lim, SEQ, Series into Topological_Spaces, Real_Vector_Spaces, and
303 + Moved Ln and Log to Transcendental
305 + Moved theorems about continuity from Deriv to Topological_Spaces
307 - Remove various auxiliary lemmas.
311 * Consolidation of library theories on product orders:
313 Product_Lattice ~> Product_Order -- pointwise order on products
314 Product_ord ~> Product_Lexorder -- lexicographic order on products
321 isar_shrink ~> isar_compress
323 * Imperative-HOL: The MREC combinator is considered legacy and no
324 longer included by default. INCOMPATIBILITY, use partial_function
325 instead, or import theory Legacy_Mrec as a fallback.
327 * HOL-Algebra: Discontinued theories src/HOL/Algebra/abstract and
328 .../poly. Existing theories should be based on
329 src/HOL/Library/Polynomial instead. The latter provides integration
330 with HOL's type classes for rings. INCOMPATIBILITY.
335 * Spec_Check is a Quickcheck tool for Isabelle/ML. The ML function
336 "check_property" allows to check specifications of the form "ALL x y
337 z. prop x y z". See also ~~/src/Tools/Spec_Check/ with its
338 Examples.thy in particular.
340 * More uniform naming of goal functions for skipped proofs:
342 Skip_Proof.prove ~> Goal.prove_sorry
343 Skip_Proof.prove_global ~> Goal.prove_sorry_global
345 * Antiquotation @{theory_context A} is similar to @{theory A}, but
346 presents the result as initial Proof.context.
348 * Modifiers for classical wrappers (e.g. addWrapper, delWrapper)
349 operate on Proof.context instead of claset, for uniformity with addIs,
350 addEs, addDs etc. Note that claset_of and put_claset allow to manage
351 clasets separately from the context.
353 * Simplifier tactics and tools use proper Proof.context instead of
354 historic type simpset. Old-style declarations like addsimps,
355 addsimprocs etc. operate directly on Proof.context. Raw type simpset
356 retains its use as snapshot of the main Simplifier context, using
357 simpset_of and put_simpset on Proof.context. INCOMPATIBILITY -- port
358 old tools by making them depend on (ctxt : Proof.context) instead of
359 (ss : simpset), then turn (simpset_of ctxt) into ctxt.
361 * Discontinued obsolete ML antiquotations @{claset} and @{simpset}.
362 INCOMPATIBILITY, use @{context} instead.
367 * Discontinued obsolete isabelle usedir, mkdir, make -- superseded by
368 "isabelle build" in Isabelle2013. INCOMPATIBILITY.
370 * Discontinued obsolete isabelle-process options -f and -u (former
371 administrative aliases of option -e). Minor INCOMPATIBILITY.
373 * Discontinued obsolete isabelle print tool, and PRINT_COMMAND
376 * Discontinued ISABELLE_DOC_FORMAT settings variable and historic
377 document formats: dvi.gz, ps, ps.gz -- the default document format is
380 * Isabelle settings variable ISABELLE_BUILD_JAVA_OPTIONS allows to
381 specify global resources of the JVM process run by isabelle build.
383 * Toplevel executable $ISABELLE_HOME/bin/isabelle_scala_script allows
384 to run Isabelle/Scala source files as standalone programs.
386 * Improved "isabelle keywords" tool (for old-style ProofGeneral
387 keyword tables): use Isabelle/Scala operations, which inspect outer
388 syntax without requiring to build sessions first.
392 New in Isabelle2013 (February 2013)
393 -----------------------------------
397 * Theorem status about oracles and unfinished/failed future proofs is
398 no longer printed by default, since it is incompatible with
399 incremental / parallel checking of the persistent document model. ML
400 function Thm.peek_status may be used to inspect a snapshot of the
401 ongoing evaluation process. Note that in batch mode --- notably
402 isabelle build --- the system ensures that future proofs of all
403 accessible theorems in the theory context are finished (as before).
405 * Configuration option show_markup controls direct inlining of markup
406 into the printed representation of formal entities --- notably type
407 and sort constraints. This enables Prover IDE users to retrieve that
408 information via tooltips in the output window, for example.
410 * Command 'ML_file' evaluates ML text from a file directly within the
411 theory, without any predeclaration via 'uses' in the theory header.
413 * Old command 'use' command and corresponding keyword 'uses' in the
414 theory header are legacy features and will be discontinued soon.
415 Tools that load their additional source files may imitate the
416 'ML_file' implementation, such that the system can take care of
417 dependencies properly.
419 * Discontinued obsolete method fastsimp / tactic fast_simp_tac, which
420 is called fastforce / fast_force_tac already since Isabelle2011-1.
422 * Updated and extended "isar-ref" and "implementation" manual, reduced
423 remaining material in old "ref" manual.
425 * Improved support for auxiliary contexts that indicate block structure
426 for specifications. Nesting of "context fixes ... context assumes ..."
427 and "class ... context ...".
429 * Attribute "consumes" allows a negative value as well, which is
430 interpreted relatively to the total number of premises of the rule in
431 the target context. This form of declaration is stable when exported
432 from a nested 'context' with additional assumptions. It is the
433 preferred form for definitional packages, notably cases/rules produced
434 in HOL/inductive and HOL/function.
436 * More informative error messages for Isar proof commands involving
437 lazy enumerations (method applications etc.).
439 * Refined 'help' command to retrieve outer syntax commands according
440 to name patterns (with clickable results).
443 *** Prover IDE -- Isabelle/Scala/jEdit ***
445 * Parallel terminal proofs ('by') are enabled by default, likewise
446 proofs that are built into packages like 'datatype', 'function'. This
447 allows to "run ahead" checking the theory specifications on the
448 surface, while the prover is still crunching on internal
449 justifications. Unfinished / cancelled proofs are restarted as
450 required to complete full proof checking eventually.
452 * Improved output panel with tooltips, hyperlinks etc. based on the
453 same Rich_Text_Area as regular Isabelle/jEdit buffers. Activation of
454 tooltips leads to some window that supports the same recursively,
455 which can lead to stacks of tooltips as the semantic document content
456 is explored. ESCAPE closes the whole stack, individual windows may be
457 closed separately, or detached to become independent jEdit dockables.
459 * Improved support for commands that produce graph output: the text
460 message contains a clickable area to open a new instance of the graph
463 * More robust incremental parsing of outer syntax (partial comments,
464 malformed symbols). Changing the balance of open/close quotes and
465 comment delimiters works more conveniently with unfinished situations
466 that frequently occur in user interaction.
468 * More efficient painting and improved reactivity when editing large
469 files. More scalable management of formal document content.
471 * Smarter handling of tracing messages: prover process pauses after
472 certain number of messages per command transaction, with some user
473 dialog to stop or continue. This avoids swamping the front-end with
474 potentially infinite message streams.
476 * More plugin options and preferences, based on Isabelle/Scala. The
477 jEdit plugin option panel provides access to some Isabelle/Scala
478 options, including tuning parameters for editor reactivity and color
481 * Dockable window "Symbols" provides some editing support for Isabelle
484 * Dockable window "Monitor" shows ML runtime statistics. Note that
485 continuous display of the chart slows down the system.
487 * Improved editing support for control styles: subscript, superscript,
488 bold, reset of style -- operating on single symbols or text
489 selections. Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT.
491 * Actions isabelle.increase-font-size and isabelle.decrease-font-size
492 adjust the main text area font size, and its derivatives for output,
493 tooltips etc. Cf. keyboard shortcuts C-PLUS and C-MINUS, which often
494 need to be adapted to local keyboard layouts.
496 * More reactive completion popup by default: use \t (TAB) instead of
497 \n (NEWLINE) to minimize intrusion into regular flow of editing. See
498 also "Plugin Options / SideKick / General / Code Completion Options".
500 * Implicit check and build dialog of the specified logic session
501 image. For example, HOL, HOLCF, HOL-Nominal can be produced on
502 demand, without bundling big platform-dependent heap images in the
503 Isabelle distribution.
505 * Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates
506 from Oracle provide better multi-platform experience. This version is
507 now bundled exclusively with Isabelle.
512 * Code generation for Haskell: restrict unqualified imports from
513 Haskell Prelude to a small set of fundamental operations.
515 * Command 'export_code': relative file names are interpreted
516 relatively to master directory of current theory rather than the
517 rather arbitrary current working directory. INCOMPATIBILITY.
519 * Discontinued obsolete attribute "COMP". Potential INCOMPATIBILITY,
520 use regular rule composition via "OF" / "THEN", or explicit proof
521 structure instead. Note that Isabelle/ML provides a variety of
522 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied
523 with some care where this is really required.
525 * Command 'typ' supports an additional variant with explicit sort
526 constraint, to infer and check the most general type conforming to a
527 given sort. Example (in HOL):
529 typ "_ * _ * bool * unit" :: finite
531 * Command 'locale_deps' visualizes all locales and their relations as
539 - Added MaSh relevance filter based on machine-learning; see the
540 Sledgehammer manual for details.
541 - Polished Isar proofs generated with "isar_proofs" option.
542 - Rationalized type encodings ("type_enc" option).
543 - Renamed "kill_provers" subcommand to "kill_all".
545 isar_proof ~> isar_proofs
546 isar_shrink_factor ~> isar_shrink
547 max_relevant ~> max_facts
548 relevance_thresholds ~> fact_thresholds
550 * Quickcheck: added an optimisation for equality premises. It is
551 switched on by default, and can be switched off by setting the
552 configuration quickcheck_optimise_equality to false.
554 * Quotient: only one quotient can be defined by quotient_type
558 - generation of an abstraction function equation in lift_definition
560 - renamed no_abs_code -> no_code (INCOMPATIBILITY.)
562 * Simproc "finite_Collect" rewrites set comprehensions into pointfree
565 * Preprocessing of the code generator rewrites set comprehensions into
566 pointfree expressions.
568 * The SMT solver Z3 has now by default a restricted set of directly
569 supported features. For the full set of features (div/mod, nonlinear
570 arithmetic, datatypes/records) with potential proof reconstruction
571 failures, enable the configuration option "z3_with_extensions". Minor
574 * Simplified 'typedef' specifications: historical options for implicit
575 set definition and alternative name have been discontinued. The
576 former behavior of "typedef (open) t = A" is now the default, but
577 written just "typedef t = A". INCOMPATIBILITY, need to adapt theories
580 * Removed constant "chars"; prefer "Enum.enum" on type "char"
581 directly. INCOMPATIBILITY.
583 * Moved operation product, sublists and n_lists from theory Enum to
584 List. INCOMPATIBILITY.
586 * Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY.
588 * Class "comm_monoid_diff" formalises properties of bounded
589 subtraction, with natural numbers and multisets as typical instances.
591 * Added combinator "Option.these" with type "'a option set => 'a set".
593 * Theory "Transitive_Closure": renamed lemmas
595 reflcl_tranclp -> reflclp_tranclp
596 rtranclp_reflcl -> rtranclp_reflclp
600 * Theory "Rings": renamed lemmas (in class semiring)
602 left_distrib ~> distrib_right
603 right_distrib ~> distrib_left
607 * Generalized the definition of limits:
609 - Introduced the predicate filterlim (LIM x F. f x :> G) which
610 expresses that when the input values x converge to F then the
611 output f x converges to G.
613 - Added filters for convergence to positive (at_top) and negative
616 - Moved infinity in the norm (at_infinity) from
617 Multivariate_Analysis to Complex_Main.
619 - Removed real_tendsto_inf, it is superseded by "LIM x F. f x :>
624 * Theory "Library/Option_ord" provides instantiation of option type to
625 lattice type classes.
627 * Theory "Library/Multiset": renamed
629 constant fold_mset ~> Multiset.fold
630 fact fold_mset_commute ~> fold_mset_comm
634 * Renamed theory Library/List_Prefix to Library/Sublist, with related
637 - Renamed constants (and related lemmas)
640 strict_prefix ~> prefix
642 - Replaced constant "postfix" by "suffixeq" with swapped argument
643 order (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped
644 old infix syntax "xs >>= ys"; use "suffixeq ys xs" instead.
645 Renamed lemmas accordingly.
647 - Added constant "list_hembeq" for homeomorphic embedding on
648 lists. Added abbreviation "sublisteq" for special case
649 "list_hembeq (op =)".
651 - Theory Library/Sublist no longer provides "order" and "bot" type
652 class instances for the prefix order (merely corresponding locale
653 interpretations). The type class instances are now in theory
654 Library/Prefix_Order.
656 - The sublist relation of theory Library/Sublist_Order is now based
657 on "Sublist.sublisteq". Renamed lemmas accordingly:
659 le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff
660 le_list_append_mono ~> Sublist.list_hembeq_append_mono
661 le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2
662 le_list_Cons_EX ~> Sublist.list_hembeq_ConsD
663 le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2'
664 le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq
665 le_list_drop_Cons ~> Sublist.sublisteq_Cons'
666 le_list_drop_many ~> Sublist.sublisteq_drop_many
667 le_list_filter_left ~> Sublist.sublisteq_filter_left
668 le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many
669 le_list_rev_take_iff ~> Sublist.sublisteq_append
670 le_list_same_length ~> Sublist.sublisteq_same_length
671 le_list_take_many_iff ~> Sublist.sublisteq_append'
672 less_eq_list.drop ~> less_eq_list_drop
673 less_eq_list.induct ~> less_eq_list_induct
674 not_le_list_length ~> Sublist.not_sublisteq_length
678 * New theory Library/Countable_Set.
680 * Theory Library/Debug and Library/Parallel provide debugging and
681 parallel execution for code generated towards Isabelle/ML.
683 * Theory Library/FuncSet: Extended support for Pi and extensional and
684 introduce the extensional dependent function space "PiE". Replaced
685 extensional_funcset by an abbreviation, and renamed lemmas from
686 extensional_funcset to PiE as follows:
688 extensional_empty ~> PiE_empty
689 extensional_funcset_empty_domain ~> PiE_empty_domain
690 extensional_funcset_empty_range ~> PiE_empty_range
691 extensional_funcset_arb ~> PiE_arb
692 extensional_funcset_mem ~> PiE_mem
693 extensional_funcset_extend_domainI ~> PiE_fun_upd
694 extensional_funcset_restrict_domain ~> fun_upd_in_PiE
695 extensional_funcset_extend_domain_eq ~> PiE_insert_eq
696 card_extensional_funcset ~> card_PiE
697 finite_extensional_funcset ~> finite_PiE
701 * Theory Library/FinFun: theory of almost everywhere constant
702 functions (supersedes the AFP entry "Code Generation for Functions as
705 * Theory Library/Phantom: generic phantom type to make a type
706 parameter appear in a constant's type. This alternative to adding
707 TYPE('a) as another parameter avoids unnecessary closures in generated
710 * Theory Library/RBT_Impl: efficient construction of red-black trees
711 from sorted associative lists. Merging two trees with rbt_union may
712 return a structurally different tree than before. Potential
715 * Theory Library/IArray: immutable arrays with code generation.
717 * Theory Library/Finite_Lattice: theory of finite lattices.
719 * HOL/Multivariate_Analysis: replaced
721 "basis :: 'a::euclidean_space => nat => real"
722 "\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space"
724 on euclidean spaces by using the inner product "_ \<bullet> _" with
725 vectors from the Basis set: "\<Chi>\<Chi> i. f i" is superseded by
726 "SUM i : Basis. f i * r i".
728 With this change the following constants are also changed or removed:
730 DIM('a) :: nat ~> card (Basis :: 'a set) (is an abbreviation)
731 a $$ i ~> inner a i (where i : Basis)
733 \<pi>, \<pi>' removed
735 Theorems about these constants where removed.
739 component_le_norm ~> Basis_le_norm
740 euclidean_eq ~> euclidean_eq_iff
741 differential_zero_maxmin_component ~> differential_zero_maxmin_cart
742 euclidean_simps ~> inner_simps
743 independent_basis ~> independent_Basis
744 span_basis ~> span_Basis
745 in_span_basis ~> in_span_Basis
746 norm_bound_component_le ~> norm_boound_Basis_le
747 norm_bound_component_lt ~> norm_boound_Basis_lt
748 component_le_infnorm ~> Basis_le_infnorm
754 - Added simproc "measurable" to automatically prove measurability.
756 - Added induction rules for sigma sets with disjoint union
757 (sigma_sets_induct_disjoint) and for Borel-measurable functions
758 (borel_measurable_induct).
760 - Added the Daniell-Kolmogorov theorem (the existence the limit of a
763 * HOL/Cardinals: Theories of ordinals and cardinals (supersedes the
764 AFP entry "Ordinals_and_Cardinals").
766 * HOL/BNF: New (co)datatype package based on bounded natural functors
767 with support for mixed, nested recursion and interesting non-free
770 * HOL/Finite_Set and Relation: added new set and relation operations
771 expressed by Finite_Set.fold.
773 * New theory HOL/Library/RBT_Set: implementation of sets by red-black
774 trees for the code generator.
776 * HOL/Library/RBT and HOL/Library/Mapping have been converted to
778 possible INCOMPATIBILITY.
780 * HOL/Set: renamed Set.project -> Set.filter
784 *** Document preparation ***
786 * Dropped legacy antiquotations "term_style" and "thm_style", since
787 styles may be given as arguments to "term" and "thm" already.
788 Discontinued legacy styles "prem1" .. "prem19".
790 * Default LaTeX rendering for \<euro> is now based on eurosym package,
791 instead of slightly exotic babel/greek.
793 * Document variant NAME may use different LaTeX entry point
794 document/root_NAME.tex if that file exists, instead of the common
797 * Simplified custom document/build script, instead of old-style
798 document/IsaMakefile. Minor INCOMPATIBILITY.
803 * The default limit for maximum number of worker threads is now 8,
804 instead of 4, in correspondence to capabilities of contemporary
805 hardware and Poly/ML runtime system.
807 * Type Seq.results and related operations support embedded error
808 messages within lazy enumerations, and thus allow to provide
809 informative errors in the absence of any usable results.
811 * Renamed Position.str_of to Position.here to emphasize that this is a
812 formal device to inline positions into message text, but not
813 necessarily printing visible text.
818 * Advanced support for Isabelle sessions and build management, see
819 "system" manual for the chapter of that name, especially the "isabelle
820 build" tool and its examples. The "isabelle mkroot" tool prepares
821 session root directories for use with "isabelle build", similar to
822 former "isabelle mkdir" for "isabelle usedir". Note that this affects
823 document preparation as well. INCOMPATIBILITY, isabelle usedir /
824 mkdir / make are rendered obsolete.
826 * Discontinued obsolete Isabelle/build script, it is superseded by the
827 regular isabelle build tool. For example:
829 isabelle build -s -b HOL
831 * Discontinued obsolete "isabelle makeall".
833 * Discontinued obsolete IsaMakefile and ROOT.ML files from the
834 Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that
835 provides some traditional targets that invoke "isabelle build". Note
836 that this is inefficient! Applications of Isabelle/HOL involving
837 "isabelle make" should be upgraded to use "isabelle build" directly.
839 * The "isabelle options" tool prints Isabelle system options, as
840 required for "isabelle build", for example.
842 * The "isabelle logo" tool produces EPS and PDF format simultaneously.
843 Minor INCOMPATIBILITY in command-line options.
845 * The "isabelle install" tool has now a simpler command-line. Minor
848 * The "isabelle components" tool helps to resolve add-on components
849 that are not bundled, or referenced from a bare-bones repository
852 * Settings variable ISABELLE_PLATFORM_FAMILY refers to the general
853 platform family: "linux", "macos", "windows".
855 * The ML system is configured as regular component, and no longer
856 picked up from some surrounding directory. Potential INCOMPATIBILITY
857 for home-made settings.
859 * Improved ML runtime statistics (heap, threads, future tasks etc.).
861 * Discontinued support for Poly/ML 5.2.1, which was the last version
862 without exception positions and advanced ML compiler/toplevel
865 * Discontinued special treatment of Proof General -- no longer guess
866 PROOFGENERAL_HOME based on accidental file-system layout. Minor
867 INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS
868 settings manually, or use a Proof General version that has been
869 bundled as Isabelle component.
873 New in Isabelle2012 (May 2012)
874 ------------------------------
878 * Prover IDE (PIDE) improvements:
880 - more robust Sledgehammer integration (as before the sledgehammer
881 command-line needs to be typed into the source buffer)
882 - markup for bound variables
883 - markup for types of term variables (displayed as tooltips)
884 - support for user-defined Isar commands within the running session
885 - improved support for Unicode outside original 16bit range
886 e.g. glyph for \<A> (thanks to jEdit 4.5.1)
888 * Forward declaration of outer syntax keywords within the theory
889 header -- minor INCOMPATIBILITY for user-defined commands. Allow new
890 commands to be used in the same theory where defined.
892 * Auxiliary contexts indicate block structure for specifications with
893 additional parameters and assumptions. Such unnamed contexts may be
894 nested within other targets, like 'theory', 'locale', 'class',
895 'instantiation' etc. Results from the local context are generalized
896 accordingly and applied to the enclosing target context. Example:
900 assumes xy: "x = y" and yz: "y = z"
903 lemma my_trans: "x = z" using xy yz by simp
909 The most basic application is to factor-out context elements of
910 several fixes/assumes/shows theorem statements, e.g. see
911 ~~/src/HOL/Isar_Examples/Group_Context.thy
913 Any other local theory specification element works within the "context
914 ... begin ... end" block as well.
916 * Bundled declarations associate attributed fact expressions with a
917 given name in the context. These may be later included in other
918 contexts. This allows to manage context extensions casually, without
919 the logical dependencies of locales and locale interpretation. See
920 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.
922 * Commands 'lemmas' and 'theorems' allow local variables using 'for'
923 declaration, and results are standardized before being stored. Thus
924 old-style "standard" after instantiation or composition of facts
925 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of
926 indices of schematic variables.
928 * Rule attributes in local theory declarations (e.g. locale or class)
929 are now statically evaluated: the resulting theorem is stored instead
930 of the original expression. INCOMPATIBILITY in rare situations, where
931 the historic accident of dynamic re-evaluation in interpretations
934 * New tutorial "Programming and Proving in Isabelle/HOL"
935 ("prog-prove"). It completely supersedes "A Tutorial Introduction to
936 Structured Isar Proofs" ("isar-overview"), which has been removed. It
937 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order
938 Logic" as the recommended beginners tutorial, but does not cover all
939 of the material of that old tutorial.
941 * Updated and extended reference manuals: "isar-ref",
942 "implementation", "system"; reduced remaining material in old "ref"
948 * Command 'definition' no longer exports the foundational "raw_def"
949 into the user context. Minor INCOMPATIBILITY, may use the regular
950 "def" result with attribute "abs_def" to imitate the old version.
952 * Attribute "abs_def" turns an equation of the form "f x y == t" into
953 "f == %x y. t", which ensures that "simp" or "unfold" steps always
954 expand it. This also works for object-logic equality. (Formerly
955 undocumented feature.)
957 * Sort constraints are now propagated in simultaneous statements, just
958 like type constraints. INCOMPATIBILITY in rare situations, where
959 distinct sorts used to be assigned accidentally. For example:
961 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"
963 lemma "P (x::'a)" and "Q (y::'a::bar)"
964 -- "now uniform 'a::bar instead of default sort for first occurrence (!)"
966 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more
967 tolerant against multiple unifiers, as long as the final result is
968 unique. (As before, rules are composed in canonical right-to-left
969 order to accommodate newly introduced premises.)
971 * Renamed some inner syntax categories:
977 Minor INCOMPATIBILITY. Note that in practice "num_const" or
978 "num_position" etc. are mainly used instead (which also include
979 position information via constraints).
981 * Simplified configuration options for syntax ambiguity: see
982 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
983 manual. Minor INCOMPATIBILITY.
985 * Discontinued configuration option "syntax_positions": atomic terms
986 in parse trees are always annotated by position constraints.
988 * Old code generator for SML and its commands 'code_module',
989 'code_library', 'consts_code', 'types_code' have been discontinued.
990 Use commands of the generic code generator instead. INCOMPATIBILITY.
992 * Redundant attribute "code_inline" has been discontinued. Use
993 "code_unfold" instead. INCOMPATIBILITY.
995 * Dropped attribute "code_unfold_post" in favor of the its dual
996 "code_abbrev", which yields a common pattern in definitions like
998 definition [code_abbrev]: "f = t"
1002 * Obsolete 'types' command has been discontinued. Use 'type_synonym'
1003 instead. INCOMPATIBILITY.
1005 * Discontinued old "prems" fact, which used to refer to the accidental
1006 collection of foundational premises in the context (already marked as
1007 legacy since Isabelle2011).
1012 * Type 'a set is now a proper type constructor (just as before
1013 Isabelle2008). Definitions mem_def and Collect_def have disappeared.
1014 Non-trivial INCOMPATIBILITY. For developments keeping predicates and
1015 sets separate, it is often sufficient to rephrase some set S that has
1016 been accidentally used as predicates by "%x. x : S", and some
1017 predicate P that has been accidentally used as set by "{x. P x}".
1018 Corresponding proofs in a first step should be pruned from any
1019 tinkering with former theorems mem_def and Collect_def as far as
1022 For developments which deliberately mix predicates and sets, a
1023 planning step is necessary to determine what should become a predicate
1024 and what a set. It can be helpful to carry out that step in
1025 Isabelle2011-1 before jumping right into the current release.
1027 * Code generation by default implements sets as container type rather
1028 than predicates. INCOMPATIBILITY.
1030 * New type synonym 'a rel = ('a * 'a) set
1032 * The representation of numerals has changed. Datatype "num"
1033 represents strictly positive binary numerals, along with functions
1034 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent
1035 positive and negated numeric literals, respectively. See also
1036 definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some
1037 user theories may require adaptations as follows:
1039 - Theorems with number_ring or number_semiring constraints: These
1040 classes are gone; use comm_ring_1 or comm_semiring_1 instead.
1042 - Theories defining numeric types: Remove number, number_semiring,
1043 and number_ring instances. Defer all theorems about numerals until
1044 after classes one and semigroup_add have been instantiated.
1046 - Numeral-only simp rules: Replace each rule having a "number_of v"
1047 pattern with two copies, one for numeral and one for neg_numeral.
1049 - Theorems about subclasses of semiring_1 or ring_1: These classes
1050 automatically support numerals now, so more simp rules and
1051 simprocs may now apply within the proof.
1053 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:
1054 Redefine using other integer operations.
1056 * Transfer: New package intended to generalize the existing
1057 "descending" method and related theorem attributes from the Quotient
1058 package. (Not all functionality is implemented yet, but future
1059 development will focus on Transfer as an eventual replacement for the
1060 corresponding parts of the Quotient package.)
1062 - transfer_rule attribute: Maintains a collection of transfer rules,
1063 which relate constants at two different types. Transfer rules may
1064 relate different type instances of the same polymorphic constant,
1065 or they may relate an operation on a raw type to a corresponding
1066 operation on an abstract type (quotient or subtype). For example:
1068 ((A ===> B) ===> list_all2 A ===> list_all2 B) map map
1069 (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int
1071 - transfer method: Replaces a subgoal on abstract types with an
1072 equivalent subgoal on the corresponding raw types. Constants are
1073 replaced with corresponding ones according to the transfer rules.
1074 Goals are generalized over all free variables by default; this is
1075 necessary for variables whose types change, but can be overridden
1076 for specific variables with e.g. "transfer fixing: x y z". The
1077 variant transfer' method allows replacing a subgoal with one that
1078 is logically stronger (rather than equivalent).
1080 - relator_eq attribute: Collects identity laws for relators of
1081 various type constructors, e.g. "list_all2 (op =) = (op =)". The
1082 transfer method uses these lemmas to infer transfer rules for
1083 non-polymorphic constants on the fly.
1085 - transfer_prover method: Assists with proving a transfer rule for a
1086 new constant, provided the constant is defined in terms of other
1087 constants that already have transfer rules. It should be applied
1088 after unfolding the constant definitions.
1090 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer
1091 from type nat to type int.
1093 * Lifting: New package intended to generalize the quotient_definition
1094 facility of the Quotient package; designed to work with Transfer.
1096 - lift_definition command: Defines operations on an abstract type in
1097 terms of a corresponding operation on a representation
1098 type. Example syntax:
1100 lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"
1103 Users must discharge a respectfulness proof obligation when each
1104 constant is defined. (For a type copy, i.e. a typedef with UNIV,
1105 the proof is discharged automatically.) The obligation is
1106 presented in a user-friendly, readable form; a respectfulness
1107 theorem in the standard format and a transfer rule are generated
1110 - Integration with code_abstype: For typedefs (e.g. subtypes
1111 corresponding to a datatype invariant, such as dlist),
1112 lift_definition generates a code certificate theorem and sets up
1113 code generation for each constant.
1115 - setup_lifting command: Sets up the Lifting package to work with a
1116 user-defined type. The user must provide either a quotient theorem
1117 or a type_definition theorem. The package configures transfer
1118 rules for equality and quantifiers on the type, and sets up the
1119 lift_definition command to work with the type.
1121 - Usage examples: See Quotient_Examples/Lift_DList.thy,
1122 Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,
1123 Word/Word.thy and Library/Float.thy.
1127 - The 'quotient_type' command now supports a 'morphisms' option with
1128 rep and abs functions, similar to typedef.
1130 - 'quotient_type' sets up new types to work with the Lifting and
1131 Transfer packages, as with 'setup_lifting'.
1133 - The 'quotient_definition' command now requires the user to prove a
1134 respectfulness property at the point where the constant is
1135 defined, similar to lift_definition; INCOMPATIBILITY.
1137 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems
1138 accordingly, INCOMPATIBILITY.
1140 * New diagnostic command 'find_unused_assms' to find potentially
1141 superfluous assumptions in theorems using Quickcheck.
1145 - Quickcheck returns variable assignments as counterexamples, which
1146 allows to reveal the underspecification of functions under test.
1147 For example, refuting "hd xs = x", it presents the variable
1148 assignment xs = [] and x = a1 as a counterexample, assuming that
1149 any property is false whenever "hd []" occurs in it.
1151 These counterexample are marked as potentially spurious, as
1152 Quickcheck also returns "xs = []" as a counterexample to the
1153 obvious theorem "hd xs = hd xs".
1155 After finding a potentially spurious counterexample, Quickcheck
1156 continues searching for genuine ones.
1158 By default, Quickcheck shows potentially spurious and genuine
1159 counterexamples. The option "genuine_only" sets quickcheck to only
1160 show genuine counterexamples.
1162 - The command 'quickcheck_generator' creates random and exhaustive
1163 value generators for a given type and operations.
1165 It generates values by using the operations as if they were
1166 constructors of that type.
1168 - Support for multisets.
1170 - Added "use_subtype" options.
1172 - Added "quickcheck_locale" configuration to specify how to process
1173 conjectures in a locale context.
1175 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option
1176 and affecting 'rat' and 'real'.
1179 - Integrated more tightly with SPASS, as described in the ITP 2012
1180 paper "More SPASS with Isabelle".
1181 - Made it try "smt" as a fallback if "metis" fails or times out.
1182 - Added support for the following provers: Alt-Ergo (via Why3 and
1183 TFF1), iProver, iProver-Eq.
1184 - Sped up the minimizer.
1185 - Added "lam_trans", "uncurry_aliases", and "minimize" options.
1186 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
1187 - Renamed "sound" option to "strict".
1189 * Metis: Added possibility to specify lambda translations scheme as a
1190 parenthesized argument (e.g., "by (metis (lifting) ...)").
1192 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".
1194 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.
1196 * New "case_product" attribute to generate a case rule doing multiple
1197 case distinctions at the same time. E.g.
1199 list.exhaust [case_product nat.exhaust]
1201 produces a rule which can be used to perform case distinction on both
1204 * New "eventually_elim" method as a generalized variant of the
1205 eventually_elim* rules. Supports structured proofs.
1207 * Typedef with implicit set definition is considered legacy. Use
1208 "typedef (open)" form instead, which will eventually become the
1211 * Record: code generation can be switched off manually with
1213 declare [[record_coden = false]] -- "default true"
1215 * Datatype: type parameters allow explicit sort constraints.
1217 * Concrete syntax for case expressions includes constraints for source
1218 positions, and thus produces Prover IDE markup for its bindings.
1219 INCOMPATIBILITY for old-style syntax translations that augment the
1220 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
1223 * Clarified attribute "mono_set": pure declaration without modifying
1224 the result of the fact expression.
1226 * More default pred/set conversions on a couple of relation operations
1227 and predicates. Added powers of predicate relations. Consolidation
1228 of some relation theorems:
1230 converse_def ~> converse_unfold
1231 rel_comp_def ~> relcomp_unfold
1232 symp_def ~> (modified, use symp_def and sym_def instead)
1233 transp_def ~> transp_trans
1234 Domain_def ~> Domain_unfold
1235 Range_def ~> Domain_converse [symmetric]
1237 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.
1239 See theory "Relation" for examples for making use of pred/set
1240 conversions by means of attributes "to_set" and "to_pred".
1244 * Renamed facts about the power operation on relations, i.e., relpow
1245 to match the constant's name:
1247 rel_pow_1 ~> relpow_1
1248 rel_pow_0_I ~> relpow_0_I
1249 rel_pow_Suc_I ~> relpow_Suc_I
1250 rel_pow_Suc_I2 ~> relpow_Suc_I2
1251 rel_pow_0_E ~> relpow_0_E
1252 rel_pow_Suc_E ~> relpow_Suc_E
1253 rel_pow_E ~> relpow_E
1254 rel_pow_Suc_D2 ~> relpow_Suc_D2
1255 rel_pow_Suc_E2 ~> relpow_Suc_E2
1256 rel_pow_Suc_D2' ~> relpow_Suc_D2'
1257 rel_pow_E2 ~> relpow_E2
1258 rel_pow_add ~> relpow_add
1259 rel_pow_commute ~> relpow
1260 rel_pow_empty ~> relpow_empty:
1261 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
1262 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
1263 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
1264 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
1265 rel_pow_fun_conv ~> relpow_fun_conv
1266 rel_pow_finite_bounded1 ~> relpow_finite_bounded1
1267 rel_pow_finite_bounded ~> relpow_finite_bounded
1268 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
1269 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
1270 single_valued_rel_pow ~> single_valued_relpow
1274 * Theory Relation: Consolidated constant name for relation composition
1275 and corresponding theorem names:
1277 - Renamed constant rel_comp to relcomp.
1279 - Dropped abbreviation pred_comp. Use relcompp instead.
1283 rel_compI ~> relcompI
1284 rel_compEpair ~> relcompEpair
1285 rel_compE ~> relcompE
1286 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq
1287 rel_comp_empty1 ~> relcomp_empty1
1288 rel_comp_mono ~> relcomp_mono
1289 rel_comp_subset_Sigma ~> relcomp_subset_Sigma
1290 rel_comp_distrib ~> relcomp_distrib
1291 rel_comp_distrib2 ~> relcomp_distrib2
1292 rel_comp_UNION_distrib ~> relcomp_UNION_distrib
1293 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2
1294 single_valued_rel_comp ~> single_valued_relcomp
1295 rel_comp_def ~> relcomp_unfold
1296 converse_rel_comp ~> converse_relcomp
1297 pred_compI ~> relcomppI
1298 pred_compE ~> relcomppE
1299 pred_comp_bot1 ~> relcompp_bot1
1300 pred_comp_bot2 ~> relcompp_bot2
1301 transp_pred_comp_less_eq ~> transp_relcompp_less_eq
1302 pred_comp_mono ~> relcompp_mono
1303 pred_comp_distrib ~> relcompp_distrib
1304 pred_comp_distrib2 ~> relcompp_distrib2
1305 converse_pred_comp ~> converse_relcompp
1307 finite_rel_comp ~> finite_relcomp
1309 set_rel_comp ~> set_relcomp
1313 * Theory Divides: Discontinued redundant theorems about div and mod.
1314 INCOMPATIBILITY, use the corresponding generic theorems instead.
1316 DIVISION_BY_ZERO ~> div_by_0, mod_by_0
1317 zdiv_self ~> div_self
1318 zmod_self ~> mod_self
1321 zdiv_zmod_equality ~> div_mod_equality2
1322 zdiv_zmod_equality2 ~> div_mod_equality
1323 zmod_zdiv_trivial ~> mod_div_trivial
1324 zdiv_zminus_zminus ~> div_minus_minus
1325 zmod_zminus_zminus ~> mod_minus_minus
1326 zdiv_zminus2 ~> div_minus_right
1327 zmod_zminus2 ~> mod_minus_right
1328 zdiv_minus1_right ~> div_minus1_right
1329 zmod_minus1_right ~> mod_minus1_right
1330 zdvd_mult_div_cancel ~> dvd_mult_div_cancel
1331 zmod_zmult1_eq ~> mod_mult_right_eq
1332 zpower_zmod ~> power_mod
1333 zdvd_zmod ~> dvd_mod
1334 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd
1335 mod_mult_distrib ~> mult_mod_left
1336 mod_mult_distrib2 ~> mult_mod_right
1338 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use
1339 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.
1341 * Finite_Set.fold now qualified. INCOMPATIBILITY.
1343 * Consolidated theorem names concerning fold combinators:
1345 inf_INFI_fold_inf ~> inf_INF_fold_inf
1346 sup_SUPR_fold_sup ~> sup_SUP_fold_sup
1347 INFI_fold_inf ~> INF_fold_inf
1348 SUPR_fold_sup ~> SUP_fold_sup
1349 union_set ~> union_set_fold
1350 minus_set ~> minus_set_fold
1351 INFI_set_fold ~> INF_set_fold
1352 SUPR_set_fold ~> SUP_set_fold
1353 INF_code ~> INF_set_foldr
1354 SUP_code ~> SUP_set_foldr
1355 foldr.simps ~> foldr.simps (in point-free formulation)
1356 foldr_fold_rev ~> foldr_conv_fold
1357 foldl_fold ~> foldl_conv_fold
1358 foldr_foldr ~> foldr_conv_foldl
1359 foldl_foldr ~> foldl_conv_foldr
1360 fold_set_remdups ~> fold_set_fold_remdups
1361 fold_set ~> fold_set_fold
1362 fold1_set ~> fold1_set_fold
1366 * Dropped rarely useful theorems concerning fold combinators:
1367 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
1368 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
1369 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
1370 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
1371 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,
1372 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.
1373 INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0"
1374 and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be
1375 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by
1376 unfolding "foldr_conv_fold" and "foldl_conv_fold".
1378 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,
1379 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,
1380 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,
1381 INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding
1382 lemmas over fold rather than foldr, or make use of lemmas
1383 fold_conv_foldr and fold_rev.
1385 * Congruence rules Option.map_cong and Option.bind_cong for recursion
1386 through option types.
1388 * "Transitive_Closure.ntrancl": bounded transitive closure on
1391 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.
1393 * Theory Int: Discontinued many legacy theorems specific to type int.
1394 INCOMPATIBILITY, use the corresponding generic theorems instead.
1396 zminus_zminus ~> minus_minus
1397 zminus_0 ~> minus_zero
1398 zminus_zadd_distrib ~> minus_add_distrib
1399 zadd_commute ~> add_commute
1400 zadd_assoc ~> add_assoc
1401 zadd_left_commute ~> add_left_commute
1404 zadd_0 ~> add_0_left
1405 zadd_0_right ~> add_0_right
1406 zadd_zminus_inverse2 ~> left_minus
1407 zmult_zminus ~> mult_minus_left
1408 zmult_commute ~> mult_commute
1409 zmult_assoc ~> mult_assoc
1410 zadd_zmult_distrib ~> left_distrib
1411 zadd_zmult_distrib2 ~> right_distrib
1412 zdiff_zmult_distrib ~> left_diff_distrib
1413 zdiff_zmult_distrib2 ~> right_diff_distrib
1414 zmult_1 ~> mult_1_left
1415 zmult_1_right ~> mult_1_right
1416 zle_refl ~> order_refl
1417 zle_trans ~> order_trans
1418 zle_antisym ~> order_antisym
1419 zle_linear ~> linorder_linear
1420 zless_linear ~> linorder_less_linear
1421 zadd_left_mono ~> add_left_mono
1422 zadd_strict_right_mono ~> add_strict_right_mono
1423 zadd_zless_mono ~> add_less_le_mono
1424 int_0_less_1 ~> zero_less_one
1425 int_0_neq_1 ~> zero_neq_one
1427 zpower_zadd_distrib ~> power_add
1428 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
1429 zero_le_zpower_abs ~> zero_le_power_abs
1431 * Theory Deriv: Renamed
1433 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
1435 * Theory Library/Multiset: Improved code generation of multisets.
1437 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets
1438 are expressed via type classes again. The special syntax
1439 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant
1440 setsum_set, which is now subsumed by Big_Operators.setsum.
1443 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
1444 use theory HOL/Library/Nat_Bijection instead.
1446 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black
1447 trees is now inside a type class context. Names of affected
1448 operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for
1449 theories working directly with raw red-black trees, adapt the names as
1453 bulkload -> rbt_bulkload
1454 del_from_left -> rbt_del_from_left
1455 del_from_right -> rbt_del_from_right
1457 delete -> rbt_delete
1459 insert -> rbt_insert
1460 insertw -> rbt_insert_with
1461 insert_with_key -> rbt_insert_with_key
1462 map_entry -> rbt_map_entry
1463 lookup -> rbt_lookup
1464 sorted -> rbt_sorted
1465 tree_greater -> rbt_greater
1466 tree_less -> rbt_less
1467 tree_less_symbol -> rbt_less_symbol
1469 union_with -> rbt_union_with
1470 union_with_key -> rbt_union_with_key
1473 balance_left_sorted -> balance_left_rbt_sorted
1474 balance_left_tree_greater -> balance_left_rbt_greater
1475 balance_left_tree_less -> balance_left_rbt_less
1476 balance_right_sorted -> balance_right_rbt_sorted
1477 balance_right_tree_greater -> balance_right_rbt_greater
1478 balance_right_tree_less -> balance_right_rbt_less
1479 balance_sorted -> balance_rbt_sorted
1480 balance_tree_greater -> balance_rbt_greater
1481 balance_tree_less -> balance_rbt_less
1482 bulkload_is_rbt -> rbt_bulkload_is_rbt
1483 combine_sorted -> combine_rbt_sorted
1484 combine_tree_greater -> combine_rbt_greater
1485 combine_tree_less -> combine_rbt_less
1486 delete_in_tree -> rbt_delete_in_tree
1487 delete_is_rbt -> rbt_delete_is_rbt
1488 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater
1489 del_from_left_tree_less -> rbt_del_from_left_rbt_less
1490 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater
1491 del_from_right_tree_less -> rbt_del_from_right_rbt_less
1492 del_in_tree -> rbt_del_in_tree
1493 del_inv1_inv2 -> rbt_del_inv1_inv2
1494 del_sorted -> rbt_del_rbt_sorted
1495 del_tree_greater -> rbt_del_rbt_greater
1496 del_tree_less -> rbt_del_rbt_less
1497 dom_lookup_Branch -> dom_rbt_lookup_Branch
1498 entries_lookup -> entries_rbt_lookup
1499 finite_dom_lookup -> finite_dom_rbt_lookup
1500 insert_sorted -> rbt_insert_rbt_sorted
1501 insertw_is_rbt -> rbt_insertw_is_rbt
1502 insertwk_is_rbt -> rbt_insertwk_is_rbt
1503 insertwk_sorted -> rbt_insertwk_rbt_sorted
1504 insertw_sorted -> rbt_insertw_rbt_sorted
1505 ins_sorted -> ins_rbt_sorted
1506 ins_tree_greater -> ins_rbt_greater
1507 ins_tree_less -> ins_rbt_less
1508 is_rbt_sorted -> is_rbt_rbt_sorted
1509 lookup_balance -> rbt_lookup_balance
1510 lookup_bulkload -> rbt_lookup_rbt_bulkload
1511 lookup_delete -> rbt_lookup_rbt_delete
1512 lookup_Empty -> rbt_lookup_Empty
1513 lookup_from_in_tree -> rbt_lookup_from_in_tree
1514 lookup_in_tree -> rbt_lookup_in_tree
1515 lookup_ins -> rbt_lookup_ins
1516 lookup_insert -> rbt_lookup_rbt_insert
1517 lookup_insertw -> rbt_lookup_rbt_insertw
1518 lookup_insertwk -> rbt_lookup_rbt_insertwk
1519 lookup_keys -> rbt_lookup_keys
1520 lookup_map -> rbt_lookup_map
1521 lookup_map_entry -> rbt_lookup_rbt_map_entry
1522 lookup_tree_greater -> rbt_lookup_rbt_greater
1523 lookup_tree_less -> rbt_lookup_rbt_less
1524 lookup_union -> rbt_lookup_rbt_union
1525 map_entry_color_of -> rbt_map_entry_color_of
1526 map_entry_inv1 -> rbt_map_entry_inv1
1527 map_entry_inv2 -> rbt_map_entry_inv2
1528 map_entry_is_rbt -> rbt_map_entry_is_rbt
1529 map_entry_sorted -> rbt_map_entry_rbt_sorted
1530 map_entry_tree_greater -> rbt_map_entry_rbt_greater
1531 map_entry_tree_less -> rbt_map_entry_rbt_less
1532 map_tree_greater -> map_rbt_greater
1533 map_tree_less -> map_rbt_less
1534 map_sorted -> map_rbt_sorted
1535 paint_sorted -> paint_rbt_sorted
1536 paint_lookup -> paint_rbt_lookup
1537 paint_tree_greater -> paint_rbt_greater
1538 paint_tree_less -> paint_rbt_less
1539 sorted_entries -> rbt_sorted_entries
1540 tree_greater_eq_trans -> rbt_greater_eq_trans
1541 tree_greater_nit -> rbt_greater_nit
1542 tree_greater_prop -> rbt_greater_prop
1543 tree_greater_simps -> rbt_greater_simps
1544 tree_greater_trans -> rbt_greater_trans
1545 tree_less_eq_trans -> rbt_less_eq_trans
1546 tree_less_nit -> rbt_less_nit
1547 tree_less_prop -> rbt_less_prop
1548 tree_less_simps -> rbt_less_simps
1549 tree_less_trans -> rbt_less_trans
1550 tree_ord_props -> rbt_ord_props
1551 union_Branch -> rbt_union_Branch
1552 union_is_rbt -> rbt_union_is_rbt
1553 unionw_is_rbt -> rbt_unionw_is_rbt
1554 unionwk_is_rbt -> rbt_unionwk_is_rbt
1555 unionwk_sorted -> rbt_unionwk_rbt_sorted
1557 * Theory HOL/Library/Float: Floating point numbers are now defined as
1558 a subset of the real numbers. All operations are defined using the
1559 lifing-framework and proofs use the transfer method. INCOMPATIBILITY.
1566 round_down -> float_round_down
1567 round_up -> float_round_up
1571 ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod
1574 abs_float_def -> Float.compute_float_abs
1575 bitlen_ge0 -> bitlen_nonneg
1576 bitlen.simps -> Float.compute_bitlen
1577 float_components -> Float_mantissa_exponent
1578 float_divl.simps -> Float.compute_float_divl
1579 float_divr.simps -> Float.compute_float_divr
1580 float_eq_odd -> mult_powr_eq_mult_powr_iff
1581 float_power -> real_of_float_power
1582 lapprox_posrat_def -> Float.compute_lapprox_posrat
1583 lapprox_rat.simps -> Float.compute_lapprox_rat
1584 le_float_def' -> Float.compute_float_le
1585 le_float_def -> less_eq_float.rep_eq
1586 less_float_def' -> Float.compute_float_less
1587 less_float_def -> less_float.rep_eq
1588 normfloat_def -> Float.compute_normfloat
1589 normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0
1590 normfloat -> normfloat_def
1591 normfloat_unique -> use normfloat_def
1592 number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral
1593 one_float_def -> Float.compute_float_one
1594 plus_float_def -> Float.compute_float_plus
1595 rapprox_posrat_def -> Float.compute_rapprox_posrat
1596 rapprox_rat.simps -> Float.compute_rapprox_rat
1597 real_of_float_0 -> zero_float.rep_eq
1598 real_of_float_1 -> one_float.rep_eq
1599 real_of_float_abs -> abs_float.rep_eq
1600 real_of_float_add -> plus_float.rep_eq
1601 real_of_float_minus -> uminus_float.rep_eq
1602 real_of_float_mult -> times_float.rep_eq
1603 real_of_float_simp -> Float.rep_eq
1604 real_of_float_sub -> minus_float.rep_eq
1605 round_down.simps -> Float.compute_float_round_down
1606 round_up.simps -> Float.compute_float_round_up
1607 times_float_def -> Float.compute_float_times
1608 uminus_float_def -> Float.compute_float_uminus
1609 zero_float_def -> Float.compute_float_zero
1611 Lemmas not necessary anymore, use the transfer method:
1612 bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,
1613 float_divr, float_le_simp, float_less1_mantissa_bound,
1614 float_less_simp, float_less_zero, float_le_zero,
1615 float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,
1616 floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,
1617 lapprox_rat_bottom, normalized_float, rapprox_posrat,
1618 rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,
1619 real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,
1620 round_up, zero_le_float, zero_less_float
1622 * New theory HOL/Library/DAList provides an abstract type for
1623 association lists with distinct keys.
1625 * Session HOL/IMP: Added new theory of abstract interpretation of
1628 * Session HOL-Import: Re-implementation from scratch is faster,
1629 simpler, and more scalable. Requires a proof bundle, which is
1630 available as an external component. Discontinued old (and mostly
1631 dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY.
1633 * Session HOL-Word: Discontinued many redundant theorems specific to
1634 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
1637 word_sub_alt ~> word_sub_wi
1638 word_add_alt ~> word_add_def
1639 word_mult_alt ~> word_mult_def
1640 word_minus_alt ~> word_minus_def
1641 word_0_alt ~> word_0_wi
1642 word_1_alt ~> word_1_wi
1643 word_add_0 ~> add_0_left
1644 word_add_0_right ~> add_0_right
1645 word_mult_1 ~> mult_1_left
1646 word_mult_1_right ~> mult_1_right
1647 word_add_commute ~> add_commute
1648 word_add_assoc ~> add_assoc
1649 word_add_left_commute ~> add_left_commute
1650 word_mult_commute ~> mult_commute
1651 word_mult_assoc ~> mult_assoc
1652 word_mult_left_commute ~> mult_left_commute
1653 word_left_distrib ~> left_distrib
1654 word_right_distrib ~> right_distrib
1655 word_left_minus ~> left_minus
1656 word_diff_0_right ~> diff_0_right
1657 word_diff_self ~> diff_self
1658 word_sub_def ~> diff_minus
1659 word_diff_minus ~> diff_minus
1660 word_add_ac ~> add_ac
1661 word_mult_ac ~> mult_ac
1662 word_plus_ac0 ~> add_0_left add_0_right add_ac
1663 word_times_ac1 ~> mult_1_left mult_1_right mult_ac
1664 word_order_trans ~> order_trans
1665 word_order_refl ~> order_refl
1666 word_order_antisym ~> order_antisym
1667 word_order_linear ~> linorder_linear
1668 lenw1_zero_neq_one ~> zero_neq_one
1669 word_number_of_eq ~> number_of_eq
1670 word_of_int_add_hom ~> wi_hom_add
1671 word_of_int_sub_hom ~> wi_hom_sub
1672 word_of_int_mult_hom ~> wi_hom_mult
1673 word_of_int_minus_hom ~> wi_hom_neg
1674 word_of_int_succ_hom ~> wi_hom_succ
1675 word_of_int_pred_hom ~> wi_hom_pred
1676 word_of_int_0_hom ~> word_0_wi
1677 word_of_int_1_hom ~> word_1_wi
1679 * Session HOL-Word: New proof method "word_bitwise" for splitting
1680 machine word equalities and inequalities into logical circuits,
1681 defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction,
1682 multiplication, shifting by constants, bitwise operators and numeric
1683 constants. Requires fixed-length word types, not 'a word. Solves
1684 many standard word identities outright and converts more into first
1685 order problems amenable to blast or similar. See also examples in
1686 HOL/Word/Examples/WordExamples.thy.
1688 * Session HOL-Probability: Introduced the type "'a measure" to
1689 represent measures, this replaces the records 'a algebra and 'a
1690 measure_space. The locales based on subset_class now have two
1691 locale-parameters the space \<Omega> and the set of measurable sets M.
1692 The product of probability spaces uses now the same constant as the
1693 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)
1694 measure". Most constants are defined now outside of locales and gain
1695 an additional parameter, like null_sets, almost_eventually or \<mu>'.
1696 Measure space constructions for distributions and densities now got
1697 their own constants distr and density. Instead of using locales to
1698 describe measure spaces with a finite space, the measure count_space
1699 and point_measure is introduced. INCOMPATIBILITY.
1703 finite_measure.\<mu>' -> measure
1704 product_algebra_generator -> prod_algebra
1705 product_prob_space.emb -> prod_emb
1706 product_prob_space.infprod_algebra -> PiM
1709 completeable_measure_space
1710 finite_measure_space
1712 finite_product_finite_prob_space
1713 finite_product_sigma_algebra
1714 finite_sigma_algebra
1716 pair_finite_prob_space
1717 pair_finite_sigma_algebra
1720 product_sigma_algebra
1724 distribution -> use distr measure, or distributed predicate
1726 joint_distribution -> use distr measure, or distributed predicate
1727 pair_measure_generator
1728 product_prob_space.infprod_algebra -> use PiM
1731 Replacement theorems:
1732 finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite
1733 finite_measure.empty_measure -> measure_empty
1734 finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq
1735 finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq
1736 finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably
1737 finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure
1738 finite_measure.finite_measure -> finite_measure.emeasure_finite
1739 finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton
1740 finite_measure.positive_measure' -> measure_nonneg
1741 finite_measure.real_measure -> finite_measure.emeasure_real
1742 finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb
1743 finite_product_sigma_algebra.in_P -> sets_PiM_I_finite
1744 finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty
1745 information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed
1746 information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple
1747 information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple
1748 information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple
1749 information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple
1750 information_space.entropy_commute -> information_space.entropy_commute_simple
1751 information_space.entropy_eq -> information_space.entropy_simple_distributed
1752 information_space.entropy_generic_eq -> information_space.entropy_simple_distributed
1753 information_space.entropy_positive -> information_space.entropy_nonneg_simple
1754 information_space.entropy_uniform_max -> information_space.entropy_uniform
1755 information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq
1756 information_space.KL_eq_0 -> information_space.KL_same_eq_0
1757 information_space.KL_ge_0 -> information_space.KL_nonneg
1758 information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed
1759 information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple
1760 Int_stable_cuboids -> Int_stable_atLeastAtMost
1761 Int_stable_product_algebra_generator -> positive_integral
1762 measure_preserving -> equality "distr M N f = N" "f : measurable M N"
1763 measure_space.additive -> emeasure_additive
1764 measure_space.AE_iff_null_set -> AE_iff_null
1765 measure_space.almost_everywhere_def -> eventually_ae_filter
1766 measure_space.almost_everywhere_vimage -> AE_distrD
1767 measure_space.continuity_from_above -> INF_emeasure_decseq
1768 measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq
1769 measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq
1770 measure_space.continuity_from_below -> SUP_emeasure_incseq
1771 measure_space_density -> emeasure_density
1772 measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density
1773 measure_space.integrable_vimage -> integrable_distr
1774 measure_space.integral_translated_density -> integral_density
1775 measure_space.integral_vimage -> integral_distr
1776 measure_space.measure_additive -> plus_emeasure
1777 measure_space.measure_compl -> emeasure_compl
1778 measure_space.measure_countable_increasing -> emeasure_countable_increasing
1779 measure_space.measure_countably_subadditive -> emeasure_subadditive_countably
1780 measure_space.measure_decseq -> decseq_emeasure
1781 measure_space.measure_Diff -> emeasure_Diff
1782 measure_space.measure_Diff_null_set -> emeasure_Diff_null_set
1783 measure_space.measure_eq_0 -> emeasure_eq_0
1784 measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite
1785 measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton
1786 measure_space.measure_incseq -> incseq_emeasure
1787 measure_space.measure_insert -> emeasure_insert
1788 measure_space.measure_mono -> emeasure_mono
1789 measure_space.measure_not_negative -> emeasure_not_MInf
1790 measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq
1791 measure_space.measure_setsum -> setsum_emeasure
1792 measure_space.measure_setsum_split -> setsum_emeasure_cover
1793 measure_space.measure_space_vimage -> emeasure_distr
1794 measure_space.measure_subadditive_finite -> emeasure_subadditive_finite
1795 measure_space.measure_subadditive -> subadditive
1796 measure_space.measure_top -> emeasure_space
1797 measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0
1798 measure_space.measure_Un_null_set -> emeasure_Un_null_set
1799 measure_space.positive_integral_translated_density -> positive_integral_density
1800 measure_space.positive_integral_vimage -> positive_integral_distr
1801 measure_space.real_continuity_from_above -> Lim_measure_decseq
1802 measure_space.real_continuity_from_below -> Lim_measure_incseq
1803 measure_space.real_measure_countably_subadditive -> measure_subadditive_countably
1804 measure_space.real_measure_Diff -> measure_Diff
1805 measure_space.real_measure_finite_Union -> measure_finite_Union
1806 measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton
1807 measure_space.real_measure_subadditive -> measure_subadditive
1808 measure_space.real_measure_Union -> measure_Union
1809 measure_space.real_measure_UNION -> measure_UNION
1810 measure_space.simple_function_vimage -> simple_function_comp
1811 measure_space.simple_integral_vimage -> simple_integral_distr
1812 measure_space.simple_integral_vimage -> simple_integral_distr
1813 measure_unique_Int_stable -> measure_eqI_generator_eq
1814 measure_unique_Int_stable_vimage -> measure_eqI_generator_eq
1815 pair_sigma_algebra.measurable_cut_fst -> sets_Pair1
1816 pair_sigma_algebra.measurable_cut_snd -> sets_Pair2
1817 pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1
1818 pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2
1819 pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff
1820 pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap
1821 pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'
1822 pair_sigma_algebra.sets_swap -> sets_pair_swap
1823 pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1
1824 pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2
1825 pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap
1826 pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2
1827 pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt
1828 pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times
1829 prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM
1830 prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq
1831 prob_space.measure_space_1 -> prob_space.emeasure_space_1
1832 prob_space.prob_space_vimage -> prob_space_distr
1833 prob_space.random_variable_restrict -> measurable_restrict
1834 prob_space_unique_Int_stable -> measure_eqI_prob_space
1835 product_algebraE -> prod_algebraE_all
1836 product_algebra_generator_der -> prod_algebra_eq_finite
1837 product_algebra_generator_into_space -> prod_algebra_sets_into_space
1838 product_algebraI -> sets_PiM_I_finite
1839 product_measure_exists -> product_sigma_finite.sigma_finite
1840 product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator
1841 product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb
1842 product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty
1843 product_prob_space.measurable_component -> measurable_component_singleton
1844 product_prob_space.measurable_emb -> measurable_prod_emb
1845 product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single
1846 product_prob_space.measurable_singleton_infprod -> measurable_component_singleton
1847 product_prob_space.measure_emb -> emeasure_prod_emb
1848 product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict
1849 product_sigma_algebra.product_algebra_into_space -> space_closed
1850 product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge
1851 product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton
1852 product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge
1853 sequence_space.measure_infprod -> sequence_space.measure_PiM_countable
1854 sets_product_algebra -> sets_PiM
1855 sigma_algebra.measurable_sigma -> measurable_measure_of
1856 sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint
1857 sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr
1858 sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq
1859 space_product_algebra -> space_PiM
1861 * Session HOL-TPTP: support to parse and import TPTP problems (all
1862 languages) into Isabelle/HOL.
1867 * New "case_product" attribute (see HOL).
1872 * Greater support for structured proofs involving induction or case
1875 * Much greater use of mathematical symbols.
1877 * Removal of many ML theorem bindings. INCOMPATIBILITY.
1882 * Antiquotation @{keyword "name"} produces a parser for outer syntax
1883 from a minor keyword introduced via theory header declaration.
1885 * Antiquotation @{command_spec "name"} produces the
1886 Outer_Syntax.command_spec from a major keyword introduced via theory
1887 header declaration; it can be passed to Outer_Syntax.command etc.
1889 * Local_Theory.define no longer hard-wires default theorem name
1890 "foo_def", but retains the binding as given. If that is Binding.empty
1891 / Attrib.empty_binding, the result is not registered as user-level
1892 fact. The Local_Theory.define_internal variant allows to specify a
1893 non-empty name (used for the foundation in the background theory),
1894 while omitting the fact binding in the user-context. Potential
1895 INCOMPATIBILITY for derived definitional packages: need to specify
1896 naming policy for primitive definitions more explicitly.
1898 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
1899 conformance with similar operations in structure Term and Logic.
1901 * Antiquotation @{attributes [...]} embeds attribute source
1902 representation into the ML text, which is particularly useful with
1903 declarations like Local_Theory.note.
1905 * Structure Proof_Context follows standard naming scheme. Old
1906 ProofContext has been discontinued. INCOMPATIBILITY.
1908 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
1909 change of semantics: update is applied to auxiliary local theory
1912 * Modernized some old-style infix operations:
1914 addeqcongs ~> Simplifier.add_eqcong
1915 deleqcongs ~> Simplifier.del_eqcong
1916 addcongs ~> Simplifier.add_cong
1917 delcongs ~> Simplifier.del_cong
1918 setmksimps ~> Simplifier.set_mksimps
1919 setmkcong ~> Simplifier.set_mkcong
1920 setmksym ~> Simplifier.set_mksym
1921 setmkeqTrue ~> Simplifier.set_mkeqTrue
1922 settermless ~> Simplifier.set_termless
1923 setsubgoaler ~> Simplifier.set_subgoaler
1924 addsplits ~> Splitter.add_split
1925 delsplits ~> Splitter.del_split
1930 * USER_HOME settings variable points to cross-platform user home
1931 directory, which coincides with HOME on POSIX systems only. Likewise,
1932 the Isabelle path specification "~" now expands to $USER_HOME, instead
1933 of former $HOME. A different default for USER_HOME may be set
1934 explicitly in shell environment, before Isabelle settings are
1935 evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where
1936 the generic user home was intended.
1938 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
1939 notation, which is useful for the jEdit file browser, for example.
1941 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
1946 New in Isabelle2011-1 (October 2011)
1947 ------------------------------------
1951 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
1952 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
1954 - Management of multiple theory files directly from the editor
1955 buffer store -- bypassing the file-system (no requirement to save
1956 files for checking).
1958 - Markup of formal entities within the text buffer, with semantic
1959 highlighting, tooltips and hyperlinks to jump to defining source
1962 - Improved text rendering, with sub/superscripts in the source
1963 buffer (including support for copy/paste wrt. output panel, HTML
1964 theory output and other non-Isabelle text boxes).
1966 - Refined scheduling of proof checking and printing of results,
1967 based on interactive editor view. (Note: jEdit folding and
1968 narrowing allows to restrict buffer perspectives explicitly.)
1970 - Reduced CPU performance requirements, usable on machines with few
1973 - Reduced memory requirements due to pruning of unused document
1974 versions (garbage collection).
1976 See also ~~/src/Tools/jEdit/README.html for further information,
1977 including some remaining limitations.
1979 * Theory loader: source files are exclusively located via the master
1980 directory of each theory node (where the .thy file itself resides).
1981 The global load path (such as src/HOL/Library) has been discontinued.
1982 Note that the path element ~~ may be used to reference theories in the
1983 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
1986 * Theory loader: source files are identified by content via SHA1
1987 digests. Discontinued former path/modtime identification and optional
1988 ISABELLE_FILE_IDENT plugin scripts.
1990 * Parallelization of nested Isar proofs is subject to
1991 Goal.parallel_proofs_threshold (default 100). See also isabelle
1994 * Name space: former unsynchronized references are now proper
1995 configuration options, with more conventional names:
1997 long_names ~> names_long
1998 short_names ~> names_short
1999 unique_names ~> names_unique
2001 Minor INCOMPATIBILITY, need to declare options in context like this:
2003 declare [[names_unique = false]]
2005 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note
2006 that the result needs to be unique, which means fact specifications
2007 may have to be refined after enriching a proof context.
2009 * Attribute "case_names" has been refined: the assumptions in each case
2010 can be named now by following the case name with [name1 name2 ...].
2012 * Isabelle/Isar reference manual has been updated and extended:
2013 - "Synopsis" provides a catalog of main Isar language concepts.
2014 - Formal references in syntax diagrams, via @{rail} antiquotation.
2015 - Updated material from classic "ref" manual, notably about
2016 "Classical Reasoner".
2021 * Class bot and top require underlying partial order rather than
2022 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.
2024 * Class complete_lattice: generalized a couple of lemmas from sets;
2025 generalized theorems INF_cong and SUP_cong. New type classes for
2026 complete boolean algebras and complete linear orders. Lemmas
2027 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
2028 class complete_linorder.
2030 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
2031 Sup_fun_def, Inf_apply, Sup_apply.
2033 Removed redundant lemmas (the right hand side gives hints how to
2034 replace them for (metis ...), or (simp only: ...) proofs):
2036 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
2037 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
2038 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
2039 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
2040 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
2041 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
2042 Inter_def ~> INF_def, image_def
2043 Union_def ~> SUP_def, image_def
2044 INT_eq ~> INF_def, and image_def
2045 UN_eq ~> SUP_def, and image_def
2046 INF_subset ~> INF_superset_mono [OF _ order_refl]
2048 More consistent and comprehensive names:
2050 INTER_eq_Inter_image ~> INF_def
2051 UNION_eq_Union_image ~> SUP_def
2054 INF_leI ~> INF_lower
2055 INF_leI2 ~> INF_lower2
2056 le_INFI ~> INF_greatest
2057 le_SUPI ~> SUP_upper
2058 le_SUPI2 ~> SUP_upper2
2059 SUP_leI ~> SUP_least
2060 INFI_bool_eq ~> INF_bool_eq
2061 SUPR_bool_eq ~> SUP_bool_eq
2062 INFI_apply ~> INF_apply
2063 SUPR_apply ~> SUP_apply
2064 INTER_def ~> INTER_eq
2065 UNION_def ~> UNION_eq
2069 * Renamed theory Complete_Lattice to Complete_Lattices.
2072 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
2073 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
2074 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
2075 Sup_insert are now declared as [simp]. INCOMPATIBILITY.
2077 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
2078 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
2079 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor
2082 * Added syntactic classes "inf" and "sup" for the respective
2083 constants. INCOMPATIBILITY: Changes in the argument order of the
2084 (mostly internal) locale predicates for some derived classes.
2086 * Theorem collections ball_simps and bex_simps do not contain theorems
2087 referring to UNION any longer; these have been moved to collection
2088 UN_ball_bex_simps. INCOMPATIBILITY.
2090 * Theory Archimedean_Field: floor now is defined as parameter of a
2091 separate type class floor_ceiling.
2093 * Theory Finite_Set: more coherent development of fold_set locales:
2095 locale fun_left_comm ~> locale comp_fun_commute
2096 locale fun_left_comm_idem ~> locale comp_fun_idem
2098 Both use point-free characterization; interpretation proofs may need
2099 adjustment. INCOMPATIBILITY.
2101 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
2102 accordance with standard mathematical terminology. INCOMPATIBILITY.
2104 * Theory Complex_Main: The locale interpretations for the
2105 bounded_linear and bounded_bilinear locales have been removed, in
2106 order to reduce the number of duplicate lemmas. Users must use the
2107 original names for distributivity theorems, potential INCOMPATIBILITY.
2109 divide.add ~> add_divide_distrib
2110 divide.diff ~> diff_divide_distrib
2111 divide.setsum ~> setsum_divide_distrib
2112 mult.add_right ~> right_distrib
2113 mult.diff_right ~> right_diff_distrib
2114 mult_right.setsum ~> setsum_right_distrib
2115 mult_left.diff ~> left_diff_distrib
2117 * Theory Complex_Main: Several redundant theorems have been removed or
2118 replaced by more general versions. INCOMPATIBILITY.
2120 real_diff_def ~> minus_real_def
2121 real_divide_def ~> divide_real_def
2122 real_less_def ~> less_le
2123 real_abs_def ~> abs_real_def
2124 real_sgn_def ~> sgn_real_def
2125 real_mult_commute ~> mult_commute
2126 real_mult_assoc ~> mult_assoc
2127 real_mult_1 ~> mult_1_left
2128 real_add_mult_distrib ~> left_distrib
2129 real_zero_not_eq_one ~> zero_neq_one
2130 real_mult_inverse_left ~> left_inverse
2131 INVERSE_ZERO ~> inverse_zero
2132 real_le_refl ~> order_refl
2133 real_le_antisym ~> order_antisym
2134 real_le_trans ~> order_trans
2135 real_le_linear ~> linear
2136 real_le_eq_diff ~> le_iff_diff_le_0
2137 real_add_left_mono ~> add_left_mono
2138 real_mult_order ~> mult_pos_pos
2139 real_mult_less_mono2 ~> mult_strict_left_mono
2140 real_of_int_real_of_nat ~> real_of_int_of_nat_eq
2141 real_0_le_divide_iff ~> zero_le_divide_iff
2142 realpow_two_disj ~> power2_eq_iff
2143 real_squared_diff_one_factored ~> square_diff_one_factored
2144 realpow_two_diff ~> square_diff_square_factored
2145 reals_complete2 ~> complete_real
2146 real_sum_squared_expand ~> power2_sum
2147 exp_ln_eq ~> ln_unique
2149 expi_zero ~> exp_zero
2150 lemma_DERIV_subst ~> DERIV_cong
2151 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
2152 LIMSEQ_const ~> tendsto_const
2153 LIMSEQ_norm ~> tendsto_norm
2154 LIMSEQ_add ~> tendsto_add
2155 LIMSEQ_minus ~> tendsto_minus
2156 LIMSEQ_minus_cancel ~> tendsto_minus_cancel
2157 LIMSEQ_diff ~> tendsto_diff
2158 bounded_linear.LIMSEQ ~> bounded_linear.tendsto
2159 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
2160 LIMSEQ_mult ~> tendsto_mult
2161 LIMSEQ_inverse ~> tendsto_inverse
2162 LIMSEQ_divide ~> tendsto_divide
2163 LIMSEQ_pow ~> tendsto_power
2164 LIMSEQ_setsum ~> tendsto_setsum
2165 LIMSEQ_setprod ~> tendsto_setprod
2166 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
2167 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
2168 LIMSEQ_imp_rabs ~> tendsto_rabs
2169 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
2170 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
2171 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
2172 LIMSEQ_Complex ~> tendsto_Complex
2173 LIM_ident ~> tendsto_ident_at
2174 LIM_const ~> tendsto_const
2175 LIM_add ~> tendsto_add
2176 LIM_add_zero ~> tendsto_add_zero
2177 LIM_minus ~> tendsto_minus
2178 LIM_diff ~> tendsto_diff
2179 LIM_norm ~> tendsto_norm
2180 LIM_norm_zero ~> tendsto_norm_zero
2181 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
2182 LIM_norm_zero_iff ~> tendsto_norm_zero_iff
2183 LIM_rabs ~> tendsto_rabs
2184 LIM_rabs_zero ~> tendsto_rabs_zero
2185 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
2186 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
2187 LIM_compose ~> tendsto_compose
2188 LIM_mult ~> tendsto_mult
2189 LIM_scaleR ~> tendsto_scaleR
2190 LIM_of_real ~> tendsto_of_real
2191 LIM_power ~> tendsto_power
2192 LIM_inverse ~> tendsto_inverse
2193 LIM_sgn ~> tendsto_sgn
2194 isCont_LIM_compose ~> isCont_tendsto_compose
2195 bounded_linear.LIM ~> bounded_linear.tendsto
2196 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
2197 bounded_bilinear.LIM ~> bounded_bilinear.tendsto
2198 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
2199 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
2200 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
2201 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
2203 * Theory Complex_Main: The definition of infinite series was
2204 generalized. Now it is defined on the type class {topological_space,
2205 comm_monoid_add}. Hence it is useable also for extended real numbers.
2207 * Theory Complex_Main: The complex exponential function "expi" is now
2208 a type-constrained abbreviation for "exp :: complex => complex"; thus
2209 several polymorphic lemmas about "exp" are now applicable to "expi".
2213 - Theory Library/Code_Char_ord provides native ordering of
2214 characters in the target language.
2216 - Commands code_module and code_library are legacy, use export_code
2219 - Method "evaluation" is legacy, use method "eval" instead.
2221 - Legacy evaluator "SML" is deactivated by default. May be
2222 reactivated by the following theory command:
2224 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
2226 * Declare ext [intro] by default. Rare INCOMPATIBILITY.
2228 * New proof method "induction" that gives induction hypotheses the
2229 name "IH", thus distinguishing them from further hypotheses that come
2230 from rule induction. The latter are still called "hyps". Method
2231 "induction" is a thin wrapper around "induct" and follows the same
2234 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
2235 still available as a legacy feature for some time.
2238 - Added "need" and "total_consts" options.
2239 - Reintroduced "show_skolems" option by popular demand.
2240 - Renamed attribute: nitpick_def ~> nitpick_unfold.
2244 - Use quasi-sound (and efficient) translations by default.
2245 - Added support for the following provers: E-ToFoF, LEO-II,
2246 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
2247 - Automatically preplay and minimize proofs before showing them if
2248 this can be done within reasonable time.
2249 - sledgehammer available_provers ~> sledgehammer supported_provers.
2251 - Added "preplay_timeout", "slicing", "type_enc", "sound",
2252 "max_mono_iters", and "max_new_mono_instances" options.
2253 - Removed "explicit_apply" and "full_types" options as well as "Full
2254 Types" Proof General menu item. INCOMPATIBILITY.
2257 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
2258 - Obsoleted "metisFT" -- use "metis (full_types)" instead.
2262 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
2263 "elim:" options. INCOMPATIBILITY.
2264 - Introduced 'try' that not only runs 'try_methods' but also
2265 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
2268 - Added "eval" option to evaluate terms for the found counterexample
2269 (currently only supported by the default (exhaustive) tester).
2270 - Added post-processing of terms to obtain readable counterexamples
2271 (currently only supported by the default (exhaustive) tester).
2272 - New counterexample generator quickcheck[narrowing] enables
2273 narrowing-based testing. Requires the Glasgow Haskell compiler
2274 with its installation location defined in the Isabelle settings
2275 environment as ISABELLE_GHC.
2276 - Removed quickcheck tester "SML" based on the SML code generator
2277 (formly in HOL/Library).
2279 * Function package: discontinued option "tailrec". INCOMPATIBILITY,
2280 use 'partial_function' instead.
2282 * Theory Library/Extended_Reals replaces now the positive extended
2283 reals found in probability theory. This file is extended by
2284 Multivariate_Analysis/Extended_Real_Limits.
2286 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,
2287 from where it must be imported explicitly if it is really required.
2290 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
2291 been moved here. INCOMPATIBILITY.
2293 * Theory Library/Saturated provides type of numbers with saturated
2296 * Theory Library/Product_Lattice defines a pointwise ordering for the
2297 product type 'a * 'b, and provides instance proofs for various order
2298 and lattice type classes.
2300 * Theory Library/Countable now provides the "countable_datatype" proof
2301 method for proving "countable" class instances for datatypes.
2303 * Theory Library/Cset_Monad allows do notation for computable sets
2304 (cset) via the generic monad ad-hoc overloading facility.
2306 * Library: Theories of common data structures are split into theories
2307 for implementation, an invariant-ensuring type, and connection to an
2308 abstract type. INCOMPATIBILITY.
2310 - RBT is split into RBT and RBT_Mapping.
2311 - AssocList is split and renamed into AList and AList_Mapping.
2312 - DList is split into DList_Impl, DList, and DList_Cset.
2313 - Cset is split into Cset and List_Cset.
2315 * Theory Library/Nat_Infinity has been renamed to
2316 Library/Extended_Nat, with name changes of the following types and
2319 type inat ~> type enat
2321 Infty ~> infinity (overloaded)
2325 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
2326 been renamed accordingly. INCOMPATIBILITY.
2328 * Session Multivariate_Analysis: The euclidean_space type class now
2329 fixes a constant "Basis :: 'a set" consisting of the standard
2330 orthonormal basis for the type. Users now have the option of
2331 quantifying over this set instead of using the "basis" function, e.g.
2332 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
2334 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
2335 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
2336 "Cart_nth" and "Cart_lambda" have been respectively renamed to
2337 "vec_nth" and "vec_lambda"; theorems mentioning those names have
2338 changed to match. Definition theorems for overloaded constants now use
2339 the standard "foo_vec_def" naming scheme. A few other theorems have
2340 been renamed as follows (INCOMPATIBILITY):
2342 Cart_eq ~> vec_eq_iff
2343 dist_nth_le_cart ~> dist_vec_nth_le
2344 tendsto_vector ~> vec_tendstoI
2345 Cauchy_vector ~> vec_CauchyI
2347 * Session Multivariate_Analysis: Several duplicate theorems have been
2348 removed, and other theorems have been renamed or replaced with more
2349 general versions. INCOMPATIBILITY.
2351 finite_choice ~> finite_set_choice
2352 eventually_conjI ~> eventually_conj
2353 eventually_and ~> eventually_conj_iff
2354 eventually_false ~> eventually_False
2355 setsum_norm ~> norm_setsum
2356 Lim_sequentially ~> LIMSEQ_def
2357 Lim_ident_at ~> LIM_ident
2358 Lim_const ~> tendsto_const
2359 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
2360 Lim_neg ~> tendsto_minus
2361 Lim_add ~> tendsto_add
2362 Lim_sub ~> tendsto_diff
2363 Lim_mul ~> tendsto_scaleR
2364 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
2365 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
2366 Lim_linear ~> bounded_linear.tendsto
2367 Lim_component ~> tendsto_euclidean_component
2368 Lim_component_cart ~> tendsto_vec_nth
2369 Lim_inner ~> tendsto_inner [OF tendsto_const]
2370 dot_lsum ~> inner_setsum_left
2371 dot_rsum ~> inner_setsum_right
2372 continuous_cmul ~> continuous_scaleR [OF continuous_const]
2373 continuous_neg ~> continuous_minus
2374 continuous_sub ~> continuous_diff
2375 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
2376 continuous_mul ~> continuous_scaleR
2377 continuous_inv ~> continuous_inverse
2378 continuous_at_within_inv ~> continuous_at_within_inverse
2379 continuous_at_inv ~> continuous_at_inverse
2380 continuous_at_norm ~> continuous_norm [OF continuous_at_id]
2381 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
2382 continuous_at_component ~> continuous_component [OF continuous_at_id]
2383 continuous_on_neg ~> continuous_on_minus
2384 continuous_on_sub ~> continuous_on_diff
2385 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
2386 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
2387 continuous_on_mul ~> continuous_on_scaleR
2388 continuous_on_mul_real ~> continuous_on_mult
2389 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
2390 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
2391 continuous_on_inverse ~> continuous_on_inv
2392 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
2393 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
2394 subset_interior ~> interior_mono
2395 subset_closure ~> closure_mono
2396 closure_univ ~> closure_UNIV
2397 real_arch_lt ~> reals_Archimedean2
2398 real_arch ~> reals_Archimedean3
2399 real_abs_norm ~> abs_norm_cancel
2400 real_abs_sub_norm ~> norm_triangle_ineq3
2401 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
2403 * Session HOL-Probability:
2404 - Caratheodory's extension lemma is now proved for ring_of_sets.
2405 - Infinite products of probability measures are now available.
2406 - Sigma closure is independent, if the generator is independent
2407 - Use extended reals instead of positive extended
2408 reals. INCOMPATIBILITY.
2410 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
2412 expand_fun_below ~> fun_below_iff
2413 below_fun_ext ~> fun_belowI
2414 expand_cfun_eq ~> cfun_eq_iff
2415 ext_cfun ~> cfun_eqI
2416 expand_cfun_below ~> cfun_below_iff
2417 below_cfun_ext ~> cfun_belowI
2418 monofun_fun_fun ~> fun_belowD
2419 monofun_fun_arg ~> monofunE
2420 monofun_lub_fun ~> adm_monofun [THEN admD]
2421 cont_lub_fun ~> adm_cont [THEN admD]
2422 cont2cont_Rep_CFun ~> cont2cont_APP
2423 cont_Rep_CFun_app ~> cont_APP_app
2424 cont_Rep_CFun_app_app ~> cont_APP_app_app
2425 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
2426 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
2427 contlub_cfun ~> lub_APP [symmetric]
2428 contlub_LAM ~> lub_LAM [symmetric]
2431 lift_distinct1 ~> lift.distinct(1)
2432 lift_distinct2 ~> lift.distinct(2)
2433 Def_not_UU ~> lift.distinct(2)
2434 Def_inject ~> lift.inject
2435 below_UU_iff ~> below_bottom_iff
2436 eq_UU_iff ~> eq_bottom_iff
2439 *** Document preparation ***
2441 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
2442 isar-ref manual, both for description and actual application of the
2445 * Antiquotation @{value} evaluates the given term and presents its
2448 * Antiquotations: term style "isub" provides ad-hoc conversion of
2449 variables x1, y23 into subscripted form x\<^isub>1,
2450 y\<^isub>2\<^isub>3.
2452 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
2453 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
2455 * Localized \isabellestyle switch can be used within blocks or groups
2458 \isabellestyle{it} %preferred default
2459 {\isabellestylett @{text "typewriter stuff"}}
2461 * Discontinued special treatment of hard tabulators. Implicit
2462 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual
2468 * The inner syntax of sort/type/term/prop supports inlined YXML
2469 representations within quoted string tokens. By encoding logical
2470 entities via Term_XML (in ML or Scala) concrete syntax can be
2471 bypassed, which is particularly useful for producing bits of text
2472 under external program control.
2474 * Antiquotations for ML and document preparation are managed as theory
2475 data, which requires explicit setup.
2477 * Isabelle_Process.is_active allows tools to check if the official
2478 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
2479 (better known as Proof General).
2481 * Structure Proof_Context follows standard naming scheme. Old
2482 ProofContext is still available for some time as legacy alias.
2484 * Structure Timing provides various operations for timing; supersedes
2485 former start_timing/end_timing etc.
2487 * Path.print is the official way to show file-system paths to users
2488 (including quotes etc.).
2490 * Inner syntax: identifiers in parse trees of generic categories
2491 "logic", "aprop", "idt" etc. carry position information (disguised as
2492 type constraints). Occasional INCOMPATIBILITY with non-compliant
2493 translations that choke on unexpected type constraints. Positions can
2494 be stripped in ML translations via Syntax.strip_positions /
2495 Syntax.strip_positions_ast, or via the syntax constant
2496 "_strip_positions" within parse trees. As last resort, positions can
2497 be disabled via the configuration option Syntax.positions, which is
2498 called "syntax_positions" in Isar attribute syntax.
2500 * Discontinued special status of various ML structures that contribute
2501 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
2502 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
2503 refer directly to Ast.Constant, Lexicon.is_identifier,
2504 Syntax_Trans.mk_binder_tr etc.
2506 * Typed print translation: discontinued show_sorts argument, which is
2507 already available via context of "advanced" translation.
2509 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
2510 goal states; body tactic needs to address all subgoals uniformly.
2512 * Slightly more special eq_list/eq_set, with shortcut involving
2513 pointer equality (assumes that eq relation is reflexive).
2515 * Classical tactics use proper Proof.context instead of historic types
2516 claset/clasimpset. Old-style declarations like addIs, addEs, addDs
2517 operate directly on Proof.context. Raw type claset retains its use as
2518 snapshot of the classical context, which can be recovered via
2519 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.
2520 INCOMPATIBILITY, classical tactics and derived proof methods require
2521 proper Proof.context.
2526 * Discontinued support for Poly/ML 5.2, which was the last version
2527 without proper multithreading and TimeLimit implementation.
2529 * Discontinued old lib/scripts/polyml-platform, which has been
2530 obsolete since Isabelle2009-2.
2532 * Various optional external tools are referenced more robustly and
2533 uniformly by explicit Isabelle settings as follows:
2535 ISABELLE_CSDP (formerly CSDP_EXE)
2536 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)
2537 ISABELLE_OCAML (formerly EXEC_OCAML)
2538 ISABELLE_SWIPL (formerly EXEC_SWIPL)
2539 ISABELLE_YAP (formerly EXEC_YAP)
2541 Note that automated detection from the file-system or search path has
2542 been discontinued. INCOMPATIBILITY.
2544 * Scala layer provides JVM method invocation service for static
2545 methods of type (String)String, see Invoke_Scala.method in ML. For
2548 Invoke_Scala.method "java.lang.System.getProperty" "java.home"
2550 Together with YXML.string_of_body/parse_body and XML.Encode/Decode
2551 this allows to pass structured values between ML and Scala.
2553 * The IsabelleText fonts includes some further glyphs to support the
2554 Prover IDE. Potential INCOMPATIBILITY: users who happen to have
2555 installed a local copy (which is normally *not* required) need to
2556 delete or update it from ~~/lib/fonts/.
2560 New in Isabelle2011 (January 2011)
2561 ----------------------------------
2565 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
2566 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
2567 useful tooltips and hyperlinks produced from its static analysis. The
2568 bundled component provides an executable Isabelle tool that can be run
2571 Isabelle2011/bin/isabelle jedit
2573 * Significantly improved Isabelle/Isar implementation manual.
2575 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
2576 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
2577 while the default heap location within that directory lacks that extra
2578 suffix. This isolates multiple Isabelle installations from each
2579 other, avoiding problems with old settings in new versions.
2580 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
2582 * Source files are always encoded as UTF-8, instead of old-fashioned
2583 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
2584 the following package declarations:
2586 \usepackage[utf8]{inputenc}
2587 \usepackage{textcomp}
2589 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
2590 a Unicode character is treated as a single symbol, not a sequence of
2591 non-ASCII bytes as before. Since Isabelle/ML string literals may
2592 contain symbols without further backslash escapes, Unicode can now be
2593 used here as well. Recall that Symbol.explode in ML provides a
2594 consistent view on symbols, while raw explode (or String.explode)
2595 merely give a byte-oriented representation.
2597 * Theory loader: source files are primarily located via the master
2598 directory of each theory node (where the .thy file itself resides).
2599 The global load path is still partially available as legacy feature.
2600 Minor INCOMPATIBILITY due to subtle change in file lookup: use
2601 explicit paths, relatively to the theory.
2603 * Special treatment of ML file names has been discontinued.
2604 Historically, optional extensions .ML or .sml were added on demand --
2605 at the cost of clarity of file dependencies. Recall that Isabelle/ML
2606 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
2608 * Various options that affect pretty printing etc. are now properly
2609 handled within the context via configuration options, instead of
2610 unsynchronized references or print modes. There are both ML Config.T
2611 entities and Isar declaration attributes to access these.
2613 ML (Config.T) Isar (attribute)
2615 eta_contract eta_contract
2616 show_brackets show_brackets
2617 show_sorts show_sorts
2618 show_types show_types
2619 show_question_marks show_question_marks
2620 show_consts show_consts
2621 show_abbrevs show_abbrevs
2623 Syntax.ast_trace syntax_ast_trace
2624 Syntax.ast_stat syntax_ast_stat
2625 Syntax.ambiguity_level syntax_ambiguity_level
2627 Goal_Display.goals_limit goals_limit
2628 Goal_Display.show_main_goal show_main_goal
2630 Method.rule_trace rule_trace
2632 Thy_Output.display thy_output_display
2633 Thy_Output.quotes thy_output_quotes
2634 Thy_Output.indent thy_output_indent
2635 Thy_Output.source thy_output_source
2636 Thy_Output.break thy_output_break
2638 Note that corresponding "..._default" references in ML may only be
2639 changed globally at the ROOT session setup, but *not* within a theory.
2640 The option "show_abbrevs" supersedes the former print mode
2641 "no_abbrevs" with inverted meaning.
2643 * More systematic naming of some configuration options.
2646 trace_simp ~> simp_trace
2647 debug_simp ~> simp_debug
2649 * Support for real valued configuration options, using simplistic
2650 floating-point notation that coincides with the inner syntax for
2653 * Support for real valued preferences (with approximative PGIP type):
2654 front-ends need to accept "pgint" values in float notation.
2657 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
2660 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
2665 * Command 'type_synonym' (with single argument) replaces somewhat
2666 outdated 'types', which is still available as legacy feature for some
2669 * Command 'nonterminal' (with 'and' separated list of arguments)
2670 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
2672 * Command 'notepad' replaces former 'example_proof' for
2673 experimentation in Isar without any result. INCOMPATIBILITY.
2675 * Locale interpretation commands 'interpret' and 'sublocale' accept
2676 lists of equations to map definitions in a locale to appropriate
2677 entities in the context of the interpretation. The 'interpretation'
2678 command already provided this functionality.
2680 * Diagnostic command 'print_dependencies' prints the locale instances
2681 that would be activated if the specified expression was interpreted in
2682 the current context. Variant "print_dependencies!" assumes a context
2683 without interpretations.
2685 * Diagnostic command 'print_interps' prints interpretations in proofs
2686 in addition to interpretations in theories.
2688 * Discontinued obsolete 'global' and 'local' commands to manipulate
2689 the theory name space. Rare INCOMPATIBILITY. The ML functions
2690 Sign.root_path and Sign.local_path may be applied directly where this
2691 feature is still required for historical reasons.
2693 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
2694 'definition' instead.
2696 * The "prems" fact, which refers to the accidental collection of
2697 foundational premises in the context, is now explicitly marked as
2698 legacy feature and will be discontinued soon. Consider using "assms"
2699 of the head statement or reference facts by explicit names.
2701 * Document antiquotations @{class} and @{type} print classes and type
2704 * Document antiquotation @{file} checks file/directory entries within
2705 the local file system.
2710 * Coercive subtyping: functions can be declared as coercions and type
2711 inference will add them as necessary upon input of a term. Theory
2712 Complex_Main declares real :: nat => real and real :: int => real as
2713 coercions. A coercion function f is declared like this:
2715 declare [[coercion f]]
2717 To lift coercions through type constructors (e.g. from nat => real to
2718 nat list => real list), map functions can be declared, e.g.
2720 declare [[coercion_map map]]
2722 Currently coercion inference is activated only in theories including
2723 real numbers, i.e. descendants of Complex_Main. This is controlled by
2724 the configuration option "coercion_enabled", e.g. it can be enabled in
2725 other theories like this:
2727 declare [[coercion_enabled]]
2729 * Command 'partial_function' provides basic support for recursive
2730 function definitions over complete partial orders. Concrete instances
2731 are provided for i) the option type, ii) tail recursion on arbitrary
2732 types, and iii) the heap monad of Imperative_HOL. See
2733 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
2736 * Function package: f.psimps rules are no longer implicitly declared
2737 as [simp]. INCOMPATIBILITY.
2739 * Datatype package: theorems generated for executable equality (class
2740 "eq") carry proper names and are treated as default code equations.
2742 * Inductive package: now offers command 'inductive_simps' to
2743 automatically derive instantiated and simplified equations for
2744 inductive predicates, similar to 'inductive_cases'.
2746 * Command 'enriched_type' allows to register properties of the
2747 functorial structure of types.
2749 * Improved infrastructure for term evaluation using code generator
2750 techniques, in particular static evaluation conversions.
2752 * Code generator: Scala (2.8 or higher) has been added to the target
2755 * Code generator: globbing constant expressions "*" and "Theory.*"
2756 have been replaced by the more idiomatic "_" and "Theory._".
2759 * Code generator: export_code without explicit file declaration prints
2760 to standard output. INCOMPATIBILITY.
2762 * Code generator: do not print function definitions for case
2763 combinators any longer.
2765 * Code generator: simplification with rules determined with
2766 src/Tools/Code/code_simp.ML and method "code_simp".
2768 * Code generator for records: more idiomatic representation of record
2769 types. Warning: records are not covered by ancient SML code
2770 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
2771 rep_datatype declaration helps to succeed then:
2775 rep_datatype foo_ext ...
2777 * Records: logical foundation type for records does not carry a
2778 '_type' suffix any longer (obsolete due to authentic syntax).
2781 * Quickcheck now by default uses exhaustive testing instead of random
2782 testing. Random testing can be invoked by "quickcheck [random]",
2783 exhaustive testing by "quickcheck [exhaustive]".
2785 * Quickcheck instantiates polymorphic types with small finite
2786 datatypes by default. This enables a simple execution mechanism to
2787 handle quantifiers and function equality over the finite datatypes.
2789 * Quickcheck random generator has been renamed from "code" to
2790 "random". INCOMPATIBILITY.
2792 * Quickcheck now has a configurable time limit which is set to 30
2793 seconds by default. This can be changed by adding [timeout = n] to the
2794 quickcheck command. The time limit for Auto Quickcheck is still set
2797 * Quickcheck in locales considers interpretations of that locale for
2798 counter example search.
2801 - Added "smt" and "remote_smt" provers based on the "smt" proof
2802 method. See the Sledgehammer manual for details ("isabelle doc
2805 sledgehammer atp_info ~> sledgehammer running_provers
2806 sledgehammer atp_kill ~> sledgehammer kill_provers
2807 sledgehammer available_atps ~> sledgehammer available_provers
2810 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
2811 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
2812 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
2813 (and "ms" and "min" are no longer supported)
2818 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
2819 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
2821 - Added support for partial quotient types.
2822 - Added local versions of the "Nitpick.register_xxx" functions.
2823 - Added "whack" option.
2824 - Allow registration of quotient types as codatatypes.
2825 - Improved "merge_type_vars" option to merge more types.
2826 - Removed unsound "fast_descrs" option.
2827 - Added custom symmetry breaking for datatypes, making it possible to reach
2828 higher cardinalities.
2829 - Prevent the expansion of too large definitions.
2831 * Proof methods "metis" and "meson" now have configuration options
2832 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
2833 to diagnose these tools. E.g.
2835 using [[metis_trace = true]]
2837 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
2838 manually as command 'solve_direct'.
2840 * The default SMT solver Z3 must be enabled explicitly (due to
2841 licensing issues) by setting the environment variable
2842 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
2843 commercial applications, the SMT solver CVC3 is provided as fall-back;
2844 changing the SMT solver is done via the configuration option
2847 * Remote SMT solvers need to be referred to by the "remote_" prefix,
2848 i.e. "remote_cvc3" and "remote_z3".
2850 * Added basic SMT support for datatypes, records, and typedefs using
2851 the oracle mode (no proofs). Direct support of pairs has been dropped
2852 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
2853 support for a similar behavior). Minor INCOMPATIBILITY.
2855 * Changed SMT configuration options:
2857 z3_proofs ~> smt_oracle (with inverted meaning)
2858 z3_trace_assms ~> smt_trace_used_facts
2871 * Boogie output files (.b2i files) need to be declared in the theory
2874 * Simplification procedure "list_to_set_comprehension" rewrites list
2875 comprehensions applied to List.set to set comprehensions. Occasional
2876 INCOMPATIBILITY, may be deactivated like this:
2878 declare [[simproc del: list_to_set_comprehension]]
2880 * Removed old version of primrec package. INCOMPATIBILITY.
2882 * Removed simplifier congruence rule of "prod_case", as has for long
2883 been the case with "split". INCOMPATIBILITY.
2885 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
2887 * Removed [split_format ... and ... and ...] version of
2888 [split_format]. Potential INCOMPATIBILITY.
2890 * Predicate "sorted" now defined inductively, with nice induction
2891 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
2893 * Constant "contents" renamed to "the_elem", to free the generic name
2894 contents for other uses. INCOMPATIBILITY.
2896 * Renamed class eq and constant eq (for code generation) to class
2897 equal and constant equal, plus renaming of related facts and various
2898 tuning. INCOMPATIBILITY.
2900 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
2902 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
2905 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
2906 avoid confusion with finite sets. INCOMPATIBILITY.
2908 * Abandoned locales equiv, congruent and congruent2 for equivalence
2909 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
2912 * Some previously unqualified names have been qualified:
2919 Trueprop ~> HOL.Trueprop
2924 op --> ~> HOL.implies
2936 Pair ~> Product_Type.Pair
2937 fst ~> Product_Type.fst
2938 snd ~> Product_Type.snd
2939 curry ~> Product_Type.curry
2941 Collect ~> Set.Collect
2945 * More canonical naming convention for some fundamental definitions:
2947 bot_bool_eq ~> bot_bool_def
2948 top_bool_eq ~> top_bool_def
2949 inf_bool_eq ~> inf_bool_def
2950 sup_bool_eq ~> sup_bool_def
2951 bot_fun_eq ~> bot_fun_def
2952 top_fun_eq ~> top_fun_def
2953 inf_fun_eq ~> inf_fun_def
2954 sup_fun_eq ~> sup_fun_def
2958 * More stylized fact names:
2960 expand_fun_eq ~> fun_eq_iff
2961 expand_set_eq ~> set_eq_iff
2963 nat_number ~> eval_nat_numeral
2967 * Refactoring of code-generation specific operations in theory List:
2973 mem_iff ~> member_def
2974 null_empty ~> null_def
2976 INCOMPATIBILITY. Note that these were not supposed to be used
2977 regularly unless for striking reasons; their main purpose was code
2980 Various operations from the Haskell prelude are used for generating
2983 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
2984 "surj f" is now an abbreviation of "range f = UNIV". The theorems
2985 bij_def and surj_def are unchanged. INCOMPATIBILITY.
2987 * Abolished some non-alphabetic type names: "prod" and "sum" replace
2988 "*" and "+" respectively. INCOMPATIBILITY.
2990 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
2991 "Sum_Type.Plus" instead.
2993 * Constant "split" has been merged with constant "prod_case"; names of
2994 ML functions, facts etc. involving split have been retained so far,
2995 though. INCOMPATIBILITY.
2997 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
2998 instead. INCOMPATIBILITY.
3000 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
3003 * Former theory Library/Enum is now part of the HOL-Main image.
3004 INCOMPATIBILITY: all constants of the Enum theory now have to be
3005 referred to by its qualified name.
3008 nlists ~> Enum.nlists
3009 product ~> Enum.product
3011 * Theory Library/Monad_Syntax provides do-syntax for monad types.
3012 Syntax in Library/State_Monad has been changed to avoid ambiguities.
3015 * Theory Library/SetsAndFunctions has been split into
3016 Library/Function_Algebras and Library/Set_Algebras; canonical names
3017 for instance definitions for functions; various improvements.
3020 * Theory Library/Multiset provides stable quicksort implementation of
3023 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
3026 * Session Multivariate_Analysis: introduced a type class for euclidean
3027 space. Most theorems are now stated in terms of euclidean spaces
3028 instead of finite cartesian products.
3031 real ^ 'n ~> 'a::real_vector
3032 ~> 'a::euclidean_space
3033 ~> 'a::ordered_euclidean_space
3034 (depends on your needs)
3038 \<chi> x. _ ~> \<chi>\<chi> x. _
3041 Also note that the indices are now natural numbers and not from some
3042 finite type. Finite cartesian products of euclidean spaces, products
3043 of euclidean spaces the real and complex numbers are instantiated to
3044 be euclidean_spaces. INCOMPATIBILITY.
3046 * Session Probability: introduced pextreal as positive extended real
3047 numbers. Use pextreal as value for measures. Introduce the
3048 Radon-Nikodym derivative, product spaces and Fubini's theorem for
3049 arbitrary sigma finite measures. Introduces Lebesgue measure based on
3050 the integral in Multivariate Analysis. INCOMPATIBILITY.
3052 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
3055 * Session SPARK (with image HOL-SPARK) provides commands to load and
3056 prove verification conditions generated by the SPARK Ada program
3057 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
3062 * Theorems for additive ring operations (locale abelian_monoid and
3063 descendants) are generated by interpretation from their multiplicative
3064 counterparts. Names (in particular theorem names) have the mandatory
3065 qualifier 'add'. Previous theorem names are redeclared for
3068 * Structure "int_ring" is now an abbreviation (previously a
3069 definition). This fits more natural with advanced interpretations.
3074 * The domain package now runs in definitional mode by default: The
3075 former command 'new_domain' is now called 'domain'. To use the domain
3076 package in its original axiomatic mode, use 'domain (unsafe)'.
3079 * The new class "domain" is now the default sort. Class "predomain"
3080 is an unpointed version of "domain". Theories can be updated by
3081 replacing sort annotations as shown below. INCOMPATIBILITY.
3083 'a::type ~> 'a::countable
3084 'a::cpo ~> 'a::predomain
3085 'a::pcpo ~> 'a::domain
3087 * The old type class "rep" has been superseded by class "domain".
3088 Accordingly, users of the definitional package must remove any
3089 "default_sort rep" declarations. INCOMPATIBILITY.
3091 * The domain package (definitional mode) now supports unpointed
3092 predomain argument types, as long as they are marked 'lazy'. (Strict
3093 arguments must be in class "domain".) For example, the following
3094 domain definition now works:
3096 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
3098 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
3099 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
3100 'a option, and 'a list. Additionally, it configures fixrec and the
3101 domain package to work with these types. For example:
3103 fixrec isInl :: "('a + 'b) u -> tr"
3104 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
3106 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
3108 * The "(permissive)" option of fixrec has been replaced with a
3109 per-equation "(unchecked)" option. See
3110 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
3112 * The "bifinite" class no longer fixes a constant "approx"; the class
3113 now just asserts that such a function exists. INCOMPATIBILITY.
3115 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
3116 defines an embedding of type 'a defl into udom by default; instances
3117 of "bifinite" and "domain" classes are available in
3118 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
3120 * The syntax "REP('a)" has been replaced with "DEFL('a)".
3122 * The predicate "directed" has been removed. INCOMPATIBILITY.
3124 * The type class "finite_po" has been removed. INCOMPATIBILITY.
3126 * The function "cprod_map" has been renamed to "prod_map".
3129 * The monadic bind operator on each powerdomain has new binder syntax
3130 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
3131 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
3133 * The infix syntax for binary union on each powerdomain has changed
3134 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
3135 syntax. INCOMPATIBILITY.
3137 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
3138 still supported as an input translation.
3140 * Renamed some theorems (the original names are also still available).
3142 expand_fun_below ~> fun_below_iff
3143 below_fun_ext ~> fun_belowI
3144 expand_cfun_eq ~> cfun_eq_iff
3145 ext_cfun ~> cfun_eqI
3146 expand_cfun_below ~> cfun_below_iff
3147 below_cfun_ext ~> cfun_belowI
3148 cont2cont_Rep_CFun ~> cont2cont_APP
3150 * The Abs and Rep functions for various types have changed names.
3151 Related theorem names have also changed to match. INCOMPATIBILITY.
3153 Rep_CFun ~> Rep_cfun
3154 Abs_CFun ~> Abs_cfun
3155 Rep_Sprod ~> Rep_sprod
3156 Abs_Sprod ~> Abs_sprod
3157 Rep_Ssum ~> Rep_ssum
3158 Abs_Ssum ~> Abs_ssum
3160 * Lemmas with names of the form *_defined_iff or *_strict_iff have
3161 been renamed to *_bottom_iff. INCOMPATIBILITY.
3163 * Various changes to bisimulation/coinduction with domain package:
3165 - Definitions of "bisim" constants no longer mention definedness.
3166 - With mutual recursion, "bisim" predicate is now curried.
3167 - With mutual recursion, each type gets a separate coind theorem.
3168 - Variable names in bisim_def and coinduct rules have changed.
3172 * Case combinators generated by the domain package for type "foo" are
3173 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
3175 * Several theorems have been renamed to more accurately reflect the
3176 names of constants and types involved. INCOMPATIBILITY.
3178 thelub_const ~> lub_const
3179 lub_const ~> is_lub_const
3181 is_lub_lub ~> is_lubD2
3183 unique_lub ~> is_lub_unique
3184 is_ub_lub ~> is_lub_rangeD1
3185 lub_bin_chain ~> is_lub_bin_chain
3186 lub_fun ~> is_lub_fun
3187 thelub_fun ~> lub_fun
3188 thelub_cfun ~> lub_cfun
3189 thelub_Pair ~> lub_Pair
3190 lub_cprod ~> is_lub_prod
3191 thelub_cprod ~> lub_prod
3192 minimal_cprod ~> minimal_prod
3193 inst_cprod_pcpo ~> inst_prod_pcpo
3195 compact_UU ~> compact_bottom
3196 deflation_UU ~> deflation_bottom
3197 finite_deflation_UU ~> finite_deflation_bottom
3199 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
3201 sq_ord_less_eq_trans ~> below_eq_trans
3202 sq_ord_eq_less_trans ~> eq_below_trans
3203 refl_less ~> below_refl
3204 trans_less ~> below_trans
3205 antisym_less ~> below_antisym
3206 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
3207 box_less ~> box_below
3208 rev_trans_less ~> rev_below_trans
3209 not_less2not_eq ~> not_below2not_eq
3210 less_UU_iff ~> below_UU_iff
3211 flat_less_iff ~> flat_below_iff
3212 adm_less ~> adm_below
3213 adm_not_less ~> adm_not_below
3214 adm_compact_not_less ~> adm_compact_not_below
3215 less_fun_def ~> below_fun_def
3216 expand_fun_less ~> fun_below_iff
3217 less_fun_ext ~> fun_belowI
3218 less_discr_def ~> below_discr_def
3219 discr_less_eq ~> discr_below_eq
3220 less_unit_def ~> below_unit_def
3221 less_cprod_def ~> below_prod_def
3222 prod_lessI ~> prod_belowI
3223 Pair_less_iff ~> Pair_below_iff
3224 fst_less_iff ~> fst_below_iff
3225 snd_less_iff ~> snd_below_iff
3226 expand_cfun_less ~> cfun_below_iff
3227 less_cfun_ext ~> cfun_belowI
3228 injection_less ~> injection_below
3229 less_up_def ~> below_up_def
3230 not_Iup_less ~> not_Iup_below
3231 Iup_less ~> Iup_below
3233 Def_inject_less_eq ~> Def_below_Def
3234 Def_less_is_eq ~> Def_below_iff
3235 spair_less_iff ~> spair_below_iff
3236 less_sprod ~> below_sprod
3237 spair_less ~> spair_below
3238 sfst_less_iff ~> sfst_below_iff
3239 ssnd_less_iff ~> ssnd_below_iff
3240 fix_least_less ~> fix_least_below
3241 dist_less_one ~> dist_below_one
3242 less_ONE ~> below_ONE
3243 ONE_less_iff ~> ONE_below_iff
3244 less_sinlD ~> below_sinlD
3245 less_sinrD ~> below_sinrD
3250 * All constant names are now qualified internally and use proper
3251 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
3256 * Antiquotation @{assert} inlines a function bool -> unit that raises
3257 Fail if the argument is false. Due to inlining the source position of
3258 failed assertions is included in the error output.
3260 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
3261 text is in practice always evaluated with a stable theory checkpoint.
3262 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
3264 * Antiquotation @{theory A} refers to theory A from the ancestry of
3265 the current context, not any accidental theory loader state as before.
3266 Potential INCOMPATIBILITY, subtle change in semantics.
3268 * Syntax.pretty_priority (default 0) configures the required priority
3269 of pretty-printed output and thus affects insertion of parentheses.
3271 * Syntax.default_root (default "any") configures the inner syntax
3272 category (nonterminal symbol) for parsing of terms.
3274 * Former exception Library.UnequalLengths now coincides with
3275 ListPair.UnequalLengths.
3277 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
3278 main functionality is provided by structure Simplifier.
3280 * Renamed raw "explode" function to "raw_explode" to emphasize its
3281 meaning. Note that internally to Isabelle, Symbol.explode is used in
3282 almost all situations.
3284 * Discontinued obsolete function sys_error and exception SYS_ERROR.
3285 See implementation manual for further details on exceptions in
3288 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
3291 * Renamed structure PureThy to Pure_Thy and moved most of its
3292 operations to structure Global_Theory, to emphasize that this is
3293 rarely-used global-only stuff.
3295 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
3296 instead (or tracing for high-volume output).
3298 * Configuration option show_question_marks only affects regular pretty
3299 printing of types and terms, not raw Term.string_of_vname.
3301 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
3302 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
3303 @{thms} for most purposes.
3305 * ML structure Unsynchronized is never opened, not even in Isar
3306 interaction mode as before. Old Unsynchronized.set etc. have been
3307 discontinued -- use plain := instead. This should be *rare* anyway,
3308 since modern tools always work via official context data, notably
3309 configuration options.
3311 * Parallel and asynchronous execution requires special care concerning
3312 interrupts. Structure Exn provides some convenience functions that
3313 avoid working directly with raw Interrupt. User code must not absorb
3314 interrupts -- intermediate handling (for cleanup etc.) needs to be
3315 followed by re-raising of the original exception. Another common
3316 source of mistakes are "handle _" patterns, which make the meaning of
3317 the program subject to physical effects of the environment.
3321 New in Isabelle2009-2 (June 2010)
3322 ---------------------------------
3326 * Authentic syntax for *all* logical entities (type classes, type
3327 constructors, term constants): provides simple and robust
3328 correspondence between formal entities and concrete syntax. Within
3329 the parse tree / AST representations, "constants" are decorated by
3330 their category (class, type, const) and spelled out explicitly with
3331 their full internal name.
3333 Substantial INCOMPATIBILITY concerning low-level syntax declarations
3334 and translations (translation rules and translation functions in ML).
3335 Some hints on upgrading:
3337 - Many existing uses of 'syntax' and 'translations' can be replaced
3338 by more modern 'type_notation', 'notation' and 'abbreviation',
3339 which are independent of this issue.
3341 - 'translations' require markup within the AST; the term syntax
3342 provides the following special forms:
3344 CONST c -- produces syntax version of constant c from context
3345 XCONST c -- literally c, checked as constant from context
3346 c -- literally c, if declared by 'syntax'
3348 Plain identifiers are treated as AST variables -- occasionally the
3349 system indicates accidental variables via the error "rhs contains
3352 Type classes and type constructors are marked according to their
3353 concrete syntax. Some old translations rules need to be written
3354 for the "type" category, using type constructor application
3355 instead of pseudo-term application of the default category
3358 - 'parse_translation' etc. in ML may use the following
3361 @{class_syntax c} -- type class c within parse tree / AST
3362 @{term_syntax c} -- type constructor c within parse tree / AST
3363 @{const_syntax c} -- ML version of "CONST c" above
3364 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
3366 - Literal types within 'typed_print_translations', i.e. those *not*
3367 represented as pseudo-terms are represented verbatim. Use @{class
3368 c} or @{type_name c} here instead of the above syntax
3371 Note that old non-authentic syntax was based on unqualified base
3372 names, so all of the above "constant" names would coincide. Recall
3373 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
3374 diagnose syntax problems.
3376 * Type constructors admit general mixfix syntax, not just infix.
3378 * Concrete syntax may be attached to local entities without a proof
3379 body, too. This works via regular mixfix annotations for 'fix',
3380 'def', 'obtain' etc. or via the explicit 'write' command, which is
3381 similar to the 'notation' command in theory specifications.
3383 * Discontinued unnamed infix syntax (legacy feature for many years) --
3384 need to specify constant name and syntax separately. Internal ML
3385 datatype constructors have been renamed from InfixName to Infix etc.
3386 Minor INCOMPATIBILITY.
3388 * Schematic theorem statements need to be explicitly markup as such,
3389 via commands 'schematic_lemma', 'schematic_theorem',
3390 'schematic_corollary'. Thus the relevance of the proof is made
3391 syntactically clear, which impacts performance in a parallel or
3392 asynchronous interactive environment. Minor INCOMPATIBILITY.
3394 * Use of cumulative prems via "!" in some proof methods has been
3395 discontinued (old legacy feature).
3397 * References 'trace_simp' and 'debug_simp' have been replaced by
3398 configuration options stored in the context. Enabling tracing (the
3399 case of debugging is similar) in proofs works via
3401 using [[trace_simp = true]]
3403 Tracing is then active for all invocations of the simplifier in
3404 subsequent goal refinement steps. Tracing may also still be enabled or
3405 disabled via the ProofGeneral settings menu.
3407 * Separate commands 'hide_class', 'hide_type', 'hide_const',
3408 'hide_fact' replace the former 'hide' KIND command. Minor
3411 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
3412 more efficient than combinations with -q1 or -q2.
3417 * Proofterms record type-class reasoning explicitly, using the
3418 "unconstrain" operation internally. This eliminates all sort
3419 constraints from a theorem and proof, introducing explicit
3420 OFCLASS-premises. On the proof term level, this operation is
3421 automatically applied at theorem boundaries, such that closed proofs
3422 are always free of sort constraints. INCOMPATIBILITY for tools that
3423 inspect proof terms.
3425 * Local theory specifications may depend on extra type variables that
3426 are not present in the result type -- arguments TYPE('a) :: 'a itself
3427 are added internally. For example:
3429 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
3431 * Predicates of locales introduced by classes carry a mandatory
3432 "class" prefix. INCOMPATIBILITY.
3434 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
3436 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
3439 * Command 'code_reflect' allows to incorporate generated ML code into
3440 runtime environment; replaces immature code_datatype antiquotation.
3443 * Code generator: simple concept for abstract datatypes obeying
3446 * Code generator: details of internal data cache have no impact on the
3447 user space functionality any longer.
3449 * Methods "unfold_locales" and "intro_locales" ignore non-locale
3450 subgoals. This is more appropriate for interpretations with 'where'.
3453 * Command 'example_proof' opens an empty proof body. This allows to
3454 experiment with Isar, without producing any persistent result.
3456 * Commands 'type_notation' and 'no_type_notation' declare type syntax
3457 within a local theory context, with explicit checking of the
3458 constructors involved (in contrast to the raw 'syntax' versions).
3460 * Commands 'types' and 'typedecl' now work within a local theory
3461 context -- without introducing dependencies on parameters or
3462 assumptions, which is not possible in Isabelle/Pure.
3464 * Command 'defaultsort' has been renamed to 'default_sort', it works
3465 within a local theory context. Minor INCOMPATIBILITY.
3470 * Command 'typedef' now works within a local theory context -- without
3471 introducing dependencies on parameters or assumptions, which is not
3472 possible in Isabelle/Pure/HOL. Note that the logical environment may
3473 contain multiple interpretations of local typedefs (with different
3474 non-emptiness proofs), even in a global theory context.
3476 * New package for quotient types. Commands 'quotient_type' and
3477 'quotient_definition' may be used for defining types and constants by
3478 quotient constructions. An example is the type of integers created by
3479 quotienting pairs of natural numbers:
3482 intrel :: "(nat * nat) => (nat * nat) => bool"
3484 "intrel (x, y) (u, v) = (x + v = u + y)"
3486 quotient_type int = "nat * nat" / intrel
3487 by (auto simp add: equivp_def expand_fun_eq)
3490 "0::int" is "(0::nat, 0::nat)"
3492 The method "lifting" can be used to lift of theorems from the
3493 underlying "raw" type to the quotient type. The example
3494 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
3495 construction and provides a reasoning infrastructure for finite sets.
3497 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
3498 clash with new theory Quotient in Main HOL.
3500 * Moved the SMT binding into the main HOL session, eliminating
3501 separate HOL-SMT session.
3503 * List membership infix mem operation is only an input abbreviation.
3506 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
3507 for future developements; former Library/Word.thy is still present in
3508 the AFP entry RSAPPS.
3510 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
3511 longer shadowed. INCOMPATIBILITY.
3513 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
3516 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
3519 * Dropped normalizing_semiring etc; use the facts in semiring classes
3520 instead. INCOMPATIBILITY.
3522 * Dropped several real-specific versions of lemmas about floor and
3523 ceiling; use the generic lemmas from theory "Archimedean_Field"
3524 instead. INCOMPATIBILITY.
3526 floor_number_of_eq ~> floor_number_of
3527 le_floor_eq_number_of ~> number_of_le_floor
3528 le_floor_eq_zero ~> zero_le_floor
3529 le_floor_eq_one ~> one_le_floor
3530 floor_less_eq_number_of ~> floor_less_number_of
3531 floor_less_eq_zero ~> floor_less_zero
3532 floor_less_eq_one ~> floor_less_one
3533 less_floor_eq_number_of ~> number_of_less_floor
3534 less_floor_eq_zero ~> zero_less_floor
3535 less_floor_eq_one ~> one_less_floor
3536 floor_le_eq_number_of ~> floor_le_number_of
3537 floor_le_eq_zero ~> floor_le_zero
3538 floor_le_eq_one ~> floor_le_one
3539 floor_subtract_number_of ~> floor_diff_number_of
3540 floor_subtract_one ~> floor_diff_one
3541 ceiling_number_of_eq ~> ceiling_number_of
3542 ceiling_le_eq_number_of ~> ceiling_le_number_of
3543 ceiling_le_zero_eq ~> ceiling_le_zero
3544 ceiling_le_eq_one ~> ceiling_le_one
3545 less_ceiling_eq_number_of ~> number_of_less_ceiling
3546 less_ceiling_eq_zero ~> zero_less_ceiling
3547 less_ceiling_eq_one ~> one_less_ceiling
3548 ceiling_less_eq_number_of ~> ceiling_less_number_of
3549 ceiling_less_eq_zero ~> ceiling_less_zero
3550 ceiling_less_eq_one ~> ceiling_less_one
3551 le_ceiling_eq_number_of ~> number_of_le_ceiling
3552 le_ceiling_eq_zero ~> zero_le_ceiling
3553 le_ceiling_eq_one ~> one_le_ceiling
3554 ceiling_subtract_number_of ~> ceiling_diff_number_of
3555 ceiling_subtract_one ~> ceiling_diff_one
3557 * Theory "Finite_Set": various folding_XXX locales facilitate the
3558 application of the various fold combinators on finite sets.
3560 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
3561 provides abstract red-black tree type which is backed by "RBT_Impl" as
3562 implementation. INCOMPATIBILTY.
3564 * Theory Library/Coinductive_List has been removed -- superseded by
3565 AFP/thys/Coinductive.
3567 * Theory PReal, including the type "preal" and related operations, has
3568 been removed. INCOMPATIBILITY.
3570 * Real: new development using Cauchy Sequences.
3572 * Split off theory "Big_Operators" containing setsum, setprod,
3573 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
3575 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
3576 "Int" etc. INCOMPATIBILITY.
3578 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
3580 * New set of rules "ac_simps" provides combined assoc / commute
3581 rewrites for all interpretations of the appropriate generic locales.
3583 * Renamed theory "OrderedGroup" to "Groups" and split theory
3584 "Ring_and_Field" into theories "Rings" and "Fields"; for more
3585 appropriate and more consistent names suitable for name prefixes
3586 within the HOL theories. INCOMPATIBILITY.
3588 * Some generic constants have been put to appropriate theories:
3589 - less_eq, less: Orderings
3590 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
3591 - inverse, divide: Rings
3594 * More consistent naming of type classes involving orderings (and
3597 lower_semilattice ~> semilattice_inf
3598 upper_semilattice ~> semilattice_sup
3600 dense_linear_order ~> dense_linorder
3602 pordered_ab_group_add ~> ordered_ab_group_add
3603 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
3604 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
3605 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
3606 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
3607 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
3608 pordered_cancel_semiring ~> ordered_cancel_semiring
3609 pordered_comm_monoid_add ~> ordered_comm_monoid_add
3610 pordered_comm_ring ~> ordered_comm_ring
3611 pordered_comm_semiring ~> ordered_comm_semiring
3612 pordered_ring ~> ordered_ring
3613 pordered_ring_abs ~> ordered_ring_abs
3614 pordered_semiring ~> ordered_semiring
3616 ordered_ab_group_add ~> linordered_ab_group_add
3617 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
3618 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
3619 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
3620 ordered_field ~> linordered_field
3621 ordered_field_no_lb ~> linordered_field_no_lb
3622 ordered_field_no_ub ~> linordered_field_no_ub
3623 ordered_field_dense_linear_order ~> dense_linordered_field
3624 ordered_idom ~> linordered_idom
3625 ordered_ring ~> linordered_ring
3626 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
3627 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
3628 ordered_ring_strict ~> linordered_ring_strict
3629 ordered_semidom ~> linordered_semidom
3630 ordered_semiring ~> linordered_semiring
3631 ordered_semiring_1 ~> linordered_semiring_1
3632 ordered_semiring_1_strict ~> linordered_semiring_1_strict
3633 ordered_semiring_strict ~> linordered_semiring_strict
3635 The following slightly odd type classes have been moved to a
3636 separate theory Library/Lattice_Algebras:
3638 lordered_ab_group_add ~> lattice_ab_group_add
3639 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
3640 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
3641 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
3642 lordered_ring ~> lattice_ring
3646 * Refined field classes:
3647 - classes division_ring_inverse_zero, field_inverse_zero,
3648 linordered_field_inverse_zero include rule inverse 0 = 0 --
3649 subsumes former division_by_zero class;
3650 - numerous lemmas have been ported from field to division_ring.
3653 * Refined algebra theorem collections:
3654 - dropped theorem group group_simps, use algebra_simps instead;
3655 - dropped theorem group ring_simps, use field_simps instead;
3656 - proper theorem collection field_simps subsumes former theorem
3657 groups field_eq_simps and field_simps;
3658 - dropped lemma eq_minus_self_iff which is a duplicate for
3662 * Theory Finite_Set and List: some lemmas have been generalized from
3665 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
3666 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
3667 inter_Inter_fold_inter ~> inf_Inf_fold_inf
3668 union_Union_fold_union ~> sup_Sup_fold_sup
3669 Inter_fold_inter ~> Inf_fold_inf
3670 Union_fold_union ~> Sup_fold_sup
3671 inter_INTER_fold_inter ~> inf_INFI_fold_inf
3672 union_UNION_fold_union ~> sup_SUPR_fold_sup
3673 INTER_fold_inter ~> INFI_fold_inf
3674 UNION_fold_union ~> SUPR_fold_sup
3676 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
3677 replaced by the more convenient lemmas Inf_empty and Sup_empty.
3678 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
3679 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
3680 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
3681 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
3683 * Reorganized theory Multiset: swapped notation of pointwise and
3686 - pointwise ordering is instance of class order with standard syntax
3688 - multiset ordering has syntax <=# and <#; partial order properties
3689 are provided by means of interpretation with prefix
3691 - less duplication, less historical organization of sections,
3692 conversion from associations lists to multisets, rudimentary code
3694 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
3699 multiset_eq_conv_count_eq ~> multiset_ext_iff
3700 multi_count_ext ~> multiset_ext
3701 diff_union_inverse2 ~> diff_union_cancelR
3705 * Theory Permutation: replaced local "remove" by List.remove1.
3707 * Code generation: ML and OCaml code is decorated with signatures.
3709 * Theory List: added transpose.
3711 * Library/Nat_Bijection.thy is a collection of bijective functions
3712 between nat and other types, which supersedes the older libraries
3713 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
3716 Nat_Int_Bij.nat2_to_nat ~> prod_encode
3717 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
3718 Nat_Int_Bij.int_to_nat_bij ~> int_encode
3719 Nat_Int_Bij.nat_to_int_bij ~> int_decode
3720 Countable.pair_encode ~> prod_encode
3721 NatIso.prod2nat ~> prod_encode
3722 NatIso.nat2prod ~> prod_decode
3723 NatIso.sum2nat ~> sum_encode
3724 NatIso.nat2sum ~> sum_decode
3725 NatIso.list2nat ~> list_encode
3726 NatIso.nat2list ~> list_decode
3727 NatIso.set2nat ~> set_encode
3728 NatIso.nat2set ~> set_decode
3731 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
3732 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
3733 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
3734 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
3735 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
3736 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
3737 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
3738 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
3739 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
3740 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
3741 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
3742 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
3743 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
3746 - Renamed ATP commands:
3747 atp_info ~> sledgehammer running_atps
3748 atp_kill ~> sledgehammer kill_atps
3749 atp_messages ~> sledgehammer messages
3750 atp_minimize ~> sledgehammer minimize
3751 print_atps ~> sledgehammer available_atps
3753 - Added user's manual ("isabelle doc sledgehammer").
3754 - Added option syntax and "sledgehammer_params" to customize
3755 Sledgehammer's behavior. See the manual for details.
3756 - Modified the Isar proof reconstruction code so that it produces
3757 direct proofs rather than proofs by contradiction. (This feature
3758 is still experimental.)
3759 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
3761 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
3764 - Added and implemented "binary_ints" and "bits" options.
3765 - Added "std" option and implemented support for nonstandard models.
3766 - Added and implemented "finitize" option to improve the precision
3767 of infinite datatypes based on a monotonicity analysis.
3768 - Added support for quotient types.
3769 - Added support for "specification" and "ax_specification"
3771 - Added support for local definitions (for "function" and
3772 "termination" proofs).
3773 - Added support for term postprocessors.
3774 - Optimized "Multiset.multiset" and "FinFun.finfun".
3775 - Improved efficiency of "destroy_constrs" optimization.
3776 - Fixed soundness bugs related to "destroy_constrs" optimization and
3778 - Fixed soundness bug related to higher-order constructors.
3779 - Fixed soundness bug when "full_descrs" is enabled.
3780 - Improved precision of set constructs.
3781 - Added "atoms" option.
3782 - Added cache to speed up repeated Kodkod invocations on the same
3784 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
3785 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
3786 "SAT4J_Light". INCOMPATIBILITY.
3787 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
3788 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
3789 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
3791 * Method "induct" now takes instantiations of the form t, where t is not
3792 a variable, as a shorthand for "x == t", where x is a fresh variable.
3793 If this is not intended, t has to be enclosed in parentheses.
3794 By default, the equalities generated by definitional instantiations
3795 are pre-simplified, which may cause parameters of inductive cases
3796 to disappear, or may even delete some of the inductive cases.
3797 Use "induct (no_simp)" instead of "induct" to restore the old
3798 behaviour. The (no_simp) option is also understood by the "cases"
3799 and "nominal_induct" methods, which now perform pre-simplification, too.
3805 * Variable names in lemmas generated by the domain package have
3806 changed; the naming scheme is now consistent with the HOL datatype
3807 package. Some proof scripts may be affected, INCOMPATIBILITY.
3809 * The domain package no longer defines the function "foo_copy" for
3810 recursive domain "foo". The reach lemma is now stated directly in
3811 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
3812 be reformulated in terms of "foo_take", INCOMPATIBILITY.
3814 * Most definedness lemmas generated by the domain package (previously
3815 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
3816 like "foo$x = UU <-> x = UU", which works better as a simp rule.
3817 Proofs that used definedness lemmas as intro rules may break,
3818 potential INCOMPATIBILITY.
3820 * Induction and casedist rules generated by the domain package now
3821 declare proper case_names (one called "bottom", and one named for each
3822 constructor). INCOMPATIBILITY.
3824 * For mutually-recursive domains, separate "reach" and "take_lemma"
3825 rules are generated for each domain, INCOMPATIBILITY.
3827 foo_bar.reach ~> foo.reach bar.reach
3828 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
3830 * Some lemmas generated by the domain package have been renamed for
3831 consistency with the datatype package, INCOMPATIBILITY.
3833 foo.ind ~> foo.induct
3834 foo.finite_ind ~> foo.finite_induct
3835 foo.coind ~> foo.coinduct
3836 foo.casedist ~> foo.exhaust
3837 foo.exhaust ~> foo.nchotomy
3839 * For consistency with other definition packages, the fixrec package
3840 now generates qualified theorem names, INCOMPATIBILITY.
3842 foo_simps ~> foo.simps
3843 foo_unfold ~> foo.unfold
3844 foo_induct ~> foo.induct
3846 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
3847 method and internal fixrec proofs now use the default simpset instead.
3850 * The "contlub" predicate has been removed. Proof scripts should use
3851 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
3853 * The "admw" predicate has been removed, INCOMPATIBILITY.
3855 * The constants cpair, cfst, and csnd have been removed in favor of
3856 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
3861 * Antiquotations for basic formal entities:
3863 @{class NAME} -- type class
3864 @{class_syntax NAME} -- syntax representation of the above
3866 @{type_name NAME} -- logical type
3867 @{type_abbrev NAME} -- type abbreviation
3868 @{nonterminal NAME} -- type of concrete syntactic category
3869 @{type_syntax NAME} -- syntax representation of any of the above
3871 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
3872 @{const_abbrev NAME} -- abbreviated constant
3873 @{const_syntax NAME} -- syntax representation of any of the above
3875 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
3876 syntax constant (cf. 'syntax' command).
3878 * Antiquotation @{make_string} inlines a function to print arbitrary
3879 values similar to the ML toplevel. The result is compiler dependent
3880 and may fall back on "?" in certain situations.
3882 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
3883 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
3884 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
3885 not work with the asynchronous Isar document model.
3887 * Configuration options now admit dynamic default values, depending on
3888 the context or even global references.
3890 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
3891 uses an efficient external library if available (for Poly/ML).
3893 * Renamed some important ML structures, while keeping the old names
3894 for some time as aliases within the structure Legacy:
3896 OuterKeyword ~> Keyword
3899 OuterSyntax ~> Outer_Syntax
3900 PrintMode ~> Print_Mode
3901 SpecParse ~> Parse_Spec
3904 ThyOutput ~> Thy_Output
3905 TypeInfer ~> Type_Infer
3907 Note that "open Legacy" simplifies porting of sources, but forgetting
3908 to remove it again will complicate porting again in the future.
3910 * Most operations that refer to a global context are named
3911 accordingly, e.g. Simplifier.global_context or
3912 ProofContext.init_global. There are some situations where a global
3913 context actually works, but under normal circumstances one needs to
3914 pass the proper local context through the code!
3916 * Discontinued old TheoryDataFun with its copy/init operation -- data
3917 needs to be pure. Functor Theory_Data_PP retains the traditional
3918 Pretty.pp argument to merge, which is absent in the standard
3919 Theory_Data version.
3921 * Sorts.certify_sort and derived "cert" operations for types and terms
3922 no longer minimize sorts. Thus certification at the boundary of the
3923 inference kernel becomes invariant under addition of class relations,
3924 which is an important monotonicity principle. Sorts are now minimized
3925 in the syntax layer only, at the boundary between the end-user and the
3926 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
3927 explicitly in rare situations.
3929 * Renamed old-style Drule.standard to Drule.export_without_context, to
3930 emphasize that this is in no way a standard operation.
3933 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
3934 usual for resolution. Rare INCOMPATIBILITY.
3936 * Renamed varify/unvarify operations to varify_global/unvarify_global
3937 to emphasize that these only work in a global situation (which is
3940 * Curried take and drop in library.ML; negative length is interpreted
3941 as infinity (as in chop). Subtle INCOMPATIBILITY.
3943 * Proof terms: type substitutions on proof constants now use canonical
3944 order of type variables. INCOMPATIBILITY for tools working with proof
3947 * Raw axioms/defs may no longer carry sort constraints, and raw defs
3948 may no longer carry premises. User-level specifications are
3949 transformed accordingly by Thm.add_axiom/add_def.
3954 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
3955 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
3956 proof terms are enabled unconditionally in the new HOL-Proofs image.
3958 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
3959 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
3962 * Old lib/scripts/polyml-platform is superseded by the
3963 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
3964 variant, even on a 64 bit machine. The following example setting
3965 prefers 64 bit if available:
3967 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
3969 * The preliminary Isabelle/jEdit application demonstrates the emerging
3970 Isabelle/Scala layer for advanced prover interaction and integration.
3971 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
3974 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
3975 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
3976 similar to the default assignment of the document preparation system
3977 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
3978 provides some operations for direct access to the font without asking
3979 the user for manual installation.
3983 New in Isabelle2009-1 (December 2009)
3984 -------------------------------------
3988 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
3989 one backslash should be used, even in ML sources.
3994 * Locale interpretation propagates mixins along the locale hierarchy.
3995 The currently only available mixins are the equations used to map
3996 local definitions to terms of the target domain of an interpretation.
3998 * Reactivated diagnostic command 'print_interps'. Use "print_interps
3999 loc" to print all interpretations of locale "loc" in the theory.
4000 Interpretations in proofs are not shown.
4002 * Thoroughly revised locales tutorial. New section on conditional
4005 * On instantiation of classes, remaining undefined class parameters
4006 are formally declared. INCOMPATIBILITY.
4009 *** Document preparation ***
4011 * New generalized style concept for printing terms: @{foo (style) ...}
4012 instead of @{foo_style style ...} (old form is still retained for
4013 backward compatibility). Styles can be also applied for
4014 antiquotations prop, term_type and typeof.
4019 * New proof method "smt" for a combination of first-order logic with
4020 equality, linear and nonlinear (natural/integer/real) arithmetic, and
4021 fixed-size bitvectors; there is also basic support for higher-order
4022 features (esp. lambda abstractions). It is an incomplete decision
4023 procedure based on external SMT solvers using the oracle mechanism;
4024 for the SMT solver Z3, this method is proof-producing. Certificates
4025 are provided to avoid calling the external solvers solely for
4026 re-checking proofs. Due to a remote SMT service there is no need for
4027 installing SMT solvers locally. See src/HOL/SMT.
4029 * New commands to load and prove verification conditions generated by
4030 the Boogie program verifier or derived systems (e.g. the Verifying C
4031 Compiler (VCC) or Spec#). See src/HOL/Boogie.
4033 * New counterexample generator tool 'nitpick' based on the Kodkod
4034 relational model finder. See src/HOL/Tools/Nitpick and
4035 src/HOL/Nitpick_Examples.
4037 * New commands 'code_pred' and 'values' to invoke the predicate
4038 compiler and to enumerate values of inductive predicates.
4040 * A tabled implementation of the reflexive transitive closure.
4042 * New implementation of quickcheck uses generic code generator;
4043 default generators are provided for all suitable HOL types, records
4044 and datatypes. Old quickcheck can be re-activated importing theory
4045 Library/SML_Quickcheck.
4047 * New testing tool Mirabelle for automated proof tools. Applies
4048 several tools and tactics like sledgehammer, metis, or quickcheck, to
4049 every proof step in a theory. To be used in batch mode via the
4050 "mirabelle" utility.
4052 * New proof method "sos" (sum of squares) for nonlinear real
4053 arithmetic (originally due to John Harison). It requires theory
4054 Library/Sum_Of_Squares. It is not a complete decision procedure but
4055 works well in practice on quantifier-free real arithmetic with +, -,
4056 *, ^, =, <= and <, i.e. boolean combinations of equalities and
4057 inequalities between polynomials. It makes use of external
4058 semidefinite programming solvers. Method "sos" generates a
4059 certificate that can be pasted into the proof thus avoiding the need
4060 to call an external tool every time the proof is checked. See
4061 src/HOL/Library/Sum_Of_Squares.
4063 * New method "linarith" invokes existing linear arithmetic decision
4066 * New command 'atp_minimal' reduces result produced by Sledgehammer.
4068 * New Sledgehammer option "Full Types" in Proof General settings menu.
4069 Causes full type information to be output to the ATPs. This slows
4070 ATPs down considerably but eliminates a source of unsound "proofs"
4073 * New method "metisFT": A version of metis that uses full type
4074 information in order to avoid failures of proof reconstruction.
4076 * New evaluator "approximate" approximates an real valued term using
4077 the same method as the approximation method.
4079 * Method "approximate" now supports arithmetic expressions as
4080 boundaries of intervals and implements interval splitting and Taylor
4083 * ML antiquotation @{code_datatype} inserts definition of a datatype
4084 generated by the code generator; e.g. see src/HOL/Predicate.thy.
4086 * New theory SupInf of the supremum and infimum operators for sets of
4089 * New theory Probability, which contains a development of measure
4090 theory, eventually leading to Lebesgue integration and probability.
4092 * Extended Multivariate Analysis to include derivation and Brouwer's
4095 * Reorganization of number theory, INCOMPATIBILITY:
4096 - new number theory development for nat and int, in theories Divides
4097 and GCD as well as in new session Number_Theory
4098 - some constants and facts now suffixed with _nat and _int
4100 - former session NumberTheory now named Old_Number_Theory, including
4101 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
4102 - moved theory Pocklington from src/HOL/Library to
4103 src/HOL/Old_Number_Theory
4105 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
4106 lcm of finite and infinite sets. It is shown that they form a complete
4109 * Class semiring_div requires superclass no_zero_divisors and proof of
4110 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
4111 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
4112 generalized to class semiring_div, subsuming former theorems
4113 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
4114 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
4117 * Refinements to lattice classes and sets:
4118 - less default intro/elim rules in locale variant, more default
4119 intro/elim rules in class variant: more uniformity
4120 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
4122 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
4124 - renamed ACI to inf_sup_aci
4125 - new class "boolean_algebra"
4126 - class "complete_lattice" moved to separate theory
4127 "Complete_Lattice"; corresponding constants (and abbreviations)
4128 renamed and with authentic syntax:
4129 Set.Inf ~> Complete_Lattice.Inf
4130 Set.Sup ~> Complete_Lattice.Sup
4131 Set.INFI ~> Complete_Lattice.INFI
4132 Set.SUPR ~> Complete_Lattice.SUPR
4133 Set.Inter ~> Complete_Lattice.Inter
4134 Set.Union ~> Complete_Lattice.Union
4135 Set.INTER ~> Complete_Lattice.INTER
4136 Set.UNION ~> Complete_Lattice.UNION
4137 - authentic syntax for
4140 - mere abbreviations:
4143 Set.inter (for inf, formerly Set.Int)
4144 Set.union (for sup, formerly Set.Un)
4145 Complete_Lattice.Inter (for Inf)
4146 Complete_Lattice.Union (for Sup)
4147 Complete_Lattice.INTER (for INFI)
4148 Complete_Lattice.UNION (for SUPR)
4149 - object-logic definitions as far as appropriate
4151 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
4152 Un_subset_iff are explicitly deleted as default simp rules; then also
4153 their lattice counterparts le_inf_iff and le_sup_iff have to be
4154 deleted to achieve the desired effect.
4156 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
4157 rules by default any longer; the same applies to min_max.inf_absorb1
4158 etc. INCOMPATIBILITY.
4160 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
4161 pred_set_conv by default. INCOMPATIBILITY.
4163 * Power operations on relations and functions are now one dedicated
4164 constant "compow" with infix syntax "^^". Power operation on
4165 multiplicative monoids retains syntax "^" and is now defined generic
4166 in class power. INCOMPATIBILITY.
4168 * Relation composition "R O S" now has a more standard argument order:
4169 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
4170 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
4171 break, since the O_assoc rule was not rewritten like this. Fix using
4172 O_assoc[symmetric]. The same applies to the curried version "R OO S".
4174 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
4175 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
4178 * Most rules produced by inductive and datatype package have mandatory
4179 prefixes. INCOMPATIBILITY.
4181 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
4182 the attribute of the same name. Each of the theorems in the list
4183 DERIV_intros assumes composition with an additional function and
4184 matches a variable to the derivative, which has to be solved by the
4185 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
4186 of most elementary terms. Former Maclauren.DERIV_tac and
4187 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
4190 * Code generator attributes follow the usual underscore convention:
4191 code_unfold replaces code unfold
4192 code_post replaces code post
4197 sizechange -> size_change
4198 induct_scheme -> induction_schema
4201 * Discontinued abbreviation "arbitrary" of constant "undefined".
4202 INCOMPATIBILITY, use "undefined" directly.
4205 Suc_eq_add_numeral_1 -> Suc_eq_plus1
4206 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
4207 Suc_plus1 -> Suc_eq_plus1
4208 *anti_sym -> *antisym*
4209 vector_less_eq_def -> vector_le_def
4212 * Added theorem List.map_map as [simp]. Removed List.map_compose.
4215 * Removed predicate "M hassize n" (<--> card M = n & finite M).
4221 * Theory Representable defines a class "rep" of domains that are
4222 representable (via an ep-pair) in the universal domain type "udom".
4223 Instances are provided for all type constructors defined in HOLCF.
4225 * The 'new_domain' command is a purely definitional version of the
4226 domain package, for representable domains. Syntax is identical to the
4227 old domain package. The 'new_domain' package also supports indirect
4228 recursion using previously-defined type constructors. See
4229 src/HOLCF/ex/New_Domain.thy for examples.
4231 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
4232 on the left-hand side of an equation, and then performs
4233 simplification. Rewriting is done using rules declared with the
4234 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
4235 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
4237 * The pattern-match compiler in 'fixrec' can now handle constructors
4238 with HOL function types. Pattern-match combinators for the Pair
4239 constructor are pre-configured.
4241 * The 'fixrec' package now produces better fixed-point induction rules
4242 for mutually-recursive definitions: Induction rules have conclusions
4243 of the form "P foo bar" instead of "P <foo, bar>".
4245 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
4246 been renamed to "below". The name "below" now replaces "less" in many
4247 theorem names. (Legacy theorem names using "less" are still supported
4250 * The 'fixrec' package now supports "bottom patterns". Bottom
4251 patterns can be used to generate strictness rules, or to make
4252 functions more strict (much like the bang-patterns supported by the
4253 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
4259 * Support for Poly/ML 5.3.0, with improved reporting of compiler
4260 errors and run-time exceptions, including detailed source positions.
4262 * Structure Name_Space (formerly NameSpace) now manages uniquely
4263 identified entries, with some additional information such as source
4264 position, logical grouping etc.
4266 * Theory and context data is now introduced by the simplified and
4267 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
4268 to be pure, but the old TheoryDataFun for mutable data (with explicit
4269 copy operation) is still available for some time.
4271 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
4272 provides a high-level programming interface to synchronized state
4273 variables with atomic update. This works via pure function
4274 application within a critical section -- its runtime should be as
4275 short as possible; beware of deadlocks if critical code is nested,
4276 either directly or indirectly via other synchronized variables!
4278 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
4279 wraps raw ML references, explicitly indicating their non-thread-safe
4280 behaviour. The Isar toplevel keeps this structure open, to
4281 accommodate Proof General as well as quick and dirty interactive
4282 experiments with references.
4284 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
4285 parallel tactical reasoning.
4287 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
4288 are similar to SUBPROOF, but are slightly more flexible: only the
4289 specified parts of the subgoal are imported into the context, and the
4290 body tactic may introduce new subgoals and schematic variables.
4292 * Old tactical METAHYPS, which does not observe the proof context, has
4293 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
4294 or Subgoal.FOCUS etc.
4296 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
4297 functors have their own ML name space there is no point to mark them
4298 separately.) Minor INCOMPATIBILITY.
4300 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
4302 * Renamed several structures FooBar to Foo_Bar. Occasional,
4305 * Operations of structure Skip_Proof no longer require quick_and_dirty
4306 mode, which avoids critical setmp.
4308 * Eliminated old Attrib.add_attributes, Method.add_methods and related
4309 combinators for "args". INCOMPATIBILITY, need to use simplified
4310 Attrib/Method.setup introduced in Isabelle2009.
4312 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
4313 back on global_simpset_of, global_claset_of, global_clasimpset_of as
4314 last resort. INCOMPATIBILITY.
4316 * Display.pretty_thm now requires a proper context (cf. former
4317 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
4318 or even Display.pretty_thm_without_context as last resort.
4321 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
4322 Syntax.pretty_typ/term directly, preferably with proper context
4323 instead of global theory.
4328 * Further fine tuning of parallel proof checking, scales up to 8 cores
4329 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
4332 * Support for additional "Isabelle components" via etc/components, see
4333 also the system manual.
4335 * The isabelle makeall tool now operates on all components with
4336 IsaMakefile, not just hardwired "logics".
4338 * Removed "compress" option from isabelle-process and isabelle usedir;
4339 this is always enabled.
4341 * Discontinued support for Poly/ML 4.x versions.
4343 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
4344 on a given logic image. This requires the lighttpd webserver and is
4345 currently supported on Linux only.
4349 New in Isabelle2009 (April 2009)
4350 --------------------------------
4354 * Simplified main Isabelle executables, with less surprises on
4355 case-insensitive file-systems (such as Mac OS).
4357 - The main Isabelle tool wrapper is now called "isabelle" instead of
4360 - The former "isabelle" alias for "isabelle-process" has been
4361 removed (should rarely occur to regular users).
4363 - The former "isabelle-interface" and its alias "Isabelle" have been
4364 removed (interfaces are now regular Isabelle tools).
4366 Within scripts and make files, the Isabelle environment variables
4367 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
4368 respectively. (The latter are still available as legacy feature.)
4370 The old isabelle-interface wrapper could react in confusing ways if
4371 the interface was uninstalled or changed otherwise. Individual
4372 interface tool configuration is now more explicit, see also the
4373 Isabelle system manual. In particular, Proof General is now available
4374 via "isabelle emacs".
4376 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
4377 purge installed copies of Isabelle executables and re-run "isabelle
4378 install -p ...", or use symlinks.
4380 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
4381 old ~/isabelle, which was slightly non-standard and apt to cause
4382 surprises on case-insensitive file-systems (such as Mac OS).
4384 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
4385 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
4386 care is required when using older releases of Isabelle. Note that
4387 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
4388 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
4390 * Proofs of fully specified statements are run in parallel on
4391 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
4392 a regular 4-core machine, if the initial heap space is made reasonably
4393 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
4395 * The main reference manuals ("isar-ref", "implementation", and
4396 "system") have been updated and extended. Formally checked references
4397 as hyperlinks are now available uniformly.
4402 * Complete re-implementation of locales. INCOMPATIBILITY in several
4403 respects. The most important changes are listed below. See the
4404 Tutorial on Locales ("locales" manual) for details.
4406 - In locale expressions, instantiation replaces renaming. Parameters
4407 must be declared in a for clause. To aid compatibility with previous
4408 parameter inheritance, in locale declarations, parameters that are not
4409 'touched' (instantiation position "_" or omitted) are implicitly added
4410 with their syntax at the beginning of the for clause.
4412 - Syntax from abbreviations and definitions in locales is available in
4413 locale expressions and context elements. The latter is particularly
4414 useful in locale declarations.
4416 - More flexible mechanisms to qualify names generated by locale
4417 expressions. Qualifiers (prefixes) may be specified in locale
4418 expressions, and can be marked as mandatory (syntax: "name!:") or
4419 optional (syntax "name?:"). The default depends for plain "name:"
4420 depends on the situation where a locale expression is used: in
4421 commands 'locale' and 'sublocale' prefixes are optional, in
4422 'interpretation' and 'interpret' prefixes are mandatory. The old
4423 implicit qualifiers derived from the parameter names of a locale are
4424 no longer generated.
4426 - Command "sublocale l < e" replaces "interpretation l < e". The
4427 instantiation clause in "interpretation" and "interpret" (square
4428 brackets) is no longer available. Use locale expressions.
4430 - When converting proof scripts, mandatory qualifiers in
4431 'interpretation' and 'interpret' should be retained by default, even
4432 if this is an INCOMPATIBILITY compared to former behavior. In the
4433 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
4434 in locale expressions range over a single locale instance only.
4436 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
4437 In existing theorem specifications replace the includes element by the
4438 respective context elements of the included locale, omitting those
4439 that are already present in the theorem specification. Multiple
4440 assume elements of a locale should be replaced by a single one
4441 involving the locale predicate. In the proof body, declarations (most
4442 notably theorems) may be regained by interpreting the respective
4443 locales in the proof context as required (command "interpret").
4445 If using "includes" in replacement of a target solely because the
4446 parameter types in the theorem are not as general as in the target,
4447 consider declaring a new locale with additional type constraints on
4448 the parameters (context element "constrains").
4450 - Discontinued "locale (open)". INCOMPATIBILITY.
4452 - Locale interpretation commands no longer attempt to simplify goal.
4453 INCOMPATIBILITY: in rare situations the generated goal differs. Use
4454 methods intro_locales and unfold_locales to clarify.
4456 - Locale interpretation commands no longer accept interpretation
4457 attributes. INCOMPATIBILITY.
4459 * Class declaration: so-called "base sort" must not be given in import
4460 list any longer, but is inferred from the specification. Particularly
4467 class foo = type + ...
4469 * Class target: global versions of theorems stemming do not carry a
4470 parameter prefix any longer. INCOMPATIBILITY.
4472 * Class 'instance' command no longer accepts attached definitions.
4473 INCOMPATIBILITY, use proper 'instantiation' target instead.
4475 * Recovered hiding of consts, which was accidentally broken in
4476 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
4477 makes c inaccessible; consider using ``hide (open) const c'' instead.
4479 * Slightly more coherent Pure syntax, with updated documentation in
4480 isar-ref manual. Removed locales meta_term_syntax and
4481 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
4482 INCOMPATIBILITY in rare situations. Note that &&& should not be used
4483 directly in regular applications.
4485 * There is a new syntactic category "float_const" for signed decimal
4486 fractions (e.g. 123.45 or -123.45).
4488 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
4489 interface with 'setup' command instead.
4491 * Command 'local_setup' is similar to 'setup', but operates on a local
4494 * The 'axiomatization' command now only works within a global theory
4495 context. INCOMPATIBILITY.
4497 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
4498 hypotheses. Sorts required in the course of reasoning need to be
4499 covered by the constraints in the initial statement, completed by the
4500 type instance information of the background theory. Non-trivial sort
4501 hypotheses, which rarely occur in practice, may be specified via
4502 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
4504 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
4506 The result contains an implicit sort hypotheses as before --
4507 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
4510 * Generalized Isar history, with support for linear undo, direct state
4513 * Changed defaults for unify configuration options:
4515 unify_trace_bound = 50 (formerly 25)
4516 unify_search_bound = 60 (formerly 30)
4518 * Different bookkeeping for code equations (INCOMPATIBILITY):
4520 a) On theory merge, the last set of code equations for a particular
4521 constant is taken (in accordance with the policy applied by other
4522 parts of the code generator framework).
4524 b) Code equations stemming from explicit declarations (e.g. code
4525 attribute) gain priority over default code equations stemming
4526 from definition, primrec, fun etc.
4528 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
4530 * Unified theorem tables for both code generators. Thus [code
4531 func] has disappeared and only [code] remains. INCOMPATIBILITY.
4533 * Command 'find_consts' searches for constants based on type and name
4536 find_consts "_ => bool"
4538 By default, matching is against subtypes, but it may be restricted to
4539 the whole type. Searching by name is possible. Multiple queries are
4540 conjunctive and queries may be negated by prefixing them with a
4543 find_consts strict: "_ => bool" name: "Int" -"int => int"
4545 * New 'find_theorems' criterion "solves" matches theorems that
4546 directly solve the current goal (modulo higher-order unification).
4548 * Auto solve feature for main theorem statements: whenever a new goal
4549 is stated, "find_theorems solves" is called; any theorems that could
4550 solve the lemma directly are listed as part of the goal state.
4551 Cf. associated options in Proof General Isabelle settings menu,
4552 enabled by default, with reasonable timeout for pathological cases of
4553 higher-order unification.
4556 *** Document preparation ***
4558 * Antiquotation @{lemma} now imitates a regular terminal proof,
4559 demanding keyword 'by' and supporting the full method expression
4560 syntax just like the Isar command 'by'.
4565 * Integrated main parts of former image HOL-Complex with HOL. Entry
4566 points Main and Complex_Main remain as before.
4568 * Logic image HOL-Plain provides a minimal HOL with the most important
4569 tools available (inductive, datatype, primrec, ...). This facilitates
4570 experimentation and tool development. Note that user applications
4571 (and library theories) should never refer to anything below theory
4574 * Logic image HOL-Main stops at theory Main, and thus facilitates
4575 experimentation due to shorter build times.
4577 * Logic image HOL-NSA contains theories of nonstandard analysis which
4578 were previously part of former HOL-Complex. Entry point Hyperreal
4579 remains valid, but theories formerly using Complex_Main should now use
4580 new entry point Hypercomplex.
4582 * Generic ATP manager for Sledgehammer, based on ML threads instead of
4583 Posix processes. Avoids potentially expensive forking of the ML
4584 process. New thread-based implementation also works on non-Unix
4585 platforms (Cygwin). Provers are no longer hardwired, but defined
4586 within the theory via plain ML wrapper functions. Basic Sledgehammer
4587 commands are covered in the isar-ref manual.
4589 * Wrapper scripts for remote SystemOnTPTP service allows to use
4590 sledgehammer without local ATP installation (Vampire etc.). Other
4591 provers may be included via suitable ML wrappers, see also
4592 src/HOL/ATP_Linkup.thy.
4594 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
4597 * The metis method no longer fails because the theorem is too trivial
4598 (contains the empty clause).
4600 * The metis method now fails in the usual manner, rather than raising
4601 an exception, if it determines that it cannot prove the theorem.
4603 * Method "coherent" implements a prover for coherent logic (see also
4604 src/Tools/coherent.ML).
4606 * Constants "undefined" and "default" replace "arbitrary". Usually
4607 "undefined" is the right choice to replace "arbitrary", though
4608 logically there is no difference. INCOMPATIBILITY.
4610 * Command "value" now integrates different evaluation mechanisms. The
4611 result of the first successful evaluation mechanism is printed. In
4612 square brackets a particular named evaluation mechanisms may be
4613 specified (currently, [SML], [code] or [nbe]). See further
4614 src/HOL/ex/Eval_Examples.thy.
4616 * Normalization by evaluation now allows non-leftlinear equations.
4617 Declare with attribute [code nbe].
4619 * Methods "case_tac" and "induct_tac" now refer to the very same rules
4620 as the structured Isar versions "cases" and "induct", cf. the
4621 corresponding "cases" and "induct" attributes. Mutual induction rules
4622 are now presented as a list of individual projections
4623 (e.g. foo_bar.inducts for types foo and bar); the old format with
4624 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
4625 rare situations a different rule is selected --- notably nested tuple
4626 elimination instead of former prod.exhaust: use explicit (case_tac t
4627 rule: prod.exhaust) here.
4629 * Attributes "cases", "induct", "coinduct" support "del" option.
4631 * Removed fact "case_split_thm", which duplicates "case_split".
4633 * The option datatype has been moved to a new theory Option. Renamed
4634 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
4636 * New predicate "strict_mono" classifies strict functions on partial
4637 orders. With strict functions on linear orders, reasoning about
4638 (in)equalities is facilitated by theorems "strict_mono_eq",
4639 "strict_mono_less_eq" and "strict_mono_less".
4641 * Some set operations are now proper qualified constants with
4642 authentic syntax. INCOMPATIBILITY:
4653 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
4656 * Auxiliary class "itself" has disappeared -- classes without any
4657 parameter are treated as expected by the 'class' command.
4659 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
4661 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
4662 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
4664 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
4665 method "approximation". It proves formulas on real values by using
4666 interval arithmetic. In the formulas are also the transcendental
4667 functions sin, cos, tan, atan, ln, exp and the constant pi are
4668 allowed. For examples see
4669 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
4671 * Theory "Reflection" now resides in HOL/Library.
4673 * Entry point to Word library now simply named "Word".
4676 * Made source layout more coherent with logical distribution
4679 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
4680 src/HOL/Library/Code_Message.thy ~> src/HOL/
4681 src/HOL/Library/GCD.thy ~> src/HOL/
4682 src/HOL/Library/Order_Relation.thy ~> src/HOL/
4683 src/HOL/Library/Parity.thy ~> src/HOL/
4684 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
4685 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
4686 src/HOL/Real/Lubs.thy ~> src/HOL/
4687 src/HOL/Real/PReal.thy ~> src/HOL/
4688 src/HOL/Real/Rational.thy ~> src/HOL/
4689 src/HOL/Real/RComplete.thy ~> src/HOL/
4690 src/HOL/Real/RealDef.thy ~> src/HOL/
4691 src/HOL/Real/RealPow.thy ~> src/HOL/
4692 src/HOL/Real/Real.thy ~> src/HOL/
4693 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
4694 src/HOL/Complex/Complex.thy ~> src/HOL/
4695 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
4696 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
4697 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
4698 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
4699 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
4700 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
4701 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
4702 src/HOL/Hyperreal/Log.thy ~> src/HOL/
4703 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
4704 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
4705 src/HOL/Hyperreal/Series.thy ~> src/HOL/
4706 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
4707 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
4708 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
4709 src/HOL/Real/Float ~> src/HOL/Library/
4710 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
4711 src/HOL/Real/RealVector.thy ~> src/HOL/
4713 src/HOL/arith_data.ML ~> src/HOL/Tools
4714 src/HOL/hologic.ML ~> src/HOL/Tools
4715 src/HOL/simpdata.ML ~> src/HOL/Tools
4716 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
4717 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
4718 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
4719 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
4720 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
4721 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
4722 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
4724 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
4725 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
4726 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
4727 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
4728 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
4729 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
4731 * If methods "eval" and "evaluation" encounter a structured proof
4732 state with !!/==>, only the conclusion is evaluated to True (if
4733 possible), avoiding strange error messages.
4735 * Method "sizechange" automates termination proofs using (a
4736 modification of) the size-change principle. Requires SAT solver. See
4737 src/HOL/ex/Termination.thy for examples.
4739 * Simplifier: simproc for let expressions now unfolds if bound
4740 variable occurs at most once in let expression body. INCOMPATIBILITY.
4742 * Method "arith": Linear arithmetic now ignores all inequalities when
4743 fast_arith_neq_limit is exceeded, instead of giving up entirely.
4745 * New attribute "arith" for facts that should always be used
4746 automatically by arithmetic. It is intended to be used locally in
4749 assumes [arith]: "x > 0"
4751 Global usage is discouraged because of possible performance impact.
4753 * New classes "top" and "bot" with corresponding operations "top" and
4754 "bot" in theory Orderings; instantiation of class "complete_lattice"
4755 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
4757 * Changed definition lemma "less_fun_def" in order to provide an
4758 instance for preorders on functions; use lemma "less_le" instead.
4761 * Theory Orderings: class "wellorder" moved here, with explicit
4762 induction rule "less_induct" as assumption. For instantiation of
4763 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
4766 * Theory Orderings: added class "preorder" as superclass of "order".
4767 INCOMPATIBILITY: Instantiation proofs for order, linorder
4768 etc. slightly changed. Some theorems named order_class.* now named
4771 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
4774 * Theory Finite_Set: added a new fold combinator of type
4776 ('a => 'b => 'b) => 'b => 'a set => 'b
4778 Occasionally this is more convenient than the old fold combinator
4779 which is now defined in terms of the new one and renamed to
4782 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
4783 and "ring_simps" have been replaced by "algebra_simps" (which can be
4784 extended with further lemmas!). At the moment both still exist but
4785 the former will disappear at some point.
4787 * Theory Power: Lemma power_Suc is now declared as a simp rule in
4788 class recpower. Type-specific simp rules for various recpower types
4789 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
4791 rat_power_0 -> power_0
4792 rat_power_Suc -> power_Suc
4793 realpow_0 -> power_0
4794 realpow_Suc -> power_Suc
4795 complexpow_0 -> power_0
4796 complexpow_Suc -> power_Suc
4797 power_poly_0 -> power_0
4798 power_poly_Suc -> power_Suc
4800 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
4801 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
4802 dvd has been generalized to class comm_semiring_1. Likewise a bunch
4803 of lemmas from Divides has been generalized from nat to class
4804 semiring_div. INCOMPATIBILITY. This involves the following theorem
4805 renames resulting from duplicate elimination:
4807 dvd_def_mod ~> dvd_eq_mod_eq_0
4808 zero_dvd_iff ~> dvd_0_left_iff
4809 dvd_0 ~> dvd_0_right
4810 DIVISION_BY_ZERO_DIV ~> div_by_0
4811 DIVISION_BY_ZERO_MOD ~> mod_by_0
4812 mult_div ~> div_mult_self2_is_id
4813 mult_mod ~> mod_mult_self2_is_0
4815 * Theory IntDiv: removed many lemmas that are instances of class-based
4816 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
4817 rename old lemmas as follows:
4819 dvd_diff -> nat_dvd_diff
4820 dvd_zminus_iff -> dvd_minus_iff
4821 mod_add1_eq -> mod_add_eq
4822 mod_mult1_eq -> mod_mult_right_eq
4823 mod_mult1_eq' -> mod_mult_left_eq
4824 mod_mult_distrib_mod -> mod_mult_eq
4825 nat_mod_add_left_eq -> mod_add_left_eq
4826 nat_mod_add_right_eq -> mod_add_right_eq
4827 nat_mod_div_trivial -> mod_div_trivial
4828 nat_mod_mod_trivial -> mod_mod_trivial
4829 zdiv_zadd_self1 -> div_add_self1
4830 zdiv_zadd_self2 -> div_add_self2
4831 zdiv_zmult_self1 -> div_mult_self2_is_id
4832 zdiv_zmult_self2 -> div_mult_self1_is_id
4833 zdvd_triv_left -> dvd_triv_left
4834 zdvd_triv_right -> dvd_triv_right
4835 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
4836 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
4837 zmod_zadd_left_eq -> mod_add_left_eq
4838 zmod_zadd_right_eq -> mod_add_right_eq
4839 zmod_zadd_self1 -> mod_add_self1
4840 zmod_zadd_self2 -> mod_add_self2
4841 zmod_zadd1_eq -> mod_add_eq
4842 zmod_zdiff1_eq -> mod_diff_eq
4843 zmod_zdvd_zmod -> mod_mod_cancel
4844 zmod_zmod_cancel -> mod_mod_cancel
4845 zmod_zmult_self1 -> mod_mult_self2_is_0
4846 zmod_zmult_self2 -> mod_mult_self1_is_0
4849 zdvd_abs1 -> abs_dvd_iff
4850 zdvd_abs2 -> dvd_abs_iff
4851 zdvd_refl -> dvd_refl
4852 zdvd_trans -> dvd_trans
4853 zdvd_zadd -> dvd_add
4854 zdvd_zdiff -> dvd_diff
4855 zdvd_zminus_iff -> dvd_minus_iff
4856 zdvd_zminus2_iff -> minus_dvd_iff
4857 zdvd_zmultD -> dvd_mult_right
4858 zdvd_zmultD2 -> dvd_mult_left
4859 zdvd_zmult_mono -> mult_dvd_mono
4860 zdvd_0_right -> dvd_0_right
4861 zdvd_0_left -> dvd_0_left_iff
4862 zdvd_1_left -> one_dvd
4863 zminus_dvd_iff -> minus_dvd_iff
4865 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
4867 * The real numbers offer decimal input syntax: 12.34 is translated
4868 into 1234/10^2. This translation is not reversed upon output.
4870 * Theory Library/Polynomial defines an abstract type 'a poly of
4871 univariate polynomials with coefficients of type 'a. In addition to
4872 the standard ring operations, it also supports div and mod. Code
4873 generation is also supported, using list-style constructors.
4875 * Theory Library/Inner_Product defines a class of real_inner for real
4876 inner product spaces, with an overloaded operation inner :: 'a => 'a
4877 => real. Class real_inner is a subclass of real_normed_vector from
4880 * Theory Library/Product_Vector provides instances for the product
4881 type 'a * 'b of several classes from RealVector and Inner_Product.
4882 Definitions of addition, subtraction, scalar multiplication, norms,
4883 and inner products are included.
4885 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
4886 addition to the field operations, numerals and case syntax are also
4889 * Theory Library/Diagonalize provides constructive version of Cantor's
4890 first diagonalization argument.
4892 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
4893 zlcm (for int); carried together from various gcd/lcm developements in
4894 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
4895 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
4896 may recover tupled syntax as follows:
4898 hide (open) const gcd
4899 abbreviation gcd where
4900 "gcd == (%(a, b). GCD.gcd a b)"
4902 GCD.gcd ("gcd '(_, _')")
4904 The same works for lcm, zgcd, zlcm.
4906 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
4907 instantiations for algebraic structures. Removed some duplicate
4908 theorems. Changes in simp rules. INCOMPATIBILITY.
4910 * ML antiquotation @{code} takes a constant as argument and generates
4911 corresponding code in background and inserts name of the corresponding
4912 resulting ML value/function/datatype constructor binding in place.
4913 All occurrences of @{code} with a single ML block are generated
4914 simultaneously. Provides a generic and safe interface for
4915 instrumentalizing code generation. See
4916 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
4917 In future you ought to refrain from ad-hoc compiling generated SML
4918 code on the ML toplevel. Note that (for technical reasons) @{code}
4919 cannot refer to constants for which user-defined serializations are
4920 set. Refer to the corresponding ML counterpart directly in that
4923 * Command 'rep_datatype': instead of theorem names the command now
4924 takes a list of terms denoting the constructors of the type to be
4925 represented as datatype. The characteristic theorems have to be
4926 proven. INCOMPATIBILITY. Also observe that the following theorems
4927 have disappeared in favour of existing ones:
4929 unit_induct ~> unit.induct
4930 prod_induct ~> prod.induct
4931 sum_induct ~> sum.induct
4932 Suc_Suc_eq ~> nat.inject
4933 Suc_not_Zero Zero_not_Suc ~> nat.distinct
4938 * New locales for orders and lattices where the equivalence relation
4939 is not restricted to equality. INCOMPATIBILITY: all order and lattice
4940 locales use a record structure with field eq for the equivalence.
4942 * New theory of factorial domains.
4944 * Units_l_inv and Units_r_inv are now simp rules by default.
4945 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
4946 and/or r_inv will now also require deletion of these lemmas.
4948 * Renamed the following theorems, INCOMPATIBILITY:
4950 UpperD ~> Upper_memD
4951 LowerD ~> Lower_memD
4952 least_carrier ~> least_closed
4953 greatest_carrier ~> greatest_closed
4954 greatest_Lower_above ~> greatest_Lower_below
4955 one_zero ~> carrier_one_zero
4956 one_not_zero ~> carrier_one_not_zero (collision with assumption)
4961 * Nominal datatypes can now contain type-variables.
4963 * Commands 'nominal_inductive' and 'equivariance' work with local
4966 * Nominal primrec can now works with local theory targets and its
4967 specification syntax now conforms to the general format as seen in
4970 * Method "perm_simp" honours the standard simplifier attributes
4971 (no_asm), (no_asm_use) etc.
4973 * The new predicate #* is defined like freshness, except that on the
4974 left hand side can be a set or list of atoms.
4976 * Experimental command 'nominal_inductive2' derives strong induction
4977 principles for inductive definitions. In contrast to
4978 'nominal_inductive', which can only deal with a fixed number of
4979 binders, it can deal with arbitrary expressions standing for sets of
4980 atoms to be avoided. The only inductive definition we have at the
4981 moment that needs this generalisation is the typing rule for Lets in
4984 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
4985 -----------------------------------------------------------------
4986 Gamma |- Let x be t1 in t2 : T2
4988 In this rule one wants to avoid all the binders that are introduced by
4989 "close Gamma T1". We are looking for other examples where this
4990 feature might be useful. Please let us know.
4995 * Reimplemented the simplification procedure for proving continuity
4996 subgoals. The new simproc is extensible; users can declare additional
4997 continuity introduction rules with the attribute [cont2cont].
4999 * The continuity simproc now uses a different introduction rule for
5000 solving continuity subgoals on terms with lambda abstractions. In
5001 some rare cases the new simproc may fail to solve subgoals that the
5002 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
5003 Potential INCOMPATIBILITY.
5005 * Command 'fixrec': specification syntax now conforms to the general
5006 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
5007 examples. INCOMPATIBILITY.
5012 * Proof of Zorn's Lemma for partial orders.
5017 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
5018 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
5019 depends on multithreading, so timouts will not work before Poly/ML
5022 * High-level support for concurrent ML programming, see
5023 src/Pure/Cuncurrent. The data-oriented model of "future values" is
5024 particularly convenient to organize independent functional
5025 computations. The concept of "synchronized variables" provides a
5026 higher-order interface for components with shared state, avoiding the
5027 delicate details of mutexes and condition variables. (Requires
5028 Poly/ML 5.2.1 or later.)
5030 * ML bindings produced via Isar commands are stored within the Isar
5031 context (theory or proof). Consequently, commands like 'use' and 'ML'
5032 become thread-safe and work with undo as expected (concerning
5033 top-level bindings, not side-effects on global references).
5034 INCOMPATIBILITY, need to provide proper Isar context when invoking the
5035 compiler at runtime; really global bindings need to be given outside a
5036 theory. (Requires Poly/ML 5.2 or later.)
5038 * Command 'ML_prf' is analogous to 'ML' but works within a proof
5039 context. Top-level ML bindings are stored within the proof context in
5040 a purely sequential fashion, disregarding the nested proof structure.
5041 ML bindings introduced by 'ML_prf' are discarded at the end of the
5042 proof. (Requires Poly/ML 5.2 or later.)
5044 * Simplified ML attribute and method setup, cf. functions Attrib.setup
5045 and Method.setup, as well as Isar commands 'attribute_setup' and
5046 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
5047 existing code accordingly, or use plain 'setup' together with old
5050 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
5051 to 'a -> thm, while results are always tagged with an authentic oracle
5052 name. The Isar command 'oracle' is now polymorphic, no argument type
5053 is specified. INCOMPATIBILITY, need to simplify existing oracle code
5054 accordingly. Note that extra performance may be gained by producing
5055 the cterm carefully, avoiding slow Thm.cterm_of.
5057 * Simplified interface for defining document antiquotations via
5058 ThyOutput.antiquotation, ThyOutput.output, and optionally
5059 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
5060 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
5063 * More systematic treatment of long names, abstract name bindings, and
5064 name space operations. Basic operations on qualified names have been
5065 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
5066 Long_Name.append. Old type bstring has been mostly replaced by
5067 abstract type binding (see structure Binding), which supports precise
5068 qualification by packages and local theory targets, as well as proper
5069 tracking of source positions. INCOMPATIBILITY, need to wrap old
5070 bstring values into Binding.name, or better pass through abstract
5071 bindings everywhere. See further src/Pure/General/long_name.ML,
5072 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
5074 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
5075 LocalTheory.note etc.) now refer to the *full* internal name, not the
5076 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
5078 * Disposed old type and term read functions (Sign.read_def_typ,
5079 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
5080 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
5081 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
5082 Syntax.read_term_global etc.; see also OldGoals.read_term as last
5083 resort for legacy applications.
5085 * Disposed old declarations, tactics, tactic combinators that refer to
5086 the simpset or claset of an implicit theory (such as Addsimps,
5087 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
5088 embedded ML text, or local_simpset_of with a proper context passed as
5089 explicit runtime argument.
5091 * Rules and tactics that read instantiations (read_instantiate,
5092 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
5093 context, which is required for parsing and type-checking. Moreover,
5094 the variables are specified as plain indexnames, not string encodings
5095 thereof. INCOMPATIBILITY.
5097 * Generic Toplevel.add_hook interface allows to analyze the result of
5098 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
5099 for theorem dependency output of transactions resulting in a new
5102 * ML antiquotations: block-structured compilation context indicated by
5103 \<lbrace> ... \<rbrace>; additional antiquotation forms:
5105 @{binding name} - basic name binding
5106 @{let ?pat = term} - term abbreviation (HO matching)
5107 @{note name = fact} - fact abbreviation
5108 @{thm fact} - singleton fact (with attributes)
5109 @{thms fact} - general fact (with attributes)
5110 @{lemma prop by method} - singleton goal
5111 @{lemma prop by meth1 meth2} - singleton goal
5112 @{lemma prop1 ... propN by method} - general goal
5113 @{lemma prop1 ... propN by meth1 meth2} - general goal
5114 @{lemma (open) ...} - open derivation
5119 * The Isabelle "emacs" tool provides a specific interface to invoke
5120 Proof General / Emacs, with more explicit failure if that is not
5121 installed (the old isabelle-interface script silently falls back on
5122 isabelle-process). The PROOFGENERAL_HOME setting determines the
5123 installation location of the Proof General distribution.
5125 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
5126 the Isabelle process into a JVM/Scala application. See
5127 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
5128 process wrapper has been discontinued.)
5130 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
5132 * Various status messages (with exact source position information) are
5133 emitted, if proper markup print mode is enabled. This allows
5134 user-interface components to provide detailed feedback on internal
5139 New in Isabelle2008 (June 2008)
5140 -------------------------------
5144 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
5145 and updated, with formally checked references as hyperlinks.
5147 * Theory loader: use_thy (and similar operations) no longer set the
5148 implicit ML context, which was occasionally hard to predict and in
5149 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
5150 provides a proper context already.
5152 * Theory loader: old-style ML proof scripts being *attached* to a thy
5153 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
5154 'use' within a theory file will do the job.
5156 * Name space merge now observes canonical order, i.e. the second space
5157 is inserted into the first one, while existing entries in the first
5158 space take precedence. INCOMPATIBILITY in rare situations, may try to
5159 swap theory imports.
5161 * Syntax: symbol \<chi> is now considered a letter. Potential
5162 INCOMPATIBILITY in identifier syntax etc.
5164 * Outer syntax: string tokens no longer admit escaped white space,
5165 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
5166 white space without escapes.
5168 * Outer syntax: string tokens may contain arbitrary character codes
5169 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
5175 * Context-dependent token translations. Default setup reverts locally
5176 fixed variables, and adds hilite markup for undeclared frees.
5178 * Unused theorems can be found using the new command 'unused_thms'.
5179 There are three ways of invoking it:
5182 Only finds unused theorems in the current theory.
5184 (2) unused_thms thy_1 ... thy_n -
5185 Finds unused theorems in the current theory and all of its ancestors,
5186 excluding the theories thy_1 ... thy_n and all of their ancestors.
5188 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
5189 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
5190 their ancestors, excluding the theories thy_1 ... thy_n and all of
5193 In order to increase the readability of the list produced by
5194 unused_thms, theorems that have been created by a particular instance
5195 of a theory command such as 'inductive' or 'function' are considered
5196 to belong to the same "group", meaning that if at least one theorem in
5197 this group is used, the other theorems in the same group are no longer
5198 reported as unused. Moreover, if all theorems in the group are
5199 unused, only one theorem in the group is displayed.
5201 Note that proof objects have to be switched on in order for
5202 unused_thms to work properly (i.e. !proofs must be >= 1, which is
5203 usually the case when using Proof General with the default settings).
5205 * Authentic naming of facts disallows ad-hoc overwriting of previous
5206 theorems within the same name space. INCOMPATIBILITY, need to remove
5207 duplicate fact bindings, or even accidental fact duplications. Note
5208 that tools may maintain dynamically scoped facts systematically, using
5209 PureThy.add_thms_dynamic.
5211 * Command 'hide' now allows to hide from "fact" name space as well.
5213 * Eliminated destructive theorem database, simpset, claset, and
5214 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
5215 update of theories within ML code.
5217 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
5218 INCOMPATIBILITY, object-logics depending on former Pure require
5219 additional setup PureThy.old_appl_syntax_setup; object-logics
5220 depending on former CPure need to refer to Pure.
5222 * Commands 'use' and 'ML' are now purely functional, operating on
5223 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
5224 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
5227 * Command 'setup': discontinued implicit version with ML reference.
5229 * Instantiation target allows for simultaneous specification of class
5230 instance operations together with an instantiation proof.
5231 Type-checking phase allows to refer to class operations uniformly.
5232 See src/HOL/Complex/Complex.thy for an Isar example and
5233 src/HOL/Library/Eval.thy for an ML example.
5235 * Indexing of literal facts: be more serious about including only
5236 facts from the visible specification/proof context, but not the
5237 background context (locale etc.). Affects `prop` notation and method
5238 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
5241 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
5242 "(open)" option, which used to expose internal bound variables to the
5245 * Isar statements: removed obsolete case "rule_context".
5246 INCOMPATIBILITY, better use explicit fixes/assumes.
5248 * Locale proofs: default proof step now includes 'unfold_locales';
5249 hence 'proof' without argument may be used to unfold locale
5253 *** Document preparation ***
5255 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
5256 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
5257 obsolete thumbpdf setup (contemporary PDF viewers do this on the
5258 spot); renamed link color from "darkblue" to "linkcolor" (default
5259 value unchanged, can be redefined via \definecolor); no longer sets
5260 "a4paper" option (unnecessary or even intrusive).
5262 * Antiquotation @{lemma A method} proves proposition A by the given
5263 method (either a method name or a method name plus (optional) method
5264 arguments in parentheses) and prints A just like @{prop A}.
5269 * New primrec package. Specification syntax conforms in style to
5270 definition/function/.... No separate induction rule is provided. The
5271 "primrec" command distinguishes old-style and new-style specifications
5272 by syntax. The former primrec package is now named OldPrimrecPackage.
5273 When adjusting theories, beware: constants stemming from new-style
5274 primrec specifications have authentic syntax.
5276 * Metis prover is now an order of magnitude faster, and also works
5277 with multithreading.
5279 * Metis: the maximum number of clauses that can be produced from a
5280 theorem is now given by the attribute max_clauses. Theorems that
5281 exceed this number are ignored, with a warning printed.
5283 * Sledgehammer no longer produces structured proofs by default. To
5284 enable, declare [[sledgehammer_full = true]]. Attributes
5285 reconstruction_modulus, reconstruction_sorts renamed
5286 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
5288 * Method "induct_scheme" derives user-specified induction rules
5289 from well-founded induction and completeness of patterns. This factors
5290 out some operations that are done internally by the function package
5291 and makes them available separately. See
5292 src/HOL/ex/Induction_Scheme.thy for examples.
5294 * More flexible generation of measure functions for termination
5295 proofs: Measure functions can be declared by proving a rule of the
5296 form "is_measure f" and giving it the [measure_function] attribute.
5297 The "is_measure" predicate is logically meaningless (always true), and
5298 just guides the heuristic. To find suitable measure functions, the
5299 termination prover sets up the goal "is_measure ?f" of the appropriate
5300 type and generates all solutions by prolog-style backwards proof using
5303 This setup also deals with rules like
5305 "is_measure f ==> is_measure (list_size f)"
5307 which accommodates nested datatypes that recurse through lists.
5308 Similar rules are predeclared for products and option types.
5310 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
5314 - Definitions of overloaded constants on sets have to be replaced by
5315 definitions on => and bool.
5317 - Some definitions of overloaded operators on sets can now be proved
5318 using the definitions of the operators on => and bool. Therefore,
5319 the following theorems have been renamed:
5321 subset_def -> subset_eq
5322 psubset_def -> psubset_eq
5323 set_diff_def -> set_diff_eq
5324 Compl_def -> Compl_eq
5325 Sup_set_def -> Sup_set_eq
5326 Inf_set_def -> Inf_set_eq
5327 sup_set_def -> sup_set_eq
5328 inf_set_def -> inf_set_eq
5330 - Due to the incompleteness of the HO unification algorithm, some
5331 rules such as subst may require manual instantiation, if some of
5332 the unknowns in the rule is a set.
5334 - Higher order unification and forward proofs:
5337 have "P (S::'a set)" <...>
5338 then have "EX S. P S" ..
5340 no longer works (due to the incompleteness of the HO unification
5341 algorithm) and must be replaced by the pattern
5348 - Calculational reasoning with subst (or similar rules):
5351 have "P (S::'a set)" <...>
5352 also have "S = T" <...>
5353 finally have "P T" .
5355 no longer works (for similar reasons as the previous example) and
5356 must be replaced by something like
5358 have "P (S::'a set)" <...>
5359 moreover have "S = T" <...>
5360 ultimately have "P T" by simp
5362 - Tactics or packages written in ML code:
5363 Code performing pattern matching on types via
5365 Type ("set", [T]) => ...
5367 must be rewritten. Moreover, functions like strip_type or
5368 binder_types no longer return the right value when applied to a
5371 T1 => ... => Tn => U => bool
5375 T1 => ... => Tn => U set
5377 * Merged theories Wellfounded_Recursion, Accessible_Part and
5378 Wellfounded_Relations to theory Wellfounded.
5380 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
5382 * Class finite no longer treats UNIV as class parameter. Use class
5383 enum from theory Library/Enum instead to achieve a similar effect.
5386 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
5387 and "Cons". INCOMPATIBILITY.
5389 * HOL (and FOL): renamed variables in rules imp_elim and swap.
5390 Potential INCOMPATIBILITY.
5392 * Theory Product_Type: duplicated lemmas split_Pair_apply and
5393 injective_fst_snd removed, use split_eta and prod_eqI instead.
5394 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
5396 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
5397 the same name in theory Orderings:
5407 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
5408 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
5409 and different variable names.
5411 * Library/Option_ord.thy: Canonical order on option type.
5413 * Library/RBT.thy: Red-black trees, an efficient implementation of
5416 * Library/Countable.thy: Type class for countable types.
5418 * Theory Int: The representation of numerals has changed. The infix
5419 operator BIT and the bit datatype with constructors B0 and B1 have
5420 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
5421 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
5422 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
5425 * Theory Nat: definition of <= and < on natural numbers no longer
5426 depend on well-founded relations. INCOMPATIBILITY. Definitions
5427 le_def and less_def have disappeared. Consider lemmas not_less
5428 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
5430 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
5431 (whose purpose mainly is for various fold_set functionals) have been
5432 abandoned in favor of the existing algebraic classes
5433 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
5434 lower_semilattice (resp. upper_semilattice) and linorder.
5437 * Theory Transitive_Closure: induct and cases rules now declare proper
5438 case_names ("base" and "step"). INCOMPATIBILITY.
5440 * Theorem Inductive.lfp_ordinal_induct generalized to complete
5441 lattices. The form set-specific version is available as
5442 Inductive.lfp_ordinal_induct_set.
5444 * Renamed theorems "power.simps" to "power_int.simps".
5447 * Class semiring_div provides basic abstract properties of semirings
5448 with division and modulo operations. Subsumes former class dvd_mod.
5450 * Merged theories IntDef, Numeral and IntArith into unified theory
5451 Int. INCOMPATIBILITY.
5453 * Theory Library/Code_Index: type "index" now represents natural
5454 numbers rather than integers. INCOMPATIBILITY.
5456 * New class "uminus" with operation "uminus" (split of from class
5457 "minus" which now only has operation "minus", binary).
5460 * Constants "card", "internal_split", "option_map" now with authentic
5461 syntax. INCOMPATIBILITY.
5463 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
5464 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
5465 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
5466 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
5467 Sup_set_def, le_def, less_def, option_map_def now with object
5468 equality. INCOMPATIBILITY.
5470 * Records. Removed K_record, and replaced it by pure lambda term
5471 %x. c. The simplifier setup is now more robust against eta expansion.
5472 INCOMPATIBILITY: in cases explicitly referring to K_record.
5474 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
5476 * Library/ListVector: new theory of arithmetic vector operations.
5478 * Library/Order_Relation: new theory of various orderings as sets of
5479 pairs. Defines preorders, partial orders, linear orders and
5480 well-orders on sets and on types.
5485 * Renamed some theories to allow to loading both ZF and HOL in the
5488 Datatype -> Datatype_ZF
5489 Inductive -> Inductive_ZF
5496 INCOMPATIBILITY: ZF theories that import individual theories below
5497 Main might need to be adapted. Regular theory Main is still
5498 available, as trivial extension of Main_ZF.
5503 * ML within Isar: antiquotation @{const name} or @{const
5504 name(typargs)} produces statically-checked Const term.
5506 * Functor NamedThmsFun: data is available to the user as dynamic fact
5507 (of the same name). Removed obsolete print command.
5509 * Removed obsolete "use_legacy_bindings" function.
5511 * The ``print mode'' is now a thread-local value derived from a global
5512 template (the former print_mode reference), thus access becomes
5513 non-critical. The global print_mode reference is for session
5514 management only; user-code should use print_mode_value,
5515 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
5517 * Functions system/system_out provide a robust way to invoke external
5518 shell commands, with propagation of interrupts (requires Poly/ML
5519 5.2.1). Do not use OS.Process.system etc. from the basis library!
5524 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
5525 in accordance with Proof General 3.7, which prefers GNU emacs.
5527 * isatool tty runs Isabelle process with plain tty interaction;
5528 optional line editor may be specified via ISABELLE_LINE_EDITOR
5529 setting, the default settings attempt to locate "ledit" and "rlwrap".
5531 * isatool browser now works with Cygwin as well, using general
5532 "javapath" function defined in Isabelle process environment.
5534 * YXML notation provides a simple and efficient alternative to
5535 standard XML transfer syntax. See src/Pure/General/yxml.ML and
5536 isatool yxml as described in the Isabelle system manual.
5538 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
5539 provides general wrapper for managing an Isabelle process in a robust
5540 fashion, with ``cooked'' output from stdin/stderr.
5542 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
5543 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
5545 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
5546 way of changing the user's settings is via
5547 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
5550 * Multithreading.max_threads := 0 refers to the number of actual CPU
5551 cores of the underlying machine, which is a good starting point for
5552 optimal performance tuning. The corresponding usedir option -M allows
5553 "max" as an alias for "0". WARNING: does not work on certain versions
5554 of Mac OS (with Poly/ML 5.1).
5556 * isabelle-process: non-ML sessions are run with "nice", to reduce the
5557 adverse effect of Isabelle flooding interactive front-ends (notably
5558 ProofGeneral / XEmacs).
5562 New in Isabelle2007 (November 2007)
5563 -----------------------------------
5567 * More uniform information about legacy features, notably a
5568 warning/error of "Legacy feature: ...", depending on the state of the
5569 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
5570 legacy features will disappear eventually.
5572 * Theory syntax: the header format ``theory A = B + C:'' has been
5573 discontinued in favour of ``theory A imports B C begin''. Use isatool
5574 fixheaders to convert existing theory files. INCOMPATIBILITY.
5576 * Theory syntax: the old non-Isar theory file format has been
5577 discontinued altogether. Note that ML proof scripts may still be used
5578 with Isar theories; migration is usually quite simple with the ML
5579 function use_legacy_bindings. INCOMPATIBILITY.
5581 * Theory syntax: some popular names (e.g. 'class', 'declaration',
5582 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
5585 * Theory loader: be more serious about observing the static theory
5586 header specifications (including optional directories), but not the
5587 accidental file locations of previously successful loads. The strict
5588 update policy of former update_thy is now already performed by
5589 use_thy, so the former has been removed; use_thys updates several
5590 theories simultaneously, just as 'imports' within a theory header
5591 specification, but without merging the results. Potential
5592 INCOMPATIBILITY: may need to refine theory headers and commands
5593 ROOT.ML which depend on load order.
5595 * Theory loader: optional support for content-based file
5596 identification, instead of the traditional scheme of full physical
5597 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
5598 (cf. the system manual). The new scheme allows to work with
5599 non-finished theories in persistent session images, such that source
5600 files may be moved later on without requiring reloads.
5602 * Theory loader: old-style ML proof scripts being *attached* to a thy
5603 file (with the same base name as the theory) are considered a legacy
5604 feature, which will disappear eventually. Even now, the theory loader
5605 no longer maintains dependencies on such files.
5607 * Syntax: the scope for resolving ambiguities via type-inference is
5608 now limited to individual terms, instead of whole simultaneous
5609 specifications as before. This greatly reduces the complexity of the
5610 syntax module and improves flexibility by separating parsing and
5611 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
5612 'fixes' etc.) are required in rare situations.
5614 * Syntax: constants introduced by new-style packages ('definition',
5615 'abbreviation' etc.) are passed through the syntax module in
5616 ``authentic mode''. This means that associated mixfix annotations
5617 really stick to such constants, independently of potential name space
5618 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
5619 trees are represented slightly differently, may need to adapt syntax
5620 translations accordingly. Use CONST marker in 'translations' and
5621 @{const_syntax} antiquotation in 'parse_translation' etc.
5623 * Legacy goal package: reduced interface to the bare minimum required
5624 to keep existing proof scripts running. Most other user-level
5625 functions are now part of the OldGoals structure, which is *not* open
5626 by default (consider isatool expandshort before open OldGoals).
5627 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
5628 these tend to cause confusion about the actual goal (!) context being
5629 used here, which is not necessarily the same as the_context().
5631 * Command 'find_theorems': supports "*" wild-card in "name:"
5632 criterion; "with_dups" option. Certain ProofGeneral versions might
5633 support a specific search form (see ProofGeneral/CHANGES).
5635 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
5636 by default, which means that "prems" (and also "fixed variables") are
5637 suppressed from proof state output. Note that the ProofGeneral
5638 settings mechanism allows to change and save options persistently, but
5639 older versions of Isabelle will fail to start up if a negative prems
5642 * Local theory targets may be specified by non-nested blocks of
5643 ``context/locale/class ... begin'' followed by ``end''. The body may
5644 contain definitions, theorems etc., including any derived mechanism
5645 that has been implemented on top of these primitives. This concept
5646 generalizes the existing ``theorem (in ...)'' towards more versatility
5649 * Proof General interface: proper undo of final 'end' command;
5650 discontinued Isabelle/classic mode (ML proof scripts).
5653 *** Document preparation ***
5655 * Added antiquotation @{theory name} which prints the given name,
5656 after checking that it refers to a valid ancestor theory in the
5659 * Added antiquotations @{ML_type text} and @{ML_struct text} which
5660 check the given source text as ML type/structure, printing verbatim.
5662 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
5663 "c args == rhs" given in the current context. (Any number of
5664 arguments may be given on the LHS.)
5669 * The 'class' package offers a combination of axclass and locale to
5670 achieve Haskell-like type classes in Isabelle. Definitions and
5671 theorems within a class context produce both relative results (with
5672 implicit parameters according to the locale context), and polymorphic
5673 constants with qualified polymorphism (according to the class
5674 context). Within the body context of a 'class' target, a separate
5675 syntax layer ("user space type system") takes care of converting
5676 between global polymorphic consts and internal locale representation.
5677 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
5678 "isatool doc classes" provides a tutorial.
5680 * Generic code generator framework allows to generate executable
5681 code for ML and Haskell (including Isabelle classes). A short usage
5684 internal compilation:
5685 export_code <list of constants (term syntax)> in SML
5686 writing SML code to a file:
5687 export_code <list of constants (term syntax)> in SML <filename>
5688 writing OCaml code to a file:
5689 export_code <list of constants (term syntax)> in OCaml <filename>
5690 writing Haskell code to a bunch of files:
5691 export_code <list of constants (term syntax)> in Haskell <filename>
5693 evaluating closed propositions to True/False using code generation:
5696 Reasonable default setup of framework in HOL.
5698 Theorem attributs for selecting and transforming function equations theorems:
5700 [code fun]: select a theorem as function equation for a specific constant
5701 [code fun del]: deselect a theorem as function equation for a specific constant
5702 [code inline]: select an equation theorem for unfolding (inlining) in place
5703 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
5705 User-defined serializations (target in {SML, OCaml, Haskell}):
5707 code_const <and-list of constants (term syntax)>
5708 {(target) <and-list of const target syntax>}+
5710 code_type <and-list of type constructors>
5711 {(target) <and-list of type target syntax>}+
5713 code_instance <and-list of instances>
5715 where instance ::= <type constructor> :: <class>
5717 code_class <and_list of classes>
5718 {(target) <and-list of class target syntax>}+
5719 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
5721 code_instance and code_class only are effective to target Haskell.
5723 For example usage see src/HOL/ex/Codegenerator.thy and
5724 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
5725 generation from Isabelle/HOL theories is available via "isatool doc
5728 * Code generator: consts in 'consts_code' Isar commands are now
5729 referred to by usual term syntax (including optional type
5732 * Command 'no_translations' removes translation rules from theory
5735 * Overloaded definitions are now actually checked for acyclic
5736 dependencies. The overloading scheme is slightly more general than
5737 that of Haskell98, although Isabelle does not demand an exact
5738 correspondence to type class and instance declarations.
5739 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
5740 exotic versions of overloading -- at the discretion of the user!
5742 Polymorphic constants are represented via type arguments, i.e. the
5743 instantiation that matches an instance against the most general
5744 declaration given in the signature. For example, with the declaration
5745 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
5746 as c(nat). Overloading is essentially simultaneous structural
5747 recursion over such type arguments. Incomplete specification patterns
5748 impose global constraints on all occurrences, e.g. c('a * 'a) on the
5749 LHS means that more general c('a * 'b) will be disallowed on any RHS.
5750 Command 'print_theory' outputs the normalized system of recursive
5751 equations, see section "definitions".
5753 * Configuration options are maintained within the theory or proof
5754 context (with name and type bool/int/string), providing a very simple
5755 interface to a poor-man's version of general context data. Tools may
5756 declare options in ML (e.g. using Attrib.config_int) and then refer to
5757 these values using Config.get etc. Users may change options via an
5758 associated attribute of the same name. This form of context
5759 declaration works particularly well with commands 'declare' or
5760 'using', for example ``declare [[foo = 42]]''. Thus it has become
5761 very easy to avoid global references, which would not observe Isar
5762 toplevel undo/redo and fail to work with multithreading.
5764 Various global ML references of Pure and HOL have been turned into
5765 configuration options:
5767 Unify.search_bound unify_search_bound
5768 Unify.trace_bound unify_trace_bound
5769 Unify.trace_simp unify_trace_simp
5770 Unify.trace_types unify_trace_types
5771 Simplifier.simp_depth_limit simp_depth_limit
5772 Blast.depth_limit blast_depth_limit
5773 DatatypeProp.dtK datatype_distinctness_limit
5774 fast_arith_neq_limit fast_arith_neq_limit
5775 fast_arith_split_limit fast_arith_split_limit
5777 * Named collections of theorems may be easily installed as context
5778 data using the functor NamedThmsFun (see also
5779 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
5780 attributes; there is also a toplevel print command. This facility is
5781 just a common case of general context data, which is the preferred way
5782 for anything more complex than just a list of facts in canonical
5785 * Isar: command 'declaration' augments a local theory by generic
5786 declaration functions written in ML. This enables arbitrary content
5787 being added to the context, depending on a morphism that tells the
5788 difference of the original declaration context wrt. the application
5789 context encountered later on.
5791 * Isar: proper interfaces for simplification procedures. Command
5792 'simproc_setup' declares named simprocs (with match patterns, and body
5793 text in ML). Attribute "simproc" adds/deletes simprocs in the current
5794 context. ML antiquotation @{simproc name} retrieves named simprocs.
5796 * Isar: an extra pair of brackets around attribute declarations
5797 abbreviates a theorem reference involving an internal dummy fact,
5798 which will be ignored later --- only the effect of the attribute on
5799 the background context will persist. This form of in-place
5800 declarations is particularly useful with commands like 'declare' and
5801 'using', for example ``have A using [[simproc a]] by simp''.
5803 * Isar: method "assumption" (and implicit closing of subproofs) now
5804 takes simple non-atomic goal assumptions into account: after applying
5805 an assumption as a rule the resulting subgoals are solved by atomic
5806 assumption steps. This is particularly useful to finish 'obtain'
5807 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
5808 without referring to the original premise "!!x. P x ==> thesis" in the
5809 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
5812 * Isar: implicit use of prems from the Isar proof context is
5813 considered a legacy feature. Common applications like ``have A .''
5814 may be replaced by ``have A by fact'' or ``note `A`''. In general,
5815 referencing facts explicitly here improves readability and
5816 maintainability of proof texts.
5818 * Isar: improper proof element 'guess' is like 'obtain', but derives
5819 the obtained context from the course of reasoning! For example:
5821 assume "EX x y. A x & B y" -- "any previous fact"
5822 then guess x and y by clarify
5824 This technique is potentially adventurous, depending on the facts and
5825 proof tools being involved here.
5827 * Isar: known facts from the proof context may be specified as literal
5828 propositions, using ASCII back-quote syntax. This works wherever
5829 named facts used to be allowed so far, in proof commands, proof
5830 methods, attributes etc. Literal facts are retrieved from the context
5831 according to unification of type and term parameters. For example,
5832 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
5833 theorems in the current context, then these are valid literal facts:
5834 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
5836 There is also a proof method "fact" which does the same composition
5837 for explicit goal states, e.g. the following proof texts coincide with
5838 certain special cases of literal facts:
5840 have "A" by fact == note `A`
5841 have "A ==> B" by fact == note `A ==> B`
5842 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
5843 have "P a ==> Q a" by fact == note `P a ==> Q a`
5845 * Isar: ":" (colon) is no longer a symbolic identifier character in
5846 outer syntax. Thus symbolic identifiers may be used without
5847 additional white space in declarations like this: ``assume *: A''.
5849 * Isar: 'print_facts' prints all local facts of the current context,
5850 both named and unnamed ones.
5852 * Isar: 'def' now admits simultaneous definitions, e.g.:
5854 def x == "t" and y == "u"
5856 * Isar: added command 'unfolding', which is structurally similar to
5857 'using', but affects both the goal state and facts by unfolding given
5858 rewrite rules. Thus many occurrences of the 'unfold' method or
5859 'unfolded' attribute may be replaced by first-class proof text.
5861 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
5862 and command 'unfolding' now all support object-level equalities
5863 (potentially conditional). The underlying notion of rewrite rule is
5864 analogous to the 'rule_format' attribute, but *not* that of the
5865 Simplifier (which is usually more generous).
5867 * Isar: the new attribute [rotated n] (default n = 1) rotates the
5868 premises of a theorem by n. Useful in conjunction with drule.
5870 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
5871 method expression within a sandbox consisting of the first N
5872 sub-goals, which need to exist. For example, ``simp_all [3]''
5873 simplifies the first three sub-goals, while (rule foo, simp_all)[]
5874 simplifies all new goals that emerge from applying rule foo to the
5875 originally first one.
5877 * Isar: schematic goals are no longer restricted to higher-order
5878 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
5881 * Isar: the conclusion of a long theorem statement is now either
5882 'shows' (a simultaneous conjunction, as before), or 'obtains'
5883 (essentially a disjunction of cases with local parameters and
5884 assumptions). The latter allows to express general elimination rules
5885 adequately; in this notation common elimination rules look like this:
5887 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
5889 obtains x where "P x"
5891 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
5895 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
5901 The subsequent classical rules even refer to the formal "thesis"
5904 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
5907 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
5908 obtains "thesis ==> something"
5910 The actual proof of an 'obtains' statement is analogous to that of the
5911 Isar proof element 'obtain', only that there may be several cases.
5912 Optional case names may be specified in parentheses; these will be
5913 available both in the present proof and as annotations in the
5914 resulting rule, for later use with the 'cases' method (cf. attribute
5917 * Isar: the assumptions of a long theorem statement are available as
5918 "assms" fact in the proof context. This is more appropriate than the
5919 (historical) "prems", which refers to all assumptions of the current
5920 context, including those from the target locale, proof body etc.
5922 * Isar: 'print_statement' prints theorems from the current theory or
5923 proof context in long statement form, according to the syntax of a
5926 * Isar: 'obtain' takes an optional case name for the local context
5927 introduction rule (default "that").
5929 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
5930 explicit (is "_ ==> ?foo") in the rare cases where this still happens
5933 * Pure: syntax "CONST name" produces a fully internalized constant
5934 according to the current context. This is particularly useful for
5935 syntax translations that should refer to internal constant
5936 representations independently of name spaces.
5938 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
5939 instead of "FOO ". This allows multiple binder declarations to coexist
5940 in the same context. INCOMPATIBILITY.
5942 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
5943 primitive that also works in a locale context (both for constants and
5944 fixed variables). Type declaration and internal syntactic representation
5945 of given constants retrieved from the context. Likewise, the
5946 'no_notation' command allows to remove given syntax annotations from the
5949 * Isar/locales: new derived specification elements 'axiomatization',
5950 'definition', 'abbreviation', which support type-inference, admit
5951 object-level specifications (equality, equivalence). See also the
5952 isar-ref manual. Examples:
5955 eq (infix "===" 50) where
5956 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
5958 definition "f x y = x + y + 1"
5959 definition g where "g x = f x x"
5962 neq (infix "=!=" 50) where
5963 "x =!= y == ~ (x === y)"
5965 These specifications may be also used in a locale context. Then the
5966 constants being introduced depend on certain fixed parameters, and the
5967 constant name is qualified by the locale base name. An internal
5968 abbreviation takes care for convenient input and output, making the
5969 parameters implicit and using the original short name. See also
5970 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
5971 entities from a monomorphic theory.
5973 Presently, abbreviations are only available 'in' a target locale, but
5974 not inherited by general import expressions. Also note that
5975 'abbreviation' may be used as a type-safe replacement for 'syntax' +
5976 'translations' in common applications. The "no_abbrevs" print mode
5977 prevents folding of abbreviations in term output.
5979 Concrete syntax is attached to specified constants in internal form,
5980 independently of name spaces. The parse tree representation is
5981 slightly different -- use 'notation' instead of raw 'syntax', and
5982 'translations' with explicit "CONST" markup to accommodate this.
5984 * Pure/Isar: unified syntax for new-style specification mechanisms
5985 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
5986 full type inference and dummy patterns ("_"). For example:
5988 definition "K x _ = x"
5990 inductive conj for A B
5991 where "A ==> B ==> conj A B"
5993 * Pure: command 'print_abbrevs' prints all constant abbreviations of
5994 the current context. Print mode "no_abbrevs" prevents inversion of
5995 abbreviations on output.
5997 * Isar/locales: improved parameter handling: use of locales "var" and
5998 "struct" no longer necessary; - parameter renamings are no longer
5999 required to be injective. For example, this allows to define
6000 endomorphisms as locale endom = homom mult mult h.
6002 * Isar/locales: changed the way locales with predicates are defined.
6003 Instead of accumulating the specification, the imported expression is
6004 now an interpretation. INCOMPATIBILITY: different normal form of
6005 locale expressions. In particular, in interpretations of locales with
6006 predicates, goals repesenting already interpreted fragments are not
6007 removed automatically. Use methods `intro_locales' and
6008 `unfold_locales'; see below.
6010 * Isar/locales: new methods `intro_locales' and `unfold_locales'
6011 provide backward reasoning on locales predicates. The methods are
6012 aware of interpretations and discharge corresponding goals.
6013 `intro_locales' is less aggressive then `unfold_locales' and does not
6014 unfold predicates to assumptions.
6016 * Isar/locales: the order in which locale fragments are accumulated
6017 has changed. This enables to override declarations from fragments due
6018 to interpretations -- for example, unwanted simp rules.
6020 * Isar/locales: interpretation in theories and proof contexts has been
6021 extended. One may now specify (and prove) equations, which are
6022 unfolded in interpreted theorems. This is useful for replacing
6023 defined concepts (constants depending on locale parameters) by
6024 concepts already existing in the target context. Example:
6026 interpretation partial_order ["op <= :: [int, int] => bool"]
6027 where "partial_order.less (op <=) (x::int) y = (x < y)"
6029 Typically, the constant `partial_order.less' is created by a
6030 definition specification element in the context of locale
6033 * Method "induct": improved internal context management to support
6034 local fixes and defines on-the-fly. Thus explicit meta-level
6035 connectives !! and ==> are rarely required anymore in inductive goals
6036 (using object-logic connectives for this purpose has been long
6037 obsolete anyway). Common proof patterns are explained in
6038 src/HOL/Induct/Common_Patterns.thy, see also
6039 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
6042 * Method "induct": improved handling of simultaneous goals. Instead of
6043 introducing object-level conjunction, the statement is now split into
6044 several conclusions, while the corresponding symbolic cases are nested
6045 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
6046 see src/HOL/Induct/Common_Patterns.thy, for example.
6048 * Method "induct": mutual induction rules are now specified as a list
6049 of rule sharing the same induction cases. HOL packages usually provide
6050 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
6051 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
6052 mutual induction rules differently, i.e. like this:
6054 (induct rule: foo_bar.inducts)
6055 (induct set: foo bar)
6056 (induct pred: foo bar)
6057 (induct type: foo bar)
6059 The ML function ProjectRule.projections turns old-style rules into the
6062 * Method "coinduct": dual of induction, see
6063 src/HOL/Library/Coinductive_List.thy for various examples.
6065 * Method "cases", "induct", "coinduct": the ``(open)'' option is
6066 considered a legacy feature.
6068 * Attribute "symmetric" produces result with standardized schematic
6069 variables (index 0). Potential INCOMPATIBILITY.
6071 * Simplifier: by default the simplifier trace only shows top level
6072 rewrites now. That is, trace_simp_depth_limit is set to 1 by
6073 default. Thus there is less danger of being flooded by the trace. The
6074 trace indicates where parts have been suppressed.
6076 * Provers/classical: removed obsolete classical version of elim_format
6077 attribute; classical elim/dest rules are now treated uniformly when
6078 manipulating the claset.
6080 * Provers/classical: stricter checks to ensure that supplied intro,
6081 dest and elim rules are well-formed; dest and elim rules must have at
6084 * Provers/classical: attributes dest/elim/intro take an optional
6085 weight argument for the rule (just as the Pure versions). Weights are
6086 ignored by automated tools, but determine the search order of single
6089 * Syntax: input syntax now supports dummy variable binding "%_. b",
6090 where the body does not mention the bound variable. Note that dummy
6091 patterns implicitly depend on their context of bounds, which makes
6092 "{_. _}" match any set comprehension as expected. Potential
6093 INCOMPATIBILITY -- parse translations need to cope with syntactic
6094 constant "_idtdummy" in the binding position.
6096 * Syntax: removed obsolete syntactic constant "_K" and its associated
6097 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
6098 for example "A -> B" => "Pi A (%_. B)".
6100 * Pure: 'class_deps' command visualizes the subclass relation, using
6101 the graph browser tool.
6103 * Pure: 'print_theory' now suppresses certain internal declarations by
6104 default; use '!' option for full details.
6109 * Method "metis" proves goals by applying the Metis general-purpose
6110 resolution prover (see also http://gilith.com/software/metis/).
6111 Examples are in the directory MetisExamples. WARNING: the
6112 Isabelle/HOL-Metis integration does not yet work properly with
6115 * Command 'sledgehammer' invokes external automatic theorem provers as
6116 background processes. It generates calls to the "metis" method if
6117 successful. These can be pasted into the proof. Users do not have to
6118 wait for the automatic provers to return. WARNING: does not really
6119 work with multi-threading.
6121 * New "auto_quickcheck" feature tests outermost goal statements for
6122 potential counter-examples. Controlled by ML references
6123 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
6124 5000 milliseconds). Fails silently if statements is outside of
6125 executable fragment, or any other codgenerator problem occurs.
6127 * New constant "undefined" with axiom "undefined x = undefined".
6129 * Added class "HOL.eq", allowing for code generation with polymorphic
6132 * Some renaming of class constants due to canonical name prefixing in
6133 the new 'class' package:
6135 HOL.abs ~> HOL.abs_class.abs
6136 HOL.divide ~> HOL.divide_class.divide
6137 0 ~> HOL.zero_class.zero
6138 1 ~> HOL.one_class.one
6139 op + ~> HOL.plus_class.plus
6140 op - ~> HOL.minus_class.minus
6141 uminus ~> HOL.minus_class.uminus
6142 op * ~> HOL.times_class.times
6143 op < ~> HOL.ord_class.less
6144 op <= > HOL.ord_class.less_eq
6145 Nat.power ~> Power.power_class.power
6146 Nat.size ~> Nat.size_class.size
6147 Numeral.number_of ~> Numeral.number_class.number_of
6148 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
6149 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
6150 Orderings.min ~> Orderings.ord_class.min
6151 Orderings.max ~> Orderings.ord_class.max
6152 Divides.op div ~> Divides.div_class.div
6153 Divides.op mod ~> Divides.div_class.mod
6154 Divides.op dvd ~> Divides.div_class.dvd
6156 INCOMPATIBILITY. Adaptions may be required in the following cases:
6158 a) User-defined constants using any of the names "plus", "minus",
6159 "times", "less" or "less_eq". The standard syntax translations for
6160 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
6163 b) Variables named "plus", "minus", "times", "less", "less_eq"
6164 INCOMPATIBILITY: use more specific names.
6166 c) Permutative equations (e.g. "a + b = b + a")
6167 Since the change of names also changes the order of terms, permutative
6168 rewrite rules may get applied in a different order. Experience shows
6169 that this is rarely the case (only two adaptions in the whole Isabelle
6170 distribution). INCOMPATIBILITY: rewrite proofs
6172 d) ML code directly refering to constant names
6173 This in general only affects hand-written proof tactics, simprocs and
6174 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
6175 Consider using @{const_name} antiquotation.
6177 * New class "default" with associated constant "default".
6179 * Function "sgn" is now overloaded and available on int, real, complex
6180 (and other numeric types), using class "sgn". Two possible defs of
6181 sgn are given as equational assumptions in the classes sgn_if and
6182 sgn_div_norm; ordered_idom now also inherits from sgn_if.
6185 * Locale "partial_order" now unified with class "order" (cf. theory
6186 Orderings), added parameter "less". INCOMPATIBILITY.
6188 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
6189 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
6190 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
6192 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
6193 changed order of proof goals in instance proofs.
6195 * The transitivity reasoner for partial and linear orders is set up
6196 for classes "order" and "linorder". Instances of the reasoner are available
6197 in all contexts importing or interpreting the corresponding locales.
6198 Method "order" invokes the reasoner separately; the reasoner
6199 is also integrated with the Simplifier as a solver. Diagnostic
6200 command 'print_orders' shows the available instances of the reasoner
6201 in the current context.
6203 * Localized monotonicity predicate in theory "Orderings"; integrated
6204 lemmas max_of_mono and min_of_mono with this predicate.
6207 * Formulation of theorem "dense" changed slightly due to integration
6208 with new class dense_linear_order.
6210 * Uniform lattice theory development in HOL.
6212 constants "meet" and "join" now named "inf" and "sup"
6213 constant "Meet" now named "Inf"
6215 classes "meet_semilorder" and "join_semilorder" now named
6216 "lower_semilattice" and "upper_semilattice"
6217 class "lorder" now named "lattice"
6218 class "comp_lat" now named "complete_lattice"
6220 Instantiation of lattice classes allows explicit definitions
6221 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
6223 INCOMPATIBILITY. Theorem renames:
6225 meet_left_le ~> inf_le1
6226 meet_right_le ~> inf_le2
6227 join_left_le ~> sup_ge1
6228 join_right_le ~> sup_ge2
6229 meet_join_le ~> inf_sup_ord
6232 le_meet ~> le_inf_iff
6233 le_join ~> ge_sup_conv
6234 meet_idempotent ~> inf_idem
6235 join_idempotent ~> sup_idem
6236 meet_comm ~> inf_commute
6237 join_comm ~> sup_commute
6238 meet_leI1 ~> le_infI1
6239 meet_leI2 ~> le_infI2
6240 le_joinI1 ~> le_supI1
6241 le_joinI2 ~> le_supI2
6242 meet_assoc ~> inf_assoc
6243 join_assoc ~> sup_assoc
6244 meet_left_comm ~> inf_left_commute
6245 meet_left_idempotent ~> inf_left_idem
6246 join_left_comm ~> sup_left_commute
6247 join_left_idempotent ~> sup_left_idem
6250 le_def_meet ~> le_iff_inf
6251 le_def_join ~> le_iff_sup
6252 join_absorp2 ~> sup_absorb2
6253 join_absorp1 ~> sup_absorb1
6254 meet_absorp1 ~> inf_absorb1
6255 meet_absorp2 ~> inf_absorb2
6256 meet_join_absorp ~> inf_sup_absorb
6257 join_meet_absorp ~> sup_inf_absorb
6258 distrib_join_le ~> distrib_sup_le
6259 distrib_meet_le ~> distrib_inf_le
6261 add_meet_distrib_left ~> add_inf_distrib_left
6262 add_join_distrib_left ~> add_sup_distrib_left
6263 is_join_neg_meet ~> is_join_neg_inf
6264 is_meet_neg_join ~> is_meet_neg_sup
6265 add_meet_distrib_right ~> add_inf_distrib_right
6266 add_join_distrib_right ~> add_sup_distrib_right
6267 add_meet_join_distribs ~> add_sup_inf_distribs
6268 join_eq_neg_meet ~> sup_eq_neg_inf
6269 meet_eq_neg_join ~> inf_eq_neg_sup
6270 add_eq_meet_join ~> add_eq_inf_sup
6271 meet_0_imp_0 ~> inf_0_imp_0
6272 join_0_imp_0 ~> sup_0_imp_0
6273 meet_0_eq_0 ~> inf_0_eq_0
6274 join_0_eq_0 ~> sup_0_eq_0
6275 neg_meet_eq_join ~> neg_inf_eq_sup
6276 neg_join_eq_meet ~> neg_sup_eq_inf
6277 join_eq_if ~> sup_eq_if
6279 mono_meet ~> mono_inf
6280 mono_join ~> mono_sup
6281 meet_bool_eq ~> inf_bool_eq
6282 join_bool_eq ~> sup_bool_eq
6283 meet_fun_eq ~> inf_fun_eq
6284 join_fun_eq ~> sup_fun_eq
6285 meet_set_eq ~> inf_set_eq
6286 join_set_eq ~> sup_set_eq
6287 meet1_iff ~> inf1_iff
6288 meet2_iff ~> inf2_iff
6297 join1_iff ~> sup1_iff
6298 join2_iff ~> sup2_iff
6308 is_meet_Meet ~> is_meet_Inf
6309 Meet_bool_def ~> Inf_bool_def
6310 Meet_fun_def ~> Inf_fun_def
6311 Meet_greatest ~> Inf_greatest
6312 Meet_lower ~> Inf_lower
6313 Meet_set_def ~> Inf_set_def
6316 Sup_bool_eq ~> Sup_bool_def
6317 Sup_fun_eq ~> Sup_fun_def
6318 Sup_set_eq ~> Sup_set_def
6320 listsp_meetI ~> listsp_infI
6321 listsp_meet_eq ~> listsp_inf_eq
6326 * Added syntactic class "size"; overloaded constant "size" now has
6327 type "'a::size ==> bool"
6329 * Internal reorganisation of `size' of datatypes: size theorems
6330 "foo.size" are no longer subsumed by "foo.simps" (but are still
6331 simplification rules by default!); theorems "prod.size" now named
6334 * Class "div" now inherits from class "times" rather than "type".
6337 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
6338 Linorder etc. have disappeared; operations defined in terms of
6339 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
6341 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
6343 * HOL-Word: New extensive library and type for generic, fixed size
6344 machine words, with arithmetic, bit-wise, shifting and rotating
6345 operations, reflection into int, nat, and bool lists, automation for
6346 linear arithmetic (by automatic reflection into nat or int), including
6347 lemmas on overflow and monotonicity. Instantiated to all appropriate
6348 arithmetic type classes, supporting automatic simplification of
6349 numerals on all operations.
6351 * Library/Boolean_Algebra: locales for abstract boolean algebras.
6353 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
6355 * Code generator library theories:
6356 - Code_Integer represents HOL integers by big integer literals in target
6358 - Code_Char represents HOL characters by character literals in target
6360 - Code_Char_chr like Code_Char, but also offers treatment of character
6361 codes; includes Code_Integer.
6362 - Executable_Set allows to generate code for finite sets using lists.
6363 - Executable_Rat implements rational numbers as triples (sign, enumerator,
6365 - Executable_Real implements a subset of real numbers, namly those
6366 representable by rational numbers.
6367 - Efficient_Nat implements natural numbers by integers, which in general will
6368 result in higher efficency; pattern matching with 0/Suc is eliminated;
6369 includes Code_Integer.
6370 - Code_Index provides an additional datatype index which is mapped to
6371 target-language built-in integers.
6372 - Code_Message provides an additional datatype message_string which is isomorphic to
6373 strings; messages are mapped to target-language strings.
6375 * New package for inductive predicates
6377 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
6380 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
6381 for z_1 :: U_1 and ... and z_n :: U_m
6383 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
6386 with full support for type-inference, rather than
6388 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
6390 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
6391 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
6393 inductive "s z_1 ... z_m"
6395 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
6398 For backward compatibility, there is a wrapper allowing inductive
6399 sets to be defined with the new package via
6402 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
6403 for z_1 :: U_1 and ... and z_n :: U_m
6405 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
6411 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
6412 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
6413 for z_1 :: U_1 and ... and z_n :: U_m
6415 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
6416 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
6419 if the additional syntax "p ..." is required.
6421 Numerous examples can be found in the subdirectories src/HOL/Auth,
6422 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
6426 - Since declaration and definition of inductive sets or predicates
6427 is no longer separated, abbreviations involving the newly
6428 introduced sets or predicates must be specified together with the
6429 introduction rules after the 'where' keyword (see above), rather
6430 than before the actual inductive definition.
6432 - The variables in induction and elimination rules are now
6433 quantified in the order of their occurrence in the introduction
6434 rules, rather than in alphabetical order. Since this may break
6435 some proofs, these proofs either have to be repaired, e.g. by
6436 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
6437 statements of the form
6439 case (rule_i a_i_1 ... a_i_{k_i})
6441 or the old order of quantification has to be restored by explicitly adding
6442 meta-level quantifiers in the introduction rules, i.e.
6444 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
6446 - The format of the elimination rules is now
6448 p z_1 ... z_m x_1 ... x_n ==>
6449 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
6454 (x_1, ..., x_n) : s z_1 ... z_m ==>
6455 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
6458 for sets rather than
6460 x : s z_1 ... z_m ==>
6461 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
6464 This may require terms in goals to be expanded to n-tuples
6465 (e.g. using case_tac or simplification with the split_paired_all
6466 rule) before the above elimination rule is applicable.
6468 - The elimination or case analysis rules for (mutually) inductive
6469 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
6470 list of rules "p_1_..._p_k.elims" is no longer available.
6472 * New package "function"/"fun" for general recursive functions,
6473 supporting mutual and nested recursion, definitions in local contexts,
6474 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
6475 for small examples, and the separate tutorial on the function
6476 package. The old recdef "package" is still available as before, but
6477 users are encouraged to use the new package.
6479 * Method "lexicographic_order" automatically synthesizes termination
6480 relations as lexicographic combinations of size measures.
6482 * Case-expressions allow arbitrary constructor-patterns (including
6483 "_") and take their order into account, like in functional
6484 programming. Internally, this is translated into nested
6485 case-expressions; missing cases are added and mapped to the predefined
6486 constant "undefined". In complicated cases printing may no longer show
6487 the original input but the internal form. Lambda-abstractions allow
6488 the same form of pattern matching: "% pat1 => e1 | ..." is an
6489 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
6492 * IntDef: The constant "int :: nat => int" has been removed; now "int"
6493 is an abbreviation for "of_nat :: nat => int". The simplification
6494 rules for "of_nat" have been changed to work like "int" did
6495 previously. Potential INCOMPATIBILITY:
6496 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
6497 - of_nat_diff and of_nat_mult are no longer default simp rules
6499 * Method "algebra" solves polynomial equations over (semi)rings using
6500 Groebner bases. The (semi)ring structure is defined by locales and the
6501 tool setup depends on that generic context. Installing the method for
6502 a specific type involves instantiating the locale and possibly adding
6503 declarations for computation on the coefficients. The method is
6504 already instantiated for natural numbers and for the axiomatic class
6505 of idoms with numerals. See also the paper by Chaieb and Wenzel at
6506 CALCULEMUS 2007 for the general principles underlying this
6507 architecture of context-aware proof-tools.
6509 * Method "ferrack" implements quantifier elimination over
6510 special-purpose dense linear orders using locales (analogous to
6511 "algebra"). The method is already installed for class
6512 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
6515 * Former constant "List.op @" now named "List.append". Use ML
6516 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
6517 circumvent possible incompatibilities when working on ML level.
6519 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
6521 * New function listsum :: 'a list => 'a for arbitrary monoids.
6522 Special syntax: "SUM x <- xs. f x" (and latex variants)
6524 * New syntax for Haskell-like list comprehension (input only), eg.
6525 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
6527 * The special syntax for function "filter" has changed from [x :
6528 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
6529 comprehension syntax, and for uniformity. INCOMPATIBILITY.
6531 * [a..b] is now defined for arbitrary linear orders. It used to be
6532 defined on nat only, as an abbreviation for [a..<Suc b]
6535 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
6537 * New functions "sorted" and "sort" in src/HOL/List.thy.
6539 * New lemma collection field_simps (an extension of ring_simps) for
6540 manipulating (in)equations involving division. Multiplies with all
6541 denominators that can be proved to be non-zero (in equations) or
6542 positive/negative (in inequations).
6544 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
6545 have been improved and renamed to ring_simps, group_simps and
6546 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
6547 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
6549 * Theory Library/Commutative_Ring: switched from recdef to function
6550 package; constants add, mul, pow now curried. Infix syntax for
6551 algebraic operations.
6553 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
6556 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
6559 * HOL/records: generalised field-update to take a function on the
6560 field rather than the new value: r(|A := x|) is translated to A_update
6561 (K x) r The K-combinator that is internally used is called K_record.
6562 INCOMPATIBILITY: Usage of the plain update functions has to be
6565 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
6566 * x = 0, which are required for a semiring. Richer structures do not
6567 inherit from semiring_0 anymore, because this property is a theorem
6568 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
6569 there is more to prove, but this is mostly trivial.
6571 * Class "recpower" is generalized to arbitrary monoids, not just
6572 commutative semirings. INCOMPATIBILITY: may need to incorporate
6573 commutativity or semiring properties additionally.
6575 * Constant "List.list_all2" in List.thy now uses authentic syntax.
6576 INCOMPATIBILITY: translations containing list_all2 may go wrong,
6577 better use 'abbreviation'.
6579 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
6581 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
6582 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
6583 significant changes for setting up numeral syntax for types:
6584 - New constants Numeral.pred and Numeral.succ instead
6585 of former Numeral.bin_pred and Numeral.bin_succ.
6586 - Use integer operations instead of bin_add, bin_mult and so on.
6587 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
6588 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
6590 See src/HOL/Integ/IntArith.thy for an example setup.
6592 * Command 'normal_form' computes the normal form of a term that may
6593 contain free variables. For example ``normal_form "rev [a, b, c]"''
6594 produces ``[b, c, a]'' (without proof). This command is suitable for
6595 heavy-duty computations because the functions are compiled to ML
6596 first. Correspondingly, a method "normalization" is provided. See
6597 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
6599 * Alternative iff syntax "A <-> B" for equality on bool (with priority
6600 25 like -->); output depends on the "iff" print_mode, the default is
6601 "A = B" (with priority 50).
6603 * Relations less (<) and less_eq (<=) are also available on type bool.
6604 Modified syntax to disallow nesting without explicit parentheses,
6605 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
6608 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
6610 * Relation composition operator "op O" now has precedence 75 and binds
6611 stronger than union and intersection. INCOMPATIBILITY.
6613 * The old set interval syntax "{m..n(}" (and relatives) has been
6614 removed. Use "{m..<n}" (and relatives) instead.
6616 * In the context of the assumption "~(s = t)" the Simplifier rewrites
6617 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
6618 ``declare [[simproc del: neq]]''.
6620 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
6623 * Theorem Cons_eq_map_conv no longer declared as "simp".
6625 * Theorem setsum_mult renamed to setsum_right_distrib.
6627 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
6630 * Reimplemented methods "sat" and "satx", with several improvements:
6631 goals no longer need to be stated as "<prems> ==> False", equivalences
6632 (i.e. "=" on type bool) are handled, variable names of the form
6633 "lit_<n>" are no longer reserved, significant speedup.
6635 * Methods "sat" and "satx" can now replay MiniSat proof traces.
6636 zChaff is still supported as well.
6638 * 'inductive' and 'datatype': provide projections of mutual rules,
6639 bundled as foo_bar.inducts;
6641 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
6644 * Library: moved theory Accessible_Part to main HOL.
6646 * Library: added theory Coinductive_List of potentially infinite lists
6647 as greatest fixed-point.
6649 * Library: added theory AssocList which implements (finite) maps as
6652 * Method "evaluation" solves goals (i.e. a boolean expression)
6653 efficiently by compiling it to ML. The goal is "proved" (via an
6654 oracle) if it evaluates to True.
6656 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
6657 also when invoked by the simplifier. This results in the Simplifier
6658 being more powerful on arithmetic goals. INCOMPATIBILITY.
6659 Configuration option fast_arith_split_limit=0 recovers the old
6662 * Support for hex (0x20) and binary (0b1001) numerals.
6664 * New method: reify eqs (t), where eqs are equations for an
6665 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
6666 parameter, computes a term s::'b and a list xs::'a list and proves the
6667 theorem I xs s = t. This is also known as reification or quoting. The
6668 resulting theorem is applied to the subgoal to substitute t with I xs
6669 s. If t is omitted, the subgoal itself is reified.
6671 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
6672 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
6673 where f is supposed to be a computable function (in the sense of code
6674 generattion). The method uses reify to compute s and xs as above then
6675 applies corr_thm and uses normalization by evaluation to "prove" f s =
6676 r and finally gets the theorem t = r, which is again applied to the
6677 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
6679 * Reflection: Automatic reification now handels binding, an example is
6680 available in src/HOL/ex/ReflectionEx.thy
6682 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
6683 command 'statespace' that is similar to 'record', but introduces an
6684 abstract specification based on the locale infrastructure instead of
6685 HOL types. This leads to extra flexibility in composing state spaces,
6686 in particular multiple inheritance and renaming of components.
6691 * Hyperreal: Functions root and sqrt are now defined on negative real
6692 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
6693 Nonnegativity side conditions have been removed from many lemmas, so
6694 that more subgoals may now be solved by simplification; potential
6697 * Real: new type classes formalize real normed vector spaces and
6698 algebras, using new overloaded constants scaleR :: real => 'a => 'a
6699 and norm :: 'a => real.
6701 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
6702 reals into other types. The overloaded constant Reals :: 'a set is now
6703 defined as range of_real; potential INCOMPATIBILITY.
6705 * Real: proper support for ML code generation, including 'quickcheck'.
6706 Reals are implemented as arbitrary precision rationals.
6708 * Hyperreal: Several constants that previously worked only for the
6709 reals have been generalized, so they now work over arbitrary vector
6710 spaces. Type annotations may need to be added in some cases; potential
6713 Infinitesimal :: ('a::real_normed_vector) star set
6714 HFinite :: ('a::real_normed_vector) star set
6715 HInfinite :: ('a::real_normed_vector) star set
6716 approx :: ('a::real_normed_vector) star => 'a star => bool
6717 monad :: ('a::real_normed_vector) star => 'a star set
6718 galaxy :: ('a::real_normed_vector) star => 'a star set
6719 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
6720 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
6721 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
6722 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
6723 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
6724 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
6725 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
6726 sgn :: 'a::real_normed_vector => 'a
6727 exp :: 'a::{recpower,real_normed_field,banach} => 'a
6729 * Complex: Some complex-specific constants are now abbreviations for
6730 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
6731 hnorm. Other constants have been entirely removed in favor of the
6732 polymorphic versions (INCOMPATIBILITY):
6736 HInfinite <-- CInfinite
6737 Infinitesimal <-- CInfinitesimal
6740 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
6741 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
6742 (ns)deriv <-- (ns)cderiv
6747 * Formalisation of ideals and the quotient construction over rings.
6749 * Order and lattice theory no longer based on records.
6752 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
6753 greatest_closed. INCOMPATIBILITY.
6755 * Method algebra is now set up via an attribute. For examples see
6756 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
6757 of algebraic structures.
6759 * Renamed theory CRing to Ring.
6764 * Substantial, yet incomplete support for nominal datatypes (binding
6765 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
6766 src/HOL/Nominal/Examples. Prospective users should consult
6767 http://isabelle.in.tum.de/nominal/
6772 * ML basics: just one true type int, which coincides with IntInf.int
6775 * ML within Isar: antiquotations allow to embed statically-checked
6776 formal entities in the source, referring to the context available at
6777 compile-time. For example:
6779 ML {* @{sort "{zero,one}"} *}
6780 ML {* @{typ "'a => 'b"} *}
6781 ML {* @{term "%x. x"} *}
6782 ML {* @{prop "x == y"} *}
6783 ML {* @{ctyp "'a => 'b"} *}
6784 ML {* @{cterm "%x. x"} *}
6785 ML {* @{cprop "x == y"} *}
6786 ML {* @{thm asm_rl} *}
6787 ML {* @{thms asm_rl} *}
6788 ML {* @{type_name c} *}
6789 ML {* @{type_syntax c} *}
6790 ML {* @{const_name c} *}
6791 ML {* @{const_syntax c} *}
6794 ML {* @{theory Pure} *}
6795 ML {* @{theory_ref} *}
6796 ML {* @{theory_ref Pure} *}
6799 ML {* @{clasimpset} *}
6801 The same works for sources being ``used'' within an Isar context.
6803 * ML in Isar: improved error reporting; extra verbosity with
6804 ML_Context.trace enabled.
6806 * Pure/General/table.ML: the join operations now works via exceptions
6807 DUP/SAME instead of type option. This is simpler in simple cases, and
6808 admits slightly more efficient complex applications.
6810 * Pure: 'advanced' translation functions (parse_translation etc.) now
6811 use Context.generic instead of just theory.
6813 * Pure: datatype Context.generic joins theory/Proof.context and
6814 provides some facilities for code that works in either kind of
6815 context, notably GenericDataFun for uniform theory and proof data.
6817 * Pure: simplified internal attribute type, which is now always
6818 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
6819 local (Proof.context) attributes have been discontinued, while
6820 minimizing code duplication. Thm.rule_attribute and
6821 Thm.declaration_attribute build canonical attributes; see also structure
6822 Context for further operations on Context.generic, notably
6823 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
6824 declarations and definitions.
6826 * Context data interfaces (Theory/Proof/GenericDataFun): removed
6827 name/print, uninitialized data defaults to ad-hoc copy of empty value,
6828 init only required for impure data. INCOMPATIBILITY: empty really need
6829 to be empty (no dependencies on theory content!)
6831 * Pure/kernel: consts certification ignores sort constraints given in
6832 signature declarations. (This information is not relevant to the
6833 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
6834 potential INCOMPATIBILITY.
6836 * Pure: axiomatic type classes are now purely definitional, with
6837 explicit proofs of class axioms and super class relations performed
6838 internally. See Pure/axclass.ML for the main internal interfaces --
6839 notably AxClass.define_class supercedes AxClass.add_axclass, and
6840 AxClass.axiomatize_class/classrel/arity supersede
6841 Sign.add_classes/classrel/arities.
6843 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
6844 global/local versions on theory vs. Proof.context have been
6845 discontinued; Attrib.syntax and Method.syntax have been adapted
6846 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
6847 attributes, methods, etc.
6849 * Pure: several functions of signature "... -> theory -> theory * ..."
6850 have been reoriented to "... -> theory -> ... * theory" in order to
6851 allow natural usage in combination with the ||>, ||>>, |-> and
6852 fold_map combinators.
6854 * Pure: official theorem names (closed derivations) and additional
6855 comments (tags) are now strictly separate. Name hints -- which are
6856 maintained as tags -- may be attached any time without affecting the
6859 * Pure: primitive rule lift_rule now takes goal cterm instead of an
6860 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
6861 achieve the old behaviour.
6863 * Pure: the "Goal" constant is now called "prop", supporting a
6864 slightly more general idea of ``protecting'' meta-level rule
6867 * Pure: Logic.(un)varify only works in a global context, which is now
6868 enforced instead of silently assumed. INCOMPATIBILITY, may use
6869 Logic.legacy_(un)varify as temporary workaround.
6871 * Pure: structure Name provides scalable operations for generating
6872 internal variable names, notably Name.variants etc. This replaces
6873 some popular functions from term.ML:
6875 Term.variant -> Name.variant
6876 Term.variantlist -> Name.variant_list
6877 Term.invent_names -> Name.invent_list
6879 Note that low-level renaming rarely occurs in new code -- operations
6880 from structure Variable are used instead (see below).
6882 * Pure: structure Variable provides fundamental operations for proper
6883 treatment of fixed/schematic variables in a context. For example,
6884 Variable.import introduces fixes for schematics of given facts and
6885 Variable.export reverses the effect (up to renaming) -- this replaces
6886 various freeze_thaw operations.
6888 * Pure: structure Goal provides simple interfaces for
6889 init/conclude/finish and tactical prove operations (replacing former
6890 Tactic.prove). Goal.prove is the canonical way to prove results
6891 within a given context; Goal.prove_global is a degraded version for
6892 theory level goals, including a global Drule.standard. Note that
6893 OldGoals.prove_goalw_cterm has long been obsolete, since it is
6894 ill-behaved in a local proof context (e.g. with local fixes/assumes or
6895 in a locale context).
6897 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
6898 and type checking (Syntax.check_term etc.), with common combinations
6899 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
6900 which are considered legacy and await removal.
6902 * Pure/Syntax: generic interfaces for type unchecking
6903 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
6904 with common combinations (Syntax.pretty_term, Syntax.string_of_term
6905 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
6906 available for convenience, but refer to the very same operations using
6907 a mere theory instead of a full context.
6909 * Isar: simplified treatment of user-level errors, using exception
6910 ERROR of string uniformly. Function error now merely raises ERROR,
6911 without any side effect on output channels. The Isar toplevel takes
6912 care of proper display of ERROR exceptions. ML code may use plain
6913 handle/can/try; cat_error may be used to concatenate errors like this:
6915 ... handle ERROR msg => cat_error msg "..."
6917 Toplevel ML code (run directly or through the Isar toplevel) may be
6918 embedded into the Isar toplevel with exception display/debug like
6921 Isar.toplevel (fn () => ...)
6923 INCOMPATIBILITY, removed special transform_error facilities, removed
6924 obsolete variants of user-level exceptions (ERROR_MESSAGE,
6925 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
6926 -- use plain ERROR instead.
6928 * Isar: theory setup now has type (theory -> theory), instead of a
6929 list. INCOMPATIBILITY, may use #> to compose setup functions.
6931 * Isar: ML toplevel pretty printer for type Proof.context, subject to
6932 ProofContext.debug/verbose flags.
6934 * Isar: Toplevel.theory_to_proof admits transactions that modify the
6935 theory before entering a proof state. Transactions now always see a
6936 quasi-functional intermediate checkpoint, both in interactive and
6939 * Isar: simplified interfaces for outer syntax. Renamed
6940 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
6941 OuterSyntax.add_parsers -- this functionality is now included in
6942 OuterSyntax.command etc. INCOMPATIBILITY.
6944 * Simplifier: the simpset of a running simplification process now
6945 contains a proof context (cf. Simplifier.the_context), which is the
6946 very context that the initial simpset has been retrieved from (by
6947 simpset_of/local_simpset_of). Consequently, all plug-in components
6948 (solver, looper etc.) may depend on arbitrary proof data.
6950 * Simplifier.inherit_context inherits the proof context (plus the
6951 local bounds) of the current simplification process; any simproc
6952 etc. that calls the Simplifier recursively should do this! Removed
6953 former Simplifier.inherit_bounds, which is already included here --
6954 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
6955 specify an explicit context using Simplifier.context/theory_context.
6957 * Simplifier/Classical Reasoner: more abstract interfaces
6958 change_simpset/claset for modifying the simpset/claset reference of a
6959 theory; raw versions simpset/claset_ref etc. have been discontinued --
6962 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
6968 * settings: the default heap location within ISABELLE_HOME_USER now
6969 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
6970 Isabelle installations.
6972 * isabelle-process: option -S (secure mode) disables some critical
6973 operations, notably runtime compilation and evaluation of ML source
6976 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
6978 * Support for parallel execution, using native multicore support of
6979 Poly/ML 5.1. The theory loader exploits parallelism when processing
6980 independent theories, according to the given theory header
6981 specifications. The maximum number of worker threads is specified via
6982 usedir option -M or the "max-threads" setting in Proof General. A
6983 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
6984 to 6 on a 8-core machine. User-code needs to observe certain
6985 guidelines for thread-safe programming, see appendix A in the Isar
6986 Implementation manual.
6990 New in Isabelle2005 (October 2005)
6991 ----------------------------------
6995 * Theory headers: the new header syntax for Isar theories is
6998 imports <theory1> ... <theoryN>
6999 uses <file1> ... <fileM>
7002 where the 'uses' part is optional. The previous syntax
7004 theory <name> = <theory1> + ... + <theoryN>:
7006 will disappear in the next release. Use isatool fixheaders to convert
7007 existing theory files. Note that there is no change in ancient
7008 non-Isar theories now, but these will disappear soon.
7010 * Theory loader: parent theories can now also be referred to via
7011 relative and absolute paths.
7013 * Command 'find_theorems' searches for a list of criteria instead of a
7014 list of constants. Known criteria are: intro, elim, dest, name:string,
7015 simp:term, and any term. Criteria can be preceded by '-' to select
7016 theorems that do not match. Intro, elim, dest select theorems that
7017 match the current goal, name:s selects theorems whose fully qualified
7018 name contain s, and simp:term selects all simplification rules whose
7019 lhs match term. Any other term is interpreted as pattern and selects
7020 all theorems matching the pattern. Available in ProofGeneral under
7021 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
7023 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
7025 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
7026 matching the current goal as introduction rule and not having "HOL."
7027 in their name (i.e. not being defined in theory HOL).
7029 * Command 'thms_containing' has been discontinued in favour of
7030 'find_theorems'; INCOMPATIBILITY.
7032 * Communication with Proof General is now 8bit clean, which means that
7033 Unicode text in UTF-8 encoding may be used within theory texts (both
7034 formal and informal parts). Cf. option -U of the Isabelle Proof
7035 General interface. Here are some simple examples (cf. src/HOL/ex):
7037 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
7038 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
7040 * Improved efficiency of the Simplifier and, to a lesser degree, the
7041 Classical Reasoner. Typical big applications run around 2 times
7045 *** Document preparation ***
7047 * Commands 'display_drafts' and 'print_drafts' perform simple output
7048 of raw sources. Only those symbols that do not require additional
7049 LaTeX packages (depending on comments in isabellesym.sty) are
7050 displayed properly, everything else is left verbatim. isatool display
7051 and isatool print are used as front ends (these are subject to the
7052 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
7054 * Command tags control specific markup of certain regions of text,
7055 notably folding and hiding. Predefined tags include "theory" (for
7056 theory begin and end), "proof" for proof commands, and "ML" for
7057 commands involving ML code; the additional tags "visible" and
7058 "invisible" are unused by default. Users may give explicit tag
7059 specifications in the text, e.g. ''by %invisible (auto)''. The
7060 interpretation of tags is determined by the LaTeX job during document
7061 preparation: see option -V of isatool usedir, or options -n and -t of
7062 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
7065 Several document versions may be produced at the same time via isatool
7066 usedir (the generated index.html will link all of them). Typical
7067 specifications include ''-V document=theory,proof,ML'' to present
7068 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
7069 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
7070 these parts without any formal replacement text. The Isabelle site
7071 default settings produce ''document'' and ''outline'' versions as
7074 * Several new antiquotations:
7076 @{term_type term} prints a term with its type annotated;
7078 @{typeof term} prints the type of a term;
7080 @{const const} is the same as @{term const}, but checks that the
7081 argument is a known logical constant;
7083 @{term_style style term} and @{thm_style style thm} print a term or
7084 theorem applying a "style" to it
7088 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
7089 definitions, equations, inequations etc., 'concl' printing only the
7090 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
7091 to print the specified premise. TermStyle.add_style provides an ML
7092 interface for introducing further styles. See also the "LaTeX Sugar"
7093 document practical applications. The ML antiquotation prints
7094 type-checked ML expressions verbatim.
7096 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
7097 and 'text' support optional locale specification '(in loc)', which
7098 specifies the default context for interpreting antiquotations. For
7099 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
7101 * Option 'locale=NAME' of antiquotations specifies an alternative
7102 context interpreting the subsequent argument. For example: @{thm
7103 [locale=lattice] inf_assoc}.
7105 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
7108 * Proper output of antiquotations for theory commands involving a
7109 proof context (such as 'locale' or 'theorem (in loc) ...').
7111 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
7112 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
7114 * isatool usedir: new option -C (default true) controls whether option
7115 -D should include a copy of the original document directory; -C false
7116 prevents unwanted effects such as copying of administrative CVS data.
7121 * Considerably improved version of 'constdefs' command. Now performs
7122 automatic type-inference of declared constants; additional support for
7123 local structure declarations (cf. locales and HOL records), see also
7124 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
7125 sequential dependencies of definitions within a single 'constdefs'
7126 section; moreover, the declared name needs to be an identifier. If
7127 all fails, consider to fall back on 'consts' and 'defs' separately.
7129 * Improved indexed syntax and implicit structures. First of all,
7130 indexed syntax provides a notational device for subscripted
7131 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
7132 expressions. Secondly, in a local context with structure
7133 declarations, number indexes \<^sub>n or the empty index (default
7134 number 1) refer to a certain fixed variable implicitly; option
7135 show_structs controls printing of implicit structures. Typical
7136 applications of these concepts involve record types and locales.
7138 * New command 'no_syntax' removes grammar declarations (and
7139 translations) resulting from the given syntax specification, which is
7140 interpreted in the same manner as for the 'syntax' command.
7142 * 'Advanced' translation functions (parse_translation etc.) may depend
7143 on the signature of the theory context being presently used for
7144 parsing/printing, see also isar-ref manual.
7146 * Improved 'oracle' command provides a type-safe interface to turn an
7147 ML expression of type theory -> T -> term into a primitive rule of
7148 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
7149 is already included here); see also FOL/ex/IffExample.thy;
7152 * axclass: name space prefix for class "c" is now "c_class" (was "c"
7153 before); "cI" is no longer bound, use "c.intro" instead.
7154 INCOMPATIBILITY. This change avoids clashes of fact bindings for
7155 axclasses vs. locales.
7157 * Improved internal renaming of symbolic identifiers -- attach primes
7158 instead of base 26 numbers.
7160 * New flag show_question_marks controls printing of leading question
7161 marks in schematic variable names.
7163 * In schematic variable names, *any* symbol following \<^isub> or
7164 \<^isup> is now treated as part of the base name. For example, the
7165 following works without printing of awkward ".0" indexes:
7167 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
7170 * Inner syntax includes (*(*nested*) comments*).
7172 * Pretty printer now supports unbreakable blocks, specified in mixfix
7173 annotations as "(00...)".
7175 * Clear separation of logical types and nonterminals, where the latter
7176 may only occur in 'syntax' specifications or type abbreviations.
7177 Before that distinction was only partially implemented via type class
7178 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
7179 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
7180 exotic syntax specifications may require further adaption
7181 (e.g. Cube/Cube.thy).
7183 * Removed obsolete type class "logic", use the top sort {} instead.
7184 Note that non-logical types should be declared as 'nonterminals'
7185 rather than 'types'. INCOMPATIBILITY for new object-logic
7188 * Attributes 'induct' and 'cases': type or set names may now be
7189 locally fixed variables as well.
7191 * Simplifier: can now control the depth to which conditional rewriting
7192 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
7195 * Simplifier: simplification procedures may now take the current
7196 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
7197 interface), which is very useful for calling the Simplifier
7198 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
7199 is gone -- use prems_of_ss on the simpset instead. Moreover, the
7200 low-level mk_simproc no longer applies Logic.varify internally, to
7201 allow for use in a context of fixed variables.
7203 * thin_tac now works even if the assumption being deleted contains !!
7204 or ==>. More generally, erule now works even if the major premise of
7205 the elimination rule contains !! or ==>.
7207 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
7209 * Reorganized bootstrapping of the Pure theories; CPure is now derived
7210 from Pure, which contains all common declarations already. Both
7211 theories are defined via plain Isabelle/Isar .thy files.
7212 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
7213 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
7214 use isatool fixcpure to adapt your theory and ML sources.
7216 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
7217 selections of theorems in named facts via index ranges.
7219 * 'print_theorems': in theory mode, really print the difference
7220 wrt. the last state (works for interactive theory development only),
7221 in proof mode print all local facts (cf. 'print_facts');
7223 * 'hide': option '(open)' hides only base names.
7225 * More efficient treatment of intermediate checkpoints in interactive
7228 * Code generator is now invoked via code_module (incremental code
7229 generation) and code_library (modular code generation, ML structures
7230 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
7231 must be quoted when used as identifiers.
7233 * New 'value' command for reading, evaluating and printing terms using
7234 the code generator. INCOMPATIBILITY: command keyword 'value' must be
7235 quoted when used as identifier.
7240 * New commands for the interpretation of locale expressions in
7241 theories (1), locales (2) and proof contexts (3). These generate
7242 proof obligations from the expression specification. After the
7243 obligations have been discharged, theorems of the expression are added
7244 to the theory, target locale or proof context. The synopsis of the
7245 commands is a follows:
7247 (1) interpretation expr inst
7248 (2) interpretation target < expr
7249 (3) interpret expr inst
7251 Interpretation in theories and proof contexts require a parameter
7252 instantiation of terms from the current context. This is applied to
7253 specifications and theorems of the interpreted expression.
7254 Interpretation in locales only permits parameter renaming through the
7255 locale expression. Interpretation is smart in that interpretations
7256 that are active already do not occur in proof obligations, neither are
7257 instantiated theorems stored in duplicate. Use 'print_interps' to
7258 inspect active interpretations of a particular locale. For details,
7259 see the Isar Reference manual. Examples can be found in
7260 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
7262 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
7263 'interpret' instead.
7265 * New context element 'constrains' for adding type constraints to
7268 * Context expressions: renaming of parameters with syntax
7271 * Locale declaration: 'includes' disallowed.
7273 * Proper static binding of attribute syntax -- i.e. types / terms /
7274 facts mentioned as arguments are always those of the locale definition
7275 context, independently of the context of later invocations. Moreover,
7276 locale operations (renaming and type / term instantiation) are applied
7277 to attribute arguments as expected.
7279 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
7280 actual attributes; rare situations may require Attrib.attribute to
7281 embed those attributes into Attrib.src that lack concrete syntax.
7282 Attribute implementations need to cooperate properly with the static
7283 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
7284 Attrib.XXX_thm etc. already do the right thing without further
7285 intervention. Only unusual applications -- such as "where" or "of"
7286 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
7287 on the context and the facts involved -- may have to assign parsed
7288 values to argument tokens explicitly.
7290 * Changed parameter management in theorem generation for long goal
7291 statements with 'includes'. INCOMPATIBILITY: produces a different
7292 theorem statement in rare situations.
7294 * Locale inspection command 'print_locale' omits notes elements. Use
7295 'print_locale!' to have them included in the output.
7300 * Provers/hypsubst.ML: improved version of the subst method, for
7301 single-step rewriting: it now works in bound variable contexts. New is
7302 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
7303 rewrite a different subterm than the original subst method, which is
7304 still available as 'simplesubst'.
7306 * Provers/quasi.ML: new transitivity reasoners for transitivity only
7309 * Provers/trancl.ML: new transitivity reasoner for transitive and
7310 reflexive-transitive closure of relations.
7312 * Provers/blast.ML: new reference depth_limit to make blast's depth
7313 limit (previously hard-coded with a value of 20) user-definable.
7315 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
7316 is peformed already. Object-logics merely need to finish their
7317 initial simpset configuration as before. INCOMPATIBILITY.
7322 * Symbolic syntax of Hilbert Choice Operator is now as follows:
7325 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
7327 The symbol \<some> is displayed as the alternative epsilon of LaTeX
7328 and x-symbol; use option '-m epsilon' to get it actually printed.
7329 Moreover, the mathematically important symbolic identifier \<epsilon>
7330 becomes available as variable, constant etc. INCOMPATIBILITY,
7332 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
7333 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
7334 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
7335 support corresponding Isar calculations.
7337 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
7340 * theory SetInterval: changed the syntax for open intervals:
7349 The old syntax is still supported but will disappear in the next
7350 release. For conversion use the following Emacs search and replace
7351 patterns (these are not perfect but work quite well):
7353 {)\([^\.]*\)\.\. -> {\1<\.\.}
7354 \.\.\([^(}]*\)(} -> \.\.<\1}
7356 * Theory Commutative_Ring (in Library): method comm_ring for proving
7357 equalities in commutative rings; method 'algebra' provides a generic
7360 * Theory Finite_Set: changed the syntax for 'setsum', summation over
7361 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
7362 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
7365 Some new syntax forms are available:
7367 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
7368 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
7369 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
7370 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
7372 The latter form "\<Sum>x < k. e" used to be based on a separate
7373 function "Summation", which has been discontinued.
7375 * theory Finite_Set: in structured induction proofs, the insert case
7376 is now 'case (insert x F)' instead of the old counterintuitive 'case
7379 * The 'refute' command has been extended to support a much larger
7380 fragment of HOL, including axiomatic type classes, constdefs and
7381 typedefs, inductive datatypes and recursion.
7383 * New tactics 'sat' and 'satx' to prove propositional tautologies.
7384 Requires zChaff with proof generation to be installed. See
7385 HOL/ex/SAT_Examples.thy for examples.
7387 * Datatype induction via method 'induct' now preserves the name of the
7388 induction variable. For example, when proving P(xs::'a list) by
7389 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
7390 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
7391 in unstructured proof scripts.
7393 * Reworked implementation of records. Improved scalability for
7394 records with many fields, avoiding performance problems for type
7395 inference. Records are no longer composed of nested field types, but
7396 of nested extension types. Therefore the record type only grows linear
7397 in the number of extensions and not in the number of fields. The
7398 top-level (users) view on records is preserved. Potential
7399 INCOMPATIBILITY only in strange cases, where the theory depends on the
7400 old record representation. The type generated for a record is called
7401 <record_name>_ext_type.
7403 Flag record_quick_and_dirty_sensitive can be enabled to skip the
7404 proofs triggered by a record definition or a simproc (if
7405 quick_and_dirty is enabled). Definitions of large records can take
7408 New simproc record_upd_simproc for simplification of multiple record
7409 updates enabled by default. Moreover, trivial updates are also
7410 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
7411 occasionally, since simplification is more powerful by default.
7413 * typedef: proper support for polymorphic sets, which contain extra
7414 type-variables in the term.
7416 * Simplifier: automatically reasons about transitivity chains
7417 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
7418 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
7419 old proofs break occasionally as simplification may now solve more
7420 goals than previously.
7422 * Simplifier: converts x <= y into x = y if assumption y <= x is
7423 present. Works for all partial orders (class "order"), in particular
7424 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
7427 * Simplifier: new simproc for "let x = a in f x". If a is a free or
7428 bound variable or a constant then the let is unfolded. Otherwise
7429 first a is simplified to b, and then f b is simplified to g. If
7430 possible we abstract b from g arriving at "let x = b in h x",
7431 otherwise we unfold the let and arrive at g. The simproc can be
7432 enabled/disabled by the reference use_let_simproc. Potential
7433 INCOMPATIBILITY since simplification is more powerful by default.
7435 * Classical reasoning: the meson method now accepts theorems as arguments.
7437 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
7438 jobs to provide advice on the provability of subgoals.
7440 * Theory OrderedGroup and Ring_and_Field: various additions and
7441 improvements to faciliate calculations involving equalities and
7444 The following theorems have been eliminated or modified
7447 abs_eq now named abs_of_nonneg
7448 abs_of_ge_0 now named abs_of_nonneg
7449 abs_minus_eq now named abs_of_nonpos
7450 imp_abs_id now named abs_of_nonneg
7451 imp_abs_neg_id now named abs_of_nonpos
7452 mult_pos now named mult_pos_pos
7453 mult_pos_le now named mult_nonneg_nonneg
7454 mult_pos_neg_le now named mult_nonneg_nonpos
7455 mult_pos_neg2_le now named mult_nonneg_nonpos2
7456 mult_neg now named mult_neg_neg
7457 mult_neg_le now named mult_nonpos_nonpos
7459 * The following lemmas in Ring_and_Field have been added to the simplifier:
7462 not_square_less_zero
7464 The following lemmas have been deleted from Real/RealPow:
7474 * Theory Parity: added rules for simplifying exponents.
7478 The following theorems have been eliminated or modified
7481 list_all_Nil now named list_all.simps(1)
7482 list_all_Cons now named list_all.simps(2)
7483 list_all_conv now named list_all_iff
7484 set_mem_eq now named mem_iff
7486 * Theories SetsAndFunctions and BigO (see HOL/Library) support
7487 asymptotic "big O" calculations. See the notes in BigO.thy.
7492 * Theory RealDef: better support for embedding natural numbers and
7493 integers in the reals.
7495 The following theorems have been eliminated or modified
7498 exp_ge_add_one_self now requires no hypotheses
7499 real_of_int_add reversed direction of equality (use [symmetric])
7500 real_of_int_minus reversed direction of equality (use [symmetric])
7501 real_of_int_diff reversed direction of equality (use [symmetric])
7502 real_of_int_mult reversed direction of equality (use [symmetric])
7504 * Theory RComplete: expanded support for floor and ceiling functions.
7506 * Theory Ln is new, with properties of the natural logarithm
7508 * Hyperreal: There is a new type constructor "star" for making
7509 nonstandard types. The old type names are now type synonyms:
7513 hcomplex = complex star
7515 * Hyperreal: Many groups of similarly-defined constants have been
7516 replaced by polymorphic versions (INCOMPATIBILITY):
7518 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
7520 starset <-- starsetNat, starsetC
7521 *s* <-- *sNat*, *sc*
7522 starset_n <-- starsetNat_n, starsetC_n
7523 *sn* <-- *sNatn*, *scn*
7524 InternalSets <-- InternalNatSets, InternalCSets
7526 starfun <-- starfun{Nat,Nat2,C,RC,CR}
7527 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
7528 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
7529 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
7530 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
7532 * Hyperreal: Many type-specific theorems have been removed in favor of
7533 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
7535 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
7536 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
7537 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
7538 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
7539 right_minus <-- hypreal_add_minus
7540 left_minus <-- {hypreal,hcomplex}_add_minus_left
7541 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
7542 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
7543 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
7544 mult_1_right <-- hcomplex_mult_one_right
7545 mult_zero_left <-- hcomplex_mult_zero_left
7546 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
7547 right_distrib <-- hypnat_add_mult_distrib2
7548 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
7549 right_inverse <-- hypreal_mult_inverse
7550 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
7551 order_refl <-- {hypreal,hypnat}_le_refl
7552 order_trans <-- {hypreal,hypnat}_le_trans
7553 order_antisym <-- {hypreal,hypnat}_le_anti_sym
7554 order_less_le <-- {hypreal,hypnat}_less_le
7555 linorder_linear <-- {hypreal,hypnat}_le_linear
7556 add_left_mono <-- {hypreal,hypnat}_add_left_mono
7557 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
7558 add_nonneg_nonneg <-- hypreal_le_add_order
7560 * Hyperreal: Separate theorems having to do with type-specific
7561 versions of constants have been merged into theorems that apply to the
7562 new polymorphic constants (INCOMPATIBILITY):
7564 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
7565 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
7566 STAR_Un <-- {STAR,NatStar,STARC}_Un
7567 STAR_Int <-- {STAR,NatStar,STARC}_Int
7568 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
7569 STAR_subset <-- {STAR,NatStar,STARC}_subset
7570 STAR_mem <-- {STAR,NatStar,STARC}_mem
7571 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
7572 STAR_diff <-- {STAR,STARC}_diff
7573 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
7574 STARC_hcomplex_of_complex}_image_subset
7575 starset_n_Un <-- starset{Nat,C}_n_Un
7576 starset_n_Int <-- starset{Nat,C}_n_Int
7577 starset_n_Compl <-- starset{Nat,C}_n_Compl
7578 starset_n_diff <-- starset{Nat,C}_n_diff
7579 InternalSets_Un <-- Internal{Nat,C}Sets_Un
7580 InternalSets_Int <-- Internal{Nat,C}Sets_Int
7581 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
7582 InternalSets_diff <-- Internal{Nat,C}Sets_diff
7583 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
7584 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
7585 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
7586 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
7587 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
7588 starfun <-- starfun{Nat,Nat2,C,RC,CR}
7589 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
7590 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
7591 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
7592 starfun_diff <-- starfun{C,RC,CR}_diff
7593 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
7594 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
7595 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
7596 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
7597 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
7598 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
7599 starfun_Id <-- starfunC_Id
7600 starfun_approx <-- starfun{Nat,CR}_approx
7601 starfun_capprox <-- starfun{C,RC}_capprox
7602 starfun_abs <-- starfunNat_rabs
7603 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
7604 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
7605 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
7606 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
7607 starfun_add_capprox <-- starfun{C,RC}_add_capprox
7608 starfun_add_approx <-- starfunCR_add_approx
7609 starfun_inverse_inverse <-- starfunC_inverse_inverse
7610 starfun_divide <-- starfun{C,CR,RC}_divide
7611 starfun_n <-- starfun{Nat,C}_n
7612 starfun_n_mult <-- starfun{Nat,C}_n_mult
7613 starfun_n_add <-- starfun{Nat,C}_n_add
7614 starfun_n_add_minus <-- starfunNat_n_add_minus
7615 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
7616 starfun_n_minus <-- starfun{Nat,C}_n_minus
7617 starfun_n_eq <-- starfun{Nat,C}_n_eq
7619 star_n_add <-- {hypreal,hypnat,hcomplex}_add
7620 star_n_minus <-- {hypreal,hcomplex}_minus
7621 star_n_diff <-- {hypreal,hcomplex}_diff
7622 star_n_mult <-- {hypreal,hcomplex}_mult
7623 star_n_inverse <-- {hypreal,hcomplex}_inverse
7624 star_n_le <-- {hypreal,hypnat}_le
7625 star_n_less <-- {hypreal,hypnat}_less
7626 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
7627 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
7628 star_n_abs <-- hypreal_hrabs
7629 star_n_divide <-- hcomplex_divide
7631 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
7632 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
7633 star_of_diff <-- hypreal_of_real_diff
7634 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
7635 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
7636 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
7637 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
7638 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
7639 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
7640 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
7641 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
7642 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
7643 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
7644 star_of_number_of <-- {hypreal,hcomplex}_number_of
7645 star_of_number_less <-- number_of_less_hypreal_of_real_iff
7646 star_of_number_le <-- number_of_le_hypreal_of_real_iff
7647 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
7648 star_of_less_number <-- hypreal_of_real_less_number_of_iff
7649 star_of_le_number <-- hypreal_of_real_le_number_of_iff
7650 star_of_power <-- hypreal_of_real_power
7651 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
7653 * Hyperreal: new method "transfer" that implements the transfer
7654 principle of nonstandard analysis. With a subgoal that mentions
7655 nonstandard types like "'a star", the command "apply transfer"
7656 replaces it with an equivalent one that mentions only standard types.
7657 To be successful, all free variables must have standard types; non-
7658 standard variables must have explicit universal quantifiers.
7660 * Hyperreal: A theory of Taylor series.
7665 * Discontinued special version of 'constdefs' (which used to support
7666 continuous functions) in favor of the general Pure one with full
7669 * New simplification procedure for solving continuity conditions; it
7670 is much faster on terms with many nested lambda abstractions (cubic
7671 instead of exponential time).
7673 * New syntax for domain package: selector names are now optional.
7674 Parentheses should be omitted unless argument is lazy, for example:
7676 domain 'a stream = cons "'a" (lazy "'a stream")
7678 * New command 'fixrec' for defining recursive functions with pattern
7679 matching; defining multiple functions with mutual recursion is also
7680 supported. Patterns may include the constants cpair, spair, up, sinl,
7681 sinr, or any data constructor defined by the domain package. The given
7682 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
7683 syntax and examples.
7685 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
7686 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
7687 but the proof obligation additionally includes an admissibility
7688 requirement. The packages generate instances of class cpo or pcpo,
7689 with continuity and strictness theorems for Rep and Abs.
7691 * HOLCF: Many theorems have been renamed according to a more standard naming
7692 scheme (INCOMPATIBILITY):
7694 foo_inject: "foo$x = foo$y ==> x = y"
7695 foo_eq: "(foo$x = foo$y) = (x = y)"
7696 foo_less: "(foo$x << foo$y) = (x << y)"
7697 foo_strict: "foo$UU = UU"
7698 foo_defined: "... ==> foo$x ~= UU"
7699 foo_defined_iff: "(foo$x = UU) = (x = UU)"
7704 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
7705 including the First Isomorphism Theorem (on quotienting by the kernel
7708 * ZF/Simplifier: install second copy of type solver that actually
7709 makes use of TC rules declared to Isar proof contexts (or locales);
7710 the old version is still required for ML proof scripts.
7715 * Converted to Isar theory format; use locales instead of axiomatic
7721 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
7724 * Pure/library.ML no longer defines its own option datatype, but uses
7725 that of the SML basis, which has constructors NONE and SOME instead of
7726 None and Some, as well as exception Option.Option instead of OPTION.
7727 The functions the, if_none, is_some, is_none have been adapted
7728 accordingly, while Option.map replaces apsome.
7730 * Pure/library.ML: the exception LIST has been given up in favour of
7731 the standard exceptions Empty and Subscript, as well as
7732 Library.UnequalLengths. Function like Library.hd and Library.tl are
7733 superceded by the standard hd and tl functions etc.
7735 A number of basic list functions are no longer exported to the ML
7736 toplevel, as they are variants of predefined functions. The following
7737 suggests how one can translate existing code:
7739 rev_append xs ys = List.revAppend (xs, ys)
7740 nth_elem (i, xs) = List.nth (xs, i)
7741 last_elem xs = List.last xs
7742 flat xss = List.concat xss
7743 seq fs = List.app fs
7744 partition P xs = List.partition P xs
7745 mapfilter f xs = List.mapPartial f xs
7747 * Pure/library.ML: several combinators for linear functional
7748 transformations, notably reverse application and composition:
7751 (x, y) |-> f f #-> g
7753 * Pure/library.ML: introduced/changed precedence of infix operators:
7755 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
7757 infix 3 o oo ooo oooo;
7758 infix 4 ~~ upto downto;
7760 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
7763 * Pure/library.ML: natural list combinators fold, fold_rev, and
7764 fold_map support linear functional transformations and nesting. For
7767 fold f [x1, ..., xN] y =
7768 y |> f x1 |> ... |> f xN
7770 (fold o fold) f [xs1, ..., xsN] y =
7771 y |> fold f xs1 |> ... |> fold f xsN
7773 fold f [x1, ..., xN] =
7776 (fold o fold) f [xs1, ..., xsN] =
7777 fold f xs1 #> ... #> fold f xsN
7779 * Pure/library.ML: the following selectors on type 'a option are
7782 the: 'a option -> 'a (*partial*)
7783 these: 'a option -> 'a where 'a = 'b list
7784 the_default: 'a -> 'a option -> 'a
7785 the_list: 'a option -> 'a list
7787 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
7788 basic operations for association lists, following natural argument
7789 order; moreover the explicit equality predicate passed here avoids
7790 potentially expensive polymorphic runtime equality checks.
7791 The old functions may be expressed as follows:
7793 assoc = uncurry (AList.lookup (op =))
7794 assocs = these oo AList.lookup (op =)
7795 overwrite = uncurry (AList.update (op =)) o swap
7797 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
7799 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
7800 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
7802 replacing make_keylist and keyfilter (occassionally used)
7805 make_keylist = AList.make
7806 keyfilter = AList.find (op =)
7808 * eq_fst and eq_snd now take explicit equality parameter, thus
7809 avoiding eqtypes. Naive rewrites:
7811 eq_fst = eq_fst (op =)
7812 eq_snd = eq_snd (op =)
7814 * Removed deprecated apl and apr (rarely used).
7817 apl (n, op) =>>= curry op n
7818 apr (op, m) =>>= fn n => op (n, m)
7820 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
7821 provides a reasonably efficient light-weight implementation of sets as
7824 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
7825 few new operations; existing lookup and update are now curried to
7826 follow natural argument order (for use with fold etc.);
7827 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
7829 * Pure/General: output via the Isabelle channels of
7830 writeln/warning/error etc. is now passed through Output.output, with a
7831 hook for arbitrary transformations depending on the print_mode
7832 (cf. Output.add_mode -- the first active mode that provides a output
7833 function wins). Already formatted output may be embedded into further
7834 text via Output.raw; the result of Pretty.string_of/str_of and derived
7835 functions (string_of_term/cterm/thm etc.) is already marked raw to
7836 accommodate easy composition of diagnostic messages etc. Programmers
7837 rarely need to care about Output.output or Output.raw at all, with
7838 some notable exceptions: Output.output is required when bypassing the
7839 standard channels (writeln etc.), or in token translations to produce
7840 properly formatted results; Output.raw is required when capturing
7841 already output material that will eventually be presented to the user
7842 a second time. For the default print mode, both Output.output and
7843 Output.raw have no effect.
7845 * Pure/General: Output.time_accumulator NAME creates an operator ('a
7846 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
7847 cumulative results are displayed at the end of a batch session.
7849 * Pure/General: File.sysify_path and File.quote_sysify path have been
7850 replaced by File.platform_path and File.shell_path (with appropriate
7851 hooks). This provides a clean interface for unusual systems where the
7852 internal and external process view of file names are different.
7854 * Pure: more efficient orders for basic syntactic entities: added
7855 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
7856 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
7857 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
7858 orders now -- potential INCOMPATIBILITY for code that depends on a
7859 particular order for Symtab.keys, Symtab.dest, etc. (consider using
7860 Library.sort_strings on result).
7862 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
7863 fold_types traverse types/terms from left to right, observing natural
7864 argument order. Supercedes previous foldl_XXX versions, add_frees,
7865 add_vars etc. have been adapted as well: INCOMPATIBILITY.
7867 * Pure: name spaces have been refined, with significant changes of the
7868 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
7869 to extern(_table). The plain name entry path is superceded by a
7870 general 'naming' context, which also includes the 'policy' to produce
7871 a fully qualified name and external accesses of a fully qualified
7872 name; NameSpace.extend is superceded by context dependent
7873 Sign.declare_name. Several theory and proof context operations modify
7874 the naming context. Especially note Theory.restore_naming and
7875 ProofContext.restore_naming to get back to a sane state; note that
7876 Theory.add_path is no longer sufficient to recover from
7877 Theory.absolute_path in particular.
7879 * Pure: new flags short_names (default false) and unique_names
7880 (default true) for controlling output of qualified names. If
7881 short_names is set, names are printed unqualified. If unique_names is
7882 reset, the name prefix is reduced to the minimum required to achieve
7883 the original result when interning again, even if there is an overlap
7884 with earlier declarations.
7886 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
7887 now 'extend', and 'merge' gets an additional Pretty.pp argument
7888 (useful for printing error messages). INCOMPATIBILITY.
7890 * Pure: major reorganization of the theory context. Type Sign.sg and
7891 Theory.theory are now identified, referring to the universal
7892 Context.theory (see Pure/context.ML). Actual signature and theory
7893 content is managed as theory data. The old code and interfaces were
7894 spread over many files and structures; the new arrangement introduces
7895 considerable INCOMPATIBILITY to gain more clarity:
7897 Context -- theory management operations (name, identity, inclusion,
7898 parents, ancestors, merge, etc.), plus generic theory data;
7900 Sign -- logical signature and syntax operations (declaring consts,
7901 types, etc.), plus certify/read for common entities;
7903 Theory -- logical theory operations (stating axioms, definitions,
7904 oracles), plus a copy of logical signature operations (consts,
7905 types, etc.); also a few basic management operations (Theory.copy,
7908 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
7909 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
7910 for convenience -- they merely return the theory.
7912 * Pure: type Type.tsig is superceded by theory in most interfaces.
7914 * Pure: the Isar proof context type is already defined early in Pure
7915 as Context.proof (note that ProofContext.context and Proof.context are
7916 aliases, where the latter is the preferred name). This enables other
7917 Isabelle components to refer to that type even before Isar is present.
7919 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
7920 typeK, constK, axiomK, oracleK), but provide explicit operations for
7921 any of these kinds. For example, Sign.intern typeK is now
7922 Sign.intern_type, Theory.hide_space Sign.typeK is now
7923 Theory.hide_types. Also note that former
7924 Theory.hide_classes/types/consts are now
7925 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
7926 internalize their arguments! INCOMPATIBILITY.
7928 * Pure: get_thm interface (of PureThy and ProofContext) expects
7929 datatype thmref (with constructors Name and NameSelection) instead of
7930 plain string -- INCOMPATIBILITY;
7932 * Pure: cases produced by proof methods specify options, where NONE
7933 means to remove case bindings -- INCOMPATIBILITY in
7936 * Pure: the following operations retrieve axioms or theorems from a
7937 theory node or theory hierarchy, respectively:
7939 Theory.axioms_of: theory -> (string * term) list
7940 Theory.all_axioms_of: theory -> (string * term) list
7941 PureThy.thms_of: theory -> (string * thm) list
7942 PureThy.all_thms_of: theory -> (string * thm) list
7944 * Pure: print_tac now outputs the goal through the trace channel.
7946 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
7947 Reference Toplevel.debug (default false) controls detailed printing
7948 and tracing of low-level exceptions; Toplevel.profiling (default 0)
7949 controls execution profiling -- set to 1 for time and 2 for space
7950 (both increase the runtime).
7952 * Isar session: The initial use of ROOT.ML is now always timed,
7953 i.e. the log will show the actual process times, in contrast to the
7954 elapsed wall-clock time that the outer shell wrapper produces.
7956 * Simplifier: improved handling of bound variables (nameless
7957 representation, avoid allocating new strings). Simprocs that invoke
7958 the Simplifier recursively should use Simplifier.inherit_bounds to
7959 avoid local name clashes. Failure to do so produces warnings
7960 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
7961 for further details.
7963 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
7964 bindings for all theorems stored within a given theory; this may help
7965 in porting non-Isar theories to Isar ones, while keeping ML proof
7966 scripts for the time being.
7968 * ML operator HTML.with_charset specifies the charset begin used for
7969 generated HTML files. For example:
7971 HTML.with_charset "utf-8" use_thy "Hebrew";
7972 HTML.with_charset "utf-8" use_thy "Chinese";
7977 * Allow symlinks to all proper Isabelle executables (Isabelle,
7978 isabelle, isatool etc.).
7980 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
7981 isatool doc, isatool mkdir, display_drafts etc.).
7983 * isatool usedir: option -f allows specification of the ML file to be
7984 used by Isabelle; default is ROOT.ML.
7986 * New isatool version outputs the version identifier of the Isabelle
7987 distribution being used.
7989 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
7990 (containing Boolean satisfiability problems) into Isabelle/HOL
7995 New in Isabelle2004 (April 2004)
7996 --------------------------------
8000 * Provers/order.ML: new efficient reasoner for partial and linear orders.
8001 Replaces linorder.ML.
8003 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
8004 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
8005 (\<a>...\<z>), are now considered normal letters, and can therefore
8006 be used anywhere where an ASCII letter (a...zA...Z) has until
8007 now. COMPATIBILITY: This obviously changes the parsing of some
8008 terms, especially where a symbol has been used as a binder, say
8009 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
8010 as an identifier. Fix it by inserting a space around former
8011 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
8012 existing theory and ML files.
8014 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
8016 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
8017 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
8018 a normal (but invisible) letter. For multiple letter subscripts repeat
8019 \<^isub> like this: x\<^isub>1\<^isub>2.
8021 * Pure: There are now sub-/superscripts that can span more than one
8022 character. Text between \<^bsub> and \<^esub> is set in subscript in
8023 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
8024 superscript. The new control characters are not identifier parts.
8026 * Pure: Control-symbols of the form \<^raw:...> will literally print the
8027 content of "..." to the latex file instead of \isacntrl... . The "..."
8028 may consist of any printable characters excluding the end bracket >.
8030 * Pure: Using new Isar command "finalconsts" (or the ML functions
8031 Theory.add_finals or Theory.add_finals_i) it is now possible to
8032 declare constants "final", which prevents their being given a definition
8033 later. It is useful for constants whose behaviour is fixed axiomatically
8034 rather than definitionally, such as the meta-logic connectives.
8036 * Pure: 'instance' now handles general arities with general sorts
8037 (i.e. intersections of classes),
8039 * Presentation: generated HTML now uses a CSS style sheet to make layout
8040 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
8041 It can be changed to alter the colors/layout of generated pages.
8046 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
8047 cut_tac, subgoal_tac and thin_tac:
8048 - Now understand static (Isar) contexts. As a consequence, users of Isar
8049 locales are no longer forced to write Isar proof scripts.
8050 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
8052 - INCOMPATIBILITY: names of variables to be instantiated may no
8053 longer be enclosed in quotes. Instead, precede variable name with `?'.
8054 This is consistent with the instantiation attribute "where".
8056 * Attributes "where" and "of":
8057 - Now take type variables of instantiated theorem into account when reading
8058 the instantiation string. This fixes a bug that caused instantiated
8059 theorems to have too special types in some circumstances.
8060 - "where" permits explicit instantiations of type variables.
8062 * Calculation commands "moreover" and "also" no longer interfere with
8063 current facts ("this"), admitting arbitrary combinations with "then"
8067 - Goal statements involving the context element "includes" no longer
8068 generate theorems with internal delta predicates (those ending on
8069 "_axioms") in the premise.
8070 Resolve particular premise with <locale>.intro to obtain old form.
8071 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
8072 specification and "includes" elements in goal statement.
8073 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
8074 [intro?] and [elim?] (respectively) by default.
8075 - Experimental command for instantiation of locales in proof contexts:
8076 instantiate <label>[<attrs>]: <loc>
8077 Instantiates locale <loc> and adds all its theorems to the current context
8078 taking into account their attributes. Label and attrs are optional
8079 modifiers, like in theorem declarations. If present, names of
8080 instantiated theorems are qualified with <label>, and the attributes
8081 <attrs> are applied after any attributes these theorems might have already.
8082 If the locale has assumptions, a chained fact of the form
8083 "<loc> t1 ... tn" is expected from which instantiations of the parameters
8084 are derived. The command does not support old-style locales declared
8085 with "locale (open)".
8086 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
8088 * HOL: Tactic emulation methods induct_tac and case_tac understand static
8094 * Proof import: new image HOL4 contains the imported library from
8095 the HOL4 system with about 2500 theorems. It is imported by
8096 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
8097 can be used like any other Isabelle image. See
8098 HOL/Import/HOL/README for more information.
8101 - Much improved handling of linear and partial orders.
8102 Reasoners for linear and partial orders are set up for type classes
8103 "linorder" and "order" respectively, and are added to the default simpset
8104 as solvers. This means that the simplifier can build transitivity chains
8105 to solve goals from the assumptions.
8106 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
8107 of blast or auto after simplification become unnecessary because the goal
8108 is solved by simplification already.
8110 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
8111 all proved in axiomatic type classes for semirings, rings and fields.
8114 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
8115 now formalized using the Ring_and_Field theory mentioned above.
8116 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
8117 than before, because now they are set up once in a generic manner.
8118 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
8119 Look for the general versions in Ring_and_Field (and Power if they concern
8122 * Type "rat" of the rational numbers is now available in HOL-Complex.
8125 - Record types are now by default printed with their type abbreviation
8126 instead of the list of all field types. This can be configured via
8127 the reference "print_record_type_abbr".
8128 - Simproc "record_upd_simproc" for simplification of multiple updates added
8129 (not enabled by default).
8130 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
8131 EX x. x = sel r to True (not enabled by default).
8132 - Tactic "record_split_simp_tac" to split and simplify records added.
8134 * 'specification' command added, allowing for definition by
8135 specification. There is also an 'ax_specification' command that
8136 introduces the new constants axiomatically.
8138 * arith(_tac) is now able to generate counterexamples for reals as well.
8140 * HOL-Algebra: new locale "ring" for non-commutative rings.
8142 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
8143 definitions, thanks to Sava Krsti\'{c} and John Matthews.
8145 * HOL-Matrix: a first theory for matrices in HOL with an application of
8146 matrix theory to linear programming.
8148 * Unions and Intersections:
8149 The latex output syntax of UN and INT has been changed
8150 from "\Union x \in A. B" to "\Union_{x \in A} B"
8151 i.e. the index formulae has become a subscript.
8152 Similarly for "\Union x. B", and for \Inter instead of \Union.
8154 * Unions and Intersections over Intervals:
8155 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
8156 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
8157 like in normal math, and corresponding versions for < and for intersection.
8159 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
8160 lexicographic dictonary ordering has been added as "lexord".
8162 * ML: the legacy theory structures Int and List have been removed. They had
8163 conflicted with ML Basis Library structures having the same names.
8165 * 'refute' command added to search for (finite) countermodels. Only works
8166 for a fragment of HOL. The installation of an external SAT solver is
8167 highly recommended. See "HOL/Refute.thy" for details.
8169 * 'quickcheck' command: Allows to find counterexamples by evaluating
8170 formulae under an assignment of free variables to random values.
8171 In contrast to 'refute', it can deal with inductive datatypes,
8172 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
8178 * Streams now come with concatenation and are part of the HOLCF image
8182 New in Isabelle2003 (May 2003)
8183 ------------------------------
8187 * Provers/simplifier:
8189 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
8190 Assumptions are now subject to complete mutual simplification,
8191 not just from left to right. The simplifier now preserves
8192 the order of assumptions.
8194 Potential INCOMPATIBILITY:
8196 -- simp sometimes diverges where the old version did
8197 not, e.g. invoking simp on the goal
8199 [| P (f x); y = x; f x = f y |] ==> Q
8201 now gives rise to the infinite reduction sequence
8203 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
8205 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
8208 -- Tactics combining classical reasoner and simplification (such as auto)
8209 are also affected by this change, because many of them rely on
8210 simp. They may sometimes diverge as well or yield a different numbers
8211 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
8212 in case of problems. Sometimes subsequent calls to the classical
8213 reasoner will fail because a preceeding call to the simplifier too
8214 eagerly simplified the goal, e.g. deleted redundant premises.
8216 - The simplifier trace now shows the names of the applied rewrite rules
8218 - You can limit the number of recursive invocations of the simplifier
8219 during conditional rewriting (where the simplifie tries to solve the
8220 conditions before applying the rewrite rule):
8221 ML "simp_depth_limit := n"
8222 where n is an integer. Thus you can force termination where previously
8223 the simplifier would diverge.
8225 - Accepts free variables as head terms in congruence rules. Useful in Isar.
8227 - No longer aborts on failed congruence proof. Instead, the
8228 congruence is ignored.
8230 * Pure: New generic framework for extracting programs from constructive
8231 proofs. See HOL/Extraction.thy for an example instantiation, as well
8232 as HOL/Extraction for some case studies.
8234 * Pure: The main goal of the proof state is no longer shown by default, only
8235 the subgoals. This behaviour is controlled by a new flag.
8236 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
8237 (ML: Proof.show_main_goal).
8239 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
8240 rules whose conclusion matches subgoal 1:
8241 PG menu: Isabelle/Isar -> Show me -> matching rules
8242 The rules are ordered by how closely they match the subgoal.
8243 In particular, rules that solve a subgoal outright are displayed first
8244 (or rather last, the way they are printed).
8245 (ML: ProofGeneral.print_intros())
8247 * Pure: New flag trace_unify_fail causes unification to print
8248 diagnostic information (PG: in trace buffer) when it fails. This is
8249 useful for figuring out why single step proofs like rule, erule or
8252 * Pure: Locale specifications now produce predicate definitions
8253 according to the body of text (covering assumptions modulo local
8254 definitions); predicate "loc_axioms" covers newly introduced text,
8255 while "loc" is cumulative wrt. all included locale expressions; the
8256 latter view is presented only on export into the global theory
8257 context; potential INCOMPATIBILITY, use "(open)" option to fall back
8258 on the old view without predicates;
8260 * Pure: predefined locales "var" and "struct" are useful for sharing
8261 parameters (as in CASL, for example); just specify something like
8262 ``var x + var y + struct M'' as import;
8264 * Pure: improved thms_containing: proper indexing of facts instead of
8265 raw theorems; check validity of results wrt. current name space;
8266 include local facts of proof configuration (also covers active
8267 locales), cover fixed variables in index; may use "_" in term
8268 specification; an optional limit for the number of printed facts may
8269 be given (the default is 40);
8271 * Pure: disallow duplicate fact bindings within new-style theory files
8274 * Provers: improved induct method: assumptions introduced by case
8275 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
8276 the goal statement); "foo" still refers to all facts collectively;
8278 * Provers: the function blast.overloaded has been removed: all constants
8279 are regarded as potentially overloaded, which improves robustness in exchange
8280 for slight decrease in efficiency;
8282 * Provers/linorder: New generic prover for transitivity reasoning over
8283 linear orders. Note: this prover is not efficient!
8285 * Isar: preview of problems to finish 'show' now produce an error
8286 rather than just a warning (in interactive mode);
8293 - Produces a counter example if it cannot prove a goal.
8294 Note that the counter example may be spurious if the goal is not a formula
8295 of quantifier-free linear arithmetic.
8296 In ProofGeneral the counter example appears in the trace buffer.
8298 - Knows about div k and mod k where k is a numeral of type nat or int.
8300 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
8301 linear arithmetic fails. This takes account of quantifiers and divisibility.
8302 Presburger arithmetic can also be called explicitly via presburger(_tac).
8304 * simp's arithmetic capabilities have been enhanced a bit: it now
8305 takes ~= in premises into account (by performing a case split);
8307 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
8308 are distributed over a sum of terms;
8310 * New tactic "trans_tac" and method "trans" instantiate
8311 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
8314 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
8315 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
8317 * 'typedef' command has new option "open" to suppress the set
8320 * functions Min and Max on finite sets have been introduced (theory
8323 * attribute [symmetric] now works for relations as well; it turns
8324 (x,y) : R^-1 into (y,x) : R, and vice versa;
8326 * induct over a !!-quantified statement (say !!x1..xn):
8327 each "case" automatically performs "fix x1 .. xn" with exactly those names.
8329 * Map: `empty' is no longer a constant but a syntactic abbreviation for
8330 %x. None. Warning: empty_def now refers to the previously hidden definition
8333 * Algebra: formalization of classical algebra. Intended as base for
8334 any algebraic development in Isabelle. Currently covers group theory
8335 (up to Sylow's theorem) and ring theory (Universal Property of
8336 Univariate Polynomials). Contributions welcome;
8338 * GroupTheory: deleted, since its material has been moved to Algebra;
8340 * Complex: new directory of the complex numbers with numeric constants,
8341 nonstandard complex numbers, and some complex analysis, standard and
8342 nonstandard (Jacques Fleuriot);
8344 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
8346 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
8349 * Real/HahnBanach: updated and adapted to locales;
8351 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
8354 * UNITY: added the Meier-Sanders theory of progress sets;
8356 * MicroJava: bytecode verifier and lightweight bytecode verifier
8357 as abstract algorithms, instantiated to the JVM;
8359 * Bali: Java source language formalization. Type system, operational
8360 semantics, axiomatic semantics. Supported language features:
8361 classes, interfaces, objects,virtual methods, static methods,
8362 static/instance fields, arrays, access modifiers, definite
8363 assignment, exceptions.
8368 * ZF/Constructible: consistency proof for AC (Gdel's constructible
8371 * Main ZF: virtually all theories converted to new-style format;
8376 * Pure: Tactic.prove provides sane interface for internal proofs;
8377 omits the infamous "standard" operation, so this is more appropriate
8378 than prove_goalw_cterm in many situations (e.g. in simprocs);
8380 * Pure: improved error reporting of simprocs;
8382 * Provers: Simplifier.simproc(_i) provides sane interface for setting
8386 *** Document preparation ***
8388 * uses \par instead of \\ for line breaks in theory text. This may
8389 shift some page breaks in large documents. To get the old behaviour
8390 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
8392 * minimized dependencies of isabelle.sty and isabellesym.sty on
8395 * \<euro> now needs package babel/greek instead of marvosym (which
8398 * normal size for \<zero>...\<nine> (uses \mathbf instead of
8403 New in Isabelle2002 (March 2002)
8404 --------------------------------
8406 *** Document preparation ***
8408 * greatly simplified document preparation setup, including more
8409 graceful interpretation of isatool usedir -i/-d/-D options, and more
8410 instructive isatool mkdir; users should basically be able to get
8411 started with "isatool mkdir HOL Test && isatool make"; alternatively,
8412 users may run a separate document processing stage manually like this:
8413 "isatool usedir -D output HOL Test && isatool document Test/output";
8415 * theory dependency graph may now be incorporated into documents;
8416 isatool usedir -g true will produce session_graph.eps/.pdf for use
8417 with \includegraphics of LaTeX;
8419 * proper spacing of consecutive markup elements, especially text
8420 blocks after section headings;
8422 * support bold style (for single symbols only), input syntax is like
8423 this: "\<^bold>\<alpha>" or "\<^bold>A";
8425 * \<bullet> is now output as bold \cdot by default, which looks much
8426 better in printed text;
8428 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
8429 note that these symbols are currently unavailable in Proof General /
8430 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
8432 * isatool latex no longer depends on changed TEXINPUTS, instead
8433 isatool document copies the Isabelle style files to the target
8439 * Pure/Provers: improved proof by cases and induction;
8440 - 'case' command admits impromptu naming of parameters (such as
8442 - 'induct' method divinates rule instantiation from the inductive
8443 claim; no longer requires excessive ?P bindings for proper
8444 instantiation of cases;
8445 - 'induct' method properly enumerates all possibilities of set/type
8446 rules; as a consequence facts may be also passed through *type*
8447 rules without further ado;
8448 - 'induct' method now derives symbolic cases from the *rulified*
8449 rule (before it used to rulify cases stemming from the internal
8450 atomized version); this means that the context of a non-atomic
8451 statement becomes is included in the hypothesis, avoiding the
8452 slightly cumbersome show "PROP ?case" form;
8453 - 'induct' may now use elim-style induction rules without chaining
8454 facts, using ``missing'' premises from the goal state; this allows
8455 rules stemming from inductive sets to be applied in unstructured
8456 scripts, while still benefitting from proper handling of non-atomic
8457 statements; NB: major inductive premises need to be put first, all
8458 the rest of the goal is passed through the induction;
8459 - 'induct' proper support for mutual induction involving non-atomic
8460 rule statements (uses the new concept of simultaneous goals, see
8462 - append all possible rule selections, but only use the first
8463 success (no backtracking);
8464 - removed obsolete "(simplified)" and "(stripped)" options of methods;
8465 - undeclared rule case names default to numbers 1, 2, 3, ...;
8466 - added 'print_induct_rules' (covered by help item in recent Proof
8468 - moved induct/cases attributes to Pure, methods to Provers;
8469 - generic method setup instantiated for FOL and HOL;
8471 * Pure: support multiple simultaneous goal statements, for example
8472 "have a: A and b: B" (same for 'theorem' etc.); being a pure
8473 meta-level mechanism, this acts as if several individual goals had
8474 been stated separately; in particular common proof methods need to be
8475 repeated in order to cover all claims; note that a single elimination
8476 step is *not* sufficient to establish the two conjunctions, so this
8479 assume "A & B" then have A and B .. (*".." fails*)
8481 better use "obtain" in situations as above; alternative refer to
8482 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
8484 * Pure: proper integration with ``locales''; unlike the original
8485 version by Florian Kammller, Isar locales package high-level proof
8486 contexts rather than raw logical ones (e.g. we admit to include
8487 attributes everywhere); operations on locales include merge and
8488 rename; support for implicit arguments (``structures''); simultaneous
8489 type-inference over imports and text; see also HOL/ex/Locales.thy for
8492 * Pure: the following commands have been ``localized'', supporting a
8493 target locale specification "(in name)": 'lemma', 'theorem',
8494 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
8495 stored both within the locale and at the theory level (exported and
8496 qualified by the locale name);
8498 * Pure: theory goals may now be specified in ``long'' form, with
8499 ad-hoc contexts consisting of arbitrary locale elements. for example
8500 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
8501 definitions may be given, too); the result is a meta-level rule with
8502 the context elements being discharged in the obvious way;
8504 * Pure: new proof command 'using' allows to augment currently used
8505 facts after a goal statement ('using' is syntactically analogous to
8506 'apply', but acts on the goal's facts only); this allows chained facts
8507 to be separated into parts given before and after a claim, as in
8508 ``from a and b have C using d and e <proof>'';
8510 * Pure: renamed "antecedent" case to "rule_context";
8512 * Pure: new 'judgment' command records explicit information about the
8513 object-logic embedding (used by several tools internally); no longer
8514 use hard-wired "Trueprop";
8516 * Pure: added 'corollary' command;
8518 * Pure: fixed 'token_translation' command;
8520 * Pure: removed obsolete 'exported' attribute;
8522 * Pure: dummy pattern "_" in is/let is now automatically lifted over
8523 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
8524 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
8526 * Pure: method 'atomize' presents local goal premises as object-level
8527 statements (atomic meta-level propositions); setup controlled via
8528 rewrite rules declarations of 'atomize' attribute; example
8529 application: 'induct' method with proper rule statements in improper
8532 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
8533 now consider the syntactic context of assumptions, giving a better
8534 chance to get type-inference of the arguments right (this is
8535 especially important for locales);
8537 * Pure: "sorry" no longer requires quick_and_dirty in interactive
8540 * Pure/obtain: the formal conclusion "thesis", being marked as
8541 ``internal'', may no longer be reference directly in the text;
8542 potential INCOMPATIBILITY, may need to use "?thesis" in rare
8545 * Pure: generic 'sym' attribute which declares a rule both as pure
8546 'elim?' and for the 'symmetric' operation;
8548 * Pure: marginal comments ``--'' may now occur just anywhere in the
8549 text; the fixed correlation with particular command syntax has been
8552 * Pure: new method 'rules' is particularly well-suited for proof
8553 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
8554 but often produces more compact proof terms with less detours;
8556 * Pure/Provers/classical: simplified integration with pure rule
8557 attributes and methods; the classical "intro?/elim?/dest?"
8558 declarations coincide with the pure ones; the "rule" method no longer
8559 includes classically swapped intros; "intro" and "elim" methods no
8560 longer pick rules from the context; also got rid of ML declarations
8561 AddXIs/AddXEs/AddXDs; all of this has some potential for
8564 * Provers/classical: attribute 'swapped' produces classical inversions
8565 of introduction rules;
8567 * Provers/simplifier: 'simplified' attribute may refer to explicit
8568 rules instead of full simplifier context; 'iff' attribute handles
8571 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
8573 * HOL: 'recdef' now fails on unfinished automated proofs, use
8574 "(permissive)" option to recover old behavior;
8576 * HOL: 'inductive' no longer features separate (collective) attributes
8577 for 'intros' (was found too confusing);
8579 * HOL: properly declared induction rules less_induct and
8585 * HOL: moved over to sane numeral syntax; the new policy is as
8588 - 0 and 1 are polymorphic constants, which are defined on any
8589 numeric type (nat, int, real etc.);
8591 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
8592 binary representation internally;
8594 - type nat has special constructor Suc, and generally prefers Suc 0
8595 over 1::nat and Suc (Suc 0) over 2::nat;
8597 This change may cause significant problems of INCOMPATIBILITY; here
8598 are some hints on converting existing sources:
8600 - due to the new "num" token, "-0" and "-1" etc. are now atomic
8601 entities, so expressions involving "-" (unary or binary minus) need
8602 to be spaced properly;
8604 - existing occurrences of "1" may need to be constraint "1::nat" or
8605 even replaced by Suc 0; similar for old "2";
8607 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
8609 - remove all special provisions on numerals in proofs;
8611 * HOL: simp rules nat_number expand numerals on nat to Suc/0
8612 representation (depends on bin_arith_simps in the default context);
8614 * HOL: symbolic syntax for x^2 (numeral 2);
8616 * HOL: the class of all HOL types is now called "type" rather than
8617 "term"; INCOMPATIBILITY, need to adapt references to this type class
8618 in axclass/classes, instance/arities, and (usually rare) occurrences
8619 in typings (of consts etc.); internally the class is called
8620 "HOL.type", ML programs should refer to HOLogic.typeS;
8622 * HOL/record package improvements:
8623 - new derived operations "fields" to build a partial record section,
8624 "extend" to promote a fixed record to a record scheme, and
8625 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
8626 declared as simp by default;
8627 - shared operations ("more", "fields", etc.) now need to be always
8628 qualified) --- potential INCOMPATIBILITY;
8629 - removed "make_scheme" operations (use "make" with "extend") --
8631 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
8632 - provides cases/induct rules for use with corresponding Isar
8633 methods (for concrete records, record schemes, concrete more
8634 parts, and schematic more parts -- in that order);
8635 - internal definitions directly based on a light-weight abstract
8636 theory of product types over typedef rather than datatype;
8638 * HOL: generic code generator for generating executable ML code from
8639 specifications; specific support for HOL constructs such as inductive
8640 datatypes and sets, as well as recursive functions; can be invoked
8641 via 'generate_code' theory section;
8643 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
8645 * HOL: consolidated and renamed several theories. In particular:
8646 Ord.thy has been absorbed into HOL.thy
8647 String.thy has been absorbed into List.thy
8649 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
8650 (beware of argument permutation!);
8652 * HOL: linorder_less_split superseded by linorder_cases;
8654 * HOL/List: "nodups" renamed to "distinct";
8656 * HOL: added "The" definite description operator; move Hilbert's "Eps"
8657 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
8658 - Ex_def has changed, now need to use some_eq_ex
8660 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
8661 in this (rare) case use:
8663 delSWrapper "split_all_tac"
8664 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
8666 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
8669 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
8670 Isabelle's type classes, ^ on functions and relations has too general
8671 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
8672 necessary to attach explicit type constraints;
8674 * HOL/Relation: the prefix name of the infix "O" has been changed from
8675 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
8676 renamed accordingly (eg "compI" -> "rel_compI").
8678 * HOL: syntax translations now work properly with numerals and records
8681 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
8682 of "lam" -- INCOMPATIBILITY;
8684 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
8685 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
8686 renamed "Product_Type.unit";
8688 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
8690 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
8691 the "cases" method);
8693 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
8696 * HOL/IMP: updated and converted to new-style theory format; several
8697 parts turned into readable document, with proper Isar proof texts and
8698 some explanations (by Gerwin Klein);
8700 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
8702 * HOL-Hyperreal is now a logic image;
8707 * Isar: consts/constdefs supports mixfix syntax for continuous
8710 * Isar: domain package adapted to new-style theory format, e.g. see
8713 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
8714 potential INCOMPATIBILITY; now use plain induct_tac instead of former
8715 lift.induct_tac, always use UU instead of Undef;
8717 * HOLCF/IMP: updated and converted to new-style theory;
8722 * Isar: proper integration of logic-specific tools and packages,
8723 including theory commands '(co)inductive', '(co)datatype',
8724 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
8725 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
8727 * theory Main no longer includes AC; for the Axiom of Choice, base
8728 your theory on Main_ZFC;
8730 * the integer library now covers quotients and remainders, with many
8731 laws relating division to addition, multiplication, etc.;
8733 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
8734 typeless version of the formalism;
8736 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
8739 * ZF/Induct: new directory for examples of inductive definitions,
8740 including theory Multiset for multiset orderings; converted to
8741 new-style theory format;
8743 * ZF: many new theorems about lists, ordinals, etc.;
8748 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
8749 variable proof controls level of detail: 0 = no proofs (only oracle
8750 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
8751 also ref manual for further ML interfaces;
8753 * Pure/axclass: removed obsolete ML interface
8754 goal_subclass/goal_arity;
8756 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
8757 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
8758 separate tokens, so expressions involving minus need to be spaced
8761 * Pure/syntax: support non-oriented infixes, using keyword "infix"
8762 rather than "infixl" or "infixr";
8764 * Pure/syntax: concrete syntax for dummy type variables admits genuine
8765 sort constraint specifications in type inference; e.g. "x::_::foo"
8766 ensures that the type of "x" is of sort "foo" (but not necessarily a
8769 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
8770 control output of nested => (types); the default behavior is
8773 * Pure/syntax: builtin parse translation for "_constify" turns valued
8774 tokens into AST constants;
8776 * Pure/syntax: prefer later declarations of translations and print
8777 translation functions; potential INCOMPATIBILITY: need to reverse
8778 multiple declarations for same syntax element constant;
8780 * Pure/show_hyps reset by default (in accordance to existing Isar
8783 * Provers/classical: renamed addaltern to addafter, addSaltern to
8786 * Provers/clasimp: ``iff'' declarations now handle conditional rules
8789 * system: tested support for MacOS X; should be able to get Isabelle +
8790 Proof General to work in a plain Terminal after installing Poly/ML
8791 (e.g. from the Isabelle distribution area) and GNU bash alone
8792 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
8793 support requires further installations, e.g. from
8794 http://fink.sourceforge.net/);
8796 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
8798 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
8799 of 40 MB), cf. ML_OPTIONS;
8801 * system: Proof General keywords specification is now part of the
8802 Isabelle distribution (see etc/isar-keywords.el);
8804 * system: support for persistent Proof General sessions (refrain from
8805 outdating all loaded theories on startup); user may create writable
8806 logic images like this: ``isabelle -q HOL Test'';
8808 * system: smart selection of Isabelle process versus Isabelle
8809 interface, accommodates case-insensitive file systems (e.g. HFS+); may
8810 run both "isabelle" and "Isabelle" even if file names are badly
8811 damaged (executable inspects the case of the first letter of its own
8812 name); added separate "isabelle-process" and "isabelle-interface";
8814 * system: refrain from any attempt at filtering input streams; no
8815 longer support ``8bit'' encoding of old isabelle font, instead proper
8816 iso-latin characters may now be used; the related isatools
8817 "symbolinput" and "nonascii" have disappeared as well;
8819 * system: removed old "xterm" interface (the print modes "xterm" and
8820 "xterm_color" are still available for direct use in a suitable
8825 New in Isabelle99-2 (February 2001)
8826 -----------------------------------
8828 *** Overview of INCOMPATIBILITIES ***
8830 * HOL: please note that theories in the Library and elsewhere often use the
8831 new-style (Isar) format; to refer to their theorems in an ML script you must
8832 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
8834 * HOL: inductive package no longer splits induction rule aggressively,
8835 but only as far as specified by the introductions given; the old
8836 format may be recovered via ML function complete_split_rule or attribute
8837 'split_rule (complete)';
8839 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
8840 gfp_Tarski to gfp_unfold;
8842 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
8844 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
8845 relation); infix "^^" has been renamed "``"; infix "``" has been
8846 renamed "`"; "univalent" has been renamed "single_valued";
8848 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
8851 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
8853 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
8855 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
8856 consequence, it is no longer monotonic wrt. the local goal context
8857 (which is now passed through the inductive cases);
8859 * Document preparation: renamed standard symbols \<ll> to \<lless> and
8860 \<gg> to \<ggreater>;
8863 *** Document preparation ***
8865 * \isabellestyle{NAME} selects version of Isabelle output (currently
8866 available: are "it" for near math-mode best-style output, "sl" for
8867 slanted text style, and "tt" for plain type-writer; if no
8868 \isabellestyle command is given, output is according to slanted
8871 * support sub/super scripts (for single symbols only), input syntax is
8872 like this: "A\<^sup>*" or "A\<^sup>\<star>";
8874 * some more standard symbols; see Appendix A of the system manual for
8875 the complete list of symbols defined in isabellesym.sty;
8877 * improved isabelle style files; more abstract symbol implementation
8878 (should now use \isamath{...} and \isatext{...} in custom symbol
8881 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
8882 state; Note that presentation of goal states does not conform to
8883 actual human-readable proof documents. Please do not include goal
8884 states into document output unless you really know what you are doing!
8886 * proper indentation of antiquoted output with proportional LaTeX
8889 * no_document ML operator temporarily disables LaTeX document
8892 * isatool unsymbolize tunes sources for plain ASCII communication;
8897 * Pure: Isar now suffers initial goal statements to contain unbound
8898 schematic variables (this does not conform to actual readable proof
8899 documents, due to unpredictable outcome and non-compositional proof
8900 checking); users who know what they are doing may use schematic goals
8901 for Prolog-style synthesis of proven results;
8903 * Pure: assumption method (an implicit finishing) now handles actual
8906 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
8907 initial goal, declare "that" only as Pure intro (only for single
8908 steps); the "that" rule assumption may now be involved in implicit
8909 finishing, thus ".." becomes a feasible for trivial obtains;
8911 * Pure: default proof step now includes 'intro_classes'; thus trivial
8912 instance proofs may be performed by "..";
8914 * Pure: ?thesis / ?this / "..." now work for pure meta-level
8917 * Pure: more robust selection of calculational rules;
8919 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
8920 rule (as well as the assumption rule);
8922 * Pure: 'thm_deps' command visualizes dependencies of theorems and
8923 lemmas, using the graph browser tool;
8925 * Pure: predict failure of "show" in interactive mode;
8927 * Pure: 'thms_containing' now takes actual terms as arguments;
8929 * HOL: improved method 'induct' --- now handles non-atomic goals
8930 (potential INCOMPATIBILITY); tuned error handling;
8932 * HOL: cases and induct rules now provide explicit hints about the
8933 number of facts to be consumed (0 for "type" and 1 for "set" rules);
8934 any remaining facts are inserted into the goal verbatim;
8936 * HOL: local contexts (aka cases) may now contain term bindings as
8937 well; the 'cases' and 'induct' methods new provide a ?case binding for
8938 the result to be shown in each case;
8940 * HOL: added 'recdef_tc' command;
8942 * isatool convert assists in eliminating legacy ML scripts;
8947 * HOL/Library: a collection of generic theories to be used together
8948 with main HOL; the theory loader path already includes this directory
8949 by default; the following existing theories have been moved here:
8950 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
8951 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
8953 * HOL/Unix: "Some aspects of Unix file-system security", a typical
8954 modelling and verification task performed in Isabelle/HOL +
8955 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
8957 * HOL/Algebra: special summation operator SUM no longer exists, it has
8958 been replaced by setsum; infix 'assoc' now has priority 50 (like
8959 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
8960 'domain', this makes the theory consistent with mathematical
8963 * HOL basics: added overloaded operations "inverse" and "divide"
8964 (infix "/"), syntax for generic "abs" operation, generic summation
8967 * HOL/typedef: simplified package, provide more useful rules (see also
8970 * HOL/datatype: induction rule for arbitrarily branching datatypes is
8971 now expressed as a proper nested rule (old-style tactic scripts may
8972 require atomize_strip_tac to cope with non-atomic premises);
8974 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
8975 to "split_conv" (old name still available for compatibility);
8977 * HOL: improved concrete syntax for strings (e.g. allows translation
8978 rules with string literals);
8980 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
8981 and Fleuriot's mechanization of analysis, including the transcendental
8982 functions for the reals;
8984 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
8989 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
8990 "lam" is displayed as TWO lambda-symbols
8992 * CTT: theory Main now available, containing everything (that is, Bool
8998 * Pure: the Simplifier has been implemented properly as a derived rule
8999 outside of the actual kernel (at last!); the overall performance
9000 penalty in practical applications is about 50%, while reliability of
9001 the Isabelle inference kernel has been greatly improved;
9003 * print modes "brackets" and "no_brackets" control output of nested =>
9004 (types) and ==> (props); the default behaviour is "brackets";
9006 * Provers: fast_tac (and friends) now handle actual object-logic rules
9007 as assumptions as well;
9009 * system: support Poly/ML 4.0;
9011 * system: isatool install handles KDE version 1 or 2;
9015 New in Isabelle99-1 (October 2000)
9016 ----------------------------------
9018 *** Overview of INCOMPATIBILITIES ***
9020 * HOL: simplification of natural numbers is much changed; to partly
9021 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
9022 issue the following ML commands:
9024 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
9025 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
9027 * HOL: simplification no longer dives into case-expressions; this is
9028 controlled by "t.weak_case_cong" for each datatype t;
9030 * HOL: nat_less_induct renamed to less_induct;
9032 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
9033 fixsome to patch .thy and .ML sources automatically;
9035 select_equality -> some_equality
9036 select_eq_Ex -> some_eq_ex
9037 selectI2EX -> someI2_ex
9040 select1_equality -> some1_equality
9041 Eps_sym_eq -> some_sym_eq_trivial
9042 Eps_eq -> some_eq_trivial
9044 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
9046 * HOL: removed obsolete theorem binding expand_if (refer to split_if
9049 * HOL: the recursion equations generated by 'recdef' are now called
9050 f.simps instead of f.rules;
9052 * HOL: qed_spec_mp now also handles bounded ALL as well;
9054 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
9055 sometimes be needed;
9057 * HOL: the constant for "f``x" is now "image" rather than "op ``";
9059 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
9061 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
9062 product is now "<*>" instead of "Times"; the lexicographic product is
9063 now "<*lex*>" instead of "**";
9065 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
9066 of main HOL, but was unused); better use HOL's datatype package;
9068 * HOL: removed "symbols" syntax for constant "override" of theory Map;
9069 the old syntax may be recovered as follows:
9072 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
9073 (infixl "\\<oplus>" 100)
9075 * HOL/Real: "rabs" replaced by overloaded "abs" function;
9077 * HOL/ML: even fewer consts are declared as global (see theories Ord,
9078 Lfp, Gfp, WF); this only affects ML packages that refer to const names
9081 * HOL and ZF: syntax for quotienting wrt an equivalence relation
9082 changed from A/r to A//r;
9084 * ZF: new treatment of arithmetic (nat & int) may break some old
9087 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
9088 rulify -> rule_format, elimify -> elim_format, ...);
9090 * Isar/Provers: intro/elim/dest attributes changed; renamed
9091 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
9092 should have to change intro!! to intro? only); replaced "delrule" by
9095 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
9097 * Provers: strengthened force_tac by using new first_best_tac;
9099 * LaTeX document preparation: several changes of isabelle.sty (see
9103 *** Document preparation ***
9105 * formal comments (text blocks etc.) in new-style theories may now
9106 contain antiquotations of thm/prop/term/typ/text to be presented
9107 according to latex print mode; concrete syntax is like this:
9108 @{term[show_types] "f(x) = a + x"};
9110 * isatool mkdir provides easy setup of Isabelle session directories,
9111 including proper document sources;
9113 * generated LaTeX sources are now deleted after successful run
9114 (isatool document -c); may retain a copy somewhere else via -D option
9117 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
9118 style files, achieving self-contained LaTeX sources and simplifying
9121 * old-style theories now produce (crude) LaTeX output as well;
9123 * browser info session directories are now self-contained (may be put
9124 on WWW server seperately); improved graphs of nested sessions; removed
9125 graph for 'all sessions';
9127 * several improvements in isabelle style files; \isabellestyle{it}
9128 produces fake math mode output; \isamarkupheader is now \section by
9129 default; see lib/texinputs/isabelle.sty etc.;
9134 * Isar/Pure: local results and corresponding term bindings are now
9135 subject to Hindley-Milner polymorphism (similar to ML); this
9136 accommodates incremental type-inference very nicely;
9138 * Isar/Pure: new derived language element 'obtain' supports
9139 generalized existence reasoning;
9141 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
9142 support accumulation of results, without applying any rules yet;
9143 useful to collect intermediate results without explicit name
9144 references, and for use with transitivity rules with more than 2
9147 * Isar/Pure: scalable support for case-analysis type proofs: new
9148 'case' language element refers to local contexts symbolically, as
9149 produced by certain proof methods; internally, case names are attached
9150 to theorems as "tags";
9152 * Isar/Pure: theory command 'hide' removes declarations from
9153 class/type/const name spaces;
9155 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
9156 indicate potential overloading;
9158 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
9160 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
9161 "{a,b,c}" instead of {a,b,c};
9163 * Isar/Pure now provides its own version of intro/elim/dest
9164 attributes; useful for building new logics, but beware of confusion
9165 with the version in Provers/classical;
9167 * Isar/Pure: the local context of (non-atomic) goals is provided via
9168 case name 'antecedent';
9170 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
9171 to the current context is now done automatically);
9173 * Isar/Pure: theory command 'method_setup' provides a simple interface
9174 for definining proof methods in ML;
9176 * Isar/Provers: intro/elim/dest attributes changed; renamed
9177 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
9178 most cases, one should have to change intro!! to intro? only);
9179 replaced "delrule" by "rule del";
9181 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
9182 'symmetric' attribute (the latter supercedes [RS sym]);
9184 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
9185 method modifier); 'simp' method: 'only:' modifier removes loopers as
9186 well (including splits);
9188 * Isar/Provers: Simplifier and Classical methods now support all kind
9189 of modifiers used in the past, including 'cong', 'iff', etc.
9191 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
9192 of Simplifier and Classical reasoner);
9194 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
9195 now support named cases; major packages (inductive, datatype, primrec,
9196 recdef) support case names and properly name parameters;
9198 * Isar/HOL: new transitivity rules for substitution in inequalities --
9199 monotonicity conditions are extracted to be proven at end of
9202 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
9205 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
9206 split_if split_if_asm; datatype package provides theorems foo.splits =
9207 foo.split foo.split_asm for each datatype;
9209 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
9210 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
9211 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
9212 use "(cases (simplified))" method in proper proof texts);
9214 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
9216 * Isar: names of theorems etc. may be natural numbers as well;
9218 * Isar: 'pr' command: optional arguments for goals_limit and
9219 ProofContext.prems_limit; no longer prints theory contexts, but only
9222 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
9223 additional print modes to be specified; e.g. "pr(latex)" will print
9224 proof state according to the Isabelle LaTeX style;
9226 * Isar: improved support for emulating tactic scripts, including proof
9227 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
9228 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
9229 (for HOL datatypes);
9231 * Isar: simplified (more robust) goal selection of proof methods: 1st
9232 goal, all goals, or explicit goal specifier (tactic emulation); thus
9233 'proof method scripts' have to be in depth-first order;
9235 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
9237 * Isar: removed 'help' command, which hasn't been too helpful anyway;
9238 should instead use individual commands for printing items
9239 (print_commands, print_methods etc.);
9241 * Isar: added 'nothing' --- the empty list of theorems;
9246 * HOL/MicroJava: formalization of a fragment of Java, together with a
9247 corresponding virtual machine and a specification of its bytecode
9248 verifier and a lightweight bytecode verifier, including proofs of
9249 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
9250 Cornelia Pusch (see also the homepage of project Bali at
9251 http://isabelle.in.tum.de/Bali/);
9253 * HOL/Algebra: new theory of rings and univariate polynomials, by
9256 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
9257 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
9260 * HOL/Lattice: fundamental concepts of lattice theory and order
9261 structures, including duals, properties of bounds versus algebraic
9262 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
9263 Theorem for complete lattices etc.; may also serve as a demonstration
9264 for abstract algebraic reasoning using axiomatic type classes, and
9265 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
9267 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
9270 * HOL/IMPP: extension of IMP with local variables and mutually
9271 recursive procedures, by David von Oheimb;
9273 * HOL/Lambda: converted into new-style theory and document;
9275 * HOL/ex/Multiquote: example of multiple nested quotations and
9276 anti-quotations -- basically a generalized version of de-Bruijn
9277 representation; very useful in avoiding lifting of operations;
9279 * HOL/record: added general record equality rule to simpset; fixed
9280 select-update simplification procedure to handle extended records as
9281 well; admit "r" as field name;
9283 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
9284 other numeric types and also as the identity of groups, rings, etc.;
9286 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
9287 Types nat and int belong to this axclass;
9289 * HOL: greatly improved simplification involving numerals of type nat, int, real:
9290 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
9291 i*j + k + j*#3*i simplifies to #4*(i*j) + k
9292 two terms #m*u and #n*u are replaced by #(m+n)*u
9293 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
9294 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
9295 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
9297 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
9298 powerful prover for predicate logic but knows nothing of clasets; see
9299 ex/mesontest.ML and ex/mesontest2.ML for example applications;
9301 * HOL: new version of "case_tac" subsumes both boolean case split and
9302 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
9303 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
9305 * HOL: simplification no longer dives into case-expressions: only the
9306 selector expression is simplified, but not the remaining arms; to
9307 enable full simplification of case-expressions for datatype t, you may
9308 remove t.weak_case_cong from the simpset, either globally (Delcongs
9309 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
9311 * HOL/recdef: the recursion equations generated by 'recdef' for
9312 function 'f' are now called f.simps instead of f.rules; if all
9313 termination conditions are proved automatically, these simplification
9314 rules are added to the simpset, as in primrec; rules may be named
9315 individually as well, resulting in a separate list of theorems for
9318 * HOL/While is a new theory that provides a while-combinator. It
9319 permits the definition of tail-recursive functions without the
9320 provision of a termination measure. The latter is necessary once the
9321 invariant proof rule for while is applied.
9323 * HOL: new (overloaded) notation for the set of elements below/above
9324 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
9326 * HOL: theorems impI, allI, ballI bound as "strip";
9328 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
9329 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
9330 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
9332 * HOL/Real: "rabs" replaced by overloaded "abs" function;
9334 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
9335 main HOL, but was unused);
9337 * HOL: fewer consts declared as global (e.g. have to refer to
9338 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
9340 * HOL: tuned AST representation of nested pairs, avoiding bogus output
9341 in case of overlap with user translations (e.g. judgements over
9342 tuples); (note that the underlying logical represenation is still
9348 * ZF: simplification automatically cancels common terms in arithmetic
9349 expressions over nat and int;
9351 * ZF: new treatment of nat to minimize type-checking: all operators
9352 coerce their operands to a natural number using the function natify,
9353 making the algebraic laws unconditional;
9355 * ZF: as above, for int: operators coerce their operands to an integer
9356 using the function intify;
9358 * ZF: the integer library now contains many of the usual laws for the
9359 orderings, including $<=, and monotonicity laws for $+ and $*;
9361 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
9364 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
9365 to the simplifier and classical reasoner simultaneously;
9370 * Provers: blast_tac now handles actual object-logic rules as
9371 assumptions; note that auto_tac uses blast_tac internally as well;
9373 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
9374 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
9376 * Provers: delrules now handles destruct rules as well (no longer need
9377 explicit make_elim);
9379 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
9380 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
9381 use instead the strong form,
9382 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
9383 in HOL, FOL and ZF the function cla_make_elim will create such rules
9384 from destruct-rules;
9386 * Provers: Simplifier.easy_setup provides a fast path to basic
9387 Simplifier setup for new object-logics;
9389 * Pure: AST translation rules no longer require constant head on LHS;
9391 * Pure: improved name spaces: ambiguous output is qualified; support
9392 for hiding of names;
9394 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
9395 XSYMBOL_HOME; no longer need to do manual configuration in most
9398 * system: compression of ML heaps images may now be controlled via -c
9399 option of isabelle and isatool usedir (currently only observed by
9402 * system: isatool installfonts may handle X-Symbol fonts as well (very
9403 useful for remote X11);
9405 * system: provide TAGS file for Isabelle sources;
9407 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
9410 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
9411 timing flag supersedes proof_timing and Toplevel.trace;
9413 * ML: new combinators |>> and |>>> for incremental transformations
9414 with secondary results (e.g. certain theory extensions):
9416 * ML: PureThy.add_defs gets additional argument to indicate potential
9417 overloading (usually false);
9419 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
9424 New in Isabelle99 (October 1999)
9425 --------------------------------
9427 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9429 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
9430 are no longer simplified. (This allows the simplifier to unfold recursive
9431 functional programs.) To restore the old behaviour, declare
9433 Delcongs [if_weak_cong];
9435 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
9438 * HOL: the predicate "inj" is now defined by translation to "inj_on";
9440 * HOL/datatype: mutual_induct_tac no longer exists --
9441 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
9443 * HOL/typedef: fixed type inference for representing set; type
9444 arguments now have to occur explicitly on the rhs as type constraints;
9446 * ZF: The con_defs part of an inductive definition may no longer refer
9447 to constants declared in the same theory;
9449 * HOL, ZF: the function mk_cases, generated by the inductive
9450 definition package, has lost an argument. To simplify its result, it
9451 uses the default simpset instead of a supplied list of theorems.
9453 * HOL/List: the constructors of type list are now Nil and Cons;
9455 * Simplifier: the type of the infix ML functions
9456 setSSolver addSSolver setSolver addSolver
9457 is now simpset * solver -> simpset where `solver' is a new abstract type
9458 for packaging solvers. A solver is created via
9459 mk_solver: string -> (thm list -> int -> tactic) -> solver
9460 where the string argument is only a comment.
9465 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
9466 decision procedure for linear arithmetic. Currently it is used for
9467 types `nat', `int', and `real' in HOL (see below); it can, should and
9468 will be instantiated for other types and logics as well.
9470 * The simplifier now accepts rewrite rules with flexible heads, eg
9471 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
9472 They are applied like any rule with a non-pattern lhs, i.e. by first-order
9478 * New Isabelle/Isar subsystem provides an alternative to traditional
9479 tactical theorem proving; together with the ProofGeneral/isar user
9480 interface it offers an interactive environment for developing human
9481 readable proof documents (Isar == Intelligible semi-automated
9482 reasoning); for further information see isatool doc isar-ref,
9483 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
9485 * improved and simplified presentation of theories: better HTML markup
9486 (including colors), graph views in several sizes; isatool usedir now
9487 provides a proper interface for user theories (via -P option); actual
9488 document preparation based on (PDF)LaTeX is available as well (for
9489 new-style theories only); see isatool doc system for more information;
9491 * native support for Proof General, both for classic Isabelle and
9494 * ML function thm_deps visualizes dependencies of theorems and lemmas,
9495 using the graph browser tool;
9497 * Isabelle manuals now also available as PDF;
9499 * theory loader rewritten from scratch (may not be fully
9500 bug-compatible); old loadpath variable has been replaced by show_path,
9501 add_path, del_path, reset_path functions; new operations such as
9502 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
9505 * improved isatool install: option -k creates KDE application icon,
9506 option -p DIR installs standalone binaries;
9508 * added ML_PLATFORM setting (useful for cross-platform installations);
9509 more robust handling of platform specific ML images for SML/NJ;
9511 * the settings environment is now statically scoped, i.e. it is never
9512 created again in sub-processes invoked from isabelle, isatool, or
9515 * path element specification '~~' refers to '$ISABELLE_HOME';
9517 * in locales, the "assumes" and "defines" parts may be omitted if
9520 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
9523 * new print_mode "HTML";
9525 * new flag show_tags controls display of tags of theorems (which are
9526 basically just comments that may be attached by some tools);
9528 * Isamode 2.6 requires patch to accomodate change of Isabelle font
9529 mode and goal output format:
9531 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
9533 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
9535 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
9536 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
9538 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
9540 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
9542 * function bind_thms stores lists of theorems (cf. bind_thm);
9544 * new shorthand tactics ftac, eatac, datac, fatac;
9546 * qed (and friends) now accept "" as result name; in that case the
9547 theorem is not stored, but proper checks and presentation of the
9550 * theorem database now also indexes constants "Trueprop", "all",
9551 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
9556 ** HOL arithmetic **
9558 * There are now decision procedures for linear arithmetic over nat and
9561 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
9562 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
9563 are treated as atomic; subformulae not involving type `nat' or `int'
9564 are ignored; quantified subformulae are ignored unless they are
9565 positive universal or negative existential. The tactic has to be
9566 invoked by hand and can be a little bit slow. In particular, the
9567 running time is exponential in the number of occurrences of `min' and
9568 `max', and `-' on `nat'.
9570 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
9571 (negated) (in)equalities among the premises and the conclusion into
9572 account (i.e. no compound formulae) and does not know about `min' and
9573 `max', and `-' on `nat'. It is fast and is used automatically by the
9576 NB: At the moment, these decision procedures do not cope with mixed
9577 nat/int formulae where the two parts interact, such as `m < n ==>
9580 * HOL/Numeral provides a generic theory of numerals (encoded
9581 efficiently as bit strings); setup for types nat/int/real is in place;
9582 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
9583 int, existing theories and proof scripts may require a few additional
9586 * integer division and remainder can now be performed on constant
9589 * many properties of integer multiplication, division and remainder
9592 * An interface to the Stanford Validity Checker (SVC) is available through the
9593 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
9594 are proved automatically. SVC must be installed separately, and its results
9595 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
9596 invocation of the underlying oracle). For SVC see
9597 http://verify.stanford.edu/SVC
9599 * IsaMakefile: the HOL-Real target now builds an actual image;
9604 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
9605 (in Isabelle/Isar) -- by Gertrud Bauer;
9607 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
9608 analysis for assembly languages with subtypes;
9610 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
9611 -- avoids syntactic ambiguities and treats state, transition, and
9612 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
9613 changed syntax and (many) tactics;
9615 * HOL/inductive: Now also handles more general introduction rules such
9616 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
9617 theorems are now maintained within the theory (maintained via the
9620 * HOL/datatype: Now also handles arbitrarily branching datatypes
9621 (using function types) such as
9623 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
9625 * HOL/record: record_simproc (part of the default simpset) takes care
9626 of selectors applied to updated records; record_split_tac is no longer
9627 part of the default claset; update_defs may now be removed from the
9628 simpset in many cases; COMPATIBILITY: old behavior achieved by
9630 claset_ref () := claset() addSWrapper record_split_wrapper;
9631 Delsimprocs [record_simproc]
9633 * HOL/typedef: fixed type inference for representing set; type
9634 arguments now have to occur explicitly on the rhs as type constraints;
9636 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
9637 names rather than an ML expression;
9639 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
9640 supplied later. Program schemes can be defined, such as
9641 "While B C s = (if B s then While B C (C s) else s)"
9642 where the well-founded relation can be chosen after B and C have been given.
9644 * HOL/List: the constructors of type list are now Nil and Cons;
9645 INCOMPATIBILITY: while [] and infix # syntax is still there, of
9646 course, ML tools referring to List.list.op # etc. have to be adapted;
9648 * HOL_quantifiers flag superseded by "HOL" print mode, which is
9649 disabled by default; run isabelle with option -m HOL to get back to
9650 the original Gordon/HOL-style output;
9652 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
9653 ALL x<=y. P, EX x<y. P, EX x<=y. P;
9655 * HOL basic syntax simplified (more orthogonal): all variants of
9656 All/Ex now support plain / symbolic / HOL notation; plain syntax for
9657 Eps operator is provided as well: "SOME x. P[x]";
9659 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
9661 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
9662 thus available for user theories;
9664 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
9665 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
9668 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
9669 several times and then mp;
9674 * the notation <<...>> is now available as a notation for sequences of
9677 * the simplifier is now installed
9679 * the axiom system has been generalized (thanks to Soren Heilmann)
9681 * the classical reasoner now has a default rule database
9686 * new primrec section allows primitive recursive functions to be given
9687 directly (as in HOL) over datatypes and the natural numbers;
9689 * new tactics induct_tac and exhaust_tac for induction (or case
9690 analysis) over datatypes and the natural numbers;
9692 * the datatype declaration of type T now defines the recursor T_rec;
9694 * simplification automatically does freeness reasoning for datatype
9697 * automatic type-inference, with AddTCs command to insert new
9698 type-checking rules;
9700 * datatype introduction rules are now added as Safe Introduction rules
9703 * the syntax "if P then x else y" is now available in addition to
9707 *** Internal programming interfaces ***
9709 * tuned simplifier trace output; new flag debug_simp;
9711 * structures Vartab / Termtab (instances of TableFun) offer efficient
9712 tables indexed by indexname_ord / term_ord (compatible with aconv);
9714 * AxClass.axclass_tac lost the theory argument;
9716 * tuned current_goals_markers semantics: begin / end goal avoids
9717 printing empty lines;
9719 * removed prs and prs_fn hook, which was broken because it did not
9720 include \n in its semantics, forcing writeln to add one
9721 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
9722 string -> unit if you really want to output text without newline;
9724 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
9725 plain output, interface builders may have to enable 'isabelle_font'
9726 mode to get Isabelle font glyphs as before;
9728 * refined token_translation interface; INCOMPATIBILITY: output length
9729 now of type real instead of int;
9731 * theory loader actions may be traced via new ThyInfo.add_hook
9732 interface (see src/Pure/Thy/thy_info.ML); example application: keep
9733 your own database of information attached to *whole* theories -- as
9734 opposed to intra-theory data slots offered via TheoryDataFun;
9736 * proper handling of dangling sort hypotheses (at last!);
9737 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
9738 extra sort hypotheses that can be witnessed from the type signature;
9739 the force_strip_shyps flag is gone, any remaining shyps are simply
9740 left in the theorem (with a warning issued by strip_shyps_warning);
9744 New in Isabelle98-1 (October 1998)
9745 ----------------------------------
9747 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9749 * several changes of automated proof tools;
9751 * HOL: major changes to the inductive and datatype packages, including
9752 some minor incompatibilities of theory syntax;
9754 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
9757 * HOL: removed duplicate thms in Arith:
9758 less_imp_add_less should be replaced by trans_less_add1
9759 le_imp_add_le should be replaced by trans_le_add1
9761 * HOL: unary minus is now overloaded (new type constraints may be
9764 * HOL and ZF: unary minus for integers is now #- instead of #~. In
9765 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
9766 now taken as an integer constant.
9768 * Pure: ML function 'theory_of' renamed to 'theory';
9774 1. Asm_full_simp_tac is now more aggressive.
9775 1. It will sometimes reorient premises if that increases their power to
9777 2. It does no longer proceed strictly from left to right but may also
9778 rotate premises to achieve further simplification.
9779 For compatibility reasons there is now Asm_lr_simp_tac which is like the
9780 old Asm_full_simp_tac in that it does not rotate premises.
9781 2. The simplifier now knows a little bit about nat-arithmetic.
9783 * Classical reasoner: wrapper mechanism for the classical reasoner now
9784 allows for selected deletion of wrappers, by introduction of names for
9785 wrapper functionals. This implies that addbefore, addSbefore,
9786 addaltern, and addSaltern now take a pair (name, tactic) as argument,
9787 and that adding two tactics with the same name overwrites the first
9788 one (emitting a warning).
9789 type wrapper = (int -> tactic) -> (int -> tactic)
9790 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
9791 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
9792 delWrapper, delSWrapper: claset * string -> claset
9793 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
9795 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
9796 semantics; addbefore now affects only the unsafe part of step_tac
9797 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
9798 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
9801 * Classical reasoner: setwrapper to setWrapper and compwrapper to
9802 compWrapper; added safe wrapper (and access functions for it);
9804 * HOL/split_all_tac is now much faster and fails if there is nothing
9805 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
9806 and the names of the automatically generated variables have changed.
9807 split_all_tac has moved within claset() from unsafe wrappers to safe
9808 wrappers, which means that !!-bound variables are split much more
9809 aggressively, and safe_tac and clarify_tac now split such variables.
9810 If this splitting is not appropriate, use delSWrapper "split_all_tac".
9811 Note: the same holds for record_split_tac, which does the job of
9812 split_all_tac for record fields.
9814 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
9815 permanently to the default simpset using Addsplits just like
9816 Addsimps. They can be removed via Delsplits just like
9817 Delsimps. Lower-case versions are also available.
9819 * HOL/Simplifier: The rule split_if is now part of the default
9820 simpset. This means that the simplifier will eliminate all occurrences
9821 of if-then-else in the conclusion of a goal. To prevent this, you can
9822 either remove split_if completely from the default simpset by
9823 `Delsplits [split_if]' or remove it in a specific call of the
9824 simplifier using `... delsplits [split_if]'. You can also add/delete
9825 other case splitting rules to/from the default simpset: every datatype
9826 generates suitable rules `split_t_case' and `split_t_case_asm' (where
9827 t is the name of the datatype).
9829 * Classical reasoner / Simplifier combination: new force_tac (and
9830 derivatives Force_tac, force) combines rewriting and classical
9831 reasoning (and whatever other tools) similarly to auto_tac, but is
9832 aimed to solve the given subgoal completely.
9837 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
9838 and `goalw': the theory is no longer needed as an explicit argument -
9839 the current theory context is used; assumptions are no longer returned
9840 at the ML-level unless one of them starts with ==> or !!; it is
9841 recommended to convert to these new commands using isatool fixgoal
9842 (backup your sources first!);
9844 * new top-level commands 'thm' and 'thms' for retrieving theorems from
9845 the current theory context, and 'theory' to lookup stored theories;
9847 * new theory section 'locale' for declaring constants, assumptions and
9848 definitions that have local scope;
9850 * new theory section 'nonterminals' for purely syntactic types;
9852 * new theory section 'setup' for generic ML setup functions
9853 (e.g. package initialization);
9855 * the distribution now includes Isabelle icons: see
9856 lib/logo/isabelle-{small,tiny}.xpm;
9858 * isatool install - install binaries with absolute references to
9861 * isatool logo -- create instances of the Isabelle logo (as EPS);
9863 * print mode 'emacs' reserved for Isamode;
9865 * support multiple print (ast) translations per constant name;
9867 * theorems involving oracles are now printed with a suffixed [!];
9872 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
9874 * HOL/inductive package reorganized and improved: now supports mutual
9880 oddI "n : EVEN ==> Suc n : ODD"
9881 evenI "n : ODD ==> Suc n : EVEN"
9883 new theorem list "elims" contains an elimination rule for each of the
9884 recursive sets; inductive definitions now handle disjunctive premises
9885 correctly (also ZF);
9887 INCOMPATIBILITIES: requires Inductive as an ancestor; component
9888 "mutual_induct" no longer exists - the induction rule is always
9889 contained in "induct";
9892 * HOL/datatype package re-implemented and greatly improved: now
9893 supports mutually recursive datatypes such as
9896 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
9897 | SUM ('a aexp) ('a aexp)
9898 | DIFF ('a aexp) ('a aexp)
9901 'a bexp = LESS ('a aexp) ('a aexp)
9902 | AND ('a bexp) ('a bexp)
9903 | OR ('a bexp) ('a bexp)
9905 as well as indirectly recursive datatypes such as
9908 ('a, 'b) term = Var 'a
9909 | App 'b ((('a, 'b) term) list)
9911 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
9912 induction on mutually / indirectly recursive datatypes.
9914 Primrec equations are now stored in theory and can be accessed via
9915 <function_name>.simps.
9919 - Theories using datatypes must now have theory Datatype as an
9921 - The specific <typename>.induct_tac no longer exists - use the
9922 generic induct_tac instead.
9923 - natE has been renamed to nat.exhaust - use exhaust_tac
9924 instead of res_inst_tac ... natE. Note that the variable
9925 names in nat.exhaust differ from the names in natE, this
9926 may cause some "fragile" proofs to fail.
9927 - The theorems split_<typename>_case and split_<typename>_case_asm
9928 have been renamed to <typename>.split and <typename>.split_asm.
9929 - Since default sorts of type variables are now handled correctly,
9930 some datatype definitions may have to be annotated with explicit
9932 - Primrec definitions no longer require function name and type
9933 of recursive argument.
9935 Consider using isatool fixdatatype to adapt your theories and proof
9936 scripts to the new package (backup your sources first!).
9939 * HOL/record package: considerably improved implementation; now
9940 includes concrete syntax for record types, terms, updates; theorems
9941 for surjective pairing and splitting !!-bound record variables; proof
9942 support is as follows:
9944 1) standard conversions (selectors or updates applied to record
9945 constructor terms) are part of the standard simpset;
9947 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
9948 made part of standard simpset and claset via addIffs;
9950 3) a tactic for record field splitting (record_split_tac) is part of
9951 the standard claset (addSWrapper);
9953 To get a better idea about these rules you may retrieve them via
9954 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
9955 the name of your record type.
9957 The split tactic 3) conceptually simplifies by the following rule:
9959 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
9961 Thus any record variable that is bound by meta-all will automatically
9962 blow up into some record constructor term, consequently the
9963 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
9964 solve record problems automatically.
9967 * reorganized the main HOL image: HOL/Integ and String loaded by
9968 default; theory Main includes everything;
9970 * automatic simplification of integer sums and comparisons, using cancellation;
9972 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
9974 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
9976 * many new identities for unions, intersections, set difference, etc.;
9978 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
9979 called split_if, split_split, split_sum_case and split_nat_case (to go
9980 with add/delsplits);
9982 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
9983 (?x::unit) = (); this is made part of the default simpset, which COULD
9984 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
9985 'Delsimprocs [unit_eq_proc];' as last resort); also note that
9986 unit_abs_eta_conv is added in order to counter the effect of
9987 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
9990 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
9993 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
9994 It and 'sym RS equals0D' are now in the default claset, giving automatic
9995 disjointness reasoning but breaking a few old proofs.
9997 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
9998 to 'converse' from 'inverse' (for compatibility with ZF and some
10001 * HOL/recdef can now declare non-recursive functions, with {} supplied as
10002 the well-founded relation;
10004 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
10005 Compl A. The "Compl" syntax remains available as input syntax for this
10008 * HOL/Update: new theory of function updates:
10009 f(a:=b) == %x. if x=a then b else f x
10010 may also be iterated as in f(a:=b,c:=d,...);
10012 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
10015 - new function list_update written xs[i:=v] that updates the i-th
10016 list position. May also be iterated as in xs[i:=a,j:=b,...].
10017 - new function `upt' written [i..j(] which generates the list
10018 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
10019 bound write [i..j], which is a shorthand for [i..j+1(].
10020 - new lexicographic orderings and corresponding wellfoundedness theorems.
10023 - removed 'pred' (predecessor) function;
10024 - generalized some theorems about n-1;
10025 - many new laws about "div" and "mod";
10026 - new laws about greatest common divisors (see theory ex/Primes);
10028 * HOL/Relation: renamed the relational operator r^-1 "converse"
10029 instead of "inverse";
10031 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
10032 of the multiset ordering;
10034 * directory HOL/Real: a construction of the reals using Dedekind cuts
10035 (not included by default);
10037 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
10039 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
10040 programs, i.e. different program variables may have different types.
10042 * calling (stac rew i) now fails if "rew" has no effect on the goal
10043 [previously, this check worked only if the rewrite rule was unconditional]
10044 Now rew can involve either definitions or equalities (either == or =).
10049 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
10050 only the theorems proved on ZF.ML;
10052 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
10053 It and 'sym RS equals0D' are now in the default claset, giving automatic
10054 disjointness reasoning but breaking a few old proofs.
10056 * ZF/Update: new theory of function updates
10057 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
10058 may also be iterated as in f(a:=b,c:=d,...);
10060 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
10062 * calling (stac rew i) now fails if "rew" has no effect on the goal
10063 [previously, this check worked only if the rewrite rule was unconditional]
10064 Now rew can involve either definitions or equalities (either == or =).
10066 * case_tac provided for compatibility with HOL
10067 (like the old excluded_middle_tac, but with subgoals swapped)
10070 *** Internal programming interfaces ***
10072 * Pure: several new basic modules made available for general use, see
10073 also src/Pure/README;
10075 * improved the theory data mechanism to support encapsulation (data
10076 kind name replaced by private Object.kind, acting as authorization
10077 key); new type-safe user interface via functor TheoryDataFun; generic
10078 print_data function becomes basically useless;
10080 * removed global_names compatibility flag -- all theory declarations
10081 are qualified by default;
10083 * module Pure/Syntax now offers quote / antiquote translation
10084 functions (useful for Hoare logic etc. with implicit dependencies);
10085 see HOL/ex/Antiquote for an example use;
10087 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
10090 * new tactical CHANGED_GOAL for checking that a tactic modifies a
10093 * Display.print_goals function moved to Locale.print_goals;
10095 * standard print function for goals supports current_goals_markers
10096 variable for marking begin of proof, end of proof, start of goal; the
10097 default is ("", "", ""); setting current_goals_markers := ("<proof>",
10098 "</proof>", "<goal>") causes SGML like tagged proof state printing,
10103 New in Isabelle98 (January 1998)
10104 --------------------------------
10106 *** Overview of INCOMPATIBILITIES (see below for more details) ***
10108 * changed lexical syntax of terms / types: dots made part of long
10109 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
10111 * simpset (and claset) reference variable replaced by functions
10112 simpset / simpset_ref;
10114 * no longer supports theory aliases (via merge) and non-trivial
10115 implicit merge of thms' signatures;
10117 * most internal names of constants changed due to qualified names;
10119 * changed Pure/Sequence interface (see Pure/seq.ML);
10122 *** General Changes ***
10124 * hierachically structured name spaces (for consts, types, axms, thms
10125 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
10126 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
10127 isatool fixdots ensures space after dots (e.g. "%x. x"); set
10128 long_names for fully qualified output names; NOTE: ML programs
10129 (special tactics, packages etc.) referring to internal names may have
10130 to be adapted to cope with fully qualified names; in case of severe
10131 backward campatibility problems try setting 'global_names' at compile
10132 time to have enrything declared within a flat name space; one may also
10133 fine tune name declarations in theories via the 'global' and 'local'
10136 * reimplemented the implicit simpset and claset using the new anytype
10137 data filed in signatures; references simpset:simpset ref etc. are
10138 replaced by functions simpset:unit->simpset and
10139 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
10140 to patch your ML files accordingly;
10142 * HTML output now includes theory graph data for display with Java
10143 applet or isatool browser; data generated automatically via isatool
10144 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
10146 * defs may now be conditional; improved rewrite_goals_tac to handle
10147 conditional equations;
10149 * defs now admits additional type arguments, using TYPE('a) syntax;
10151 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
10152 creates a new theory node; implicit merge of thms' signatures is
10153 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
10154 transfer:theory->thm->thm in (rare) cases;
10156 * improved handling of draft signatures / theories; draft thms (and
10157 ctyps, cterms) are automatically promoted to real ones;
10159 * slightly changed interfaces for oracles: admit many per theory, named
10160 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
10162 * print_goals: optional output of const types (set show_consts and
10165 * improved output of warnings (###) and errors (***);
10167 * subgoal_tac displays a warning if the new subgoal has type variables;
10169 * removed old README and Makefiles;
10171 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
10173 * removed obsolete init_pps and init_database;
10175 * deleted the obsolete tactical STATE, which was declared by
10176 fun STATE tacfun st = tacfun st st;
10178 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
10179 (which abbreviates $HOME);
10181 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
10182 use isatool fixseq to adapt your ML programs (this works for fully
10183 qualified references to the Sequence structure only!);
10185 * use_thy no longer requires writable current directory; it always
10186 reloads .ML *and* .thy file, if either one is out of date;
10189 *** Classical Reasoner ***
10191 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
10192 tactics that use classical reasoning to simplify a subgoal without
10193 splitting it into several subgoals;
10195 * Safe_tac: like safe_tac but uses the default claset;
10200 * added simplification meta rules:
10201 (asm_)(full_)simplify: simpset -> thm -> thm;
10203 * simplifier.ML no longer part of Pure -- has to be loaded by object
10206 * added prems argument to simplification procedures;
10208 * HOL, FOL, ZF: added infix function `addsplits':
10209 instead of `<simpset> setloop (split_tac <thms>)'
10210 you can simply write `<simpset> addsplits <thms>'
10215 * TYPE('a) syntax for type reflection terms;
10217 * no longer handles consts with name "" -- declare as 'syntax' instead;
10219 * pretty printer: changed order of mixfix annotation preference (again!);
10221 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
10226 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
10227 with `addloop' of the simplifier to faciliate case splitting in premises.
10229 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
10231 * HOL/Auth: new protocol proofs including some for the Internet
10234 * HOL/Map: new theory of `maps' a la VDM;
10236 * HOL/simplifier: simplification procedures nat_cancel_sums for
10237 cancelling out common nat summands from =, <, <= (in)equalities, or
10238 differences; simplification procedures nat_cancel_factor for
10239 cancelling common factor from =, <, <= (in)equalities over natural
10240 sums; nat_cancel contains both kinds of procedures, it is installed by
10241 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
10243 * HOL/simplifier: terms of the form
10244 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
10246 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
10247 and those of the form
10248 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
10250 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
10253 Each datatype `t' now comes with a theorem `split_t_case' of the form
10255 P(t_case f1 ... fn x) =
10256 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
10258 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
10261 and a theorem `split_t_case_asm' of the form
10263 P(t_case f1 ... fn x) =
10264 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
10266 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
10268 which can be added to a simpset via `addsplits'. The existing theorems
10269 expand_list_case and expand_option_case have been renamed to
10270 split_list_case and split_option_case.
10273 - `pred n' is automatically converted to `n-1'.
10274 Users are strongly encouraged not to use `pred' any longer,
10275 because it will disappear altogether at some point.
10276 - Users are strongly encouraged to write "0 < n" rather than
10277 "n ~= 0". Theorems and proof tools have been modified towards this
10281 the function "set_of_list" has been renamed "set" (and its theorems too);
10282 the function "nth" now takes its arguments in the reverse order and
10283 has acquired the infix notation "!" as in "xs!n".
10285 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
10287 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
10288 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
10290 * HOL/record: extensible records with schematic structural subtyping
10291 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
10292 still lacks various theorems and concrete record syntax;
10297 * removed "axioms" and "generated by" sections;
10299 * replaced "ops" section by extended "consts" section, which is capable of
10300 handling the continuous function space "->" directly;
10303 . proves theorems immediately and stores them in the theory,
10304 . creates hierachical name space,
10305 . now uses normal mixfix annotations (instead of cinfix...),
10306 . minor changes to some names and values (for consistency),
10307 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
10308 . separator between mutual domain defs: changed "," to "and",
10309 . improved handling of sort constraints; now they have to
10310 appear on the left-hand side of the equations only;
10312 * fixed LAM <x,y,zs>.b syntax;
10314 * added extended adm_tac to simplifier in HOLCF -- can now discharge
10315 adm (%x. P (t x)), where P is chainfinite and t continuous;
10320 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
10321 with `addloop' of the simplifier to faciliate case splitting in premises.
10323 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
10324 in HOL, they strip ALL and --> from proved theorems;
10328 New in Isabelle94-8 (May 1997)
10329 ------------------------------
10331 *** General Changes ***
10333 * new utilities to build / run / maintain Isabelle etc. (in parts
10334 still somewhat experimental); old Makefiles etc. still functional;
10336 * new 'Isabelle System Manual';
10338 * INSTALL text, together with ./configure and ./build scripts;
10340 * reimplemented type inference for greater efficiency, better error
10341 messages and clean internal interface;
10343 * prlim command for dealing with lots of subgoals (an easier way of
10344 setting goals_limit);
10349 * supports alternative (named) syntax tables (parser and pretty
10350 printer); internal interface is provided by add_modesyntax(_i);
10352 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
10353 be used in conjunction with the Isabelle symbol font; uses the
10354 "symbols" syntax table;
10356 * added token_translation interface (may translate name tokens in
10357 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
10358 the current print_mode); IMPORTANT: user print translation functions
10359 are responsible for marking newly introduced bounds
10360 (Syntax.mark_boundT);
10362 * token translations for modes "xterm" and "xterm_color" that display
10363 names in bold, underline etc. or colors (which requires a color
10366 * infixes may now be declared with names independent of their syntax;
10368 * added typed_print_translation (like print_translation, but may
10369 access type of constant);
10372 *** Classical Reasoner ***
10374 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
10375 some limitations. Blast_tac...
10376 + ignores addss, addbefore, addafter; this restriction is intrinsic
10377 + ignores elimination rules that don't have the correct format
10378 (the conclusion MUST be a formula variable)
10379 + ignores types, which can make HOL proofs fail
10380 + rules must not require higher-order unification, e.g. apply_type in ZF
10381 [message "Function Var's argument not a bound variable" relates to this]
10382 + its proof strategy is more general but can actually be slower
10384 * substitution with equality assumptions no longer permutes other
10387 * minor changes in semantics of addafter (now called addaltern); renamed
10388 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
10389 (and access functions for it);
10391 * improved combination of classical reasoner and simplifier:
10392 + functions for handling clasimpsets
10393 + improvement of addss: now the simplifier is called _after_ the
10395 + safe variant of addss called addSss: uses safe simplifications
10396 _during_ the safe steps. It is more complete as it allows multiple
10397 instantiations of unknowns (e.g. with slow_tac).
10401 * added interface for simplification procedures (functions that
10402 produce *proven* rewrite rules on the fly, depending on current
10405 * ordering on terms as parameter (used for ordered rewriting);
10407 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
10409 * the solver is now split into a safe and an unsafe part.
10410 This should be invisible for the normal user, except that the
10411 functions setsolver and addsolver have been renamed to setSolver and
10412 addSolver; added safe_asm_full_simp_tac;
10417 * a generic induction tactic `induct_tac' which works for all datatypes and
10418 also for type `nat';
10420 * a generic case distinction tactic `exhaust_tac' which works for all
10421 datatypes and also for type `nat';
10423 * each datatype comes with a function `size';
10425 * patterns in case expressions allow tuple patterns as arguments to
10426 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
10428 * primrec now also works with type nat;
10430 * recdef: a new declaration form, allows general recursive functions to be
10431 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
10433 * the constant for negation has been renamed from "not" to "Not" to
10434 harmonize with FOL, ZF, LK, etc.;
10436 * HOL/ex/LFilter theory of a corecursive "filter" functional for
10439 * HOL/Modelcheck demonstrates invocation of model checker oracle;
10441 * HOL/ex/Ring.thy declares cring_simp, which solves equational
10442 problems in commutative rings, using axiomatic type classes for + and *;
10444 * more examples in HOL/MiniML and HOL/Auth;
10446 * more default rewrite rules for quantifiers, union/intersection;
10448 * a new constant `arbitrary == @x.False';
10450 * HOLCF/IOA replaces old HOL/IOA;
10452 * HOLCF changes: derived all rules and arities
10453 + axiomatic type classes instead of classes
10454 + typedef instead of faking type definitions
10455 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
10456 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
10457 + eliminated the types void, one, tr
10458 + use unit lift and bool lift (with translations) instead of one and tr
10459 + eliminated blift from Lift3.thy (use Def instead of blift)
10460 all eliminated rules are derived as theorems --> no visible changes ;
10465 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
10466 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
10467 as ZF_cs addSIs [equalityI];
10471 New in Isabelle94-7 (November 96)
10472 ---------------------------------
10474 * allowing negative levels (as offsets) in prlev and choplev;
10476 * super-linear speedup for large simplifications;
10478 * FOL, ZF and HOL now use miniscoping: rewriting pushes
10479 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
10480 FAIL); can suppress it using the command Delsimps (ex_simps @
10481 all_simps); De Morgan laws are also now included, by default;
10483 * improved printing of ==> : ~:
10485 * new object-logic "Sequents" adds linear logic, while replacing LK
10486 and Modal (thanks to Sara Kalvala);
10488 * HOL/Auth: correctness proofs for authentication protocols;
10490 * HOL: new auto_tac combines rewriting and classical reasoning (many
10491 examples on HOL/Auth);
10493 * HOL: new command AddIffs for declaring theorems of the form P=Q to
10494 the rewriter and classical reasoner simultaneously;
10496 * function uresult no longer returns theorems in "standard" format;
10497 regain previous version by: val uresult = standard o uresult;
10501 New in Isabelle94-6
10502 -------------------
10504 * oracles -- these establish an interface between Isabelle and trusted
10505 external reasoners, which may deliver results as theorems;
10507 * proof objects (in particular record all uses of oracles);
10509 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
10511 * "constdefs" section in theory files;
10513 * "primrec" section (HOL) no longer requires names;
10515 * internal type "tactic" now simply "thm -> thm Sequence.seq";
10519 New in Isabelle94-5
10520 -------------------
10522 * reduced space requirements;
10524 * automatic HTML generation from theories;
10526 * theory files no longer require "..." (quotes) around most types;
10528 * new examples, including two proofs of the Church-Rosser theorem;
10530 * non-curried (1994) version of HOL is no longer distributed;
10534 New in Isabelle94-4
10535 -------------------
10537 * greatly reduced space requirements;
10539 * theory files (.thy) no longer require \...\ escapes at line breaks;
10541 * searchable theorem database (see the section "Retrieving theorems" on
10542 page 8 of the Reference Manual);
10544 * new examples, including Grabczewski's monumental case study of the
10547 * The previous version of HOL renamed to Old_HOL;
10549 * The new version of HOL (previously called CHOL) uses a curried syntax
10550 for functions. Application looks like f a b instead of f(a,b);
10552 * Mutually recursive inductive definitions finally work in HOL;
10554 * In ZF, pattern-matching on tuples is now available in all abstractions and
10555 translates to the operator "split";
10559 New in Isabelle94-3
10560 -------------------
10562 * new infix operator, addss, allowing the classical reasoner to
10563 perform simplification at each step of its search. Example:
10564 fast_tac (cs addss ss)
10566 * a new logic, CHOL, the same as HOL, but with a curried syntax
10567 for functions. Application looks like f a b instead of f(a,b). Also pairs
10568 look like (a,b) instead of <a,b>;
10570 * PLEASE NOTE: CHOL will eventually replace HOL!
10572 * In CHOL, pattern-matching on tuples is now available in all abstractions.
10573 It translates to the operator "split". A new theory of integers is available;
10575 * In ZF, integer numerals now denote two's-complement binary integers.
10576 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
10578 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
10579 of the Axiom of Choice;
10583 New in Isabelle94-2
10584 -------------------
10586 * Significantly faster resolution;
10588 * the different sections in a .thy file can now be mixed and repeated
10591 * Database of theorems for FOL, HOL and ZF. New
10592 commands including qed, qed_goal and bind_thm store theorems in the database.
10594 * Simple database queries: return a named theorem (get_thm) or all theorems of
10595 a given theory (thms_of), or find out what theory a theorem was proved in
10598 * Bugs fixed in the inductive definition and datatype packages;
10600 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
10601 and HOL_dup_cs obsolete;
10603 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
10606 * Simpler definition of function space in ZF;
10608 * new results about cardinal and ordinal arithmetic in ZF;
10610 * 'subtype' facility in HOL for introducing new types as subsets of existing
10613 :mode=isabelle-news:wrap=hard:maxLineLen=72: