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).
96 * Type theory is now immutable, without any special treatment of
97 drafts or linear updates (which could lead to "stale theory" errors in
98 the past). Discontinued obsolete operations like Theory.copy,
99 Theory.checkpoint, and the auxiliary type theory_ref. Minor
102 * System option "proofs" has been discontinued. Instead the global
103 state of Proofterm.proofs is persistently compiled into logic images
104 as required, notably HOL-Proofs. Users no longer need to change
105 Proofterm.proofs dynamically. Minor INCOMPATIBILITY.
107 * Syntax translation functions (print_translation etc.) always depend
108 on Proof.context. Discontinued former "(advanced)" option -- this is
109 now the default. Minor INCOMPATIBILITY.
111 * Target-sensitive commands 'interpretation' and 'sublocale'.
112 Particulary, 'interpretation' now allows for non-persistent
113 interpretation within "context ... begin ... end" blocks. See
114 "isar-ref" manual for details.
116 * Improved locales diagnostic command 'print_dependencies'.
118 * Discontinued obsolete 'axioms' command, which has been marked as
119 legacy since Isabelle2009-2. INCOMPATIBILITY, use 'axiomatization'
120 instead, while observing its uniform scope for polymorphism.
122 * Discontinued empty name bindings in 'axiomatization'.
125 * SELECT_GOAL now retains the syntactic context of the overall goal
126 state (schematic variables etc.). Potential INCOMPATIBILITY in rare
132 * Improved support for adhoc overloading of constants (see also
133 isar-ref manual and ~~/src/HOL/ex/Adhoc_Overloading_Examples.thy).
135 * Attibute 'code': 'code' now declares concrete and abstract code
136 equations uniformly. Use explicit 'code equation' and 'code abstract'
137 to distinguish both when desired.
140 - 'code_printing' unifies 'code_const' / 'code_type' / 'code_class' /
142 - 'code_identifier' declares name hints for arbitrary identifiers in
143 generated code, subsuming 'code_modulename'.
144 See the isar-ref manual for syntax diagrams, and the HOL theories
147 * Library/Polynomial.thy:
148 - Use lifting for primitive definitions.
149 - Explicit conversions from and to lists of coefficients, used for
151 - Replaced recursion operator poly_rec by fold_coeffs.
152 - Prefer pre-existing gcd operation for gcd.
154 poly_eq_iff ~> poly_eq_poly_eq_iff
156 expand_poly_eq ~> poly_eq_iff
159 * Reification and reflection:
160 - Reification is now directly available in HOL-Main in structure
162 - Reflection now handles multiple lists with variables also.
163 - The whole reflection stack has been decomposed into conversions.
166 * Weaker precendence of syntax for big intersection and union on sets,
167 in accordance with corresponding lattice operations. INCOMPATIBILITY.
169 * Nested case expressions are now translated in a separate check phase
170 rather than during parsing. The data for case combinators is separated
171 from the datatype package. The declaration attribute
172 "case_translation" can be used to register new case combinators:
174 declare [[case_translation case_combinator constructor1 ... constructorN]]
176 * Notation "{p:A. P}" now allows tuple patterns as well.
178 * Revised devices for recursive definitions over finite sets:
179 - Only one fundamental fold combinator on finite set remains:
180 Finite_Set.fold :: ('a => 'b => 'b) => 'b => 'a set => 'b
181 This is now identity on infinite sets.
182 - Locales ("mini packages") for fundamental definitions with
183 Finite_Set.fold: folding, folding_idem.
184 - Locales comm_monoid_set, semilattice_order_set and
185 semilattice_neutr_order_set for big operators on sets.
186 See theory Big_Operators for canonical examples.
187 Note that foundational constants comm_monoid_set.F and
188 semilattice_set.F correspond to former combinators fold_image
189 and fold1 respectively. These are now gone. You may use
190 those foundational constants as substitutes, but it is
191 preferable to interpret the above locales accordingly.
192 - Dropped class ab_semigroup_idem_mult (special case of lattice,
193 no longer needed in connection with Finite_Set.fold etc.)
195 card.union_inter ~> card_Un_Int [symmetric]
196 card.union_disjoint ~> card_Un_disjoint
199 * Locale hierarchy for abstract orderings and (semi)lattices.
201 * Discontinued theory src/HOL/Library/Eval_Witness.
204 * Discontinued obsolete src/HOL/IsaMakefile (considered legacy since
205 Isabelle2013). Use "isabelle build" to operate on Isabelle sessions.
207 * Numeric types mapped by default to target language numerals: natural
208 (replaces former code_numeral) and integer (replaces former code_int).
209 Conversions are available as integer_of_natural / natural_of_integer /
210 integer_of_nat / nat_of_integer (in HOL) and
211 Code_Numeral.integer_of_natural / Code_Numeral.natural_of_integer (in
212 ML). INCOMPATIBILITY.
214 * Discontinued theories Code_Integer and Efficient_Nat by a more
215 fine-grain stack of theories Code_Target_Int, Code_Binary_Nat,
216 Code_Target_Nat and Code_Target_Numeral. See the tutorial on code
217 generation for details. INCOMPATIBILITY.
219 * Introduce type class "conditionally_complete_lattice": Like a
220 complete lattice but does not assume the existence of the top and
221 bottom elements. Allows to generalize some lemmas about reals and
222 extended reals. Removed SupInf and replaced it by the instantiation
223 of conditionally_complete_lattice for real. Renamed lemmas about
224 conditionally-complete lattice from Sup_... to cSup_... and from
225 Inf_... to cInf_... to avoid hidding of similar complete lattice
228 * Introduce type class linear_continuum as combination of
229 conditionally-complete lattices and inner dense linorders which have
230 more than one element. INCOMPATIBILITY.
232 * Introduce type classes "no_top" and "no_bot" for orderings without
233 top and bottom elements.
235 * Split dense_linorder into inner_dense_order and no_top, no_bot.
237 * Complex_Main: Unify and move various concepts from
238 HOL-Multivariate_Analysis to HOL-Complex_Main.
240 - Introduce type class (lin)order_topology and linear_continuum_topology.
241 Allows to generalize theorems about limits and order.
242 Instances are reals and extended reals.
244 - continuous and continuos_on from Multivariate_Analysis:
245 "continuous" is the continuity of a function at a filter.
246 "isCont" is now an abbrevitation: "isCont x f == continuous (at _) f".
248 Generalized continuity lemmas from isCont to continuous on an arbitrary
251 - compact from Multivariate_Analysis. Use Bolzano's lemma
252 to prove compactness of closed intervals on reals. Continuous functions
253 attain infimum and supremum on compact sets. The inverse of a continuous
254 function is continuous, when the function is continuous on a compact set.
256 - connected from Multivariate_Analysis. Use it to prove the
257 intermediate value theorem. Show connectedness of intervals on
258 linear_continuum_topology).
260 - first_countable_topology from Multivariate_Analysis. Is used to
261 show equivalence of properties on the neighbourhood filter of x and on
262 all sequences converging to x.
264 - FDERIV: Definition of has_derivative moved to Deriv.thy. Moved theorems
265 from Library/FDERIV.thy to Deriv.thy and base the definition of DERIV on
266 FDERIV. Add variants of DERIV and FDERIV which are restricted to sets,
267 i.e. to represent derivatives from left or right.
269 - Removed the within-filter. It is replaced by the principal filter:
271 F within X = inf F (principal X)
273 - Introduce "at x within U" as a single constant, "at x" is now an
274 abbreviation for "at x within UNIV"
276 - Introduce named theorem collections tendsto_intros, continuous_intros,
277 continuous_on_intros and FDERIV_intros. Theorems in tendsto_intros (or
278 FDERIV_intros) are also available as tendsto_eq_intros (or
279 FDERIV_eq_intros) where the right-hand side is replaced by a congruence
280 rule. This allows to apply them as intro rules and then proving
281 equivalence by the simplifier.
283 - Restructured theories in HOL-Complex_Main:
285 + Moved RealDef and RComplete into Real
287 + Introduced Topological_Spaces and moved theorems about
288 topological spaces, filters, limits and continuity to it
290 + Renamed RealVector to Real_Vector_Spaces
292 + Split Lim, SEQ, Series into Topological_Spaces, Real_Vector_Spaces, and
295 + Moved Ln and Log to Transcendental
297 + Moved theorems about continuity from Deriv to Topological_Spaces
299 - Remove various auxiliary lemmas.
303 * Consolidation of library theories on product orders:
305 Product_Lattice ~> Product_Order -- pointwise order on products
306 Product_ord ~> Product_Lexorder -- lexicographic order on products
313 isar_shrink ~> isar_compress
315 * HOL-Spec_Check: a Quickcheck tool for Isabelle's ML environment.
317 With HOL-Spec_Check, ML developers can check specifications with the
318 ML function check_property. The specifications must be of the form
319 "ALL x1 ... xn. Prop x1 ... xn". Simple examples are in
320 src/HOL/Spec_Check/Examples.thy.
322 * Imperative-HOL: The MREC combinator is considered legacy and no
323 longer included by default. INCOMPATIBILITY, use partial_function
324 instead, or import theory Legacy_Mrec as a fallback.
326 * HOL-Algebra: Discontinued theories src/HOL/Algebra/abstract and
327 .../poly. Existing theories should be based on
328 src/HOL/Library/Polynomial instead. The latter provides integration
329 with HOL's type classes for rings. INCOMPATIBILITY.
334 * More uniform naming of goal functions for skipped proofs:
336 Skip_Proof.prove ~> Goal.prove_sorry
337 Skip_Proof.prove_global ~> Goal.prove_sorry_global
339 * Antiquotation @{theory_context A} is similar to @{theory A}, but
340 presents the result as initial Proof.context.
342 * Modifiers for classical wrappers (e.g. addWrapper, delWrapper)
343 operate on Proof.context instead of claset, for uniformity with addIs,
344 addEs, addDs etc. Note that claset_of and put_claset allow to manage
345 clasets separately from the context.
347 * Simplifier tactics and tools use proper Proof.context instead of
348 historic type simpset. Old-style declarations like addsimps,
349 addsimprocs etc. operate directly on Proof.context. Raw type simpset
350 retains its use as snapshot of the main Simplifier context, using
351 simpset_of and put_simpset on Proof.context. INCOMPATIBILITY -- port
352 old tools by making them depend on (ctxt : Proof.context) instead of
353 (ss : simpset), then turn (simpset_of ctxt) into ctxt.
355 * Discontinued obsolete ML antiquotations @{claset} and @{simpset}.
356 INCOMPATIBILITY, use @{context} instead.
361 * Discontinued obsolete isabelle usedir, mkdir, make -- superseded by
362 "isabelle build" in Isabelle2013. INCOMPATIBILITY.
364 * Discontinued obsolete isabelle-process options -f and -u (former
365 administrative aliases of option -e). Minor INCOMPATIBILITY.
367 * Discontinued obsolete isabelle print tool, and PRINT_COMMAND
370 * Discontinued ISABELLE_DOC_FORMAT settings variable and historic
371 document formats: dvi.gz, ps, ps.gz -- the default document format is
374 * Isabelle settings variable ISABELLE_BUILD_JAVA_OPTIONS allows to
375 specify global resources of the JVM process run by isabelle build.
377 * Toplevel executable $ISABELLE_HOME/bin/isabelle_scala_script allows
378 to run Isabelle/Scala source files as standalone programs.
380 * Improved "isabelle keywords" tool (for old-style ProofGeneral
381 keyword tables): use Isabelle/Scala operations, which inspect outer
382 syntax without requiring to build sessions first.
386 New in Isabelle2013 (February 2013)
387 -----------------------------------
391 * Theorem status about oracles and unfinished/failed future proofs is
392 no longer printed by default, since it is incompatible with
393 incremental / parallel checking of the persistent document model. ML
394 function Thm.peek_status may be used to inspect a snapshot of the
395 ongoing evaluation process. Note that in batch mode --- notably
396 isabelle build --- the system ensures that future proofs of all
397 accessible theorems in the theory context are finished (as before).
399 * Configuration option show_markup controls direct inlining of markup
400 into the printed representation of formal entities --- notably type
401 and sort constraints. This enables Prover IDE users to retrieve that
402 information via tooltips in the output window, for example.
404 * Command 'ML_file' evaluates ML text from a file directly within the
405 theory, without any predeclaration via 'uses' in the theory header.
407 * Old command 'use' command and corresponding keyword 'uses' in the
408 theory header are legacy features and will be discontinued soon.
409 Tools that load their additional source files may imitate the
410 'ML_file' implementation, such that the system can take care of
411 dependencies properly.
413 * Discontinued obsolete method fastsimp / tactic fast_simp_tac, which
414 is called fastforce / fast_force_tac already since Isabelle2011-1.
416 * Updated and extended "isar-ref" and "implementation" manual, reduced
417 remaining material in old "ref" manual.
419 * Improved support for auxiliary contexts that indicate block structure
420 for specifications. Nesting of "context fixes ... context assumes ..."
421 and "class ... context ...".
423 * Attribute "consumes" allows a negative value as well, which is
424 interpreted relatively to the total number of premises of the rule in
425 the target context. This form of declaration is stable when exported
426 from a nested 'context' with additional assumptions. It is the
427 preferred form for definitional packages, notably cases/rules produced
428 in HOL/inductive and HOL/function.
430 * More informative error messages for Isar proof commands involving
431 lazy enumerations (method applications etc.).
433 * Refined 'help' command to retrieve outer syntax commands according
434 to name patterns (with clickable results).
437 *** Prover IDE -- Isabelle/Scala/jEdit ***
439 * Parallel terminal proofs ('by') are enabled by default, likewise
440 proofs that are built into packages like 'datatype', 'function'. This
441 allows to "run ahead" checking the theory specifications on the
442 surface, while the prover is still crunching on internal
443 justifications. Unfinished / cancelled proofs are restarted as
444 required to complete full proof checking eventually.
446 * Improved output panel with tooltips, hyperlinks etc. based on the
447 same Rich_Text_Area as regular Isabelle/jEdit buffers. Activation of
448 tooltips leads to some window that supports the same recursively,
449 which can lead to stacks of tooltips as the semantic document content
450 is explored. ESCAPE closes the whole stack, individual windows may be
451 closed separately, or detached to become independent jEdit dockables.
453 * Improved support for commands that produce graph output: the text
454 message contains a clickable area to open a new instance of the graph
457 * More robust incremental parsing of outer syntax (partial comments,
458 malformed symbols). Changing the balance of open/close quotes and
459 comment delimiters works more conveniently with unfinished situations
460 that frequently occur in user interaction.
462 * More efficient painting and improved reactivity when editing large
463 files. More scalable management of formal document content.
465 * Smarter handling of tracing messages: prover process pauses after
466 certain number of messages per command transaction, with some user
467 dialog to stop or continue. This avoids swamping the front-end with
468 potentially infinite message streams.
470 * More plugin options and preferences, based on Isabelle/Scala. The
471 jEdit plugin option panel provides access to some Isabelle/Scala
472 options, including tuning parameters for editor reactivity and color
475 * Dockable window "Symbols" provides some editing support for Isabelle
478 * Dockable window "Monitor" shows ML runtime statistics. Note that
479 continuous display of the chart slows down the system.
481 * Improved editing support for control styles: subscript, superscript,
482 bold, reset of style -- operating on single symbols or text
483 selections. Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT.
485 * Actions isabelle.increase-font-size and isabelle.decrease-font-size
486 adjust the main text area font size, and its derivatives for output,
487 tooltips etc. Cf. keyboard shortcuts C-PLUS and C-MINUS, which often
488 need to be adapted to local keyboard layouts.
490 * More reactive completion popup by default: use \t (TAB) instead of
491 \n (NEWLINE) to minimize intrusion into regular flow of editing. See
492 also "Plugin Options / SideKick / General / Code Completion Options".
494 * Implicit check and build dialog of the specified logic session
495 image. For example, HOL, HOLCF, HOL-Nominal can be produced on
496 demand, without bundling big platform-dependent heap images in the
497 Isabelle distribution.
499 * Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates
500 from Oracle provide better multi-platform experience. This version is
501 now bundled exclusively with Isabelle.
506 * Code generation for Haskell: restrict unqualified imports from
507 Haskell Prelude to a small set of fundamental operations.
509 * Command 'export_code': relative file names are interpreted
510 relatively to master directory of current theory rather than the
511 rather arbitrary current working directory. INCOMPATIBILITY.
513 * Discontinued obsolete attribute "COMP". Potential INCOMPATIBILITY,
514 use regular rule composition via "OF" / "THEN", or explicit proof
515 structure instead. Note that Isabelle/ML provides a variety of
516 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied
517 with some care where this is really required.
519 * Command 'typ' supports an additional variant with explicit sort
520 constraint, to infer and check the most general type conforming to a
521 given sort. Example (in HOL):
523 typ "_ * _ * bool * unit" :: finite
525 * Command 'locale_deps' visualizes all locales and their relations as
533 - Added MaSh relevance filter based on machine-learning; see the
534 Sledgehammer manual for details.
535 - Polished Isar proofs generated with "isar_proofs" option.
536 - Rationalized type encodings ("type_enc" option).
537 - Renamed "kill_provers" subcommand to "kill_all".
539 isar_proof ~> isar_proofs
540 isar_shrink_factor ~> isar_shrink
541 max_relevant ~> max_facts
542 relevance_thresholds ~> fact_thresholds
544 * Quickcheck: added an optimisation for equality premises. It is
545 switched on by default, and can be switched off by setting the
546 configuration quickcheck_optimise_equality to false.
548 * Quotient: only one quotient can be defined by quotient_type
552 - generation of an abstraction function equation in lift_definition
554 - renamed no_abs_code -> no_code (INCOMPATIBILITY.)
556 * Simproc "finite_Collect" rewrites set comprehensions into pointfree
559 * Preprocessing of the code generator rewrites set comprehensions into
560 pointfree expressions.
562 * The SMT solver Z3 has now by default a restricted set of directly
563 supported features. For the full set of features (div/mod, nonlinear
564 arithmetic, datatypes/records) with potential proof reconstruction
565 failures, enable the configuration option "z3_with_extensions". Minor
568 * Simplified 'typedef' specifications: historical options for implicit
569 set definition and alternative name have been discontinued. The
570 former behavior of "typedef (open) t = A" is now the default, but
571 written just "typedef t = A". INCOMPATIBILITY, need to adapt theories
574 * Removed constant "chars"; prefer "Enum.enum" on type "char"
575 directly. INCOMPATIBILITY.
577 * Moved operation product, sublists and n_lists from theory Enum to
578 List. INCOMPATIBILITY.
580 * Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY.
582 * Class "comm_monoid_diff" formalises properties of bounded
583 subtraction, with natural numbers and multisets as typical instances.
585 * Added combinator "Option.these" with type "'a option set => 'a set".
587 * Theory "Transitive_Closure": renamed lemmas
589 reflcl_tranclp -> reflclp_tranclp
590 rtranclp_reflcl -> rtranclp_reflclp
594 * Theory "Rings": renamed lemmas (in class semiring)
596 left_distrib ~> distrib_right
597 right_distrib ~> distrib_left
601 * Generalized the definition of limits:
603 - Introduced the predicate filterlim (LIM x F. f x :> G) which
604 expresses that when the input values x converge to F then the
605 output f x converges to G.
607 - Added filters for convergence to positive (at_top) and negative
610 - Moved infinity in the norm (at_infinity) from
611 Multivariate_Analysis to Complex_Main.
613 - Removed real_tendsto_inf, it is superseded by "LIM x F. f x :>
618 * Theory "Library/Option_ord" provides instantiation of option type to
619 lattice type classes.
621 * Theory "Library/Multiset": renamed
623 constant fold_mset ~> Multiset.fold
624 fact fold_mset_commute ~> fold_mset_comm
628 * Renamed theory Library/List_Prefix to Library/Sublist, with related
631 - Renamed constants (and related lemmas)
634 strict_prefix ~> prefix
636 - Replaced constant "postfix" by "suffixeq" with swapped argument
637 order (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped
638 old infix syntax "xs >>= ys"; use "suffixeq ys xs" instead.
639 Renamed lemmas accordingly.
641 - Added constant "list_hembeq" for homeomorphic embedding on
642 lists. Added abbreviation "sublisteq" for special case
643 "list_hembeq (op =)".
645 - Theory Library/Sublist no longer provides "order" and "bot" type
646 class instances for the prefix order (merely corresponding locale
647 interpretations). The type class instances are now in theory
648 Library/Prefix_Order.
650 - The sublist relation of theory Library/Sublist_Order is now based
651 on "Sublist.sublisteq". Renamed lemmas accordingly:
653 le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff
654 le_list_append_mono ~> Sublist.list_hembeq_append_mono
655 le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2
656 le_list_Cons_EX ~> Sublist.list_hembeq_ConsD
657 le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2'
658 le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq
659 le_list_drop_Cons ~> Sublist.sublisteq_Cons'
660 le_list_drop_many ~> Sublist.sublisteq_drop_many
661 le_list_filter_left ~> Sublist.sublisteq_filter_left
662 le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many
663 le_list_rev_take_iff ~> Sublist.sublisteq_append
664 le_list_same_length ~> Sublist.sublisteq_same_length
665 le_list_take_many_iff ~> Sublist.sublisteq_append'
666 less_eq_list.drop ~> less_eq_list_drop
667 less_eq_list.induct ~> less_eq_list_induct
668 not_le_list_length ~> Sublist.not_sublisteq_length
672 * New theory Library/Countable_Set.
674 * Theory Library/Debug and Library/Parallel provide debugging and
675 parallel execution for code generated towards Isabelle/ML.
677 * Theory Library/FuncSet: Extended support for Pi and extensional and
678 introduce the extensional dependent function space "PiE". Replaced
679 extensional_funcset by an abbreviation, and renamed lemmas from
680 extensional_funcset to PiE as follows:
682 extensional_empty ~> PiE_empty
683 extensional_funcset_empty_domain ~> PiE_empty_domain
684 extensional_funcset_empty_range ~> PiE_empty_range
685 extensional_funcset_arb ~> PiE_arb
686 extensional_funcset_mem ~> PiE_mem
687 extensional_funcset_extend_domainI ~> PiE_fun_upd
688 extensional_funcset_restrict_domain ~> fun_upd_in_PiE
689 extensional_funcset_extend_domain_eq ~> PiE_insert_eq
690 card_extensional_funcset ~> card_PiE
691 finite_extensional_funcset ~> finite_PiE
695 * Theory Library/FinFun: theory of almost everywhere constant
696 functions (supersedes the AFP entry "Code Generation for Functions as
699 * Theory Library/Phantom: generic phantom type to make a type
700 parameter appear in a constant's type. This alternative to adding
701 TYPE('a) as another parameter avoids unnecessary closures in generated
704 * Theory Library/RBT_Impl: efficient construction of red-black trees
705 from sorted associative lists. Merging two trees with rbt_union may
706 return a structurally different tree than before. Potential
709 * Theory Library/IArray: immutable arrays with code generation.
711 * Theory Library/Finite_Lattice: theory of finite lattices.
713 * HOL/Multivariate_Analysis: replaced
715 "basis :: 'a::euclidean_space => nat => real"
716 "\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space"
718 on euclidean spaces by using the inner product "_ \<bullet> _" with
719 vectors from the Basis set: "\<Chi>\<Chi> i. f i" is superseded by
720 "SUM i : Basis. f i * r i".
722 With this change the following constants are also changed or removed:
724 DIM('a) :: nat ~> card (Basis :: 'a set) (is an abbreviation)
725 a $$ i ~> inner a i (where i : Basis)
727 \<pi>, \<pi>' removed
729 Theorems about these constants where removed.
733 component_le_norm ~> Basis_le_norm
734 euclidean_eq ~> euclidean_eq_iff
735 differential_zero_maxmin_component ~> differential_zero_maxmin_cart
736 euclidean_simps ~> inner_simps
737 independent_basis ~> independent_Basis
738 span_basis ~> span_Basis
739 in_span_basis ~> in_span_Basis
740 norm_bound_component_le ~> norm_boound_Basis_le
741 norm_bound_component_lt ~> norm_boound_Basis_lt
742 component_le_infnorm ~> Basis_le_infnorm
748 - Added simproc "measurable" to automatically prove measurability.
750 - Added induction rules for sigma sets with disjoint union
751 (sigma_sets_induct_disjoint) and for Borel-measurable functions
752 (borel_measurable_induct).
754 - Added the Daniell-Kolmogorov theorem (the existence the limit of a
757 * HOL/Cardinals: Theories of ordinals and cardinals (supersedes the
758 AFP entry "Ordinals_and_Cardinals").
760 * HOL/BNF: New (co)datatype package based on bounded natural functors
761 with support for mixed, nested recursion and interesting non-free
764 * HOL/Finite_Set and Relation: added new set and relation operations
765 expressed by Finite_Set.fold.
767 * New theory HOL/Library/RBT_Set: implementation of sets by red-black
768 trees for the code generator.
770 * HOL/Library/RBT and HOL/Library/Mapping have been converted to
772 possible INCOMPATIBILITY.
774 * HOL/Set: renamed Set.project -> Set.filter
778 *** Document preparation ***
780 * Dropped legacy antiquotations "term_style" and "thm_style", since
781 styles may be given as arguments to "term" and "thm" already.
782 Discontinued legacy styles "prem1" .. "prem19".
784 * Default LaTeX rendering for \<euro> is now based on eurosym package,
785 instead of slightly exotic babel/greek.
787 * Document variant NAME may use different LaTeX entry point
788 document/root_NAME.tex if that file exists, instead of the common
791 * Simplified custom document/build script, instead of old-style
792 document/IsaMakefile. Minor INCOMPATIBILITY.
797 * The default limit for maximum number of worker threads is now 8,
798 instead of 4, in correspondence to capabilities of contemporary
799 hardware and Poly/ML runtime system.
801 * Type Seq.results and related operations support embedded error
802 messages within lazy enumerations, and thus allow to provide
803 informative errors in the absence of any usable results.
805 * Renamed Position.str_of to Position.here to emphasize that this is a
806 formal device to inline positions into message text, but not
807 necessarily printing visible text.
812 * Advanced support for Isabelle sessions and build management, see
813 "system" manual for the chapter of that name, especially the "isabelle
814 build" tool and its examples. The "isabelle mkroot" tool prepares
815 session root directories for use with "isabelle build", similar to
816 former "isabelle mkdir" for "isabelle usedir". Note that this affects
817 document preparation as well. INCOMPATIBILITY, isabelle usedir /
818 mkdir / make are rendered obsolete.
820 * Discontinued obsolete Isabelle/build script, it is superseded by the
821 regular isabelle build tool. For example:
823 isabelle build -s -b HOL
825 * Discontinued obsolete "isabelle makeall".
827 * Discontinued obsolete IsaMakefile and ROOT.ML files from the
828 Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that
829 provides some traditional targets that invoke "isabelle build". Note
830 that this is inefficient! Applications of Isabelle/HOL involving
831 "isabelle make" should be upgraded to use "isabelle build" directly.
833 * The "isabelle options" tool prints Isabelle system options, as
834 required for "isabelle build", for example.
836 * The "isabelle logo" tool produces EPS and PDF format simultaneously.
837 Minor INCOMPATIBILITY in command-line options.
839 * The "isabelle install" tool has now a simpler command-line. Minor
842 * The "isabelle components" tool helps to resolve add-on components
843 that are not bundled, or referenced from a bare-bones repository
846 * Settings variable ISABELLE_PLATFORM_FAMILY refers to the general
847 platform family: "linux", "macos", "windows".
849 * The ML system is configured as regular component, and no longer
850 picked up from some surrounding directory. Potential INCOMPATIBILITY
851 for home-made settings.
853 * Improved ML runtime statistics (heap, threads, future tasks etc.).
855 * Discontinued support for Poly/ML 5.2.1, which was the last version
856 without exception positions and advanced ML compiler/toplevel
859 * Discontinued special treatment of Proof General -- no longer guess
860 PROOFGENERAL_HOME based on accidental file-system layout. Minor
861 INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS
862 settings manually, or use a Proof General version that has been
863 bundled as Isabelle component.
867 New in Isabelle2012 (May 2012)
868 ------------------------------
872 * Prover IDE (PIDE) improvements:
874 - more robust Sledgehammer integration (as before the sledgehammer
875 command-line needs to be typed into the source buffer)
876 - markup for bound variables
877 - markup for types of term variables (displayed as tooltips)
878 - support for user-defined Isar commands within the running session
879 - improved support for Unicode outside original 16bit range
880 e.g. glyph for \<A> (thanks to jEdit 4.5.1)
882 * Forward declaration of outer syntax keywords within the theory
883 header -- minor INCOMPATIBILITY for user-defined commands. Allow new
884 commands to be used in the same theory where defined.
886 * Auxiliary contexts indicate block structure for specifications with
887 additional parameters and assumptions. Such unnamed contexts may be
888 nested within other targets, like 'theory', 'locale', 'class',
889 'instantiation' etc. Results from the local context are generalized
890 accordingly and applied to the enclosing target context. Example:
894 assumes xy: "x = y" and yz: "y = z"
897 lemma my_trans: "x = z" using xy yz by simp
903 The most basic application is to factor-out context elements of
904 several fixes/assumes/shows theorem statements, e.g. see
905 ~~/src/HOL/Isar_Examples/Group_Context.thy
907 Any other local theory specification element works within the "context
908 ... begin ... end" block as well.
910 * Bundled declarations associate attributed fact expressions with a
911 given name in the context. These may be later included in other
912 contexts. This allows to manage context extensions casually, without
913 the logical dependencies of locales and locale interpretation. See
914 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.
916 * Commands 'lemmas' and 'theorems' allow local variables using 'for'
917 declaration, and results are standardized before being stored. Thus
918 old-style "standard" after instantiation or composition of facts
919 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of
920 indices of schematic variables.
922 * Rule attributes in local theory declarations (e.g. locale or class)
923 are now statically evaluated: the resulting theorem is stored instead
924 of the original expression. INCOMPATIBILITY in rare situations, where
925 the historic accident of dynamic re-evaluation in interpretations
928 * New tutorial "Programming and Proving in Isabelle/HOL"
929 ("prog-prove"). It completely supersedes "A Tutorial Introduction to
930 Structured Isar Proofs" ("isar-overview"), which has been removed. It
931 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order
932 Logic" as the recommended beginners tutorial, but does not cover all
933 of the material of that old tutorial.
935 * Updated and extended reference manuals: "isar-ref",
936 "implementation", "system"; reduced remaining material in old "ref"
942 * Command 'definition' no longer exports the foundational "raw_def"
943 into the user context. Minor INCOMPATIBILITY, may use the regular
944 "def" result with attribute "abs_def" to imitate the old version.
946 * Attribute "abs_def" turns an equation of the form "f x y == t" into
947 "f == %x y. t", which ensures that "simp" or "unfold" steps always
948 expand it. This also works for object-logic equality. (Formerly
949 undocumented feature.)
951 * Sort constraints are now propagated in simultaneous statements, just
952 like type constraints. INCOMPATIBILITY in rare situations, where
953 distinct sorts used to be assigned accidentally. For example:
955 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"
957 lemma "P (x::'a)" and "Q (y::'a::bar)"
958 -- "now uniform 'a::bar instead of default sort for first occurrence (!)"
960 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more
961 tolerant against multiple unifiers, as long as the final result is
962 unique. (As before, rules are composed in canonical right-to-left
963 order to accommodate newly introduced premises.)
965 * Renamed some inner syntax categories:
971 Minor INCOMPATIBILITY. Note that in practice "num_const" or
972 "num_position" etc. are mainly used instead (which also include
973 position information via constraints).
975 * Simplified configuration options for syntax ambiguity: see
976 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
977 manual. Minor INCOMPATIBILITY.
979 * Discontinued configuration option "syntax_positions": atomic terms
980 in parse trees are always annotated by position constraints.
982 * Old code generator for SML and its commands 'code_module',
983 'code_library', 'consts_code', 'types_code' have been discontinued.
984 Use commands of the generic code generator instead. INCOMPATIBILITY.
986 * Redundant attribute "code_inline" has been discontinued. Use
987 "code_unfold" instead. INCOMPATIBILITY.
989 * Dropped attribute "code_unfold_post" in favor of the its dual
990 "code_abbrev", which yields a common pattern in definitions like
992 definition [code_abbrev]: "f = t"
996 * Obsolete 'types' command has been discontinued. Use 'type_synonym'
997 instead. INCOMPATIBILITY.
999 * Discontinued old "prems" fact, which used to refer to the accidental
1000 collection of foundational premises in the context (already marked as
1001 legacy since Isabelle2011).
1006 * Type 'a set is now a proper type constructor (just as before
1007 Isabelle2008). Definitions mem_def and Collect_def have disappeared.
1008 Non-trivial INCOMPATIBILITY. For developments keeping predicates and
1009 sets separate, it is often sufficient to rephrase some set S that has
1010 been accidentally used as predicates by "%x. x : S", and some
1011 predicate P that has been accidentally used as set by "{x. P x}".
1012 Corresponding proofs in a first step should be pruned from any
1013 tinkering with former theorems mem_def and Collect_def as far as
1016 For developments which deliberately mix predicates and sets, a
1017 planning step is necessary to determine what should become a predicate
1018 and what a set. It can be helpful to carry out that step in
1019 Isabelle2011-1 before jumping right into the current release.
1021 * Code generation by default implements sets as container type rather
1022 than predicates. INCOMPATIBILITY.
1024 * New type synonym 'a rel = ('a * 'a) set
1026 * The representation of numerals has changed. Datatype "num"
1027 represents strictly positive binary numerals, along with functions
1028 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent
1029 positive and negated numeric literals, respectively. See also
1030 definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some
1031 user theories may require adaptations as follows:
1033 - Theorems with number_ring or number_semiring constraints: These
1034 classes are gone; use comm_ring_1 or comm_semiring_1 instead.
1036 - Theories defining numeric types: Remove number, number_semiring,
1037 and number_ring instances. Defer all theorems about numerals until
1038 after classes one and semigroup_add have been instantiated.
1040 - Numeral-only simp rules: Replace each rule having a "number_of v"
1041 pattern with two copies, one for numeral and one for neg_numeral.
1043 - Theorems about subclasses of semiring_1 or ring_1: These classes
1044 automatically support numerals now, so more simp rules and
1045 simprocs may now apply within the proof.
1047 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:
1048 Redefine using other integer operations.
1050 * Transfer: New package intended to generalize the existing
1051 "descending" method and related theorem attributes from the Quotient
1052 package. (Not all functionality is implemented yet, but future
1053 development will focus on Transfer as an eventual replacement for the
1054 corresponding parts of the Quotient package.)
1056 - transfer_rule attribute: Maintains a collection of transfer rules,
1057 which relate constants at two different types. Transfer rules may
1058 relate different type instances of the same polymorphic constant,
1059 or they may relate an operation on a raw type to a corresponding
1060 operation on an abstract type (quotient or subtype). For example:
1062 ((A ===> B) ===> list_all2 A ===> list_all2 B) map map
1063 (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int
1065 - transfer method: Replaces a subgoal on abstract types with an
1066 equivalent subgoal on the corresponding raw types. Constants are
1067 replaced with corresponding ones according to the transfer rules.
1068 Goals are generalized over all free variables by default; this is
1069 necessary for variables whose types change, but can be overridden
1070 for specific variables with e.g. "transfer fixing: x y z". The
1071 variant transfer' method allows replacing a subgoal with one that
1072 is logically stronger (rather than equivalent).
1074 - relator_eq attribute: Collects identity laws for relators of
1075 various type constructors, e.g. "list_all2 (op =) = (op =)". The
1076 transfer method uses these lemmas to infer transfer rules for
1077 non-polymorphic constants on the fly.
1079 - transfer_prover method: Assists with proving a transfer rule for a
1080 new constant, provided the constant is defined in terms of other
1081 constants that already have transfer rules. It should be applied
1082 after unfolding the constant definitions.
1084 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer
1085 from type nat to type int.
1087 * Lifting: New package intended to generalize the quotient_definition
1088 facility of the Quotient package; designed to work with Transfer.
1090 - lift_definition command: Defines operations on an abstract type in
1091 terms of a corresponding operation on a representation
1092 type. Example syntax:
1094 lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"
1097 Users must discharge a respectfulness proof obligation when each
1098 constant is defined. (For a type copy, i.e. a typedef with UNIV,
1099 the proof is discharged automatically.) The obligation is
1100 presented in a user-friendly, readable form; a respectfulness
1101 theorem in the standard format and a transfer rule are generated
1104 - Integration with code_abstype: For typedefs (e.g. subtypes
1105 corresponding to a datatype invariant, such as dlist),
1106 lift_definition generates a code certificate theorem and sets up
1107 code generation for each constant.
1109 - setup_lifting command: Sets up the Lifting package to work with a
1110 user-defined type. The user must provide either a quotient theorem
1111 or a type_definition theorem. The package configures transfer
1112 rules for equality and quantifiers on the type, and sets up the
1113 lift_definition command to work with the type.
1115 - Usage examples: See Quotient_Examples/Lift_DList.thy,
1116 Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,
1117 Word/Word.thy and Library/Float.thy.
1121 - The 'quotient_type' command now supports a 'morphisms' option with
1122 rep and abs functions, similar to typedef.
1124 - 'quotient_type' sets up new types to work with the Lifting and
1125 Transfer packages, as with 'setup_lifting'.
1127 - The 'quotient_definition' command now requires the user to prove a
1128 respectfulness property at the point where the constant is
1129 defined, similar to lift_definition; INCOMPATIBILITY.
1131 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems
1132 accordingly, INCOMPATIBILITY.
1134 * New diagnostic command 'find_unused_assms' to find potentially
1135 superfluous assumptions in theorems using Quickcheck.
1139 - Quickcheck returns variable assignments as counterexamples, which
1140 allows to reveal the underspecification of functions under test.
1141 For example, refuting "hd xs = x", it presents the variable
1142 assignment xs = [] and x = a1 as a counterexample, assuming that
1143 any property is false whenever "hd []" occurs in it.
1145 These counterexample are marked as potentially spurious, as
1146 Quickcheck also returns "xs = []" as a counterexample to the
1147 obvious theorem "hd xs = hd xs".
1149 After finding a potentially spurious counterexample, Quickcheck
1150 continues searching for genuine ones.
1152 By default, Quickcheck shows potentially spurious and genuine
1153 counterexamples. The option "genuine_only" sets quickcheck to only
1154 show genuine counterexamples.
1156 - The command 'quickcheck_generator' creates random and exhaustive
1157 value generators for a given type and operations.
1159 It generates values by using the operations as if they were
1160 constructors of that type.
1162 - Support for multisets.
1164 - Added "use_subtype" options.
1166 - Added "quickcheck_locale" configuration to specify how to process
1167 conjectures in a locale context.
1169 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option
1170 and affecting 'rat' and 'real'.
1173 - Integrated more tightly with SPASS, as described in the ITP 2012
1174 paper "More SPASS with Isabelle".
1175 - Made it try "smt" as a fallback if "metis" fails or times out.
1176 - Added support for the following provers: Alt-Ergo (via Why3 and
1177 TFF1), iProver, iProver-Eq.
1178 - Sped up the minimizer.
1179 - Added "lam_trans", "uncurry_aliases", and "minimize" options.
1180 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
1181 - Renamed "sound" option to "strict".
1183 * Metis: Added possibility to specify lambda translations scheme as a
1184 parenthesized argument (e.g., "by (metis (lifting) ...)").
1186 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".
1188 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.
1190 * New "case_product" attribute to generate a case rule doing multiple
1191 case distinctions at the same time. E.g.
1193 list.exhaust [case_product nat.exhaust]
1195 produces a rule which can be used to perform case distinction on both
1198 * New "eventually_elim" method as a generalized variant of the
1199 eventually_elim* rules. Supports structured proofs.
1201 * Typedef with implicit set definition is considered legacy. Use
1202 "typedef (open)" form instead, which will eventually become the
1205 * Record: code generation can be switched off manually with
1207 declare [[record_coden = false]] -- "default true"
1209 * Datatype: type parameters allow explicit sort constraints.
1211 * Concrete syntax for case expressions includes constraints for source
1212 positions, and thus produces Prover IDE markup for its bindings.
1213 INCOMPATIBILITY for old-style syntax translations that augment the
1214 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
1217 * Clarified attribute "mono_set": pure declaration without modifying
1218 the result of the fact expression.
1220 * More default pred/set conversions on a couple of relation operations
1221 and predicates. Added powers of predicate relations. Consolidation
1222 of some relation theorems:
1224 converse_def ~> converse_unfold
1225 rel_comp_def ~> relcomp_unfold
1226 symp_def ~> (modified, use symp_def and sym_def instead)
1227 transp_def ~> transp_trans
1228 Domain_def ~> Domain_unfold
1229 Range_def ~> Domain_converse [symmetric]
1231 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.
1233 See theory "Relation" for examples for making use of pred/set
1234 conversions by means of attributes "to_set" and "to_pred".
1238 * Renamed facts about the power operation on relations, i.e., relpow
1239 to match the constant's name:
1241 rel_pow_1 ~> relpow_1
1242 rel_pow_0_I ~> relpow_0_I
1243 rel_pow_Suc_I ~> relpow_Suc_I
1244 rel_pow_Suc_I2 ~> relpow_Suc_I2
1245 rel_pow_0_E ~> relpow_0_E
1246 rel_pow_Suc_E ~> relpow_Suc_E
1247 rel_pow_E ~> relpow_E
1248 rel_pow_Suc_D2 ~> relpow_Suc_D2
1249 rel_pow_Suc_E2 ~> relpow_Suc_E2
1250 rel_pow_Suc_D2' ~> relpow_Suc_D2'
1251 rel_pow_E2 ~> relpow_E2
1252 rel_pow_add ~> relpow_add
1253 rel_pow_commute ~> relpow
1254 rel_pow_empty ~> relpow_empty:
1255 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
1256 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
1257 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
1258 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
1259 rel_pow_fun_conv ~> relpow_fun_conv
1260 rel_pow_finite_bounded1 ~> relpow_finite_bounded1
1261 rel_pow_finite_bounded ~> relpow_finite_bounded
1262 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
1263 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
1264 single_valued_rel_pow ~> single_valued_relpow
1268 * Theory Relation: Consolidated constant name for relation composition
1269 and corresponding theorem names:
1271 - Renamed constant rel_comp to relcomp.
1273 - Dropped abbreviation pred_comp. Use relcompp instead.
1277 rel_compI ~> relcompI
1278 rel_compEpair ~> relcompEpair
1279 rel_compE ~> relcompE
1280 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq
1281 rel_comp_empty1 ~> relcomp_empty1
1282 rel_comp_mono ~> relcomp_mono
1283 rel_comp_subset_Sigma ~> relcomp_subset_Sigma
1284 rel_comp_distrib ~> relcomp_distrib
1285 rel_comp_distrib2 ~> relcomp_distrib2
1286 rel_comp_UNION_distrib ~> relcomp_UNION_distrib
1287 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2
1288 single_valued_rel_comp ~> single_valued_relcomp
1289 rel_comp_def ~> relcomp_unfold
1290 converse_rel_comp ~> converse_relcomp
1291 pred_compI ~> relcomppI
1292 pred_compE ~> relcomppE
1293 pred_comp_bot1 ~> relcompp_bot1
1294 pred_comp_bot2 ~> relcompp_bot2
1295 transp_pred_comp_less_eq ~> transp_relcompp_less_eq
1296 pred_comp_mono ~> relcompp_mono
1297 pred_comp_distrib ~> relcompp_distrib
1298 pred_comp_distrib2 ~> relcompp_distrib2
1299 converse_pred_comp ~> converse_relcompp
1301 finite_rel_comp ~> finite_relcomp
1303 set_rel_comp ~> set_relcomp
1307 * Theory Divides: Discontinued redundant theorems about div and mod.
1308 INCOMPATIBILITY, use the corresponding generic theorems instead.
1310 DIVISION_BY_ZERO ~> div_by_0, mod_by_0
1311 zdiv_self ~> div_self
1312 zmod_self ~> mod_self
1315 zdiv_zmod_equality ~> div_mod_equality2
1316 zdiv_zmod_equality2 ~> div_mod_equality
1317 zmod_zdiv_trivial ~> mod_div_trivial
1318 zdiv_zminus_zminus ~> div_minus_minus
1319 zmod_zminus_zminus ~> mod_minus_minus
1320 zdiv_zminus2 ~> div_minus_right
1321 zmod_zminus2 ~> mod_minus_right
1322 zdiv_minus1_right ~> div_minus1_right
1323 zmod_minus1_right ~> mod_minus1_right
1324 zdvd_mult_div_cancel ~> dvd_mult_div_cancel
1325 zmod_zmult1_eq ~> mod_mult_right_eq
1326 zpower_zmod ~> power_mod
1327 zdvd_zmod ~> dvd_mod
1328 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd
1329 mod_mult_distrib ~> mult_mod_left
1330 mod_mult_distrib2 ~> mult_mod_right
1332 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use
1333 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.
1335 * Finite_Set.fold now qualified. INCOMPATIBILITY.
1337 * Consolidated theorem names concerning fold combinators:
1339 inf_INFI_fold_inf ~> inf_INF_fold_inf
1340 sup_SUPR_fold_sup ~> sup_SUP_fold_sup
1341 INFI_fold_inf ~> INF_fold_inf
1342 SUPR_fold_sup ~> SUP_fold_sup
1343 union_set ~> union_set_fold
1344 minus_set ~> minus_set_fold
1345 INFI_set_fold ~> INF_set_fold
1346 SUPR_set_fold ~> SUP_set_fold
1347 INF_code ~> INF_set_foldr
1348 SUP_code ~> SUP_set_foldr
1349 foldr.simps ~> foldr.simps (in point-free formulation)
1350 foldr_fold_rev ~> foldr_conv_fold
1351 foldl_fold ~> foldl_conv_fold
1352 foldr_foldr ~> foldr_conv_foldl
1353 foldl_foldr ~> foldl_conv_foldr
1354 fold_set_remdups ~> fold_set_fold_remdups
1355 fold_set ~> fold_set_fold
1356 fold1_set ~> fold1_set_fold
1360 * Dropped rarely useful theorems concerning fold combinators:
1361 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
1362 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
1363 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
1364 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
1365 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,
1366 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.
1367 INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0"
1368 and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be
1369 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by
1370 unfolding "foldr_conv_fold" and "foldl_conv_fold".
1372 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,
1373 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,
1374 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,
1375 INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding
1376 lemmas over fold rather than foldr, or make use of lemmas
1377 fold_conv_foldr and fold_rev.
1379 * Congruence rules Option.map_cong and Option.bind_cong for recursion
1380 through option types.
1382 * "Transitive_Closure.ntrancl": bounded transitive closure on
1385 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.
1387 * Theory Int: Discontinued many legacy theorems specific to type int.
1388 INCOMPATIBILITY, use the corresponding generic theorems instead.
1390 zminus_zminus ~> minus_minus
1391 zminus_0 ~> minus_zero
1392 zminus_zadd_distrib ~> minus_add_distrib
1393 zadd_commute ~> add_commute
1394 zadd_assoc ~> add_assoc
1395 zadd_left_commute ~> add_left_commute
1398 zadd_0 ~> add_0_left
1399 zadd_0_right ~> add_0_right
1400 zadd_zminus_inverse2 ~> left_minus
1401 zmult_zminus ~> mult_minus_left
1402 zmult_commute ~> mult_commute
1403 zmult_assoc ~> mult_assoc
1404 zadd_zmult_distrib ~> left_distrib
1405 zadd_zmult_distrib2 ~> right_distrib
1406 zdiff_zmult_distrib ~> left_diff_distrib
1407 zdiff_zmult_distrib2 ~> right_diff_distrib
1408 zmult_1 ~> mult_1_left
1409 zmult_1_right ~> mult_1_right
1410 zle_refl ~> order_refl
1411 zle_trans ~> order_trans
1412 zle_antisym ~> order_antisym
1413 zle_linear ~> linorder_linear
1414 zless_linear ~> linorder_less_linear
1415 zadd_left_mono ~> add_left_mono
1416 zadd_strict_right_mono ~> add_strict_right_mono
1417 zadd_zless_mono ~> add_less_le_mono
1418 int_0_less_1 ~> zero_less_one
1419 int_0_neq_1 ~> zero_neq_one
1421 zpower_zadd_distrib ~> power_add
1422 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
1423 zero_le_zpower_abs ~> zero_le_power_abs
1425 * Theory Deriv: Renamed
1427 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
1429 * Theory Library/Multiset: Improved code generation of multisets.
1431 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets
1432 are expressed via type classes again. The special syntax
1433 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant
1434 setsum_set, which is now subsumed by Big_Operators.setsum.
1437 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
1438 use theory HOL/Library/Nat_Bijection instead.
1440 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black
1441 trees is now inside a type class context. Names of affected
1442 operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for
1443 theories working directly with raw red-black trees, adapt the names as
1447 bulkload -> rbt_bulkload
1448 del_from_left -> rbt_del_from_left
1449 del_from_right -> rbt_del_from_right
1451 delete -> rbt_delete
1453 insert -> rbt_insert
1454 insertw -> rbt_insert_with
1455 insert_with_key -> rbt_insert_with_key
1456 map_entry -> rbt_map_entry
1457 lookup -> rbt_lookup
1458 sorted -> rbt_sorted
1459 tree_greater -> rbt_greater
1460 tree_less -> rbt_less
1461 tree_less_symbol -> rbt_less_symbol
1463 union_with -> rbt_union_with
1464 union_with_key -> rbt_union_with_key
1467 balance_left_sorted -> balance_left_rbt_sorted
1468 balance_left_tree_greater -> balance_left_rbt_greater
1469 balance_left_tree_less -> balance_left_rbt_less
1470 balance_right_sorted -> balance_right_rbt_sorted
1471 balance_right_tree_greater -> balance_right_rbt_greater
1472 balance_right_tree_less -> balance_right_rbt_less
1473 balance_sorted -> balance_rbt_sorted
1474 balance_tree_greater -> balance_rbt_greater
1475 balance_tree_less -> balance_rbt_less
1476 bulkload_is_rbt -> rbt_bulkload_is_rbt
1477 combine_sorted -> combine_rbt_sorted
1478 combine_tree_greater -> combine_rbt_greater
1479 combine_tree_less -> combine_rbt_less
1480 delete_in_tree -> rbt_delete_in_tree
1481 delete_is_rbt -> rbt_delete_is_rbt
1482 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater
1483 del_from_left_tree_less -> rbt_del_from_left_rbt_less
1484 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater
1485 del_from_right_tree_less -> rbt_del_from_right_rbt_less
1486 del_in_tree -> rbt_del_in_tree
1487 del_inv1_inv2 -> rbt_del_inv1_inv2
1488 del_sorted -> rbt_del_rbt_sorted
1489 del_tree_greater -> rbt_del_rbt_greater
1490 del_tree_less -> rbt_del_rbt_less
1491 dom_lookup_Branch -> dom_rbt_lookup_Branch
1492 entries_lookup -> entries_rbt_lookup
1493 finite_dom_lookup -> finite_dom_rbt_lookup
1494 insert_sorted -> rbt_insert_rbt_sorted
1495 insertw_is_rbt -> rbt_insertw_is_rbt
1496 insertwk_is_rbt -> rbt_insertwk_is_rbt
1497 insertwk_sorted -> rbt_insertwk_rbt_sorted
1498 insertw_sorted -> rbt_insertw_rbt_sorted
1499 ins_sorted -> ins_rbt_sorted
1500 ins_tree_greater -> ins_rbt_greater
1501 ins_tree_less -> ins_rbt_less
1502 is_rbt_sorted -> is_rbt_rbt_sorted
1503 lookup_balance -> rbt_lookup_balance
1504 lookup_bulkload -> rbt_lookup_rbt_bulkload
1505 lookup_delete -> rbt_lookup_rbt_delete
1506 lookup_Empty -> rbt_lookup_Empty
1507 lookup_from_in_tree -> rbt_lookup_from_in_tree
1508 lookup_in_tree -> rbt_lookup_in_tree
1509 lookup_ins -> rbt_lookup_ins
1510 lookup_insert -> rbt_lookup_rbt_insert
1511 lookup_insertw -> rbt_lookup_rbt_insertw
1512 lookup_insertwk -> rbt_lookup_rbt_insertwk
1513 lookup_keys -> rbt_lookup_keys
1514 lookup_map -> rbt_lookup_map
1515 lookup_map_entry -> rbt_lookup_rbt_map_entry
1516 lookup_tree_greater -> rbt_lookup_rbt_greater
1517 lookup_tree_less -> rbt_lookup_rbt_less
1518 lookup_union -> rbt_lookup_rbt_union
1519 map_entry_color_of -> rbt_map_entry_color_of
1520 map_entry_inv1 -> rbt_map_entry_inv1
1521 map_entry_inv2 -> rbt_map_entry_inv2
1522 map_entry_is_rbt -> rbt_map_entry_is_rbt
1523 map_entry_sorted -> rbt_map_entry_rbt_sorted
1524 map_entry_tree_greater -> rbt_map_entry_rbt_greater
1525 map_entry_tree_less -> rbt_map_entry_rbt_less
1526 map_tree_greater -> map_rbt_greater
1527 map_tree_less -> map_rbt_less
1528 map_sorted -> map_rbt_sorted
1529 paint_sorted -> paint_rbt_sorted
1530 paint_lookup -> paint_rbt_lookup
1531 paint_tree_greater -> paint_rbt_greater
1532 paint_tree_less -> paint_rbt_less
1533 sorted_entries -> rbt_sorted_entries
1534 tree_greater_eq_trans -> rbt_greater_eq_trans
1535 tree_greater_nit -> rbt_greater_nit
1536 tree_greater_prop -> rbt_greater_prop
1537 tree_greater_simps -> rbt_greater_simps
1538 tree_greater_trans -> rbt_greater_trans
1539 tree_less_eq_trans -> rbt_less_eq_trans
1540 tree_less_nit -> rbt_less_nit
1541 tree_less_prop -> rbt_less_prop
1542 tree_less_simps -> rbt_less_simps
1543 tree_less_trans -> rbt_less_trans
1544 tree_ord_props -> rbt_ord_props
1545 union_Branch -> rbt_union_Branch
1546 union_is_rbt -> rbt_union_is_rbt
1547 unionw_is_rbt -> rbt_unionw_is_rbt
1548 unionwk_is_rbt -> rbt_unionwk_is_rbt
1549 unionwk_sorted -> rbt_unionwk_rbt_sorted
1551 * Theory HOL/Library/Float: Floating point numbers are now defined as
1552 a subset of the real numbers. All operations are defined using the
1553 lifing-framework and proofs use the transfer method. INCOMPATIBILITY.
1560 round_down -> float_round_down
1561 round_up -> float_round_up
1565 ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod
1568 abs_float_def -> Float.compute_float_abs
1569 bitlen_ge0 -> bitlen_nonneg
1570 bitlen.simps -> Float.compute_bitlen
1571 float_components -> Float_mantissa_exponent
1572 float_divl.simps -> Float.compute_float_divl
1573 float_divr.simps -> Float.compute_float_divr
1574 float_eq_odd -> mult_powr_eq_mult_powr_iff
1575 float_power -> real_of_float_power
1576 lapprox_posrat_def -> Float.compute_lapprox_posrat
1577 lapprox_rat.simps -> Float.compute_lapprox_rat
1578 le_float_def' -> Float.compute_float_le
1579 le_float_def -> less_eq_float.rep_eq
1580 less_float_def' -> Float.compute_float_less
1581 less_float_def -> less_float.rep_eq
1582 normfloat_def -> Float.compute_normfloat
1583 normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0
1584 normfloat -> normfloat_def
1585 normfloat_unique -> use normfloat_def
1586 number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral
1587 one_float_def -> Float.compute_float_one
1588 plus_float_def -> Float.compute_float_plus
1589 rapprox_posrat_def -> Float.compute_rapprox_posrat
1590 rapprox_rat.simps -> Float.compute_rapprox_rat
1591 real_of_float_0 -> zero_float.rep_eq
1592 real_of_float_1 -> one_float.rep_eq
1593 real_of_float_abs -> abs_float.rep_eq
1594 real_of_float_add -> plus_float.rep_eq
1595 real_of_float_minus -> uminus_float.rep_eq
1596 real_of_float_mult -> times_float.rep_eq
1597 real_of_float_simp -> Float.rep_eq
1598 real_of_float_sub -> minus_float.rep_eq
1599 round_down.simps -> Float.compute_float_round_down
1600 round_up.simps -> Float.compute_float_round_up
1601 times_float_def -> Float.compute_float_times
1602 uminus_float_def -> Float.compute_float_uminus
1603 zero_float_def -> Float.compute_float_zero
1605 Lemmas not necessary anymore, use the transfer method:
1606 bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,
1607 float_divr, float_le_simp, float_less1_mantissa_bound,
1608 float_less_simp, float_less_zero, float_le_zero,
1609 float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,
1610 floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,
1611 lapprox_rat_bottom, normalized_float, rapprox_posrat,
1612 rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,
1613 real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,
1614 round_up, zero_le_float, zero_less_float
1616 * New theory HOL/Library/DAList provides an abstract type for
1617 association lists with distinct keys.
1619 * Session HOL/IMP: Added new theory of abstract interpretation of
1622 * Session HOL-Import: Re-implementation from scratch is faster,
1623 simpler, and more scalable. Requires a proof bundle, which is
1624 available as an external component. Discontinued old (and mostly
1625 dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY.
1627 * Session HOL-Word: Discontinued many redundant theorems specific to
1628 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
1631 word_sub_alt ~> word_sub_wi
1632 word_add_alt ~> word_add_def
1633 word_mult_alt ~> word_mult_def
1634 word_minus_alt ~> word_minus_def
1635 word_0_alt ~> word_0_wi
1636 word_1_alt ~> word_1_wi
1637 word_add_0 ~> add_0_left
1638 word_add_0_right ~> add_0_right
1639 word_mult_1 ~> mult_1_left
1640 word_mult_1_right ~> mult_1_right
1641 word_add_commute ~> add_commute
1642 word_add_assoc ~> add_assoc
1643 word_add_left_commute ~> add_left_commute
1644 word_mult_commute ~> mult_commute
1645 word_mult_assoc ~> mult_assoc
1646 word_mult_left_commute ~> mult_left_commute
1647 word_left_distrib ~> left_distrib
1648 word_right_distrib ~> right_distrib
1649 word_left_minus ~> left_minus
1650 word_diff_0_right ~> diff_0_right
1651 word_diff_self ~> diff_self
1652 word_sub_def ~> diff_minus
1653 word_diff_minus ~> diff_minus
1654 word_add_ac ~> add_ac
1655 word_mult_ac ~> mult_ac
1656 word_plus_ac0 ~> add_0_left add_0_right add_ac
1657 word_times_ac1 ~> mult_1_left mult_1_right mult_ac
1658 word_order_trans ~> order_trans
1659 word_order_refl ~> order_refl
1660 word_order_antisym ~> order_antisym
1661 word_order_linear ~> linorder_linear
1662 lenw1_zero_neq_one ~> zero_neq_one
1663 word_number_of_eq ~> number_of_eq
1664 word_of_int_add_hom ~> wi_hom_add
1665 word_of_int_sub_hom ~> wi_hom_sub
1666 word_of_int_mult_hom ~> wi_hom_mult
1667 word_of_int_minus_hom ~> wi_hom_neg
1668 word_of_int_succ_hom ~> wi_hom_succ
1669 word_of_int_pred_hom ~> wi_hom_pred
1670 word_of_int_0_hom ~> word_0_wi
1671 word_of_int_1_hom ~> word_1_wi
1673 * Session HOL-Word: New proof method "word_bitwise" for splitting
1674 machine word equalities and inequalities into logical circuits,
1675 defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction,
1676 multiplication, shifting by constants, bitwise operators and numeric
1677 constants. Requires fixed-length word types, not 'a word. Solves
1678 many standard word identities outright and converts more into first
1679 order problems amenable to blast or similar. See also examples in
1680 HOL/Word/Examples/WordExamples.thy.
1682 * Session HOL-Probability: Introduced the type "'a measure" to
1683 represent measures, this replaces the records 'a algebra and 'a
1684 measure_space. The locales based on subset_class now have two
1685 locale-parameters the space \<Omega> and the set of measurable sets M.
1686 The product of probability spaces uses now the same constant as the
1687 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)
1688 measure". Most constants are defined now outside of locales and gain
1689 an additional parameter, like null_sets, almost_eventually or \<mu>'.
1690 Measure space constructions for distributions and densities now got
1691 their own constants distr and density. Instead of using locales to
1692 describe measure spaces with a finite space, the measure count_space
1693 and point_measure is introduced. INCOMPATIBILITY.
1697 finite_measure.\<mu>' -> measure
1698 product_algebra_generator -> prod_algebra
1699 product_prob_space.emb -> prod_emb
1700 product_prob_space.infprod_algebra -> PiM
1703 completeable_measure_space
1704 finite_measure_space
1706 finite_product_finite_prob_space
1707 finite_product_sigma_algebra
1708 finite_sigma_algebra
1710 pair_finite_prob_space
1711 pair_finite_sigma_algebra
1714 product_sigma_algebra
1718 distribution -> use distr measure, or distributed predicate
1720 joint_distribution -> use distr measure, or distributed predicate
1721 pair_measure_generator
1722 product_prob_space.infprod_algebra -> use PiM
1725 Replacement theorems:
1726 finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite
1727 finite_measure.empty_measure -> measure_empty
1728 finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq
1729 finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq
1730 finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably
1731 finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure
1732 finite_measure.finite_measure -> finite_measure.emeasure_finite
1733 finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton
1734 finite_measure.positive_measure' -> measure_nonneg
1735 finite_measure.real_measure -> finite_measure.emeasure_real
1736 finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb
1737 finite_product_sigma_algebra.in_P -> sets_PiM_I_finite
1738 finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty
1739 information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed
1740 information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple
1741 information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple
1742 information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple
1743 information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple
1744 information_space.entropy_commute -> information_space.entropy_commute_simple
1745 information_space.entropy_eq -> information_space.entropy_simple_distributed
1746 information_space.entropy_generic_eq -> information_space.entropy_simple_distributed
1747 information_space.entropy_positive -> information_space.entropy_nonneg_simple
1748 information_space.entropy_uniform_max -> information_space.entropy_uniform
1749 information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq
1750 information_space.KL_eq_0 -> information_space.KL_same_eq_0
1751 information_space.KL_ge_0 -> information_space.KL_nonneg
1752 information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed
1753 information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple
1754 Int_stable_cuboids -> Int_stable_atLeastAtMost
1755 Int_stable_product_algebra_generator -> positive_integral
1756 measure_preserving -> equality "distr M N f = N" "f : measurable M N"
1757 measure_space.additive -> emeasure_additive
1758 measure_space.AE_iff_null_set -> AE_iff_null
1759 measure_space.almost_everywhere_def -> eventually_ae_filter
1760 measure_space.almost_everywhere_vimage -> AE_distrD
1761 measure_space.continuity_from_above -> INF_emeasure_decseq
1762 measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq
1763 measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq
1764 measure_space.continuity_from_below -> SUP_emeasure_incseq
1765 measure_space_density -> emeasure_density
1766 measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density
1767 measure_space.integrable_vimage -> integrable_distr
1768 measure_space.integral_translated_density -> integral_density
1769 measure_space.integral_vimage -> integral_distr
1770 measure_space.measure_additive -> plus_emeasure
1771 measure_space.measure_compl -> emeasure_compl
1772 measure_space.measure_countable_increasing -> emeasure_countable_increasing
1773 measure_space.measure_countably_subadditive -> emeasure_subadditive_countably
1774 measure_space.measure_decseq -> decseq_emeasure
1775 measure_space.measure_Diff -> emeasure_Diff
1776 measure_space.measure_Diff_null_set -> emeasure_Diff_null_set
1777 measure_space.measure_eq_0 -> emeasure_eq_0
1778 measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite
1779 measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton
1780 measure_space.measure_incseq -> incseq_emeasure
1781 measure_space.measure_insert -> emeasure_insert
1782 measure_space.measure_mono -> emeasure_mono
1783 measure_space.measure_not_negative -> emeasure_not_MInf
1784 measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq
1785 measure_space.measure_setsum -> setsum_emeasure
1786 measure_space.measure_setsum_split -> setsum_emeasure_cover
1787 measure_space.measure_space_vimage -> emeasure_distr
1788 measure_space.measure_subadditive_finite -> emeasure_subadditive_finite
1789 measure_space.measure_subadditive -> subadditive
1790 measure_space.measure_top -> emeasure_space
1791 measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0
1792 measure_space.measure_Un_null_set -> emeasure_Un_null_set
1793 measure_space.positive_integral_translated_density -> positive_integral_density
1794 measure_space.positive_integral_vimage -> positive_integral_distr
1795 measure_space.real_continuity_from_above -> Lim_measure_decseq
1796 measure_space.real_continuity_from_below -> Lim_measure_incseq
1797 measure_space.real_measure_countably_subadditive -> measure_subadditive_countably
1798 measure_space.real_measure_Diff -> measure_Diff
1799 measure_space.real_measure_finite_Union -> measure_finite_Union
1800 measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton
1801 measure_space.real_measure_subadditive -> measure_subadditive
1802 measure_space.real_measure_Union -> measure_Union
1803 measure_space.real_measure_UNION -> measure_UNION
1804 measure_space.simple_function_vimage -> simple_function_comp
1805 measure_space.simple_integral_vimage -> simple_integral_distr
1806 measure_space.simple_integral_vimage -> simple_integral_distr
1807 measure_unique_Int_stable -> measure_eqI_generator_eq
1808 measure_unique_Int_stable_vimage -> measure_eqI_generator_eq
1809 pair_sigma_algebra.measurable_cut_fst -> sets_Pair1
1810 pair_sigma_algebra.measurable_cut_snd -> sets_Pair2
1811 pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1
1812 pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2
1813 pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff
1814 pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap
1815 pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'
1816 pair_sigma_algebra.sets_swap -> sets_pair_swap
1817 pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1
1818 pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2
1819 pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap
1820 pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2
1821 pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt
1822 pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times
1823 prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM
1824 prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq
1825 prob_space.measure_space_1 -> prob_space.emeasure_space_1
1826 prob_space.prob_space_vimage -> prob_space_distr
1827 prob_space.random_variable_restrict -> measurable_restrict
1828 prob_space_unique_Int_stable -> measure_eqI_prob_space
1829 product_algebraE -> prod_algebraE_all
1830 product_algebra_generator_der -> prod_algebra_eq_finite
1831 product_algebra_generator_into_space -> prod_algebra_sets_into_space
1832 product_algebraI -> sets_PiM_I_finite
1833 product_measure_exists -> product_sigma_finite.sigma_finite
1834 product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator
1835 product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb
1836 product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty
1837 product_prob_space.measurable_component -> measurable_component_singleton
1838 product_prob_space.measurable_emb -> measurable_prod_emb
1839 product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single
1840 product_prob_space.measurable_singleton_infprod -> measurable_component_singleton
1841 product_prob_space.measure_emb -> emeasure_prod_emb
1842 product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict
1843 product_sigma_algebra.product_algebra_into_space -> space_closed
1844 product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge
1845 product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton
1846 product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge
1847 sequence_space.measure_infprod -> sequence_space.measure_PiM_countable
1848 sets_product_algebra -> sets_PiM
1849 sigma_algebra.measurable_sigma -> measurable_measure_of
1850 sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint
1851 sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr
1852 sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq
1853 space_product_algebra -> space_PiM
1855 * Session HOL-TPTP: support to parse and import TPTP problems (all
1856 languages) into Isabelle/HOL.
1861 * New "case_product" attribute (see HOL).
1866 * Greater support for structured proofs involving induction or case
1869 * Much greater use of mathematical symbols.
1871 * Removal of many ML theorem bindings. INCOMPATIBILITY.
1876 * Antiquotation @{keyword "name"} produces a parser for outer syntax
1877 from a minor keyword introduced via theory header declaration.
1879 * Antiquotation @{command_spec "name"} produces the
1880 Outer_Syntax.command_spec from a major keyword introduced via theory
1881 header declaration; it can be passed to Outer_Syntax.command etc.
1883 * Local_Theory.define no longer hard-wires default theorem name
1884 "foo_def", but retains the binding as given. If that is Binding.empty
1885 / Attrib.empty_binding, the result is not registered as user-level
1886 fact. The Local_Theory.define_internal variant allows to specify a
1887 non-empty name (used for the foundation in the background theory),
1888 while omitting the fact binding in the user-context. Potential
1889 INCOMPATIBILITY for derived definitional packages: need to specify
1890 naming policy for primitive definitions more explicitly.
1892 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
1893 conformance with similar operations in structure Term and Logic.
1895 * Antiquotation @{attributes [...]} embeds attribute source
1896 representation into the ML text, which is particularly useful with
1897 declarations like Local_Theory.note.
1899 * Structure Proof_Context follows standard naming scheme. Old
1900 ProofContext has been discontinued. INCOMPATIBILITY.
1902 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
1903 change of semantics: update is applied to auxiliary local theory
1906 * Modernized some old-style infix operations:
1908 addeqcongs ~> Simplifier.add_eqcong
1909 deleqcongs ~> Simplifier.del_eqcong
1910 addcongs ~> Simplifier.add_cong
1911 delcongs ~> Simplifier.del_cong
1912 setmksimps ~> Simplifier.set_mksimps
1913 setmkcong ~> Simplifier.set_mkcong
1914 setmksym ~> Simplifier.set_mksym
1915 setmkeqTrue ~> Simplifier.set_mkeqTrue
1916 settermless ~> Simplifier.set_termless
1917 setsubgoaler ~> Simplifier.set_subgoaler
1918 addsplits ~> Splitter.add_split
1919 delsplits ~> Splitter.del_split
1924 * USER_HOME settings variable points to cross-platform user home
1925 directory, which coincides with HOME on POSIX systems only. Likewise,
1926 the Isabelle path specification "~" now expands to $USER_HOME, instead
1927 of former $HOME. A different default for USER_HOME may be set
1928 explicitly in shell environment, before Isabelle settings are
1929 evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where
1930 the generic user home was intended.
1932 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
1933 notation, which is useful for the jEdit file browser, for example.
1935 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
1940 New in Isabelle2011-1 (October 2011)
1941 ------------------------------------
1945 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
1946 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
1948 - Management of multiple theory files directly from the editor
1949 buffer store -- bypassing the file-system (no requirement to save
1950 files for checking).
1952 - Markup of formal entities within the text buffer, with semantic
1953 highlighting, tooltips and hyperlinks to jump to defining source
1956 - Improved text rendering, with sub/superscripts in the source
1957 buffer (including support for copy/paste wrt. output panel, HTML
1958 theory output and other non-Isabelle text boxes).
1960 - Refined scheduling of proof checking and printing of results,
1961 based on interactive editor view. (Note: jEdit folding and
1962 narrowing allows to restrict buffer perspectives explicitly.)
1964 - Reduced CPU performance requirements, usable on machines with few
1967 - Reduced memory requirements due to pruning of unused document
1968 versions (garbage collection).
1970 See also ~~/src/Tools/jEdit/README.html for further information,
1971 including some remaining limitations.
1973 * Theory loader: source files are exclusively located via the master
1974 directory of each theory node (where the .thy file itself resides).
1975 The global load path (such as src/HOL/Library) has been discontinued.
1976 Note that the path element ~~ may be used to reference theories in the
1977 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
1980 * Theory loader: source files are identified by content via SHA1
1981 digests. Discontinued former path/modtime identification and optional
1982 ISABELLE_FILE_IDENT plugin scripts.
1984 * Parallelization of nested Isar proofs is subject to
1985 Goal.parallel_proofs_threshold (default 100). See also isabelle
1988 * Name space: former unsynchronized references are now proper
1989 configuration options, with more conventional names:
1991 long_names ~> names_long
1992 short_names ~> names_short
1993 unique_names ~> names_unique
1995 Minor INCOMPATIBILITY, need to declare options in context like this:
1997 declare [[names_unique = false]]
1999 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note
2000 that the result needs to be unique, which means fact specifications
2001 may have to be refined after enriching a proof context.
2003 * Attribute "case_names" has been refined: the assumptions in each case
2004 can be named now by following the case name with [name1 name2 ...].
2006 * Isabelle/Isar reference manual has been updated and extended:
2007 - "Synopsis" provides a catalog of main Isar language concepts.
2008 - Formal references in syntax diagrams, via @{rail} antiquotation.
2009 - Updated material from classic "ref" manual, notably about
2010 "Classical Reasoner".
2015 * Class bot and top require underlying partial order rather than
2016 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.
2018 * Class complete_lattice: generalized a couple of lemmas from sets;
2019 generalized theorems INF_cong and SUP_cong. New type classes for
2020 complete boolean algebras and complete linear orders. Lemmas
2021 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
2022 class complete_linorder.
2024 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
2025 Sup_fun_def, Inf_apply, Sup_apply.
2027 Removed redundant lemmas (the right hand side gives hints how to
2028 replace them for (metis ...), or (simp only: ...) proofs):
2030 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
2031 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
2032 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
2033 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
2034 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
2035 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
2036 Inter_def ~> INF_def, image_def
2037 Union_def ~> SUP_def, image_def
2038 INT_eq ~> INF_def, and image_def
2039 UN_eq ~> SUP_def, and image_def
2040 INF_subset ~> INF_superset_mono [OF _ order_refl]
2042 More consistent and comprehensive names:
2044 INTER_eq_Inter_image ~> INF_def
2045 UNION_eq_Union_image ~> SUP_def
2048 INF_leI ~> INF_lower
2049 INF_leI2 ~> INF_lower2
2050 le_INFI ~> INF_greatest
2051 le_SUPI ~> SUP_upper
2052 le_SUPI2 ~> SUP_upper2
2053 SUP_leI ~> SUP_least
2054 INFI_bool_eq ~> INF_bool_eq
2055 SUPR_bool_eq ~> SUP_bool_eq
2056 INFI_apply ~> INF_apply
2057 SUPR_apply ~> SUP_apply
2058 INTER_def ~> INTER_eq
2059 UNION_def ~> UNION_eq
2063 * Renamed theory Complete_Lattice to Complete_Lattices.
2066 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
2067 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
2068 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
2069 Sup_insert are now declared as [simp]. INCOMPATIBILITY.
2071 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
2072 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
2073 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor
2076 * Added syntactic classes "inf" and "sup" for the respective
2077 constants. INCOMPATIBILITY: Changes in the argument order of the
2078 (mostly internal) locale predicates for some derived classes.
2080 * Theorem collections ball_simps and bex_simps do not contain theorems
2081 referring to UNION any longer; these have been moved to collection
2082 UN_ball_bex_simps. INCOMPATIBILITY.
2084 * Theory Archimedean_Field: floor now is defined as parameter of a
2085 separate type class floor_ceiling.
2087 * Theory Finite_Set: more coherent development of fold_set locales:
2089 locale fun_left_comm ~> locale comp_fun_commute
2090 locale fun_left_comm_idem ~> locale comp_fun_idem
2092 Both use point-free characterization; interpretation proofs may need
2093 adjustment. INCOMPATIBILITY.
2095 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
2096 accordance with standard mathematical terminology. INCOMPATIBILITY.
2098 * Theory Complex_Main: The locale interpretations for the
2099 bounded_linear and bounded_bilinear locales have been removed, in
2100 order to reduce the number of duplicate lemmas. Users must use the
2101 original names for distributivity theorems, potential INCOMPATIBILITY.
2103 divide.add ~> add_divide_distrib
2104 divide.diff ~> diff_divide_distrib
2105 divide.setsum ~> setsum_divide_distrib
2106 mult.add_right ~> right_distrib
2107 mult.diff_right ~> right_diff_distrib
2108 mult_right.setsum ~> setsum_right_distrib
2109 mult_left.diff ~> left_diff_distrib
2111 * Theory Complex_Main: Several redundant theorems have been removed or
2112 replaced by more general versions. INCOMPATIBILITY.
2114 real_diff_def ~> minus_real_def
2115 real_divide_def ~> divide_real_def
2116 real_less_def ~> less_le
2117 real_abs_def ~> abs_real_def
2118 real_sgn_def ~> sgn_real_def
2119 real_mult_commute ~> mult_commute
2120 real_mult_assoc ~> mult_assoc
2121 real_mult_1 ~> mult_1_left
2122 real_add_mult_distrib ~> left_distrib
2123 real_zero_not_eq_one ~> zero_neq_one
2124 real_mult_inverse_left ~> left_inverse
2125 INVERSE_ZERO ~> inverse_zero
2126 real_le_refl ~> order_refl
2127 real_le_antisym ~> order_antisym
2128 real_le_trans ~> order_trans
2129 real_le_linear ~> linear
2130 real_le_eq_diff ~> le_iff_diff_le_0
2131 real_add_left_mono ~> add_left_mono
2132 real_mult_order ~> mult_pos_pos
2133 real_mult_less_mono2 ~> mult_strict_left_mono
2134 real_of_int_real_of_nat ~> real_of_int_of_nat_eq
2135 real_0_le_divide_iff ~> zero_le_divide_iff
2136 realpow_two_disj ~> power2_eq_iff
2137 real_squared_diff_one_factored ~> square_diff_one_factored
2138 realpow_two_diff ~> square_diff_square_factored
2139 reals_complete2 ~> complete_real
2140 real_sum_squared_expand ~> power2_sum
2141 exp_ln_eq ~> ln_unique
2143 expi_zero ~> exp_zero
2144 lemma_DERIV_subst ~> DERIV_cong
2145 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
2146 LIMSEQ_const ~> tendsto_const
2147 LIMSEQ_norm ~> tendsto_norm
2148 LIMSEQ_add ~> tendsto_add
2149 LIMSEQ_minus ~> tendsto_minus
2150 LIMSEQ_minus_cancel ~> tendsto_minus_cancel
2151 LIMSEQ_diff ~> tendsto_diff
2152 bounded_linear.LIMSEQ ~> bounded_linear.tendsto
2153 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
2154 LIMSEQ_mult ~> tendsto_mult
2155 LIMSEQ_inverse ~> tendsto_inverse
2156 LIMSEQ_divide ~> tendsto_divide
2157 LIMSEQ_pow ~> tendsto_power
2158 LIMSEQ_setsum ~> tendsto_setsum
2159 LIMSEQ_setprod ~> tendsto_setprod
2160 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
2161 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
2162 LIMSEQ_imp_rabs ~> tendsto_rabs
2163 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
2164 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
2165 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
2166 LIMSEQ_Complex ~> tendsto_Complex
2167 LIM_ident ~> tendsto_ident_at
2168 LIM_const ~> tendsto_const
2169 LIM_add ~> tendsto_add
2170 LIM_add_zero ~> tendsto_add_zero
2171 LIM_minus ~> tendsto_minus
2172 LIM_diff ~> tendsto_diff
2173 LIM_norm ~> tendsto_norm
2174 LIM_norm_zero ~> tendsto_norm_zero
2175 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
2176 LIM_norm_zero_iff ~> tendsto_norm_zero_iff
2177 LIM_rabs ~> tendsto_rabs
2178 LIM_rabs_zero ~> tendsto_rabs_zero
2179 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
2180 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
2181 LIM_compose ~> tendsto_compose
2182 LIM_mult ~> tendsto_mult
2183 LIM_scaleR ~> tendsto_scaleR
2184 LIM_of_real ~> tendsto_of_real
2185 LIM_power ~> tendsto_power
2186 LIM_inverse ~> tendsto_inverse
2187 LIM_sgn ~> tendsto_sgn
2188 isCont_LIM_compose ~> isCont_tendsto_compose
2189 bounded_linear.LIM ~> bounded_linear.tendsto
2190 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
2191 bounded_bilinear.LIM ~> bounded_bilinear.tendsto
2192 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
2193 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
2194 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
2195 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
2197 * Theory Complex_Main: The definition of infinite series was
2198 generalized. Now it is defined on the type class {topological_space,
2199 comm_monoid_add}. Hence it is useable also for extended real numbers.
2201 * Theory Complex_Main: The complex exponential function "expi" is now
2202 a type-constrained abbreviation for "exp :: complex => complex"; thus
2203 several polymorphic lemmas about "exp" are now applicable to "expi".
2207 - Theory Library/Code_Char_ord provides native ordering of
2208 characters in the target language.
2210 - Commands code_module and code_library are legacy, use export_code
2213 - Method "evaluation" is legacy, use method "eval" instead.
2215 - Legacy evaluator "SML" is deactivated by default. May be
2216 reactivated by the following theory command:
2218 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
2220 * Declare ext [intro] by default. Rare INCOMPATIBILITY.
2222 * New proof method "induction" that gives induction hypotheses the
2223 name "IH", thus distinguishing them from further hypotheses that come
2224 from rule induction. The latter are still called "hyps". Method
2225 "induction" is a thin wrapper around "induct" and follows the same
2228 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
2229 still available as a legacy feature for some time.
2232 - Added "need" and "total_consts" options.
2233 - Reintroduced "show_skolems" option by popular demand.
2234 - Renamed attribute: nitpick_def ~> nitpick_unfold.
2238 - Use quasi-sound (and efficient) translations by default.
2239 - Added support for the following provers: E-ToFoF, LEO-II,
2240 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
2241 - Automatically preplay and minimize proofs before showing them if
2242 this can be done within reasonable time.
2243 - sledgehammer available_provers ~> sledgehammer supported_provers.
2245 - Added "preplay_timeout", "slicing", "type_enc", "sound",
2246 "max_mono_iters", and "max_new_mono_instances" options.
2247 - Removed "explicit_apply" and "full_types" options as well as "Full
2248 Types" Proof General menu item. INCOMPATIBILITY.
2251 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
2252 - Obsoleted "metisFT" -- use "metis (full_types)" instead.
2256 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
2257 "elim:" options. INCOMPATIBILITY.
2258 - Introduced 'try' that not only runs 'try_methods' but also
2259 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
2262 - Added "eval" option to evaluate terms for the found counterexample
2263 (currently only supported by the default (exhaustive) tester).
2264 - Added post-processing of terms to obtain readable counterexamples
2265 (currently only supported by the default (exhaustive) tester).
2266 - New counterexample generator quickcheck[narrowing] enables
2267 narrowing-based testing. Requires the Glasgow Haskell compiler
2268 with its installation location defined in the Isabelle settings
2269 environment as ISABELLE_GHC.
2270 - Removed quickcheck tester "SML" based on the SML code generator
2271 (formly in HOL/Library).
2273 * Function package: discontinued option "tailrec". INCOMPATIBILITY,
2274 use 'partial_function' instead.
2276 * Theory Library/Extended_Reals replaces now the positive extended
2277 reals found in probability theory. This file is extended by
2278 Multivariate_Analysis/Extended_Real_Limits.
2280 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,
2281 from where it must be imported explicitly if it is really required.
2284 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
2285 been moved here. INCOMPATIBILITY.
2287 * Theory Library/Saturated provides type of numbers with saturated
2290 * Theory Library/Product_Lattice defines a pointwise ordering for the
2291 product type 'a * 'b, and provides instance proofs for various order
2292 and lattice type classes.
2294 * Theory Library/Countable now provides the "countable_datatype" proof
2295 method for proving "countable" class instances for datatypes.
2297 * Theory Library/Cset_Monad allows do notation for computable sets
2298 (cset) via the generic monad ad-hoc overloading facility.
2300 * Library: Theories of common data structures are split into theories
2301 for implementation, an invariant-ensuring type, and connection to an
2302 abstract type. INCOMPATIBILITY.
2304 - RBT is split into RBT and RBT_Mapping.
2305 - AssocList is split and renamed into AList and AList_Mapping.
2306 - DList is split into DList_Impl, DList, and DList_Cset.
2307 - Cset is split into Cset and List_Cset.
2309 * Theory Library/Nat_Infinity has been renamed to
2310 Library/Extended_Nat, with name changes of the following types and
2313 type inat ~> type enat
2315 Infty ~> infinity (overloaded)
2319 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
2320 been renamed accordingly. INCOMPATIBILITY.
2322 * Session Multivariate_Analysis: The euclidean_space type class now
2323 fixes a constant "Basis :: 'a set" consisting of the standard
2324 orthonormal basis for the type. Users now have the option of
2325 quantifying over this set instead of using the "basis" function, e.g.
2326 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
2328 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
2329 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
2330 "Cart_nth" and "Cart_lambda" have been respectively renamed to
2331 "vec_nth" and "vec_lambda"; theorems mentioning those names have
2332 changed to match. Definition theorems for overloaded constants now use
2333 the standard "foo_vec_def" naming scheme. A few other theorems have
2334 been renamed as follows (INCOMPATIBILITY):
2336 Cart_eq ~> vec_eq_iff
2337 dist_nth_le_cart ~> dist_vec_nth_le
2338 tendsto_vector ~> vec_tendstoI
2339 Cauchy_vector ~> vec_CauchyI
2341 * Session Multivariate_Analysis: Several duplicate theorems have been
2342 removed, and other theorems have been renamed or replaced with more
2343 general versions. INCOMPATIBILITY.
2345 finite_choice ~> finite_set_choice
2346 eventually_conjI ~> eventually_conj
2347 eventually_and ~> eventually_conj_iff
2348 eventually_false ~> eventually_False
2349 setsum_norm ~> norm_setsum
2350 Lim_sequentially ~> LIMSEQ_def
2351 Lim_ident_at ~> LIM_ident
2352 Lim_const ~> tendsto_const
2353 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
2354 Lim_neg ~> tendsto_minus
2355 Lim_add ~> tendsto_add
2356 Lim_sub ~> tendsto_diff
2357 Lim_mul ~> tendsto_scaleR
2358 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
2359 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
2360 Lim_linear ~> bounded_linear.tendsto
2361 Lim_component ~> tendsto_euclidean_component
2362 Lim_component_cart ~> tendsto_vec_nth
2363 Lim_inner ~> tendsto_inner [OF tendsto_const]
2364 dot_lsum ~> inner_setsum_left
2365 dot_rsum ~> inner_setsum_right
2366 continuous_cmul ~> continuous_scaleR [OF continuous_const]
2367 continuous_neg ~> continuous_minus
2368 continuous_sub ~> continuous_diff
2369 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
2370 continuous_mul ~> continuous_scaleR
2371 continuous_inv ~> continuous_inverse
2372 continuous_at_within_inv ~> continuous_at_within_inverse
2373 continuous_at_inv ~> continuous_at_inverse
2374 continuous_at_norm ~> continuous_norm [OF continuous_at_id]
2375 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
2376 continuous_at_component ~> continuous_component [OF continuous_at_id]
2377 continuous_on_neg ~> continuous_on_minus
2378 continuous_on_sub ~> continuous_on_diff
2379 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
2380 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
2381 continuous_on_mul ~> continuous_on_scaleR
2382 continuous_on_mul_real ~> continuous_on_mult
2383 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
2384 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
2385 continuous_on_inverse ~> continuous_on_inv
2386 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
2387 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
2388 subset_interior ~> interior_mono
2389 subset_closure ~> closure_mono
2390 closure_univ ~> closure_UNIV
2391 real_arch_lt ~> reals_Archimedean2
2392 real_arch ~> reals_Archimedean3
2393 real_abs_norm ~> abs_norm_cancel
2394 real_abs_sub_norm ~> norm_triangle_ineq3
2395 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
2397 * Session HOL-Probability:
2398 - Caratheodory's extension lemma is now proved for ring_of_sets.
2399 - Infinite products of probability measures are now available.
2400 - Sigma closure is independent, if the generator is independent
2401 - Use extended reals instead of positive extended
2402 reals. INCOMPATIBILITY.
2404 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
2406 expand_fun_below ~> fun_below_iff
2407 below_fun_ext ~> fun_belowI
2408 expand_cfun_eq ~> cfun_eq_iff
2409 ext_cfun ~> cfun_eqI
2410 expand_cfun_below ~> cfun_below_iff
2411 below_cfun_ext ~> cfun_belowI
2412 monofun_fun_fun ~> fun_belowD
2413 monofun_fun_arg ~> monofunE
2414 monofun_lub_fun ~> adm_monofun [THEN admD]
2415 cont_lub_fun ~> adm_cont [THEN admD]
2416 cont2cont_Rep_CFun ~> cont2cont_APP
2417 cont_Rep_CFun_app ~> cont_APP_app
2418 cont_Rep_CFun_app_app ~> cont_APP_app_app
2419 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
2420 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
2421 contlub_cfun ~> lub_APP [symmetric]
2422 contlub_LAM ~> lub_LAM [symmetric]
2425 lift_distinct1 ~> lift.distinct(1)
2426 lift_distinct2 ~> lift.distinct(2)
2427 Def_not_UU ~> lift.distinct(2)
2428 Def_inject ~> lift.inject
2429 below_UU_iff ~> below_bottom_iff
2430 eq_UU_iff ~> eq_bottom_iff
2433 *** Document preparation ***
2435 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
2436 isar-ref manual, both for description and actual application of the
2439 * Antiquotation @{value} evaluates the given term and presents its
2442 * Antiquotations: term style "isub" provides ad-hoc conversion of
2443 variables x1, y23 into subscripted form x\<^isub>1,
2444 y\<^isub>2\<^isub>3.
2446 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
2447 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
2449 * Localized \isabellestyle switch can be used within blocks or groups
2452 \isabellestyle{it} %preferred default
2453 {\isabellestylett @{text "typewriter stuff"}}
2455 * Discontinued special treatment of hard tabulators. Implicit
2456 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual
2462 * The inner syntax of sort/type/term/prop supports inlined YXML
2463 representations within quoted string tokens. By encoding logical
2464 entities via Term_XML (in ML or Scala) concrete syntax can be
2465 bypassed, which is particularly useful for producing bits of text
2466 under external program control.
2468 * Antiquotations for ML and document preparation are managed as theory
2469 data, which requires explicit setup.
2471 * Isabelle_Process.is_active allows tools to check if the official
2472 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
2473 (better known as Proof General).
2475 * Structure Proof_Context follows standard naming scheme. Old
2476 ProofContext is still available for some time as legacy alias.
2478 * Structure Timing provides various operations for timing; supersedes
2479 former start_timing/end_timing etc.
2481 * Path.print is the official way to show file-system paths to users
2482 (including quotes etc.).
2484 * Inner syntax: identifiers in parse trees of generic categories
2485 "logic", "aprop", "idt" etc. carry position information (disguised as
2486 type constraints). Occasional INCOMPATIBILITY with non-compliant
2487 translations that choke on unexpected type constraints. Positions can
2488 be stripped in ML translations via Syntax.strip_positions /
2489 Syntax.strip_positions_ast, or via the syntax constant
2490 "_strip_positions" within parse trees. As last resort, positions can
2491 be disabled via the configuration option Syntax.positions, which is
2492 called "syntax_positions" in Isar attribute syntax.
2494 * Discontinued special status of various ML structures that contribute
2495 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
2496 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
2497 refer directly to Ast.Constant, Lexicon.is_identifier,
2498 Syntax_Trans.mk_binder_tr etc.
2500 * Typed print translation: discontinued show_sorts argument, which is
2501 already available via context of "advanced" translation.
2503 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
2504 goal states; body tactic needs to address all subgoals uniformly.
2506 * Slightly more special eq_list/eq_set, with shortcut involving
2507 pointer equality (assumes that eq relation is reflexive).
2509 * Classical tactics use proper Proof.context instead of historic types
2510 claset/clasimpset. Old-style declarations like addIs, addEs, addDs
2511 operate directly on Proof.context. Raw type claset retains its use as
2512 snapshot of the classical context, which can be recovered via
2513 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.
2514 INCOMPATIBILITY, classical tactics and derived proof methods require
2515 proper Proof.context.
2520 * Discontinued support for Poly/ML 5.2, which was the last version
2521 without proper multithreading and TimeLimit implementation.
2523 * Discontinued old lib/scripts/polyml-platform, which has been
2524 obsolete since Isabelle2009-2.
2526 * Various optional external tools are referenced more robustly and
2527 uniformly by explicit Isabelle settings as follows:
2529 ISABELLE_CSDP (formerly CSDP_EXE)
2530 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)
2531 ISABELLE_OCAML (formerly EXEC_OCAML)
2532 ISABELLE_SWIPL (formerly EXEC_SWIPL)
2533 ISABELLE_YAP (formerly EXEC_YAP)
2535 Note that automated detection from the file-system or search path has
2536 been discontinued. INCOMPATIBILITY.
2538 * Scala layer provides JVM method invocation service for static
2539 methods of type (String)String, see Invoke_Scala.method in ML. For
2542 Invoke_Scala.method "java.lang.System.getProperty" "java.home"
2544 Together with YXML.string_of_body/parse_body and XML.Encode/Decode
2545 this allows to pass structured values between ML and Scala.
2547 * The IsabelleText fonts includes some further glyphs to support the
2548 Prover IDE. Potential INCOMPATIBILITY: users who happen to have
2549 installed a local copy (which is normally *not* required) need to
2550 delete or update it from ~~/lib/fonts/.
2554 New in Isabelle2011 (January 2011)
2555 ----------------------------------
2559 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
2560 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
2561 useful tooltips and hyperlinks produced from its static analysis. The
2562 bundled component provides an executable Isabelle tool that can be run
2565 Isabelle2011/bin/isabelle jedit
2567 * Significantly improved Isabelle/Isar implementation manual.
2569 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
2570 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
2571 while the default heap location within that directory lacks that extra
2572 suffix. This isolates multiple Isabelle installations from each
2573 other, avoiding problems with old settings in new versions.
2574 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
2576 * Source files are always encoded as UTF-8, instead of old-fashioned
2577 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
2578 the following package declarations:
2580 \usepackage[utf8]{inputenc}
2581 \usepackage{textcomp}
2583 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
2584 a Unicode character is treated as a single symbol, not a sequence of
2585 non-ASCII bytes as before. Since Isabelle/ML string literals may
2586 contain symbols without further backslash escapes, Unicode can now be
2587 used here as well. Recall that Symbol.explode in ML provides a
2588 consistent view on symbols, while raw explode (or String.explode)
2589 merely give a byte-oriented representation.
2591 * Theory loader: source files are primarily located via the master
2592 directory of each theory node (where the .thy file itself resides).
2593 The global load path is still partially available as legacy feature.
2594 Minor INCOMPATIBILITY due to subtle change in file lookup: use
2595 explicit paths, relatively to the theory.
2597 * Special treatment of ML file names has been discontinued.
2598 Historically, optional extensions .ML or .sml were added on demand --
2599 at the cost of clarity of file dependencies. Recall that Isabelle/ML
2600 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
2602 * Various options that affect pretty printing etc. are now properly
2603 handled within the context via configuration options, instead of
2604 unsynchronized references or print modes. There are both ML Config.T
2605 entities and Isar declaration attributes to access these.
2607 ML (Config.T) Isar (attribute)
2609 eta_contract eta_contract
2610 show_brackets show_brackets
2611 show_sorts show_sorts
2612 show_types show_types
2613 show_question_marks show_question_marks
2614 show_consts show_consts
2615 show_abbrevs show_abbrevs
2617 Syntax.ast_trace syntax_ast_trace
2618 Syntax.ast_stat syntax_ast_stat
2619 Syntax.ambiguity_level syntax_ambiguity_level
2621 Goal_Display.goals_limit goals_limit
2622 Goal_Display.show_main_goal show_main_goal
2624 Method.rule_trace rule_trace
2626 Thy_Output.display thy_output_display
2627 Thy_Output.quotes thy_output_quotes
2628 Thy_Output.indent thy_output_indent
2629 Thy_Output.source thy_output_source
2630 Thy_Output.break thy_output_break
2632 Note that corresponding "..._default" references in ML may only be
2633 changed globally at the ROOT session setup, but *not* within a theory.
2634 The option "show_abbrevs" supersedes the former print mode
2635 "no_abbrevs" with inverted meaning.
2637 * More systematic naming of some configuration options.
2640 trace_simp ~> simp_trace
2641 debug_simp ~> simp_debug
2643 * Support for real valued configuration options, using simplistic
2644 floating-point notation that coincides with the inner syntax for
2647 * Support for real valued preferences (with approximative PGIP type):
2648 front-ends need to accept "pgint" values in float notation.
2651 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
2654 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
2659 * Command 'type_synonym' (with single argument) replaces somewhat
2660 outdated 'types', which is still available as legacy feature for some
2663 * Command 'nonterminal' (with 'and' separated list of arguments)
2664 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
2666 * Command 'notepad' replaces former 'example_proof' for
2667 experimentation in Isar without any result. INCOMPATIBILITY.
2669 * Locale interpretation commands 'interpret' and 'sublocale' accept
2670 lists of equations to map definitions in a locale to appropriate
2671 entities in the context of the interpretation. The 'interpretation'
2672 command already provided this functionality.
2674 * Diagnostic command 'print_dependencies' prints the locale instances
2675 that would be activated if the specified expression was interpreted in
2676 the current context. Variant "print_dependencies!" assumes a context
2677 without interpretations.
2679 * Diagnostic command 'print_interps' prints interpretations in proofs
2680 in addition to interpretations in theories.
2682 * Discontinued obsolete 'global' and 'local' commands to manipulate
2683 the theory name space. Rare INCOMPATIBILITY. The ML functions
2684 Sign.root_path and Sign.local_path may be applied directly where this
2685 feature is still required for historical reasons.
2687 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
2688 'definition' instead.
2690 * The "prems" fact, which refers to the accidental collection of
2691 foundational premises in the context, is now explicitly marked as
2692 legacy feature and will be discontinued soon. Consider using "assms"
2693 of the head statement or reference facts by explicit names.
2695 * Document antiquotations @{class} and @{type} print classes and type
2698 * Document antiquotation @{file} checks file/directory entries within
2699 the local file system.
2704 * Coercive subtyping: functions can be declared as coercions and type
2705 inference will add them as necessary upon input of a term. Theory
2706 Complex_Main declares real :: nat => real and real :: int => real as
2707 coercions. A coercion function f is declared like this:
2709 declare [[coercion f]]
2711 To lift coercions through type constructors (e.g. from nat => real to
2712 nat list => real list), map functions can be declared, e.g.
2714 declare [[coercion_map map]]
2716 Currently coercion inference is activated only in theories including
2717 real numbers, i.e. descendants of Complex_Main. This is controlled by
2718 the configuration option "coercion_enabled", e.g. it can be enabled in
2719 other theories like this:
2721 declare [[coercion_enabled]]
2723 * Command 'partial_function' provides basic support for recursive
2724 function definitions over complete partial orders. Concrete instances
2725 are provided for i) the option type, ii) tail recursion on arbitrary
2726 types, and iii) the heap monad of Imperative_HOL. See
2727 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
2730 * Function package: f.psimps rules are no longer implicitly declared
2731 as [simp]. INCOMPATIBILITY.
2733 * Datatype package: theorems generated for executable equality (class
2734 "eq") carry proper names and are treated as default code equations.
2736 * Inductive package: now offers command 'inductive_simps' to
2737 automatically derive instantiated and simplified equations for
2738 inductive predicates, similar to 'inductive_cases'.
2740 * Command 'enriched_type' allows to register properties of the
2741 functorial structure of types.
2743 * Improved infrastructure for term evaluation using code generator
2744 techniques, in particular static evaluation conversions.
2746 * Code generator: Scala (2.8 or higher) has been added to the target
2749 * Code generator: globbing constant expressions "*" and "Theory.*"
2750 have been replaced by the more idiomatic "_" and "Theory._".
2753 * Code generator: export_code without explicit file declaration prints
2754 to standard output. INCOMPATIBILITY.
2756 * Code generator: do not print function definitions for case
2757 combinators any longer.
2759 * Code generator: simplification with rules determined with
2760 src/Tools/Code/code_simp.ML and method "code_simp".
2762 * Code generator for records: more idiomatic representation of record
2763 types. Warning: records are not covered by ancient SML code
2764 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
2765 rep_datatype declaration helps to succeed then:
2769 rep_datatype foo_ext ...
2771 * Records: logical foundation type for records does not carry a
2772 '_type' suffix any longer (obsolete due to authentic syntax).
2775 * Quickcheck now by default uses exhaustive testing instead of random
2776 testing. Random testing can be invoked by "quickcheck [random]",
2777 exhaustive testing by "quickcheck [exhaustive]".
2779 * Quickcheck instantiates polymorphic types with small finite
2780 datatypes by default. This enables a simple execution mechanism to
2781 handle quantifiers and function equality over the finite datatypes.
2783 * Quickcheck random generator has been renamed from "code" to
2784 "random". INCOMPATIBILITY.
2786 * Quickcheck now has a configurable time limit which is set to 30
2787 seconds by default. This can be changed by adding [timeout = n] to the
2788 quickcheck command. The time limit for Auto Quickcheck is still set
2791 * Quickcheck in locales considers interpretations of that locale for
2792 counter example search.
2795 - Added "smt" and "remote_smt" provers based on the "smt" proof
2796 method. See the Sledgehammer manual for details ("isabelle doc
2799 sledgehammer atp_info ~> sledgehammer running_provers
2800 sledgehammer atp_kill ~> sledgehammer kill_provers
2801 sledgehammer available_atps ~> sledgehammer available_provers
2804 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
2805 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
2806 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
2807 (and "ms" and "min" are no longer supported)
2812 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
2813 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
2815 - Added support for partial quotient types.
2816 - Added local versions of the "Nitpick.register_xxx" functions.
2817 - Added "whack" option.
2818 - Allow registration of quotient types as codatatypes.
2819 - Improved "merge_type_vars" option to merge more types.
2820 - Removed unsound "fast_descrs" option.
2821 - Added custom symmetry breaking for datatypes, making it possible to reach
2822 higher cardinalities.
2823 - Prevent the expansion of too large definitions.
2825 * Proof methods "metis" and "meson" now have configuration options
2826 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
2827 to diagnose these tools. E.g.
2829 using [[metis_trace = true]]
2831 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
2832 manually as command 'solve_direct'.
2834 * The default SMT solver Z3 must be enabled explicitly (due to
2835 licensing issues) by setting the environment variable
2836 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
2837 commercial applications, the SMT solver CVC3 is provided as fall-back;
2838 changing the SMT solver is done via the configuration option
2841 * Remote SMT solvers need to be referred to by the "remote_" prefix,
2842 i.e. "remote_cvc3" and "remote_z3".
2844 * Added basic SMT support for datatypes, records, and typedefs using
2845 the oracle mode (no proofs). Direct support of pairs has been dropped
2846 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
2847 support for a similar behavior). Minor INCOMPATIBILITY.
2849 * Changed SMT configuration options:
2851 z3_proofs ~> smt_oracle (with inverted meaning)
2852 z3_trace_assms ~> smt_trace_used_facts
2865 * Boogie output files (.b2i files) need to be declared in the theory
2868 * Simplification procedure "list_to_set_comprehension" rewrites list
2869 comprehensions applied to List.set to set comprehensions. Occasional
2870 INCOMPATIBILITY, may be deactivated like this:
2872 declare [[simproc del: list_to_set_comprehension]]
2874 * Removed old version of primrec package. INCOMPATIBILITY.
2876 * Removed simplifier congruence rule of "prod_case", as has for long
2877 been the case with "split". INCOMPATIBILITY.
2879 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
2881 * Removed [split_format ... and ... and ...] version of
2882 [split_format]. Potential INCOMPATIBILITY.
2884 * Predicate "sorted" now defined inductively, with nice induction
2885 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
2887 * Constant "contents" renamed to "the_elem", to free the generic name
2888 contents for other uses. INCOMPATIBILITY.
2890 * Renamed class eq and constant eq (for code generation) to class
2891 equal and constant equal, plus renaming of related facts and various
2892 tuning. INCOMPATIBILITY.
2894 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
2896 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
2899 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
2900 avoid confusion with finite sets. INCOMPATIBILITY.
2902 * Abandoned locales equiv, congruent and congruent2 for equivalence
2903 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
2906 * Some previously unqualified names have been qualified:
2913 Trueprop ~> HOL.Trueprop
2918 op --> ~> HOL.implies
2930 Pair ~> Product_Type.Pair
2931 fst ~> Product_Type.fst
2932 snd ~> Product_Type.snd
2933 curry ~> Product_Type.curry
2935 Collect ~> Set.Collect
2939 * More canonical naming convention for some fundamental definitions:
2941 bot_bool_eq ~> bot_bool_def
2942 top_bool_eq ~> top_bool_def
2943 inf_bool_eq ~> inf_bool_def
2944 sup_bool_eq ~> sup_bool_def
2945 bot_fun_eq ~> bot_fun_def
2946 top_fun_eq ~> top_fun_def
2947 inf_fun_eq ~> inf_fun_def
2948 sup_fun_eq ~> sup_fun_def
2952 * More stylized fact names:
2954 expand_fun_eq ~> fun_eq_iff
2955 expand_set_eq ~> set_eq_iff
2957 nat_number ~> eval_nat_numeral
2961 * Refactoring of code-generation specific operations in theory List:
2967 mem_iff ~> member_def
2968 null_empty ~> null_def
2970 INCOMPATIBILITY. Note that these were not supposed to be used
2971 regularly unless for striking reasons; their main purpose was code
2974 Various operations from the Haskell prelude are used for generating
2977 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
2978 "surj f" is now an abbreviation of "range f = UNIV". The theorems
2979 bij_def and surj_def are unchanged. INCOMPATIBILITY.
2981 * Abolished some non-alphabetic type names: "prod" and "sum" replace
2982 "*" and "+" respectively. INCOMPATIBILITY.
2984 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
2985 "Sum_Type.Plus" instead.
2987 * Constant "split" has been merged with constant "prod_case"; names of
2988 ML functions, facts etc. involving split have been retained so far,
2989 though. INCOMPATIBILITY.
2991 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
2992 instead. INCOMPATIBILITY.
2994 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
2997 * Former theory Library/Enum is now part of the HOL-Main image.
2998 INCOMPATIBILITY: all constants of the Enum theory now have to be
2999 referred to by its qualified name.
3002 nlists ~> Enum.nlists
3003 product ~> Enum.product
3005 * Theory Library/Monad_Syntax provides do-syntax for monad types.
3006 Syntax in Library/State_Monad has been changed to avoid ambiguities.
3009 * Theory Library/SetsAndFunctions has been split into
3010 Library/Function_Algebras and Library/Set_Algebras; canonical names
3011 for instance definitions for functions; various improvements.
3014 * Theory Library/Multiset provides stable quicksort implementation of
3017 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
3020 * Session Multivariate_Analysis: introduced a type class for euclidean
3021 space. Most theorems are now stated in terms of euclidean spaces
3022 instead of finite cartesian products.
3025 real ^ 'n ~> 'a::real_vector
3026 ~> 'a::euclidean_space
3027 ~> 'a::ordered_euclidean_space
3028 (depends on your needs)
3032 \<chi> x. _ ~> \<chi>\<chi> x. _
3035 Also note that the indices are now natural numbers and not from some
3036 finite type. Finite cartesian products of euclidean spaces, products
3037 of euclidean spaces the real and complex numbers are instantiated to
3038 be euclidean_spaces. INCOMPATIBILITY.
3040 * Session Probability: introduced pextreal as positive extended real
3041 numbers. Use pextreal as value for measures. Introduce the
3042 Radon-Nikodym derivative, product spaces and Fubini's theorem for
3043 arbitrary sigma finite measures. Introduces Lebesgue measure based on
3044 the integral in Multivariate Analysis. INCOMPATIBILITY.
3046 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
3049 * Session SPARK (with image HOL-SPARK) provides commands to load and
3050 prove verification conditions generated by the SPARK Ada program
3051 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
3056 * Theorems for additive ring operations (locale abelian_monoid and
3057 descendants) are generated by interpretation from their multiplicative
3058 counterparts. Names (in particular theorem names) have the mandatory
3059 qualifier 'add'. Previous theorem names are redeclared for
3062 * Structure "int_ring" is now an abbreviation (previously a
3063 definition). This fits more natural with advanced interpretations.
3068 * The domain package now runs in definitional mode by default: The
3069 former command 'new_domain' is now called 'domain'. To use the domain
3070 package in its original axiomatic mode, use 'domain (unsafe)'.
3073 * The new class "domain" is now the default sort. Class "predomain"
3074 is an unpointed version of "domain". Theories can be updated by
3075 replacing sort annotations as shown below. INCOMPATIBILITY.
3077 'a::type ~> 'a::countable
3078 'a::cpo ~> 'a::predomain
3079 'a::pcpo ~> 'a::domain
3081 * The old type class "rep" has been superseded by class "domain".
3082 Accordingly, users of the definitional package must remove any
3083 "default_sort rep" declarations. INCOMPATIBILITY.
3085 * The domain package (definitional mode) now supports unpointed
3086 predomain argument types, as long as they are marked 'lazy'. (Strict
3087 arguments must be in class "domain".) For example, the following
3088 domain definition now works:
3090 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
3092 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
3093 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
3094 'a option, and 'a list. Additionally, it configures fixrec and the
3095 domain package to work with these types. For example:
3097 fixrec isInl :: "('a + 'b) u -> tr"
3098 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
3100 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
3102 * The "(permissive)" option of fixrec has been replaced with a
3103 per-equation "(unchecked)" option. See
3104 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
3106 * The "bifinite" class no longer fixes a constant "approx"; the class
3107 now just asserts that such a function exists. INCOMPATIBILITY.
3109 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
3110 defines an embedding of type 'a defl into udom by default; instances
3111 of "bifinite" and "domain" classes are available in
3112 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
3114 * The syntax "REP('a)" has been replaced with "DEFL('a)".
3116 * The predicate "directed" has been removed. INCOMPATIBILITY.
3118 * The type class "finite_po" has been removed. INCOMPATIBILITY.
3120 * The function "cprod_map" has been renamed to "prod_map".
3123 * The monadic bind operator on each powerdomain has new binder syntax
3124 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
3125 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
3127 * The infix syntax for binary union on each powerdomain has changed
3128 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
3129 syntax. INCOMPATIBILITY.
3131 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
3132 still supported as an input translation.
3134 * Renamed some theorems (the original names are also still available).
3136 expand_fun_below ~> fun_below_iff
3137 below_fun_ext ~> fun_belowI
3138 expand_cfun_eq ~> cfun_eq_iff
3139 ext_cfun ~> cfun_eqI
3140 expand_cfun_below ~> cfun_below_iff
3141 below_cfun_ext ~> cfun_belowI
3142 cont2cont_Rep_CFun ~> cont2cont_APP
3144 * The Abs and Rep functions for various types have changed names.
3145 Related theorem names have also changed to match. INCOMPATIBILITY.
3147 Rep_CFun ~> Rep_cfun
3148 Abs_CFun ~> Abs_cfun
3149 Rep_Sprod ~> Rep_sprod
3150 Abs_Sprod ~> Abs_sprod
3151 Rep_Ssum ~> Rep_ssum
3152 Abs_Ssum ~> Abs_ssum
3154 * Lemmas with names of the form *_defined_iff or *_strict_iff have
3155 been renamed to *_bottom_iff. INCOMPATIBILITY.
3157 * Various changes to bisimulation/coinduction with domain package:
3159 - Definitions of "bisim" constants no longer mention definedness.
3160 - With mutual recursion, "bisim" predicate is now curried.
3161 - With mutual recursion, each type gets a separate coind theorem.
3162 - Variable names in bisim_def and coinduct rules have changed.
3166 * Case combinators generated by the domain package for type "foo" are
3167 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
3169 * Several theorems have been renamed to more accurately reflect the
3170 names of constants and types involved. INCOMPATIBILITY.
3172 thelub_const ~> lub_const
3173 lub_const ~> is_lub_const
3175 is_lub_lub ~> is_lubD2
3177 unique_lub ~> is_lub_unique
3178 is_ub_lub ~> is_lub_rangeD1
3179 lub_bin_chain ~> is_lub_bin_chain
3180 lub_fun ~> is_lub_fun
3181 thelub_fun ~> lub_fun
3182 thelub_cfun ~> lub_cfun
3183 thelub_Pair ~> lub_Pair
3184 lub_cprod ~> is_lub_prod
3185 thelub_cprod ~> lub_prod
3186 minimal_cprod ~> minimal_prod
3187 inst_cprod_pcpo ~> inst_prod_pcpo
3189 compact_UU ~> compact_bottom
3190 deflation_UU ~> deflation_bottom
3191 finite_deflation_UU ~> finite_deflation_bottom
3193 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
3195 sq_ord_less_eq_trans ~> below_eq_trans
3196 sq_ord_eq_less_trans ~> eq_below_trans
3197 refl_less ~> below_refl
3198 trans_less ~> below_trans
3199 antisym_less ~> below_antisym
3200 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
3201 box_less ~> box_below
3202 rev_trans_less ~> rev_below_trans
3203 not_less2not_eq ~> not_below2not_eq
3204 less_UU_iff ~> below_UU_iff
3205 flat_less_iff ~> flat_below_iff
3206 adm_less ~> adm_below
3207 adm_not_less ~> adm_not_below
3208 adm_compact_not_less ~> adm_compact_not_below
3209 less_fun_def ~> below_fun_def
3210 expand_fun_less ~> fun_below_iff
3211 less_fun_ext ~> fun_belowI
3212 less_discr_def ~> below_discr_def
3213 discr_less_eq ~> discr_below_eq
3214 less_unit_def ~> below_unit_def
3215 less_cprod_def ~> below_prod_def
3216 prod_lessI ~> prod_belowI
3217 Pair_less_iff ~> Pair_below_iff
3218 fst_less_iff ~> fst_below_iff
3219 snd_less_iff ~> snd_below_iff
3220 expand_cfun_less ~> cfun_below_iff
3221 less_cfun_ext ~> cfun_belowI
3222 injection_less ~> injection_below
3223 less_up_def ~> below_up_def
3224 not_Iup_less ~> not_Iup_below
3225 Iup_less ~> Iup_below
3227 Def_inject_less_eq ~> Def_below_Def
3228 Def_less_is_eq ~> Def_below_iff
3229 spair_less_iff ~> spair_below_iff
3230 less_sprod ~> below_sprod
3231 spair_less ~> spair_below
3232 sfst_less_iff ~> sfst_below_iff
3233 ssnd_less_iff ~> ssnd_below_iff
3234 fix_least_less ~> fix_least_below
3235 dist_less_one ~> dist_below_one
3236 less_ONE ~> below_ONE
3237 ONE_less_iff ~> ONE_below_iff
3238 less_sinlD ~> below_sinlD
3239 less_sinrD ~> below_sinrD
3244 * All constant names are now qualified internally and use proper
3245 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
3250 * Antiquotation @{assert} inlines a function bool -> unit that raises
3251 Fail if the argument is false. Due to inlining the source position of
3252 failed assertions is included in the error output.
3254 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
3255 text is in practice always evaluated with a stable theory checkpoint.
3256 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
3258 * Antiquotation @{theory A} refers to theory A from the ancestry of
3259 the current context, not any accidental theory loader state as before.
3260 Potential INCOMPATIBILITY, subtle change in semantics.
3262 * Syntax.pretty_priority (default 0) configures the required priority
3263 of pretty-printed output and thus affects insertion of parentheses.
3265 * Syntax.default_root (default "any") configures the inner syntax
3266 category (nonterminal symbol) for parsing of terms.
3268 * Former exception Library.UnequalLengths now coincides with
3269 ListPair.UnequalLengths.
3271 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
3272 main functionality is provided by structure Simplifier.
3274 * Renamed raw "explode" function to "raw_explode" to emphasize its
3275 meaning. Note that internally to Isabelle, Symbol.explode is used in
3276 almost all situations.
3278 * Discontinued obsolete function sys_error and exception SYS_ERROR.
3279 See implementation manual for further details on exceptions in
3282 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
3285 * Renamed structure PureThy to Pure_Thy and moved most of its
3286 operations to structure Global_Theory, to emphasize that this is
3287 rarely-used global-only stuff.
3289 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
3290 instead (or tracing for high-volume output).
3292 * Configuration option show_question_marks only affects regular pretty
3293 printing of types and terms, not raw Term.string_of_vname.
3295 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
3296 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
3297 @{thms} for most purposes.
3299 * ML structure Unsynchronized is never opened, not even in Isar
3300 interaction mode as before. Old Unsynchronized.set etc. have been
3301 discontinued -- use plain := instead. This should be *rare* anyway,
3302 since modern tools always work via official context data, notably
3303 configuration options.
3305 * Parallel and asynchronous execution requires special care concerning
3306 interrupts. Structure Exn provides some convenience functions that
3307 avoid working directly with raw Interrupt. User code must not absorb
3308 interrupts -- intermediate handling (for cleanup etc.) needs to be
3309 followed by re-raising of the original exception. Another common
3310 source of mistakes are "handle _" patterns, which make the meaning of
3311 the program subject to physical effects of the environment.
3315 New in Isabelle2009-2 (June 2010)
3316 ---------------------------------
3320 * Authentic syntax for *all* logical entities (type classes, type
3321 constructors, term constants): provides simple and robust
3322 correspondence between formal entities and concrete syntax. Within
3323 the parse tree / AST representations, "constants" are decorated by
3324 their category (class, type, const) and spelled out explicitly with
3325 their full internal name.
3327 Substantial INCOMPATIBILITY concerning low-level syntax declarations
3328 and translations (translation rules and translation functions in ML).
3329 Some hints on upgrading:
3331 - Many existing uses of 'syntax' and 'translations' can be replaced
3332 by more modern 'type_notation', 'notation' and 'abbreviation',
3333 which are independent of this issue.
3335 - 'translations' require markup within the AST; the term syntax
3336 provides the following special forms:
3338 CONST c -- produces syntax version of constant c from context
3339 XCONST c -- literally c, checked as constant from context
3340 c -- literally c, if declared by 'syntax'
3342 Plain identifiers are treated as AST variables -- occasionally the
3343 system indicates accidental variables via the error "rhs contains
3346 Type classes and type constructors are marked according to their
3347 concrete syntax. Some old translations rules need to be written
3348 for the "type" category, using type constructor application
3349 instead of pseudo-term application of the default category
3352 - 'parse_translation' etc. in ML may use the following
3355 @{class_syntax c} -- type class c within parse tree / AST
3356 @{term_syntax c} -- type constructor c within parse tree / AST
3357 @{const_syntax c} -- ML version of "CONST c" above
3358 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
3360 - Literal types within 'typed_print_translations', i.e. those *not*
3361 represented as pseudo-terms are represented verbatim. Use @{class
3362 c} or @{type_name c} here instead of the above syntax
3365 Note that old non-authentic syntax was based on unqualified base
3366 names, so all of the above "constant" names would coincide. Recall
3367 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
3368 diagnose syntax problems.
3370 * Type constructors admit general mixfix syntax, not just infix.
3372 * Concrete syntax may be attached to local entities without a proof
3373 body, too. This works via regular mixfix annotations for 'fix',
3374 'def', 'obtain' etc. or via the explicit 'write' command, which is
3375 similar to the 'notation' command in theory specifications.
3377 * Discontinued unnamed infix syntax (legacy feature for many years) --
3378 need to specify constant name and syntax separately. Internal ML
3379 datatype constructors have been renamed from InfixName to Infix etc.
3380 Minor INCOMPATIBILITY.
3382 * Schematic theorem statements need to be explicitly markup as such,
3383 via commands 'schematic_lemma', 'schematic_theorem',
3384 'schematic_corollary'. Thus the relevance of the proof is made
3385 syntactically clear, which impacts performance in a parallel or
3386 asynchronous interactive environment. Minor INCOMPATIBILITY.
3388 * Use of cumulative prems via "!" in some proof methods has been
3389 discontinued (old legacy feature).
3391 * References 'trace_simp' and 'debug_simp' have been replaced by
3392 configuration options stored in the context. Enabling tracing (the
3393 case of debugging is similar) in proofs works via
3395 using [[trace_simp = true]]
3397 Tracing is then active for all invocations of the simplifier in
3398 subsequent goal refinement steps. Tracing may also still be enabled or
3399 disabled via the ProofGeneral settings menu.
3401 * Separate commands 'hide_class', 'hide_type', 'hide_const',
3402 'hide_fact' replace the former 'hide' KIND command. Minor
3405 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
3406 more efficient than combinations with -q1 or -q2.
3411 * Proofterms record type-class reasoning explicitly, using the
3412 "unconstrain" operation internally. This eliminates all sort
3413 constraints from a theorem and proof, introducing explicit
3414 OFCLASS-premises. On the proof term level, this operation is
3415 automatically applied at theorem boundaries, such that closed proofs
3416 are always free of sort constraints. INCOMPATIBILITY for tools that
3417 inspect proof terms.
3419 * Local theory specifications may depend on extra type variables that
3420 are not present in the result type -- arguments TYPE('a) :: 'a itself
3421 are added internally. For example:
3423 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
3425 * Predicates of locales introduced by classes carry a mandatory
3426 "class" prefix. INCOMPATIBILITY.
3428 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
3430 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
3433 * Command 'code_reflect' allows to incorporate generated ML code into
3434 runtime environment; replaces immature code_datatype antiquotation.
3437 * Code generator: simple concept for abstract datatypes obeying
3440 * Code generator: details of internal data cache have no impact on the
3441 user space functionality any longer.
3443 * Methods "unfold_locales" and "intro_locales" ignore non-locale
3444 subgoals. This is more appropriate for interpretations with 'where'.
3447 * Command 'example_proof' opens an empty proof body. This allows to
3448 experiment with Isar, without producing any persistent result.
3450 * Commands 'type_notation' and 'no_type_notation' declare type syntax
3451 within a local theory context, with explicit checking of the
3452 constructors involved (in contrast to the raw 'syntax' versions).
3454 * Commands 'types' and 'typedecl' now work within a local theory
3455 context -- without introducing dependencies on parameters or
3456 assumptions, which is not possible in Isabelle/Pure.
3458 * Command 'defaultsort' has been renamed to 'default_sort', it works
3459 within a local theory context. Minor INCOMPATIBILITY.
3464 * Command 'typedef' now works within a local theory context -- without
3465 introducing dependencies on parameters or assumptions, which is not
3466 possible in Isabelle/Pure/HOL. Note that the logical environment may
3467 contain multiple interpretations of local typedefs (with different
3468 non-emptiness proofs), even in a global theory context.
3470 * New package for quotient types. Commands 'quotient_type' and
3471 'quotient_definition' may be used for defining types and constants by
3472 quotient constructions. An example is the type of integers created by
3473 quotienting pairs of natural numbers:
3476 intrel :: "(nat * nat) => (nat * nat) => bool"
3478 "intrel (x, y) (u, v) = (x + v = u + y)"
3480 quotient_type int = "nat * nat" / intrel
3481 by (auto simp add: equivp_def expand_fun_eq)
3484 "0::int" is "(0::nat, 0::nat)"
3486 The method "lifting" can be used to lift of theorems from the
3487 underlying "raw" type to the quotient type. The example
3488 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
3489 construction and provides a reasoning infrastructure for finite sets.
3491 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
3492 clash with new theory Quotient in Main HOL.
3494 * Moved the SMT binding into the main HOL session, eliminating
3495 separate HOL-SMT session.
3497 * List membership infix mem operation is only an input abbreviation.
3500 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
3501 for future developements; former Library/Word.thy is still present in
3502 the AFP entry RSAPPS.
3504 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
3505 longer shadowed. INCOMPATIBILITY.
3507 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
3510 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
3513 * Dropped normalizing_semiring etc; use the facts in semiring classes
3514 instead. INCOMPATIBILITY.
3516 * Dropped several real-specific versions of lemmas about floor and
3517 ceiling; use the generic lemmas from theory "Archimedean_Field"
3518 instead. INCOMPATIBILITY.
3520 floor_number_of_eq ~> floor_number_of
3521 le_floor_eq_number_of ~> number_of_le_floor
3522 le_floor_eq_zero ~> zero_le_floor
3523 le_floor_eq_one ~> one_le_floor
3524 floor_less_eq_number_of ~> floor_less_number_of
3525 floor_less_eq_zero ~> floor_less_zero
3526 floor_less_eq_one ~> floor_less_one
3527 less_floor_eq_number_of ~> number_of_less_floor
3528 less_floor_eq_zero ~> zero_less_floor
3529 less_floor_eq_one ~> one_less_floor
3530 floor_le_eq_number_of ~> floor_le_number_of
3531 floor_le_eq_zero ~> floor_le_zero
3532 floor_le_eq_one ~> floor_le_one
3533 floor_subtract_number_of ~> floor_diff_number_of
3534 floor_subtract_one ~> floor_diff_one
3535 ceiling_number_of_eq ~> ceiling_number_of
3536 ceiling_le_eq_number_of ~> ceiling_le_number_of
3537 ceiling_le_zero_eq ~> ceiling_le_zero
3538 ceiling_le_eq_one ~> ceiling_le_one
3539 less_ceiling_eq_number_of ~> number_of_less_ceiling
3540 less_ceiling_eq_zero ~> zero_less_ceiling
3541 less_ceiling_eq_one ~> one_less_ceiling
3542 ceiling_less_eq_number_of ~> ceiling_less_number_of
3543 ceiling_less_eq_zero ~> ceiling_less_zero
3544 ceiling_less_eq_one ~> ceiling_less_one
3545 le_ceiling_eq_number_of ~> number_of_le_ceiling
3546 le_ceiling_eq_zero ~> zero_le_ceiling
3547 le_ceiling_eq_one ~> one_le_ceiling
3548 ceiling_subtract_number_of ~> ceiling_diff_number_of
3549 ceiling_subtract_one ~> ceiling_diff_one
3551 * Theory "Finite_Set": various folding_XXX locales facilitate the
3552 application of the various fold combinators on finite sets.
3554 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
3555 provides abstract red-black tree type which is backed by "RBT_Impl" as
3556 implementation. INCOMPATIBILTY.
3558 * Theory Library/Coinductive_List has been removed -- superseded by
3559 AFP/thys/Coinductive.
3561 * Theory PReal, including the type "preal" and related operations, has
3562 been removed. INCOMPATIBILITY.
3564 * Real: new development using Cauchy Sequences.
3566 * Split off theory "Big_Operators" containing setsum, setprod,
3567 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
3569 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
3570 "Int" etc. INCOMPATIBILITY.
3572 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
3574 * New set of rules "ac_simps" provides combined assoc / commute
3575 rewrites for all interpretations of the appropriate generic locales.
3577 * Renamed theory "OrderedGroup" to "Groups" and split theory
3578 "Ring_and_Field" into theories "Rings" and "Fields"; for more
3579 appropriate and more consistent names suitable for name prefixes
3580 within the HOL theories. INCOMPATIBILITY.
3582 * Some generic constants have been put to appropriate theories:
3583 - less_eq, less: Orderings
3584 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
3585 - inverse, divide: Rings
3588 * More consistent naming of type classes involving orderings (and
3591 lower_semilattice ~> semilattice_inf
3592 upper_semilattice ~> semilattice_sup
3594 dense_linear_order ~> dense_linorder
3596 pordered_ab_group_add ~> ordered_ab_group_add
3597 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
3598 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
3599 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
3600 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
3601 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
3602 pordered_cancel_semiring ~> ordered_cancel_semiring
3603 pordered_comm_monoid_add ~> ordered_comm_monoid_add
3604 pordered_comm_ring ~> ordered_comm_ring
3605 pordered_comm_semiring ~> ordered_comm_semiring
3606 pordered_ring ~> ordered_ring
3607 pordered_ring_abs ~> ordered_ring_abs
3608 pordered_semiring ~> ordered_semiring
3610 ordered_ab_group_add ~> linordered_ab_group_add
3611 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
3612 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
3613 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
3614 ordered_field ~> linordered_field
3615 ordered_field_no_lb ~> linordered_field_no_lb
3616 ordered_field_no_ub ~> linordered_field_no_ub
3617 ordered_field_dense_linear_order ~> dense_linordered_field
3618 ordered_idom ~> linordered_idom
3619 ordered_ring ~> linordered_ring
3620 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
3621 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
3622 ordered_ring_strict ~> linordered_ring_strict
3623 ordered_semidom ~> linordered_semidom
3624 ordered_semiring ~> linordered_semiring
3625 ordered_semiring_1 ~> linordered_semiring_1
3626 ordered_semiring_1_strict ~> linordered_semiring_1_strict
3627 ordered_semiring_strict ~> linordered_semiring_strict
3629 The following slightly odd type classes have been moved to a
3630 separate theory Library/Lattice_Algebras:
3632 lordered_ab_group_add ~> lattice_ab_group_add
3633 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
3634 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
3635 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
3636 lordered_ring ~> lattice_ring
3640 * Refined field classes:
3641 - classes division_ring_inverse_zero, field_inverse_zero,
3642 linordered_field_inverse_zero include rule inverse 0 = 0 --
3643 subsumes former division_by_zero class;
3644 - numerous lemmas have been ported from field to division_ring.
3647 * Refined algebra theorem collections:
3648 - dropped theorem group group_simps, use algebra_simps instead;
3649 - dropped theorem group ring_simps, use field_simps instead;
3650 - proper theorem collection field_simps subsumes former theorem
3651 groups field_eq_simps and field_simps;
3652 - dropped lemma eq_minus_self_iff which is a duplicate for
3656 * Theory Finite_Set and List: some lemmas have been generalized from
3659 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
3660 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
3661 inter_Inter_fold_inter ~> inf_Inf_fold_inf
3662 union_Union_fold_union ~> sup_Sup_fold_sup
3663 Inter_fold_inter ~> Inf_fold_inf
3664 Union_fold_union ~> Sup_fold_sup
3665 inter_INTER_fold_inter ~> inf_INFI_fold_inf
3666 union_UNION_fold_union ~> sup_SUPR_fold_sup
3667 INTER_fold_inter ~> INFI_fold_inf
3668 UNION_fold_union ~> SUPR_fold_sup
3670 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
3671 replaced by the more convenient lemmas Inf_empty and Sup_empty.
3672 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
3673 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
3674 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
3675 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
3677 * Reorganized theory Multiset: swapped notation of pointwise and
3680 - pointwise ordering is instance of class order with standard syntax
3682 - multiset ordering has syntax <=# and <#; partial order properties
3683 are provided by means of interpretation with prefix
3685 - less duplication, less historical organization of sections,
3686 conversion from associations lists to multisets, rudimentary code
3688 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
3693 multiset_eq_conv_count_eq ~> multiset_ext_iff
3694 multi_count_ext ~> multiset_ext
3695 diff_union_inverse2 ~> diff_union_cancelR
3699 * Theory Permutation: replaced local "remove" by List.remove1.
3701 * Code generation: ML and OCaml code is decorated with signatures.
3703 * Theory List: added transpose.
3705 * Library/Nat_Bijection.thy is a collection of bijective functions
3706 between nat and other types, which supersedes the older libraries
3707 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
3710 Nat_Int_Bij.nat2_to_nat ~> prod_encode
3711 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
3712 Nat_Int_Bij.int_to_nat_bij ~> int_encode
3713 Nat_Int_Bij.nat_to_int_bij ~> int_decode
3714 Countable.pair_encode ~> prod_encode
3715 NatIso.prod2nat ~> prod_encode
3716 NatIso.nat2prod ~> prod_decode
3717 NatIso.sum2nat ~> sum_encode
3718 NatIso.nat2sum ~> sum_decode
3719 NatIso.list2nat ~> list_encode
3720 NatIso.nat2list ~> list_decode
3721 NatIso.set2nat ~> set_encode
3722 NatIso.nat2set ~> set_decode
3725 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
3726 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
3727 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
3728 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
3729 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
3730 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
3731 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
3732 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
3733 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
3734 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
3735 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
3736 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
3737 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
3740 - Renamed ATP commands:
3741 atp_info ~> sledgehammer running_atps
3742 atp_kill ~> sledgehammer kill_atps
3743 atp_messages ~> sledgehammer messages
3744 atp_minimize ~> sledgehammer minimize
3745 print_atps ~> sledgehammer available_atps
3747 - Added user's manual ("isabelle doc sledgehammer").
3748 - Added option syntax and "sledgehammer_params" to customize
3749 Sledgehammer's behavior. See the manual for details.
3750 - Modified the Isar proof reconstruction code so that it produces
3751 direct proofs rather than proofs by contradiction. (This feature
3752 is still experimental.)
3753 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
3755 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
3758 - Added and implemented "binary_ints" and "bits" options.
3759 - Added "std" option and implemented support for nonstandard models.
3760 - Added and implemented "finitize" option to improve the precision
3761 of infinite datatypes based on a monotonicity analysis.
3762 - Added support for quotient types.
3763 - Added support for "specification" and "ax_specification"
3765 - Added support for local definitions (for "function" and
3766 "termination" proofs).
3767 - Added support for term postprocessors.
3768 - Optimized "Multiset.multiset" and "FinFun.finfun".
3769 - Improved efficiency of "destroy_constrs" optimization.
3770 - Fixed soundness bugs related to "destroy_constrs" optimization and
3772 - Fixed soundness bug related to higher-order constructors.
3773 - Fixed soundness bug when "full_descrs" is enabled.
3774 - Improved precision of set constructs.
3775 - Added "atoms" option.
3776 - Added cache to speed up repeated Kodkod invocations on the same
3778 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
3779 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
3780 "SAT4J_Light". INCOMPATIBILITY.
3781 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
3782 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
3783 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
3785 * Method "induct" now takes instantiations of the form t, where t is not
3786 a variable, as a shorthand for "x == t", where x is a fresh variable.
3787 If this is not intended, t has to be enclosed in parentheses.
3788 By default, the equalities generated by definitional instantiations
3789 are pre-simplified, which may cause parameters of inductive cases
3790 to disappear, or may even delete some of the inductive cases.
3791 Use "induct (no_simp)" instead of "induct" to restore the old
3792 behaviour. The (no_simp) option is also understood by the "cases"
3793 and "nominal_induct" methods, which now perform pre-simplification, too.
3799 * Variable names in lemmas generated by the domain package have
3800 changed; the naming scheme is now consistent with the HOL datatype
3801 package. Some proof scripts may be affected, INCOMPATIBILITY.
3803 * The domain package no longer defines the function "foo_copy" for
3804 recursive domain "foo". The reach lemma is now stated directly in
3805 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
3806 be reformulated in terms of "foo_take", INCOMPATIBILITY.
3808 * Most definedness lemmas generated by the domain package (previously
3809 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
3810 like "foo$x = UU <-> x = UU", which works better as a simp rule.
3811 Proofs that used definedness lemmas as intro rules may break,
3812 potential INCOMPATIBILITY.
3814 * Induction and casedist rules generated by the domain package now
3815 declare proper case_names (one called "bottom", and one named for each
3816 constructor). INCOMPATIBILITY.
3818 * For mutually-recursive domains, separate "reach" and "take_lemma"
3819 rules are generated for each domain, INCOMPATIBILITY.
3821 foo_bar.reach ~> foo.reach bar.reach
3822 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
3824 * Some lemmas generated by the domain package have been renamed for
3825 consistency with the datatype package, INCOMPATIBILITY.
3827 foo.ind ~> foo.induct
3828 foo.finite_ind ~> foo.finite_induct
3829 foo.coind ~> foo.coinduct
3830 foo.casedist ~> foo.exhaust
3831 foo.exhaust ~> foo.nchotomy
3833 * For consistency with other definition packages, the fixrec package
3834 now generates qualified theorem names, INCOMPATIBILITY.
3836 foo_simps ~> foo.simps
3837 foo_unfold ~> foo.unfold
3838 foo_induct ~> foo.induct
3840 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
3841 method and internal fixrec proofs now use the default simpset instead.
3844 * The "contlub" predicate has been removed. Proof scripts should use
3845 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
3847 * The "admw" predicate has been removed, INCOMPATIBILITY.
3849 * The constants cpair, cfst, and csnd have been removed in favor of
3850 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
3855 * Antiquotations for basic formal entities:
3857 @{class NAME} -- type class
3858 @{class_syntax NAME} -- syntax representation of the above
3860 @{type_name NAME} -- logical type
3861 @{type_abbrev NAME} -- type abbreviation
3862 @{nonterminal NAME} -- type of concrete syntactic category
3863 @{type_syntax NAME} -- syntax representation of any of the above
3865 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
3866 @{const_abbrev NAME} -- abbreviated constant
3867 @{const_syntax NAME} -- syntax representation of any of the above
3869 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
3870 syntax constant (cf. 'syntax' command).
3872 * Antiquotation @{make_string} inlines a function to print arbitrary
3873 values similar to the ML toplevel. The result is compiler dependent
3874 and may fall back on "?" in certain situations.
3876 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
3877 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
3878 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
3879 not work with the asynchronous Isar document model.
3881 * Configuration options now admit dynamic default values, depending on
3882 the context or even global references.
3884 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
3885 uses an efficient external library if available (for Poly/ML).
3887 * Renamed some important ML structures, while keeping the old names
3888 for some time as aliases within the structure Legacy:
3890 OuterKeyword ~> Keyword
3893 OuterSyntax ~> Outer_Syntax
3894 PrintMode ~> Print_Mode
3895 SpecParse ~> Parse_Spec
3898 ThyOutput ~> Thy_Output
3899 TypeInfer ~> Type_Infer
3901 Note that "open Legacy" simplifies porting of sources, but forgetting
3902 to remove it again will complicate porting again in the future.
3904 * Most operations that refer to a global context are named
3905 accordingly, e.g. Simplifier.global_context or
3906 ProofContext.init_global. There are some situations where a global
3907 context actually works, but under normal circumstances one needs to
3908 pass the proper local context through the code!
3910 * Discontinued old TheoryDataFun with its copy/init operation -- data
3911 needs to be pure. Functor Theory_Data_PP retains the traditional
3912 Pretty.pp argument to merge, which is absent in the standard
3913 Theory_Data version.
3915 * Sorts.certify_sort and derived "cert" operations for types and terms
3916 no longer minimize sorts. Thus certification at the boundary of the
3917 inference kernel becomes invariant under addition of class relations,
3918 which is an important monotonicity principle. Sorts are now minimized
3919 in the syntax layer only, at the boundary between the end-user and the
3920 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
3921 explicitly in rare situations.
3923 * Renamed old-style Drule.standard to Drule.export_without_context, to
3924 emphasize that this is in no way a standard operation.
3927 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
3928 usual for resolution. Rare INCOMPATIBILITY.
3930 * Renamed varify/unvarify operations to varify_global/unvarify_global
3931 to emphasize that these only work in a global situation (which is
3934 * Curried take and drop in library.ML; negative length is interpreted
3935 as infinity (as in chop). Subtle INCOMPATIBILITY.
3937 * Proof terms: type substitutions on proof constants now use canonical
3938 order of type variables. INCOMPATIBILITY for tools working with proof
3941 * Raw axioms/defs may no longer carry sort constraints, and raw defs
3942 may no longer carry premises. User-level specifications are
3943 transformed accordingly by Thm.add_axiom/add_def.
3948 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
3949 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
3950 proof terms are enabled unconditionally in the new HOL-Proofs image.
3952 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
3953 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
3956 * Old lib/scripts/polyml-platform is superseded by the
3957 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
3958 variant, even on a 64 bit machine. The following example setting
3959 prefers 64 bit if available:
3961 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
3963 * The preliminary Isabelle/jEdit application demonstrates the emerging
3964 Isabelle/Scala layer for advanced prover interaction and integration.
3965 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
3968 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
3969 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
3970 similar to the default assignment of the document preparation system
3971 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
3972 provides some operations for direct access to the font without asking
3973 the user for manual installation.
3977 New in Isabelle2009-1 (December 2009)
3978 -------------------------------------
3982 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
3983 one backslash should be used, even in ML sources.
3988 * Locale interpretation propagates mixins along the locale hierarchy.
3989 The currently only available mixins are the equations used to map
3990 local definitions to terms of the target domain of an interpretation.
3992 * Reactivated diagnostic command 'print_interps'. Use "print_interps
3993 loc" to print all interpretations of locale "loc" in the theory.
3994 Interpretations in proofs are not shown.
3996 * Thoroughly revised locales tutorial. New section on conditional
3999 * On instantiation of classes, remaining undefined class parameters
4000 are formally declared. INCOMPATIBILITY.
4003 *** Document preparation ***
4005 * New generalized style concept for printing terms: @{foo (style) ...}
4006 instead of @{foo_style style ...} (old form is still retained for
4007 backward compatibility). Styles can be also applied for
4008 antiquotations prop, term_type and typeof.
4013 * New proof method "smt" for a combination of first-order logic with
4014 equality, linear and nonlinear (natural/integer/real) arithmetic, and
4015 fixed-size bitvectors; there is also basic support for higher-order
4016 features (esp. lambda abstractions). It is an incomplete decision
4017 procedure based on external SMT solvers using the oracle mechanism;
4018 for the SMT solver Z3, this method is proof-producing. Certificates
4019 are provided to avoid calling the external solvers solely for
4020 re-checking proofs. Due to a remote SMT service there is no need for
4021 installing SMT solvers locally. See src/HOL/SMT.
4023 * New commands to load and prove verification conditions generated by
4024 the Boogie program verifier or derived systems (e.g. the Verifying C
4025 Compiler (VCC) or Spec#). See src/HOL/Boogie.
4027 * New counterexample generator tool 'nitpick' based on the Kodkod
4028 relational model finder. See src/HOL/Tools/Nitpick and
4029 src/HOL/Nitpick_Examples.
4031 * New commands 'code_pred' and 'values' to invoke the predicate
4032 compiler and to enumerate values of inductive predicates.
4034 * A tabled implementation of the reflexive transitive closure.
4036 * New implementation of quickcheck uses generic code generator;
4037 default generators are provided for all suitable HOL types, records
4038 and datatypes. Old quickcheck can be re-activated importing theory
4039 Library/SML_Quickcheck.
4041 * New testing tool Mirabelle for automated proof tools. Applies
4042 several tools and tactics like sledgehammer, metis, or quickcheck, to
4043 every proof step in a theory. To be used in batch mode via the
4044 "mirabelle" utility.
4046 * New proof method "sos" (sum of squares) for nonlinear real
4047 arithmetic (originally due to John Harison). It requires theory
4048 Library/Sum_Of_Squares. It is not a complete decision procedure but
4049 works well in practice on quantifier-free real arithmetic with +, -,
4050 *, ^, =, <= and <, i.e. boolean combinations of equalities and
4051 inequalities between polynomials. It makes use of external
4052 semidefinite programming solvers. Method "sos" generates a
4053 certificate that can be pasted into the proof thus avoiding the need
4054 to call an external tool every time the proof is checked. See
4055 src/HOL/Library/Sum_Of_Squares.
4057 * New method "linarith" invokes existing linear arithmetic decision
4060 * New command 'atp_minimal' reduces result produced by Sledgehammer.
4062 * New Sledgehammer option "Full Types" in Proof General settings menu.
4063 Causes full type information to be output to the ATPs. This slows
4064 ATPs down considerably but eliminates a source of unsound "proofs"
4067 * New method "metisFT": A version of metis that uses full type
4068 information in order to avoid failures of proof reconstruction.
4070 * New evaluator "approximate" approximates an real valued term using
4071 the same method as the approximation method.
4073 * Method "approximate" now supports arithmetic expressions as
4074 boundaries of intervals and implements interval splitting and Taylor
4077 * ML antiquotation @{code_datatype} inserts definition of a datatype
4078 generated by the code generator; e.g. see src/HOL/Predicate.thy.
4080 * New theory SupInf of the supremum and infimum operators for sets of
4083 * New theory Probability, which contains a development of measure
4084 theory, eventually leading to Lebesgue integration and probability.
4086 * Extended Multivariate Analysis to include derivation and Brouwer's
4089 * Reorganization of number theory, INCOMPATIBILITY:
4090 - new number theory development for nat and int, in theories Divides
4091 and GCD as well as in new session Number_Theory
4092 - some constants and facts now suffixed with _nat and _int
4094 - former session NumberTheory now named Old_Number_Theory, including
4095 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
4096 - moved theory Pocklington from src/HOL/Library to
4097 src/HOL/Old_Number_Theory
4099 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
4100 lcm of finite and infinite sets. It is shown that they form a complete
4103 * Class semiring_div requires superclass no_zero_divisors and proof of
4104 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
4105 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
4106 generalized to class semiring_div, subsuming former theorems
4107 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
4108 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
4111 * Refinements to lattice classes and sets:
4112 - less default intro/elim rules in locale variant, more default
4113 intro/elim rules in class variant: more uniformity
4114 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
4116 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
4118 - renamed ACI to inf_sup_aci
4119 - new class "boolean_algebra"
4120 - class "complete_lattice" moved to separate theory
4121 "Complete_Lattice"; corresponding constants (and abbreviations)
4122 renamed and with authentic syntax:
4123 Set.Inf ~> Complete_Lattice.Inf
4124 Set.Sup ~> Complete_Lattice.Sup
4125 Set.INFI ~> Complete_Lattice.INFI
4126 Set.SUPR ~> Complete_Lattice.SUPR
4127 Set.Inter ~> Complete_Lattice.Inter
4128 Set.Union ~> Complete_Lattice.Union
4129 Set.INTER ~> Complete_Lattice.INTER
4130 Set.UNION ~> Complete_Lattice.UNION
4131 - authentic syntax for
4134 - mere abbreviations:
4137 Set.inter (for inf, formerly Set.Int)
4138 Set.union (for sup, formerly Set.Un)
4139 Complete_Lattice.Inter (for Inf)
4140 Complete_Lattice.Union (for Sup)
4141 Complete_Lattice.INTER (for INFI)
4142 Complete_Lattice.UNION (for SUPR)
4143 - object-logic definitions as far as appropriate
4145 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
4146 Un_subset_iff are explicitly deleted as default simp rules; then also
4147 their lattice counterparts le_inf_iff and le_sup_iff have to be
4148 deleted to achieve the desired effect.
4150 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
4151 rules by default any longer; the same applies to min_max.inf_absorb1
4152 etc. INCOMPATIBILITY.
4154 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
4155 pred_set_conv by default. INCOMPATIBILITY.
4157 * Power operations on relations and functions are now one dedicated
4158 constant "compow" with infix syntax "^^". Power operation on
4159 multiplicative monoids retains syntax "^" and is now defined generic
4160 in class power. INCOMPATIBILITY.
4162 * Relation composition "R O S" now has a more standard argument order:
4163 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
4164 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
4165 break, since the O_assoc rule was not rewritten like this. Fix using
4166 O_assoc[symmetric]. The same applies to the curried version "R OO S".
4168 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
4169 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
4172 * Most rules produced by inductive and datatype package have mandatory
4173 prefixes. INCOMPATIBILITY.
4175 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
4176 the attribute of the same name. Each of the theorems in the list
4177 DERIV_intros assumes composition with an additional function and
4178 matches a variable to the derivative, which has to be solved by the
4179 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
4180 of most elementary terms. Former Maclauren.DERIV_tac and
4181 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
4184 * Code generator attributes follow the usual underscore convention:
4185 code_unfold replaces code unfold
4186 code_post replaces code post
4191 sizechange -> size_change
4192 induct_scheme -> induction_schema
4195 * Discontinued abbreviation "arbitrary" of constant "undefined".
4196 INCOMPATIBILITY, use "undefined" directly.
4199 Suc_eq_add_numeral_1 -> Suc_eq_plus1
4200 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
4201 Suc_plus1 -> Suc_eq_plus1
4202 *anti_sym -> *antisym*
4203 vector_less_eq_def -> vector_le_def
4206 * Added theorem List.map_map as [simp]. Removed List.map_compose.
4209 * Removed predicate "M hassize n" (<--> card M = n & finite M).
4215 * Theory Representable defines a class "rep" of domains that are
4216 representable (via an ep-pair) in the universal domain type "udom".
4217 Instances are provided for all type constructors defined in HOLCF.
4219 * The 'new_domain' command is a purely definitional version of the
4220 domain package, for representable domains. Syntax is identical to the
4221 old domain package. The 'new_domain' package also supports indirect
4222 recursion using previously-defined type constructors. See
4223 src/HOLCF/ex/New_Domain.thy for examples.
4225 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
4226 on the left-hand side of an equation, and then performs
4227 simplification. Rewriting is done using rules declared with the
4228 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
4229 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
4231 * The pattern-match compiler in 'fixrec' can now handle constructors
4232 with HOL function types. Pattern-match combinators for the Pair
4233 constructor are pre-configured.
4235 * The 'fixrec' package now produces better fixed-point induction rules
4236 for mutually-recursive definitions: Induction rules have conclusions
4237 of the form "P foo bar" instead of "P <foo, bar>".
4239 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
4240 been renamed to "below". The name "below" now replaces "less" in many
4241 theorem names. (Legacy theorem names using "less" are still supported
4244 * The 'fixrec' package now supports "bottom patterns". Bottom
4245 patterns can be used to generate strictness rules, or to make
4246 functions more strict (much like the bang-patterns supported by the
4247 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
4253 * Support for Poly/ML 5.3.0, with improved reporting of compiler
4254 errors and run-time exceptions, including detailed source positions.
4256 * Structure Name_Space (formerly NameSpace) now manages uniquely
4257 identified entries, with some additional information such as source
4258 position, logical grouping etc.
4260 * Theory and context data is now introduced by the simplified and
4261 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
4262 to be pure, but the old TheoryDataFun for mutable data (with explicit
4263 copy operation) is still available for some time.
4265 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
4266 provides a high-level programming interface to synchronized state
4267 variables with atomic update. This works via pure function
4268 application within a critical section -- its runtime should be as
4269 short as possible; beware of deadlocks if critical code is nested,
4270 either directly or indirectly via other synchronized variables!
4272 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
4273 wraps raw ML references, explicitly indicating their non-thread-safe
4274 behaviour. The Isar toplevel keeps this structure open, to
4275 accommodate Proof General as well as quick and dirty interactive
4276 experiments with references.
4278 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
4279 parallel tactical reasoning.
4281 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
4282 are similar to SUBPROOF, but are slightly more flexible: only the
4283 specified parts of the subgoal are imported into the context, and the
4284 body tactic may introduce new subgoals and schematic variables.
4286 * Old tactical METAHYPS, which does not observe the proof context, has
4287 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
4288 or Subgoal.FOCUS etc.
4290 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
4291 functors have their own ML name space there is no point to mark them
4292 separately.) Minor INCOMPATIBILITY.
4294 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
4296 * Renamed several structures FooBar to Foo_Bar. Occasional,
4299 * Operations of structure Skip_Proof no longer require quick_and_dirty
4300 mode, which avoids critical setmp.
4302 * Eliminated old Attrib.add_attributes, Method.add_methods and related
4303 combinators for "args". INCOMPATIBILITY, need to use simplified
4304 Attrib/Method.setup introduced in Isabelle2009.
4306 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
4307 back on global_simpset_of, global_claset_of, global_clasimpset_of as
4308 last resort. INCOMPATIBILITY.
4310 * Display.pretty_thm now requires a proper context (cf. former
4311 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
4312 or even Display.pretty_thm_without_context as last resort.
4315 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
4316 Syntax.pretty_typ/term directly, preferably with proper context
4317 instead of global theory.
4322 * Further fine tuning of parallel proof checking, scales up to 8 cores
4323 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
4326 * Support for additional "Isabelle components" via etc/components, see
4327 also the system manual.
4329 * The isabelle makeall tool now operates on all components with
4330 IsaMakefile, not just hardwired "logics".
4332 * Removed "compress" option from isabelle-process and isabelle usedir;
4333 this is always enabled.
4335 * Discontinued support for Poly/ML 4.x versions.
4337 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
4338 on a given logic image. This requires the lighttpd webserver and is
4339 currently supported on Linux only.
4343 New in Isabelle2009 (April 2009)
4344 --------------------------------
4348 * Simplified main Isabelle executables, with less surprises on
4349 case-insensitive file-systems (such as Mac OS).
4351 - The main Isabelle tool wrapper is now called "isabelle" instead of
4354 - The former "isabelle" alias for "isabelle-process" has been
4355 removed (should rarely occur to regular users).
4357 - The former "isabelle-interface" and its alias "Isabelle" have been
4358 removed (interfaces are now regular Isabelle tools).
4360 Within scripts and make files, the Isabelle environment variables
4361 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
4362 respectively. (The latter are still available as legacy feature.)
4364 The old isabelle-interface wrapper could react in confusing ways if
4365 the interface was uninstalled or changed otherwise. Individual
4366 interface tool configuration is now more explicit, see also the
4367 Isabelle system manual. In particular, Proof General is now available
4368 via "isabelle emacs".
4370 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
4371 purge installed copies of Isabelle executables and re-run "isabelle
4372 install -p ...", or use symlinks.
4374 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
4375 old ~/isabelle, which was slightly non-standard and apt to cause
4376 surprises on case-insensitive file-systems (such as Mac OS).
4378 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
4379 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
4380 care is required when using older releases of Isabelle. Note that
4381 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
4382 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
4384 * Proofs of fully specified statements are run in parallel on
4385 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
4386 a regular 4-core machine, if the initial heap space is made reasonably
4387 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
4389 * The main reference manuals ("isar-ref", "implementation", and
4390 "system") have been updated and extended. Formally checked references
4391 as hyperlinks are now available uniformly.
4396 * Complete re-implementation of locales. INCOMPATIBILITY in several
4397 respects. The most important changes are listed below. See the
4398 Tutorial on Locales ("locales" manual) for details.
4400 - In locale expressions, instantiation replaces renaming. Parameters
4401 must be declared in a for clause. To aid compatibility with previous
4402 parameter inheritance, in locale declarations, parameters that are not
4403 'touched' (instantiation position "_" or omitted) are implicitly added
4404 with their syntax at the beginning of the for clause.
4406 - Syntax from abbreviations and definitions in locales is available in
4407 locale expressions and context elements. The latter is particularly
4408 useful in locale declarations.
4410 - More flexible mechanisms to qualify names generated by locale
4411 expressions. Qualifiers (prefixes) may be specified in locale
4412 expressions, and can be marked as mandatory (syntax: "name!:") or
4413 optional (syntax "name?:"). The default depends for plain "name:"
4414 depends on the situation where a locale expression is used: in
4415 commands 'locale' and 'sublocale' prefixes are optional, in
4416 'interpretation' and 'interpret' prefixes are mandatory. The old
4417 implicit qualifiers derived from the parameter names of a locale are
4418 no longer generated.
4420 - Command "sublocale l < e" replaces "interpretation l < e". The
4421 instantiation clause in "interpretation" and "interpret" (square
4422 brackets) is no longer available. Use locale expressions.
4424 - When converting proof scripts, mandatory qualifiers in
4425 'interpretation' and 'interpret' should be retained by default, even
4426 if this is an INCOMPATIBILITY compared to former behavior. In the
4427 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
4428 in locale expressions range over a single locale instance only.
4430 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
4431 In existing theorem specifications replace the includes element by the
4432 respective context elements of the included locale, omitting those
4433 that are already present in the theorem specification. Multiple
4434 assume elements of a locale should be replaced by a single one
4435 involving the locale predicate. In the proof body, declarations (most
4436 notably theorems) may be regained by interpreting the respective
4437 locales in the proof context as required (command "interpret").
4439 If using "includes" in replacement of a target solely because the
4440 parameter types in the theorem are not as general as in the target,
4441 consider declaring a new locale with additional type constraints on
4442 the parameters (context element "constrains").
4444 - Discontinued "locale (open)". INCOMPATIBILITY.
4446 - Locale interpretation commands no longer attempt to simplify goal.
4447 INCOMPATIBILITY: in rare situations the generated goal differs. Use
4448 methods intro_locales and unfold_locales to clarify.
4450 - Locale interpretation commands no longer accept interpretation
4451 attributes. INCOMPATIBILITY.
4453 * Class declaration: so-called "base sort" must not be given in import
4454 list any longer, but is inferred from the specification. Particularly
4461 class foo = type + ...
4463 * Class target: global versions of theorems stemming do not carry a
4464 parameter prefix any longer. INCOMPATIBILITY.
4466 * Class 'instance' command no longer accepts attached definitions.
4467 INCOMPATIBILITY, use proper 'instantiation' target instead.
4469 * Recovered hiding of consts, which was accidentally broken in
4470 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
4471 makes c inaccessible; consider using ``hide (open) const c'' instead.
4473 * Slightly more coherent Pure syntax, with updated documentation in
4474 isar-ref manual. Removed locales meta_term_syntax and
4475 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
4476 INCOMPATIBILITY in rare situations. Note that &&& should not be used
4477 directly in regular applications.
4479 * There is a new syntactic category "float_const" for signed decimal
4480 fractions (e.g. 123.45 or -123.45).
4482 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
4483 interface with 'setup' command instead.
4485 * Command 'local_setup' is similar to 'setup', but operates on a local
4488 * The 'axiomatization' command now only works within a global theory
4489 context. INCOMPATIBILITY.
4491 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
4492 hypotheses. Sorts required in the course of reasoning need to be
4493 covered by the constraints in the initial statement, completed by the
4494 type instance information of the background theory. Non-trivial sort
4495 hypotheses, which rarely occur in practice, may be specified via
4496 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
4498 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
4500 The result contains an implicit sort hypotheses as before --
4501 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
4504 * Generalized Isar history, with support for linear undo, direct state
4507 * Changed defaults for unify configuration options:
4509 unify_trace_bound = 50 (formerly 25)
4510 unify_search_bound = 60 (formerly 30)
4512 * Different bookkeeping for code equations (INCOMPATIBILITY):
4514 a) On theory merge, the last set of code equations for a particular
4515 constant is taken (in accordance with the policy applied by other
4516 parts of the code generator framework).
4518 b) Code equations stemming from explicit declarations (e.g. code
4519 attribute) gain priority over default code equations stemming
4520 from definition, primrec, fun etc.
4522 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
4524 * Unified theorem tables for both code generators. Thus [code
4525 func] has disappeared and only [code] remains. INCOMPATIBILITY.
4527 * Command 'find_consts' searches for constants based on type and name
4530 find_consts "_ => bool"
4532 By default, matching is against subtypes, but it may be restricted to
4533 the whole type. Searching by name is possible. Multiple queries are
4534 conjunctive and queries may be negated by prefixing them with a
4537 find_consts strict: "_ => bool" name: "Int" -"int => int"
4539 * New 'find_theorems' criterion "solves" matches theorems that
4540 directly solve the current goal (modulo higher-order unification).
4542 * Auto solve feature for main theorem statements: whenever a new goal
4543 is stated, "find_theorems solves" is called; any theorems that could
4544 solve the lemma directly are listed as part of the goal state.
4545 Cf. associated options in Proof General Isabelle settings menu,
4546 enabled by default, with reasonable timeout for pathological cases of
4547 higher-order unification.
4550 *** Document preparation ***
4552 * Antiquotation @{lemma} now imitates a regular terminal proof,
4553 demanding keyword 'by' and supporting the full method expression
4554 syntax just like the Isar command 'by'.
4559 * Integrated main parts of former image HOL-Complex with HOL. Entry
4560 points Main and Complex_Main remain as before.
4562 * Logic image HOL-Plain provides a minimal HOL with the most important
4563 tools available (inductive, datatype, primrec, ...). This facilitates
4564 experimentation and tool development. Note that user applications
4565 (and library theories) should never refer to anything below theory
4568 * Logic image HOL-Main stops at theory Main, and thus facilitates
4569 experimentation due to shorter build times.
4571 * Logic image HOL-NSA contains theories of nonstandard analysis which
4572 were previously part of former HOL-Complex. Entry point Hyperreal
4573 remains valid, but theories formerly using Complex_Main should now use
4574 new entry point Hypercomplex.
4576 * Generic ATP manager for Sledgehammer, based on ML threads instead of
4577 Posix processes. Avoids potentially expensive forking of the ML
4578 process. New thread-based implementation also works on non-Unix
4579 platforms (Cygwin). Provers are no longer hardwired, but defined
4580 within the theory via plain ML wrapper functions. Basic Sledgehammer
4581 commands are covered in the isar-ref manual.
4583 * Wrapper scripts for remote SystemOnTPTP service allows to use
4584 sledgehammer without local ATP installation (Vampire etc.). Other
4585 provers may be included via suitable ML wrappers, see also
4586 src/HOL/ATP_Linkup.thy.
4588 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
4591 * The metis method no longer fails because the theorem is too trivial
4592 (contains the empty clause).
4594 * The metis method now fails in the usual manner, rather than raising
4595 an exception, if it determines that it cannot prove the theorem.
4597 * Method "coherent" implements a prover for coherent logic (see also
4598 src/Tools/coherent.ML).
4600 * Constants "undefined" and "default" replace "arbitrary". Usually
4601 "undefined" is the right choice to replace "arbitrary", though
4602 logically there is no difference. INCOMPATIBILITY.
4604 * Command "value" now integrates different evaluation mechanisms. The
4605 result of the first successful evaluation mechanism is printed. In
4606 square brackets a particular named evaluation mechanisms may be
4607 specified (currently, [SML], [code] or [nbe]). See further
4608 src/HOL/ex/Eval_Examples.thy.
4610 * Normalization by evaluation now allows non-leftlinear equations.
4611 Declare with attribute [code nbe].
4613 * Methods "case_tac" and "induct_tac" now refer to the very same rules
4614 as the structured Isar versions "cases" and "induct", cf. the
4615 corresponding "cases" and "induct" attributes. Mutual induction rules
4616 are now presented as a list of individual projections
4617 (e.g. foo_bar.inducts for types foo and bar); the old format with
4618 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
4619 rare situations a different rule is selected --- notably nested tuple
4620 elimination instead of former prod.exhaust: use explicit (case_tac t
4621 rule: prod.exhaust) here.
4623 * Attributes "cases", "induct", "coinduct" support "del" option.
4625 * Removed fact "case_split_thm", which duplicates "case_split".
4627 * The option datatype has been moved to a new theory Option. Renamed
4628 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
4630 * New predicate "strict_mono" classifies strict functions on partial
4631 orders. With strict functions on linear orders, reasoning about
4632 (in)equalities is facilitated by theorems "strict_mono_eq",
4633 "strict_mono_less_eq" and "strict_mono_less".
4635 * Some set operations are now proper qualified constants with
4636 authentic syntax. INCOMPATIBILITY:
4647 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
4650 * Auxiliary class "itself" has disappeared -- classes without any
4651 parameter are treated as expected by the 'class' command.
4653 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
4655 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
4656 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
4658 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
4659 method "approximation". It proves formulas on real values by using
4660 interval arithmetic. In the formulas are also the transcendental
4661 functions sin, cos, tan, atan, ln, exp and the constant pi are
4662 allowed. For examples see
4663 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
4665 * Theory "Reflection" now resides in HOL/Library.
4667 * Entry point to Word library now simply named "Word".
4670 * Made source layout more coherent with logical distribution
4673 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
4674 src/HOL/Library/Code_Message.thy ~> src/HOL/
4675 src/HOL/Library/GCD.thy ~> src/HOL/
4676 src/HOL/Library/Order_Relation.thy ~> src/HOL/
4677 src/HOL/Library/Parity.thy ~> src/HOL/
4678 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
4679 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
4680 src/HOL/Real/Lubs.thy ~> src/HOL/
4681 src/HOL/Real/PReal.thy ~> src/HOL/
4682 src/HOL/Real/Rational.thy ~> src/HOL/
4683 src/HOL/Real/RComplete.thy ~> src/HOL/
4684 src/HOL/Real/RealDef.thy ~> src/HOL/
4685 src/HOL/Real/RealPow.thy ~> src/HOL/
4686 src/HOL/Real/Real.thy ~> src/HOL/
4687 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
4688 src/HOL/Complex/Complex.thy ~> src/HOL/
4689 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
4690 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
4691 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
4692 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
4693 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
4694 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
4695 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
4696 src/HOL/Hyperreal/Log.thy ~> src/HOL/
4697 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
4698 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
4699 src/HOL/Hyperreal/Series.thy ~> src/HOL/
4700 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
4701 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
4702 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
4703 src/HOL/Real/Float ~> src/HOL/Library/
4704 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
4705 src/HOL/Real/RealVector.thy ~> src/HOL/
4707 src/HOL/arith_data.ML ~> src/HOL/Tools
4708 src/HOL/hologic.ML ~> src/HOL/Tools
4709 src/HOL/simpdata.ML ~> src/HOL/Tools
4710 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
4711 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
4712 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
4713 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
4714 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
4715 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
4716 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
4718 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
4719 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
4720 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
4721 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
4722 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
4723 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
4725 * If methods "eval" and "evaluation" encounter a structured proof
4726 state with !!/==>, only the conclusion is evaluated to True (if
4727 possible), avoiding strange error messages.
4729 * Method "sizechange" automates termination proofs using (a
4730 modification of) the size-change principle. Requires SAT solver. See
4731 src/HOL/ex/Termination.thy for examples.
4733 * Simplifier: simproc for let expressions now unfolds if bound
4734 variable occurs at most once in let expression body. INCOMPATIBILITY.
4736 * Method "arith": Linear arithmetic now ignores all inequalities when
4737 fast_arith_neq_limit is exceeded, instead of giving up entirely.
4739 * New attribute "arith" for facts that should always be used
4740 automatically by arithmetic. It is intended to be used locally in
4743 assumes [arith]: "x > 0"
4745 Global usage is discouraged because of possible performance impact.
4747 * New classes "top" and "bot" with corresponding operations "top" and
4748 "bot" in theory Orderings; instantiation of class "complete_lattice"
4749 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
4751 * Changed definition lemma "less_fun_def" in order to provide an
4752 instance for preorders on functions; use lemma "less_le" instead.
4755 * Theory Orderings: class "wellorder" moved here, with explicit
4756 induction rule "less_induct" as assumption. For instantiation of
4757 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
4760 * Theory Orderings: added class "preorder" as superclass of "order".
4761 INCOMPATIBILITY: Instantiation proofs for order, linorder
4762 etc. slightly changed. Some theorems named order_class.* now named
4765 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
4768 * Theory Finite_Set: added a new fold combinator of type
4770 ('a => 'b => 'b) => 'b => 'a set => 'b
4772 Occasionally this is more convenient than the old fold combinator
4773 which is now defined in terms of the new one and renamed to
4776 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
4777 and "ring_simps" have been replaced by "algebra_simps" (which can be
4778 extended with further lemmas!). At the moment both still exist but
4779 the former will disappear at some point.
4781 * Theory Power: Lemma power_Suc is now declared as a simp rule in
4782 class recpower. Type-specific simp rules for various recpower types
4783 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
4785 rat_power_0 -> power_0
4786 rat_power_Suc -> power_Suc
4787 realpow_0 -> power_0
4788 realpow_Suc -> power_Suc
4789 complexpow_0 -> power_0
4790 complexpow_Suc -> power_Suc
4791 power_poly_0 -> power_0
4792 power_poly_Suc -> power_Suc
4794 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
4795 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
4796 dvd has been generalized to class comm_semiring_1. Likewise a bunch
4797 of lemmas from Divides has been generalized from nat to class
4798 semiring_div. INCOMPATIBILITY. This involves the following theorem
4799 renames resulting from duplicate elimination:
4801 dvd_def_mod ~> dvd_eq_mod_eq_0
4802 zero_dvd_iff ~> dvd_0_left_iff
4803 dvd_0 ~> dvd_0_right
4804 DIVISION_BY_ZERO_DIV ~> div_by_0
4805 DIVISION_BY_ZERO_MOD ~> mod_by_0
4806 mult_div ~> div_mult_self2_is_id
4807 mult_mod ~> mod_mult_self2_is_0
4809 * Theory IntDiv: removed many lemmas that are instances of class-based
4810 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
4811 rename old lemmas as follows:
4813 dvd_diff -> nat_dvd_diff
4814 dvd_zminus_iff -> dvd_minus_iff
4815 mod_add1_eq -> mod_add_eq
4816 mod_mult1_eq -> mod_mult_right_eq
4817 mod_mult1_eq' -> mod_mult_left_eq
4818 mod_mult_distrib_mod -> mod_mult_eq
4819 nat_mod_add_left_eq -> mod_add_left_eq
4820 nat_mod_add_right_eq -> mod_add_right_eq
4821 nat_mod_div_trivial -> mod_div_trivial
4822 nat_mod_mod_trivial -> mod_mod_trivial
4823 zdiv_zadd_self1 -> div_add_self1
4824 zdiv_zadd_self2 -> div_add_self2
4825 zdiv_zmult_self1 -> div_mult_self2_is_id
4826 zdiv_zmult_self2 -> div_mult_self1_is_id
4827 zdvd_triv_left -> dvd_triv_left
4828 zdvd_triv_right -> dvd_triv_right
4829 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
4830 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
4831 zmod_zadd_left_eq -> mod_add_left_eq
4832 zmod_zadd_right_eq -> mod_add_right_eq
4833 zmod_zadd_self1 -> mod_add_self1
4834 zmod_zadd_self2 -> mod_add_self2
4835 zmod_zadd1_eq -> mod_add_eq
4836 zmod_zdiff1_eq -> mod_diff_eq
4837 zmod_zdvd_zmod -> mod_mod_cancel
4838 zmod_zmod_cancel -> mod_mod_cancel
4839 zmod_zmult_self1 -> mod_mult_self2_is_0
4840 zmod_zmult_self2 -> mod_mult_self1_is_0
4843 zdvd_abs1 -> abs_dvd_iff
4844 zdvd_abs2 -> dvd_abs_iff
4845 zdvd_refl -> dvd_refl
4846 zdvd_trans -> dvd_trans
4847 zdvd_zadd -> dvd_add
4848 zdvd_zdiff -> dvd_diff
4849 zdvd_zminus_iff -> dvd_minus_iff
4850 zdvd_zminus2_iff -> minus_dvd_iff
4851 zdvd_zmultD -> dvd_mult_right
4852 zdvd_zmultD2 -> dvd_mult_left
4853 zdvd_zmult_mono -> mult_dvd_mono
4854 zdvd_0_right -> dvd_0_right
4855 zdvd_0_left -> dvd_0_left_iff
4856 zdvd_1_left -> one_dvd
4857 zminus_dvd_iff -> minus_dvd_iff
4859 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
4861 * The real numbers offer decimal input syntax: 12.34 is translated
4862 into 1234/10^2. This translation is not reversed upon output.
4864 * Theory Library/Polynomial defines an abstract type 'a poly of
4865 univariate polynomials with coefficients of type 'a. In addition to
4866 the standard ring operations, it also supports div and mod. Code
4867 generation is also supported, using list-style constructors.
4869 * Theory Library/Inner_Product defines a class of real_inner for real
4870 inner product spaces, with an overloaded operation inner :: 'a => 'a
4871 => real. Class real_inner is a subclass of real_normed_vector from
4874 * Theory Library/Product_Vector provides instances for the product
4875 type 'a * 'b of several classes from RealVector and Inner_Product.
4876 Definitions of addition, subtraction, scalar multiplication, norms,
4877 and inner products are included.
4879 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
4880 addition to the field operations, numerals and case syntax are also
4883 * Theory Library/Diagonalize provides constructive version of Cantor's
4884 first diagonalization argument.
4886 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
4887 zlcm (for int); carried together from various gcd/lcm developements in
4888 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
4889 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
4890 may recover tupled syntax as follows:
4892 hide (open) const gcd
4893 abbreviation gcd where
4894 "gcd == (%(a, b). GCD.gcd a b)"
4896 GCD.gcd ("gcd '(_, _')")
4898 The same works for lcm, zgcd, zlcm.
4900 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
4901 instantiations for algebraic structures. Removed some duplicate
4902 theorems. Changes in simp rules. INCOMPATIBILITY.
4904 * ML antiquotation @{code} takes a constant as argument and generates
4905 corresponding code in background and inserts name of the corresponding
4906 resulting ML value/function/datatype constructor binding in place.
4907 All occurrences of @{code} with a single ML block are generated
4908 simultaneously. Provides a generic and safe interface for
4909 instrumentalizing code generation. See
4910 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
4911 In future you ought to refrain from ad-hoc compiling generated SML
4912 code on the ML toplevel. Note that (for technical reasons) @{code}
4913 cannot refer to constants for which user-defined serializations are
4914 set. Refer to the corresponding ML counterpart directly in that
4917 * Command 'rep_datatype': instead of theorem names the command now
4918 takes a list of terms denoting the constructors of the type to be
4919 represented as datatype. The characteristic theorems have to be
4920 proven. INCOMPATIBILITY. Also observe that the following theorems
4921 have disappeared in favour of existing ones:
4923 unit_induct ~> unit.induct
4924 prod_induct ~> prod.induct
4925 sum_induct ~> sum.induct
4926 Suc_Suc_eq ~> nat.inject
4927 Suc_not_Zero Zero_not_Suc ~> nat.distinct
4932 * New locales for orders and lattices where the equivalence relation
4933 is not restricted to equality. INCOMPATIBILITY: all order and lattice
4934 locales use a record structure with field eq for the equivalence.
4936 * New theory of factorial domains.
4938 * Units_l_inv and Units_r_inv are now simp rules by default.
4939 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
4940 and/or r_inv will now also require deletion of these lemmas.
4942 * Renamed the following theorems, INCOMPATIBILITY:
4944 UpperD ~> Upper_memD
4945 LowerD ~> Lower_memD
4946 least_carrier ~> least_closed
4947 greatest_carrier ~> greatest_closed
4948 greatest_Lower_above ~> greatest_Lower_below
4949 one_zero ~> carrier_one_zero
4950 one_not_zero ~> carrier_one_not_zero (collision with assumption)
4955 * Nominal datatypes can now contain type-variables.
4957 * Commands 'nominal_inductive' and 'equivariance' work with local
4960 * Nominal primrec can now works with local theory targets and its
4961 specification syntax now conforms to the general format as seen in
4964 * Method "perm_simp" honours the standard simplifier attributes
4965 (no_asm), (no_asm_use) etc.
4967 * The new predicate #* is defined like freshness, except that on the
4968 left hand side can be a set or list of atoms.
4970 * Experimental command 'nominal_inductive2' derives strong induction
4971 principles for inductive definitions. In contrast to
4972 'nominal_inductive', which can only deal with a fixed number of
4973 binders, it can deal with arbitrary expressions standing for sets of
4974 atoms to be avoided. The only inductive definition we have at the
4975 moment that needs this generalisation is the typing rule for Lets in
4978 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
4979 -----------------------------------------------------------------
4980 Gamma |- Let x be t1 in t2 : T2
4982 In this rule one wants to avoid all the binders that are introduced by
4983 "close Gamma T1". We are looking for other examples where this
4984 feature might be useful. Please let us know.
4989 * Reimplemented the simplification procedure for proving continuity
4990 subgoals. The new simproc is extensible; users can declare additional
4991 continuity introduction rules with the attribute [cont2cont].
4993 * The continuity simproc now uses a different introduction rule for
4994 solving continuity subgoals on terms with lambda abstractions. In
4995 some rare cases the new simproc may fail to solve subgoals that the
4996 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
4997 Potential INCOMPATIBILITY.
4999 * Command 'fixrec': specification syntax now conforms to the general
5000 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
5001 examples. INCOMPATIBILITY.
5006 * Proof of Zorn's Lemma for partial orders.
5011 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
5012 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
5013 depends on multithreading, so timouts will not work before Poly/ML
5016 * High-level support for concurrent ML programming, see
5017 src/Pure/Cuncurrent. The data-oriented model of "future values" is
5018 particularly convenient to organize independent functional
5019 computations. The concept of "synchronized variables" provides a
5020 higher-order interface for components with shared state, avoiding the
5021 delicate details of mutexes and condition variables. (Requires
5022 Poly/ML 5.2.1 or later.)
5024 * ML bindings produced via Isar commands are stored within the Isar
5025 context (theory or proof). Consequently, commands like 'use' and 'ML'
5026 become thread-safe and work with undo as expected (concerning
5027 top-level bindings, not side-effects on global references).
5028 INCOMPATIBILITY, need to provide proper Isar context when invoking the
5029 compiler at runtime; really global bindings need to be given outside a
5030 theory. (Requires Poly/ML 5.2 or later.)
5032 * Command 'ML_prf' is analogous to 'ML' but works within a proof
5033 context. Top-level ML bindings are stored within the proof context in
5034 a purely sequential fashion, disregarding the nested proof structure.
5035 ML bindings introduced by 'ML_prf' are discarded at the end of the
5036 proof. (Requires Poly/ML 5.2 or later.)
5038 * Simplified ML attribute and method setup, cf. functions Attrib.setup
5039 and Method.setup, as well as Isar commands 'attribute_setup' and
5040 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
5041 existing code accordingly, or use plain 'setup' together with old
5044 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
5045 to 'a -> thm, while results are always tagged with an authentic oracle
5046 name. The Isar command 'oracle' is now polymorphic, no argument type
5047 is specified. INCOMPATIBILITY, need to simplify existing oracle code
5048 accordingly. Note that extra performance may be gained by producing
5049 the cterm carefully, avoiding slow Thm.cterm_of.
5051 * Simplified interface for defining document antiquotations via
5052 ThyOutput.antiquotation, ThyOutput.output, and optionally
5053 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
5054 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
5057 * More systematic treatment of long names, abstract name bindings, and
5058 name space operations. Basic operations on qualified names have been
5059 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
5060 Long_Name.append. Old type bstring has been mostly replaced by
5061 abstract type binding (see structure Binding), which supports precise
5062 qualification by packages and local theory targets, as well as proper
5063 tracking of source positions. INCOMPATIBILITY, need to wrap old
5064 bstring values into Binding.name, or better pass through abstract
5065 bindings everywhere. See further src/Pure/General/long_name.ML,
5066 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
5068 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
5069 LocalTheory.note etc.) now refer to the *full* internal name, not the
5070 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
5072 * Disposed old type and term read functions (Sign.read_def_typ,
5073 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
5074 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
5075 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
5076 Syntax.read_term_global etc.; see also OldGoals.read_term as last
5077 resort for legacy applications.
5079 * Disposed old declarations, tactics, tactic combinators that refer to
5080 the simpset or claset of an implicit theory (such as Addsimps,
5081 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
5082 embedded ML text, or local_simpset_of with a proper context passed as
5083 explicit runtime argument.
5085 * Rules and tactics that read instantiations (read_instantiate,
5086 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
5087 context, which is required for parsing and type-checking. Moreover,
5088 the variables are specified as plain indexnames, not string encodings
5089 thereof. INCOMPATIBILITY.
5091 * Generic Toplevel.add_hook interface allows to analyze the result of
5092 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
5093 for theorem dependency output of transactions resulting in a new
5096 * ML antiquotations: block-structured compilation context indicated by
5097 \<lbrace> ... \<rbrace>; additional antiquotation forms:
5099 @{binding name} - basic name binding
5100 @{let ?pat = term} - term abbreviation (HO matching)
5101 @{note name = fact} - fact abbreviation
5102 @{thm fact} - singleton fact (with attributes)
5103 @{thms fact} - general fact (with attributes)
5104 @{lemma prop by method} - singleton goal
5105 @{lemma prop by meth1 meth2} - singleton goal
5106 @{lemma prop1 ... propN by method} - general goal
5107 @{lemma prop1 ... propN by meth1 meth2} - general goal
5108 @{lemma (open) ...} - open derivation
5113 * The Isabelle "emacs" tool provides a specific interface to invoke
5114 Proof General / Emacs, with more explicit failure if that is not
5115 installed (the old isabelle-interface script silently falls back on
5116 isabelle-process). The PROOFGENERAL_HOME setting determines the
5117 installation location of the Proof General distribution.
5119 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
5120 the Isabelle process into a JVM/Scala application. See
5121 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
5122 process wrapper has been discontinued.)
5124 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
5126 * Various status messages (with exact source position information) are
5127 emitted, if proper markup print mode is enabled. This allows
5128 user-interface components to provide detailed feedback on internal
5133 New in Isabelle2008 (June 2008)
5134 -------------------------------
5138 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
5139 and updated, with formally checked references as hyperlinks.
5141 * Theory loader: use_thy (and similar operations) no longer set the
5142 implicit ML context, which was occasionally hard to predict and in
5143 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
5144 provides a proper context already.
5146 * Theory loader: old-style ML proof scripts being *attached* to a thy
5147 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
5148 'use' within a theory file will do the job.
5150 * Name space merge now observes canonical order, i.e. the second space
5151 is inserted into the first one, while existing entries in the first
5152 space take precedence. INCOMPATIBILITY in rare situations, may try to
5153 swap theory imports.
5155 * Syntax: symbol \<chi> is now considered a letter. Potential
5156 INCOMPATIBILITY in identifier syntax etc.
5158 * Outer syntax: string tokens no longer admit escaped white space,
5159 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
5160 white space without escapes.
5162 * Outer syntax: string tokens may contain arbitrary character codes
5163 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
5169 * Context-dependent token translations. Default setup reverts locally
5170 fixed variables, and adds hilite markup for undeclared frees.
5172 * Unused theorems can be found using the new command 'unused_thms'.
5173 There are three ways of invoking it:
5176 Only finds unused theorems in the current theory.
5178 (2) unused_thms thy_1 ... thy_n -
5179 Finds unused theorems in the current theory and all of its ancestors,
5180 excluding the theories thy_1 ... thy_n and all of their ancestors.
5182 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
5183 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
5184 their ancestors, excluding the theories thy_1 ... thy_n and all of
5187 In order to increase the readability of the list produced by
5188 unused_thms, theorems that have been created by a particular instance
5189 of a theory command such as 'inductive' or 'function' are considered
5190 to belong to the same "group", meaning that if at least one theorem in
5191 this group is used, the other theorems in the same group are no longer
5192 reported as unused. Moreover, if all theorems in the group are
5193 unused, only one theorem in the group is displayed.
5195 Note that proof objects have to be switched on in order for
5196 unused_thms to work properly (i.e. !proofs must be >= 1, which is
5197 usually the case when using Proof General with the default settings).
5199 * Authentic naming of facts disallows ad-hoc overwriting of previous
5200 theorems within the same name space. INCOMPATIBILITY, need to remove
5201 duplicate fact bindings, or even accidental fact duplications. Note
5202 that tools may maintain dynamically scoped facts systematically, using
5203 PureThy.add_thms_dynamic.
5205 * Command 'hide' now allows to hide from "fact" name space as well.
5207 * Eliminated destructive theorem database, simpset, claset, and
5208 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
5209 update of theories within ML code.
5211 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
5212 INCOMPATIBILITY, object-logics depending on former Pure require
5213 additional setup PureThy.old_appl_syntax_setup; object-logics
5214 depending on former CPure need to refer to Pure.
5216 * Commands 'use' and 'ML' are now purely functional, operating on
5217 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
5218 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
5221 * Command 'setup': discontinued implicit version with ML reference.
5223 * Instantiation target allows for simultaneous specification of class
5224 instance operations together with an instantiation proof.
5225 Type-checking phase allows to refer to class operations uniformly.
5226 See src/HOL/Complex/Complex.thy for an Isar example and
5227 src/HOL/Library/Eval.thy for an ML example.
5229 * Indexing of literal facts: be more serious about including only
5230 facts from the visible specification/proof context, but not the
5231 background context (locale etc.). Affects `prop` notation and method
5232 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
5235 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
5236 "(open)" option, which used to expose internal bound variables to the
5239 * Isar statements: removed obsolete case "rule_context".
5240 INCOMPATIBILITY, better use explicit fixes/assumes.
5242 * Locale proofs: default proof step now includes 'unfold_locales';
5243 hence 'proof' without argument may be used to unfold locale
5247 *** Document preparation ***
5249 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
5250 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
5251 obsolete thumbpdf setup (contemporary PDF viewers do this on the
5252 spot); renamed link color from "darkblue" to "linkcolor" (default
5253 value unchanged, can be redefined via \definecolor); no longer sets
5254 "a4paper" option (unnecessary or even intrusive).
5256 * Antiquotation @{lemma A method} proves proposition A by the given
5257 method (either a method name or a method name plus (optional) method
5258 arguments in parentheses) and prints A just like @{prop A}.
5263 * New primrec package. Specification syntax conforms in style to
5264 definition/function/.... No separate induction rule is provided. The
5265 "primrec" command distinguishes old-style and new-style specifications
5266 by syntax. The former primrec package is now named OldPrimrecPackage.
5267 When adjusting theories, beware: constants stemming from new-style
5268 primrec specifications have authentic syntax.
5270 * Metis prover is now an order of magnitude faster, and also works
5271 with multithreading.
5273 * Metis: the maximum number of clauses that can be produced from a
5274 theorem is now given by the attribute max_clauses. Theorems that
5275 exceed this number are ignored, with a warning printed.
5277 * Sledgehammer no longer produces structured proofs by default. To
5278 enable, declare [[sledgehammer_full = true]]. Attributes
5279 reconstruction_modulus, reconstruction_sorts renamed
5280 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
5282 * Method "induct_scheme" derives user-specified induction rules
5283 from well-founded induction and completeness of patterns. This factors
5284 out some operations that are done internally by the function package
5285 and makes them available separately. See
5286 src/HOL/ex/Induction_Scheme.thy for examples.
5288 * More flexible generation of measure functions for termination
5289 proofs: Measure functions can be declared by proving a rule of the
5290 form "is_measure f" and giving it the [measure_function] attribute.
5291 The "is_measure" predicate is logically meaningless (always true), and
5292 just guides the heuristic. To find suitable measure functions, the
5293 termination prover sets up the goal "is_measure ?f" of the appropriate
5294 type and generates all solutions by prolog-style backwards proof using
5297 This setup also deals with rules like
5299 "is_measure f ==> is_measure (list_size f)"
5301 which accommodates nested datatypes that recurse through lists.
5302 Similar rules are predeclared for products and option types.
5304 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
5308 - Definitions of overloaded constants on sets have to be replaced by
5309 definitions on => and bool.
5311 - Some definitions of overloaded operators on sets can now be proved
5312 using the definitions of the operators on => and bool. Therefore,
5313 the following theorems have been renamed:
5315 subset_def -> subset_eq
5316 psubset_def -> psubset_eq
5317 set_diff_def -> set_diff_eq
5318 Compl_def -> Compl_eq
5319 Sup_set_def -> Sup_set_eq
5320 Inf_set_def -> Inf_set_eq
5321 sup_set_def -> sup_set_eq
5322 inf_set_def -> inf_set_eq
5324 - Due to the incompleteness of the HO unification algorithm, some
5325 rules such as subst may require manual instantiation, if some of
5326 the unknowns in the rule is a set.
5328 - Higher order unification and forward proofs:
5331 have "P (S::'a set)" <...>
5332 then have "EX S. P S" ..
5334 no longer works (due to the incompleteness of the HO unification
5335 algorithm) and must be replaced by the pattern
5342 - Calculational reasoning with subst (or similar rules):
5345 have "P (S::'a set)" <...>
5346 also have "S = T" <...>
5347 finally have "P T" .
5349 no longer works (for similar reasons as the previous example) and
5350 must be replaced by something like
5352 have "P (S::'a set)" <...>
5353 moreover have "S = T" <...>
5354 ultimately have "P T" by simp
5356 - Tactics or packages written in ML code:
5357 Code performing pattern matching on types via
5359 Type ("set", [T]) => ...
5361 must be rewritten. Moreover, functions like strip_type or
5362 binder_types no longer return the right value when applied to a
5365 T1 => ... => Tn => U => bool
5369 T1 => ... => Tn => U set
5371 * Merged theories Wellfounded_Recursion, Accessible_Part and
5372 Wellfounded_Relations to theory Wellfounded.
5374 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
5376 * Class finite no longer treats UNIV as class parameter. Use class
5377 enum from theory Library/Enum instead to achieve a similar effect.
5380 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
5381 and "Cons". INCOMPATIBILITY.
5383 * HOL (and FOL): renamed variables in rules imp_elim and swap.
5384 Potential INCOMPATIBILITY.
5386 * Theory Product_Type: duplicated lemmas split_Pair_apply and
5387 injective_fst_snd removed, use split_eta and prod_eqI instead.
5388 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
5390 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
5391 the same name in theory Orderings:
5401 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
5402 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
5403 and different variable names.
5405 * Library/Option_ord.thy: Canonical order on option type.
5407 * Library/RBT.thy: Red-black trees, an efficient implementation of
5410 * Library/Countable.thy: Type class for countable types.
5412 * Theory Int: The representation of numerals has changed. The infix
5413 operator BIT and the bit datatype with constructors B0 and B1 have
5414 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
5415 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
5416 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
5419 * Theory Nat: definition of <= and < on natural numbers no longer
5420 depend on well-founded relations. INCOMPATIBILITY. Definitions
5421 le_def and less_def have disappeared. Consider lemmas not_less
5422 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
5424 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
5425 (whose purpose mainly is for various fold_set functionals) have been
5426 abandoned in favor of the existing algebraic classes
5427 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
5428 lower_semilattice (resp. upper_semilattice) and linorder.
5431 * Theory Transitive_Closure: induct and cases rules now declare proper
5432 case_names ("base" and "step"). INCOMPATIBILITY.
5434 * Theorem Inductive.lfp_ordinal_induct generalized to complete
5435 lattices. The form set-specific version is available as
5436 Inductive.lfp_ordinal_induct_set.
5438 * Renamed theorems "power.simps" to "power_int.simps".
5441 * Class semiring_div provides basic abstract properties of semirings
5442 with division and modulo operations. Subsumes former class dvd_mod.
5444 * Merged theories IntDef, Numeral and IntArith into unified theory
5445 Int. INCOMPATIBILITY.
5447 * Theory Library/Code_Index: type "index" now represents natural
5448 numbers rather than integers. INCOMPATIBILITY.
5450 * New class "uminus" with operation "uminus" (split of from class
5451 "minus" which now only has operation "minus", binary).
5454 * Constants "card", "internal_split", "option_map" now with authentic
5455 syntax. INCOMPATIBILITY.
5457 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
5458 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
5459 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
5460 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
5461 Sup_set_def, le_def, less_def, option_map_def now with object
5462 equality. INCOMPATIBILITY.
5464 * Records. Removed K_record, and replaced it by pure lambda term
5465 %x. c. The simplifier setup is now more robust against eta expansion.
5466 INCOMPATIBILITY: in cases explicitly referring to K_record.
5468 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
5470 * Library/ListVector: new theory of arithmetic vector operations.
5472 * Library/Order_Relation: new theory of various orderings as sets of
5473 pairs. Defines preorders, partial orders, linear orders and
5474 well-orders on sets and on types.
5479 * Renamed some theories to allow to loading both ZF and HOL in the
5482 Datatype -> Datatype_ZF
5483 Inductive -> Inductive_ZF
5490 INCOMPATIBILITY: ZF theories that import individual theories below
5491 Main might need to be adapted. Regular theory Main is still
5492 available, as trivial extension of Main_ZF.
5497 * ML within Isar: antiquotation @{const name} or @{const
5498 name(typargs)} produces statically-checked Const term.
5500 * Functor NamedThmsFun: data is available to the user as dynamic fact
5501 (of the same name). Removed obsolete print command.
5503 * Removed obsolete "use_legacy_bindings" function.
5505 * The ``print mode'' is now a thread-local value derived from a global
5506 template (the former print_mode reference), thus access becomes
5507 non-critical. The global print_mode reference is for session
5508 management only; user-code should use print_mode_value,
5509 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
5511 * Functions system/system_out provide a robust way to invoke external
5512 shell commands, with propagation of interrupts (requires Poly/ML
5513 5.2.1). Do not use OS.Process.system etc. from the basis library!
5518 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
5519 in accordance with Proof General 3.7, which prefers GNU emacs.
5521 * isatool tty runs Isabelle process with plain tty interaction;
5522 optional line editor may be specified via ISABELLE_LINE_EDITOR
5523 setting, the default settings attempt to locate "ledit" and "rlwrap".
5525 * isatool browser now works with Cygwin as well, using general
5526 "javapath" function defined in Isabelle process environment.
5528 * YXML notation provides a simple and efficient alternative to
5529 standard XML transfer syntax. See src/Pure/General/yxml.ML and
5530 isatool yxml as described in the Isabelle system manual.
5532 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
5533 provides general wrapper for managing an Isabelle process in a robust
5534 fashion, with ``cooked'' output from stdin/stderr.
5536 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
5537 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
5539 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
5540 way of changing the user's settings is via
5541 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
5544 * Multithreading.max_threads := 0 refers to the number of actual CPU
5545 cores of the underlying machine, which is a good starting point for
5546 optimal performance tuning. The corresponding usedir option -M allows
5547 "max" as an alias for "0". WARNING: does not work on certain versions
5548 of Mac OS (with Poly/ML 5.1).
5550 * isabelle-process: non-ML sessions are run with "nice", to reduce the
5551 adverse effect of Isabelle flooding interactive front-ends (notably
5552 ProofGeneral / XEmacs).
5556 New in Isabelle2007 (November 2007)
5557 -----------------------------------
5561 * More uniform information about legacy features, notably a
5562 warning/error of "Legacy feature: ...", depending on the state of the
5563 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
5564 legacy features will disappear eventually.
5566 * Theory syntax: the header format ``theory A = B + C:'' has been
5567 discontinued in favour of ``theory A imports B C begin''. Use isatool
5568 fixheaders to convert existing theory files. INCOMPATIBILITY.
5570 * Theory syntax: the old non-Isar theory file format has been
5571 discontinued altogether. Note that ML proof scripts may still be used
5572 with Isar theories; migration is usually quite simple with the ML
5573 function use_legacy_bindings. INCOMPATIBILITY.
5575 * Theory syntax: some popular names (e.g. 'class', 'declaration',
5576 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
5579 * Theory loader: be more serious about observing the static theory
5580 header specifications (including optional directories), but not the
5581 accidental file locations of previously successful loads. The strict
5582 update policy of former update_thy is now already performed by
5583 use_thy, so the former has been removed; use_thys updates several
5584 theories simultaneously, just as 'imports' within a theory header
5585 specification, but without merging the results. Potential
5586 INCOMPATIBILITY: may need to refine theory headers and commands
5587 ROOT.ML which depend on load order.
5589 * Theory loader: optional support for content-based file
5590 identification, instead of the traditional scheme of full physical
5591 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
5592 (cf. the system manual). The new scheme allows to work with
5593 non-finished theories in persistent session images, such that source
5594 files may be moved later on without requiring reloads.
5596 * Theory loader: old-style ML proof scripts being *attached* to a thy
5597 file (with the same base name as the theory) are considered a legacy
5598 feature, which will disappear eventually. Even now, the theory loader
5599 no longer maintains dependencies on such files.
5601 * Syntax: the scope for resolving ambiguities via type-inference is
5602 now limited to individual terms, instead of whole simultaneous
5603 specifications as before. This greatly reduces the complexity of the
5604 syntax module and improves flexibility by separating parsing and
5605 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
5606 'fixes' etc.) are required in rare situations.
5608 * Syntax: constants introduced by new-style packages ('definition',
5609 'abbreviation' etc.) are passed through the syntax module in
5610 ``authentic mode''. This means that associated mixfix annotations
5611 really stick to such constants, independently of potential name space
5612 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
5613 trees are represented slightly differently, may need to adapt syntax
5614 translations accordingly. Use CONST marker in 'translations' and
5615 @{const_syntax} antiquotation in 'parse_translation' etc.
5617 * Legacy goal package: reduced interface to the bare minimum required
5618 to keep existing proof scripts running. Most other user-level
5619 functions are now part of the OldGoals structure, which is *not* open
5620 by default (consider isatool expandshort before open OldGoals).
5621 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
5622 these tend to cause confusion about the actual goal (!) context being
5623 used here, which is not necessarily the same as the_context().
5625 * Command 'find_theorems': supports "*" wild-card in "name:"
5626 criterion; "with_dups" option. Certain ProofGeneral versions might
5627 support a specific search form (see ProofGeneral/CHANGES).
5629 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
5630 by default, which means that "prems" (and also "fixed variables") are
5631 suppressed from proof state output. Note that the ProofGeneral
5632 settings mechanism allows to change and save options persistently, but
5633 older versions of Isabelle will fail to start up if a negative prems
5636 * Local theory targets may be specified by non-nested blocks of
5637 ``context/locale/class ... begin'' followed by ``end''. The body may
5638 contain definitions, theorems etc., including any derived mechanism
5639 that has been implemented on top of these primitives. This concept
5640 generalizes the existing ``theorem (in ...)'' towards more versatility
5643 * Proof General interface: proper undo of final 'end' command;
5644 discontinued Isabelle/classic mode (ML proof scripts).
5647 *** Document preparation ***
5649 * Added antiquotation @{theory name} which prints the given name,
5650 after checking that it refers to a valid ancestor theory in the
5653 * Added antiquotations @{ML_type text} and @{ML_struct text} which
5654 check the given source text as ML type/structure, printing verbatim.
5656 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
5657 "c args == rhs" given in the current context. (Any number of
5658 arguments may be given on the LHS.)
5663 * The 'class' package offers a combination of axclass and locale to
5664 achieve Haskell-like type classes in Isabelle. Definitions and
5665 theorems within a class context produce both relative results (with
5666 implicit parameters according to the locale context), and polymorphic
5667 constants with qualified polymorphism (according to the class
5668 context). Within the body context of a 'class' target, a separate
5669 syntax layer ("user space type system") takes care of converting
5670 between global polymorphic consts and internal locale representation.
5671 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
5672 "isatool doc classes" provides a tutorial.
5674 * Generic code generator framework allows to generate executable
5675 code for ML and Haskell (including Isabelle classes). A short usage
5678 internal compilation:
5679 export_code <list of constants (term syntax)> in SML
5680 writing SML code to a file:
5681 export_code <list of constants (term syntax)> in SML <filename>
5682 writing OCaml code to a file:
5683 export_code <list of constants (term syntax)> in OCaml <filename>
5684 writing Haskell code to a bunch of files:
5685 export_code <list of constants (term syntax)> in Haskell <filename>
5687 evaluating closed propositions to True/False using code generation:
5690 Reasonable default setup of framework in HOL.
5692 Theorem attributs for selecting and transforming function equations theorems:
5694 [code fun]: select a theorem as function equation for a specific constant
5695 [code fun del]: deselect a theorem as function equation for a specific constant
5696 [code inline]: select an equation theorem for unfolding (inlining) in place
5697 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
5699 User-defined serializations (target in {SML, OCaml, Haskell}):
5701 code_const <and-list of constants (term syntax)>
5702 {(target) <and-list of const target syntax>}+
5704 code_type <and-list of type constructors>
5705 {(target) <and-list of type target syntax>}+
5707 code_instance <and-list of instances>
5709 where instance ::= <type constructor> :: <class>
5711 code_class <and_list of classes>
5712 {(target) <and-list of class target syntax>}+
5713 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
5715 code_instance and code_class only are effective to target Haskell.
5717 For example usage see src/HOL/ex/Codegenerator.thy and
5718 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
5719 generation from Isabelle/HOL theories is available via "isatool doc
5722 * Code generator: consts in 'consts_code' Isar commands are now
5723 referred to by usual term syntax (including optional type
5726 * Command 'no_translations' removes translation rules from theory
5729 * Overloaded definitions are now actually checked for acyclic
5730 dependencies. The overloading scheme is slightly more general than
5731 that of Haskell98, although Isabelle does not demand an exact
5732 correspondence to type class and instance declarations.
5733 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
5734 exotic versions of overloading -- at the discretion of the user!
5736 Polymorphic constants are represented via type arguments, i.e. the
5737 instantiation that matches an instance against the most general
5738 declaration given in the signature. For example, with the declaration
5739 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
5740 as c(nat). Overloading is essentially simultaneous structural
5741 recursion over such type arguments. Incomplete specification patterns
5742 impose global constraints on all occurrences, e.g. c('a * 'a) on the
5743 LHS means that more general c('a * 'b) will be disallowed on any RHS.
5744 Command 'print_theory' outputs the normalized system of recursive
5745 equations, see section "definitions".
5747 * Configuration options are maintained within the theory or proof
5748 context (with name and type bool/int/string), providing a very simple
5749 interface to a poor-man's version of general context data. Tools may
5750 declare options in ML (e.g. using Attrib.config_int) and then refer to
5751 these values using Config.get etc. Users may change options via an
5752 associated attribute of the same name. This form of context
5753 declaration works particularly well with commands 'declare' or
5754 'using', for example ``declare [[foo = 42]]''. Thus it has become
5755 very easy to avoid global references, which would not observe Isar
5756 toplevel undo/redo and fail to work with multithreading.
5758 Various global ML references of Pure and HOL have been turned into
5759 configuration options:
5761 Unify.search_bound unify_search_bound
5762 Unify.trace_bound unify_trace_bound
5763 Unify.trace_simp unify_trace_simp
5764 Unify.trace_types unify_trace_types
5765 Simplifier.simp_depth_limit simp_depth_limit
5766 Blast.depth_limit blast_depth_limit
5767 DatatypeProp.dtK datatype_distinctness_limit
5768 fast_arith_neq_limit fast_arith_neq_limit
5769 fast_arith_split_limit fast_arith_split_limit
5771 * Named collections of theorems may be easily installed as context
5772 data using the functor NamedThmsFun (see also
5773 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
5774 attributes; there is also a toplevel print command. This facility is
5775 just a common case of general context data, which is the preferred way
5776 for anything more complex than just a list of facts in canonical
5779 * Isar: command 'declaration' augments a local theory by generic
5780 declaration functions written in ML. This enables arbitrary content
5781 being added to the context, depending on a morphism that tells the
5782 difference of the original declaration context wrt. the application
5783 context encountered later on.
5785 * Isar: proper interfaces for simplification procedures. Command
5786 'simproc_setup' declares named simprocs (with match patterns, and body
5787 text in ML). Attribute "simproc" adds/deletes simprocs in the current
5788 context. ML antiquotation @{simproc name} retrieves named simprocs.
5790 * Isar: an extra pair of brackets around attribute declarations
5791 abbreviates a theorem reference involving an internal dummy fact,
5792 which will be ignored later --- only the effect of the attribute on
5793 the background context will persist. This form of in-place
5794 declarations is particularly useful with commands like 'declare' and
5795 'using', for example ``have A using [[simproc a]] by simp''.
5797 * Isar: method "assumption" (and implicit closing of subproofs) now
5798 takes simple non-atomic goal assumptions into account: after applying
5799 an assumption as a rule the resulting subgoals are solved by atomic
5800 assumption steps. This is particularly useful to finish 'obtain'
5801 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
5802 without referring to the original premise "!!x. P x ==> thesis" in the
5803 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
5806 * Isar: implicit use of prems from the Isar proof context is
5807 considered a legacy feature. Common applications like ``have A .''
5808 may be replaced by ``have A by fact'' or ``note `A`''. In general,
5809 referencing facts explicitly here improves readability and
5810 maintainability of proof texts.
5812 * Isar: improper proof element 'guess' is like 'obtain', but derives
5813 the obtained context from the course of reasoning! For example:
5815 assume "EX x y. A x & B y" -- "any previous fact"
5816 then guess x and y by clarify
5818 This technique is potentially adventurous, depending on the facts and
5819 proof tools being involved here.
5821 * Isar: known facts from the proof context may be specified as literal
5822 propositions, using ASCII back-quote syntax. This works wherever
5823 named facts used to be allowed so far, in proof commands, proof
5824 methods, attributes etc. Literal facts are retrieved from the context
5825 according to unification of type and term parameters. For example,
5826 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
5827 theorems in the current context, then these are valid literal facts:
5828 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
5830 There is also a proof method "fact" which does the same composition
5831 for explicit goal states, e.g. the following proof texts coincide with
5832 certain special cases of literal facts:
5834 have "A" by fact == note `A`
5835 have "A ==> B" by fact == note `A ==> B`
5836 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
5837 have "P a ==> Q a" by fact == note `P a ==> Q a`
5839 * Isar: ":" (colon) is no longer a symbolic identifier character in
5840 outer syntax. Thus symbolic identifiers may be used without
5841 additional white space in declarations like this: ``assume *: A''.
5843 * Isar: 'print_facts' prints all local facts of the current context,
5844 both named and unnamed ones.
5846 * Isar: 'def' now admits simultaneous definitions, e.g.:
5848 def x == "t" and y == "u"
5850 * Isar: added command 'unfolding', which is structurally similar to
5851 'using', but affects both the goal state and facts by unfolding given
5852 rewrite rules. Thus many occurrences of the 'unfold' method or
5853 'unfolded' attribute may be replaced by first-class proof text.
5855 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
5856 and command 'unfolding' now all support object-level equalities
5857 (potentially conditional). The underlying notion of rewrite rule is
5858 analogous to the 'rule_format' attribute, but *not* that of the
5859 Simplifier (which is usually more generous).
5861 * Isar: the new attribute [rotated n] (default n = 1) rotates the
5862 premises of a theorem by n. Useful in conjunction with drule.
5864 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
5865 method expression within a sandbox consisting of the first N
5866 sub-goals, which need to exist. For example, ``simp_all [3]''
5867 simplifies the first three sub-goals, while (rule foo, simp_all)[]
5868 simplifies all new goals that emerge from applying rule foo to the
5869 originally first one.
5871 * Isar: schematic goals are no longer restricted to higher-order
5872 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
5875 * Isar: the conclusion of a long theorem statement is now either
5876 'shows' (a simultaneous conjunction, as before), or 'obtains'
5877 (essentially a disjunction of cases with local parameters and
5878 assumptions). The latter allows to express general elimination rules
5879 adequately; in this notation common elimination rules look like this:
5881 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
5883 obtains x where "P x"
5885 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
5889 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
5895 The subsequent classical rules even refer to the formal "thesis"
5898 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
5901 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
5902 obtains "thesis ==> something"
5904 The actual proof of an 'obtains' statement is analogous to that of the
5905 Isar proof element 'obtain', only that there may be several cases.
5906 Optional case names may be specified in parentheses; these will be
5907 available both in the present proof and as annotations in the
5908 resulting rule, for later use with the 'cases' method (cf. attribute
5911 * Isar: the assumptions of a long theorem statement are available as
5912 "assms" fact in the proof context. This is more appropriate than the
5913 (historical) "prems", which refers to all assumptions of the current
5914 context, including those from the target locale, proof body etc.
5916 * Isar: 'print_statement' prints theorems from the current theory or
5917 proof context in long statement form, according to the syntax of a
5920 * Isar: 'obtain' takes an optional case name for the local context
5921 introduction rule (default "that").
5923 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
5924 explicit (is "_ ==> ?foo") in the rare cases where this still happens
5927 * Pure: syntax "CONST name" produces a fully internalized constant
5928 according to the current context. This is particularly useful for
5929 syntax translations that should refer to internal constant
5930 representations independently of name spaces.
5932 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
5933 instead of "FOO ". This allows multiple binder declarations to coexist
5934 in the same context. INCOMPATIBILITY.
5936 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
5937 primitive that also works in a locale context (both for constants and
5938 fixed variables). Type declaration and internal syntactic representation
5939 of given constants retrieved from the context. Likewise, the
5940 'no_notation' command allows to remove given syntax annotations from the
5943 * Isar/locales: new derived specification elements 'axiomatization',
5944 'definition', 'abbreviation', which support type-inference, admit
5945 object-level specifications (equality, equivalence). See also the
5946 isar-ref manual. Examples:
5949 eq (infix "===" 50) where
5950 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
5952 definition "f x y = x + y + 1"
5953 definition g where "g x = f x x"
5956 neq (infix "=!=" 50) where
5957 "x =!= y == ~ (x === y)"
5959 These specifications may be also used in a locale context. Then the
5960 constants being introduced depend on certain fixed parameters, and the
5961 constant name is qualified by the locale base name. An internal
5962 abbreviation takes care for convenient input and output, making the
5963 parameters implicit and using the original short name. See also
5964 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
5965 entities from a monomorphic theory.
5967 Presently, abbreviations are only available 'in' a target locale, but
5968 not inherited by general import expressions. Also note that
5969 'abbreviation' may be used as a type-safe replacement for 'syntax' +
5970 'translations' in common applications. The "no_abbrevs" print mode
5971 prevents folding of abbreviations in term output.
5973 Concrete syntax is attached to specified constants in internal form,
5974 independently of name spaces. The parse tree representation is
5975 slightly different -- use 'notation' instead of raw 'syntax', and
5976 'translations' with explicit "CONST" markup to accommodate this.
5978 * Pure/Isar: unified syntax for new-style specification mechanisms
5979 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
5980 full type inference and dummy patterns ("_"). For example:
5982 definition "K x _ = x"
5984 inductive conj for A B
5985 where "A ==> B ==> conj A B"
5987 * Pure: command 'print_abbrevs' prints all constant abbreviations of
5988 the current context. Print mode "no_abbrevs" prevents inversion of
5989 abbreviations on output.
5991 * Isar/locales: improved parameter handling: use of locales "var" and
5992 "struct" no longer necessary; - parameter renamings are no longer
5993 required to be injective. For example, this allows to define
5994 endomorphisms as locale endom = homom mult mult h.
5996 * Isar/locales: changed the way locales with predicates are defined.
5997 Instead of accumulating the specification, the imported expression is
5998 now an interpretation. INCOMPATIBILITY: different normal form of
5999 locale expressions. In particular, in interpretations of locales with
6000 predicates, goals repesenting already interpreted fragments are not
6001 removed automatically. Use methods `intro_locales' and
6002 `unfold_locales'; see below.
6004 * Isar/locales: new methods `intro_locales' and `unfold_locales'
6005 provide backward reasoning on locales predicates. The methods are
6006 aware of interpretations and discharge corresponding goals.
6007 `intro_locales' is less aggressive then `unfold_locales' and does not
6008 unfold predicates to assumptions.
6010 * Isar/locales: the order in which locale fragments are accumulated
6011 has changed. This enables to override declarations from fragments due
6012 to interpretations -- for example, unwanted simp rules.
6014 * Isar/locales: interpretation in theories and proof contexts has been
6015 extended. One may now specify (and prove) equations, which are
6016 unfolded in interpreted theorems. This is useful for replacing
6017 defined concepts (constants depending on locale parameters) by
6018 concepts already existing in the target context. Example:
6020 interpretation partial_order ["op <= :: [int, int] => bool"]
6021 where "partial_order.less (op <=) (x::int) y = (x < y)"
6023 Typically, the constant `partial_order.less' is created by a
6024 definition specification element in the context of locale
6027 * Method "induct": improved internal context management to support
6028 local fixes and defines on-the-fly. Thus explicit meta-level
6029 connectives !! and ==> are rarely required anymore in inductive goals
6030 (using object-logic connectives for this purpose has been long
6031 obsolete anyway). Common proof patterns are explained in
6032 src/HOL/Induct/Common_Patterns.thy, see also
6033 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
6036 * Method "induct": improved handling of simultaneous goals. Instead of
6037 introducing object-level conjunction, the statement is now split into
6038 several conclusions, while the corresponding symbolic cases are nested
6039 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
6040 see src/HOL/Induct/Common_Patterns.thy, for example.
6042 * Method "induct": mutual induction rules are now specified as a list
6043 of rule sharing the same induction cases. HOL packages usually provide
6044 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
6045 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
6046 mutual induction rules differently, i.e. like this:
6048 (induct rule: foo_bar.inducts)
6049 (induct set: foo bar)
6050 (induct pred: foo bar)
6051 (induct type: foo bar)
6053 The ML function ProjectRule.projections turns old-style rules into the
6056 * Method "coinduct": dual of induction, see
6057 src/HOL/Library/Coinductive_List.thy for various examples.
6059 * Method "cases", "induct", "coinduct": the ``(open)'' option is
6060 considered a legacy feature.
6062 * Attribute "symmetric" produces result with standardized schematic
6063 variables (index 0). Potential INCOMPATIBILITY.
6065 * Simplifier: by default the simplifier trace only shows top level
6066 rewrites now. That is, trace_simp_depth_limit is set to 1 by
6067 default. Thus there is less danger of being flooded by the trace. The
6068 trace indicates where parts have been suppressed.
6070 * Provers/classical: removed obsolete classical version of elim_format
6071 attribute; classical elim/dest rules are now treated uniformly when
6072 manipulating the claset.
6074 * Provers/classical: stricter checks to ensure that supplied intro,
6075 dest and elim rules are well-formed; dest and elim rules must have at
6078 * Provers/classical: attributes dest/elim/intro take an optional
6079 weight argument for the rule (just as the Pure versions). Weights are
6080 ignored by automated tools, but determine the search order of single
6083 * Syntax: input syntax now supports dummy variable binding "%_. b",
6084 where the body does not mention the bound variable. Note that dummy
6085 patterns implicitly depend on their context of bounds, which makes
6086 "{_. _}" match any set comprehension as expected. Potential
6087 INCOMPATIBILITY -- parse translations need to cope with syntactic
6088 constant "_idtdummy" in the binding position.
6090 * Syntax: removed obsolete syntactic constant "_K" and its associated
6091 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
6092 for example "A -> B" => "Pi A (%_. B)".
6094 * Pure: 'class_deps' command visualizes the subclass relation, using
6095 the graph browser tool.
6097 * Pure: 'print_theory' now suppresses certain internal declarations by
6098 default; use '!' option for full details.
6103 * Method "metis" proves goals by applying the Metis general-purpose
6104 resolution prover (see also http://gilith.com/software/metis/).
6105 Examples are in the directory MetisExamples. WARNING: the
6106 Isabelle/HOL-Metis integration does not yet work properly with
6109 * Command 'sledgehammer' invokes external automatic theorem provers as
6110 background processes. It generates calls to the "metis" method if
6111 successful. These can be pasted into the proof. Users do not have to
6112 wait for the automatic provers to return. WARNING: does not really
6113 work with multi-threading.
6115 * New "auto_quickcheck" feature tests outermost goal statements for
6116 potential counter-examples. Controlled by ML references
6117 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
6118 5000 milliseconds). Fails silently if statements is outside of
6119 executable fragment, or any other codgenerator problem occurs.
6121 * New constant "undefined" with axiom "undefined x = undefined".
6123 * Added class "HOL.eq", allowing for code generation with polymorphic
6126 * Some renaming of class constants due to canonical name prefixing in
6127 the new 'class' package:
6129 HOL.abs ~> HOL.abs_class.abs
6130 HOL.divide ~> HOL.divide_class.divide
6131 0 ~> HOL.zero_class.zero
6132 1 ~> HOL.one_class.one
6133 op + ~> HOL.plus_class.plus
6134 op - ~> HOL.minus_class.minus
6135 uminus ~> HOL.minus_class.uminus
6136 op * ~> HOL.times_class.times
6137 op < ~> HOL.ord_class.less
6138 op <= > HOL.ord_class.less_eq
6139 Nat.power ~> Power.power_class.power
6140 Nat.size ~> Nat.size_class.size
6141 Numeral.number_of ~> Numeral.number_class.number_of
6142 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
6143 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
6144 Orderings.min ~> Orderings.ord_class.min
6145 Orderings.max ~> Orderings.ord_class.max
6146 Divides.op div ~> Divides.div_class.div
6147 Divides.op mod ~> Divides.div_class.mod
6148 Divides.op dvd ~> Divides.div_class.dvd
6150 INCOMPATIBILITY. Adaptions may be required in the following cases:
6152 a) User-defined constants using any of the names "plus", "minus",
6153 "times", "less" or "less_eq". The standard syntax translations for
6154 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
6157 b) Variables named "plus", "minus", "times", "less", "less_eq"
6158 INCOMPATIBILITY: use more specific names.
6160 c) Permutative equations (e.g. "a + b = b + a")
6161 Since the change of names also changes the order of terms, permutative
6162 rewrite rules may get applied in a different order. Experience shows
6163 that this is rarely the case (only two adaptions in the whole Isabelle
6164 distribution). INCOMPATIBILITY: rewrite proofs
6166 d) ML code directly refering to constant names
6167 This in general only affects hand-written proof tactics, simprocs and
6168 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
6169 Consider using @{const_name} antiquotation.
6171 * New class "default" with associated constant "default".
6173 * Function "sgn" is now overloaded and available on int, real, complex
6174 (and other numeric types), using class "sgn". Two possible defs of
6175 sgn are given as equational assumptions in the classes sgn_if and
6176 sgn_div_norm; ordered_idom now also inherits from sgn_if.
6179 * Locale "partial_order" now unified with class "order" (cf. theory
6180 Orderings), added parameter "less". INCOMPATIBILITY.
6182 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
6183 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
6184 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
6186 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
6187 changed order of proof goals in instance proofs.
6189 * The transitivity reasoner for partial and linear orders is set up
6190 for classes "order" and "linorder". Instances of the reasoner are available
6191 in all contexts importing or interpreting the corresponding locales.
6192 Method "order" invokes the reasoner separately; the reasoner
6193 is also integrated with the Simplifier as a solver. Diagnostic
6194 command 'print_orders' shows the available instances of the reasoner
6195 in the current context.
6197 * Localized monotonicity predicate in theory "Orderings"; integrated
6198 lemmas max_of_mono and min_of_mono with this predicate.
6201 * Formulation of theorem "dense" changed slightly due to integration
6202 with new class dense_linear_order.
6204 * Uniform lattice theory development in HOL.
6206 constants "meet" and "join" now named "inf" and "sup"
6207 constant "Meet" now named "Inf"
6209 classes "meet_semilorder" and "join_semilorder" now named
6210 "lower_semilattice" and "upper_semilattice"
6211 class "lorder" now named "lattice"
6212 class "comp_lat" now named "complete_lattice"
6214 Instantiation of lattice classes allows explicit definitions
6215 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
6217 INCOMPATIBILITY. Theorem renames:
6219 meet_left_le ~> inf_le1
6220 meet_right_le ~> inf_le2
6221 join_left_le ~> sup_ge1
6222 join_right_le ~> sup_ge2
6223 meet_join_le ~> inf_sup_ord
6226 le_meet ~> le_inf_iff
6227 le_join ~> ge_sup_conv
6228 meet_idempotent ~> inf_idem
6229 join_idempotent ~> sup_idem
6230 meet_comm ~> inf_commute
6231 join_comm ~> sup_commute
6232 meet_leI1 ~> le_infI1
6233 meet_leI2 ~> le_infI2
6234 le_joinI1 ~> le_supI1
6235 le_joinI2 ~> le_supI2
6236 meet_assoc ~> inf_assoc
6237 join_assoc ~> sup_assoc
6238 meet_left_comm ~> inf_left_commute
6239 meet_left_idempotent ~> inf_left_idem
6240 join_left_comm ~> sup_left_commute
6241 join_left_idempotent ~> sup_left_idem
6244 le_def_meet ~> le_iff_inf
6245 le_def_join ~> le_iff_sup
6246 join_absorp2 ~> sup_absorb2
6247 join_absorp1 ~> sup_absorb1
6248 meet_absorp1 ~> inf_absorb1
6249 meet_absorp2 ~> inf_absorb2
6250 meet_join_absorp ~> inf_sup_absorb
6251 join_meet_absorp ~> sup_inf_absorb
6252 distrib_join_le ~> distrib_sup_le
6253 distrib_meet_le ~> distrib_inf_le
6255 add_meet_distrib_left ~> add_inf_distrib_left
6256 add_join_distrib_left ~> add_sup_distrib_left
6257 is_join_neg_meet ~> is_join_neg_inf
6258 is_meet_neg_join ~> is_meet_neg_sup
6259 add_meet_distrib_right ~> add_inf_distrib_right
6260 add_join_distrib_right ~> add_sup_distrib_right
6261 add_meet_join_distribs ~> add_sup_inf_distribs
6262 join_eq_neg_meet ~> sup_eq_neg_inf
6263 meet_eq_neg_join ~> inf_eq_neg_sup
6264 add_eq_meet_join ~> add_eq_inf_sup
6265 meet_0_imp_0 ~> inf_0_imp_0
6266 join_0_imp_0 ~> sup_0_imp_0
6267 meet_0_eq_0 ~> inf_0_eq_0
6268 join_0_eq_0 ~> sup_0_eq_0
6269 neg_meet_eq_join ~> neg_inf_eq_sup
6270 neg_join_eq_meet ~> neg_sup_eq_inf
6271 join_eq_if ~> sup_eq_if
6273 mono_meet ~> mono_inf
6274 mono_join ~> mono_sup
6275 meet_bool_eq ~> inf_bool_eq
6276 join_bool_eq ~> sup_bool_eq
6277 meet_fun_eq ~> inf_fun_eq
6278 join_fun_eq ~> sup_fun_eq
6279 meet_set_eq ~> inf_set_eq
6280 join_set_eq ~> sup_set_eq
6281 meet1_iff ~> inf1_iff
6282 meet2_iff ~> inf2_iff
6291 join1_iff ~> sup1_iff
6292 join2_iff ~> sup2_iff
6302 is_meet_Meet ~> is_meet_Inf
6303 Meet_bool_def ~> Inf_bool_def
6304 Meet_fun_def ~> Inf_fun_def
6305 Meet_greatest ~> Inf_greatest
6306 Meet_lower ~> Inf_lower
6307 Meet_set_def ~> Inf_set_def
6310 Sup_bool_eq ~> Sup_bool_def
6311 Sup_fun_eq ~> Sup_fun_def
6312 Sup_set_eq ~> Sup_set_def
6314 listsp_meetI ~> listsp_infI
6315 listsp_meet_eq ~> listsp_inf_eq
6320 * Added syntactic class "size"; overloaded constant "size" now has
6321 type "'a::size ==> bool"
6323 * Internal reorganisation of `size' of datatypes: size theorems
6324 "foo.size" are no longer subsumed by "foo.simps" (but are still
6325 simplification rules by default!); theorems "prod.size" now named
6328 * Class "div" now inherits from class "times" rather than "type".
6331 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
6332 Linorder etc. have disappeared; operations defined in terms of
6333 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
6335 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
6337 * HOL-Word: New extensive library and type for generic, fixed size
6338 machine words, with arithmetic, bit-wise, shifting and rotating
6339 operations, reflection into int, nat, and bool lists, automation for
6340 linear arithmetic (by automatic reflection into nat or int), including
6341 lemmas on overflow and monotonicity. Instantiated to all appropriate
6342 arithmetic type classes, supporting automatic simplification of
6343 numerals on all operations.
6345 * Library/Boolean_Algebra: locales for abstract boolean algebras.
6347 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
6349 * Code generator library theories:
6350 - Code_Integer represents HOL integers by big integer literals in target
6352 - Code_Char represents HOL characters by character literals in target
6354 - Code_Char_chr like Code_Char, but also offers treatment of character
6355 codes; includes Code_Integer.
6356 - Executable_Set allows to generate code for finite sets using lists.
6357 - Executable_Rat implements rational numbers as triples (sign, enumerator,
6359 - Executable_Real implements a subset of real numbers, namly those
6360 representable by rational numbers.
6361 - Efficient_Nat implements natural numbers by integers, which in general will
6362 result in higher efficency; pattern matching with 0/Suc is eliminated;
6363 includes Code_Integer.
6364 - Code_Index provides an additional datatype index which is mapped to
6365 target-language built-in integers.
6366 - Code_Message provides an additional datatype message_string which is isomorphic to
6367 strings; messages are mapped to target-language strings.
6369 * New package for inductive predicates
6371 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
6374 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
6375 for z_1 :: U_1 and ... and z_n :: U_m
6377 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
6380 with full support for type-inference, rather than
6382 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
6384 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
6385 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
6387 inductive "s z_1 ... z_m"
6389 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
6392 For backward compatibility, there is a wrapper allowing inductive
6393 sets to be defined with the new package via
6396 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
6397 for z_1 :: U_1 and ... and z_n :: U_m
6399 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
6405 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
6406 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
6407 for z_1 :: U_1 and ... and z_n :: U_m
6409 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
6410 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
6413 if the additional syntax "p ..." is required.
6415 Numerous examples can be found in the subdirectories src/HOL/Auth,
6416 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
6420 - Since declaration and definition of inductive sets or predicates
6421 is no longer separated, abbreviations involving the newly
6422 introduced sets or predicates must be specified together with the
6423 introduction rules after the 'where' keyword (see above), rather
6424 than before the actual inductive definition.
6426 - The variables in induction and elimination rules are now
6427 quantified in the order of their occurrence in the introduction
6428 rules, rather than in alphabetical order. Since this may break
6429 some proofs, these proofs either have to be repaired, e.g. by
6430 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
6431 statements of the form
6433 case (rule_i a_i_1 ... a_i_{k_i})
6435 or the old order of quantification has to be restored by explicitly adding
6436 meta-level quantifiers in the introduction rules, i.e.
6438 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
6440 - The format of the elimination rules is now
6442 p z_1 ... z_m x_1 ... x_n ==>
6443 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
6448 (x_1, ..., x_n) : s z_1 ... z_m ==>
6449 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
6452 for sets rather than
6454 x : s z_1 ... z_m ==>
6455 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
6458 This may require terms in goals to be expanded to n-tuples
6459 (e.g. using case_tac or simplification with the split_paired_all
6460 rule) before the above elimination rule is applicable.
6462 - The elimination or case analysis rules for (mutually) inductive
6463 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
6464 list of rules "p_1_..._p_k.elims" is no longer available.
6466 * New package "function"/"fun" for general recursive functions,
6467 supporting mutual and nested recursion, definitions in local contexts,
6468 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
6469 for small examples, and the separate tutorial on the function
6470 package. The old recdef "package" is still available as before, but
6471 users are encouraged to use the new package.
6473 * Method "lexicographic_order" automatically synthesizes termination
6474 relations as lexicographic combinations of size measures.
6476 * Case-expressions allow arbitrary constructor-patterns (including
6477 "_") and take their order into account, like in functional
6478 programming. Internally, this is translated into nested
6479 case-expressions; missing cases are added and mapped to the predefined
6480 constant "undefined". In complicated cases printing may no longer show
6481 the original input but the internal form. Lambda-abstractions allow
6482 the same form of pattern matching: "% pat1 => e1 | ..." is an
6483 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
6486 * IntDef: The constant "int :: nat => int" has been removed; now "int"
6487 is an abbreviation for "of_nat :: nat => int". The simplification
6488 rules for "of_nat" have been changed to work like "int" did
6489 previously. Potential INCOMPATIBILITY:
6490 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
6491 - of_nat_diff and of_nat_mult are no longer default simp rules
6493 * Method "algebra" solves polynomial equations over (semi)rings using
6494 Groebner bases. The (semi)ring structure is defined by locales and the
6495 tool setup depends on that generic context. Installing the method for
6496 a specific type involves instantiating the locale and possibly adding
6497 declarations for computation on the coefficients. The method is
6498 already instantiated for natural numbers and for the axiomatic class
6499 of idoms with numerals. See also the paper by Chaieb and Wenzel at
6500 CALCULEMUS 2007 for the general principles underlying this
6501 architecture of context-aware proof-tools.
6503 * Method "ferrack" implements quantifier elimination over
6504 special-purpose dense linear orders using locales (analogous to
6505 "algebra"). The method is already installed for class
6506 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
6509 * Former constant "List.op @" now named "List.append". Use ML
6510 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
6511 circumvent possible incompatibilities when working on ML level.
6513 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
6515 * New function listsum :: 'a list => 'a for arbitrary monoids.
6516 Special syntax: "SUM x <- xs. f x" (and latex variants)
6518 * New syntax for Haskell-like list comprehension (input only), eg.
6519 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
6521 * The special syntax for function "filter" has changed from [x :
6522 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
6523 comprehension syntax, and for uniformity. INCOMPATIBILITY.
6525 * [a..b] is now defined for arbitrary linear orders. It used to be
6526 defined on nat only, as an abbreviation for [a..<Suc b]
6529 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
6531 * New functions "sorted" and "sort" in src/HOL/List.thy.
6533 * New lemma collection field_simps (an extension of ring_simps) for
6534 manipulating (in)equations involving division. Multiplies with all
6535 denominators that can be proved to be non-zero (in equations) or
6536 positive/negative (in inequations).
6538 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
6539 have been improved and renamed to ring_simps, group_simps and
6540 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
6541 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
6543 * Theory Library/Commutative_Ring: switched from recdef to function
6544 package; constants add, mul, pow now curried. Infix syntax for
6545 algebraic operations.
6547 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
6550 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
6553 * HOL/records: generalised field-update to take a function on the
6554 field rather than the new value: r(|A := x|) is translated to A_update
6555 (K x) r The K-combinator that is internally used is called K_record.
6556 INCOMPATIBILITY: Usage of the plain update functions has to be
6559 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
6560 * x = 0, which are required for a semiring. Richer structures do not
6561 inherit from semiring_0 anymore, because this property is a theorem
6562 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
6563 there is more to prove, but this is mostly trivial.
6565 * Class "recpower" is generalized to arbitrary monoids, not just
6566 commutative semirings. INCOMPATIBILITY: may need to incorporate
6567 commutativity or semiring properties additionally.
6569 * Constant "List.list_all2" in List.thy now uses authentic syntax.
6570 INCOMPATIBILITY: translations containing list_all2 may go wrong,
6571 better use 'abbreviation'.
6573 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
6575 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
6576 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
6577 significant changes for setting up numeral syntax for types:
6578 - New constants Numeral.pred and Numeral.succ instead
6579 of former Numeral.bin_pred and Numeral.bin_succ.
6580 - Use integer operations instead of bin_add, bin_mult and so on.
6581 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
6582 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
6584 See src/HOL/Integ/IntArith.thy for an example setup.
6586 * Command 'normal_form' computes the normal form of a term that may
6587 contain free variables. For example ``normal_form "rev [a, b, c]"''
6588 produces ``[b, c, a]'' (without proof). This command is suitable for
6589 heavy-duty computations because the functions are compiled to ML
6590 first. Correspondingly, a method "normalization" is provided. See
6591 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
6593 * Alternative iff syntax "A <-> B" for equality on bool (with priority
6594 25 like -->); output depends on the "iff" print_mode, the default is
6595 "A = B" (with priority 50).
6597 * Relations less (<) and less_eq (<=) are also available on type bool.
6598 Modified syntax to disallow nesting without explicit parentheses,
6599 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
6602 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
6604 * Relation composition operator "op O" now has precedence 75 and binds
6605 stronger than union and intersection. INCOMPATIBILITY.
6607 * The old set interval syntax "{m..n(}" (and relatives) has been
6608 removed. Use "{m..<n}" (and relatives) instead.
6610 * In the context of the assumption "~(s = t)" the Simplifier rewrites
6611 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
6612 ``declare [[simproc del: neq]]''.
6614 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
6617 * Theorem Cons_eq_map_conv no longer declared as "simp".
6619 * Theorem setsum_mult renamed to setsum_right_distrib.
6621 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
6624 * Reimplemented methods "sat" and "satx", with several improvements:
6625 goals no longer need to be stated as "<prems> ==> False", equivalences
6626 (i.e. "=" on type bool) are handled, variable names of the form
6627 "lit_<n>" are no longer reserved, significant speedup.
6629 * Methods "sat" and "satx" can now replay MiniSat proof traces.
6630 zChaff is still supported as well.
6632 * 'inductive' and 'datatype': provide projections of mutual rules,
6633 bundled as foo_bar.inducts;
6635 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
6638 * Library: moved theory Accessible_Part to main HOL.
6640 * Library: added theory Coinductive_List of potentially infinite lists
6641 as greatest fixed-point.
6643 * Library: added theory AssocList which implements (finite) maps as
6646 * Method "evaluation" solves goals (i.e. a boolean expression)
6647 efficiently by compiling it to ML. The goal is "proved" (via an
6648 oracle) if it evaluates to True.
6650 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
6651 also when invoked by the simplifier. This results in the Simplifier
6652 being more powerful on arithmetic goals. INCOMPATIBILITY.
6653 Configuration option fast_arith_split_limit=0 recovers the old
6656 * Support for hex (0x20) and binary (0b1001) numerals.
6658 * New method: reify eqs (t), where eqs are equations for an
6659 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
6660 parameter, computes a term s::'b and a list xs::'a list and proves the
6661 theorem I xs s = t. This is also known as reification or quoting. The
6662 resulting theorem is applied to the subgoal to substitute t with I xs
6663 s. If t is omitted, the subgoal itself is reified.
6665 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
6666 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
6667 where f is supposed to be a computable function (in the sense of code
6668 generattion). The method uses reify to compute s and xs as above then
6669 applies corr_thm and uses normalization by evaluation to "prove" f s =
6670 r and finally gets the theorem t = r, which is again applied to the
6671 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
6673 * Reflection: Automatic reification now handels binding, an example is
6674 available in src/HOL/ex/ReflectionEx.thy
6676 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
6677 command 'statespace' that is similar to 'record', but introduces an
6678 abstract specification based on the locale infrastructure instead of
6679 HOL types. This leads to extra flexibility in composing state spaces,
6680 in particular multiple inheritance and renaming of components.
6685 * Hyperreal: Functions root and sqrt are now defined on negative real
6686 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
6687 Nonnegativity side conditions have been removed from many lemmas, so
6688 that more subgoals may now be solved by simplification; potential
6691 * Real: new type classes formalize real normed vector spaces and
6692 algebras, using new overloaded constants scaleR :: real => 'a => 'a
6693 and norm :: 'a => real.
6695 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
6696 reals into other types. The overloaded constant Reals :: 'a set is now
6697 defined as range of_real; potential INCOMPATIBILITY.
6699 * Real: proper support for ML code generation, including 'quickcheck'.
6700 Reals are implemented as arbitrary precision rationals.
6702 * Hyperreal: Several constants that previously worked only for the
6703 reals have been generalized, so they now work over arbitrary vector
6704 spaces. Type annotations may need to be added in some cases; potential
6707 Infinitesimal :: ('a::real_normed_vector) star set
6708 HFinite :: ('a::real_normed_vector) star set
6709 HInfinite :: ('a::real_normed_vector) star set
6710 approx :: ('a::real_normed_vector) star => 'a star => bool
6711 monad :: ('a::real_normed_vector) star => 'a star set
6712 galaxy :: ('a::real_normed_vector) star => 'a star set
6713 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
6714 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
6715 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
6716 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
6717 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
6718 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
6719 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
6720 sgn :: 'a::real_normed_vector => 'a
6721 exp :: 'a::{recpower,real_normed_field,banach} => 'a
6723 * Complex: Some complex-specific constants are now abbreviations for
6724 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
6725 hnorm. Other constants have been entirely removed in favor of the
6726 polymorphic versions (INCOMPATIBILITY):
6730 HInfinite <-- CInfinite
6731 Infinitesimal <-- CInfinitesimal
6734 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
6735 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
6736 (ns)deriv <-- (ns)cderiv
6741 * Formalisation of ideals and the quotient construction over rings.
6743 * Order and lattice theory no longer based on records.
6746 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
6747 greatest_closed. INCOMPATIBILITY.
6749 * Method algebra is now set up via an attribute. For examples see
6750 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
6751 of algebraic structures.
6753 * Renamed theory CRing to Ring.
6758 * Substantial, yet incomplete support for nominal datatypes (binding
6759 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
6760 src/HOL/Nominal/Examples. Prospective users should consult
6761 http://isabelle.in.tum.de/nominal/
6766 * ML basics: just one true type int, which coincides with IntInf.int
6769 * ML within Isar: antiquotations allow to embed statically-checked
6770 formal entities in the source, referring to the context available at
6771 compile-time. For example:
6773 ML {* @{sort "{zero,one}"} *}
6774 ML {* @{typ "'a => 'b"} *}
6775 ML {* @{term "%x. x"} *}
6776 ML {* @{prop "x == y"} *}
6777 ML {* @{ctyp "'a => 'b"} *}
6778 ML {* @{cterm "%x. x"} *}
6779 ML {* @{cprop "x == y"} *}
6780 ML {* @{thm asm_rl} *}
6781 ML {* @{thms asm_rl} *}
6782 ML {* @{type_name c} *}
6783 ML {* @{type_syntax c} *}
6784 ML {* @{const_name c} *}
6785 ML {* @{const_syntax c} *}
6788 ML {* @{theory Pure} *}
6789 ML {* @{theory_ref} *}
6790 ML {* @{theory_ref Pure} *}
6793 ML {* @{clasimpset} *}
6795 The same works for sources being ``used'' within an Isar context.
6797 * ML in Isar: improved error reporting; extra verbosity with
6798 ML_Context.trace enabled.
6800 * Pure/General/table.ML: the join operations now works via exceptions
6801 DUP/SAME instead of type option. This is simpler in simple cases, and
6802 admits slightly more efficient complex applications.
6804 * Pure: 'advanced' translation functions (parse_translation etc.) now
6805 use Context.generic instead of just theory.
6807 * Pure: datatype Context.generic joins theory/Proof.context and
6808 provides some facilities for code that works in either kind of
6809 context, notably GenericDataFun for uniform theory and proof data.
6811 * Pure: simplified internal attribute type, which is now always
6812 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
6813 local (Proof.context) attributes have been discontinued, while
6814 minimizing code duplication. Thm.rule_attribute and
6815 Thm.declaration_attribute build canonical attributes; see also structure
6816 Context for further operations on Context.generic, notably
6817 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
6818 declarations and definitions.
6820 * Context data interfaces (Theory/Proof/GenericDataFun): removed
6821 name/print, uninitialized data defaults to ad-hoc copy of empty value,
6822 init only required for impure data. INCOMPATIBILITY: empty really need
6823 to be empty (no dependencies on theory content!)
6825 * Pure/kernel: consts certification ignores sort constraints given in
6826 signature declarations. (This information is not relevant to the
6827 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
6828 potential INCOMPATIBILITY.
6830 * Pure: axiomatic type classes are now purely definitional, with
6831 explicit proofs of class axioms and super class relations performed
6832 internally. See Pure/axclass.ML for the main internal interfaces --
6833 notably AxClass.define_class supercedes AxClass.add_axclass, and
6834 AxClass.axiomatize_class/classrel/arity supersede
6835 Sign.add_classes/classrel/arities.
6837 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
6838 global/local versions on theory vs. Proof.context have been
6839 discontinued; Attrib.syntax and Method.syntax have been adapted
6840 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
6841 attributes, methods, etc.
6843 * Pure: several functions of signature "... -> theory -> theory * ..."
6844 have been reoriented to "... -> theory -> ... * theory" in order to
6845 allow natural usage in combination with the ||>, ||>>, |-> and
6846 fold_map combinators.
6848 * Pure: official theorem names (closed derivations) and additional
6849 comments (tags) are now strictly separate. Name hints -- which are
6850 maintained as tags -- may be attached any time without affecting the
6853 * Pure: primitive rule lift_rule now takes goal cterm instead of an
6854 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
6855 achieve the old behaviour.
6857 * Pure: the "Goal" constant is now called "prop", supporting a
6858 slightly more general idea of ``protecting'' meta-level rule
6861 * Pure: Logic.(un)varify only works in a global context, which is now
6862 enforced instead of silently assumed. INCOMPATIBILITY, may use
6863 Logic.legacy_(un)varify as temporary workaround.
6865 * Pure: structure Name provides scalable operations for generating
6866 internal variable names, notably Name.variants etc. This replaces
6867 some popular functions from term.ML:
6869 Term.variant -> Name.variant
6870 Term.variantlist -> Name.variant_list
6871 Term.invent_names -> Name.invent_list
6873 Note that low-level renaming rarely occurs in new code -- operations
6874 from structure Variable are used instead (see below).
6876 * Pure: structure Variable provides fundamental operations for proper
6877 treatment of fixed/schematic variables in a context. For example,
6878 Variable.import introduces fixes for schematics of given facts and
6879 Variable.export reverses the effect (up to renaming) -- this replaces
6880 various freeze_thaw operations.
6882 * Pure: structure Goal provides simple interfaces for
6883 init/conclude/finish and tactical prove operations (replacing former
6884 Tactic.prove). Goal.prove is the canonical way to prove results
6885 within a given context; Goal.prove_global is a degraded version for
6886 theory level goals, including a global Drule.standard. Note that
6887 OldGoals.prove_goalw_cterm has long been obsolete, since it is
6888 ill-behaved in a local proof context (e.g. with local fixes/assumes or
6889 in a locale context).
6891 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
6892 and type checking (Syntax.check_term etc.), with common combinations
6893 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
6894 which are considered legacy and await removal.
6896 * Pure/Syntax: generic interfaces for type unchecking
6897 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
6898 with common combinations (Syntax.pretty_term, Syntax.string_of_term
6899 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
6900 available for convenience, but refer to the very same operations using
6901 a mere theory instead of a full context.
6903 * Isar: simplified treatment of user-level errors, using exception
6904 ERROR of string uniformly. Function error now merely raises ERROR,
6905 without any side effect on output channels. The Isar toplevel takes
6906 care of proper display of ERROR exceptions. ML code may use plain
6907 handle/can/try; cat_error may be used to concatenate errors like this:
6909 ... handle ERROR msg => cat_error msg "..."
6911 Toplevel ML code (run directly or through the Isar toplevel) may be
6912 embedded into the Isar toplevel with exception display/debug like
6915 Isar.toplevel (fn () => ...)
6917 INCOMPATIBILITY, removed special transform_error facilities, removed
6918 obsolete variants of user-level exceptions (ERROR_MESSAGE,
6919 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
6920 -- use plain ERROR instead.
6922 * Isar: theory setup now has type (theory -> theory), instead of a
6923 list. INCOMPATIBILITY, may use #> to compose setup functions.
6925 * Isar: ML toplevel pretty printer for type Proof.context, subject to
6926 ProofContext.debug/verbose flags.
6928 * Isar: Toplevel.theory_to_proof admits transactions that modify the
6929 theory before entering a proof state. Transactions now always see a
6930 quasi-functional intermediate checkpoint, both in interactive and
6933 * Isar: simplified interfaces for outer syntax. Renamed
6934 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
6935 OuterSyntax.add_parsers -- this functionality is now included in
6936 OuterSyntax.command etc. INCOMPATIBILITY.
6938 * Simplifier: the simpset of a running simplification process now
6939 contains a proof context (cf. Simplifier.the_context), which is the
6940 very context that the initial simpset has been retrieved from (by
6941 simpset_of/local_simpset_of). Consequently, all plug-in components
6942 (solver, looper etc.) may depend on arbitrary proof data.
6944 * Simplifier.inherit_context inherits the proof context (plus the
6945 local bounds) of the current simplification process; any simproc
6946 etc. that calls the Simplifier recursively should do this! Removed
6947 former Simplifier.inherit_bounds, which is already included here --
6948 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
6949 specify an explicit context using Simplifier.context/theory_context.
6951 * Simplifier/Classical Reasoner: more abstract interfaces
6952 change_simpset/claset for modifying the simpset/claset reference of a
6953 theory; raw versions simpset/claset_ref etc. have been discontinued --
6956 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
6962 * settings: the default heap location within ISABELLE_HOME_USER now
6963 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
6964 Isabelle installations.
6966 * isabelle-process: option -S (secure mode) disables some critical
6967 operations, notably runtime compilation and evaluation of ML source
6970 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
6972 * Support for parallel execution, using native multicore support of
6973 Poly/ML 5.1. The theory loader exploits parallelism when processing
6974 independent theories, according to the given theory header
6975 specifications. The maximum number of worker threads is specified via
6976 usedir option -M or the "max-threads" setting in Proof General. A
6977 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
6978 to 6 on a 8-core machine. User-code needs to observe certain
6979 guidelines for thread-safe programming, see appendix A in the Isar
6980 Implementation manual.
6984 New in Isabelle2005 (October 2005)
6985 ----------------------------------
6989 * Theory headers: the new header syntax for Isar theories is
6992 imports <theory1> ... <theoryN>
6993 uses <file1> ... <fileM>
6996 where the 'uses' part is optional. The previous syntax
6998 theory <name> = <theory1> + ... + <theoryN>:
7000 will disappear in the next release. Use isatool fixheaders to convert
7001 existing theory files. Note that there is no change in ancient
7002 non-Isar theories now, but these will disappear soon.
7004 * Theory loader: parent theories can now also be referred to via
7005 relative and absolute paths.
7007 * Command 'find_theorems' searches for a list of criteria instead of a
7008 list of constants. Known criteria are: intro, elim, dest, name:string,
7009 simp:term, and any term. Criteria can be preceded by '-' to select
7010 theorems that do not match. Intro, elim, dest select theorems that
7011 match the current goal, name:s selects theorems whose fully qualified
7012 name contain s, and simp:term selects all simplification rules whose
7013 lhs match term. Any other term is interpreted as pattern and selects
7014 all theorems matching the pattern. Available in ProofGeneral under
7015 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
7017 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
7019 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
7020 matching the current goal as introduction rule and not having "HOL."
7021 in their name (i.e. not being defined in theory HOL).
7023 * Command 'thms_containing' has been discontinued in favour of
7024 'find_theorems'; INCOMPATIBILITY.
7026 * Communication with Proof General is now 8bit clean, which means that
7027 Unicode text in UTF-8 encoding may be used within theory texts (both
7028 formal and informal parts). Cf. option -U of the Isabelle Proof
7029 General interface. Here are some simple examples (cf. src/HOL/ex):
7031 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
7032 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
7034 * Improved efficiency of the Simplifier and, to a lesser degree, the
7035 Classical Reasoner. Typical big applications run around 2 times
7039 *** Document preparation ***
7041 * Commands 'display_drafts' and 'print_drafts' perform simple output
7042 of raw sources. Only those symbols that do not require additional
7043 LaTeX packages (depending on comments in isabellesym.sty) are
7044 displayed properly, everything else is left verbatim. isatool display
7045 and isatool print are used as front ends (these are subject to the
7046 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
7048 * Command tags control specific markup of certain regions of text,
7049 notably folding and hiding. Predefined tags include "theory" (for
7050 theory begin and end), "proof" for proof commands, and "ML" for
7051 commands involving ML code; the additional tags "visible" and
7052 "invisible" are unused by default. Users may give explicit tag
7053 specifications in the text, e.g. ''by %invisible (auto)''. The
7054 interpretation of tags is determined by the LaTeX job during document
7055 preparation: see option -V of isatool usedir, or options -n and -t of
7056 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
7059 Several document versions may be produced at the same time via isatool
7060 usedir (the generated index.html will link all of them). Typical
7061 specifications include ''-V document=theory,proof,ML'' to present
7062 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
7063 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
7064 these parts without any formal replacement text. The Isabelle site
7065 default settings produce ''document'' and ''outline'' versions as
7068 * Several new antiquotations:
7070 @{term_type term} prints a term with its type annotated;
7072 @{typeof term} prints the type of a term;
7074 @{const const} is the same as @{term const}, but checks that the
7075 argument is a known logical constant;
7077 @{term_style style term} and @{thm_style style thm} print a term or
7078 theorem applying a "style" to it
7082 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
7083 definitions, equations, inequations etc., 'concl' printing only the
7084 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
7085 to print the specified premise. TermStyle.add_style provides an ML
7086 interface for introducing further styles. See also the "LaTeX Sugar"
7087 document practical applications. The ML antiquotation prints
7088 type-checked ML expressions verbatim.
7090 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
7091 and 'text' support optional locale specification '(in loc)', which
7092 specifies the default context for interpreting antiquotations. For
7093 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
7095 * Option 'locale=NAME' of antiquotations specifies an alternative
7096 context interpreting the subsequent argument. For example: @{thm
7097 [locale=lattice] inf_assoc}.
7099 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
7102 * Proper output of antiquotations for theory commands involving a
7103 proof context (such as 'locale' or 'theorem (in loc) ...').
7105 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
7106 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
7108 * isatool usedir: new option -C (default true) controls whether option
7109 -D should include a copy of the original document directory; -C false
7110 prevents unwanted effects such as copying of administrative CVS data.
7115 * Considerably improved version of 'constdefs' command. Now performs
7116 automatic type-inference of declared constants; additional support for
7117 local structure declarations (cf. locales and HOL records), see also
7118 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
7119 sequential dependencies of definitions within a single 'constdefs'
7120 section; moreover, the declared name needs to be an identifier. If
7121 all fails, consider to fall back on 'consts' and 'defs' separately.
7123 * Improved indexed syntax and implicit structures. First of all,
7124 indexed syntax provides a notational device for subscripted
7125 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
7126 expressions. Secondly, in a local context with structure
7127 declarations, number indexes \<^sub>n or the empty index (default
7128 number 1) refer to a certain fixed variable implicitly; option
7129 show_structs controls printing of implicit structures. Typical
7130 applications of these concepts involve record types and locales.
7132 * New command 'no_syntax' removes grammar declarations (and
7133 translations) resulting from the given syntax specification, which is
7134 interpreted in the same manner as for the 'syntax' command.
7136 * 'Advanced' translation functions (parse_translation etc.) may depend
7137 on the signature of the theory context being presently used for
7138 parsing/printing, see also isar-ref manual.
7140 * Improved 'oracle' command provides a type-safe interface to turn an
7141 ML expression of type theory -> T -> term into a primitive rule of
7142 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
7143 is already included here); see also FOL/ex/IffExample.thy;
7146 * axclass: name space prefix for class "c" is now "c_class" (was "c"
7147 before); "cI" is no longer bound, use "c.intro" instead.
7148 INCOMPATIBILITY. This change avoids clashes of fact bindings for
7149 axclasses vs. locales.
7151 * Improved internal renaming of symbolic identifiers -- attach primes
7152 instead of base 26 numbers.
7154 * New flag show_question_marks controls printing of leading question
7155 marks in schematic variable names.
7157 * In schematic variable names, *any* symbol following \<^isub> or
7158 \<^isup> is now treated as part of the base name. For example, the
7159 following works without printing of awkward ".0" indexes:
7161 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
7164 * Inner syntax includes (*(*nested*) comments*).
7166 * Pretty printer now supports unbreakable blocks, specified in mixfix
7167 annotations as "(00...)".
7169 * Clear separation of logical types and nonterminals, where the latter
7170 may only occur in 'syntax' specifications or type abbreviations.
7171 Before that distinction was only partially implemented via type class
7172 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
7173 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
7174 exotic syntax specifications may require further adaption
7175 (e.g. Cube/Cube.thy).
7177 * Removed obsolete type class "logic", use the top sort {} instead.
7178 Note that non-logical types should be declared as 'nonterminals'
7179 rather than 'types'. INCOMPATIBILITY for new object-logic
7182 * Attributes 'induct' and 'cases': type or set names may now be
7183 locally fixed variables as well.
7185 * Simplifier: can now control the depth to which conditional rewriting
7186 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
7189 * Simplifier: simplification procedures may now take the current
7190 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
7191 interface), which is very useful for calling the Simplifier
7192 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
7193 is gone -- use prems_of_ss on the simpset instead. Moreover, the
7194 low-level mk_simproc no longer applies Logic.varify internally, to
7195 allow for use in a context of fixed variables.
7197 * thin_tac now works even if the assumption being deleted contains !!
7198 or ==>. More generally, erule now works even if the major premise of
7199 the elimination rule contains !! or ==>.
7201 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
7203 * Reorganized bootstrapping of the Pure theories; CPure is now derived
7204 from Pure, which contains all common declarations already. Both
7205 theories are defined via plain Isabelle/Isar .thy files.
7206 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
7207 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
7208 use isatool fixcpure to adapt your theory and ML sources.
7210 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
7211 selections of theorems in named facts via index ranges.
7213 * 'print_theorems': in theory mode, really print the difference
7214 wrt. the last state (works for interactive theory development only),
7215 in proof mode print all local facts (cf. 'print_facts');
7217 * 'hide': option '(open)' hides only base names.
7219 * More efficient treatment of intermediate checkpoints in interactive
7222 * Code generator is now invoked via code_module (incremental code
7223 generation) and code_library (modular code generation, ML structures
7224 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
7225 must be quoted when used as identifiers.
7227 * New 'value' command for reading, evaluating and printing terms using
7228 the code generator. INCOMPATIBILITY: command keyword 'value' must be
7229 quoted when used as identifier.
7234 * New commands for the interpretation of locale expressions in
7235 theories (1), locales (2) and proof contexts (3). These generate
7236 proof obligations from the expression specification. After the
7237 obligations have been discharged, theorems of the expression are added
7238 to the theory, target locale or proof context. The synopsis of the
7239 commands is a follows:
7241 (1) interpretation expr inst
7242 (2) interpretation target < expr
7243 (3) interpret expr inst
7245 Interpretation in theories and proof contexts require a parameter
7246 instantiation of terms from the current context. This is applied to
7247 specifications and theorems of the interpreted expression.
7248 Interpretation in locales only permits parameter renaming through the
7249 locale expression. Interpretation is smart in that interpretations
7250 that are active already do not occur in proof obligations, neither are
7251 instantiated theorems stored in duplicate. Use 'print_interps' to
7252 inspect active interpretations of a particular locale. For details,
7253 see the Isar Reference manual. Examples can be found in
7254 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
7256 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
7257 'interpret' instead.
7259 * New context element 'constrains' for adding type constraints to
7262 * Context expressions: renaming of parameters with syntax
7265 * Locale declaration: 'includes' disallowed.
7267 * Proper static binding of attribute syntax -- i.e. types / terms /
7268 facts mentioned as arguments are always those of the locale definition
7269 context, independently of the context of later invocations. Moreover,
7270 locale operations (renaming and type / term instantiation) are applied
7271 to attribute arguments as expected.
7273 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
7274 actual attributes; rare situations may require Attrib.attribute to
7275 embed those attributes into Attrib.src that lack concrete syntax.
7276 Attribute implementations need to cooperate properly with the static
7277 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
7278 Attrib.XXX_thm etc. already do the right thing without further
7279 intervention. Only unusual applications -- such as "where" or "of"
7280 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
7281 on the context and the facts involved -- may have to assign parsed
7282 values to argument tokens explicitly.
7284 * Changed parameter management in theorem generation for long goal
7285 statements with 'includes'. INCOMPATIBILITY: produces a different
7286 theorem statement in rare situations.
7288 * Locale inspection command 'print_locale' omits notes elements. Use
7289 'print_locale!' to have them included in the output.
7294 * Provers/hypsubst.ML: improved version of the subst method, for
7295 single-step rewriting: it now works in bound variable contexts. New is
7296 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
7297 rewrite a different subterm than the original subst method, which is
7298 still available as 'simplesubst'.
7300 * Provers/quasi.ML: new transitivity reasoners for transitivity only
7303 * Provers/trancl.ML: new transitivity reasoner for transitive and
7304 reflexive-transitive closure of relations.
7306 * Provers/blast.ML: new reference depth_limit to make blast's depth
7307 limit (previously hard-coded with a value of 20) user-definable.
7309 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
7310 is peformed already. Object-logics merely need to finish their
7311 initial simpset configuration as before. INCOMPATIBILITY.
7316 * Symbolic syntax of Hilbert Choice Operator is now as follows:
7319 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
7321 The symbol \<some> is displayed as the alternative epsilon of LaTeX
7322 and x-symbol; use option '-m epsilon' to get it actually printed.
7323 Moreover, the mathematically important symbolic identifier \<epsilon>
7324 becomes available as variable, constant etc. INCOMPATIBILITY,
7326 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
7327 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
7328 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
7329 support corresponding Isar calculations.
7331 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
7334 * theory SetInterval: changed the syntax for open intervals:
7343 The old syntax is still supported but will disappear in the next
7344 release. For conversion use the following Emacs search and replace
7345 patterns (these are not perfect but work quite well):
7347 {)\([^\.]*\)\.\. -> {\1<\.\.}
7348 \.\.\([^(}]*\)(} -> \.\.<\1}
7350 * Theory Commutative_Ring (in Library): method comm_ring for proving
7351 equalities in commutative rings; method 'algebra' provides a generic
7354 * Theory Finite_Set: changed the syntax for 'setsum', summation over
7355 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
7356 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
7359 Some new syntax forms are available:
7361 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
7362 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
7363 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
7364 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
7366 The latter form "\<Sum>x < k. e" used to be based on a separate
7367 function "Summation", which has been discontinued.
7369 * theory Finite_Set: in structured induction proofs, the insert case
7370 is now 'case (insert x F)' instead of the old counterintuitive 'case
7373 * The 'refute' command has been extended to support a much larger
7374 fragment of HOL, including axiomatic type classes, constdefs and
7375 typedefs, inductive datatypes and recursion.
7377 * New tactics 'sat' and 'satx' to prove propositional tautologies.
7378 Requires zChaff with proof generation to be installed. See
7379 HOL/ex/SAT_Examples.thy for examples.
7381 * Datatype induction via method 'induct' now preserves the name of the
7382 induction variable. For example, when proving P(xs::'a list) by
7383 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
7384 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
7385 in unstructured proof scripts.
7387 * Reworked implementation of records. Improved scalability for
7388 records with many fields, avoiding performance problems for type
7389 inference. Records are no longer composed of nested field types, but
7390 of nested extension types. Therefore the record type only grows linear
7391 in the number of extensions and not in the number of fields. The
7392 top-level (users) view on records is preserved. Potential
7393 INCOMPATIBILITY only in strange cases, where the theory depends on the
7394 old record representation. The type generated for a record is called
7395 <record_name>_ext_type.
7397 Flag record_quick_and_dirty_sensitive can be enabled to skip the
7398 proofs triggered by a record definition or a simproc (if
7399 quick_and_dirty is enabled). Definitions of large records can take
7402 New simproc record_upd_simproc for simplification of multiple record
7403 updates enabled by default. Moreover, trivial updates are also
7404 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
7405 occasionally, since simplification is more powerful by default.
7407 * typedef: proper support for polymorphic sets, which contain extra
7408 type-variables in the term.
7410 * Simplifier: automatically reasons about transitivity chains
7411 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
7412 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
7413 old proofs break occasionally as simplification may now solve more
7414 goals than previously.
7416 * Simplifier: converts x <= y into x = y if assumption y <= x is
7417 present. Works for all partial orders (class "order"), in particular
7418 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
7421 * Simplifier: new simproc for "let x = a in f x". If a is a free or
7422 bound variable or a constant then the let is unfolded. Otherwise
7423 first a is simplified to b, and then f b is simplified to g. If
7424 possible we abstract b from g arriving at "let x = b in h x",
7425 otherwise we unfold the let and arrive at g. The simproc can be
7426 enabled/disabled by the reference use_let_simproc. Potential
7427 INCOMPATIBILITY since simplification is more powerful by default.
7429 * Classical reasoning: the meson method now accepts theorems as arguments.
7431 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
7432 jobs to provide advice on the provability of subgoals.
7434 * Theory OrderedGroup and Ring_and_Field: various additions and
7435 improvements to faciliate calculations involving equalities and
7438 The following theorems have been eliminated or modified
7441 abs_eq now named abs_of_nonneg
7442 abs_of_ge_0 now named abs_of_nonneg
7443 abs_minus_eq now named abs_of_nonpos
7444 imp_abs_id now named abs_of_nonneg
7445 imp_abs_neg_id now named abs_of_nonpos
7446 mult_pos now named mult_pos_pos
7447 mult_pos_le now named mult_nonneg_nonneg
7448 mult_pos_neg_le now named mult_nonneg_nonpos
7449 mult_pos_neg2_le now named mult_nonneg_nonpos2
7450 mult_neg now named mult_neg_neg
7451 mult_neg_le now named mult_nonpos_nonpos
7453 * The following lemmas in Ring_and_Field have been added to the simplifier:
7456 not_square_less_zero
7458 The following lemmas have been deleted from Real/RealPow:
7468 * Theory Parity: added rules for simplifying exponents.
7472 The following theorems have been eliminated or modified
7475 list_all_Nil now named list_all.simps(1)
7476 list_all_Cons now named list_all.simps(2)
7477 list_all_conv now named list_all_iff
7478 set_mem_eq now named mem_iff
7480 * Theories SetsAndFunctions and BigO (see HOL/Library) support
7481 asymptotic "big O" calculations. See the notes in BigO.thy.
7486 * Theory RealDef: better support for embedding natural numbers and
7487 integers in the reals.
7489 The following theorems have been eliminated or modified
7492 exp_ge_add_one_self now requires no hypotheses
7493 real_of_int_add reversed direction of equality (use [symmetric])
7494 real_of_int_minus reversed direction of equality (use [symmetric])
7495 real_of_int_diff reversed direction of equality (use [symmetric])
7496 real_of_int_mult reversed direction of equality (use [symmetric])
7498 * Theory RComplete: expanded support for floor and ceiling functions.
7500 * Theory Ln is new, with properties of the natural logarithm
7502 * Hyperreal: There is a new type constructor "star" for making
7503 nonstandard types. The old type names are now type synonyms:
7507 hcomplex = complex star
7509 * Hyperreal: Many groups of similarly-defined constants have been
7510 replaced by polymorphic versions (INCOMPATIBILITY):
7512 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
7514 starset <-- starsetNat, starsetC
7515 *s* <-- *sNat*, *sc*
7516 starset_n <-- starsetNat_n, starsetC_n
7517 *sn* <-- *sNatn*, *scn*
7518 InternalSets <-- InternalNatSets, InternalCSets
7520 starfun <-- starfun{Nat,Nat2,C,RC,CR}
7521 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
7522 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
7523 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
7524 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
7526 * Hyperreal: Many type-specific theorems have been removed in favor of
7527 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
7529 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
7530 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
7531 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
7532 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
7533 right_minus <-- hypreal_add_minus
7534 left_minus <-- {hypreal,hcomplex}_add_minus_left
7535 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
7536 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
7537 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
7538 mult_1_right <-- hcomplex_mult_one_right
7539 mult_zero_left <-- hcomplex_mult_zero_left
7540 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
7541 right_distrib <-- hypnat_add_mult_distrib2
7542 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
7543 right_inverse <-- hypreal_mult_inverse
7544 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
7545 order_refl <-- {hypreal,hypnat}_le_refl
7546 order_trans <-- {hypreal,hypnat}_le_trans
7547 order_antisym <-- {hypreal,hypnat}_le_anti_sym
7548 order_less_le <-- {hypreal,hypnat}_less_le
7549 linorder_linear <-- {hypreal,hypnat}_le_linear
7550 add_left_mono <-- {hypreal,hypnat}_add_left_mono
7551 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
7552 add_nonneg_nonneg <-- hypreal_le_add_order
7554 * Hyperreal: Separate theorems having to do with type-specific
7555 versions of constants have been merged into theorems that apply to the
7556 new polymorphic constants (INCOMPATIBILITY):
7558 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
7559 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
7560 STAR_Un <-- {STAR,NatStar,STARC}_Un
7561 STAR_Int <-- {STAR,NatStar,STARC}_Int
7562 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
7563 STAR_subset <-- {STAR,NatStar,STARC}_subset
7564 STAR_mem <-- {STAR,NatStar,STARC}_mem
7565 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
7566 STAR_diff <-- {STAR,STARC}_diff
7567 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
7568 STARC_hcomplex_of_complex}_image_subset
7569 starset_n_Un <-- starset{Nat,C}_n_Un
7570 starset_n_Int <-- starset{Nat,C}_n_Int
7571 starset_n_Compl <-- starset{Nat,C}_n_Compl
7572 starset_n_diff <-- starset{Nat,C}_n_diff
7573 InternalSets_Un <-- Internal{Nat,C}Sets_Un
7574 InternalSets_Int <-- Internal{Nat,C}Sets_Int
7575 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
7576 InternalSets_diff <-- Internal{Nat,C}Sets_diff
7577 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
7578 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
7579 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
7580 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
7581 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
7582 starfun <-- starfun{Nat,Nat2,C,RC,CR}
7583 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
7584 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
7585 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
7586 starfun_diff <-- starfun{C,RC,CR}_diff
7587 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
7588 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
7589 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
7590 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
7591 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
7592 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
7593 starfun_Id <-- starfunC_Id
7594 starfun_approx <-- starfun{Nat,CR}_approx
7595 starfun_capprox <-- starfun{C,RC}_capprox
7596 starfun_abs <-- starfunNat_rabs
7597 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
7598 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
7599 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
7600 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
7601 starfun_add_capprox <-- starfun{C,RC}_add_capprox
7602 starfun_add_approx <-- starfunCR_add_approx
7603 starfun_inverse_inverse <-- starfunC_inverse_inverse
7604 starfun_divide <-- starfun{C,CR,RC}_divide
7605 starfun_n <-- starfun{Nat,C}_n
7606 starfun_n_mult <-- starfun{Nat,C}_n_mult
7607 starfun_n_add <-- starfun{Nat,C}_n_add
7608 starfun_n_add_minus <-- starfunNat_n_add_minus
7609 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
7610 starfun_n_minus <-- starfun{Nat,C}_n_minus
7611 starfun_n_eq <-- starfun{Nat,C}_n_eq
7613 star_n_add <-- {hypreal,hypnat,hcomplex}_add
7614 star_n_minus <-- {hypreal,hcomplex}_minus
7615 star_n_diff <-- {hypreal,hcomplex}_diff
7616 star_n_mult <-- {hypreal,hcomplex}_mult
7617 star_n_inverse <-- {hypreal,hcomplex}_inverse
7618 star_n_le <-- {hypreal,hypnat}_le
7619 star_n_less <-- {hypreal,hypnat}_less
7620 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
7621 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
7622 star_n_abs <-- hypreal_hrabs
7623 star_n_divide <-- hcomplex_divide
7625 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
7626 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
7627 star_of_diff <-- hypreal_of_real_diff
7628 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
7629 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
7630 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
7631 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
7632 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
7633 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
7634 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
7635 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
7636 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
7637 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
7638 star_of_number_of <-- {hypreal,hcomplex}_number_of
7639 star_of_number_less <-- number_of_less_hypreal_of_real_iff
7640 star_of_number_le <-- number_of_le_hypreal_of_real_iff
7641 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
7642 star_of_less_number <-- hypreal_of_real_less_number_of_iff
7643 star_of_le_number <-- hypreal_of_real_le_number_of_iff
7644 star_of_power <-- hypreal_of_real_power
7645 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
7647 * Hyperreal: new method "transfer" that implements the transfer
7648 principle of nonstandard analysis. With a subgoal that mentions
7649 nonstandard types like "'a star", the command "apply transfer"
7650 replaces it with an equivalent one that mentions only standard types.
7651 To be successful, all free variables must have standard types; non-
7652 standard variables must have explicit universal quantifiers.
7654 * Hyperreal: A theory of Taylor series.
7659 * Discontinued special version of 'constdefs' (which used to support
7660 continuous functions) in favor of the general Pure one with full
7663 * New simplification procedure for solving continuity conditions; it
7664 is much faster on terms with many nested lambda abstractions (cubic
7665 instead of exponential time).
7667 * New syntax for domain package: selector names are now optional.
7668 Parentheses should be omitted unless argument is lazy, for example:
7670 domain 'a stream = cons "'a" (lazy "'a stream")
7672 * New command 'fixrec' for defining recursive functions with pattern
7673 matching; defining multiple functions with mutual recursion is also
7674 supported. Patterns may include the constants cpair, spair, up, sinl,
7675 sinr, or any data constructor defined by the domain package. The given
7676 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
7677 syntax and examples.
7679 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
7680 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
7681 but the proof obligation additionally includes an admissibility
7682 requirement. The packages generate instances of class cpo or pcpo,
7683 with continuity and strictness theorems for Rep and Abs.
7685 * HOLCF: Many theorems have been renamed according to a more standard naming
7686 scheme (INCOMPATIBILITY):
7688 foo_inject: "foo$x = foo$y ==> x = y"
7689 foo_eq: "(foo$x = foo$y) = (x = y)"
7690 foo_less: "(foo$x << foo$y) = (x << y)"
7691 foo_strict: "foo$UU = UU"
7692 foo_defined: "... ==> foo$x ~= UU"
7693 foo_defined_iff: "(foo$x = UU) = (x = UU)"
7698 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
7699 including the First Isomorphism Theorem (on quotienting by the kernel
7702 * ZF/Simplifier: install second copy of type solver that actually
7703 makes use of TC rules declared to Isar proof contexts (or locales);
7704 the old version is still required for ML proof scripts.
7709 * Converted to Isar theory format; use locales instead of axiomatic
7715 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
7718 * Pure/library.ML no longer defines its own option datatype, but uses
7719 that of the SML basis, which has constructors NONE and SOME instead of
7720 None and Some, as well as exception Option.Option instead of OPTION.
7721 The functions the, if_none, is_some, is_none have been adapted
7722 accordingly, while Option.map replaces apsome.
7724 * Pure/library.ML: the exception LIST has been given up in favour of
7725 the standard exceptions Empty and Subscript, as well as
7726 Library.UnequalLengths. Function like Library.hd and Library.tl are
7727 superceded by the standard hd and tl functions etc.
7729 A number of basic list functions are no longer exported to the ML
7730 toplevel, as they are variants of predefined functions. The following
7731 suggests how one can translate existing code:
7733 rev_append xs ys = List.revAppend (xs, ys)
7734 nth_elem (i, xs) = List.nth (xs, i)
7735 last_elem xs = List.last xs
7736 flat xss = List.concat xss
7737 seq fs = List.app fs
7738 partition P xs = List.partition P xs
7739 mapfilter f xs = List.mapPartial f xs
7741 * Pure/library.ML: several combinators for linear functional
7742 transformations, notably reverse application and composition:
7745 (x, y) |-> f f #-> g
7747 * Pure/library.ML: introduced/changed precedence of infix operators:
7749 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
7751 infix 3 o oo ooo oooo;
7752 infix 4 ~~ upto downto;
7754 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
7757 * Pure/library.ML: natural list combinators fold, fold_rev, and
7758 fold_map support linear functional transformations and nesting. For
7761 fold f [x1, ..., xN] y =
7762 y |> f x1 |> ... |> f xN
7764 (fold o fold) f [xs1, ..., xsN] y =
7765 y |> fold f xs1 |> ... |> fold f xsN
7767 fold f [x1, ..., xN] =
7770 (fold o fold) f [xs1, ..., xsN] =
7771 fold f xs1 #> ... #> fold f xsN
7773 * Pure/library.ML: the following selectors on type 'a option are
7776 the: 'a option -> 'a (*partial*)
7777 these: 'a option -> 'a where 'a = 'b list
7778 the_default: 'a -> 'a option -> 'a
7779 the_list: 'a option -> 'a list
7781 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
7782 basic operations for association lists, following natural argument
7783 order; moreover the explicit equality predicate passed here avoids
7784 potentially expensive polymorphic runtime equality checks.
7785 The old functions may be expressed as follows:
7787 assoc = uncurry (AList.lookup (op =))
7788 assocs = these oo AList.lookup (op =)
7789 overwrite = uncurry (AList.update (op =)) o swap
7791 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
7793 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
7794 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
7796 replacing make_keylist and keyfilter (occassionally used)
7799 make_keylist = AList.make
7800 keyfilter = AList.find (op =)
7802 * eq_fst and eq_snd now take explicit equality parameter, thus
7803 avoiding eqtypes. Naive rewrites:
7805 eq_fst = eq_fst (op =)
7806 eq_snd = eq_snd (op =)
7808 * Removed deprecated apl and apr (rarely used).
7811 apl (n, op) =>>= curry op n
7812 apr (op, m) =>>= fn n => op (n, m)
7814 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
7815 provides a reasonably efficient light-weight implementation of sets as
7818 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
7819 few new operations; existing lookup and update are now curried to
7820 follow natural argument order (for use with fold etc.);
7821 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
7823 * Pure/General: output via the Isabelle channels of
7824 writeln/warning/error etc. is now passed through Output.output, with a
7825 hook for arbitrary transformations depending on the print_mode
7826 (cf. Output.add_mode -- the first active mode that provides a output
7827 function wins). Already formatted output may be embedded into further
7828 text via Output.raw; the result of Pretty.string_of/str_of and derived
7829 functions (string_of_term/cterm/thm etc.) is already marked raw to
7830 accommodate easy composition of diagnostic messages etc. Programmers
7831 rarely need to care about Output.output or Output.raw at all, with
7832 some notable exceptions: Output.output is required when bypassing the
7833 standard channels (writeln etc.), or in token translations to produce
7834 properly formatted results; Output.raw is required when capturing
7835 already output material that will eventually be presented to the user
7836 a second time. For the default print mode, both Output.output and
7837 Output.raw have no effect.
7839 * Pure/General: Output.time_accumulator NAME creates an operator ('a
7840 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
7841 cumulative results are displayed at the end of a batch session.
7843 * Pure/General: File.sysify_path and File.quote_sysify path have been
7844 replaced by File.platform_path and File.shell_path (with appropriate
7845 hooks). This provides a clean interface for unusual systems where the
7846 internal and external process view of file names are different.
7848 * Pure: more efficient orders for basic syntactic entities: added
7849 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
7850 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
7851 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
7852 orders now -- potential INCOMPATIBILITY for code that depends on a
7853 particular order for Symtab.keys, Symtab.dest, etc. (consider using
7854 Library.sort_strings on result).
7856 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
7857 fold_types traverse types/terms from left to right, observing natural
7858 argument order. Supercedes previous foldl_XXX versions, add_frees,
7859 add_vars etc. have been adapted as well: INCOMPATIBILITY.
7861 * Pure: name spaces have been refined, with significant changes of the
7862 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
7863 to extern(_table). The plain name entry path is superceded by a
7864 general 'naming' context, which also includes the 'policy' to produce
7865 a fully qualified name and external accesses of a fully qualified
7866 name; NameSpace.extend is superceded by context dependent
7867 Sign.declare_name. Several theory and proof context operations modify
7868 the naming context. Especially note Theory.restore_naming and
7869 ProofContext.restore_naming to get back to a sane state; note that
7870 Theory.add_path is no longer sufficient to recover from
7871 Theory.absolute_path in particular.
7873 * Pure: new flags short_names (default false) and unique_names
7874 (default true) for controlling output of qualified names. If
7875 short_names is set, names are printed unqualified. If unique_names is
7876 reset, the name prefix is reduced to the minimum required to achieve
7877 the original result when interning again, even if there is an overlap
7878 with earlier declarations.
7880 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
7881 now 'extend', and 'merge' gets an additional Pretty.pp argument
7882 (useful for printing error messages). INCOMPATIBILITY.
7884 * Pure: major reorganization of the theory context. Type Sign.sg and
7885 Theory.theory are now identified, referring to the universal
7886 Context.theory (see Pure/context.ML). Actual signature and theory
7887 content is managed as theory data. The old code and interfaces were
7888 spread over many files and structures; the new arrangement introduces
7889 considerable INCOMPATIBILITY to gain more clarity:
7891 Context -- theory management operations (name, identity, inclusion,
7892 parents, ancestors, merge, etc.), plus generic theory data;
7894 Sign -- logical signature and syntax operations (declaring consts,
7895 types, etc.), plus certify/read for common entities;
7897 Theory -- logical theory operations (stating axioms, definitions,
7898 oracles), plus a copy of logical signature operations (consts,
7899 types, etc.); also a few basic management operations (Theory.copy,
7902 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
7903 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
7904 for convenience -- they merely return the theory.
7906 * Pure: type Type.tsig is superceded by theory in most interfaces.
7908 * Pure: the Isar proof context type is already defined early in Pure
7909 as Context.proof (note that ProofContext.context and Proof.context are
7910 aliases, where the latter is the preferred name). This enables other
7911 Isabelle components to refer to that type even before Isar is present.
7913 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
7914 typeK, constK, axiomK, oracleK), but provide explicit operations for
7915 any of these kinds. For example, Sign.intern typeK is now
7916 Sign.intern_type, Theory.hide_space Sign.typeK is now
7917 Theory.hide_types. Also note that former
7918 Theory.hide_classes/types/consts are now
7919 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
7920 internalize their arguments! INCOMPATIBILITY.
7922 * Pure: get_thm interface (of PureThy and ProofContext) expects
7923 datatype thmref (with constructors Name and NameSelection) instead of
7924 plain string -- INCOMPATIBILITY;
7926 * Pure: cases produced by proof methods specify options, where NONE
7927 means to remove case bindings -- INCOMPATIBILITY in
7930 * Pure: the following operations retrieve axioms or theorems from a
7931 theory node or theory hierarchy, respectively:
7933 Theory.axioms_of: theory -> (string * term) list
7934 Theory.all_axioms_of: theory -> (string * term) list
7935 PureThy.thms_of: theory -> (string * thm) list
7936 PureThy.all_thms_of: theory -> (string * thm) list
7938 * Pure: print_tac now outputs the goal through the trace channel.
7940 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
7941 Reference Toplevel.debug (default false) controls detailed printing
7942 and tracing of low-level exceptions; Toplevel.profiling (default 0)
7943 controls execution profiling -- set to 1 for time and 2 for space
7944 (both increase the runtime).
7946 * Isar session: The initial use of ROOT.ML is now always timed,
7947 i.e. the log will show the actual process times, in contrast to the
7948 elapsed wall-clock time that the outer shell wrapper produces.
7950 * Simplifier: improved handling of bound variables (nameless
7951 representation, avoid allocating new strings). Simprocs that invoke
7952 the Simplifier recursively should use Simplifier.inherit_bounds to
7953 avoid local name clashes. Failure to do so produces warnings
7954 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
7955 for further details.
7957 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
7958 bindings for all theorems stored within a given theory; this may help
7959 in porting non-Isar theories to Isar ones, while keeping ML proof
7960 scripts for the time being.
7962 * ML operator HTML.with_charset specifies the charset begin used for
7963 generated HTML files. For example:
7965 HTML.with_charset "utf-8" use_thy "Hebrew";
7966 HTML.with_charset "utf-8" use_thy "Chinese";
7971 * Allow symlinks to all proper Isabelle executables (Isabelle,
7972 isabelle, isatool etc.).
7974 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
7975 isatool doc, isatool mkdir, display_drafts etc.).
7977 * isatool usedir: option -f allows specification of the ML file to be
7978 used by Isabelle; default is ROOT.ML.
7980 * New isatool version outputs the version identifier of the Isabelle
7981 distribution being used.
7983 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
7984 (containing Boolean satisfiability problems) into Isabelle/HOL
7989 New in Isabelle2004 (April 2004)
7990 --------------------------------
7994 * Provers/order.ML: new efficient reasoner for partial and linear orders.
7995 Replaces linorder.ML.
7997 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
7998 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
7999 (\<a>...\<z>), are now considered normal letters, and can therefore
8000 be used anywhere where an ASCII letter (a...zA...Z) has until
8001 now. COMPATIBILITY: This obviously changes the parsing of some
8002 terms, especially where a symbol has been used as a binder, say
8003 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
8004 as an identifier. Fix it by inserting a space around former
8005 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
8006 existing theory and ML files.
8008 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
8010 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
8011 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
8012 a normal (but invisible) letter. For multiple letter subscripts repeat
8013 \<^isub> like this: x\<^isub>1\<^isub>2.
8015 * Pure: There are now sub-/superscripts that can span more than one
8016 character. Text between \<^bsub> and \<^esub> is set in subscript in
8017 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
8018 superscript. The new control characters are not identifier parts.
8020 * Pure: Control-symbols of the form \<^raw:...> will literally print the
8021 content of "..." to the latex file instead of \isacntrl... . The "..."
8022 may consist of any printable characters excluding the end bracket >.
8024 * Pure: Using new Isar command "finalconsts" (or the ML functions
8025 Theory.add_finals or Theory.add_finals_i) it is now possible to
8026 declare constants "final", which prevents their being given a definition
8027 later. It is useful for constants whose behaviour is fixed axiomatically
8028 rather than definitionally, such as the meta-logic connectives.
8030 * Pure: 'instance' now handles general arities with general sorts
8031 (i.e. intersections of classes),
8033 * Presentation: generated HTML now uses a CSS style sheet to make layout
8034 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
8035 It can be changed to alter the colors/layout of generated pages.
8040 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
8041 cut_tac, subgoal_tac and thin_tac:
8042 - Now understand static (Isar) contexts. As a consequence, users of Isar
8043 locales are no longer forced to write Isar proof scripts.
8044 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
8046 - INCOMPATIBILITY: names of variables to be instantiated may no
8047 longer be enclosed in quotes. Instead, precede variable name with `?'.
8048 This is consistent with the instantiation attribute "where".
8050 * Attributes "where" and "of":
8051 - Now take type variables of instantiated theorem into account when reading
8052 the instantiation string. This fixes a bug that caused instantiated
8053 theorems to have too special types in some circumstances.
8054 - "where" permits explicit instantiations of type variables.
8056 * Calculation commands "moreover" and "also" no longer interfere with
8057 current facts ("this"), admitting arbitrary combinations with "then"
8061 - Goal statements involving the context element "includes" no longer
8062 generate theorems with internal delta predicates (those ending on
8063 "_axioms") in the premise.
8064 Resolve particular premise with <locale>.intro to obtain old form.
8065 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
8066 specification and "includes" elements in goal statement.
8067 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
8068 [intro?] and [elim?] (respectively) by default.
8069 - Experimental command for instantiation of locales in proof contexts:
8070 instantiate <label>[<attrs>]: <loc>
8071 Instantiates locale <loc> and adds all its theorems to the current context
8072 taking into account their attributes. Label and attrs are optional
8073 modifiers, like in theorem declarations. If present, names of
8074 instantiated theorems are qualified with <label>, and the attributes
8075 <attrs> are applied after any attributes these theorems might have already.
8076 If the locale has assumptions, a chained fact of the form
8077 "<loc> t1 ... tn" is expected from which instantiations of the parameters
8078 are derived. The command does not support old-style locales declared
8079 with "locale (open)".
8080 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
8082 * HOL: Tactic emulation methods induct_tac and case_tac understand static
8088 * Proof import: new image HOL4 contains the imported library from
8089 the HOL4 system with about 2500 theorems. It is imported by
8090 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
8091 can be used like any other Isabelle image. See
8092 HOL/Import/HOL/README for more information.
8095 - Much improved handling of linear and partial orders.
8096 Reasoners for linear and partial orders are set up for type classes
8097 "linorder" and "order" respectively, and are added to the default simpset
8098 as solvers. This means that the simplifier can build transitivity chains
8099 to solve goals from the assumptions.
8100 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
8101 of blast or auto after simplification become unnecessary because the goal
8102 is solved by simplification already.
8104 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
8105 all proved in axiomatic type classes for semirings, rings and fields.
8108 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
8109 now formalized using the Ring_and_Field theory mentioned above.
8110 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
8111 than before, because now they are set up once in a generic manner.
8112 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
8113 Look for the general versions in Ring_and_Field (and Power if they concern
8116 * Type "rat" of the rational numbers is now available in HOL-Complex.
8119 - Record types are now by default printed with their type abbreviation
8120 instead of the list of all field types. This can be configured via
8121 the reference "print_record_type_abbr".
8122 - Simproc "record_upd_simproc" for simplification of multiple updates added
8123 (not enabled by default).
8124 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
8125 EX x. x = sel r to True (not enabled by default).
8126 - Tactic "record_split_simp_tac" to split and simplify records added.
8128 * 'specification' command added, allowing for definition by
8129 specification. There is also an 'ax_specification' command that
8130 introduces the new constants axiomatically.
8132 * arith(_tac) is now able to generate counterexamples for reals as well.
8134 * HOL-Algebra: new locale "ring" for non-commutative rings.
8136 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
8137 definitions, thanks to Sava Krsti\'{c} and John Matthews.
8139 * HOL-Matrix: a first theory for matrices in HOL with an application of
8140 matrix theory to linear programming.
8142 * Unions and Intersections:
8143 The latex output syntax of UN and INT has been changed
8144 from "\Union x \in A. B" to "\Union_{x \in A} B"
8145 i.e. the index formulae has become a subscript.
8146 Similarly for "\Union x. B", and for \Inter instead of \Union.
8148 * Unions and Intersections over Intervals:
8149 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
8150 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
8151 like in normal math, and corresponding versions for < and for intersection.
8153 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
8154 lexicographic dictonary ordering has been added as "lexord".
8156 * ML: the legacy theory structures Int and List have been removed. They had
8157 conflicted with ML Basis Library structures having the same names.
8159 * 'refute' command added to search for (finite) countermodels. Only works
8160 for a fragment of HOL. The installation of an external SAT solver is
8161 highly recommended. See "HOL/Refute.thy" for details.
8163 * 'quickcheck' command: Allows to find counterexamples by evaluating
8164 formulae under an assignment of free variables to random values.
8165 In contrast to 'refute', it can deal with inductive datatypes,
8166 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
8172 * Streams now come with concatenation and are part of the HOLCF image
8176 New in Isabelle2003 (May 2003)
8177 ------------------------------
8181 * Provers/simplifier:
8183 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
8184 Assumptions are now subject to complete mutual simplification,
8185 not just from left to right. The simplifier now preserves
8186 the order of assumptions.
8188 Potential INCOMPATIBILITY:
8190 -- simp sometimes diverges where the old version did
8191 not, e.g. invoking simp on the goal
8193 [| P (f x); y = x; f x = f y |] ==> Q
8195 now gives rise to the infinite reduction sequence
8197 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
8199 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
8202 -- Tactics combining classical reasoner and simplification (such as auto)
8203 are also affected by this change, because many of them rely on
8204 simp. They may sometimes diverge as well or yield a different numbers
8205 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
8206 in case of problems. Sometimes subsequent calls to the classical
8207 reasoner will fail because a preceeding call to the simplifier too
8208 eagerly simplified the goal, e.g. deleted redundant premises.
8210 - The simplifier trace now shows the names of the applied rewrite rules
8212 - You can limit the number of recursive invocations of the simplifier
8213 during conditional rewriting (where the simplifie tries to solve the
8214 conditions before applying the rewrite rule):
8215 ML "simp_depth_limit := n"
8216 where n is an integer. Thus you can force termination where previously
8217 the simplifier would diverge.
8219 - Accepts free variables as head terms in congruence rules. Useful in Isar.
8221 - No longer aborts on failed congruence proof. Instead, the
8222 congruence is ignored.
8224 * Pure: New generic framework for extracting programs from constructive
8225 proofs. See HOL/Extraction.thy for an example instantiation, as well
8226 as HOL/Extraction for some case studies.
8228 * Pure: The main goal of the proof state is no longer shown by default, only
8229 the subgoals. This behaviour is controlled by a new flag.
8230 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
8231 (ML: Proof.show_main_goal).
8233 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
8234 rules whose conclusion matches subgoal 1:
8235 PG menu: Isabelle/Isar -> Show me -> matching rules
8236 The rules are ordered by how closely they match the subgoal.
8237 In particular, rules that solve a subgoal outright are displayed first
8238 (or rather last, the way they are printed).
8239 (ML: ProofGeneral.print_intros())
8241 * Pure: New flag trace_unify_fail causes unification to print
8242 diagnostic information (PG: in trace buffer) when it fails. This is
8243 useful for figuring out why single step proofs like rule, erule or
8246 * Pure: Locale specifications now produce predicate definitions
8247 according to the body of text (covering assumptions modulo local
8248 definitions); predicate "loc_axioms" covers newly introduced text,
8249 while "loc" is cumulative wrt. all included locale expressions; the
8250 latter view is presented only on export into the global theory
8251 context; potential INCOMPATIBILITY, use "(open)" option to fall back
8252 on the old view without predicates;
8254 * Pure: predefined locales "var" and "struct" are useful for sharing
8255 parameters (as in CASL, for example); just specify something like
8256 ``var x + var y + struct M'' as import;
8258 * Pure: improved thms_containing: proper indexing of facts instead of
8259 raw theorems; check validity of results wrt. current name space;
8260 include local facts of proof configuration (also covers active
8261 locales), cover fixed variables in index; may use "_" in term
8262 specification; an optional limit for the number of printed facts may
8263 be given (the default is 40);
8265 * Pure: disallow duplicate fact bindings within new-style theory files
8268 * Provers: improved induct method: assumptions introduced by case
8269 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
8270 the goal statement); "foo" still refers to all facts collectively;
8272 * Provers: the function blast.overloaded has been removed: all constants
8273 are regarded as potentially overloaded, which improves robustness in exchange
8274 for slight decrease in efficiency;
8276 * Provers/linorder: New generic prover for transitivity reasoning over
8277 linear orders. Note: this prover is not efficient!
8279 * Isar: preview of problems to finish 'show' now produce an error
8280 rather than just a warning (in interactive mode);
8287 - Produces a counter example if it cannot prove a goal.
8288 Note that the counter example may be spurious if the goal is not a formula
8289 of quantifier-free linear arithmetic.
8290 In ProofGeneral the counter example appears in the trace buffer.
8292 - Knows about div k and mod k where k is a numeral of type nat or int.
8294 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
8295 linear arithmetic fails. This takes account of quantifiers and divisibility.
8296 Presburger arithmetic can also be called explicitly via presburger(_tac).
8298 * simp's arithmetic capabilities have been enhanced a bit: it now
8299 takes ~= in premises into account (by performing a case split);
8301 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
8302 are distributed over a sum of terms;
8304 * New tactic "trans_tac" and method "trans" instantiate
8305 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
8308 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
8309 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
8311 * 'typedef' command has new option "open" to suppress the set
8314 * functions Min and Max on finite sets have been introduced (theory
8317 * attribute [symmetric] now works for relations as well; it turns
8318 (x,y) : R^-1 into (y,x) : R, and vice versa;
8320 * induct over a !!-quantified statement (say !!x1..xn):
8321 each "case" automatically performs "fix x1 .. xn" with exactly those names.
8323 * Map: `empty' is no longer a constant but a syntactic abbreviation for
8324 %x. None. Warning: empty_def now refers to the previously hidden definition
8327 * Algebra: formalization of classical algebra. Intended as base for
8328 any algebraic development in Isabelle. Currently covers group theory
8329 (up to Sylow's theorem) and ring theory (Universal Property of
8330 Univariate Polynomials). Contributions welcome;
8332 * GroupTheory: deleted, since its material has been moved to Algebra;
8334 * Complex: new directory of the complex numbers with numeric constants,
8335 nonstandard complex numbers, and some complex analysis, standard and
8336 nonstandard (Jacques Fleuriot);
8338 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
8340 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
8343 * Real/HahnBanach: updated and adapted to locales;
8345 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
8348 * UNITY: added the Meier-Sanders theory of progress sets;
8350 * MicroJava: bytecode verifier and lightweight bytecode verifier
8351 as abstract algorithms, instantiated to the JVM;
8353 * Bali: Java source language formalization. Type system, operational
8354 semantics, axiomatic semantics. Supported language features:
8355 classes, interfaces, objects,virtual methods, static methods,
8356 static/instance fields, arrays, access modifiers, definite
8357 assignment, exceptions.
8362 * ZF/Constructible: consistency proof for AC (Gdel's constructible
8365 * Main ZF: virtually all theories converted to new-style format;
8370 * Pure: Tactic.prove provides sane interface for internal proofs;
8371 omits the infamous "standard" operation, so this is more appropriate
8372 than prove_goalw_cterm in many situations (e.g. in simprocs);
8374 * Pure: improved error reporting of simprocs;
8376 * Provers: Simplifier.simproc(_i) provides sane interface for setting
8380 *** Document preparation ***
8382 * uses \par instead of \\ for line breaks in theory text. This may
8383 shift some page breaks in large documents. To get the old behaviour
8384 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
8386 * minimized dependencies of isabelle.sty and isabellesym.sty on
8389 * \<euro> now needs package babel/greek instead of marvosym (which
8392 * normal size for \<zero>...\<nine> (uses \mathbf instead of
8397 New in Isabelle2002 (March 2002)
8398 --------------------------------
8400 *** Document preparation ***
8402 * greatly simplified document preparation setup, including more
8403 graceful interpretation of isatool usedir -i/-d/-D options, and more
8404 instructive isatool mkdir; users should basically be able to get
8405 started with "isatool mkdir HOL Test && isatool make"; alternatively,
8406 users may run a separate document processing stage manually like this:
8407 "isatool usedir -D output HOL Test && isatool document Test/output";
8409 * theory dependency graph may now be incorporated into documents;
8410 isatool usedir -g true will produce session_graph.eps/.pdf for use
8411 with \includegraphics of LaTeX;
8413 * proper spacing of consecutive markup elements, especially text
8414 blocks after section headings;
8416 * support bold style (for single symbols only), input syntax is like
8417 this: "\<^bold>\<alpha>" or "\<^bold>A";
8419 * \<bullet> is now output as bold \cdot by default, which looks much
8420 better in printed text;
8422 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
8423 note that these symbols are currently unavailable in Proof General /
8424 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
8426 * isatool latex no longer depends on changed TEXINPUTS, instead
8427 isatool document copies the Isabelle style files to the target
8433 * Pure/Provers: improved proof by cases and induction;
8434 - 'case' command admits impromptu naming of parameters (such as
8436 - 'induct' method divinates rule instantiation from the inductive
8437 claim; no longer requires excessive ?P bindings for proper
8438 instantiation of cases;
8439 - 'induct' method properly enumerates all possibilities of set/type
8440 rules; as a consequence facts may be also passed through *type*
8441 rules without further ado;
8442 - 'induct' method now derives symbolic cases from the *rulified*
8443 rule (before it used to rulify cases stemming from the internal
8444 atomized version); this means that the context of a non-atomic
8445 statement becomes is included in the hypothesis, avoiding the
8446 slightly cumbersome show "PROP ?case" form;
8447 - 'induct' may now use elim-style induction rules without chaining
8448 facts, using ``missing'' premises from the goal state; this allows
8449 rules stemming from inductive sets to be applied in unstructured
8450 scripts, while still benefitting from proper handling of non-atomic
8451 statements; NB: major inductive premises need to be put first, all
8452 the rest of the goal is passed through the induction;
8453 - 'induct' proper support for mutual induction involving non-atomic
8454 rule statements (uses the new concept of simultaneous goals, see
8456 - append all possible rule selections, but only use the first
8457 success (no backtracking);
8458 - removed obsolete "(simplified)" and "(stripped)" options of methods;
8459 - undeclared rule case names default to numbers 1, 2, 3, ...;
8460 - added 'print_induct_rules' (covered by help item in recent Proof
8462 - moved induct/cases attributes to Pure, methods to Provers;
8463 - generic method setup instantiated for FOL and HOL;
8465 * Pure: support multiple simultaneous goal statements, for example
8466 "have a: A and b: B" (same for 'theorem' etc.); being a pure
8467 meta-level mechanism, this acts as if several individual goals had
8468 been stated separately; in particular common proof methods need to be
8469 repeated in order to cover all claims; note that a single elimination
8470 step is *not* sufficient to establish the two conjunctions, so this
8473 assume "A & B" then have A and B .. (*".." fails*)
8475 better use "obtain" in situations as above; alternative refer to
8476 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
8478 * Pure: proper integration with ``locales''; unlike the original
8479 version by Florian Kammller, Isar locales package high-level proof
8480 contexts rather than raw logical ones (e.g. we admit to include
8481 attributes everywhere); operations on locales include merge and
8482 rename; support for implicit arguments (``structures''); simultaneous
8483 type-inference over imports and text; see also HOL/ex/Locales.thy for
8486 * Pure: the following commands have been ``localized'', supporting a
8487 target locale specification "(in name)": 'lemma', 'theorem',
8488 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
8489 stored both within the locale and at the theory level (exported and
8490 qualified by the locale name);
8492 * Pure: theory goals may now be specified in ``long'' form, with
8493 ad-hoc contexts consisting of arbitrary locale elements. for example
8494 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
8495 definitions may be given, too); the result is a meta-level rule with
8496 the context elements being discharged in the obvious way;
8498 * Pure: new proof command 'using' allows to augment currently used
8499 facts after a goal statement ('using' is syntactically analogous to
8500 'apply', but acts on the goal's facts only); this allows chained facts
8501 to be separated into parts given before and after a claim, as in
8502 ``from a and b have C using d and e <proof>'';
8504 * Pure: renamed "antecedent" case to "rule_context";
8506 * Pure: new 'judgment' command records explicit information about the
8507 object-logic embedding (used by several tools internally); no longer
8508 use hard-wired "Trueprop";
8510 * Pure: added 'corollary' command;
8512 * Pure: fixed 'token_translation' command;
8514 * Pure: removed obsolete 'exported' attribute;
8516 * Pure: dummy pattern "_" in is/let is now automatically lifted over
8517 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
8518 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
8520 * Pure: method 'atomize' presents local goal premises as object-level
8521 statements (atomic meta-level propositions); setup controlled via
8522 rewrite rules declarations of 'atomize' attribute; example
8523 application: 'induct' method with proper rule statements in improper
8526 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
8527 now consider the syntactic context of assumptions, giving a better
8528 chance to get type-inference of the arguments right (this is
8529 especially important for locales);
8531 * Pure: "sorry" no longer requires quick_and_dirty in interactive
8534 * Pure/obtain: the formal conclusion "thesis", being marked as
8535 ``internal'', may no longer be reference directly in the text;
8536 potential INCOMPATIBILITY, may need to use "?thesis" in rare
8539 * Pure: generic 'sym' attribute which declares a rule both as pure
8540 'elim?' and for the 'symmetric' operation;
8542 * Pure: marginal comments ``--'' may now occur just anywhere in the
8543 text; the fixed correlation with particular command syntax has been
8546 * Pure: new method 'rules' is particularly well-suited for proof
8547 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
8548 but often produces more compact proof terms with less detours;
8550 * Pure/Provers/classical: simplified integration with pure rule
8551 attributes and methods; the classical "intro?/elim?/dest?"
8552 declarations coincide with the pure ones; the "rule" method no longer
8553 includes classically swapped intros; "intro" and "elim" methods no
8554 longer pick rules from the context; also got rid of ML declarations
8555 AddXIs/AddXEs/AddXDs; all of this has some potential for
8558 * Provers/classical: attribute 'swapped' produces classical inversions
8559 of introduction rules;
8561 * Provers/simplifier: 'simplified' attribute may refer to explicit
8562 rules instead of full simplifier context; 'iff' attribute handles
8565 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
8567 * HOL: 'recdef' now fails on unfinished automated proofs, use
8568 "(permissive)" option to recover old behavior;
8570 * HOL: 'inductive' no longer features separate (collective) attributes
8571 for 'intros' (was found too confusing);
8573 * HOL: properly declared induction rules less_induct and
8579 * HOL: moved over to sane numeral syntax; the new policy is as
8582 - 0 and 1 are polymorphic constants, which are defined on any
8583 numeric type (nat, int, real etc.);
8585 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
8586 binary representation internally;
8588 - type nat has special constructor Suc, and generally prefers Suc 0
8589 over 1::nat and Suc (Suc 0) over 2::nat;
8591 This change may cause significant problems of INCOMPATIBILITY; here
8592 are some hints on converting existing sources:
8594 - due to the new "num" token, "-0" and "-1" etc. are now atomic
8595 entities, so expressions involving "-" (unary or binary minus) need
8596 to be spaced properly;
8598 - existing occurrences of "1" may need to be constraint "1::nat" or
8599 even replaced by Suc 0; similar for old "2";
8601 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
8603 - remove all special provisions on numerals in proofs;
8605 * HOL: simp rules nat_number expand numerals on nat to Suc/0
8606 representation (depends on bin_arith_simps in the default context);
8608 * HOL: symbolic syntax for x^2 (numeral 2);
8610 * HOL: the class of all HOL types is now called "type" rather than
8611 "term"; INCOMPATIBILITY, need to adapt references to this type class
8612 in axclass/classes, instance/arities, and (usually rare) occurrences
8613 in typings (of consts etc.); internally the class is called
8614 "HOL.type", ML programs should refer to HOLogic.typeS;
8616 * HOL/record package improvements:
8617 - new derived operations "fields" to build a partial record section,
8618 "extend" to promote a fixed record to a record scheme, and
8619 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
8620 declared as simp by default;
8621 - shared operations ("more", "fields", etc.) now need to be always
8622 qualified) --- potential INCOMPATIBILITY;
8623 - removed "make_scheme" operations (use "make" with "extend") --
8625 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
8626 - provides cases/induct rules for use with corresponding Isar
8627 methods (for concrete records, record schemes, concrete more
8628 parts, and schematic more parts -- in that order);
8629 - internal definitions directly based on a light-weight abstract
8630 theory of product types over typedef rather than datatype;
8632 * HOL: generic code generator for generating executable ML code from
8633 specifications; specific support for HOL constructs such as inductive
8634 datatypes and sets, as well as recursive functions; can be invoked
8635 via 'generate_code' theory section;
8637 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
8639 * HOL: consolidated and renamed several theories. In particular:
8640 Ord.thy has been absorbed into HOL.thy
8641 String.thy has been absorbed into List.thy
8643 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
8644 (beware of argument permutation!);
8646 * HOL: linorder_less_split superseded by linorder_cases;
8648 * HOL/List: "nodups" renamed to "distinct";
8650 * HOL: added "The" definite description operator; move Hilbert's "Eps"
8651 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
8652 - Ex_def has changed, now need to use some_eq_ex
8654 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
8655 in this (rare) case use:
8657 delSWrapper "split_all_tac"
8658 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
8660 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
8663 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
8664 Isabelle's type classes, ^ on functions and relations has too general
8665 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
8666 necessary to attach explicit type constraints;
8668 * HOL/Relation: the prefix name of the infix "O" has been changed from
8669 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
8670 renamed accordingly (eg "compI" -> "rel_compI").
8672 * HOL: syntax translations now work properly with numerals and records
8675 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
8676 of "lam" -- INCOMPATIBILITY;
8678 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
8679 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
8680 renamed "Product_Type.unit";
8682 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
8684 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
8685 the "cases" method);
8687 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
8690 * HOL/IMP: updated and converted to new-style theory format; several
8691 parts turned into readable document, with proper Isar proof texts and
8692 some explanations (by Gerwin Klein);
8694 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
8696 * HOL-Hyperreal is now a logic image;
8701 * Isar: consts/constdefs supports mixfix syntax for continuous
8704 * Isar: domain package adapted to new-style theory format, e.g. see
8707 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
8708 potential INCOMPATIBILITY; now use plain induct_tac instead of former
8709 lift.induct_tac, always use UU instead of Undef;
8711 * HOLCF/IMP: updated and converted to new-style theory;
8716 * Isar: proper integration of logic-specific tools and packages,
8717 including theory commands '(co)inductive', '(co)datatype',
8718 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
8719 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
8721 * theory Main no longer includes AC; for the Axiom of Choice, base
8722 your theory on Main_ZFC;
8724 * the integer library now covers quotients and remainders, with many
8725 laws relating division to addition, multiplication, etc.;
8727 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
8728 typeless version of the formalism;
8730 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
8733 * ZF/Induct: new directory for examples of inductive definitions,
8734 including theory Multiset for multiset orderings; converted to
8735 new-style theory format;
8737 * ZF: many new theorems about lists, ordinals, etc.;
8742 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
8743 variable proof controls level of detail: 0 = no proofs (only oracle
8744 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
8745 also ref manual for further ML interfaces;
8747 * Pure/axclass: removed obsolete ML interface
8748 goal_subclass/goal_arity;
8750 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
8751 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
8752 separate tokens, so expressions involving minus need to be spaced
8755 * Pure/syntax: support non-oriented infixes, using keyword "infix"
8756 rather than "infixl" or "infixr";
8758 * Pure/syntax: concrete syntax for dummy type variables admits genuine
8759 sort constraint specifications in type inference; e.g. "x::_::foo"
8760 ensures that the type of "x" is of sort "foo" (but not necessarily a
8763 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
8764 control output of nested => (types); the default behavior is
8767 * Pure/syntax: builtin parse translation for "_constify" turns valued
8768 tokens into AST constants;
8770 * Pure/syntax: prefer later declarations of translations and print
8771 translation functions; potential INCOMPATIBILITY: need to reverse
8772 multiple declarations for same syntax element constant;
8774 * Pure/show_hyps reset by default (in accordance to existing Isar
8777 * Provers/classical: renamed addaltern to addafter, addSaltern to
8780 * Provers/clasimp: ``iff'' declarations now handle conditional rules
8783 * system: tested support for MacOS X; should be able to get Isabelle +
8784 Proof General to work in a plain Terminal after installing Poly/ML
8785 (e.g. from the Isabelle distribution area) and GNU bash alone
8786 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
8787 support requires further installations, e.g. from
8788 http://fink.sourceforge.net/);
8790 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
8792 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
8793 of 40 MB), cf. ML_OPTIONS;
8795 * system: Proof General keywords specification is now part of the
8796 Isabelle distribution (see etc/isar-keywords.el);
8798 * system: support for persistent Proof General sessions (refrain from
8799 outdating all loaded theories on startup); user may create writable
8800 logic images like this: ``isabelle -q HOL Test'';
8802 * system: smart selection of Isabelle process versus Isabelle
8803 interface, accommodates case-insensitive file systems (e.g. HFS+); may
8804 run both "isabelle" and "Isabelle" even if file names are badly
8805 damaged (executable inspects the case of the first letter of its own
8806 name); added separate "isabelle-process" and "isabelle-interface";
8808 * system: refrain from any attempt at filtering input streams; no
8809 longer support ``8bit'' encoding of old isabelle font, instead proper
8810 iso-latin characters may now be used; the related isatools
8811 "symbolinput" and "nonascii" have disappeared as well;
8813 * system: removed old "xterm" interface (the print modes "xterm" and
8814 "xterm_color" are still available for direct use in a suitable
8819 New in Isabelle99-2 (February 2001)
8820 -----------------------------------
8822 *** Overview of INCOMPATIBILITIES ***
8824 * HOL: please note that theories in the Library and elsewhere often use the
8825 new-style (Isar) format; to refer to their theorems in an ML script you must
8826 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
8828 * HOL: inductive package no longer splits induction rule aggressively,
8829 but only as far as specified by the introductions given; the old
8830 format may be recovered via ML function complete_split_rule or attribute
8831 'split_rule (complete)';
8833 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
8834 gfp_Tarski to gfp_unfold;
8836 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
8838 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
8839 relation); infix "^^" has been renamed "``"; infix "``" has been
8840 renamed "`"; "univalent" has been renamed "single_valued";
8842 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
8845 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
8847 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
8849 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
8850 consequence, it is no longer monotonic wrt. the local goal context
8851 (which is now passed through the inductive cases);
8853 * Document preparation: renamed standard symbols \<ll> to \<lless> and
8854 \<gg> to \<ggreater>;
8857 *** Document preparation ***
8859 * \isabellestyle{NAME} selects version of Isabelle output (currently
8860 available: are "it" for near math-mode best-style output, "sl" for
8861 slanted text style, and "tt" for plain type-writer; if no
8862 \isabellestyle command is given, output is according to slanted
8865 * support sub/super scripts (for single symbols only), input syntax is
8866 like this: "A\<^sup>*" or "A\<^sup>\<star>";
8868 * some more standard symbols; see Appendix A of the system manual for
8869 the complete list of symbols defined in isabellesym.sty;
8871 * improved isabelle style files; more abstract symbol implementation
8872 (should now use \isamath{...} and \isatext{...} in custom symbol
8875 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
8876 state; Note that presentation of goal states does not conform to
8877 actual human-readable proof documents. Please do not include goal
8878 states into document output unless you really know what you are doing!
8880 * proper indentation of antiquoted output with proportional LaTeX
8883 * no_document ML operator temporarily disables LaTeX document
8886 * isatool unsymbolize tunes sources for plain ASCII communication;
8891 * Pure: Isar now suffers initial goal statements to contain unbound
8892 schematic variables (this does not conform to actual readable proof
8893 documents, due to unpredictable outcome and non-compositional proof
8894 checking); users who know what they are doing may use schematic goals
8895 for Prolog-style synthesis of proven results;
8897 * Pure: assumption method (an implicit finishing) now handles actual
8900 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
8901 initial goal, declare "that" only as Pure intro (only for single
8902 steps); the "that" rule assumption may now be involved in implicit
8903 finishing, thus ".." becomes a feasible for trivial obtains;
8905 * Pure: default proof step now includes 'intro_classes'; thus trivial
8906 instance proofs may be performed by "..";
8908 * Pure: ?thesis / ?this / "..." now work for pure meta-level
8911 * Pure: more robust selection of calculational rules;
8913 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
8914 rule (as well as the assumption rule);
8916 * Pure: 'thm_deps' command visualizes dependencies of theorems and
8917 lemmas, using the graph browser tool;
8919 * Pure: predict failure of "show" in interactive mode;
8921 * Pure: 'thms_containing' now takes actual terms as arguments;
8923 * HOL: improved method 'induct' --- now handles non-atomic goals
8924 (potential INCOMPATIBILITY); tuned error handling;
8926 * HOL: cases and induct rules now provide explicit hints about the
8927 number of facts to be consumed (0 for "type" and 1 for "set" rules);
8928 any remaining facts are inserted into the goal verbatim;
8930 * HOL: local contexts (aka cases) may now contain term bindings as
8931 well; the 'cases' and 'induct' methods new provide a ?case binding for
8932 the result to be shown in each case;
8934 * HOL: added 'recdef_tc' command;
8936 * isatool convert assists in eliminating legacy ML scripts;
8941 * HOL/Library: a collection of generic theories to be used together
8942 with main HOL; the theory loader path already includes this directory
8943 by default; the following existing theories have been moved here:
8944 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
8945 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
8947 * HOL/Unix: "Some aspects of Unix file-system security", a typical
8948 modelling and verification task performed in Isabelle/HOL +
8949 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
8951 * HOL/Algebra: special summation operator SUM no longer exists, it has
8952 been replaced by setsum; infix 'assoc' now has priority 50 (like
8953 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
8954 'domain', this makes the theory consistent with mathematical
8957 * HOL basics: added overloaded operations "inverse" and "divide"
8958 (infix "/"), syntax for generic "abs" operation, generic summation
8961 * HOL/typedef: simplified package, provide more useful rules (see also
8964 * HOL/datatype: induction rule for arbitrarily branching datatypes is
8965 now expressed as a proper nested rule (old-style tactic scripts may
8966 require atomize_strip_tac to cope with non-atomic premises);
8968 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
8969 to "split_conv" (old name still available for compatibility);
8971 * HOL: improved concrete syntax for strings (e.g. allows translation
8972 rules with string literals);
8974 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
8975 and Fleuriot's mechanization of analysis, including the transcendental
8976 functions for the reals;
8978 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
8983 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
8984 "lam" is displayed as TWO lambda-symbols
8986 * CTT: theory Main now available, containing everything (that is, Bool
8992 * Pure: the Simplifier has been implemented properly as a derived rule
8993 outside of the actual kernel (at last!); the overall performance
8994 penalty in practical applications is about 50%, while reliability of
8995 the Isabelle inference kernel has been greatly improved;
8997 * print modes "brackets" and "no_brackets" control output of nested =>
8998 (types) and ==> (props); the default behaviour is "brackets";
9000 * Provers: fast_tac (and friends) now handle actual object-logic rules
9001 as assumptions as well;
9003 * system: support Poly/ML 4.0;
9005 * system: isatool install handles KDE version 1 or 2;
9009 New in Isabelle99-1 (October 2000)
9010 ----------------------------------
9012 *** Overview of INCOMPATIBILITIES ***
9014 * HOL: simplification of natural numbers is much changed; to partly
9015 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
9016 issue the following ML commands:
9018 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
9019 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
9021 * HOL: simplification no longer dives into case-expressions; this is
9022 controlled by "t.weak_case_cong" for each datatype t;
9024 * HOL: nat_less_induct renamed to less_induct;
9026 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
9027 fixsome to patch .thy and .ML sources automatically;
9029 select_equality -> some_equality
9030 select_eq_Ex -> some_eq_ex
9031 selectI2EX -> someI2_ex
9034 select1_equality -> some1_equality
9035 Eps_sym_eq -> some_sym_eq_trivial
9036 Eps_eq -> some_eq_trivial
9038 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
9040 * HOL: removed obsolete theorem binding expand_if (refer to split_if
9043 * HOL: the recursion equations generated by 'recdef' are now called
9044 f.simps instead of f.rules;
9046 * HOL: qed_spec_mp now also handles bounded ALL as well;
9048 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
9049 sometimes be needed;
9051 * HOL: the constant for "f``x" is now "image" rather than "op ``";
9053 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
9055 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
9056 product is now "<*>" instead of "Times"; the lexicographic product is
9057 now "<*lex*>" instead of "**";
9059 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
9060 of main HOL, but was unused); better use HOL's datatype package;
9062 * HOL: removed "symbols" syntax for constant "override" of theory Map;
9063 the old syntax may be recovered as follows:
9066 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
9067 (infixl "\\<oplus>" 100)
9069 * HOL/Real: "rabs" replaced by overloaded "abs" function;
9071 * HOL/ML: even fewer consts are declared as global (see theories Ord,
9072 Lfp, Gfp, WF); this only affects ML packages that refer to const names
9075 * HOL and ZF: syntax for quotienting wrt an equivalence relation
9076 changed from A/r to A//r;
9078 * ZF: new treatment of arithmetic (nat & int) may break some old
9081 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
9082 rulify -> rule_format, elimify -> elim_format, ...);
9084 * Isar/Provers: intro/elim/dest attributes changed; renamed
9085 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
9086 should have to change intro!! to intro? only); replaced "delrule" by
9089 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
9091 * Provers: strengthened force_tac by using new first_best_tac;
9093 * LaTeX document preparation: several changes of isabelle.sty (see
9097 *** Document preparation ***
9099 * formal comments (text blocks etc.) in new-style theories may now
9100 contain antiquotations of thm/prop/term/typ/text to be presented
9101 according to latex print mode; concrete syntax is like this:
9102 @{term[show_types] "f(x) = a + x"};
9104 * isatool mkdir provides easy setup of Isabelle session directories,
9105 including proper document sources;
9107 * generated LaTeX sources are now deleted after successful run
9108 (isatool document -c); may retain a copy somewhere else via -D option
9111 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
9112 style files, achieving self-contained LaTeX sources and simplifying
9115 * old-style theories now produce (crude) LaTeX output as well;
9117 * browser info session directories are now self-contained (may be put
9118 on WWW server seperately); improved graphs of nested sessions; removed
9119 graph for 'all sessions';
9121 * several improvements in isabelle style files; \isabellestyle{it}
9122 produces fake math mode output; \isamarkupheader is now \section by
9123 default; see lib/texinputs/isabelle.sty etc.;
9128 * Isar/Pure: local results and corresponding term bindings are now
9129 subject to Hindley-Milner polymorphism (similar to ML); this
9130 accommodates incremental type-inference very nicely;
9132 * Isar/Pure: new derived language element 'obtain' supports
9133 generalized existence reasoning;
9135 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
9136 support accumulation of results, without applying any rules yet;
9137 useful to collect intermediate results without explicit name
9138 references, and for use with transitivity rules with more than 2
9141 * Isar/Pure: scalable support for case-analysis type proofs: new
9142 'case' language element refers to local contexts symbolically, as
9143 produced by certain proof methods; internally, case names are attached
9144 to theorems as "tags";
9146 * Isar/Pure: theory command 'hide' removes declarations from
9147 class/type/const name spaces;
9149 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
9150 indicate potential overloading;
9152 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
9154 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
9155 "{a,b,c}" instead of {a,b,c};
9157 * Isar/Pure now provides its own version of intro/elim/dest
9158 attributes; useful for building new logics, but beware of confusion
9159 with the version in Provers/classical;
9161 * Isar/Pure: the local context of (non-atomic) goals is provided via
9162 case name 'antecedent';
9164 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
9165 to the current context is now done automatically);
9167 * Isar/Pure: theory command 'method_setup' provides a simple interface
9168 for definining proof methods in ML;
9170 * Isar/Provers: intro/elim/dest attributes changed; renamed
9171 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
9172 most cases, one should have to change intro!! to intro? only);
9173 replaced "delrule" by "rule del";
9175 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
9176 'symmetric' attribute (the latter supercedes [RS sym]);
9178 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
9179 method modifier); 'simp' method: 'only:' modifier removes loopers as
9180 well (including splits);
9182 * Isar/Provers: Simplifier and Classical methods now support all kind
9183 of modifiers used in the past, including 'cong', 'iff', etc.
9185 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
9186 of Simplifier and Classical reasoner);
9188 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
9189 now support named cases; major packages (inductive, datatype, primrec,
9190 recdef) support case names and properly name parameters;
9192 * Isar/HOL: new transitivity rules for substitution in inequalities --
9193 monotonicity conditions are extracted to be proven at end of
9196 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
9199 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
9200 split_if split_if_asm; datatype package provides theorems foo.splits =
9201 foo.split foo.split_asm for each datatype;
9203 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
9204 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
9205 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
9206 use "(cases (simplified))" method in proper proof texts);
9208 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
9210 * Isar: names of theorems etc. may be natural numbers as well;
9212 * Isar: 'pr' command: optional arguments for goals_limit and
9213 ProofContext.prems_limit; no longer prints theory contexts, but only
9216 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
9217 additional print modes to be specified; e.g. "pr(latex)" will print
9218 proof state according to the Isabelle LaTeX style;
9220 * Isar: improved support for emulating tactic scripts, including proof
9221 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
9222 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
9223 (for HOL datatypes);
9225 * Isar: simplified (more robust) goal selection of proof methods: 1st
9226 goal, all goals, or explicit goal specifier (tactic emulation); thus
9227 'proof method scripts' have to be in depth-first order;
9229 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
9231 * Isar: removed 'help' command, which hasn't been too helpful anyway;
9232 should instead use individual commands for printing items
9233 (print_commands, print_methods etc.);
9235 * Isar: added 'nothing' --- the empty list of theorems;
9240 * HOL/MicroJava: formalization of a fragment of Java, together with a
9241 corresponding virtual machine and a specification of its bytecode
9242 verifier and a lightweight bytecode verifier, including proofs of
9243 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
9244 Cornelia Pusch (see also the homepage of project Bali at
9245 http://isabelle.in.tum.de/Bali/);
9247 * HOL/Algebra: new theory of rings and univariate polynomials, by
9250 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
9251 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
9254 * HOL/Lattice: fundamental concepts of lattice theory and order
9255 structures, including duals, properties of bounds versus algebraic
9256 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
9257 Theorem for complete lattices etc.; may also serve as a demonstration
9258 for abstract algebraic reasoning using axiomatic type classes, and
9259 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
9261 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
9264 * HOL/IMPP: extension of IMP with local variables and mutually
9265 recursive procedures, by David von Oheimb;
9267 * HOL/Lambda: converted into new-style theory and document;
9269 * HOL/ex/Multiquote: example of multiple nested quotations and
9270 anti-quotations -- basically a generalized version of de-Bruijn
9271 representation; very useful in avoiding lifting of operations;
9273 * HOL/record: added general record equality rule to simpset; fixed
9274 select-update simplification procedure to handle extended records as
9275 well; admit "r" as field name;
9277 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
9278 other numeric types and also as the identity of groups, rings, etc.;
9280 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
9281 Types nat and int belong to this axclass;
9283 * HOL: greatly improved simplification involving numerals of type nat, int, real:
9284 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
9285 i*j + k + j*#3*i simplifies to #4*(i*j) + k
9286 two terms #m*u and #n*u are replaced by #(m+n)*u
9287 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
9288 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
9289 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
9291 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
9292 powerful prover for predicate logic but knows nothing of clasets; see
9293 ex/mesontest.ML and ex/mesontest2.ML for example applications;
9295 * HOL: new version of "case_tac" subsumes both boolean case split and
9296 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
9297 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
9299 * HOL: simplification no longer dives into case-expressions: only the
9300 selector expression is simplified, but not the remaining arms; to
9301 enable full simplification of case-expressions for datatype t, you may
9302 remove t.weak_case_cong from the simpset, either globally (Delcongs
9303 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
9305 * HOL/recdef: the recursion equations generated by 'recdef' for
9306 function 'f' are now called f.simps instead of f.rules; if all
9307 termination conditions are proved automatically, these simplification
9308 rules are added to the simpset, as in primrec; rules may be named
9309 individually as well, resulting in a separate list of theorems for
9312 * HOL/While is a new theory that provides a while-combinator. It
9313 permits the definition of tail-recursive functions without the
9314 provision of a termination measure. The latter is necessary once the
9315 invariant proof rule for while is applied.
9317 * HOL: new (overloaded) notation for the set of elements below/above
9318 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
9320 * HOL: theorems impI, allI, ballI bound as "strip";
9322 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
9323 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
9324 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
9326 * HOL/Real: "rabs" replaced by overloaded "abs" function;
9328 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
9329 main HOL, but was unused);
9331 * HOL: fewer consts declared as global (e.g. have to refer to
9332 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
9334 * HOL: tuned AST representation of nested pairs, avoiding bogus output
9335 in case of overlap with user translations (e.g. judgements over
9336 tuples); (note that the underlying logical represenation is still
9342 * ZF: simplification automatically cancels common terms in arithmetic
9343 expressions over nat and int;
9345 * ZF: new treatment of nat to minimize type-checking: all operators
9346 coerce their operands to a natural number using the function natify,
9347 making the algebraic laws unconditional;
9349 * ZF: as above, for int: operators coerce their operands to an integer
9350 using the function intify;
9352 * ZF: the integer library now contains many of the usual laws for the
9353 orderings, including $<=, and monotonicity laws for $+ and $*;
9355 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
9358 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
9359 to the simplifier and classical reasoner simultaneously;
9364 * Provers: blast_tac now handles actual object-logic rules as
9365 assumptions; note that auto_tac uses blast_tac internally as well;
9367 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
9368 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
9370 * Provers: delrules now handles destruct rules as well (no longer need
9371 explicit make_elim);
9373 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
9374 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
9375 use instead the strong form,
9376 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
9377 in HOL, FOL and ZF the function cla_make_elim will create such rules
9378 from destruct-rules;
9380 * Provers: Simplifier.easy_setup provides a fast path to basic
9381 Simplifier setup for new object-logics;
9383 * Pure: AST translation rules no longer require constant head on LHS;
9385 * Pure: improved name spaces: ambiguous output is qualified; support
9386 for hiding of names;
9388 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
9389 XSYMBOL_HOME; no longer need to do manual configuration in most
9392 * system: compression of ML heaps images may now be controlled via -c
9393 option of isabelle and isatool usedir (currently only observed by
9396 * system: isatool installfonts may handle X-Symbol fonts as well (very
9397 useful for remote X11);
9399 * system: provide TAGS file for Isabelle sources;
9401 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
9404 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
9405 timing flag supersedes proof_timing and Toplevel.trace;
9407 * ML: new combinators |>> and |>>> for incremental transformations
9408 with secondary results (e.g. certain theory extensions):
9410 * ML: PureThy.add_defs gets additional argument to indicate potential
9411 overloading (usually false);
9413 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
9418 New in Isabelle99 (October 1999)
9419 --------------------------------
9421 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9423 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
9424 are no longer simplified. (This allows the simplifier to unfold recursive
9425 functional programs.) To restore the old behaviour, declare
9427 Delcongs [if_weak_cong];
9429 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
9432 * HOL: the predicate "inj" is now defined by translation to "inj_on";
9434 * HOL/datatype: mutual_induct_tac no longer exists --
9435 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
9437 * HOL/typedef: fixed type inference for representing set; type
9438 arguments now have to occur explicitly on the rhs as type constraints;
9440 * ZF: The con_defs part of an inductive definition may no longer refer
9441 to constants declared in the same theory;
9443 * HOL, ZF: the function mk_cases, generated by the inductive
9444 definition package, has lost an argument. To simplify its result, it
9445 uses the default simpset instead of a supplied list of theorems.
9447 * HOL/List: the constructors of type list are now Nil and Cons;
9449 * Simplifier: the type of the infix ML functions
9450 setSSolver addSSolver setSolver addSolver
9451 is now simpset * solver -> simpset where `solver' is a new abstract type
9452 for packaging solvers. A solver is created via
9453 mk_solver: string -> (thm list -> int -> tactic) -> solver
9454 where the string argument is only a comment.
9459 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
9460 decision procedure for linear arithmetic. Currently it is used for
9461 types `nat', `int', and `real' in HOL (see below); it can, should and
9462 will be instantiated for other types and logics as well.
9464 * The simplifier now accepts rewrite rules with flexible heads, eg
9465 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
9466 They are applied like any rule with a non-pattern lhs, i.e. by first-order
9472 * New Isabelle/Isar subsystem provides an alternative to traditional
9473 tactical theorem proving; together with the ProofGeneral/isar user
9474 interface it offers an interactive environment for developing human
9475 readable proof documents (Isar == Intelligible semi-automated
9476 reasoning); for further information see isatool doc isar-ref,
9477 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
9479 * improved and simplified presentation of theories: better HTML markup
9480 (including colors), graph views in several sizes; isatool usedir now
9481 provides a proper interface for user theories (via -P option); actual
9482 document preparation based on (PDF)LaTeX is available as well (for
9483 new-style theories only); see isatool doc system for more information;
9485 * native support for Proof General, both for classic Isabelle and
9488 * ML function thm_deps visualizes dependencies of theorems and lemmas,
9489 using the graph browser tool;
9491 * Isabelle manuals now also available as PDF;
9493 * theory loader rewritten from scratch (may not be fully
9494 bug-compatible); old loadpath variable has been replaced by show_path,
9495 add_path, del_path, reset_path functions; new operations such as
9496 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
9499 * improved isatool install: option -k creates KDE application icon,
9500 option -p DIR installs standalone binaries;
9502 * added ML_PLATFORM setting (useful for cross-platform installations);
9503 more robust handling of platform specific ML images for SML/NJ;
9505 * the settings environment is now statically scoped, i.e. it is never
9506 created again in sub-processes invoked from isabelle, isatool, or
9509 * path element specification '~~' refers to '$ISABELLE_HOME';
9511 * in locales, the "assumes" and "defines" parts may be omitted if
9514 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
9517 * new print_mode "HTML";
9519 * new flag show_tags controls display of tags of theorems (which are
9520 basically just comments that may be attached by some tools);
9522 * Isamode 2.6 requires patch to accomodate change of Isabelle font
9523 mode and goal output format:
9525 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
9527 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
9529 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
9530 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
9532 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
9534 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
9536 * function bind_thms stores lists of theorems (cf. bind_thm);
9538 * new shorthand tactics ftac, eatac, datac, fatac;
9540 * qed (and friends) now accept "" as result name; in that case the
9541 theorem is not stored, but proper checks and presentation of the
9544 * theorem database now also indexes constants "Trueprop", "all",
9545 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
9550 ** HOL arithmetic **
9552 * There are now decision procedures for linear arithmetic over nat and
9555 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
9556 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
9557 are treated as atomic; subformulae not involving type `nat' or `int'
9558 are ignored; quantified subformulae are ignored unless they are
9559 positive universal or negative existential. The tactic has to be
9560 invoked by hand and can be a little bit slow. In particular, the
9561 running time is exponential in the number of occurrences of `min' and
9562 `max', and `-' on `nat'.
9564 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
9565 (negated) (in)equalities among the premises and the conclusion into
9566 account (i.e. no compound formulae) and does not know about `min' and
9567 `max', and `-' on `nat'. It is fast and is used automatically by the
9570 NB: At the moment, these decision procedures do not cope with mixed
9571 nat/int formulae where the two parts interact, such as `m < n ==>
9574 * HOL/Numeral provides a generic theory of numerals (encoded
9575 efficiently as bit strings); setup for types nat/int/real is in place;
9576 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
9577 int, existing theories and proof scripts may require a few additional
9580 * integer division and remainder can now be performed on constant
9583 * many properties of integer multiplication, division and remainder
9586 * An interface to the Stanford Validity Checker (SVC) is available through the
9587 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
9588 are proved automatically. SVC must be installed separately, and its results
9589 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
9590 invocation of the underlying oracle). For SVC see
9591 http://verify.stanford.edu/SVC
9593 * IsaMakefile: the HOL-Real target now builds an actual image;
9598 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
9599 (in Isabelle/Isar) -- by Gertrud Bauer;
9601 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
9602 analysis for assembly languages with subtypes;
9604 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
9605 -- avoids syntactic ambiguities and treats state, transition, and
9606 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
9607 changed syntax and (many) tactics;
9609 * HOL/inductive: Now also handles more general introduction rules such
9610 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
9611 theorems are now maintained within the theory (maintained via the
9614 * HOL/datatype: Now also handles arbitrarily branching datatypes
9615 (using function types) such as
9617 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
9619 * HOL/record: record_simproc (part of the default simpset) takes care
9620 of selectors applied to updated records; record_split_tac is no longer
9621 part of the default claset; update_defs may now be removed from the
9622 simpset in many cases; COMPATIBILITY: old behavior achieved by
9624 claset_ref () := claset() addSWrapper record_split_wrapper;
9625 Delsimprocs [record_simproc]
9627 * HOL/typedef: fixed type inference for representing set; type
9628 arguments now have to occur explicitly on the rhs as type constraints;
9630 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
9631 names rather than an ML expression;
9633 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
9634 supplied later. Program schemes can be defined, such as
9635 "While B C s = (if B s then While B C (C s) else s)"
9636 where the well-founded relation can be chosen after B and C have been given.
9638 * HOL/List: the constructors of type list are now Nil and Cons;
9639 INCOMPATIBILITY: while [] and infix # syntax is still there, of
9640 course, ML tools referring to List.list.op # etc. have to be adapted;
9642 * HOL_quantifiers flag superseded by "HOL" print mode, which is
9643 disabled by default; run isabelle with option -m HOL to get back to
9644 the original Gordon/HOL-style output;
9646 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
9647 ALL x<=y. P, EX x<y. P, EX x<=y. P;
9649 * HOL basic syntax simplified (more orthogonal): all variants of
9650 All/Ex now support plain / symbolic / HOL notation; plain syntax for
9651 Eps operator is provided as well: "SOME x. P[x]";
9653 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
9655 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
9656 thus available for user theories;
9658 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
9659 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
9662 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
9663 several times and then mp;
9668 * the notation <<...>> is now available as a notation for sequences of
9671 * the simplifier is now installed
9673 * the axiom system has been generalized (thanks to Soren Heilmann)
9675 * the classical reasoner now has a default rule database
9680 * new primrec section allows primitive recursive functions to be given
9681 directly (as in HOL) over datatypes and the natural numbers;
9683 * new tactics induct_tac and exhaust_tac for induction (or case
9684 analysis) over datatypes and the natural numbers;
9686 * the datatype declaration of type T now defines the recursor T_rec;
9688 * simplification automatically does freeness reasoning for datatype
9691 * automatic type-inference, with AddTCs command to insert new
9692 type-checking rules;
9694 * datatype introduction rules are now added as Safe Introduction rules
9697 * the syntax "if P then x else y" is now available in addition to
9701 *** Internal programming interfaces ***
9703 * tuned simplifier trace output; new flag debug_simp;
9705 * structures Vartab / Termtab (instances of TableFun) offer efficient
9706 tables indexed by indexname_ord / term_ord (compatible with aconv);
9708 * AxClass.axclass_tac lost the theory argument;
9710 * tuned current_goals_markers semantics: begin / end goal avoids
9711 printing empty lines;
9713 * removed prs and prs_fn hook, which was broken because it did not
9714 include \n in its semantics, forcing writeln to add one
9715 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
9716 string -> unit if you really want to output text without newline;
9718 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
9719 plain output, interface builders may have to enable 'isabelle_font'
9720 mode to get Isabelle font glyphs as before;
9722 * refined token_translation interface; INCOMPATIBILITY: output length
9723 now of type real instead of int;
9725 * theory loader actions may be traced via new ThyInfo.add_hook
9726 interface (see src/Pure/Thy/thy_info.ML); example application: keep
9727 your own database of information attached to *whole* theories -- as
9728 opposed to intra-theory data slots offered via TheoryDataFun;
9730 * proper handling of dangling sort hypotheses (at last!);
9731 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
9732 extra sort hypotheses that can be witnessed from the type signature;
9733 the force_strip_shyps flag is gone, any remaining shyps are simply
9734 left in the theorem (with a warning issued by strip_shyps_warning);
9738 New in Isabelle98-1 (October 1998)
9739 ----------------------------------
9741 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9743 * several changes of automated proof tools;
9745 * HOL: major changes to the inductive and datatype packages, including
9746 some minor incompatibilities of theory syntax;
9748 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
9751 * HOL: removed duplicate thms in Arith:
9752 less_imp_add_less should be replaced by trans_less_add1
9753 le_imp_add_le should be replaced by trans_le_add1
9755 * HOL: unary minus is now overloaded (new type constraints may be
9758 * HOL and ZF: unary minus for integers is now #- instead of #~. In
9759 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
9760 now taken as an integer constant.
9762 * Pure: ML function 'theory_of' renamed to 'theory';
9768 1. Asm_full_simp_tac is now more aggressive.
9769 1. It will sometimes reorient premises if that increases their power to
9771 2. It does no longer proceed strictly from left to right but may also
9772 rotate premises to achieve further simplification.
9773 For compatibility reasons there is now Asm_lr_simp_tac which is like the
9774 old Asm_full_simp_tac in that it does not rotate premises.
9775 2. The simplifier now knows a little bit about nat-arithmetic.
9777 * Classical reasoner: wrapper mechanism for the classical reasoner now
9778 allows for selected deletion of wrappers, by introduction of names for
9779 wrapper functionals. This implies that addbefore, addSbefore,
9780 addaltern, and addSaltern now take a pair (name, tactic) as argument,
9781 and that adding two tactics with the same name overwrites the first
9782 one (emitting a warning).
9783 type wrapper = (int -> tactic) -> (int -> tactic)
9784 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
9785 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
9786 delWrapper, delSWrapper: claset * string -> claset
9787 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
9789 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
9790 semantics; addbefore now affects only the unsafe part of step_tac
9791 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
9792 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
9795 * Classical reasoner: setwrapper to setWrapper and compwrapper to
9796 compWrapper; added safe wrapper (and access functions for it);
9798 * HOL/split_all_tac is now much faster and fails if there is nothing
9799 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
9800 and the names of the automatically generated variables have changed.
9801 split_all_tac has moved within claset() from unsafe wrappers to safe
9802 wrappers, which means that !!-bound variables are split much more
9803 aggressively, and safe_tac and clarify_tac now split such variables.
9804 If this splitting is not appropriate, use delSWrapper "split_all_tac".
9805 Note: the same holds for record_split_tac, which does the job of
9806 split_all_tac for record fields.
9808 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
9809 permanently to the default simpset using Addsplits just like
9810 Addsimps. They can be removed via Delsplits just like
9811 Delsimps. Lower-case versions are also available.
9813 * HOL/Simplifier: The rule split_if is now part of the default
9814 simpset. This means that the simplifier will eliminate all occurrences
9815 of if-then-else in the conclusion of a goal. To prevent this, you can
9816 either remove split_if completely from the default simpset by
9817 `Delsplits [split_if]' or remove it in a specific call of the
9818 simplifier using `... delsplits [split_if]'. You can also add/delete
9819 other case splitting rules to/from the default simpset: every datatype
9820 generates suitable rules `split_t_case' and `split_t_case_asm' (where
9821 t is the name of the datatype).
9823 * Classical reasoner / Simplifier combination: new force_tac (and
9824 derivatives Force_tac, force) combines rewriting and classical
9825 reasoning (and whatever other tools) similarly to auto_tac, but is
9826 aimed to solve the given subgoal completely.
9831 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
9832 and `goalw': the theory is no longer needed as an explicit argument -
9833 the current theory context is used; assumptions are no longer returned
9834 at the ML-level unless one of them starts with ==> or !!; it is
9835 recommended to convert to these new commands using isatool fixgoal
9836 (backup your sources first!);
9838 * new top-level commands 'thm' and 'thms' for retrieving theorems from
9839 the current theory context, and 'theory' to lookup stored theories;
9841 * new theory section 'locale' for declaring constants, assumptions and
9842 definitions that have local scope;
9844 * new theory section 'nonterminals' for purely syntactic types;
9846 * new theory section 'setup' for generic ML setup functions
9847 (e.g. package initialization);
9849 * the distribution now includes Isabelle icons: see
9850 lib/logo/isabelle-{small,tiny}.xpm;
9852 * isatool install - install binaries with absolute references to
9855 * isatool logo -- create instances of the Isabelle logo (as EPS);
9857 * print mode 'emacs' reserved for Isamode;
9859 * support multiple print (ast) translations per constant name;
9861 * theorems involving oracles are now printed with a suffixed [!];
9866 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
9868 * HOL/inductive package reorganized and improved: now supports mutual
9874 oddI "n : EVEN ==> Suc n : ODD"
9875 evenI "n : ODD ==> Suc n : EVEN"
9877 new theorem list "elims" contains an elimination rule for each of the
9878 recursive sets; inductive definitions now handle disjunctive premises
9879 correctly (also ZF);
9881 INCOMPATIBILITIES: requires Inductive as an ancestor; component
9882 "mutual_induct" no longer exists - the induction rule is always
9883 contained in "induct";
9886 * HOL/datatype package re-implemented and greatly improved: now
9887 supports mutually recursive datatypes such as
9890 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
9891 | SUM ('a aexp) ('a aexp)
9892 | DIFF ('a aexp) ('a aexp)
9895 'a bexp = LESS ('a aexp) ('a aexp)
9896 | AND ('a bexp) ('a bexp)
9897 | OR ('a bexp) ('a bexp)
9899 as well as indirectly recursive datatypes such as
9902 ('a, 'b) term = Var 'a
9903 | App 'b ((('a, 'b) term) list)
9905 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
9906 induction on mutually / indirectly recursive datatypes.
9908 Primrec equations are now stored in theory and can be accessed via
9909 <function_name>.simps.
9913 - Theories using datatypes must now have theory Datatype as an
9915 - The specific <typename>.induct_tac no longer exists - use the
9916 generic induct_tac instead.
9917 - natE has been renamed to nat.exhaust - use exhaust_tac
9918 instead of res_inst_tac ... natE. Note that the variable
9919 names in nat.exhaust differ from the names in natE, this
9920 may cause some "fragile" proofs to fail.
9921 - The theorems split_<typename>_case and split_<typename>_case_asm
9922 have been renamed to <typename>.split and <typename>.split_asm.
9923 - Since default sorts of type variables are now handled correctly,
9924 some datatype definitions may have to be annotated with explicit
9926 - Primrec definitions no longer require function name and type
9927 of recursive argument.
9929 Consider using isatool fixdatatype to adapt your theories and proof
9930 scripts to the new package (backup your sources first!).
9933 * HOL/record package: considerably improved implementation; now
9934 includes concrete syntax for record types, terms, updates; theorems
9935 for surjective pairing and splitting !!-bound record variables; proof
9936 support is as follows:
9938 1) standard conversions (selectors or updates applied to record
9939 constructor terms) are part of the standard simpset;
9941 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
9942 made part of standard simpset and claset via addIffs;
9944 3) a tactic for record field splitting (record_split_tac) is part of
9945 the standard claset (addSWrapper);
9947 To get a better idea about these rules you may retrieve them via
9948 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
9949 the name of your record type.
9951 The split tactic 3) conceptually simplifies by the following rule:
9953 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
9955 Thus any record variable that is bound by meta-all will automatically
9956 blow up into some record constructor term, consequently the
9957 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
9958 solve record problems automatically.
9961 * reorganized the main HOL image: HOL/Integ and String loaded by
9962 default; theory Main includes everything;
9964 * automatic simplification of integer sums and comparisons, using cancellation;
9966 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
9968 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
9970 * many new identities for unions, intersections, set difference, etc.;
9972 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
9973 called split_if, split_split, split_sum_case and split_nat_case (to go
9974 with add/delsplits);
9976 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
9977 (?x::unit) = (); this is made part of the default simpset, which COULD
9978 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
9979 'Delsimprocs [unit_eq_proc];' as last resort); also note that
9980 unit_abs_eta_conv is added in order to counter the effect of
9981 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
9984 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
9987 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
9988 It and 'sym RS equals0D' are now in the default claset, giving automatic
9989 disjointness reasoning but breaking a few old proofs.
9991 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
9992 to 'converse' from 'inverse' (for compatibility with ZF and some
9995 * HOL/recdef can now declare non-recursive functions, with {} supplied as
9996 the well-founded relation;
9998 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
9999 Compl A. The "Compl" syntax remains available as input syntax for this
10002 * HOL/Update: new theory of function updates:
10003 f(a:=b) == %x. if x=a then b else f x
10004 may also be iterated as in f(a:=b,c:=d,...);
10006 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
10009 - new function list_update written xs[i:=v] that updates the i-th
10010 list position. May also be iterated as in xs[i:=a,j:=b,...].
10011 - new function `upt' written [i..j(] which generates the list
10012 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
10013 bound write [i..j], which is a shorthand for [i..j+1(].
10014 - new lexicographic orderings and corresponding wellfoundedness theorems.
10017 - removed 'pred' (predecessor) function;
10018 - generalized some theorems about n-1;
10019 - many new laws about "div" and "mod";
10020 - new laws about greatest common divisors (see theory ex/Primes);
10022 * HOL/Relation: renamed the relational operator r^-1 "converse"
10023 instead of "inverse";
10025 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
10026 of the multiset ordering;
10028 * directory HOL/Real: a construction of the reals using Dedekind cuts
10029 (not included by default);
10031 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
10033 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
10034 programs, i.e. different program variables may have different types.
10036 * calling (stac rew i) now fails if "rew" has no effect on the goal
10037 [previously, this check worked only if the rewrite rule was unconditional]
10038 Now rew can involve either definitions or equalities (either == or =).
10043 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
10044 only the theorems proved on ZF.ML;
10046 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
10047 It and 'sym RS equals0D' are now in the default claset, giving automatic
10048 disjointness reasoning but breaking a few old proofs.
10050 * ZF/Update: new theory of function updates
10051 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
10052 may also be iterated as in f(a:=b,c:=d,...);
10054 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
10056 * calling (stac rew i) now fails if "rew" has no effect on the goal
10057 [previously, this check worked only if the rewrite rule was unconditional]
10058 Now rew can involve either definitions or equalities (either == or =).
10060 * case_tac provided for compatibility with HOL
10061 (like the old excluded_middle_tac, but with subgoals swapped)
10064 *** Internal programming interfaces ***
10066 * Pure: several new basic modules made available for general use, see
10067 also src/Pure/README;
10069 * improved the theory data mechanism to support encapsulation (data
10070 kind name replaced by private Object.kind, acting as authorization
10071 key); new type-safe user interface via functor TheoryDataFun; generic
10072 print_data function becomes basically useless;
10074 * removed global_names compatibility flag -- all theory declarations
10075 are qualified by default;
10077 * module Pure/Syntax now offers quote / antiquote translation
10078 functions (useful for Hoare logic etc. with implicit dependencies);
10079 see HOL/ex/Antiquote for an example use;
10081 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
10084 * new tactical CHANGED_GOAL for checking that a tactic modifies a
10087 * Display.print_goals function moved to Locale.print_goals;
10089 * standard print function for goals supports current_goals_markers
10090 variable for marking begin of proof, end of proof, start of goal; the
10091 default is ("", "", ""); setting current_goals_markers := ("<proof>",
10092 "</proof>", "<goal>") causes SGML like tagged proof state printing,
10097 New in Isabelle98 (January 1998)
10098 --------------------------------
10100 *** Overview of INCOMPATIBILITIES (see below for more details) ***
10102 * changed lexical syntax of terms / types: dots made part of long
10103 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
10105 * simpset (and claset) reference variable replaced by functions
10106 simpset / simpset_ref;
10108 * no longer supports theory aliases (via merge) and non-trivial
10109 implicit merge of thms' signatures;
10111 * most internal names of constants changed due to qualified names;
10113 * changed Pure/Sequence interface (see Pure/seq.ML);
10116 *** General Changes ***
10118 * hierachically structured name spaces (for consts, types, axms, thms
10119 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
10120 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
10121 isatool fixdots ensures space after dots (e.g. "%x. x"); set
10122 long_names for fully qualified output names; NOTE: ML programs
10123 (special tactics, packages etc.) referring to internal names may have
10124 to be adapted to cope with fully qualified names; in case of severe
10125 backward campatibility problems try setting 'global_names' at compile
10126 time to have enrything declared within a flat name space; one may also
10127 fine tune name declarations in theories via the 'global' and 'local'
10130 * reimplemented the implicit simpset and claset using the new anytype
10131 data filed in signatures; references simpset:simpset ref etc. are
10132 replaced by functions simpset:unit->simpset and
10133 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
10134 to patch your ML files accordingly;
10136 * HTML output now includes theory graph data for display with Java
10137 applet or isatool browser; data generated automatically via isatool
10138 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
10140 * defs may now be conditional; improved rewrite_goals_tac to handle
10141 conditional equations;
10143 * defs now admits additional type arguments, using TYPE('a) syntax;
10145 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
10146 creates a new theory node; implicit merge of thms' signatures is
10147 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
10148 transfer:theory->thm->thm in (rare) cases;
10150 * improved handling of draft signatures / theories; draft thms (and
10151 ctyps, cterms) are automatically promoted to real ones;
10153 * slightly changed interfaces for oracles: admit many per theory, named
10154 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
10156 * print_goals: optional output of const types (set show_consts and
10159 * improved output of warnings (###) and errors (***);
10161 * subgoal_tac displays a warning if the new subgoal has type variables;
10163 * removed old README and Makefiles;
10165 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
10167 * removed obsolete init_pps and init_database;
10169 * deleted the obsolete tactical STATE, which was declared by
10170 fun STATE tacfun st = tacfun st st;
10172 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
10173 (which abbreviates $HOME);
10175 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
10176 use isatool fixseq to adapt your ML programs (this works for fully
10177 qualified references to the Sequence structure only!);
10179 * use_thy no longer requires writable current directory; it always
10180 reloads .ML *and* .thy file, if either one is out of date;
10183 *** Classical Reasoner ***
10185 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
10186 tactics that use classical reasoning to simplify a subgoal without
10187 splitting it into several subgoals;
10189 * Safe_tac: like safe_tac but uses the default claset;
10194 * added simplification meta rules:
10195 (asm_)(full_)simplify: simpset -> thm -> thm;
10197 * simplifier.ML no longer part of Pure -- has to be loaded by object
10200 * added prems argument to simplification procedures;
10202 * HOL, FOL, ZF: added infix function `addsplits':
10203 instead of `<simpset> setloop (split_tac <thms>)'
10204 you can simply write `<simpset> addsplits <thms>'
10209 * TYPE('a) syntax for type reflection terms;
10211 * no longer handles consts with name "" -- declare as 'syntax' instead;
10213 * pretty printer: changed order of mixfix annotation preference (again!);
10215 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
10220 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
10221 with `addloop' of the simplifier to faciliate case splitting in premises.
10223 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
10225 * HOL/Auth: new protocol proofs including some for the Internet
10228 * HOL/Map: new theory of `maps' a la VDM;
10230 * HOL/simplifier: simplification procedures nat_cancel_sums for
10231 cancelling out common nat summands from =, <, <= (in)equalities, or
10232 differences; simplification procedures nat_cancel_factor for
10233 cancelling common factor from =, <, <= (in)equalities over natural
10234 sums; nat_cancel contains both kinds of procedures, it is installed by
10235 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
10237 * HOL/simplifier: terms of the form
10238 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
10240 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
10241 and those of the form
10242 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
10244 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
10247 Each datatype `t' now comes with a theorem `split_t_case' of the form
10249 P(t_case f1 ... fn x) =
10250 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
10252 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
10255 and a theorem `split_t_case_asm' of the form
10257 P(t_case f1 ... fn x) =
10258 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
10260 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
10262 which can be added to a simpset via `addsplits'. The existing theorems
10263 expand_list_case and expand_option_case have been renamed to
10264 split_list_case and split_option_case.
10267 - `pred n' is automatically converted to `n-1'.
10268 Users are strongly encouraged not to use `pred' any longer,
10269 because it will disappear altogether at some point.
10270 - Users are strongly encouraged to write "0 < n" rather than
10271 "n ~= 0". Theorems and proof tools have been modified towards this
10275 the function "set_of_list" has been renamed "set" (and its theorems too);
10276 the function "nth" now takes its arguments in the reverse order and
10277 has acquired the infix notation "!" as in "xs!n".
10279 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
10281 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
10282 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
10284 * HOL/record: extensible records with schematic structural subtyping
10285 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
10286 still lacks various theorems and concrete record syntax;
10291 * removed "axioms" and "generated by" sections;
10293 * replaced "ops" section by extended "consts" section, which is capable of
10294 handling the continuous function space "->" directly;
10297 . proves theorems immediately and stores them in the theory,
10298 . creates hierachical name space,
10299 . now uses normal mixfix annotations (instead of cinfix...),
10300 . minor changes to some names and values (for consistency),
10301 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
10302 . separator between mutual domain defs: changed "," to "and",
10303 . improved handling of sort constraints; now they have to
10304 appear on the left-hand side of the equations only;
10306 * fixed LAM <x,y,zs>.b syntax;
10308 * added extended adm_tac to simplifier in HOLCF -- can now discharge
10309 adm (%x. P (t x)), where P is chainfinite and t continuous;
10314 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
10315 with `addloop' of the simplifier to faciliate case splitting in premises.
10317 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
10318 in HOL, they strip ALL and --> from proved theorems;
10322 New in Isabelle94-8 (May 1997)
10323 ------------------------------
10325 *** General Changes ***
10327 * new utilities to build / run / maintain Isabelle etc. (in parts
10328 still somewhat experimental); old Makefiles etc. still functional;
10330 * new 'Isabelle System Manual';
10332 * INSTALL text, together with ./configure and ./build scripts;
10334 * reimplemented type inference for greater efficiency, better error
10335 messages and clean internal interface;
10337 * prlim command for dealing with lots of subgoals (an easier way of
10338 setting goals_limit);
10343 * supports alternative (named) syntax tables (parser and pretty
10344 printer); internal interface is provided by add_modesyntax(_i);
10346 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
10347 be used in conjunction with the Isabelle symbol font; uses the
10348 "symbols" syntax table;
10350 * added token_translation interface (may translate name tokens in
10351 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
10352 the current print_mode); IMPORTANT: user print translation functions
10353 are responsible for marking newly introduced bounds
10354 (Syntax.mark_boundT);
10356 * token translations for modes "xterm" and "xterm_color" that display
10357 names in bold, underline etc. or colors (which requires a color
10360 * infixes may now be declared with names independent of their syntax;
10362 * added typed_print_translation (like print_translation, but may
10363 access type of constant);
10366 *** Classical Reasoner ***
10368 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
10369 some limitations. Blast_tac...
10370 + ignores addss, addbefore, addafter; this restriction is intrinsic
10371 + ignores elimination rules that don't have the correct format
10372 (the conclusion MUST be a formula variable)
10373 + ignores types, which can make HOL proofs fail
10374 + rules must not require higher-order unification, e.g. apply_type in ZF
10375 [message "Function Var's argument not a bound variable" relates to this]
10376 + its proof strategy is more general but can actually be slower
10378 * substitution with equality assumptions no longer permutes other
10381 * minor changes in semantics of addafter (now called addaltern); renamed
10382 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
10383 (and access functions for it);
10385 * improved combination of classical reasoner and simplifier:
10386 + functions for handling clasimpsets
10387 + improvement of addss: now the simplifier is called _after_ the
10389 + safe variant of addss called addSss: uses safe simplifications
10390 _during_ the safe steps. It is more complete as it allows multiple
10391 instantiations of unknowns (e.g. with slow_tac).
10395 * added interface for simplification procedures (functions that
10396 produce *proven* rewrite rules on the fly, depending on current
10399 * ordering on terms as parameter (used for ordered rewriting);
10401 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
10403 * the solver is now split into a safe and an unsafe part.
10404 This should be invisible for the normal user, except that the
10405 functions setsolver and addsolver have been renamed to setSolver and
10406 addSolver; added safe_asm_full_simp_tac;
10411 * a generic induction tactic `induct_tac' which works for all datatypes and
10412 also for type `nat';
10414 * a generic case distinction tactic `exhaust_tac' which works for all
10415 datatypes and also for type `nat';
10417 * each datatype comes with a function `size';
10419 * patterns in case expressions allow tuple patterns as arguments to
10420 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
10422 * primrec now also works with type nat;
10424 * recdef: a new declaration form, allows general recursive functions to be
10425 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
10427 * the constant for negation has been renamed from "not" to "Not" to
10428 harmonize with FOL, ZF, LK, etc.;
10430 * HOL/ex/LFilter theory of a corecursive "filter" functional for
10433 * HOL/Modelcheck demonstrates invocation of model checker oracle;
10435 * HOL/ex/Ring.thy declares cring_simp, which solves equational
10436 problems in commutative rings, using axiomatic type classes for + and *;
10438 * more examples in HOL/MiniML and HOL/Auth;
10440 * more default rewrite rules for quantifiers, union/intersection;
10442 * a new constant `arbitrary == @x.False';
10444 * HOLCF/IOA replaces old HOL/IOA;
10446 * HOLCF changes: derived all rules and arities
10447 + axiomatic type classes instead of classes
10448 + typedef instead of faking type definitions
10449 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
10450 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
10451 + eliminated the types void, one, tr
10452 + use unit lift and bool lift (with translations) instead of one and tr
10453 + eliminated blift from Lift3.thy (use Def instead of blift)
10454 all eliminated rules are derived as theorems --> no visible changes ;
10459 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
10460 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
10461 as ZF_cs addSIs [equalityI];
10465 New in Isabelle94-7 (November 96)
10466 ---------------------------------
10468 * allowing negative levels (as offsets) in prlev and choplev;
10470 * super-linear speedup for large simplifications;
10472 * FOL, ZF and HOL now use miniscoping: rewriting pushes
10473 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
10474 FAIL); can suppress it using the command Delsimps (ex_simps @
10475 all_simps); De Morgan laws are also now included, by default;
10477 * improved printing of ==> : ~:
10479 * new object-logic "Sequents" adds linear logic, while replacing LK
10480 and Modal (thanks to Sara Kalvala);
10482 * HOL/Auth: correctness proofs for authentication protocols;
10484 * HOL: new auto_tac combines rewriting and classical reasoning (many
10485 examples on HOL/Auth);
10487 * HOL: new command AddIffs for declaring theorems of the form P=Q to
10488 the rewriter and classical reasoner simultaneously;
10490 * function uresult no longer returns theorems in "standard" format;
10491 regain previous version by: val uresult = standard o uresult;
10495 New in Isabelle94-6
10496 -------------------
10498 * oracles -- these establish an interface between Isabelle and trusted
10499 external reasoners, which may deliver results as theorems;
10501 * proof objects (in particular record all uses of oracles);
10503 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
10505 * "constdefs" section in theory files;
10507 * "primrec" section (HOL) no longer requires names;
10509 * internal type "tactic" now simply "thm -> thm Sequence.seq";
10513 New in Isabelle94-5
10514 -------------------
10516 * reduced space requirements;
10518 * automatic HTML generation from theories;
10520 * theory files no longer require "..." (quotes) around most types;
10522 * new examples, including two proofs of the Church-Rosser theorem;
10524 * non-curried (1994) version of HOL is no longer distributed;
10528 New in Isabelle94-4
10529 -------------------
10531 * greatly reduced space requirements;
10533 * theory files (.thy) no longer require \...\ escapes at line breaks;
10535 * searchable theorem database (see the section "Retrieving theorems" on
10536 page 8 of the Reference Manual);
10538 * new examples, including Grabczewski's monumental case study of the
10541 * The previous version of HOL renamed to Old_HOL;
10543 * The new version of HOL (previously called CHOL) uses a curried syntax
10544 for functions. Application looks like f a b instead of f(a,b);
10546 * Mutually recursive inductive definitions finally work in HOL;
10548 * In ZF, pattern-matching on tuples is now available in all abstractions and
10549 translates to the operator "split";
10553 New in Isabelle94-3
10554 -------------------
10556 * new infix operator, addss, allowing the classical reasoner to
10557 perform simplification at each step of its search. Example:
10558 fast_tac (cs addss ss)
10560 * a new logic, CHOL, the same as HOL, but with a curried syntax
10561 for functions. Application looks like f a b instead of f(a,b). Also pairs
10562 look like (a,b) instead of <a,b>;
10564 * PLEASE NOTE: CHOL will eventually replace HOL!
10566 * In CHOL, pattern-matching on tuples is now available in all abstractions.
10567 It translates to the operator "split". A new theory of integers is available;
10569 * In ZF, integer numerals now denote two's-complement binary integers.
10570 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
10572 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
10573 of the Axiom of Choice;
10577 New in Isabelle94-2
10578 -------------------
10580 * Significantly faster resolution;
10582 * the different sections in a .thy file can now be mixed and repeated
10585 * Database of theorems for FOL, HOL and ZF. New
10586 commands including qed, qed_goal and bind_thm store theorems in the database.
10588 * Simple database queries: return a named theorem (get_thm) or all theorems of
10589 a given theory (thms_of), or find out what theory a theorem was proved in
10592 * Bugs fixed in the inductive definition and datatype packages;
10594 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
10595 and HOL_dup_cs obsolete;
10597 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
10600 * Simpler definition of function space in ZF;
10602 * new results about cardinal and ordinal arithmetic in ZF;
10604 * 'subtype' facility in HOL for introducing new types as subsets of existing
10607 :mode=isabelle-news:wrap=hard:maxLineLen=72: