1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in Isabelle2013-1 (November 2013)
5 -------------------------------------
9 * Discontinued obsolete 'uses' within theory header. Note that
10 commands like 'ML_file' work without separate declaration of file
11 dependencies. Minor INCOMPATIBILITY.
13 * Discontinued redundant 'use' command, which was superseded by
14 'ML_file' in Isabelle2013. Minor INCOMPATIBILITY.
16 * Simplified subscripts within identifiers, using plain \<^sub>
17 instead of the second copy \<^isub> and \<^isup>. Superscripts are
18 only for literal tokens within notation; explicit mixfix annotations
19 for consts or fixed variables may be used as fall-back for unusual
20 names. Obsolete \<twosuperior> has been expanded to \<^sup>2 in
21 Isabelle/HOL. INCOMPATIBILITY, use "isabelle update_sub_sup" to
22 standardize symbols as a starting point for further manual cleanup.
23 The ML reference variable "legacy_isub_isup" may be set as temporary
24 workaround, to make the prover accept a subset of the old identifier
27 * Document antiquotations: term style "isub" has been renamed to
28 "sub". Minor INCOMPATIBILITY.
30 * Uniform management of "quick_and_dirty" as system option (see also
31 "isabelle options"), configuration option within the context (see also
32 Config.get in Isabelle/ML), and attribute in Isabelle/Isar. Minor
33 INCOMPATIBILITY, need to use more official Isabelle means to access
34 quick_and_dirty, instead of historical poking into mutable reference.
36 * Renamed command 'print_configs' to 'print_options'. Minor
39 * Proper diagnostic command 'print_state'. Old 'pr' (with its
40 implicit change of some global references) is retained for now as
41 control command, e.g. for ProofGeneral 3.7.x.
43 * Discontinued 'print_drafts' command with its old-fashioned PS output
44 and Unix command-line print spooling. Minor INCOMPATIBILITY: use
45 'display_drafts' instead and print via the regular document viewer.
47 * Updated and extended "isar-ref" and "implementation" manual,
48 eliminated old "ref" manual.
51 *** Prover IDE -- Isabelle/Scala/jEdit ***
53 * New manual "jedit" for Isabelle/jEdit, see isabelle doc or
56 * Dockable window "Documentation" provides access to Isabelle
59 * Dockable window "Find" provides query operations for formal entities
60 (GUI front-end to 'find_theorems' command).
62 * Dockable window "Sledgehammer" manages asynchronous / parallel
63 sledgehammer runs over existing document sources, independently of
64 normal editing and checking process.
66 * Dockable window "Timing" provides an overview of relevant command
69 * Improved dockable window "Theories": Continuous checking of proof
70 document (visible and required parts) may be controlled explicitly,
71 using check box or shortcut "C+e ENTER". Individual theory nodes may
72 be marked explicitly as required and checked in full, using check box
73 or shortcut "C+e SPACE".
75 * Strictly monotonic document update, without premature cancellation of
76 running transactions that are still needed: avoid reset/restart of
77 such command executions while editing.
79 * Improved completion mechanism, which is now managed by the
80 Isabelle/jEdit plugin instead of SideKick. Refined table of Isabelle
81 symbol abbreviations (see $ISABELLE_HOME/etc/symbols).
83 * Support for asynchronous print functions, as overlay to existing
86 * Support for automatic tools in HOL, which try to prove or disprove
87 toplevel theorem statements.
89 * Action isabelle.reset-font-size resets main text area font size
90 according to Isabelle/Scala plugin option "jedit_font_reset_size"
91 (cf. keyboard shortcut C+0).
93 * File specifications in jEdit (e.g. file browser) may refer to
94 $ISABELLE_HOME on all platforms. Discontinued obsolete
95 $ISABELLE_HOME_WINDOWS variable.
97 * Improved support for Linux look-and-feel "GTK+", see also "Utilities
98 / Global Options / Appearance".
100 * Improved support of native Mac OS X functionality via "MacOSX"
101 plugin, which is now enabled by default.
106 * Commands 'interpretation' and 'sublocale' are now target-sensitive.
107 In particular, 'interpretation' allows for non-persistent
108 interpretation within "context ... begin ... end" blocks offering a
109 light-weight alternative to 'sublocale'. See "isar-ref" manual for
112 * Improved locales diagnostic command 'print_dependencies'.
114 * Discontinued obsolete 'axioms' command, which has been marked as
115 legacy since Isabelle2009-2. INCOMPATIBILITY, use 'axiomatization'
116 instead, while observing its uniform scope for polymorphism.
118 * Discontinued empty name bindings in 'axiomatization'.
121 * System option "proofs" has been discontinued. Instead the global
122 state of Proofterm.proofs is persistently compiled into logic images
123 as required, notably HOL-Proofs. Users no longer need to change
124 Proofterm.proofs dynamically. Minor INCOMPATIBILITY.
126 * Syntax translation functions (print_translation etc.) always depend
127 on Proof.context. Discontinued former "(advanced)" option -- this is
128 now the default. Minor INCOMPATIBILITY.
130 * Former global reference trace_unify_fail is now available as
131 configuration option "unify_trace_failure" (global context only).
133 * SELECT_GOAL now retains the syntactic context of the overall goal
134 state (schematic variables etc.). Potential INCOMPATIBILITY in rare
140 * Stronger precedence of syntax for big intersection and union on
141 sets, in accordance with corresponding lattice operations.
144 * Notation "{p:A. P}" now allows tuple patterns as well.
146 * Nested case expressions are now translated in a separate check phase
147 rather than during parsing. The data for case combinators is separated
148 from the datatype package. The declaration attribute
149 "case_translation" can be used to register new case combinators:
151 declare [[case_translation case_combinator constructor1 ... constructorN]]
154 - 'code_printing' unifies 'code_const' / 'code_type' / 'code_class' /
156 - 'code_identifier' declares name hints for arbitrary identifiers in
157 generated code, subsuming 'code_modulename'.
159 See the isar-ref manual for syntax diagrams, and the HOL theories for
162 * Attibute 'code': 'code' now declares concrete and abstract code
163 equations uniformly. Use explicit 'code equation' and 'code abstract'
164 to distinguish both when desired.
166 * Discontinued theories Code_Integer and Efficient_Nat by a more
167 fine-grain stack of theories Code_Target_Int, Code_Binary_Nat,
168 Code_Target_Nat and Code_Target_Numeral. See the tutorial on code
169 generation for details. INCOMPATIBILITY.
171 * Numeric types are mapped by default to target language numerals:
172 natural (replaces former code_numeral) and integer (replaces former
173 code_int). Conversions are available as integer_of_natural /
174 natural_of_integer / integer_of_nat / nat_of_integer (in HOL) and
175 Code_Numeral.integer_of_natural / Code_Numeral.natural_of_integer (in
176 ML). INCOMPATIBILITY.
178 * Function package: For mutually recursive functions f and g, separate
179 cases rules f.cases and g.cases are generated instead of unusable
180 f_g.cases which exposed internal sum types. Potential INCOMPATIBILITY,
181 in the case that the unusable rule was used nevertheless.
183 * Function package: For each function f, new rules f.elims are
184 generated, which eliminate equalities of the form "f x = t".
186 * New command 'fun_cases' derives ad-hoc elimination rules for
187 function equations as simplified instances of f.elims, analogous to
188 inductive_cases. See ~~/src/HOL/ex/Fundefs.thy for some examples.
191 - parametrized correspondence relations are now supported:
192 + parametricity theorems for the raw term can be specified in
193 the command lift_definition, which allow us to generate stronger
195 + setup_lifting generates stronger transfer rules if parametric
196 correspondence relation can be generated
197 + various new properties of the relator must be specified to support
199 + parametricity theorem for the Quotient relation can be specified
200 - setup_lifting generates domain rules for the Transfer package
201 - stronger reflexivity prover of respectfulness theorems for type
203 - ===> and --> are now local. The symbols can be introduced
204 by interpreting the locale lifting_syntax (typically in an
206 - Lifting/Transfer relevant parts of Library/Quotient_* are now in
207 Main. Potential INCOMPATIBILITY
208 - new commands for restoring and deleting Lifting/Transfer context:
209 lifting_forget, lifting_update
210 - the command print_quotmaps was renamed to print_quot_maps.
214 - better support for domains in Transfer: replace Domainp T
215 by the actual invariant in a transferred goal
216 - transfer rules can have as assumptions other transfer rules
217 - Experimental support for transferring from the raw level to the
218 abstract level: Transfer.transferred attribute
219 - Attribute version of the transfer method: untransferred attribute
221 * Reification and reflection:
222 - Reification is now directly available in HOL-Main in structure
224 - Reflection now handles multiple lists with variables also.
225 - The whole reflection stack has been decomposed into conversions.
228 * Revised devices for recursive definitions over finite sets:
229 - Only one fundamental fold combinator on finite set remains:
230 Finite_Set.fold :: ('a => 'b => 'b) => 'b => 'a set => 'b
231 This is now identity on infinite sets.
232 - Locales ("mini packages") for fundamental definitions with
233 Finite_Set.fold: folding, folding_idem.
234 - Locales comm_monoid_set, semilattice_order_set and
235 semilattice_neutr_order_set for big operators on sets.
236 See theory Big_Operators for canonical examples.
237 Note that foundational constants comm_monoid_set.F and
238 semilattice_set.F correspond to former combinators fold_image
239 and fold1 respectively. These are now gone. You may use
240 those foundational constants as substitutes, but it is
241 preferable to interpret the above locales accordingly.
242 - Dropped class ab_semigroup_idem_mult (special case of lattice,
243 no longer needed in connection with Finite_Set.fold etc.)
245 card.union_inter ~> card_Un_Int [symmetric]
246 card.union_disjoint ~> card_Un_disjoint
249 * Locale hierarchy for abstract orderings and (semi)lattices.
251 * Complete_Partial_Order.admissible is defined outside the type class
252 ccpo, but with mandatory prefix ccpo. Admissibility theorems lose the
253 class predicate assumption or sort constraint when possible.
256 * Introduce type class "conditionally_complete_lattice": Like a
257 complete lattice but does not assume the existence of the top and
258 bottom elements. Allows to generalize some lemmas about reals and
259 extended reals. Removed SupInf and replaced it by the instantiation
260 of conditionally_complete_lattice for real. Renamed lemmas about
261 conditionally-complete lattice from Sup_... to cSup_... and from
262 Inf_... to cInf_... to avoid hidding of similar complete lattice
265 * Introduce type class linear_continuum as combination of
266 conditionally-complete lattices and inner dense linorders which have
267 more than one element. INCOMPATIBILITY.
269 * Introduced type classes order_top and order_bot. The old classes top
270 and bot only contain the syntax without assumptions. INCOMPATIBILITY:
271 Rename bot -> order_bot, top -> order_top
273 * Introduce type classes "no_top" and "no_bot" for orderings without
274 top and bottom elements.
276 * Split dense_linorder into inner_dense_order and no_top, no_bot.
278 * Complex_Main: Unify and move various concepts from
279 HOL-Multivariate_Analysis to HOL-Complex_Main.
281 - Introduce type class (lin)order_topology and
282 linear_continuum_topology. Allows to generalize theorems about
283 limits and order. Instances are reals and extended reals.
285 - continuous and continuos_on from Multivariate_Analysis:
286 "continuous" is the continuity of a function at a filter. "isCont"
287 is now an abbrevitation: "isCont x f == continuous (at _) f".
289 Generalized continuity lemmas from isCont to continuous on an
292 - compact from Multivariate_Analysis. Use Bolzano's lemma to prove
293 compactness of closed intervals on reals. Continuous functions
294 attain infimum and supremum on compact sets. The inverse of a
295 continuous function is continuous, when the function is continuous
298 - connected from Multivariate_Analysis. Use it to prove the
299 intermediate value theorem. Show connectedness of intervals on
300 linear_continuum_topology).
302 - first_countable_topology from Multivariate_Analysis. Is used to
303 show equivalence of properties on the neighbourhood filter of x and
304 on all sequences converging to x.
306 - FDERIV: Definition of has_derivative moved to Deriv.thy. Moved
307 theorems from Library/FDERIV.thy to Deriv.thy and base the
308 definition of DERIV on FDERIV. Add variants of DERIV and FDERIV
309 which are restricted to sets, i.e. to represent derivatives from
312 - Removed the within-filter. It is replaced by the principal filter:
314 F within X = inf F (principal X)
316 - Introduce "at x within U" as a single constant, "at x" is now an
317 abbreviation for "at x within UNIV"
319 - Introduce named theorem collections tendsto_intros,
320 continuous_intros, continuous_on_intros and FDERIV_intros. Theorems
321 in tendsto_intros (or FDERIV_intros) are also available as
322 tendsto_eq_intros (or FDERIV_eq_intros) where the right-hand side
323 is replaced by a congruence rule. This allows to apply them as
324 intro rules and then proving equivalence by the simplifier.
326 - Restructured theories in HOL-Complex_Main:
328 + Moved RealDef and RComplete into Real
330 + Introduced Topological_Spaces and moved theorems about
331 topological spaces, filters, limits and continuity to it
333 + Renamed RealVector to Real_Vector_Spaces
335 + Split Lim, SEQ, Series into Topological_Spaces,
336 Real_Vector_Spaces, and Limits
338 + Moved Ln and Log to Transcendental
340 + Moved theorems about continuity from Deriv to Topological_Spaces
342 - Remove various auxiliary lemmas.
348 - Reduce incidence of "too high arity" errors
352 isar_shrink ~> isar_compress
354 - Added options "isar_try0", "spy"
355 - Better support for "isar_proofs"
356 - MaSh has been fined-tuned and now runs as a local server
358 * Improved support for ad hoc overloading of constants (see also
359 isar-ref manual and ~~/src/HOL/ex/Adhoc_Overloading_Examples.thy).
361 * Library/Polynomial.thy:
362 - Use lifting for primitive definitions.
363 - Explicit conversions from and to lists of coefficients, used for
365 - Replaced recursion operator poly_rec by fold_coeffs.
366 - Prefer pre-existing gcd operation for gcd.
368 poly_eq_iff ~> poly_eq_poly_eq_iff
370 expand_poly_eq ~> poly_eq_iff
373 * New Library/Simps_Case_Conv.thy: Provides commands simps_of_case and
374 case_of_simps to convert function definitions between a list of
375 equations with patterns on the lhs and a single equation with case
376 expressions on the rhs. See also Ex/Simps_Case_Conv_Examples.thy.
378 * New Library/FSet.thy: type of finite sets defined as a subtype of
379 sets defined by Lifting/Transfer.
381 * Discontinued theory src/HOL/Library/Eval_Witness. INCOMPATIBILITY.
383 * Consolidation of library theories on product orders:
385 Product_Lattice ~> Product_Order -- pointwise order on products
386 Product_ord ~> Product_Lexorder -- lexicographic order on products
390 * Imperative-HOL: The MREC combinator is considered legacy and no
391 longer included by default. INCOMPATIBILITY, use partial_function
392 instead, or import theory Legacy_Mrec as a fallback.
394 * HOL-Algebra: Discontinued theories ~~/src/HOL/Algebra/abstract and
395 ~~/src/HOL/Algebra/poly. Existing theories should be based on
396 ~~/src/HOL/Library/Polynomial instead. The latter provides
397 integration with HOL's type classes for rings. INCOMPATIBILITY.
400 - Various improvements to BNF-based (co)datatype package, including
401 new commands "primrec_new", "primcorec", and
402 "datatype_new_compat", as well as documentation. See
403 "datatypes.pdf" for details.
404 - New "coinduction" method to avoid some boilerplate (compared to
410 - Renamed many generated theorems, including
412 map_comp' ~> map_comp
422 * Spec_Check is a Quickcheck tool for Isabelle/ML. The ML function
423 "check_property" allows to check specifications of the form "ALL x y
424 z. prop x y z". See also ~~/src/Tools/Spec_Check/ with its
425 Examples.thy in particular.
427 * Improved printing of exception trace in Poly/ML 5.5.1, with regular
428 tracing output in the command transaction context instead of physical
429 stdout. See also Toplevel.debug, Toplevel.debugging and
430 ML_Compiler.exn_trace.
432 * ML type "theory" is now immutable, without any special treatment of
433 drafts or linear updates (which could lead to "stale theory" errors in
434 the past). Discontinued obsolete operations like Theory.copy,
435 Theory.checkpoint, and the auxiliary type theory_ref. Minor
438 * More uniform naming of goal functions for skipped proofs:
440 Skip_Proof.prove ~> Goal.prove_sorry
441 Skip_Proof.prove_global ~> Goal.prove_sorry_global
443 Minor INCOMPATIBILITY.
445 * Simplifier tactics and tools use proper Proof.context instead of
446 historic type simpset. Old-style declarations like addsimps,
447 addsimprocs etc. operate directly on Proof.context. Raw type simpset
448 retains its use as snapshot of the main Simplifier context, using
449 simpset_of and put_simpset on Proof.context. INCOMPATIBILITY -- port
450 old tools by making them depend on (ctxt : Proof.context) instead of
451 (ss : simpset), then turn (simpset_of ctxt) into ctxt.
453 * Modifiers for classical wrappers (e.g. addWrapper, delWrapper)
454 operate on Proof.context instead of claset, for uniformity with addIs,
455 addEs, addDs etc. Note that claset_of and put_claset allow to manage
456 clasets separately from the context.
458 * Discontinued obsolete ML antiquotations @{claset} and @{simpset}.
459 INCOMPATIBILITY, use @{context} instead.
461 * Antiquotation @{theory_context A} is similar to @{theory A}, but
462 presents the result as initial Proof.context.
467 * Discontinued obsolete isabelle usedir, mkdir, make -- superseded by
468 "isabelle build" in Isabelle2013. INCOMPATIBILITY.
470 * Discontinued obsolete isabelle-process options -f and -u (former
471 administrative aliases of option -e). Minor INCOMPATIBILITY.
473 * Discontinued obsolete isabelle print tool, and PRINT_COMMAND
476 * Discontinued ISABELLE_DOC_FORMAT settings variable and historic
477 document formats: dvi.gz, ps, ps.gz -- the default document format is
480 * Isabelle settings variable ISABELLE_BUILD_JAVA_OPTIONS allows to
481 specify global resources of the JVM process run by isabelle build.
483 * Toplevel executable $ISABELLE_HOME/bin/isabelle_scala_script allows
484 to run Isabelle/Scala source files as standalone programs.
486 * Improved "isabelle keywords" tool (for old-style ProofGeneral
487 keyword tables): use Isabelle/Scala operations, which inspect outer
488 syntax without requiring to build sessions first.
490 * Sessions may be organized via 'chapter' specifications in the ROOT
491 file, which determines a two-level hierarchy of browser info. The old
492 tree-like organization via implicit sub-session relation (with its
493 tendency towards erratic fluctuation of URLs) has been discontinued.
494 The default chapter is called "Unsorted". Potential INCOMPATIBILITY
495 for HTML presentation of theories.
499 New in Isabelle2013 (February 2013)
500 -----------------------------------
504 * Theorem status about oracles and unfinished/failed future proofs is
505 no longer printed by default, since it is incompatible with
506 incremental / parallel checking of the persistent document model. ML
507 function Thm.peek_status may be used to inspect a snapshot of the
508 ongoing evaluation process. Note that in batch mode --- notably
509 isabelle build --- the system ensures that future proofs of all
510 accessible theorems in the theory context are finished (as before).
512 * Configuration option show_markup controls direct inlining of markup
513 into the printed representation of formal entities --- notably type
514 and sort constraints. This enables Prover IDE users to retrieve that
515 information via tooltips in the output window, for example.
517 * Command 'ML_file' evaluates ML text from a file directly within the
518 theory, without any predeclaration via 'uses' in the theory header.
520 * Old command 'use' command and corresponding keyword 'uses' in the
521 theory header are legacy features and will be discontinued soon.
522 Tools that load their additional source files may imitate the
523 'ML_file' implementation, such that the system can take care of
524 dependencies properly.
526 * Discontinued obsolete method fastsimp / tactic fast_simp_tac, which
527 is called fastforce / fast_force_tac already since Isabelle2011-1.
529 * Updated and extended "isar-ref" and "implementation" manual, reduced
530 remaining material in old "ref" manual.
532 * Improved support for auxiliary contexts that indicate block structure
533 for specifications. Nesting of "context fixes ... context assumes ..."
534 and "class ... context ...".
536 * Attribute "consumes" allows a negative value as well, which is
537 interpreted relatively to the total number of premises of the rule in
538 the target context. This form of declaration is stable when exported
539 from a nested 'context' with additional assumptions. It is the
540 preferred form for definitional packages, notably cases/rules produced
541 in HOL/inductive and HOL/function.
543 * More informative error messages for Isar proof commands involving
544 lazy enumerations (method applications etc.).
546 * Refined 'help' command to retrieve outer syntax commands according
547 to name patterns (with clickable results).
550 *** Prover IDE -- Isabelle/Scala/jEdit ***
552 * Parallel terminal proofs ('by') are enabled by default, likewise
553 proofs that are built into packages like 'datatype', 'function'. This
554 allows to "run ahead" checking the theory specifications on the
555 surface, while the prover is still crunching on internal
556 justifications. Unfinished / cancelled proofs are restarted as
557 required to complete full proof checking eventually.
559 * Improved output panel with tooltips, hyperlinks etc. based on the
560 same Rich_Text_Area as regular Isabelle/jEdit buffers. Activation of
561 tooltips leads to some window that supports the same recursively,
562 which can lead to stacks of tooltips as the semantic document content
563 is explored. ESCAPE closes the whole stack, individual windows may be
564 closed separately, or detached to become independent jEdit dockables.
566 * Improved support for commands that produce graph output: the text
567 message contains a clickable area to open a new instance of the graph
570 * More robust incremental parsing of outer syntax (partial comments,
571 malformed symbols). Changing the balance of open/close quotes and
572 comment delimiters works more conveniently with unfinished situations
573 that frequently occur in user interaction.
575 * More efficient painting and improved reactivity when editing large
576 files. More scalable management of formal document content.
578 * Smarter handling of tracing messages: prover process pauses after
579 certain number of messages per command transaction, with some user
580 dialog to stop or continue. This avoids swamping the front-end with
581 potentially infinite message streams.
583 * More plugin options and preferences, based on Isabelle/Scala. The
584 jEdit plugin option panel provides access to some Isabelle/Scala
585 options, including tuning parameters for editor reactivity and color
588 * Dockable window "Symbols" provides some editing support for Isabelle
591 * Dockable window "Monitor" shows ML runtime statistics. Note that
592 continuous display of the chart slows down the system.
594 * Improved editing support for control styles: subscript, superscript,
595 bold, reset of style -- operating on single symbols or text
596 selections. Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT.
598 * Actions isabelle.increase-font-size and isabelle.decrease-font-size
599 adjust the main text area font size, and its derivatives for output,
600 tooltips etc. Cf. keyboard shortcuts C-PLUS and C-MINUS, which often
601 need to be adapted to local keyboard layouts.
603 * More reactive completion popup by default: use \t (TAB) instead of
604 \n (NEWLINE) to minimize intrusion into regular flow of editing. See
605 also "Plugin Options / SideKick / General / Code Completion Options".
607 * Implicit check and build dialog of the specified logic session
608 image. For example, HOL, HOLCF, HOL-Nominal can be produced on
609 demand, without bundling big platform-dependent heap images in the
610 Isabelle distribution.
612 * Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates
613 from Oracle provide better multi-platform experience. This version is
614 now bundled exclusively with Isabelle.
619 * Code generation for Haskell: restrict unqualified imports from
620 Haskell Prelude to a small set of fundamental operations.
622 * Command 'export_code': relative file names are interpreted
623 relatively to master directory of current theory rather than the
624 rather arbitrary current working directory. INCOMPATIBILITY.
626 * Discontinued obsolete attribute "COMP". Potential INCOMPATIBILITY,
627 use regular rule composition via "OF" / "THEN", or explicit proof
628 structure instead. Note that Isabelle/ML provides a variety of
629 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied
630 with some care where this is really required.
632 * Command 'typ' supports an additional variant with explicit sort
633 constraint, to infer and check the most general type conforming to a
634 given sort. Example (in HOL):
636 typ "_ * _ * bool * unit" :: finite
638 * Command 'locale_deps' visualizes all locales and their relations as
646 - Added MaSh relevance filter based on machine-learning; see the
647 Sledgehammer manual for details.
648 - Polished Isar proofs generated with "isar_proofs" option.
649 - Rationalized type encodings ("type_enc" option).
650 - Renamed "kill_provers" subcommand to "kill_all".
652 isar_proof ~> isar_proofs
653 isar_shrink_factor ~> isar_shrink
654 max_relevant ~> max_facts
655 relevance_thresholds ~> fact_thresholds
657 * Quickcheck: added an optimisation for equality premises. It is
658 switched on by default, and can be switched off by setting the
659 configuration quickcheck_optimise_equality to false.
661 * Quotient: only one quotient can be defined by quotient_type
665 - generation of an abstraction function equation in lift_definition
667 - renamed no_abs_code -> no_code (INCOMPATIBILITY.)
669 * Simproc "finite_Collect" rewrites set comprehensions into pointfree
672 * Preprocessing of the code generator rewrites set comprehensions into
673 pointfree expressions.
675 * The SMT solver Z3 has now by default a restricted set of directly
676 supported features. For the full set of features (div/mod, nonlinear
677 arithmetic, datatypes/records) with potential proof reconstruction
678 failures, enable the configuration option "z3_with_extensions". Minor
681 * Simplified 'typedef' specifications: historical options for implicit
682 set definition and alternative name have been discontinued. The
683 former behavior of "typedef (open) t = A" is now the default, but
684 written just "typedef t = A". INCOMPATIBILITY, need to adapt theories
687 * Removed constant "chars"; prefer "Enum.enum" on type "char"
688 directly. INCOMPATIBILITY.
690 * Moved operation product, sublists and n_lists from theory Enum to
691 List. INCOMPATIBILITY.
693 * Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY.
695 * Class "comm_monoid_diff" formalises properties of bounded
696 subtraction, with natural numbers and multisets as typical instances.
698 * Added combinator "Option.these" with type "'a option set => 'a set".
700 * Theory "Transitive_Closure": renamed lemmas
702 reflcl_tranclp -> reflclp_tranclp
703 rtranclp_reflcl -> rtranclp_reflclp
707 * Theory "Rings": renamed lemmas (in class semiring)
709 left_distrib ~> distrib_right
710 right_distrib ~> distrib_left
714 * Generalized the definition of limits:
716 - Introduced the predicate filterlim (LIM x F. f x :> G) which
717 expresses that when the input values x converge to F then the
718 output f x converges to G.
720 - Added filters for convergence to positive (at_top) and negative
723 - Moved infinity in the norm (at_infinity) from
724 Multivariate_Analysis to Complex_Main.
726 - Removed real_tendsto_inf, it is superseded by "LIM x F. f x :>
731 * Theory "Library/Option_ord" provides instantiation of option type to
732 lattice type classes.
734 * Theory "Library/Multiset": renamed
736 constant fold_mset ~> Multiset.fold
737 fact fold_mset_commute ~> fold_mset_comm
741 * Renamed theory Library/List_Prefix to Library/Sublist, with related
744 - Renamed constants (and related lemmas)
747 strict_prefix ~> prefix
749 - Replaced constant "postfix" by "suffixeq" with swapped argument
750 order (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped
751 old infix syntax "xs >>= ys"; use "suffixeq ys xs" instead.
752 Renamed lemmas accordingly.
754 - Added constant "list_hembeq" for homeomorphic embedding on
755 lists. Added abbreviation "sublisteq" for special case
756 "list_hembeq (op =)".
758 - Theory Library/Sublist no longer provides "order" and "bot" type
759 class instances for the prefix order (merely corresponding locale
760 interpretations). The type class instances are now in theory
761 Library/Prefix_Order.
763 - The sublist relation of theory Library/Sublist_Order is now based
764 on "Sublist.sublisteq". Renamed lemmas accordingly:
766 le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff
767 le_list_append_mono ~> Sublist.list_hembeq_append_mono
768 le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2
769 le_list_Cons_EX ~> Sublist.list_hembeq_ConsD
770 le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2'
771 le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq
772 le_list_drop_Cons ~> Sublist.sublisteq_Cons'
773 le_list_drop_many ~> Sublist.sublisteq_drop_many
774 le_list_filter_left ~> Sublist.sublisteq_filter_left
775 le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many
776 le_list_rev_take_iff ~> Sublist.sublisteq_append
777 le_list_same_length ~> Sublist.sublisteq_same_length
778 le_list_take_many_iff ~> Sublist.sublisteq_append'
779 less_eq_list.drop ~> less_eq_list_drop
780 less_eq_list.induct ~> less_eq_list_induct
781 not_le_list_length ~> Sublist.not_sublisteq_length
785 * New theory Library/Countable_Set.
787 * Theory Library/Debug and Library/Parallel provide debugging and
788 parallel execution for code generated towards Isabelle/ML.
790 * Theory Library/FuncSet: Extended support for Pi and extensional and
791 introduce the extensional dependent function space "PiE". Replaced
792 extensional_funcset by an abbreviation, and renamed lemmas from
793 extensional_funcset to PiE as follows:
795 extensional_empty ~> PiE_empty
796 extensional_funcset_empty_domain ~> PiE_empty_domain
797 extensional_funcset_empty_range ~> PiE_empty_range
798 extensional_funcset_arb ~> PiE_arb
799 extensional_funcset_mem ~> PiE_mem
800 extensional_funcset_extend_domainI ~> PiE_fun_upd
801 extensional_funcset_restrict_domain ~> fun_upd_in_PiE
802 extensional_funcset_extend_domain_eq ~> PiE_insert_eq
803 card_extensional_funcset ~> card_PiE
804 finite_extensional_funcset ~> finite_PiE
808 * Theory Library/FinFun: theory of almost everywhere constant
809 functions (supersedes the AFP entry "Code Generation for Functions as
812 * Theory Library/Phantom: generic phantom type to make a type
813 parameter appear in a constant's type. This alternative to adding
814 TYPE('a) as another parameter avoids unnecessary closures in generated
817 * Theory Library/RBT_Impl: efficient construction of red-black trees
818 from sorted associative lists. Merging two trees with rbt_union may
819 return a structurally different tree than before. Potential
822 * Theory Library/IArray: immutable arrays with code generation.
824 * Theory Library/Finite_Lattice: theory of finite lattices.
826 * HOL/Multivariate_Analysis: replaced
828 "basis :: 'a::euclidean_space => nat => real"
829 "\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space"
831 on euclidean spaces by using the inner product "_ \<bullet> _" with
832 vectors from the Basis set: "\<Chi>\<Chi> i. f i" is superseded by
833 "SUM i : Basis. f i * r i".
835 With this change the following constants are also changed or removed:
837 DIM('a) :: nat ~> card (Basis :: 'a set) (is an abbreviation)
838 a $$ i ~> inner a i (where i : Basis)
840 \<pi>, \<pi>' removed
842 Theorems about these constants where removed.
846 component_le_norm ~> Basis_le_norm
847 euclidean_eq ~> euclidean_eq_iff
848 differential_zero_maxmin_component ~> differential_zero_maxmin_cart
849 euclidean_simps ~> inner_simps
850 independent_basis ~> independent_Basis
851 span_basis ~> span_Basis
852 in_span_basis ~> in_span_Basis
853 norm_bound_component_le ~> norm_boound_Basis_le
854 norm_bound_component_lt ~> norm_boound_Basis_lt
855 component_le_infnorm ~> Basis_le_infnorm
861 - Added simproc "measurable" to automatically prove measurability.
863 - Added induction rules for sigma sets with disjoint union
864 (sigma_sets_induct_disjoint) and for Borel-measurable functions
865 (borel_measurable_induct).
867 - Added the Daniell-Kolmogorov theorem (the existence the limit of a
870 * HOL/Cardinals: Theories of ordinals and cardinals (supersedes the
871 AFP entry "Ordinals_and_Cardinals").
873 * HOL/BNF: New (co)datatype package based on bounded natural functors
874 with support for mixed, nested recursion and interesting non-free
877 * HOL/Finite_Set and Relation: added new set and relation operations
878 expressed by Finite_Set.fold.
880 * New theory HOL/Library/RBT_Set: implementation of sets by red-black
881 trees for the code generator.
883 * HOL/Library/RBT and HOL/Library/Mapping have been converted to
885 possible INCOMPATIBILITY.
887 * HOL/Set: renamed Set.project -> Set.filter
891 *** Document preparation ***
893 * Dropped legacy antiquotations "term_style" and "thm_style", since
894 styles may be given as arguments to "term" and "thm" already.
895 Discontinued legacy styles "prem1" .. "prem19".
897 * Default LaTeX rendering for \<euro> is now based on eurosym package,
898 instead of slightly exotic babel/greek.
900 * Document variant NAME may use different LaTeX entry point
901 document/root_NAME.tex if that file exists, instead of the common
904 * Simplified custom document/build script, instead of old-style
905 document/IsaMakefile. Minor INCOMPATIBILITY.
910 * The default limit for maximum number of worker threads is now 8,
911 instead of 4, in correspondence to capabilities of contemporary
912 hardware and Poly/ML runtime system.
914 * Type Seq.results and related operations support embedded error
915 messages within lazy enumerations, and thus allow to provide
916 informative errors in the absence of any usable results.
918 * Renamed Position.str_of to Position.here to emphasize that this is a
919 formal device to inline positions into message text, but not
920 necessarily printing visible text.
925 * Advanced support for Isabelle sessions and build management, see
926 "system" manual for the chapter of that name, especially the "isabelle
927 build" tool and its examples. The "isabelle mkroot" tool prepares
928 session root directories for use with "isabelle build", similar to
929 former "isabelle mkdir" for "isabelle usedir". Note that this affects
930 document preparation as well. INCOMPATIBILITY, isabelle usedir /
931 mkdir / make are rendered obsolete.
933 * Discontinued obsolete Isabelle/build script, it is superseded by the
934 regular isabelle build tool. For example:
936 isabelle build -s -b HOL
938 * Discontinued obsolete "isabelle makeall".
940 * Discontinued obsolete IsaMakefile and ROOT.ML files from the
941 Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that
942 provides some traditional targets that invoke "isabelle build". Note
943 that this is inefficient! Applications of Isabelle/HOL involving
944 "isabelle make" should be upgraded to use "isabelle build" directly.
946 * The "isabelle options" tool prints Isabelle system options, as
947 required for "isabelle build", for example.
949 * The "isabelle logo" tool produces EPS and PDF format simultaneously.
950 Minor INCOMPATIBILITY in command-line options.
952 * The "isabelle install" tool has now a simpler command-line. Minor
955 * The "isabelle components" tool helps to resolve add-on components
956 that are not bundled, or referenced from a bare-bones repository
959 * Settings variable ISABELLE_PLATFORM_FAMILY refers to the general
960 platform family: "linux", "macos", "windows".
962 * The ML system is configured as regular component, and no longer
963 picked up from some surrounding directory. Potential INCOMPATIBILITY
964 for home-made settings.
966 * Improved ML runtime statistics (heap, threads, future tasks etc.).
968 * Discontinued support for Poly/ML 5.2.1, which was the last version
969 without exception positions and advanced ML compiler/toplevel
972 * Discontinued special treatment of Proof General -- no longer guess
973 PROOFGENERAL_HOME based on accidental file-system layout. Minor
974 INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS
975 settings manually, or use a Proof General version that has been
976 bundled as Isabelle component.
980 New in Isabelle2012 (May 2012)
981 ------------------------------
985 * Prover IDE (PIDE) improvements:
987 - more robust Sledgehammer integration (as before the sledgehammer
988 command-line needs to be typed into the source buffer)
989 - markup for bound variables
990 - markup for types of term variables (displayed as tooltips)
991 - support for user-defined Isar commands within the running session
992 - improved support for Unicode outside original 16bit range
993 e.g. glyph for \<A> (thanks to jEdit 4.5.1)
995 * Forward declaration of outer syntax keywords within the theory
996 header -- minor INCOMPATIBILITY for user-defined commands. Allow new
997 commands to be used in the same theory where defined.
999 * Auxiliary contexts indicate block structure for specifications with
1000 additional parameters and assumptions. Such unnamed contexts may be
1001 nested within other targets, like 'theory', 'locale', 'class',
1002 'instantiation' etc. Results from the local context are generalized
1003 accordingly and applied to the enclosing target context. Example:
1007 assumes xy: "x = y" and yz: "y = z"
1010 lemma my_trans: "x = z" using xy yz by simp
1016 The most basic application is to factor-out context elements of
1017 several fixes/assumes/shows theorem statements, e.g. see
1018 ~~/src/HOL/Isar_Examples/Group_Context.thy
1020 Any other local theory specification element works within the "context
1021 ... begin ... end" block as well.
1023 * Bundled declarations associate attributed fact expressions with a
1024 given name in the context. These may be later included in other
1025 contexts. This allows to manage context extensions casually, without
1026 the logical dependencies of locales and locale interpretation. See
1027 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.
1029 * Commands 'lemmas' and 'theorems' allow local variables using 'for'
1030 declaration, and results are standardized before being stored. Thus
1031 old-style "standard" after instantiation or composition of facts
1032 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of
1033 indices of schematic variables.
1035 * Rule attributes in local theory declarations (e.g. locale or class)
1036 are now statically evaluated: the resulting theorem is stored instead
1037 of the original expression. INCOMPATIBILITY in rare situations, where
1038 the historic accident of dynamic re-evaluation in interpretations
1041 * New tutorial "Programming and Proving in Isabelle/HOL"
1042 ("prog-prove"). It completely supersedes "A Tutorial Introduction to
1043 Structured Isar Proofs" ("isar-overview"), which has been removed. It
1044 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order
1045 Logic" as the recommended beginners tutorial, but does not cover all
1046 of the material of that old tutorial.
1048 * Updated and extended reference manuals: "isar-ref",
1049 "implementation", "system"; reduced remaining material in old "ref"
1055 * Command 'definition' no longer exports the foundational "raw_def"
1056 into the user context. Minor INCOMPATIBILITY, may use the regular
1057 "def" result with attribute "abs_def" to imitate the old version.
1059 * Attribute "abs_def" turns an equation of the form "f x y == t" into
1060 "f == %x y. t", which ensures that "simp" or "unfold" steps always
1061 expand it. This also works for object-logic equality. (Formerly
1062 undocumented feature.)
1064 * Sort constraints are now propagated in simultaneous statements, just
1065 like type constraints. INCOMPATIBILITY in rare situations, where
1066 distinct sorts used to be assigned accidentally. For example:
1068 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"
1070 lemma "P (x::'a)" and "Q (y::'a::bar)"
1071 -- "now uniform 'a::bar instead of default sort for first occurrence (!)"
1073 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more
1074 tolerant against multiple unifiers, as long as the final result is
1075 unique. (As before, rules are composed in canonical right-to-left
1076 order to accommodate newly introduced premises.)
1078 * Renamed some inner syntax categories:
1084 Minor INCOMPATIBILITY. Note that in practice "num_const" or
1085 "num_position" etc. are mainly used instead (which also include
1086 position information via constraints).
1088 * Simplified configuration options for syntax ambiguity: see
1089 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
1090 manual. Minor INCOMPATIBILITY.
1092 * Discontinued configuration option "syntax_positions": atomic terms
1093 in parse trees are always annotated by position constraints.
1095 * Old code generator for SML and its commands 'code_module',
1096 'code_library', 'consts_code', 'types_code' have been discontinued.
1097 Use commands of the generic code generator instead. INCOMPATIBILITY.
1099 * Redundant attribute "code_inline" has been discontinued. Use
1100 "code_unfold" instead. INCOMPATIBILITY.
1102 * Dropped attribute "code_unfold_post" in favor of the its dual
1103 "code_abbrev", which yields a common pattern in definitions like
1105 definition [code_abbrev]: "f = t"
1109 * Obsolete 'types' command has been discontinued. Use 'type_synonym'
1110 instead. INCOMPATIBILITY.
1112 * Discontinued old "prems" fact, which used to refer to the accidental
1113 collection of foundational premises in the context (already marked as
1114 legacy since Isabelle2011).
1119 * Type 'a set is now a proper type constructor (just as before
1120 Isabelle2008). Definitions mem_def and Collect_def have disappeared.
1121 Non-trivial INCOMPATIBILITY. For developments keeping predicates and
1122 sets separate, it is often sufficient to rephrase some set S that has
1123 been accidentally used as predicates by "%x. x : S", and some
1124 predicate P that has been accidentally used as set by "{x. P x}".
1125 Corresponding proofs in a first step should be pruned from any
1126 tinkering with former theorems mem_def and Collect_def as far as
1129 For developments which deliberately mix predicates and sets, a
1130 planning step is necessary to determine what should become a predicate
1131 and what a set. It can be helpful to carry out that step in
1132 Isabelle2011-1 before jumping right into the current release.
1134 * Code generation by default implements sets as container type rather
1135 than predicates. INCOMPATIBILITY.
1137 * New type synonym 'a rel = ('a * 'a) set
1139 * The representation of numerals has changed. Datatype "num"
1140 represents strictly positive binary numerals, along with functions
1141 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent
1142 positive and negated numeric literals, respectively. See also
1143 definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some
1144 user theories may require adaptations as follows:
1146 - Theorems with number_ring or number_semiring constraints: These
1147 classes are gone; use comm_ring_1 or comm_semiring_1 instead.
1149 - Theories defining numeric types: Remove number, number_semiring,
1150 and number_ring instances. Defer all theorems about numerals until
1151 after classes one and semigroup_add have been instantiated.
1153 - Numeral-only simp rules: Replace each rule having a "number_of v"
1154 pattern with two copies, one for numeral and one for neg_numeral.
1156 - Theorems about subclasses of semiring_1 or ring_1: These classes
1157 automatically support numerals now, so more simp rules and
1158 simprocs may now apply within the proof.
1160 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:
1161 Redefine using other integer operations.
1163 * Transfer: New package intended to generalize the existing
1164 "descending" method and related theorem attributes from the Quotient
1165 package. (Not all functionality is implemented yet, but future
1166 development will focus on Transfer as an eventual replacement for the
1167 corresponding parts of the Quotient package.)
1169 - transfer_rule attribute: Maintains a collection of transfer rules,
1170 which relate constants at two different types. Transfer rules may
1171 relate different type instances of the same polymorphic constant,
1172 or they may relate an operation on a raw type to a corresponding
1173 operation on an abstract type (quotient or subtype). For example:
1175 ((A ===> B) ===> list_all2 A ===> list_all2 B) map map
1176 (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int
1178 - transfer method: Replaces a subgoal on abstract types with an
1179 equivalent subgoal on the corresponding raw types. Constants are
1180 replaced with corresponding ones according to the transfer rules.
1181 Goals are generalized over all free variables by default; this is
1182 necessary for variables whose types change, but can be overridden
1183 for specific variables with e.g. "transfer fixing: x y z". The
1184 variant transfer' method allows replacing a subgoal with one that
1185 is logically stronger (rather than equivalent).
1187 - relator_eq attribute: Collects identity laws for relators of
1188 various type constructors, e.g. "list_all2 (op =) = (op =)". The
1189 transfer method uses these lemmas to infer transfer rules for
1190 non-polymorphic constants on the fly.
1192 - transfer_prover method: Assists with proving a transfer rule for a
1193 new constant, provided the constant is defined in terms of other
1194 constants that already have transfer rules. It should be applied
1195 after unfolding the constant definitions.
1197 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer
1198 from type nat to type int.
1200 * Lifting: New package intended to generalize the quotient_definition
1201 facility of the Quotient package; designed to work with Transfer.
1203 - lift_definition command: Defines operations on an abstract type in
1204 terms of a corresponding operation on a representation
1205 type. Example syntax:
1207 lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"
1210 Users must discharge a respectfulness proof obligation when each
1211 constant is defined. (For a type copy, i.e. a typedef with UNIV,
1212 the proof is discharged automatically.) The obligation is
1213 presented in a user-friendly, readable form; a respectfulness
1214 theorem in the standard format and a transfer rule are generated
1217 - Integration with code_abstype: For typedefs (e.g. subtypes
1218 corresponding to a datatype invariant, such as dlist),
1219 lift_definition generates a code certificate theorem and sets up
1220 code generation for each constant.
1222 - setup_lifting command: Sets up the Lifting package to work with a
1223 user-defined type. The user must provide either a quotient theorem
1224 or a type_definition theorem. The package configures transfer
1225 rules for equality and quantifiers on the type, and sets up the
1226 lift_definition command to work with the type.
1228 - Usage examples: See Quotient_Examples/Lift_DList.thy,
1229 Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,
1230 Word/Word.thy and Library/Float.thy.
1234 - The 'quotient_type' command now supports a 'morphisms' option with
1235 rep and abs functions, similar to typedef.
1237 - 'quotient_type' sets up new types to work with the Lifting and
1238 Transfer packages, as with 'setup_lifting'.
1240 - The 'quotient_definition' command now requires the user to prove a
1241 respectfulness property at the point where the constant is
1242 defined, similar to lift_definition; INCOMPATIBILITY.
1244 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems
1245 accordingly, INCOMPATIBILITY.
1247 * New diagnostic command 'find_unused_assms' to find potentially
1248 superfluous assumptions in theorems using Quickcheck.
1252 - Quickcheck returns variable assignments as counterexamples, which
1253 allows to reveal the underspecification of functions under test.
1254 For example, refuting "hd xs = x", it presents the variable
1255 assignment xs = [] and x = a1 as a counterexample, assuming that
1256 any property is false whenever "hd []" occurs in it.
1258 These counterexample are marked as potentially spurious, as
1259 Quickcheck also returns "xs = []" as a counterexample to the
1260 obvious theorem "hd xs = hd xs".
1262 After finding a potentially spurious counterexample, Quickcheck
1263 continues searching for genuine ones.
1265 By default, Quickcheck shows potentially spurious and genuine
1266 counterexamples. The option "genuine_only" sets quickcheck to only
1267 show genuine counterexamples.
1269 - The command 'quickcheck_generator' creates random and exhaustive
1270 value generators for a given type and operations.
1272 It generates values by using the operations as if they were
1273 constructors of that type.
1275 - Support for multisets.
1277 - Added "use_subtype" options.
1279 - Added "quickcheck_locale" configuration to specify how to process
1280 conjectures in a locale context.
1282 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option
1283 and affecting 'rat' and 'real'.
1286 - Integrated more tightly with SPASS, as described in the ITP 2012
1287 paper "More SPASS with Isabelle".
1288 - Made it try "smt" as a fallback if "metis" fails or times out.
1289 - Added support for the following provers: Alt-Ergo (via Why3 and
1290 TFF1), iProver, iProver-Eq.
1291 - Sped up the minimizer.
1292 - Added "lam_trans", "uncurry_aliases", and "minimize" options.
1293 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
1294 - Renamed "sound" option to "strict".
1296 * Metis: Added possibility to specify lambda translations scheme as a
1297 parenthesized argument (e.g., "by (metis (lifting) ...)").
1299 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".
1301 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.
1303 * New "case_product" attribute to generate a case rule doing multiple
1304 case distinctions at the same time. E.g.
1306 list.exhaust [case_product nat.exhaust]
1308 produces a rule which can be used to perform case distinction on both
1311 * New "eventually_elim" method as a generalized variant of the
1312 eventually_elim* rules. Supports structured proofs.
1314 * Typedef with implicit set definition is considered legacy. Use
1315 "typedef (open)" form instead, which will eventually become the
1318 * Record: code generation can be switched off manually with
1320 declare [[record_coden = false]] -- "default true"
1322 * Datatype: type parameters allow explicit sort constraints.
1324 * Concrete syntax for case expressions includes constraints for source
1325 positions, and thus produces Prover IDE markup for its bindings.
1326 INCOMPATIBILITY for old-style syntax translations that augment the
1327 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
1330 * Clarified attribute "mono_set": pure declaration without modifying
1331 the result of the fact expression.
1333 * More default pred/set conversions on a couple of relation operations
1334 and predicates. Added powers of predicate relations. Consolidation
1335 of some relation theorems:
1337 converse_def ~> converse_unfold
1338 rel_comp_def ~> relcomp_unfold
1339 symp_def ~> (modified, use symp_def and sym_def instead)
1340 transp_def ~> transp_trans
1341 Domain_def ~> Domain_unfold
1342 Range_def ~> Domain_converse [symmetric]
1344 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.
1346 See theory "Relation" for examples for making use of pred/set
1347 conversions by means of attributes "to_set" and "to_pred".
1351 * Renamed facts about the power operation on relations, i.e., relpow
1352 to match the constant's name:
1354 rel_pow_1 ~> relpow_1
1355 rel_pow_0_I ~> relpow_0_I
1356 rel_pow_Suc_I ~> relpow_Suc_I
1357 rel_pow_Suc_I2 ~> relpow_Suc_I2
1358 rel_pow_0_E ~> relpow_0_E
1359 rel_pow_Suc_E ~> relpow_Suc_E
1360 rel_pow_E ~> relpow_E
1361 rel_pow_Suc_D2 ~> relpow_Suc_D2
1362 rel_pow_Suc_E2 ~> relpow_Suc_E2
1363 rel_pow_Suc_D2' ~> relpow_Suc_D2'
1364 rel_pow_E2 ~> relpow_E2
1365 rel_pow_add ~> relpow_add
1366 rel_pow_commute ~> relpow
1367 rel_pow_empty ~> relpow_empty:
1368 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
1369 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
1370 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
1371 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
1372 rel_pow_fun_conv ~> relpow_fun_conv
1373 rel_pow_finite_bounded1 ~> relpow_finite_bounded1
1374 rel_pow_finite_bounded ~> relpow_finite_bounded
1375 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
1376 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
1377 single_valued_rel_pow ~> single_valued_relpow
1381 * Theory Relation: Consolidated constant name for relation composition
1382 and corresponding theorem names:
1384 - Renamed constant rel_comp to relcomp.
1386 - Dropped abbreviation pred_comp. Use relcompp instead.
1390 rel_compI ~> relcompI
1391 rel_compEpair ~> relcompEpair
1392 rel_compE ~> relcompE
1393 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq
1394 rel_comp_empty1 ~> relcomp_empty1
1395 rel_comp_mono ~> relcomp_mono
1396 rel_comp_subset_Sigma ~> relcomp_subset_Sigma
1397 rel_comp_distrib ~> relcomp_distrib
1398 rel_comp_distrib2 ~> relcomp_distrib2
1399 rel_comp_UNION_distrib ~> relcomp_UNION_distrib
1400 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2
1401 single_valued_rel_comp ~> single_valued_relcomp
1402 rel_comp_def ~> relcomp_unfold
1403 converse_rel_comp ~> converse_relcomp
1404 pred_compI ~> relcomppI
1405 pred_compE ~> relcomppE
1406 pred_comp_bot1 ~> relcompp_bot1
1407 pred_comp_bot2 ~> relcompp_bot2
1408 transp_pred_comp_less_eq ~> transp_relcompp_less_eq
1409 pred_comp_mono ~> relcompp_mono
1410 pred_comp_distrib ~> relcompp_distrib
1411 pred_comp_distrib2 ~> relcompp_distrib2
1412 converse_pred_comp ~> converse_relcompp
1414 finite_rel_comp ~> finite_relcomp
1416 set_rel_comp ~> set_relcomp
1420 * Theory Divides: Discontinued redundant theorems about div and mod.
1421 INCOMPATIBILITY, use the corresponding generic theorems instead.
1423 DIVISION_BY_ZERO ~> div_by_0, mod_by_0
1424 zdiv_self ~> div_self
1425 zmod_self ~> mod_self
1428 zdiv_zmod_equality ~> div_mod_equality2
1429 zdiv_zmod_equality2 ~> div_mod_equality
1430 zmod_zdiv_trivial ~> mod_div_trivial
1431 zdiv_zminus_zminus ~> div_minus_minus
1432 zmod_zminus_zminus ~> mod_minus_minus
1433 zdiv_zminus2 ~> div_minus_right
1434 zmod_zminus2 ~> mod_minus_right
1435 zdiv_minus1_right ~> div_minus1_right
1436 zmod_minus1_right ~> mod_minus1_right
1437 zdvd_mult_div_cancel ~> dvd_mult_div_cancel
1438 zmod_zmult1_eq ~> mod_mult_right_eq
1439 zpower_zmod ~> power_mod
1440 zdvd_zmod ~> dvd_mod
1441 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd
1442 mod_mult_distrib ~> mult_mod_left
1443 mod_mult_distrib2 ~> mult_mod_right
1445 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use
1446 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.
1448 * Finite_Set.fold now qualified. INCOMPATIBILITY.
1450 * Consolidated theorem names concerning fold combinators:
1452 inf_INFI_fold_inf ~> inf_INF_fold_inf
1453 sup_SUPR_fold_sup ~> sup_SUP_fold_sup
1454 INFI_fold_inf ~> INF_fold_inf
1455 SUPR_fold_sup ~> SUP_fold_sup
1456 union_set ~> union_set_fold
1457 minus_set ~> minus_set_fold
1458 INFI_set_fold ~> INF_set_fold
1459 SUPR_set_fold ~> SUP_set_fold
1460 INF_code ~> INF_set_foldr
1461 SUP_code ~> SUP_set_foldr
1462 foldr.simps ~> foldr.simps (in point-free formulation)
1463 foldr_fold_rev ~> foldr_conv_fold
1464 foldl_fold ~> foldl_conv_fold
1465 foldr_foldr ~> foldr_conv_foldl
1466 foldl_foldr ~> foldl_conv_foldr
1467 fold_set_remdups ~> fold_set_fold_remdups
1468 fold_set ~> fold_set_fold
1469 fold1_set ~> fold1_set_fold
1473 * Dropped rarely useful theorems concerning fold combinators:
1474 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
1475 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
1476 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
1477 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
1478 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,
1479 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.
1480 INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0"
1481 and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be
1482 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by
1483 unfolding "foldr_conv_fold" and "foldl_conv_fold".
1485 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,
1486 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,
1487 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,
1488 INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding
1489 lemmas over fold rather than foldr, or make use of lemmas
1490 fold_conv_foldr and fold_rev.
1492 * Congruence rules Option.map_cong and Option.bind_cong for recursion
1493 through option types.
1495 * "Transitive_Closure.ntrancl": bounded transitive closure on
1498 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.
1500 * Theory Int: Discontinued many legacy theorems specific to type int.
1501 INCOMPATIBILITY, use the corresponding generic theorems instead.
1503 zminus_zminus ~> minus_minus
1504 zminus_0 ~> minus_zero
1505 zminus_zadd_distrib ~> minus_add_distrib
1506 zadd_commute ~> add_commute
1507 zadd_assoc ~> add_assoc
1508 zadd_left_commute ~> add_left_commute
1511 zadd_0 ~> add_0_left
1512 zadd_0_right ~> add_0_right
1513 zadd_zminus_inverse2 ~> left_minus
1514 zmult_zminus ~> mult_minus_left
1515 zmult_commute ~> mult_commute
1516 zmult_assoc ~> mult_assoc
1517 zadd_zmult_distrib ~> left_distrib
1518 zadd_zmult_distrib2 ~> right_distrib
1519 zdiff_zmult_distrib ~> left_diff_distrib
1520 zdiff_zmult_distrib2 ~> right_diff_distrib
1521 zmult_1 ~> mult_1_left
1522 zmult_1_right ~> mult_1_right
1523 zle_refl ~> order_refl
1524 zle_trans ~> order_trans
1525 zle_antisym ~> order_antisym
1526 zle_linear ~> linorder_linear
1527 zless_linear ~> linorder_less_linear
1528 zadd_left_mono ~> add_left_mono
1529 zadd_strict_right_mono ~> add_strict_right_mono
1530 zadd_zless_mono ~> add_less_le_mono
1531 int_0_less_1 ~> zero_less_one
1532 int_0_neq_1 ~> zero_neq_one
1534 zpower_zadd_distrib ~> power_add
1535 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
1536 zero_le_zpower_abs ~> zero_le_power_abs
1538 * Theory Deriv: Renamed
1540 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
1542 * Theory Library/Multiset: Improved code generation of multisets.
1544 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets
1545 are expressed via type classes again. The special syntax
1546 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant
1547 setsum_set, which is now subsumed by Big_Operators.setsum.
1550 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
1551 use theory HOL/Library/Nat_Bijection instead.
1553 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black
1554 trees is now inside a type class context. Names of affected
1555 operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for
1556 theories working directly with raw red-black trees, adapt the names as
1560 bulkload -> rbt_bulkload
1561 del_from_left -> rbt_del_from_left
1562 del_from_right -> rbt_del_from_right
1564 delete -> rbt_delete
1566 insert -> rbt_insert
1567 insertw -> rbt_insert_with
1568 insert_with_key -> rbt_insert_with_key
1569 map_entry -> rbt_map_entry
1570 lookup -> rbt_lookup
1571 sorted -> rbt_sorted
1572 tree_greater -> rbt_greater
1573 tree_less -> rbt_less
1574 tree_less_symbol -> rbt_less_symbol
1576 union_with -> rbt_union_with
1577 union_with_key -> rbt_union_with_key
1580 balance_left_sorted -> balance_left_rbt_sorted
1581 balance_left_tree_greater -> balance_left_rbt_greater
1582 balance_left_tree_less -> balance_left_rbt_less
1583 balance_right_sorted -> balance_right_rbt_sorted
1584 balance_right_tree_greater -> balance_right_rbt_greater
1585 balance_right_tree_less -> balance_right_rbt_less
1586 balance_sorted -> balance_rbt_sorted
1587 balance_tree_greater -> balance_rbt_greater
1588 balance_tree_less -> balance_rbt_less
1589 bulkload_is_rbt -> rbt_bulkload_is_rbt
1590 combine_sorted -> combine_rbt_sorted
1591 combine_tree_greater -> combine_rbt_greater
1592 combine_tree_less -> combine_rbt_less
1593 delete_in_tree -> rbt_delete_in_tree
1594 delete_is_rbt -> rbt_delete_is_rbt
1595 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater
1596 del_from_left_tree_less -> rbt_del_from_left_rbt_less
1597 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater
1598 del_from_right_tree_less -> rbt_del_from_right_rbt_less
1599 del_in_tree -> rbt_del_in_tree
1600 del_inv1_inv2 -> rbt_del_inv1_inv2
1601 del_sorted -> rbt_del_rbt_sorted
1602 del_tree_greater -> rbt_del_rbt_greater
1603 del_tree_less -> rbt_del_rbt_less
1604 dom_lookup_Branch -> dom_rbt_lookup_Branch
1605 entries_lookup -> entries_rbt_lookup
1606 finite_dom_lookup -> finite_dom_rbt_lookup
1607 insert_sorted -> rbt_insert_rbt_sorted
1608 insertw_is_rbt -> rbt_insertw_is_rbt
1609 insertwk_is_rbt -> rbt_insertwk_is_rbt
1610 insertwk_sorted -> rbt_insertwk_rbt_sorted
1611 insertw_sorted -> rbt_insertw_rbt_sorted
1612 ins_sorted -> ins_rbt_sorted
1613 ins_tree_greater -> ins_rbt_greater
1614 ins_tree_less -> ins_rbt_less
1615 is_rbt_sorted -> is_rbt_rbt_sorted
1616 lookup_balance -> rbt_lookup_balance
1617 lookup_bulkload -> rbt_lookup_rbt_bulkload
1618 lookup_delete -> rbt_lookup_rbt_delete
1619 lookup_Empty -> rbt_lookup_Empty
1620 lookup_from_in_tree -> rbt_lookup_from_in_tree
1621 lookup_in_tree -> rbt_lookup_in_tree
1622 lookup_ins -> rbt_lookup_ins
1623 lookup_insert -> rbt_lookup_rbt_insert
1624 lookup_insertw -> rbt_lookup_rbt_insertw
1625 lookup_insertwk -> rbt_lookup_rbt_insertwk
1626 lookup_keys -> rbt_lookup_keys
1627 lookup_map -> rbt_lookup_map
1628 lookup_map_entry -> rbt_lookup_rbt_map_entry
1629 lookup_tree_greater -> rbt_lookup_rbt_greater
1630 lookup_tree_less -> rbt_lookup_rbt_less
1631 lookup_union -> rbt_lookup_rbt_union
1632 map_entry_color_of -> rbt_map_entry_color_of
1633 map_entry_inv1 -> rbt_map_entry_inv1
1634 map_entry_inv2 -> rbt_map_entry_inv2
1635 map_entry_is_rbt -> rbt_map_entry_is_rbt
1636 map_entry_sorted -> rbt_map_entry_rbt_sorted
1637 map_entry_tree_greater -> rbt_map_entry_rbt_greater
1638 map_entry_tree_less -> rbt_map_entry_rbt_less
1639 map_tree_greater -> map_rbt_greater
1640 map_tree_less -> map_rbt_less
1641 map_sorted -> map_rbt_sorted
1642 paint_sorted -> paint_rbt_sorted
1643 paint_lookup -> paint_rbt_lookup
1644 paint_tree_greater -> paint_rbt_greater
1645 paint_tree_less -> paint_rbt_less
1646 sorted_entries -> rbt_sorted_entries
1647 tree_greater_eq_trans -> rbt_greater_eq_trans
1648 tree_greater_nit -> rbt_greater_nit
1649 tree_greater_prop -> rbt_greater_prop
1650 tree_greater_simps -> rbt_greater_simps
1651 tree_greater_trans -> rbt_greater_trans
1652 tree_less_eq_trans -> rbt_less_eq_trans
1653 tree_less_nit -> rbt_less_nit
1654 tree_less_prop -> rbt_less_prop
1655 tree_less_simps -> rbt_less_simps
1656 tree_less_trans -> rbt_less_trans
1657 tree_ord_props -> rbt_ord_props
1658 union_Branch -> rbt_union_Branch
1659 union_is_rbt -> rbt_union_is_rbt
1660 unionw_is_rbt -> rbt_unionw_is_rbt
1661 unionwk_is_rbt -> rbt_unionwk_is_rbt
1662 unionwk_sorted -> rbt_unionwk_rbt_sorted
1664 * Theory HOL/Library/Float: Floating point numbers are now defined as
1665 a subset of the real numbers. All operations are defined using the
1666 lifing-framework and proofs use the transfer method. INCOMPATIBILITY.
1673 round_down -> float_round_down
1674 round_up -> float_round_up
1678 ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod
1681 abs_float_def -> Float.compute_float_abs
1682 bitlen_ge0 -> bitlen_nonneg
1683 bitlen.simps -> Float.compute_bitlen
1684 float_components -> Float_mantissa_exponent
1685 float_divl.simps -> Float.compute_float_divl
1686 float_divr.simps -> Float.compute_float_divr
1687 float_eq_odd -> mult_powr_eq_mult_powr_iff
1688 float_power -> real_of_float_power
1689 lapprox_posrat_def -> Float.compute_lapprox_posrat
1690 lapprox_rat.simps -> Float.compute_lapprox_rat
1691 le_float_def' -> Float.compute_float_le
1692 le_float_def -> less_eq_float.rep_eq
1693 less_float_def' -> Float.compute_float_less
1694 less_float_def -> less_float.rep_eq
1695 normfloat_def -> Float.compute_normfloat
1696 normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0
1697 normfloat -> normfloat_def
1698 normfloat_unique -> use normfloat_def
1699 number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral
1700 one_float_def -> Float.compute_float_one
1701 plus_float_def -> Float.compute_float_plus
1702 rapprox_posrat_def -> Float.compute_rapprox_posrat
1703 rapprox_rat.simps -> Float.compute_rapprox_rat
1704 real_of_float_0 -> zero_float.rep_eq
1705 real_of_float_1 -> one_float.rep_eq
1706 real_of_float_abs -> abs_float.rep_eq
1707 real_of_float_add -> plus_float.rep_eq
1708 real_of_float_minus -> uminus_float.rep_eq
1709 real_of_float_mult -> times_float.rep_eq
1710 real_of_float_simp -> Float.rep_eq
1711 real_of_float_sub -> minus_float.rep_eq
1712 round_down.simps -> Float.compute_float_round_down
1713 round_up.simps -> Float.compute_float_round_up
1714 times_float_def -> Float.compute_float_times
1715 uminus_float_def -> Float.compute_float_uminus
1716 zero_float_def -> Float.compute_float_zero
1718 Lemmas not necessary anymore, use the transfer method:
1719 bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,
1720 float_divr, float_le_simp, float_less1_mantissa_bound,
1721 float_less_simp, float_less_zero, float_le_zero,
1722 float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,
1723 floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,
1724 lapprox_rat_bottom, normalized_float, rapprox_posrat,
1725 rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,
1726 real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,
1727 round_up, zero_le_float, zero_less_float
1729 * New theory HOL/Library/DAList provides an abstract type for
1730 association lists with distinct keys.
1732 * Session HOL/IMP: Added new theory of abstract interpretation of
1735 * Session HOL-Import: Re-implementation from scratch is faster,
1736 simpler, and more scalable. Requires a proof bundle, which is
1737 available as an external component. Discontinued old (and mostly
1738 dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY.
1740 * Session HOL-Word: Discontinued many redundant theorems specific to
1741 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
1744 word_sub_alt ~> word_sub_wi
1745 word_add_alt ~> word_add_def
1746 word_mult_alt ~> word_mult_def
1747 word_minus_alt ~> word_minus_def
1748 word_0_alt ~> word_0_wi
1749 word_1_alt ~> word_1_wi
1750 word_add_0 ~> add_0_left
1751 word_add_0_right ~> add_0_right
1752 word_mult_1 ~> mult_1_left
1753 word_mult_1_right ~> mult_1_right
1754 word_add_commute ~> add_commute
1755 word_add_assoc ~> add_assoc
1756 word_add_left_commute ~> add_left_commute
1757 word_mult_commute ~> mult_commute
1758 word_mult_assoc ~> mult_assoc
1759 word_mult_left_commute ~> mult_left_commute
1760 word_left_distrib ~> left_distrib
1761 word_right_distrib ~> right_distrib
1762 word_left_minus ~> left_minus
1763 word_diff_0_right ~> diff_0_right
1764 word_diff_self ~> diff_self
1765 word_sub_def ~> diff_minus
1766 word_diff_minus ~> diff_minus
1767 word_add_ac ~> add_ac
1768 word_mult_ac ~> mult_ac
1769 word_plus_ac0 ~> add_0_left add_0_right add_ac
1770 word_times_ac1 ~> mult_1_left mult_1_right mult_ac
1771 word_order_trans ~> order_trans
1772 word_order_refl ~> order_refl
1773 word_order_antisym ~> order_antisym
1774 word_order_linear ~> linorder_linear
1775 lenw1_zero_neq_one ~> zero_neq_one
1776 word_number_of_eq ~> number_of_eq
1777 word_of_int_add_hom ~> wi_hom_add
1778 word_of_int_sub_hom ~> wi_hom_sub
1779 word_of_int_mult_hom ~> wi_hom_mult
1780 word_of_int_minus_hom ~> wi_hom_neg
1781 word_of_int_succ_hom ~> wi_hom_succ
1782 word_of_int_pred_hom ~> wi_hom_pred
1783 word_of_int_0_hom ~> word_0_wi
1784 word_of_int_1_hom ~> word_1_wi
1786 * Session HOL-Word: New proof method "word_bitwise" for splitting
1787 machine word equalities and inequalities into logical circuits,
1788 defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction,
1789 multiplication, shifting by constants, bitwise operators and numeric
1790 constants. Requires fixed-length word types, not 'a word. Solves
1791 many standard word identities outright and converts more into first
1792 order problems amenable to blast or similar. See also examples in
1793 HOL/Word/Examples/WordExamples.thy.
1795 * Session HOL-Probability: Introduced the type "'a measure" to
1796 represent measures, this replaces the records 'a algebra and 'a
1797 measure_space. The locales based on subset_class now have two
1798 locale-parameters the space \<Omega> and the set of measurable sets M.
1799 The product of probability spaces uses now the same constant as the
1800 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)
1801 measure". Most constants are defined now outside of locales and gain
1802 an additional parameter, like null_sets, almost_eventually or \<mu>'.
1803 Measure space constructions for distributions and densities now got
1804 their own constants distr and density. Instead of using locales to
1805 describe measure spaces with a finite space, the measure count_space
1806 and point_measure is introduced. INCOMPATIBILITY.
1810 finite_measure.\<mu>' -> measure
1811 product_algebra_generator -> prod_algebra
1812 product_prob_space.emb -> prod_emb
1813 product_prob_space.infprod_algebra -> PiM
1816 completeable_measure_space
1817 finite_measure_space
1819 finite_product_finite_prob_space
1820 finite_product_sigma_algebra
1821 finite_sigma_algebra
1823 pair_finite_prob_space
1824 pair_finite_sigma_algebra
1827 product_sigma_algebra
1831 distribution -> use distr measure, or distributed predicate
1833 joint_distribution -> use distr measure, or distributed predicate
1834 pair_measure_generator
1835 product_prob_space.infprod_algebra -> use PiM
1838 Replacement theorems:
1839 finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite
1840 finite_measure.empty_measure -> measure_empty
1841 finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq
1842 finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq
1843 finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably
1844 finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure
1845 finite_measure.finite_measure -> finite_measure.emeasure_finite
1846 finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton
1847 finite_measure.positive_measure' -> measure_nonneg
1848 finite_measure.real_measure -> finite_measure.emeasure_real
1849 finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb
1850 finite_product_sigma_algebra.in_P -> sets_PiM_I_finite
1851 finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty
1852 information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed
1853 information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple
1854 information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple
1855 information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple
1856 information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple
1857 information_space.entropy_commute -> information_space.entropy_commute_simple
1858 information_space.entropy_eq -> information_space.entropy_simple_distributed
1859 information_space.entropy_generic_eq -> information_space.entropy_simple_distributed
1860 information_space.entropy_positive -> information_space.entropy_nonneg_simple
1861 information_space.entropy_uniform_max -> information_space.entropy_uniform
1862 information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq
1863 information_space.KL_eq_0 -> information_space.KL_same_eq_0
1864 information_space.KL_ge_0 -> information_space.KL_nonneg
1865 information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed
1866 information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple
1867 Int_stable_cuboids -> Int_stable_atLeastAtMost
1868 Int_stable_product_algebra_generator -> positive_integral
1869 measure_preserving -> equality "distr M N f = N" "f : measurable M N"
1870 measure_space.additive -> emeasure_additive
1871 measure_space.AE_iff_null_set -> AE_iff_null
1872 measure_space.almost_everywhere_def -> eventually_ae_filter
1873 measure_space.almost_everywhere_vimage -> AE_distrD
1874 measure_space.continuity_from_above -> INF_emeasure_decseq
1875 measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq
1876 measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq
1877 measure_space.continuity_from_below -> SUP_emeasure_incseq
1878 measure_space_density -> emeasure_density
1879 measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density
1880 measure_space.integrable_vimage -> integrable_distr
1881 measure_space.integral_translated_density -> integral_density
1882 measure_space.integral_vimage -> integral_distr
1883 measure_space.measure_additive -> plus_emeasure
1884 measure_space.measure_compl -> emeasure_compl
1885 measure_space.measure_countable_increasing -> emeasure_countable_increasing
1886 measure_space.measure_countably_subadditive -> emeasure_subadditive_countably
1887 measure_space.measure_decseq -> decseq_emeasure
1888 measure_space.measure_Diff -> emeasure_Diff
1889 measure_space.measure_Diff_null_set -> emeasure_Diff_null_set
1890 measure_space.measure_eq_0 -> emeasure_eq_0
1891 measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite
1892 measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton
1893 measure_space.measure_incseq -> incseq_emeasure
1894 measure_space.measure_insert -> emeasure_insert
1895 measure_space.measure_mono -> emeasure_mono
1896 measure_space.measure_not_negative -> emeasure_not_MInf
1897 measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq
1898 measure_space.measure_setsum -> setsum_emeasure
1899 measure_space.measure_setsum_split -> setsum_emeasure_cover
1900 measure_space.measure_space_vimage -> emeasure_distr
1901 measure_space.measure_subadditive_finite -> emeasure_subadditive_finite
1902 measure_space.measure_subadditive -> subadditive
1903 measure_space.measure_top -> emeasure_space
1904 measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0
1905 measure_space.measure_Un_null_set -> emeasure_Un_null_set
1906 measure_space.positive_integral_translated_density -> positive_integral_density
1907 measure_space.positive_integral_vimage -> positive_integral_distr
1908 measure_space.real_continuity_from_above -> Lim_measure_decseq
1909 measure_space.real_continuity_from_below -> Lim_measure_incseq
1910 measure_space.real_measure_countably_subadditive -> measure_subadditive_countably
1911 measure_space.real_measure_Diff -> measure_Diff
1912 measure_space.real_measure_finite_Union -> measure_finite_Union
1913 measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton
1914 measure_space.real_measure_subadditive -> measure_subadditive
1915 measure_space.real_measure_Union -> measure_Union
1916 measure_space.real_measure_UNION -> measure_UNION
1917 measure_space.simple_function_vimage -> simple_function_comp
1918 measure_space.simple_integral_vimage -> simple_integral_distr
1919 measure_space.simple_integral_vimage -> simple_integral_distr
1920 measure_unique_Int_stable -> measure_eqI_generator_eq
1921 measure_unique_Int_stable_vimage -> measure_eqI_generator_eq
1922 pair_sigma_algebra.measurable_cut_fst -> sets_Pair1
1923 pair_sigma_algebra.measurable_cut_snd -> sets_Pair2
1924 pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1
1925 pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2
1926 pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff
1927 pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap
1928 pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'
1929 pair_sigma_algebra.sets_swap -> sets_pair_swap
1930 pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1
1931 pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2
1932 pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap
1933 pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2
1934 pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt
1935 pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times
1936 prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM
1937 prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq
1938 prob_space.measure_space_1 -> prob_space.emeasure_space_1
1939 prob_space.prob_space_vimage -> prob_space_distr
1940 prob_space.random_variable_restrict -> measurable_restrict
1941 prob_space_unique_Int_stable -> measure_eqI_prob_space
1942 product_algebraE -> prod_algebraE_all
1943 product_algebra_generator_der -> prod_algebra_eq_finite
1944 product_algebra_generator_into_space -> prod_algebra_sets_into_space
1945 product_algebraI -> sets_PiM_I_finite
1946 product_measure_exists -> product_sigma_finite.sigma_finite
1947 product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator
1948 product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb
1949 product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty
1950 product_prob_space.measurable_component -> measurable_component_singleton
1951 product_prob_space.measurable_emb -> measurable_prod_emb
1952 product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single
1953 product_prob_space.measurable_singleton_infprod -> measurable_component_singleton
1954 product_prob_space.measure_emb -> emeasure_prod_emb
1955 product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict
1956 product_sigma_algebra.product_algebra_into_space -> space_closed
1957 product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge
1958 product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton
1959 product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge
1960 sequence_space.measure_infprod -> sequence_space.measure_PiM_countable
1961 sets_product_algebra -> sets_PiM
1962 sigma_algebra.measurable_sigma -> measurable_measure_of
1963 sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint
1964 sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr
1965 sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq
1966 space_product_algebra -> space_PiM
1968 * Session HOL-TPTP: support to parse and import TPTP problems (all
1969 languages) into Isabelle/HOL.
1974 * New "case_product" attribute (see HOL).
1979 * Greater support for structured proofs involving induction or case
1982 * Much greater use of mathematical symbols.
1984 * Removal of many ML theorem bindings. INCOMPATIBILITY.
1989 * Antiquotation @{keyword "name"} produces a parser for outer syntax
1990 from a minor keyword introduced via theory header declaration.
1992 * Antiquotation @{command_spec "name"} produces the
1993 Outer_Syntax.command_spec from a major keyword introduced via theory
1994 header declaration; it can be passed to Outer_Syntax.command etc.
1996 * Local_Theory.define no longer hard-wires default theorem name
1997 "foo_def", but retains the binding as given. If that is Binding.empty
1998 / Attrib.empty_binding, the result is not registered as user-level
1999 fact. The Local_Theory.define_internal variant allows to specify a
2000 non-empty name (used for the foundation in the background theory),
2001 while omitting the fact binding in the user-context. Potential
2002 INCOMPATIBILITY for derived definitional packages: need to specify
2003 naming policy for primitive definitions more explicitly.
2005 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
2006 conformance with similar operations in structure Term and Logic.
2008 * Antiquotation @{attributes [...]} embeds attribute source
2009 representation into the ML text, which is particularly useful with
2010 declarations like Local_Theory.note.
2012 * Structure Proof_Context follows standard naming scheme. Old
2013 ProofContext has been discontinued. INCOMPATIBILITY.
2015 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
2016 change of semantics: update is applied to auxiliary local theory
2019 * Modernized some old-style infix operations:
2021 addeqcongs ~> Simplifier.add_eqcong
2022 deleqcongs ~> Simplifier.del_eqcong
2023 addcongs ~> Simplifier.add_cong
2024 delcongs ~> Simplifier.del_cong
2025 setmksimps ~> Simplifier.set_mksimps
2026 setmkcong ~> Simplifier.set_mkcong
2027 setmksym ~> Simplifier.set_mksym
2028 setmkeqTrue ~> Simplifier.set_mkeqTrue
2029 settermless ~> Simplifier.set_termless
2030 setsubgoaler ~> Simplifier.set_subgoaler
2031 addsplits ~> Splitter.add_split
2032 delsplits ~> Splitter.del_split
2037 * USER_HOME settings variable points to cross-platform user home
2038 directory, which coincides with HOME on POSIX systems only. Likewise,
2039 the Isabelle path specification "~" now expands to $USER_HOME, instead
2040 of former $HOME. A different default for USER_HOME may be set
2041 explicitly in shell environment, before Isabelle settings are
2042 evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where
2043 the generic user home was intended.
2045 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
2046 notation, which is useful for the jEdit file browser, for example.
2048 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
2053 New in Isabelle2011-1 (October 2011)
2054 ------------------------------------
2058 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
2059 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
2061 - Management of multiple theory files directly from the editor
2062 buffer store -- bypassing the file-system (no requirement to save
2063 files for checking).
2065 - Markup of formal entities within the text buffer, with semantic
2066 highlighting, tooltips and hyperlinks to jump to defining source
2069 - Improved text rendering, with sub/superscripts in the source
2070 buffer (including support for copy/paste wrt. output panel, HTML
2071 theory output and other non-Isabelle text boxes).
2073 - Refined scheduling of proof checking and printing of results,
2074 based on interactive editor view. (Note: jEdit folding and
2075 narrowing allows to restrict buffer perspectives explicitly.)
2077 - Reduced CPU performance requirements, usable on machines with few
2080 - Reduced memory requirements due to pruning of unused document
2081 versions (garbage collection).
2083 See also ~~/src/Tools/jEdit/README.html for further information,
2084 including some remaining limitations.
2086 * Theory loader: source files are exclusively located via the master
2087 directory of each theory node (where the .thy file itself resides).
2088 The global load path (such as src/HOL/Library) has been discontinued.
2089 Note that the path element ~~ may be used to reference theories in the
2090 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
2093 * Theory loader: source files are identified by content via SHA1
2094 digests. Discontinued former path/modtime identification and optional
2095 ISABELLE_FILE_IDENT plugin scripts.
2097 * Parallelization of nested Isar proofs is subject to
2098 Goal.parallel_proofs_threshold (default 100). See also isabelle
2101 * Name space: former unsynchronized references are now proper
2102 configuration options, with more conventional names:
2104 long_names ~> names_long
2105 short_names ~> names_short
2106 unique_names ~> names_unique
2108 Minor INCOMPATIBILITY, need to declare options in context like this:
2110 declare [[names_unique = false]]
2112 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note
2113 that the result needs to be unique, which means fact specifications
2114 may have to be refined after enriching a proof context.
2116 * Attribute "case_names" has been refined: the assumptions in each case
2117 can be named now by following the case name with [name1 name2 ...].
2119 * Isabelle/Isar reference manual has been updated and extended:
2120 - "Synopsis" provides a catalog of main Isar language concepts.
2121 - Formal references in syntax diagrams, via @{rail} antiquotation.
2122 - Updated material from classic "ref" manual, notably about
2123 "Classical Reasoner".
2128 * Class bot and top require underlying partial order rather than
2129 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.
2131 * Class complete_lattice: generalized a couple of lemmas from sets;
2132 generalized theorems INF_cong and SUP_cong. New type classes for
2133 complete boolean algebras and complete linear orders. Lemmas
2134 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
2135 class complete_linorder.
2137 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
2138 Sup_fun_def, Inf_apply, Sup_apply.
2140 Removed redundant lemmas (the right hand side gives hints how to
2141 replace them for (metis ...), or (simp only: ...) proofs):
2143 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
2144 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
2145 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
2146 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
2147 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
2148 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
2149 Inter_def ~> INF_def, image_def
2150 Union_def ~> SUP_def, image_def
2151 INT_eq ~> INF_def, and image_def
2152 UN_eq ~> SUP_def, and image_def
2153 INF_subset ~> INF_superset_mono [OF _ order_refl]
2155 More consistent and comprehensive names:
2157 INTER_eq_Inter_image ~> INF_def
2158 UNION_eq_Union_image ~> SUP_def
2161 INF_leI ~> INF_lower
2162 INF_leI2 ~> INF_lower2
2163 le_INFI ~> INF_greatest
2164 le_SUPI ~> SUP_upper
2165 le_SUPI2 ~> SUP_upper2
2166 SUP_leI ~> SUP_least
2167 INFI_bool_eq ~> INF_bool_eq
2168 SUPR_bool_eq ~> SUP_bool_eq
2169 INFI_apply ~> INF_apply
2170 SUPR_apply ~> SUP_apply
2171 INTER_def ~> INTER_eq
2172 UNION_def ~> UNION_eq
2176 * Renamed theory Complete_Lattice to Complete_Lattices.
2179 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
2180 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
2181 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
2182 Sup_insert are now declared as [simp]. INCOMPATIBILITY.
2184 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
2185 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
2186 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor
2189 * Added syntactic classes "inf" and "sup" for the respective
2190 constants. INCOMPATIBILITY: Changes in the argument order of the
2191 (mostly internal) locale predicates for some derived classes.
2193 * Theorem collections ball_simps and bex_simps do not contain theorems
2194 referring to UNION any longer; these have been moved to collection
2195 UN_ball_bex_simps. INCOMPATIBILITY.
2197 * Theory Archimedean_Field: floor now is defined as parameter of a
2198 separate type class floor_ceiling.
2200 * Theory Finite_Set: more coherent development of fold_set locales:
2202 locale fun_left_comm ~> locale comp_fun_commute
2203 locale fun_left_comm_idem ~> locale comp_fun_idem
2205 Both use point-free characterization; interpretation proofs may need
2206 adjustment. INCOMPATIBILITY.
2208 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
2209 accordance with standard mathematical terminology. INCOMPATIBILITY.
2211 * Theory Complex_Main: The locale interpretations for the
2212 bounded_linear and bounded_bilinear locales have been removed, in
2213 order to reduce the number of duplicate lemmas. Users must use the
2214 original names for distributivity theorems, potential INCOMPATIBILITY.
2216 divide.add ~> add_divide_distrib
2217 divide.diff ~> diff_divide_distrib
2218 divide.setsum ~> setsum_divide_distrib
2219 mult.add_right ~> right_distrib
2220 mult.diff_right ~> right_diff_distrib
2221 mult_right.setsum ~> setsum_right_distrib
2222 mult_left.diff ~> left_diff_distrib
2224 * Theory Complex_Main: Several redundant theorems have been removed or
2225 replaced by more general versions. INCOMPATIBILITY.
2227 real_diff_def ~> minus_real_def
2228 real_divide_def ~> divide_real_def
2229 real_less_def ~> less_le
2230 real_abs_def ~> abs_real_def
2231 real_sgn_def ~> sgn_real_def
2232 real_mult_commute ~> mult_commute
2233 real_mult_assoc ~> mult_assoc
2234 real_mult_1 ~> mult_1_left
2235 real_add_mult_distrib ~> left_distrib
2236 real_zero_not_eq_one ~> zero_neq_one
2237 real_mult_inverse_left ~> left_inverse
2238 INVERSE_ZERO ~> inverse_zero
2239 real_le_refl ~> order_refl
2240 real_le_antisym ~> order_antisym
2241 real_le_trans ~> order_trans
2242 real_le_linear ~> linear
2243 real_le_eq_diff ~> le_iff_diff_le_0
2244 real_add_left_mono ~> add_left_mono
2245 real_mult_order ~> mult_pos_pos
2246 real_mult_less_mono2 ~> mult_strict_left_mono
2247 real_of_int_real_of_nat ~> real_of_int_of_nat_eq
2248 real_0_le_divide_iff ~> zero_le_divide_iff
2249 realpow_two_disj ~> power2_eq_iff
2250 real_squared_diff_one_factored ~> square_diff_one_factored
2251 realpow_two_diff ~> square_diff_square_factored
2252 reals_complete2 ~> complete_real
2253 real_sum_squared_expand ~> power2_sum
2254 exp_ln_eq ~> ln_unique
2256 expi_zero ~> exp_zero
2257 lemma_DERIV_subst ~> DERIV_cong
2258 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
2259 LIMSEQ_const ~> tendsto_const
2260 LIMSEQ_norm ~> tendsto_norm
2261 LIMSEQ_add ~> tendsto_add
2262 LIMSEQ_minus ~> tendsto_minus
2263 LIMSEQ_minus_cancel ~> tendsto_minus_cancel
2264 LIMSEQ_diff ~> tendsto_diff
2265 bounded_linear.LIMSEQ ~> bounded_linear.tendsto
2266 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
2267 LIMSEQ_mult ~> tendsto_mult
2268 LIMSEQ_inverse ~> tendsto_inverse
2269 LIMSEQ_divide ~> tendsto_divide
2270 LIMSEQ_pow ~> tendsto_power
2271 LIMSEQ_setsum ~> tendsto_setsum
2272 LIMSEQ_setprod ~> tendsto_setprod
2273 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
2274 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
2275 LIMSEQ_imp_rabs ~> tendsto_rabs
2276 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
2277 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
2278 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
2279 LIMSEQ_Complex ~> tendsto_Complex
2280 LIM_ident ~> tendsto_ident_at
2281 LIM_const ~> tendsto_const
2282 LIM_add ~> tendsto_add
2283 LIM_add_zero ~> tendsto_add_zero
2284 LIM_minus ~> tendsto_minus
2285 LIM_diff ~> tendsto_diff
2286 LIM_norm ~> tendsto_norm
2287 LIM_norm_zero ~> tendsto_norm_zero
2288 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
2289 LIM_norm_zero_iff ~> tendsto_norm_zero_iff
2290 LIM_rabs ~> tendsto_rabs
2291 LIM_rabs_zero ~> tendsto_rabs_zero
2292 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
2293 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
2294 LIM_compose ~> tendsto_compose
2295 LIM_mult ~> tendsto_mult
2296 LIM_scaleR ~> tendsto_scaleR
2297 LIM_of_real ~> tendsto_of_real
2298 LIM_power ~> tendsto_power
2299 LIM_inverse ~> tendsto_inverse
2300 LIM_sgn ~> tendsto_sgn
2301 isCont_LIM_compose ~> isCont_tendsto_compose
2302 bounded_linear.LIM ~> bounded_linear.tendsto
2303 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
2304 bounded_bilinear.LIM ~> bounded_bilinear.tendsto
2305 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
2306 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
2307 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
2308 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
2310 * Theory Complex_Main: The definition of infinite series was
2311 generalized. Now it is defined on the type class {topological_space,
2312 comm_monoid_add}. Hence it is useable also for extended real numbers.
2314 * Theory Complex_Main: The complex exponential function "expi" is now
2315 a type-constrained abbreviation for "exp :: complex => complex"; thus
2316 several polymorphic lemmas about "exp" are now applicable to "expi".
2320 - Theory Library/Code_Char_ord provides native ordering of
2321 characters in the target language.
2323 - Commands code_module and code_library are legacy, use export_code
2326 - Method "evaluation" is legacy, use method "eval" instead.
2328 - Legacy evaluator "SML" is deactivated by default. May be
2329 reactivated by the following theory command:
2331 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
2333 * Declare ext [intro] by default. Rare INCOMPATIBILITY.
2335 * New proof method "induction" that gives induction hypotheses the
2336 name "IH", thus distinguishing them from further hypotheses that come
2337 from rule induction. The latter are still called "hyps". Method
2338 "induction" is a thin wrapper around "induct" and follows the same
2341 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
2342 still available as a legacy feature for some time.
2345 - Added "need" and "total_consts" options.
2346 - Reintroduced "show_skolems" option by popular demand.
2347 - Renamed attribute: nitpick_def ~> nitpick_unfold.
2351 - Use quasi-sound (and efficient) translations by default.
2352 - Added support for the following provers: E-ToFoF, LEO-II,
2353 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
2354 - Automatically preplay and minimize proofs before showing them if
2355 this can be done within reasonable time.
2356 - sledgehammer available_provers ~> sledgehammer supported_provers.
2358 - Added "preplay_timeout", "slicing", "type_enc", "sound",
2359 "max_mono_iters", and "max_new_mono_instances" options.
2360 - Removed "explicit_apply" and "full_types" options as well as "Full
2361 Types" Proof General menu item. INCOMPATIBILITY.
2364 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
2365 - Obsoleted "metisFT" -- use "metis (full_types)" instead.
2369 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
2370 "elim:" options. INCOMPATIBILITY.
2371 - Introduced 'try' that not only runs 'try_methods' but also
2372 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
2375 - Added "eval" option to evaluate terms for the found counterexample
2376 (currently only supported by the default (exhaustive) tester).
2377 - Added post-processing of terms to obtain readable counterexamples
2378 (currently only supported by the default (exhaustive) tester).
2379 - New counterexample generator quickcheck[narrowing] enables
2380 narrowing-based testing. Requires the Glasgow Haskell compiler
2381 with its installation location defined in the Isabelle settings
2382 environment as ISABELLE_GHC.
2383 - Removed quickcheck tester "SML" based on the SML code generator
2384 (formly in HOL/Library).
2386 * Function package: discontinued option "tailrec". INCOMPATIBILITY,
2387 use 'partial_function' instead.
2389 * Theory Library/Extended_Reals replaces now the positive extended
2390 reals found in probability theory. This file is extended by
2391 Multivariate_Analysis/Extended_Real_Limits.
2393 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,
2394 from where it must be imported explicitly if it is really required.
2397 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
2398 been moved here. INCOMPATIBILITY.
2400 * Theory Library/Saturated provides type of numbers with saturated
2403 * Theory Library/Product_Lattice defines a pointwise ordering for the
2404 product type 'a * 'b, and provides instance proofs for various order
2405 and lattice type classes.
2407 * Theory Library/Countable now provides the "countable_datatype" proof
2408 method for proving "countable" class instances for datatypes.
2410 * Theory Library/Cset_Monad allows do notation for computable sets
2411 (cset) via the generic monad ad-hoc overloading facility.
2413 * Library: Theories of common data structures are split into theories
2414 for implementation, an invariant-ensuring type, and connection to an
2415 abstract type. INCOMPATIBILITY.
2417 - RBT is split into RBT and RBT_Mapping.
2418 - AssocList is split and renamed into AList and AList_Mapping.
2419 - DList is split into DList_Impl, DList, and DList_Cset.
2420 - Cset is split into Cset and List_Cset.
2422 * Theory Library/Nat_Infinity has been renamed to
2423 Library/Extended_Nat, with name changes of the following types and
2426 type inat ~> type enat
2428 Infty ~> infinity (overloaded)
2432 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
2433 been renamed accordingly. INCOMPATIBILITY.
2435 * Session Multivariate_Analysis: The euclidean_space type class now
2436 fixes a constant "Basis :: 'a set" consisting of the standard
2437 orthonormal basis for the type. Users now have the option of
2438 quantifying over this set instead of using the "basis" function, e.g.
2439 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
2441 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
2442 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
2443 "Cart_nth" and "Cart_lambda" have been respectively renamed to
2444 "vec_nth" and "vec_lambda"; theorems mentioning those names have
2445 changed to match. Definition theorems for overloaded constants now use
2446 the standard "foo_vec_def" naming scheme. A few other theorems have
2447 been renamed as follows (INCOMPATIBILITY):
2449 Cart_eq ~> vec_eq_iff
2450 dist_nth_le_cart ~> dist_vec_nth_le
2451 tendsto_vector ~> vec_tendstoI
2452 Cauchy_vector ~> vec_CauchyI
2454 * Session Multivariate_Analysis: Several duplicate theorems have been
2455 removed, and other theorems have been renamed or replaced with more
2456 general versions. INCOMPATIBILITY.
2458 finite_choice ~> finite_set_choice
2459 eventually_conjI ~> eventually_conj
2460 eventually_and ~> eventually_conj_iff
2461 eventually_false ~> eventually_False
2462 setsum_norm ~> norm_setsum
2463 Lim_sequentially ~> LIMSEQ_def
2464 Lim_ident_at ~> LIM_ident
2465 Lim_const ~> tendsto_const
2466 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
2467 Lim_neg ~> tendsto_minus
2468 Lim_add ~> tendsto_add
2469 Lim_sub ~> tendsto_diff
2470 Lim_mul ~> tendsto_scaleR
2471 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
2472 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
2473 Lim_linear ~> bounded_linear.tendsto
2474 Lim_component ~> tendsto_euclidean_component
2475 Lim_component_cart ~> tendsto_vec_nth
2476 Lim_inner ~> tendsto_inner [OF tendsto_const]
2477 dot_lsum ~> inner_setsum_left
2478 dot_rsum ~> inner_setsum_right
2479 continuous_cmul ~> continuous_scaleR [OF continuous_const]
2480 continuous_neg ~> continuous_minus
2481 continuous_sub ~> continuous_diff
2482 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
2483 continuous_mul ~> continuous_scaleR
2484 continuous_inv ~> continuous_inverse
2485 continuous_at_within_inv ~> continuous_at_within_inverse
2486 continuous_at_inv ~> continuous_at_inverse
2487 continuous_at_norm ~> continuous_norm [OF continuous_at_id]
2488 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
2489 continuous_at_component ~> continuous_component [OF continuous_at_id]
2490 continuous_on_neg ~> continuous_on_minus
2491 continuous_on_sub ~> continuous_on_diff
2492 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
2493 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
2494 continuous_on_mul ~> continuous_on_scaleR
2495 continuous_on_mul_real ~> continuous_on_mult
2496 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
2497 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
2498 continuous_on_inverse ~> continuous_on_inv
2499 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
2500 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
2501 subset_interior ~> interior_mono
2502 subset_closure ~> closure_mono
2503 closure_univ ~> closure_UNIV
2504 real_arch_lt ~> reals_Archimedean2
2505 real_arch ~> reals_Archimedean3
2506 real_abs_norm ~> abs_norm_cancel
2507 real_abs_sub_norm ~> norm_triangle_ineq3
2508 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
2510 * Session HOL-Probability:
2511 - Caratheodory's extension lemma is now proved for ring_of_sets.
2512 - Infinite products of probability measures are now available.
2513 - Sigma closure is independent, if the generator is independent
2514 - Use extended reals instead of positive extended
2515 reals. INCOMPATIBILITY.
2517 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
2519 expand_fun_below ~> fun_below_iff
2520 below_fun_ext ~> fun_belowI
2521 expand_cfun_eq ~> cfun_eq_iff
2522 ext_cfun ~> cfun_eqI
2523 expand_cfun_below ~> cfun_below_iff
2524 below_cfun_ext ~> cfun_belowI
2525 monofun_fun_fun ~> fun_belowD
2526 monofun_fun_arg ~> monofunE
2527 monofun_lub_fun ~> adm_monofun [THEN admD]
2528 cont_lub_fun ~> adm_cont [THEN admD]
2529 cont2cont_Rep_CFun ~> cont2cont_APP
2530 cont_Rep_CFun_app ~> cont_APP_app
2531 cont_Rep_CFun_app_app ~> cont_APP_app_app
2532 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
2533 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
2534 contlub_cfun ~> lub_APP [symmetric]
2535 contlub_LAM ~> lub_LAM [symmetric]
2538 lift_distinct1 ~> lift.distinct(1)
2539 lift_distinct2 ~> lift.distinct(2)
2540 Def_not_UU ~> lift.distinct(2)
2541 Def_inject ~> lift.inject
2542 below_UU_iff ~> below_bottom_iff
2543 eq_UU_iff ~> eq_bottom_iff
2546 *** Document preparation ***
2548 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
2549 isar-ref manual, both for description and actual application of the
2552 * Antiquotation @{value} evaluates the given term and presents its
2555 * Antiquotations: term style "isub" provides ad-hoc conversion of
2556 variables x1, y23 into subscripted form x\<^isub>1,
2557 y\<^isub>2\<^isub>3.
2559 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
2560 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
2562 * Localized \isabellestyle switch can be used within blocks or groups
2565 \isabellestyle{it} %preferred default
2566 {\isabellestylett @{text "typewriter stuff"}}
2568 * Discontinued special treatment of hard tabulators. Implicit
2569 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual
2575 * The inner syntax of sort/type/term/prop supports inlined YXML
2576 representations within quoted string tokens. By encoding logical
2577 entities via Term_XML (in ML or Scala) concrete syntax can be
2578 bypassed, which is particularly useful for producing bits of text
2579 under external program control.
2581 * Antiquotations for ML and document preparation are managed as theory
2582 data, which requires explicit setup.
2584 * Isabelle_Process.is_active allows tools to check if the official
2585 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
2586 (better known as Proof General).
2588 * Structure Proof_Context follows standard naming scheme. Old
2589 ProofContext is still available for some time as legacy alias.
2591 * Structure Timing provides various operations for timing; supersedes
2592 former start_timing/end_timing etc.
2594 * Path.print is the official way to show file-system paths to users
2595 (including quotes etc.).
2597 * Inner syntax: identifiers in parse trees of generic categories
2598 "logic", "aprop", "idt" etc. carry position information (disguised as
2599 type constraints). Occasional INCOMPATIBILITY with non-compliant
2600 translations that choke on unexpected type constraints. Positions can
2601 be stripped in ML translations via Syntax.strip_positions /
2602 Syntax.strip_positions_ast, or via the syntax constant
2603 "_strip_positions" within parse trees. As last resort, positions can
2604 be disabled via the configuration option Syntax.positions, which is
2605 called "syntax_positions" in Isar attribute syntax.
2607 * Discontinued special status of various ML structures that contribute
2608 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
2609 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
2610 refer directly to Ast.Constant, Lexicon.is_identifier,
2611 Syntax_Trans.mk_binder_tr etc.
2613 * Typed print translation: discontinued show_sorts argument, which is
2614 already available via context of "advanced" translation.
2616 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
2617 goal states; body tactic needs to address all subgoals uniformly.
2619 * Slightly more special eq_list/eq_set, with shortcut involving
2620 pointer equality (assumes that eq relation is reflexive).
2622 * Classical tactics use proper Proof.context instead of historic types
2623 claset/clasimpset. Old-style declarations like addIs, addEs, addDs
2624 operate directly on Proof.context. Raw type claset retains its use as
2625 snapshot of the classical context, which can be recovered via
2626 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.
2627 INCOMPATIBILITY, classical tactics and derived proof methods require
2628 proper Proof.context.
2633 * Discontinued support for Poly/ML 5.2, which was the last version
2634 without proper multithreading and TimeLimit implementation.
2636 * Discontinued old lib/scripts/polyml-platform, which has been
2637 obsolete since Isabelle2009-2.
2639 * Various optional external tools are referenced more robustly and
2640 uniformly by explicit Isabelle settings as follows:
2642 ISABELLE_CSDP (formerly CSDP_EXE)
2643 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)
2644 ISABELLE_OCAML (formerly EXEC_OCAML)
2645 ISABELLE_SWIPL (formerly EXEC_SWIPL)
2646 ISABELLE_YAP (formerly EXEC_YAP)
2648 Note that automated detection from the file-system or search path has
2649 been discontinued. INCOMPATIBILITY.
2651 * Scala layer provides JVM method invocation service for static
2652 methods of type (String)String, see Invoke_Scala.method in ML. For
2655 Invoke_Scala.method "java.lang.System.getProperty" "java.home"
2657 Together with YXML.string_of_body/parse_body and XML.Encode/Decode
2658 this allows to pass structured values between ML and Scala.
2660 * The IsabelleText fonts includes some further glyphs to support the
2661 Prover IDE. Potential INCOMPATIBILITY: users who happen to have
2662 installed a local copy (which is normally *not* required) need to
2663 delete or update it from ~~/lib/fonts/.
2667 New in Isabelle2011 (January 2011)
2668 ----------------------------------
2672 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
2673 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
2674 useful tooltips and hyperlinks produced from its static analysis. The
2675 bundled component provides an executable Isabelle tool that can be run
2678 Isabelle2011/bin/isabelle jedit
2680 * Significantly improved Isabelle/Isar implementation manual.
2682 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
2683 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
2684 while the default heap location within that directory lacks that extra
2685 suffix. This isolates multiple Isabelle installations from each
2686 other, avoiding problems with old settings in new versions.
2687 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
2689 * Source files are always encoded as UTF-8, instead of old-fashioned
2690 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
2691 the following package declarations:
2693 \usepackage[utf8]{inputenc}
2694 \usepackage{textcomp}
2696 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
2697 a Unicode character is treated as a single symbol, not a sequence of
2698 non-ASCII bytes as before. Since Isabelle/ML string literals may
2699 contain symbols without further backslash escapes, Unicode can now be
2700 used here as well. Recall that Symbol.explode in ML provides a
2701 consistent view on symbols, while raw explode (or String.explode)
2702 merely give a byte-oriented representation.
2704 * Theory loader: source files are primarily located via the master
2705 directory of each theory node (where the .thy file itself resides).
2706 The global load path is still partially available as legacy feature.
2707 Minor INCOMPATIBILITY due to subtle change in file lookup: use
2708 explicit paths, relatively to the theory.
2710 * Special treatment of ML file names has been discontinued.
2711 Historically, optional extensions .ML or .sml were added on demand --
2712 at the cost of clarity of file dependencies. Recall that Isabelle/ML
2713 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
2715 * Various options that affect pretty printing etc. are now properly
2716 handled within the context via configuration options, instead of
2717 unsynchronized references or print modes. There are both ML Config.T
2718 entities and Isar declaration attributes to access these.
2720 ML (Config.T) Isar (attribute)
2722 eta_contract eta_contract
2723 show_brackets show_brackets
2724 show_sorts show_sorts
2725 show_types show_types
2726 show_question_marks show_question_marks
2727 show_consts show_consts
2728 show_abbrevs show_abbrevs
2730 Syntax.ast_trace syntax_ast_trace
2731 Syntax.ast_stat syntax_ast_stat
2732 Syntax.ambiguity_level syntax_ambiguity_level
2734 Goal_Display.goals_limit goals_limit
2735 Goal_Display.show_main_goal show_main_goal
2737 Method.rule_trace rule_trace
2739 Thy_Output.display thy_output_display
2740 Thy_Output.quotes thy_output_quotes
2741 Thy_Output.indent thy_output_indent
2742 Thy_Output.source thy_output_source
2743 Thy_Output.break thy_output_break
2745 Note that corresponding "..._default" references in ML may only be
2746 changed globally at the ROOT session setup, but *not* within a theory.
2747 The option "show_abbrevs" supersedes the former print mode
2748 "no_abbrevs" with inverted meaning.
2750 * More systematic naming of some configuration options.
2753 trace_simp ~> simp_trace
2754 debug_simp ~> simp_debug
2756 * Support for real valued configuration options, using simplistic
2757 floating-point notation that coincides with the inner syntax for
2760 * Support for real valued preferences (with approximative PGIP type):
2761 front-ends need to accept "pgint" values in float notation.
2764 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
2767 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
2772 * Command 'type_synonym' (with single argument) replaces somewhat
2773 outdated 'types', which is still available as legacy feature for some
2776 * Command 'nonterminal' (with 'and' separated list of arguments)
2777 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
2779 * Command 'notepad' replaces former 'example_proof' for
2780 experimentation in Isar without any result. INCOMPATIBILITY.
2782 * Locale interpretation commands 'interpret' and 'sublocale' accept
2783 lists of equations to map definitions in a locale to appropriate
2784 entities in the context of the interpretation. The 'interpretation'
2785 command already provided this functionality.
2787 * Diagnostic command 'print_dependencies' prints the locale instances
2788 that would be activated if the specified expression was interpreted in
2789 the current context. Variant "print_dependencies!" assumes a context
2790 without interpretations.
2792 * Diagnostic command 'print_interps' prints interpretations in proofs
2793 in addition to interpretations in theories.
2795 * Discontinued obsolete 'global' and 'local' commands to manipulate
2796 the theory name space. Rare INCOMPATIBILITY. The ML functions
2797 Sign.root_path and Sign.local_path may be applied directly where this
2798 feature is still required for historical reasons.
2800 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
2801 'definition' instead.
2803 * The "prems" fact, which refers to the accidental collection of
2804 foundational premises in the context, is now explicitly marked as
2805 legacy feature and will be discontinued soon. Consider using "assms"
2806 of the head statement or reference facts by explicit names.
2808 * Document antiquotations @{class} and @{type} print classes and type
2811 * Document antiquotation @{file} checks file/directory entries within
2812 the local file system.
2817 * Coercive subtyping: functions can be declared as coercions and type
2818 inference will add them as necessary upon input of a term. Theory
2819 Complex_Main declares real :: nat => real and real :: int => real as
2820 coercions. A coercion function f is declared like this:
2822 declare [[coercion f]]
2824 To lift coercions through type constructors (e.g. from nat => real to
2825 nat list => real list), map functions can be declared, e.g.
2827 declare [[coercion_map map]]
2829 Currently coercion inference is activated only in theories including
2830 real numbers, i.e. descendants of Complex_Main. This is controlled by
2831 the configuration option "coercion_enabled", e.g. it can be enabled in
2832 other theories like this:
2834 declare [[coercion_enabled]]
2836 * Command 'partial_function' provides basic support for recursive
2837 function definitions over complete partial orders. Concrete instances
2838 are provided for i) the option type, ii) tail recursion on arbitrary
2839 types, and iii) the heap monad of Imperative_HOL. See
2840 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
2843 * Function package: f.psimps rules are no longer implicitly declared
2844 as [simp]. INCOMPATIBILITY.
2846 * Datatype package: theorems generated for executable equality (class
2847 "eq") carry proper names and are treated as default code equations.
2849 * Inductive package: now offers command 'inductive_simps' to
2850 automatically derive instantiated and simplified equations for
2851 inductive predicates, similar to 'inductive_cases'.
2853 * Command 'enriched_type' allows to register properties of the
2854 functorial structure of types.
2856 * Improved infrastructure for term evaluation using code generator
2857 techniques, in particular static evaluation conversions.
2859 * Code generator: Scala (2.8 or higher) has been added to the target
2862 * Code generator: globbing constant expressions "*" and "Theory.*"
2863 have been replaced by the more idiomatic "_" and "Theory._".
2866 * Code generator: export_code without explicit file declaration prints
2867 to standard output. INCOMPATIBILITY.
2869 * Code generator: do not print function definitions for case
2870 combinators any longer.
2872 * Code generator: simplification with rules determined with
2873 src/Tools/Code/code_simp.ML and method "code_simp".
2875 * Code generator for records: more idiomatic representation of record
2876 types. Warning: records are not covered by ancient SML code
2877 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
2878 rep_datatype declaration helps to succeed then:
2882 rep_datatype foo_ext ...
2884 * Records: logical foundation type for records does not carry a
2885 '_type' suffix any longer (obsolete due to authentic syntax).
2888 * Quickcheck now by default uses exhaustive testing instead of random
2889 testing. Random testing can be invoked by "quickcheck [random]",
2890 exhaustive testing by "quickcheck [exhaustive]".
2892 * Quickcheck instantiates polymorphic types with small finite
2893 datatypes by default. This enables a simple execution mechanism to
2894 handle quantifiers and function equality over the finite datatypes.
2896 * Quickcheck random generator has been renamed from "code" to
2897 "random". INCOMPATIBILITY.
2899 * Quickcheck now has a configurable time limit which is set to 30
2900 seconds by default. This can be changed by adding [timeout = n] to the
2901 quickcheck command. The time limit for Auto Quickcheck is still set
2904 * Quickcheck in locales considers interpretations of that locale for
2905 counter example search.
2908 - Added "smt" and "remote_smt" provers based on the "smt" proof
2909 method. See the Sledgehammer manual for details ("isabelle doc
2912 sledgehammer atp_info ~> sledgehammer running_provers
2913 sledgehammer atp_kill ~> sledgehammer kill_provers
2914 sledgehammer available_atps ~> sledgehammer available_provers
2917 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
2918 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
2919 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
2920 (and "ms" and "min" are no longer supported)
2925 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
2926 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
2928 - Added support for partial quotient types.
2929 - Added local versions of the "Nitpick.register_xxx" functions.
2930 - Added "whack" option.
2931 - Allow registration of quotient types as codatatypes.
2932 - Improved "merge_type_vars" option to merge more types.
2933 - Removed unsound "fast_descrs" option.
2934 - Added custom symmetry breaking for datatypes, making it possible to reach
2935 higher cardinalities.
2936 - Prevent the expansion of too large definitions.
2938 * Proof methods "metis" and "meson" now have configuration options
2939 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
2940 to diagnose these tools. E.g.
2942 using [[metis_trace = true]]
2944 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
2945 manually as command 'solve_direct'.
2947 * The default SMT solver Z3 must be enabled explicitly (due to
2948 licensing issues) by setting the environment variable
2949 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
2950 commercial applications, the SMT solver CVC3 is provided as fall-back;
2951 changing the SMT solver is done via the configuration option
2954 * Remote SMT solvers need to be referred to by the "remote_" prefix,
2955 i.e. "remote_cvc3" and "remote_z3".
2957 * Added basic SMT support for datatypes, records, and typedefs using
2958 the oracle mode (no proofs). Direct support of pairs has been dropped
2959 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
2960 support for a similar behavior). Minor INCOMPATIBILITY.
2962 * Changed SMT configuration options:
2964 z3_proofs ~> smt_oracle (with inverted meaning)
2965 z3_trace_assms ~> smt_trace_used_facts
2978 * Boogie output files (.b2i files) need to be declared in the theory
2981 * Simplification procedure "list_to_set_comprehension" rewrites list
2982 comprehensions applied to List.set to set comprehensions. Occasional
2983 INCOMPATIBILITY, may be deactivated like this:
2985 declare [[simproc del: list_to_set_comprehension]]
2987 * Removed old version of primrec package. INCOMPATIBILITY.
2989 * Removed simplifier congruence rule of "prod_case", as has for long
2990 been the case with "split". INCOMPATIBILITY.
2992 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
2994 * Removed [split_format ... and ... and ...] version of
2995 [split_format]. Potential INCOMPATIBILITY.
2997 * Predicate "sorted" now defined inductively, with nice induction
2998 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
3000 * Constant "contents" renamed to "the_elem", to free the generic name
3001 contents for other uses. INCOMPATIBILITY.
3003 * Renamed class eq and constant eq (for code generation) to class
3004 equal and constant equal, plus renaming of related facts and various
3005 tuning. INCOMPATIBILITY.
3007 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
3009 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
3012 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
3013 avoid confusion with finite sets. INCOMPATIBILITY.
3015 * Abandoned locales equiv, congruent and congruent2 for equivalence
3016 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
3019 * Some previously unqualified names have been qualified:
3026 Trueprop ~> HOL.Trueprop
3031 op --> ~> HOL.implies
3043 Pair ~> Product_Type.Pair
3044 fst ~> Product_Type.fst
3045 snd ~> Product_Type.snd
3046 curry ~> Product_Type.curry
3048 Collect ~> Set.Collect
3052 * More canonical naming convention for some fundamental definitions:
3054 bot_bool_eq ~> bot_bool_def
3055 top_bool_eq ~> top_bool_def
3056 inf_bool_eq ~> inf_bool_def
3057 sup_bool_eq ~> sup_bool_def
3058 bot_fun_eq ~> bot_fun_def
3059 top_fun_eq ~> top_fun_def
3060 inf_fun_eq ~> inf_fun_def
3061 sup_fun_eq ~> sup_fun_def
3065 * More stylized fact names:
3067 expand_fun_eq ~> fun_eq_iff
3068 expand_set_eq ~> set_eq_iff
3070 nat_number ~> eval_nat_numeral
3074 * Refactoring of code-generation specific operations in theory List:
3080 mem_iff ~> member_def
3081 null_empty ~> null_def
3083 INCOMPATIBILITY. Note that these were not supposed to be used
3084 regularly unless for striking reasons; their main purpose was code
3087 Various operations from the Haskell prelude are used for generating
3090 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
3091 "surj f" is now an abbreviation of "range f = UNIV". The theorems
3092 bij_def and surj_def are unchanged. INCOMPATIBILITY.
3094 * Abolished some non-alphabetic type names: "prod" and "sum" replace
3095 "*" and "+" respectively. INCOMPATIBILITY.
3097 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
3098 "Sum_Type.Plus" instead.
3100 * Constant "split" has been merged with constant "prod_case"; names of
3101 ML functions, facts etc. involving split have been retained so far,
3102 though. INCOMPATIBILITY.
3104 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
3105 instead. INCOMPATIBILITY.
3107 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
3110 * Former theory Library/Enum is now part of the HOL-Main image.
3111 INCOMPATIBILITY: all constants of the Enum theory now have to be
3112 referred to by its qualified name.
3115 nlists ~> Enum.nlists
3116 product ~> Enum.product
3118 * Theory Library/Monad_Syntax provides do-syntax for monad types.
3119 Syntax in Library/State_Monad has been changed to avoid ambiguities.
3122 * Theory Library/SetsAndFunctions has been split into
3123 Library/Function_Algebras and Library/Set_Algebras; canonical names
3124 for instance definitions for functions; various improvements.
3127 * Theory Library/Multiset provides stable quicksort implementation of
3130 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
3133 * Session Multivariate_Analysis: introduced a type class for euclidean
3134 space. Most theorems are now stated in terms of euclidean spaces
3135 instead of finite cartesian products.
3138 real ^ 'n ~> 'a::real_vector
3139 ~> 'a::euclidean_space
3140 ~> 'a::ordered_euclidean_space
3141 (depends on your needs)
3145 \<chi> x. _ ~> \<chi>\<chi> x. _
3148 Also note that the indices are now natural numbers and not from some
3149 finite type. Finite cartesian products of euclidean spaces, products
3150 of euclidean spaces the real and complex numbers are instantiated to
3151 be euclidean_spaces. INCOMPATIBILITY.
3153 * Session Probability: introduced pextreal as positive extended real
3154 numbers. Use pextreal as value for measures. Introduce the
3155 Radon-Nikodym derivative, product spaces and Fubini's theorem for
3156 arbitrary sigma finite measures. Introduces Lebesgue measure based on
3157 the integral in Multivariate Analysis. INCOMPATIBILITY.
3159 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
3162 * Session SPARK (with image HOL-SPARK) provides commands to load and
3163 prove verification conditions generated by the SPARK Ada program
3164 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
3169 * Theorems for additive ring operations (locale abelian_monoid and
3170 descendants) are generated by interpretation from their multiplicative
3171 counterparts. Names (in particular theorem names) have the mandatory
3172 qualifier 'add'. Previous theorem names are redeclared for
3175 * Structure "int_ring" is now an abbreviation (previously a
3176 definition). This fits more natural with advanced interpretations.
3181 * The domain package now runs in definitional mode by default: The
3182 former command 'new_domain' is now called 'domain'. To use the domain
3183 package in its original axiomatic mode, use 'domain (unsafe)'.
3186 * The new class "domain" is now the default sort. Class "predomain"
3187 is an unpointed version of "domain". Theories can be updated by
3188 replacing sort annotations as shown below. INCOMPATIBILITY.
3190 'a::type ~> 'a::countable
3191 'a::cpo ~> 'a::predomain
3192 'a::pcpo ~> 'a::domain
3194 * The old type class "rep" has been superseded by class "domain".
3195 Accordingly, users of the definitional package must remove any
3196 "default_sort rep" declarations. INCOMPATIBILITY.
3198 * The domain package (definitional mode) now supports unpointed
3199 predomain argument types, as long as they are marked 'lazy'. (Strict
3200 arguments must be in class "domain".) For example, the following
3201 domain definition now works:
3203 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
3205 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
3206 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
3207 'a option, and 'a list. Additionally, it configures fixrec and the
3208 domain package to work with these types. For example:
3210 fixrec isInl :: "('a + 'b) u -> tr"
3211 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
3213 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
3215 * The "(permissive)" option of fixrec has been replaced with a
3216 per-equation "(unchecked)" option. See
3217 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
3219 * The "bifinite" class no longer fixes a constant "approx"; the class
3220 now just asserts that such a function exists. INCOMPATIBILITY.
3222 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
3223 defines an embedding of type 'a defl into udom by default; instances
3224 of "bifinite" and "domain" classes are available in
3225 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
3227 * The syntax "REP('a)" has been replaced with "DEFL('a)".
3229 * The predicate "directed" has been removed. INCOMPATIBILITY.
3231 * The type class "finite_po" has been removed. INCOMPATIBILITY.
3233 * The function "cprod_map" has been renamed to "prod_map".
3236 * The monadic bind operator on each powerdomain has new binder syntax
3237 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
3238 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
3240 * The infix syntax for binary union on each powerdomain has changed
3241 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
3242 syntax. INCOMPATIBILITY.
3244 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
3245 still supported as an input translation.
3247 * Renamed some theorems (the original names are also still available).
3249 expand_fun_below ~> fun_below_iff
3250 below_fun_ext ~> fun_belowI
3251 expand_cfun_eq ~> cfun_eq_iff
3252 ext_cfun ~> cfun_eqI
3253 expand_cfun_below ~> cfun_below_iff
3254 below_cfun_ext ~> cfun_belowI
3255 cont2cont_Rep_CFun ~> cont2cont_APP
3257 * The Abs and Rep functions for various types have changed names.
3258 Related theorem names have also changed to match. INCOMPATIBILITY.
3260 Rep_CFun ~> Rep_cfun
3261 Abs_CFun ~> Abs_cfun
3262 Rep_Sprod ~> Rep_sprod
3263 Abs_Sprod ~> Abs_sprod
3264 Rep_Ssum ~> Rep_ssum
3265 Abs_Ssum ~> Abs_ssum
3267 * Lemmas with names of the form *_defined_iff or *_strict_iff have
3268 been renamed to *_bottom_iff. INCOMPATIBILITY.
3270 * Various changes to bisimulation/coinduction with domain package:
3272 - Definitions of "bisim" constants no longer mention definedness.
3273 - With mutual recursion, "bisim" predicate is now curried.
3274 - With mutual recursion, each type gets a separate coind theorem.
3275 - Variable names in bisim_def and coinduct rules have changed.
3279 * Case combinators generated by the domain package for type "foo" are
3280 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
3282 * Several theorems have been renamed to more accurately reflect the
3283 names of constants and types involved. INCOMPATIBILITY.
3285 thelub_const ~> lub_const
3286 lub_const ~> is_lub_const
3288 is_lub_lub ~> is_lubD2
3290 unique_lub ~> is_lub_unique
3291 is_ub_lub ~> is_lub_rangeD1
3292 lub_bin_chain ~> is_lub_bin_chain
3293 lub_fun ~> is_lub_fun
3294 thelub_fun ~> lub_fun
3295 thelub_cfun ~> lub_cfun
3296 thelub_Pair ~> lub_Pair
3297 lub_cprod ~> is_lub_prod
3298 thelub_cprod ~> lub_prod
3299 minimal_cprod ~> minimal_prod
3300 inst_cprod_pcpo ~> inst_prod_pcpo
3302 compact_UU ~> compact_bottom
3303 deflation_UU ~> deflation_bottom
3304 finite_deflation_UU ~> finite_deflation_bottom
3306 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
3308 sq_ord_less_eq_trans ~> below_eq_trans
3309 sq_ord_eq_less_trans ~> eq_below_trans
3310 refl_less ~> below_refl
3311 trans_less ~> below_trans
3312 antisym_less ~> below_antisym
3313 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
3314 box_less ~> box_below
3315 rev_trans_less ~> rev_below_trans
3316 not_less2not_eq ~> not_below2not_eq
3317 less_UU_iff ~> below_UU_iff
3318 flat_less_iff ~> flat_below_iff
3319 adm_less ~> adm_below
3320 adm_not_less ~> adm_not_below
3321 adm_compact_not_less ~> adm_compact_not_below
3322 less_fun_def ~> below_fun_def
3323 expand_fun_less ~> fun_below_iff
3324 less_fun_ext ~> fun_belowI
3325 less_discr_def ~> below_discr_def
3326 discr_less_eq ~> discr_below_eq
3327 less_unit_def ~> below_unit_def
3328 less_cprod_def ~> below_prod_def
3329 prod_lessI ~> prod_belowI
3330 Pair_less_iff ~> Pair_below_iff
3331 fst_less_iff ~> fst_below_iff
3332 snd_less_iff ~> snd_below_iff
3333 expand_cfun_less ~> cfun_below_iff
3334 less_cfun_ext ~> cfun_belowI
3335 injection_less ~> injection_below
3336 less_up_def ~> below_up_def
3337 not_Iup_less ~> not_Iup_below
3338 Iup_less ~> Iup_below
3340 Def_inject_less_eq ~> Def_below_Def
3341 Def_less_is_eq ~> Def_below_iff
3342 spair_less_iff ~> spair_below_iff
3343 less_sprod ~> below_sprod
3344 spair_less ~> spair_below
3345 sfst_less_iff ~> sfst_below_iff
3346 ssnd_less_iff ~> ssnd_below_iff
3347 fix_least_less ~> fix_least_below
3348 dist_less_one ~> dist_below_one
3349 less_ONE ~> below_ONE
3350 ONE_less_iff ~> ONE_below_iff
3351 less_sinlD ~> below_sinlD
3352 less_sinrD ~> below_sinrD
3357 * All constant names are now qualified internally and use proper
3358 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
3363 * Antiquotation @{assert} inlines a function bool -> unit that raises
3364 Fail if the argument is false. Due to inlining the source position of
3365 failed assertions is included in the error output.
3367 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
3368 text is in practice always evaluated with a stable theory checkpoint.
3369 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
3371 * Antiquotation @{theory A} refers to theory A from the ancestry of
3372 the current context, not any accidental theory loader state as before.
3373 Potential INCOMPATIBILITY, subtle change in semantics.
3375 * Syntax.pretty_priority (default 0) configures the required priority
3376 of pretty-printed output and thus affects insertion of parentheses.
3378 * Syntax.default_root (default "any") configures the inner syntax
3379 category (nonterminal symbol) for parsing of terms.
3381 * Former exception Library.UnequalLengths now coincides with
3382 ListPair.UnequalLengths.
3384 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
3385 main functionality is provided by structure Simplifier.
3387 * Renamed raw "explode" function to "raw_explode" to emphasize its
3388 meaning. Note that internally to Isabelle, Symbol.explode is used in
3389 almost all situations.
3391 * Discontinued obsolete function sys_error and exception SYS_ERROR.
3392 See implementation manual for further details on exceptions in
3395 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
3398 * Renamed structure PureThy to Pure_Thy and moved most of its
3399 operations to structure Global_Theory, to emphasize that this is
3400 rarely-used global-only stuff.
3402 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
3403 instead (or tracing for high-volume output).
3405 * Configuration option show_question_marks only affects regular pretty
3406 printing of types and terms, not raw Term.string_of_vname.
3408 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
3409 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
3410 @{thms} for most purposes.
3412 * ML structure Unsynchronized is never opened, not even in Isar
3413 interaction mode as before. Old Unsynchronized.set etc. have been
3414 discontinued -- use plain := instead. This should be *rare* anyway,
3415 since modern tools always work via official context data, notably
3416 configuration options.
3418 * Parallel and asynchronous execution requires special care concerning
3419 interrupts. Structure Exn provides some convenience functions that
3420 avoid working directly with raw Interrupt. User code must not absorb
3421 interrupts -- intermediate handling (for cleanup etc.) needs to be
3422 followed by re-raising of the original exception. Another common
3423 source of mistakes are "handle _" patterns, which make the meaning of
3424 the program subject to physical effects of the environment.
3428 New in Isabelle2009-2 (June 2010)
3429 ---------------------------------
3433 * Authentic syntax for *all* logical entities (type classes, type
3434 constructors, term constants): provides simple and robust
3435 correspondence between formal entities and concrete syntax. Within
3436 the parse tree / AST representations, "constants" are decorated by
3437 their category (class, type, const) and spelled out explicitly with
3438 their full internal name.
3440 Substantial INCOMPATIBILITY concerning low-level syntax declarations
3441 and translations (translation rules and translation functions in ML).
3442 Some hints on upgrading:
3444 - Many existing uses of 'syntax' and 'translations' can be replaced
3445 by more modern 'type_notation', 'notation' and 'abbreviation',
3446 which are independent of this issue.
3448 - 'translations' require markup within the AST; the term syntax
3449 provides the following special forms:
3451 CONST c -- produces syntax version of constant c from context
3452 XCONST c -- literally c, checked as constant from context
3453 c -- literally c, if declared by 'syntax'
3455 Plain identifiers are treated as AST variables -- occasionally the
3456 system indicates accidental variables via the error "rhs contains
3459 Type classes and type constructors are marked according to their
3460 concrete syntax. Some old translations rules need to be written
3461 for the "type" category, using type constructor application
3462 instead of pseudo-term application of the default category
3465 - 'parse_translation' etc. in ML may use the following
3468 @{class_syntax c} -- type class c within parse tree / AST
3469 @{term_syntax c} -- type constructor c within parse tree / AST
3470 @{const_syntax c} -- ML version of "CONST c" above
3471 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
3473 - Literal types within 'typed_print_translations', i.e. those *not*
3474 represented as pseudo-terms are represented verbatim. Use @{class
3475 c} or @{type_name c} here instead of the above syntax
3478 Note that old non-authentic syntax was based on unqualified base
3479 names, so all of the above "constant" names would coincide. Recall
3480 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
3481 diagnose syntax problems.
3483 * Type constructors admit general mixfix syntax, not just infix.
3485 * Concrete syntax may be attached to local entities without a proof
3486 body, too. This works via regular mixfix annotations for 'fix',
3487 'def', 'obtain' etc. or via the explicit 'write' command, which is
3488 similar to the 'notation' command in theory specifications.
3490 * Discontinued unnamed infix syntax (legacy feature for many years) --
3491 need to specify constant name and syntax separately. Internal ML
3492 datatype constructors have been renamed from InfixName to Infix etc.
3493 Minor INCOMPATIBILITY.
3495 * Schematic theorem statements need to be explicitly markup as such,
3496 via commands 'schematic_lemma', 'schematic_theorem',
3497 'schematic_corollary'. Thus the relevance of the proof is made
3498 syntactically clear, which impacts performance in a parallel or
3499 asynchronous interactive environment. Minor INCOMPATIBILITY.
3501 * Use of cumulative prems via "!" in some proof methods has been
3502 discontinued (old legacy feature).
3504 * References 'trace_simp' and 'debug_simp' have been replaced by
3505 configuration options stored in the context. Enabling tracing (the
3506 case of debugging is similar) in proofs works via
3508 using [[trace_simp = true]]
3510 Tracing is then active for all invocations of the simplifier in
3511 subsequent goal refinement steps. Tracing may also still be enabled or
3512 disabled via the ProofGeneral settings menu.
3514 * Separate commands 'hide_class', 'hide_type', 'hide_const',
3515 'hide_fact' replace the former 'hide' KIND command. Minor
3518 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
3519 more efficient than combinations with -q1 or -q2.
3524 * Proofterms record type-class reasoning explicitly, using the
3525 "unconstrain" operation internally. This eliminates all sort
3526 constraints from a theorem and proof, introducing explicit
3527 OFCLASS-premises. On the proof term level, this operation is
3528 automatically applied at theorem boundaries, such that closed proofs
3529 are always free of sort constraints. INCOMPATIBILITY for tools that
3530 inspect proof terms.
3532 * Local theory specifications may depend on extra type variables that
3533 are not present in the result type -- arguments TYPE('a) :: 'a itself
3534 are added internally. For example:
3536 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
3538 * Predicates of locales introduced by classes carry a mandatory
3539 "class" prefix. INCOMPATIBILITY.
3541 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
3543 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
3546 * Command 'code_reflect' allows to incorporate generated ML code into
3547 runtime environment; replaces immature code_datatype antiquotation.
3550 * Code generator: simple concept for abstract datatypes obeying
3553 * Code generator: details of internal data cache have no impact on the
3554 user space functionality any longer.
3556 * Methods "unfold_locales" and "intro_locales" ignore non-locale
3557 subgoals. This is more appropriate for interpretations with 'where'.
3560 * Command 'example_proof' opens an empty proof body. This allows to
3561 experiment with Isar, without producing any persistent result.
3563 * Commands 'type_notation' and 'no_type_notation' declare type syntax
3564 within a local theory context, with explicit checking of the
3565 constructors involved (in contrast to the raw 'syntax' versions).
3567 * Commands 'types' and 'typedecl' now work within a local theory
3568 context -- without introducing dependencies on parameters or
3569 assumptions, which is not possible in Isabelle/Pure.
3571 * Command 'defaultsort' has been renamed to 'default_sort', it works
3572 within a local theory context. Minor INCOMPATIBILITY.
3577 * Command 'typedef' now works within a local theory context -- without
3578 introducing dependencies on parameters or assumptions, which is not
3579 possible in Isabelle/Pure/HOL. Note that the logical environment may
3580 contain multiple interpretations of local typedefs (with different
3581 non-emptiness proofs), even in a global theory context.
3583 * New package for quotient types. Commands 'quotient_type' and
3584 'quotient_definition' may be used for defining types and constants by
3585 quotient constructions. An example is the type of integers created by
3586 quotienting pairs of natural numbers:
3589 intrel :: "(nat * nat) => (nat * nat) => bool"
3591 "intrel (x, y) (u, v) = (x + v = u + y)"
3593 quotient_type int = "nat * nat" / intrel
3594 by (auto simp add: equivp_def expand_fun_eq)
3597 "0::int" is "(0::nat, 0::nat)"
3599 The method "lifting" can be used to lift of theorems from the
3600 underlying "raw" type to the quotient type. The example
3601 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
3602 construction and provides a reasoning infrastructure for finite sets.
3604 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
3605 clash with new theory Quotient in Main HOL.
3607 * Moved the SMT binding into the main HOL session, eliminating
3608 separate HOL-SMT session.
3610 * List membership infix mem operation is only an input abbreviation.
3613 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
3614 for future developements; former Library/Word.thy is still present in
3615 the AFP entry RSAPPS.
3617 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
3618 longer shadowed. INCOMPATIBILITY.
3620 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
3623 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
3626 * Dropped normalizing_semiring etc; use the facts in semiring classes
3627 instead. INCOMPATIBILITY.
3629 * Dropped several real-specific versions of lemmas about floor and
3630 ceiling; use the generic lemmas from theory "Archimedean_Field"
3631 instead. INCOMPATIBILITY.
3633 floor_number_of_eq ~> floor_number_of
3634 le_floor_eq_number_of ~> number_of_le_floor
3635 le_floor_eq_zero ~> zero_le_floor
3636 le_floor_eq_one ~> one_le_floor
3637 floor_less_eq_number_of ~> floor_less_number_of
3638 floor_less_eq_zero ~> floor_less_zero
3639 floor_less_eq_one ~> floor_less_one
3640 less_floor_eq_number_of ~> number_of_less_floor
3641 less_floor_eq_zero ~> zero_less_floor
3642 less_floor_eq_one ~> one_less_floor
3643 floor_le_eq_number_of ~> floor_le_number_of
3644 floor_le_eq_zero ~> floor_le_zero
3645 floor_le_eq_one ~> floor_le_one
3646 floor_subtract_number_of ~> floor_diff_number_of
3647 floor_subtract_one ~> floor_diff_one
3648 ceiling_number_of_eq ~> ceiling_number_of
3649 ceiling_le_eq_number_of ~> ceiling_le_number_of
3650 ceiling_le_zero_eq ~> ceiling_le_zero
3651 ceiling_le_eq_one ~> ceiling_le_one
3652 less_ceiling_eq_number_of ~> number_of_less_ceiling
3653 less_ceiling_eq_zero ~> zero_less_ceiling
3654 less_ceiling_eq_one ~> one_less_ceiling
3655 ceiling_less_eq_number_of ~> ceiling_less_number_of
3656 ceiling_less_eq_zero ~> ceiling_less_zero
3657 ceiling_less_eq_one ~> ceiling_less_one
3658 le_ceiling_eq_number_of ~> number_of_le_ceiling
3659 le_ceiling_eq_zero ~> zero_le_ceiling
3660 le_ceiling_eq_one ~> one_le_ceiling
3661 ceiling_subtract_number_of ~> ceiling_diff_number_of
3662 ceiling_subtract_one ~> ceiling_diff_one
3664 * Theory "Finite_Set": various folding_XXX locales facilitate the
3665 application of the various fold combinators on finite sets.
3667 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
3668 provides abstract red-black tree type which is backed by "RBT_Impl" as
3669 implementation. INCOMPATIBILTY.
3671 * Theory Library/Coinductive_List has been removed -- superseded by
3672 AFP/thys/Coinductive.
3674 * Theory PReal, including the type "preal" and related operations, has
3675 been removed. INCOMPATIBILITY.
3677 * Real: new development using Cauchy Sequences.
3679 * Split off theory "Big_Operators" containing setsum, setprod,
3680 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
3682 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
3683 "Int" etc. INCOMPATIBILITY.
3685 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
3687 * New set of rules "ac_simps" provides combined assoc / commute
3688 rewrites for all interpretations of the appropriate generic locales.
3690 * Renamed theory "OrderedGroup" to "Groups" and split theory
3691 "Ring_and_Field" into theories "Rings" and "Fields"; for more
3692 appropriate and more consistent names suitable for name prefixes
3693 within the HOL theories. INCOMPATIBILITY.
3695 * Some generic constants have been put to appropriate theories:
3696 - less_eq, less: Orderings
3697 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
3698 - inverse, divide: Rings
3701 * More consistent naming of type classes involving orderings (and
3704 lower_semilattice ~> semilattice_inf
3705 upper_semilattice ~> semilattice_sup
3707 dense_linear_order ~> dense_linorder
3709 pordered_ab_group_add ~> ordered_ab_group_add
3710 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
3711 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
3712 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
3713 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
3714 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
3715 pordered_cancel_semiring ~> ordered_cancel_semiring
3716 pordered_comm_monoid_add ~> ordered_comm_monoid_add
3717 pordered_comm_ring ~> ordered_comm_ring
3718 pordered_comm_semiring ~> ordered_comm_semiring
3719 pordered_ring ~> ordered_ring
3720 pordered_ring_abs ~> ordered_ring_abs
3721 pordered_semiring ~> ordered_semiring
3723 ordered_ab_group_add ~> linordered_ab_group_add
3724 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
3725 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
3726 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
3727 ordered_field ~> linordered_field
3728 ordered_field_no_lb ~> linordered_field_no_lb
3729 ordered_field_no_ub ~> linordered_field_no_ub
3730 ordered_field_dense_linear_order ~> dense_linordered_field
3731 ordered_idom ~> linordered_idom
3732 ordered_ring ~> linordered_ring
3733 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
3734 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
3735 ordered_ring_strict ~> linordered_ring_strict
3736 ordered_semidom ~> linordered_semidom
3737 ordered_semiring ~> linordered_semiring
3738 ordered_semiring_1 ~> linordered_semiring_1
3739 ordered_semiring_1_strict ~> linordered_semiring_1_strict
3740 ordered_semiring_strict ~> linordered_semiring_strict
3742 The following slightly odd type classes have been moved to a
3743 separate theory Library/Lattice_Algebras:
3745 lordered_ab_group_add ~> lattice_ab_group_add
3746 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
3747 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
3748 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
3749 lordered_ring ~> lattice_ring
3753 * Refined field classes:
3754 - classes division_ring_inverse_zero, field_inverse_zero,
3755 linordered_field_inverse_zero include rule inverse 0 = 0 --
3756 subsumes former division_by_zero class;
3757 - numerous lemmas have been ported from field to division_ring.
3760 * Refined algebra theorem collections:
3761 - dropped theorem group group_simps, use algebra_simps instead;
3762 - dropped theorem group ring_simps, use field_simps instead;
3763 - proper theorem collection field_simps subsumes former theorem
3764 groups field_eq_simps and field_simps;
3765 - dropped lemma eq_minus_self_iff which is a duplicate for
3769 * Theory Finite_Set and List: some lemmas have been generalized from
3772 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
3773 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
3774 inter_Inter_fold_inter ~> inf_Inf_fold_inf
3775 union_Union_fold_union ~> sup_Sup_fold_sup
3776 Inter_fold_inter ~> Inf_fold_inf
3777 Union_fold_union ~> Sup_fold_sup
3778 inter_INTER_fold_inter ~> inf_INFI_fold_inf
3779 union_UNION_fold_union ~> sup_SUPR_fold_sup
3780 INTER_fold_inter ~> INFI_fold_inf
3781 UNION_fold_union ~> SUPR_fold_sup
3783 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
3784 replaced by the more convenient lemmas Inf_empty and Sup_empty.
3785 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
3786 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
3787 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
3788 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
3790 * Reorganized theory Multiset: swapped notation of pointwise and
3793 - pointwise ordering is instance of class order with standard syntax
3795 - multiset ordering has syntax <=# and <#; partial order properties
3796 are provided by means of interpretation with prefix
3798 - less duplication, less historical organization of sections,
3799 conversion from associations lists to multisets, rudimentary code
3801 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
3806 multiset_eq_conv_count_eq ~> multiset_ext_iff
3807 multi_count_ext ~> multiset_ext
3808 diff_union_inverse2 ~> diff_union_cancelR
3812 * Theory Permutation: replaced local "remove" by List.remove1.
3814 * Code generation: ML and OCaml code is decorated with signatures.
3816 * Theory List: added transpose.
3818 * Library/Nat_Bijection.thy is a collection of bijective functions
3819 between nat and other types, which supersedes the older libraries
3820 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
3823 Nat_Int_Bij.nat2_to_nat ~> prod_encode
3824 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
3825 Nat_Int_Bij.int_to_nat_bij ~> int_encode
3826 Nat_Int_Bij.nat_to_int_bij ~> int_decode
3827 Countable.pair_encode ~> prod_encode
3828 NatIso.prod2nat ~> prod_encode
3829 NatIso.nat2prod ~> prod_decode
3830 NatIso.sum2nat ~> sum_encode
3831 NatIso.nat2sum ~> sum_decode
3832 NatIso.list2nat ~> list_encode
3833 NatIso.nat2list ~> list_decode
3834 NatIso.set2nat ~> set_encode
3835 NatIso.nat2set ~> set_decode
3838 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
3839 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
3840 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
3841 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
3842 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
3843 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
3844 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
3845 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
3846 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
3847 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
3848 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
3849 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
3850 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
3853 - Renamed ATP commands:
3854 atp_info ~> sledgehammer running_atps
3855 atp_kill ~> sledgehammer kill_atps
3856 atp_messages ~> sledgehammer messages
3857 atp_minimize ~> sledgehammer minimize
3858 print_atps ~> sledgehammer available_atps
3860 - Added user's manual ("isabelle doc sledgehammer").
3861 - Added option syntax and "sledgehammer_params" to customize
3862 Sledgehammer's behavior. See the manual for details.
3863 - Modified the Isar proof reconstruction code so that it produces
3864 direct proofs rather than proofs by contradiction. (This feature
3865 is still experimental.)
3866 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
3868 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
3871 - Added and implemented "binary_ints" and "bits" options.
3872 - Added "std" option and implemented support for nonstandard models.
3873 - Added and implemented "finitize" option to improve the precision
3874 of infinite datatypes based on a monotonicity analysis.
3875 - Added support for quotient types.
3876 - Added support for "specification" and "ax_specification"
3878 - Added support for local definitions (for "function" and
3879 "termination" proofs).
3880 - Added support for term postprocessors.
3881 - Optimized "Multiset.multiset" and "FinFun.finfun".
3882 - Improved efficiency of "destroy_constrs" optimization.
3883 - Fixed soundness bugs related to "destroy_constrs" optimization and
3885 - Fixed soundness bug related to higher-order constructors.
3886 - Fixed soundness bug when "full_descrs" is enabled.
3887 - Improved precision of set constructs.
3888 - Added "atoms" option.
3889 - Added cache to speed up repeated Kodkod invocations on the same
3891 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
3892 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
3893 "SAT4J_Light". INCOMPATIBILITY.
3894 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
3895 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
3896 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
3898 * Method "induct" now takes instantiations of the form t, where t is not
3899 a variable, as a shorthand for "x == t", where x is a fresh variable.
3900 If this is not intended, t has to be enclosed in parentheses.
3901 By default, the equalities generated by definitional instantiations
3902 are pre-simplified, which may cause parameters of inductive cases
3903 to disappear, or may even delete some of the inductive cases.
3904 Use "induct (no_simp)" instead of "induct" to restore the old
3905 behaviour. The (no_simp) option is also understood by the "cases"
3906 and "nominal_induct" methods, which now perform pre-simplification, too.
3912 * Variable names in lemmas generated by the domain package have
3913 changed; the naming scheme is now consistent with the HOL datatype
3914 package. Some proof scripts may be affected, INCOMPATIBILITY.
3916 * The domain package no longer defines the function "foo_copy" for
3917 recursive domain "foo". The reach lemma is now stated directly in
3918 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
3919 be reformulated in terms of "foo_take", INCOMPATIBILITY.
3921 * Most definedness lemmas generated by the domain package (previously
3922 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
3923 like "foo$x = UU <-> x = UU", which works better as a simp rule.
3924 Proofs that used definedness lemmas as intro rules may break,
3925 potential INCOMPATIBILITY.
3927 * Induction and casedist rules generated by the domain package now
3928 declare proper case_names (one called "bottom", and one named for each
3929 constructor). INCOMPATIBILITY.
3931 * For mutually-recursive domains, separate "reach" and "take_lemma"
3932 rules are generated for each domain, INCOMPATIBILITY.
3934 foo_bar.reach ~> foo.reach bar.reach
3935 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
3937 * Some lemmas generated by the domain package have been renamed for
3938 consistency with the datatype package, INCOMPATIBILITY.
3940 foo.ind ~> foo.induct
3941 foo.finite_ind ~> foo.finite_induct
3942 foo.coind ~> foo.coinduct
3943 foo.casedist ~> foo.exhaust
3944 foo.exhaust ~> foo.nchotomy
3946 * For consistency with other definition packages, the fixrec package
3947 now generates qualified theorem names, INCOMPATIBILITY.
3949 foo_simps ~> foo.simps
3950 foo_unfold ~> foo.unfold
3951 foo_induct ~> foo.induct
3953 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
3954 method and internal fixrec proofs now use the default simpset instead.
3957 * The "contlub" predicate has been removed. Proof scripts should use
3958 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
3960 * The "admw" predicate has been removed, INCOMPATIBILITY.
3962 * The constants cpair, cfst, and csnd have been removed in favor of
3963 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
3968 * Antiquotations for basic formal entities:
3970 @{class NAME} -- type class
3971 @{class_syntax NAME} -- syntax representation of the above
3973 @{type_name NAME} -- logical type
3974 @{type_abbrev NAME} -- type abbreviation
3975 @{nonterminal NAME} -- type of concrete syntactic category
3976 @{type_syntax NAME} -- syntax representation of any of the above
3978 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
3979 @{const_abbrev NAME} -- abbreviated constant
3980 @{const_syntax NAME} -- syntax representation of any of the above
3982 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
3983 syntax constant (cf. 'syntax' command).
3985 * Antiquotation @{make_string} inlines a function to print arbitrary
3986 values similar to the ML toplevel. The result is compiler dependent
3987 and may fall back on "?" in certain situations.
3989 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
3990 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
3991 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
3992 not work with the asynchronous Isar document model.
3994 * Configuration options now admit dynamic default values, depending on
3995 the context or even global references.
3997 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
3998 uses an efficient external library if available (for Poly/ML).
4000 * Renamed some important ML structures, while keeping the old names
4001 for some time as aliases within the structure Legacy:
4003 OuterKeyword ~> Keyword
4006 OuterSyntax ~> Outer_Syntax
4007 PrintMode ~> Print_Mode
4008 SpecParse ~> Parse_Spec
4011 ThyOutput ~> Thy_Output
4012 TypeInfer ~> Type_Infer
4014 Note that "open Legacy" simplifies porting of sources, but forgetting
4015 to remove it again will complicate porting again in the future.
4017 * Most operations that refer to a global context are named
4018 accordingly, e.g. Simplifier.global_context or
4019 ProofContext.init_global. There are some situations where a global
4020 context actually works, but under normal circumstances one needs to
4021 pass the proper local context through the code!
4023 * Discontinued old TheoryDataFun with its copy/init operation -- data
4024 needs to be pure. Functor Theory_Data_PP retains the traditional
4025 Pretty.pp argument to merge, which is absent in the standard
4026 Theory_Data version.
4028 * Sorts.certify_sort and derived "cert" operations for types and terms
4029 no longer minimize sorts. Thus certification at the boundary of the
4030 inference kernel becomes invariant under addition of class relations,
4031 which is an important monotonicity principle. Sorts are now minimized
4032 in the syntax layer only, at the boundary between the end-user and the
4033 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
4034 explicitly in rare situations.
4036 * Renamed old-style Drule.standard to Drule.export_without_context, to
4037 emphasize that this is in no way a standard operation.
4040 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
4041 usual for resolution. Rare INCOMPATIBILITY.
4043 * Renamed varify/unvarify operations to varify_global/unvarify_global
4044 to emphasize that these only work in a global situation (which is
4047 * Curried take and drop in library.ML; negative length is interpreted
4048 as infinity (as in chop). Subtle INCOMPATIBILITY.
4050 * Proof terms: type substitutions on proof constants now use canonical
4051 order of type variables. INCOMPATIBILITY for tools working with proof
4054 * Raw axioms/defs may no longer carry sort constraints, and raw defs
4055 may no longer carry premises. User-level specifications are
4056 transformed accordingly by Thm.add_axiom/add_def.
4061 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
4062 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
4063 proof terms are enabled unconditionally in the new HOL-Proofs image.
4065 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
4066 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
4069 * Old lib/scripts/polyml-platform is superseded by the
4070 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
4071 variant, even on a 64 bit machine. The following example setting
4072 prefers 64 bit if available:
4074 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
4076 * The preliminary Isabelle/jEdit application demonstrates the emerging
4077 Isabelle/Scala layer for advanced prover interaction and integration.
4078 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
4081 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
4082 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
4083 similar to the default assignment of the document preparation system
4084 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
4085 provides some operations for direct access to the font without asking
4086 the user for manual installation.
4090 New in Isabelle2009-1 (December 2009)
4091 -------------------------------------
4095 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
4096 one backslash should be used, even in ML sources.
4101 * Locale interpretation propagates mixins along the locale hierarchy.
4102 The currently only available mixins are the equations used to map
4103 local definitions to terms of the target domain of an interpretation.
4105 * Reactivated diagnostic command 'print_interps'. Use "print_interps
4106 loc" to print all interpretations of locale "loc" in the theory.
4107 Interpretations in proofs are not shown.
4109 * Thoroughly revised locales tutorial. New section on conditional
4112 * On instantiation of classes, remaining undefined class parameters
4113 are formally declared. INCOMPATIBILITY.
4116 *** Document preparation ***
4118 * New generalized style concept for printing terms: @{foo (style) ...}
4119 instead of @{foo_style style ...} (old form is still retained for
4120 backward compatibility). Styles can be also applied for
4121 antiquotations prop, term_type and typeof.
4126 * New proof method "smt" for a combination of first-order logic with
4127 equality, linear and nonlinear (natural/integer/real) arithmetic, and
4128 fixed-size bitvectors; there is also basic support for higher-order
4129 features (esp. lambda abstractions). It is an incomplete decision
4130 procedure based on external SMT solvers using the oracle mechanism;
4131 for the SMT solver Z3, this method is proof-producing. Certificates
4132 are provided to avoid calling the external solvers solely for
4133 re-checking proofs. Due to a remote SMT service there is no need for
4134 installing SMT solvers locally. See src/HOL/SMT.
4136 * New commands to load and prove verification conditions generated by
4137 the Boogie program verifier or derived systems (e.g. the Verifying C
4138 Compiler (VCC) or Spec#). See src/HOL/Boogie.
4140 * New counterexample generator tool 'nitpick' based on the Kodkod
4141 relational model finder. See src/HOL/Tools/Nitpick and
4142 src/HOL/Nitpick_Examples.
4144 * New commands 'code_pred' and 'values' to invoke the predicate
4145 compiler and to enumerate values of inductive predicates.
4147 * A tabled implementation of the reflexive transitive closure.
4149 * New implementation of quickcheck uses generic code generator;
4150 default generators are provided for all suitable HOL types, records
4151 and datatypes. Old quickcheck can be re-activated importing theory
4152 Library/SML_Quickcheck.
4154 * New testing tool Mirabelle for automated proof tools. Applies
4155 several tools and tactics like sledgehammer, metis, or quickcheck, to
4156 every proof step in a theory. To be used in batch mode via the
4157 "mirabelle" utility.
4159 * New proof method "sos" (sum of squares) for nonlinear real
4160 arithmetic (originally due to John Harison). It requires theory
4161 Library/Sum_Of_Squares. It is not a complete decision procedure but
4162 works well in practice on quantifier-free real arithmetic with +, -,
4163 *, ^, =, <= and <, i.e. boolean combinations of equalities and
4164 inequalities between polynomials. It makes use of external
4165 semidefinite programming solvers. Method "sos" generates a
4166 certificate that can be pasted into the proof thus avoiding the need
4167 to call an external tool every time the proof is checked. See
4168 src/HOL/Library/Sum_Of_Squares.
4170 * New method "linarith" invokes existing linear arithmetic decision
4173 * New command 'atp_minimal' reduces result produced by Sledgehammer.
4175 * New Sledgehammer option "Full Types" in Proof General settings menu.
4176 Causes full type information to be output to the ATPs. This slows
4177 ATPs down considerably but eliminates a source of unsound "proofs"
4180 * New method "metisFT": A version of metis that uses full type
4181 information in order to avoid failures of proof reconstruction.
4183 * New evaluator "approximate" approximates an real valued term using
4184 the same method as the approximation method.
4186 * Method "approximate" now supports arithmetic expressions as
4187 boundaries of intervals and implements interval splitting and Taylor
4190 * ML antiquotation @{code_datatype} inserts definition of a datatype
4191 generated by the code generator; e.g. see src/HOL/Predicate.thy.
4193 * New theory SupInf of the supremum and infimum operators for sets of
4196 * New theory Probability, which contains a development of measure
4197 theory, eventually leading to Lebesgue integration and probability.
4199 * Extended Multivariate Analysis to include derivation and Brouwer's
4202 * Reorganization of number theory, INCOMPATIBILITY:
4203 - new number theory development for nat and int, in theories Divides
4204 and GCD as well as in new session Number_Theory
4205 - some constants and facts now suffixed with _nat and _int
4207 - former session NumberTheory now named Old_Number_Theory, including
4208 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
4209 - moved theory Pocklington from src/HOL/Library to
4210 src/HOL/Old_Number_Theory
4212 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
4213 lcm of finite and infinite sets. It is shown that they form a complete
4216 * Class semiring_div requires superclass no_zero_divisors and proof of
4217 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
4218 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
4219 generalized to class semiring_div, subsuming former theorems
4220 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
4221 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
4224 * Refinements to lattice classes and sets:
4225 - less default intro/elim rules in locale variant, more default
4226 intro/elim rules in class variant: more uniformity
4227 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
4229 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
4231 - renamed ACI to inf_sup_aci
4232 - new class "boolean_algebra"
4233 - class "complete_lattice" moved to separate theory
4234 "Complete_Lattice"; corresponding constants (and abbreviations)
4235 renamed and with authentic syntax:
4236 Set.Inf ~> Complete_Lattice.Inf
4237 Set.Sup ~> Complete_Lattice.Sup
4238 Set.INFI ~> Complete_Lattice.INFI
4239 Set.SUPR ~> Complete_Lattice.SUPR
4240 Set.Inter ~> Complete_Lattice.Inter
4241 Set.Union ~> Complete_Lattice.Union
4242 Set.INTER ~> Complete_Lattice.INTER
4243 Set.UNION ~> Complete_Lattice.UNION
4244 - authentic syntax for
4247 - mere abbreviations:
4250 Set.inter (for inf, formerly Set.Int)
4251 Set.union (for sup, formerly Set.Un)
4252 Complete_Lattice.Inter (for Inf)
4253 Complete_Lattice.Union (for Sup)
4254 Complete_Lattice.INTER (for INFI)
4255 Complete_Lattice.UNION (for SUPR)
4256 - object-logic definitions as far as appropriate
4258 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
4259 Un_subset_iff are explicitly deleted as default simp rules; then also
4260 their lattice counterparts le_inf_iff and le_sup_iff have to be
4261 deleted to achieve the desired effect.
4263 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
4264 rules by default any longer; the same applies to min_max.inf_absorb1
4265 etc. INCOMPATIBILITY.
4267 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
4268 pred_set_conv by default. INCOMPATIBILITY.
4270 * Power operations on relations and functions are now one dedicated
4271 constant "compow" with infix syntax "^^". Power operation on
4272 multiplicative monoids retains syntax "^" and is now defined generic
4273 in class power. INCOMPATIBILITY.
4275 * Relation composition "R O S" now has a more standard argument order:
4276 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
4277 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
4278 break, since the O_assoc rule was not rewritten like this. Fix using
4279 O_assoc[symmetric]. The same applies to the curried version "R OO S".
4281 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
4282 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
4285 * Most rules produced by inductive and datatype package have mandatory
4286 prefixes. INCOMPATIBILITY.
4288 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
4289 the attribute of the same name. Each of the theorems in the list
4290 DERIV_intros assumes composition with an additional function and
4291 matches a variable to the derivative, which has to be solved by the
4292 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
4293 of most elementary terms. Former Maclauren.DERIV_tac and
4294 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
4297 * Code generator attributes follow the usual underscore convention:
4298 code_unfold replaces code unfold
4299 code_post replaces code post
4304 sizechange -> size_change
4305 induct_scheme -> induction_schema
4308 * Discontinued abbreviation "arbitrary" of constant "undefined".
4309 INCOMPATIBILITY, use "undefined" directly.
4312 Suc_eq_add_numeral_1 -> Suc_eq_plus1
4313 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
4314 Suc_plus1 -> Suc_eq_plus1
4315 *anti_sym -> *antisym*
4316 vector_less_eq_def -> vector_le_def
4319 * Added theorem List.map_map as [simp]. Removed List.map_compose.
4322 * Removed predicate "M hassize n" (<--> card M = n & finite M).
4328 * Theory Representable defines a class "rep" of domains that are
4329 representable (via an ep-pair) in the universal domain type "udom".
4330 Instances are provided for all type constructors defined in HOLCF.
4332 * The 'new_domain' command is a purely definitional version of the
4333 domain package, for representable domains. Syntax is identical to the
4334 old domain package. The 'new_domain' package also supports indirect
4335 recursion using previously-defined type constructors. See
4336 src/HOLCF/ex/New_Domain.thy for examples.
4338 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
4339 on the left-hand side of an equation, and then performs
4340 simplification. Rewriting is done using rules declared with the
4341 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
4342 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
4344 * The pattern-match compiler in 'fixrec' can now handle constructors
4345 with HOL function types. Pattern-match combinators for the Pair
4346 constructor are pre-configured.
4348 * The 'fixrec' package now produces better fixed-point induction rules
4349 for mutually-recursive definitions: Induction rules have conclusions
4350 of the form "P foo bar" instead of "P <foo, bar>".
4352 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
4353 been renamed to "below". The name "below" now replaces "less" in many
4354 theorem names. (Legacy theorem names using "less" are still supported
4357 * The 'fixrec' package now supports "bottom patterns". Bottom
4358 patterns can be used to generate strictness rules, or to make
4359 functions more strict (much like the bang-patterns supported by the
4360 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
4366 * Support for Poly/ML 5.3.0, with improved reporting of compiler
4367 errors and run-time exceptions, including detailed source positions.
4369 * Structure Name_Space (formerly NameSpace) now manages uniquely
4370 identified entries, with some additional information such as source
4371 position, logical grouping etc.
4373 * Theory and context data is now introduced by the simplified and
4374 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
4375 to be pure, but the old TheoryDataFun for mutable data (with explicit
4376 copy operation) is still available for some time.
4378 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
4379 provides a high-level programming interface to synchronized state
4380 variables with atomic update. This works via pure function
4381 application within a critical section -- its runtime should be as
4382 short as possible; beware of deadlocks if critical code is nested,
4383 either directly or indirectly via other synchronized variables!
4385 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
4386 wraps raw ML references, explicitly indicating their non-thread-safe
4387 behaviour. The Isar toplevel keeps this structure open, to
4388 accommodate Proof General as well as quick and dirty interactive
4389 experiments with references.
4391 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
4392 parallel tactical reasoning.
4394 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
4395 are similar to SUBPROOF, but are slightly more flexible: only the
4396 specified parts of the subgoal are imported into the context, and the
4397 body tactic may introduce new subgoals and schematic variables.
4399 * Old tactical METAHYPS, which does not observe the proof context, has
4400 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
4401 or Subgoal.FOCUS etc.
4403 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
4404 functors have their own ML name space there is no point to mark them
4405 separately.) Minor INCOMPATIBILITY.
4407 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
4409 * Renamed several structures FooBar to Foo_Bar. Occasional,
4412 * Operations of structure Skip_Proof no longer require quick_and_dirty
4413 mode, which avoids critical setmp.
4415 * Eliminated old Attrib.add_attributes, Method.add_methods and related
4416 combinators for "args". INCOMPATIBILITY, need to use simplified
4417 Attrib/Method.setup introduced in Isabelle2009.
4419 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
4420 back on global_simpset_of, global_claset_of, global_clasimpset_of as
4421 last resort. INCOMPATIBILITY.
4423 * Display.pretty_thm now requires a proper context (cf. former
4424 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
4425 or even Display.pretty_thm_without_context as last resort.
4428 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
4429 Syntax.pretty_typ/term directly, preferably with proper context
4430 instead of global theory.
4435 * Further fine tuning of parallel proof checking, scales up to 8 cores
4436 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
4439 * Support for additional "Isabelle components" via etc/components, see
4440 also the system manual.
4442 * The isabelle makeall tool now operates on all components with
4443 IsaMakefile, not just hardwired "logics".
4445 * Removed "compress" option from isabelle-process and isabelle usedir;
4446 this is always enabled.
4448 * Discontinued support for Poly/ML 4.x versions.
4450 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
4451 on a given logic image. This requires the lighttpd webserver and is
4452 currently supported on Linux only.
4456 New in Isabelle2009 (April 2009)
4457 --------------------------------
4461 * Simplified main Isabelle executables, with less surprises on
4462 case-insensitive file-systems (such as Mac OS).
4464 - The main Isabelle tool wrapper is now called "isabelle" instead of
4467 - The former "isabelle" alias for "isabelle-process" has been
4468 removed (should rarely occur to regular users).
4470 - The former "isabelle-interface" and its alias "Isabelle" have been
4471 removed (interfaces are now regular Isabelle tools).
4473 Within scripts and make files, the Isabelle environment variables
4474 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
4475 respectively. (The latter are still available as legacy feature.)
4477 The old isabelle-interface wrapper could react in confusing ways if
4478 the interface was uninstalled or changed otherwise. Individual
4479 interface tool configuration is now more explicit, see also the
4480 Isabelle system manual. In particular, Proof General is now available
4481 via "isabelle emacs".
4483 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
4484 purge installed copies of Isabelle executables and re-run "isabelle
4485 install -p ...", or use symlinks.
4487 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
4488 old ~/isabelle, which was slightly non-standard and apt to cause
4489 surprises on case-insensitive file-systems (such as Mac OS).
4491 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
4492 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
4493 care is required when using older releases of Isabelle. Note that
4494 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
4495 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
4497 * Proofs of fully specified statements are run in parallel on
4498 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
4499 a regular 4-core machine, if the initial heap space is made reasonably
4500 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
4502 * The main reference manuals ("isar-ref", "implementation", and
4503 "system") have been updated and extended. Formally checked references
4504 as hyperlinks are now available uniformly.
4509 * Complete re-implementation of locales. INCOMPATIBILITY in several
4510 respects. The most important changes are listed below. See the
4511 Tutorial on Locales ("locales" manual) for details.
4513 - In locale expressions, instantiation replaces renaming. Parameters
4514 must be declared in a for clause. To aid compatibility with previous
4515 parameter inheritance, in locale declarations, parameters that are not
4516 'touched' (instantiation position "_" or omitted) are implicitly added
4517 with their syntax at the beginning of the for clause.
4519 - Syntax from abbreviations and definitions in locales is available in
4520 locale expressions and context elements. The latter is particularly
4521 useful in locale declarations.
4523 - More flexible mechanisms to qualify names generated by locale
4524 expressions. Qualifiers (prefixes) may be specified in locale
4525 expressions, and can be marked as mandatory (syntax: "name!:") or
4526 optional (syntax "name?:"). The default depends for plain "name:"
4527 depends on the situation where a locale expression is used: in
4528 commands 'locale' and 'sublocale' prefixes are optional, in
4529 'interpretation' and 'interpret' prefixes are mandatory. The old
4530 implicit qualifiers derived from the parameter names of a locale are
4531 no longer generated.
4533 - Command "sublocale l < e" replaces "interpretation l < e". The
4534 instantiation clause in "interpretation" and "interpret" (square
4535 brackets) is no longer available. Use locale expressions.
4537 - When converting proof scripts, mandatory qualifiers in
4538 'interpretation' and 'interpret' should be retained by default, even
4539 if this is an INCOMPATIBILITY compared to former behavior. In the
4540 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
4541 in locale expressions range over a single locale instance only.
4543 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
4544 In existing theorem specifications replace the includes element by the
4545 respective context elements of the included locale, omitting those
4546 that are already present in the theorem specification. Multiple
4547 assume elements of a locale should be replaced by a single one
4548 involving the locale predicate. In the proof body, declarations (most
4549 notably theorems) may be regained by interpreting the respective
4550 locales in the proof context as required (command "interpret").
4552 If using "includes" in replacement of a target solely because the
4553 parameter types in the theorem are not as general as in the target,
4554 consider declaring a new locale with additional type constraints on
4555 the parameters (context element "constrains").
4557 - Discontinued "locale (open)". INCOMPATIBILITY.
4559 - Locale interpretation commands no longer attempt to simplify goal.
4560 INCOMPATIBILITY: in rare situations the generated goal differs. Use
4561 methods intro_locales and unfold_locales to clarify.
4563 - Locale interpretation commands no longer accept interpretation
4564 attributes. INCOMPATIBILITY.
4566 * Class declaration: so-called "base sort" must not be given in import
4567 list any longer, but is inferred from the specification. Particularly
4574 class foo = type + ...
4576 * Class target: global versions of theorems stemming do not carry a
4577 parameter prefix any longer. INCOMPATIBILITY.
4579 * Class 'instance' command no longer accepts attached definitions.
4580 INCOMPATIBILITY, use proper 'instantiation' target instead.
4582 * Recovered hiding of consts, which was accidentally broken in
4583 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
4584 makes c inaccessible; consider using ``hide (open) const c'' instead.
4586 * Slightly more coherent Pure syntax, with updated documentation in
4587 isar-ref manual. Removed locales meta_term_syntax and
4588 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
4589 INCOMPATIBILITY in rare situations. Note that &&& should not be used
4590 directly in regular applications.
4592 * There is a new syntactic category "float_const" for signed decimal
4593 fractions (e.g. 123.45 or -123.45).
4595 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
4596 interface with 'setup' command instead.
4598 * Command 'local_setup' is similar to 'setup', but operates on a local
4601 * The 'axiomatization' command now only works within a global theory
4602 context. INCOMPATIBILITY.
4604 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
4605 hypotheses. Sorts required in the course of reasoning need to be
4606 covered by the constraints in the initial statement, completed by the
4607 type instance information of the background theory. Non-trivial sort
4608 hypotheses, which rarely occur in practice, may be specified via
4609 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
4611 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
4613 The result contains an implicit sort hypotheses as before --
4614 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
4617 * Generalized Isar history, with support for linear undo, direct state
4620 * Changed defaults for unify configuration options:
4622 unify_trace_bound = 50 (formerly 25)
4623 unify_search_bound = 60 (formerly 30)
4625 * Different bookkeeping for code equations (INCOMPATIBILITY):
4627 a) On theory merge, the last set of code equations for a particular
4628 constant is taken (in accordance with the policy applied by other
4629 parts of the code generator framework).
4631 b) Code equations stemming from explicit declarations (e.g. code
4632 attribute) gain priority over default code equations stemming
4633 from definition, primrec, fun etc.
4635 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
4637 * Unified theorem tables for both code generators. Thus [code
4638 func] has disappeared and only [code] remains. INCOMPATIBILITY.
4640 * Command 'find_consts' searches for constants based on type and name
4643 find_consts "_ => bool"
4645 By default, matching is against subtypes, but it may be restricted to
4646 the whole type. Searching by name is possible. Multiple queries are
4647 conjunctive and queries may be negated by prefixing them with a
4650 find_consts strict: "_ => bool" name: "Int" -"int => int"
4652 * New 'find_theorems' criterion "solves" matches theorems that
4653 directly solve the current goal (modulo higher-order unification).
4655 * Auto solve feature for main theorem statements: whenever a new goal
4656 is stated, "find_theorems solves" is called; any theorems that could
4657 solve the lemma directly are listed as part of the goal state.
4658 Cf. associated options in Proof General Isabelle settings menu,
4659 enabled by default, with reasonable timeout for pathological cases of
4660 higher-order unification.
4663 *** Document preparation ***
4665 * Antiquotation @{lemma} now imitates a regular terminal proof,
4666 demanding keyword 'by' and supporting the full method expression
4667 syntax just like the Isar command 'by'.
4672 * Integrated main parts of former image HOL-Complex with HOL. Entry
4673 points Main and Complex_Main remain as before.
4675 * Logic image HOL-Plain provides a minimal HOL with the most important
4676 tools available (inductive, datatype, primrec, ...). This facilitates
4677 experimentation and tool development. Note that user applications
4678 (and library theories) should never refer to anything below theory
4681 * Logic image HOL-Main stops at theory Main, and thus facilitates
4682 experimentation due to shorter build times.
4684 * Logic image HOL-NSA contains theories of nonstandard analysis which
4685 were previously part of former HOL-Complex. Entry point Hyperreal
4686 remains valid, but theories formerly using Complex_Main should now use
4687 new entry point Hypercomplex.
4689 * Generic ATP manager for Sledgehammer, based on ML threads instead of
4690 Posix processes. Avoids potentially expensive forking of the ML
4691 process. New thread-based implementation also works on non-Unix
4692 platforms (Cygwin). Provers are no longer hardwired, but defined
4693 within the theory via plain ML wrapper functions. Basic Sledgehammer
4694 commands are covered in the isar-ref manual.
4696 * Wrapper scripts for remote SystemOnTPTP service allows to use
4697 sledgehammer without local ATP installation (Vampire etc.). Other
4698 provers may be included via suitable ML wrappers, see also
4699 src/HOL/ATP_Linkup.thy.
4701 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
4704 * The metis method no longer fails because the theorem is too trivial
4705 (contains the empty clause).
4707 * The metis method now fails in the usual manner, rather than raising
4708 an exception, if it determines that it cannot prove the theorem.
4710 * Method "coherent" implements a prover for coherent logic (see also
4711 src/Tools/coherent.ML).
4713 * Constants "undefined" and "default" replace "arbitrary". Usually
4714 "undefined" is the right choice to replace "arbitrary", though
4715 logically there is no difference. INCOMPATIBILITY.
4717 * Command "value" now integrates different evaluation mechanisms. The
4718 result of the first successful evaluation mechanism is printed. In
4719 square brackets a particular named evaluation mechanisms may be
4720 specified (currently, [SML], [code] or [nbe]). See further
4721 src/HOL/ex/Eval_Examples.thy.
4723 * Normalization by evaluation now allows non-leftlinear equations.
4724 Declare with attribute [code nbe].
4726 * Methods "case_tac" and "induct_tac" now refer to the very same rules
4727 as the structured Isar versions "cases" and "induct", cf. the
4728 corresponding "cases" and "induct" attributes. Mutual induction rules
4729 are now presented as a list of individual projections
4730 (e.g. foo_bar.inducts for types foo and bar); the old format with
4731 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
4732 rare situations a different rule is selected --- notably nested tuple
4733 elimination instead of former prod.exhaust: use explicit (case_tac t
4734 rule: prod.exhaust) here.
4736 * Attributes "cases", "induct", "coinduct" support "del" option.
4738 * Removed fact "case_split_thm", which duplicates "case_split".
4740 * The option datatype has been moved to a new theory Option. Renamed
4741 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
4743 * New predicate "strict_mono" classifies strict functions on partial
4744 orders. With strict functions on linear orders, reasoning about
4745 (in)equalities is facilitated by theorems "strict_mono_eq",
4746 "strict_mono_less_eq" and "strict_mono_less".
4748 * Some set operations are now proper qualified constants with
4749 authentic syntax. INCOMPATIBILITY:
4760 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
4763 * Auxiliary class "itself" has disappeared -- classes without any
4764 parameter are treated as expected by the 'class' command.
4766 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
4768 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
4769 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
4771 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
4772 method "approximation". It proves formulas on real values by using
4773 interval arithmetic. In the formulas are also the transcendental
4774 functions sin, cos, tan, atan, ln, exp and the constant pi are
4775 allowed. For examples see
4776 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
4778 * Theory "Reflection" now resides in HOL/Library.
4780 * Entry point to Word library now simply named "Word".
4783 * Made source layout more coherent with logical distribution
4786 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
4787 src/HOL/Library/Code_Message.thy ~> src/HOL/
4788 src/HOL/Library/GCD.thy ~> src/HOL/
4789 src/HOL/Library/Order_Relation.thy ~> src/HOL/
4790 src/HOL/Library/Parity.thy ~> src/HOL/
4791 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
4792 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
4793 src/HOL/Real/Lubs.thy ~> src/HOL/
4794 src/HOL/Real/PReal.thy ~> src/HOL/
4795 src/HOL/Real/Rational.thy ~> src/HOL/
4796 src/HOL/Real/RComplete.thy ~> src/HOL/
4797 src/HOL/Real/RealDef.thy ~> src/HOL/
4798 src/HOL/Real/RealPow.thy ~> src/HOL/
4799 src/HOL/Real/Real.thy ~> src/HOL/
4800 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
4801 src/HOL/Complex/Complex.thy ~> src/HOL/
4802 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
4803 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
4804 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
4805 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
4806 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
4807 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
4808 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
4809 src/HOL/Hyperreal/Log.thy ~> src/HOL/
4810 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
4811 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
4812 src/HOL/Hyperreal/Series.thy ~> src/HOL/
4813 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
4814 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
4815 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
4816 src/HOL/Real/Float ~> src/HOL/Library/
4817 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
4818 src/HOL/Real/RealVector.thy ~> src/HOL/
4820 src/HOL/arith_data.ML ~> src/HOL/Tools
4821 src/HOL/hologic.ML ~> src/HOL/Tools
4822 src/HOL/simpdata.ML ~> src/HOL/Tools
4823 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
4824 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
4825 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
4826 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
4827 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
4828 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
4829 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
4831 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
4832 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
4833 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
4834 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
4835 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
4836 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
4838 * If methods "eval" and "evaluation" encounter a structured proof
4839 state with !!/==>, only the conclusion is evaluated to True (if
4840 possible), avoiding strange error messages.
4842 * Method "sizechange" automates termination proofs using (a
4843 modification of) the size-change principle. Requires SAT solver. See
4844 src/HOL/ex/Termination.thy for examples.
4846 * Simplifier: simproc for let expressions now unfolds if bound
4847 variable occurs at most once in let expression body. INCOMPATIBILITY.
4849 * Method "arith": Linear arithmetic now ignores all inequalities when
4850 fast_arith_neq_limit is exceeded, instead of giving up entirely.
4852 * New attribute "arith" for facts that should always be used
4853 automatically by arithmetic. It is intended to be used locally in
4856 assumes [arith]: "x > 0"
4858 Global usage is discouraged because of possible performance impact.
4860 * New classes "top" and "bot" with corresponding operations "top" and
4861 "bot" in theory Orderings; instantiation of class "complete_lattice"
4862 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
4864 * Changed definition lemma "less_fun_def" in order to provide an
4865 instance for preorders on functions; use lemma "less_le" instead.
4868 * Theory Orderings: class "wellorder" moved here, with explicit
4869 induction rule "less_induct" as assumption. For instantiation of
4870 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
4873 * Theory Orderings: added class "preorder" as superclass of "order".
4874 INCOMPATIBILITY: Instantiation proofs for order, linorder
4875 etc. slightly changed. Some theorems named order_class.* now named
4878 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
4881 * Theory Finite_Set: added a new fold combinator of type
4883 ('a => 'b => 'b) => 'b => 'a set => 'b
4885 Occasionally this is more convenient than the old fold combinator
4886 which is now defined in terms of the new one and renamed to
4889 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
4890 and "ring_simps" have been replaced by "algebra_simps" (which can be
4891 extended with further lemmas!). At the moment both still exist but
4892 the former will disappear at some point.
4894 * Theory Power: Lemma power_Suc is now declared as a simp rule in
4895 class recpower. Type-specific simp rules for various recpower types
4896 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
4898 rat_power_0 -> power_0
4899 rat_power_Suc -> power_Suc
4900 realpow_0 -> power_0
4901 realpow_Suc -> power_Suc
4902 complexpow_0 -> power_0
4903 complexpow_Suc -> power_Suc
4904 power_poly_0 -> power_0
4905 power_poly_Suc -> power_Suc
4907 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
4908 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
4909 dvd has been generalized to class comm_semiring_1. Likewise a bunch
4910 of lemmas from Divides has been generalized from nat to class
4911 semiring_div. INCOMPATIBILITY. This involves the following theorem
4912 renames resulting from duplicate elimination:
4914 dvd_def_mod ~> dvd_eq_mod_eq_0
4915 zero_dvd_iff ~> dvd_0_left_iff
4916 dvd_0 ~> dvd_0_right
4917 DIVISION_BY_ZERO_DIV ~> div_by_0
4918 DIVISION_BY_ZERO_MOD ~> mod_by_0
4919 mult_div ~> div_mult_self2_is_id
4920 mult_mod ~> mod_mult_self2_is_0
4922 * Theory IntDiv: removed many lemmas that are instances of class-based
4923 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
4924 rename old lemmas as follows:
4926 dvd_diff -> nat_dvd_diff
4927 dvd_zminus_iff -> dvd_minus_iff
4928 mod_add1_eq -> mod_add_eq
4929 mod_mult1_eq -> mod_mult_right_eq
4930 mod_mult1_eq' -> mod_mult_left_eq
4931 mod_mult_distrib_mod -> mod_mult_eq
4932 nat_mod_add_left_eq -> mod_add_left_eq
4933 nat_mod_add_right_eq -> mod_add_right_eq
4934 nat_mod_div_trivial -> mod_div_trivial
4935 nat_mod_mod_trivial -> mod_mod_trivial
4936 zdiv_zadd_self1 -> div_add_self1
4937 zdiv_zadd_self2 -> div_add_self2
4938 zdiv_zmult_self1 -> div_mult_self2_is_id
4939 zdiv_zmult_self2 -> div_mult_self1_is_id
4940 zdvd_triv_left -> dvd_triv_left
4941 zdvd_triv_right -> dvd_triv_right
4942 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
4943 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
4944 zmod_zadd_left_eq -> mod_add_left_eq
4945 zmod_zadd_right_eq -> mod_add_right_eq
4946 zmod_zadd_self1 -> mod_add_self1
4947 zmod_zadd_self2 -> mod_add_self2
4948 zmod_zadd1_eq -> mod_add_eq
4949 zmod_zdiff1_eq -> mod_diff_eq
4950 zmod_zdvd_zmod -> mod_mod_cancel
4951 zmod_zmod_cancel -> mod_mod_cancel
4952 zmod_zmult_self1 -> mod_mult_self2_is_0
4953 zmod_zmult_self2 -> mod_mult_self1_is_0
4956 zdvd_abs1 -> abs_dvd_iff
4957 zdvd_abs2 -> dvd_abs_iff
4958 zdvd_refl -> dvd_refl
4959 zdvd_trans -> dvd_trans
4960 zdvd_zadd -> dvd_add
4961 zdvd_zdiff -> dvd_diff
4962 zdvd_zminus_iff -> dvd_minus_iff
4963 zdvd_zminus2_iff -> minus_dvd_iff
4964 zdvd_zmultD -> dvd_mult_right
4965 zdvd_zmultD2 -> dvd_mult_left
4966 zdvd_zmult_mono -> mult_dvd_mono
4967 zdvd_0_right -> dvd_0_right
4968 zdvd_0_left -> dvd_0_left_iff
4969 zdvd_1_left -> one_dvd
4970 zminus_dvd_iff -> minus_dvd_iff
4972 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
4974 * The real numbers offer decimal input syntax: 12.34 is translated
4975 into 1234/10^2. This translation is not reversed upon output.
4977 * Theory Library/Polynomial defines an abstract type 'a poly of
4978 univariate polynomials with coefficients of type 'a. In addition to
4979 the standard ring operations, it also supports div and mod. Code
4980 generation is also supported, using list-style constructors.
4982 * Theory Library/Inner_Product defines a class of real_inner for real
4983 inner product spaces, with an overloaded operation inner :: 'a => 'a
4984 => real. Class real_inner is a subclass of real_normed_vector from
4987 * Theory Library/Product_Vector provides instances for the product
4988 type 'a * 'b of several classes from RealVector and Inner_Product.
4989 Definitions of addition, subtraction, scalar multiplication, norms,
4990 and inner products are included.
4992 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
4993 addition to the field operations, numerals and case syntax are also
4996 * Theory Library/Diagonalize provides constructive version of Cantor's
4997 first diagonalization argument.
4999 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
5000 zlcm (for int); carried together from various gcd/lcm developements in
5001 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
5002 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
5003 may recover tupled syntax as follows:
5005 hide (open) const gcd
5006 abbreviation gcd where
5007 "gcd == (%(a, b). GCD.gcd a b)"
5009 GCD.gcd ("gcd '(_, _')")
5011 The same works for lcm, zgcd, zlcm.
5013 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
5014 instantiations for algebraic structures. Removed some duplicate
5015 theorems. Changes in simp rules. INCOMPATIBILITY.
5017 * ML antiquotation @{code} takes a constant as argument and generates
5018 corresponding code in background and inserts name of the corresponding
5019 resulting ML value/function/datatype constructor binding in place.
5020 All occurrences of @{code} with a single ML block are generated
5021 simultaneously. Provides a generic and safe interface for
5022 instrumentalizing code generation. See
5023 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
5024 In future you ought to refrain from ad-hoc compiling generated SML
5025 code on the ML toplevel. Note that (for technical reasons) @{code}
5026 cannot refer to constants for which user-defined serializations are
5027 set. Refer to the corresponding ML counterpart directly in that
5030 * Command 'rep_datatype': instead of theorem names the command now
5031 takes a list of terms denoting the constructors of the type to be
5032 represented as datatype. The characteristic theorems have to be
5033 proven. INCOMPATIBILITY. Also observe that the following theorems
5034 have disappeared in favour of existing ones:
5036 unit_induct ~> unit.induct
5037 prod_induct ~> prod.induct
5038 sum_induct ~> sum.induct
5039 Suc_Suc_eq ~> nat.inject
5040 Suc_not_Zero Zero_not_Suc ~> nat.distinct
5045 * New locales for orders and lattices where the equivalence relation
5046 is not restricted to equality. INCOMPATIBILITY: all order and lattice
5047 locales use a record structure with field eq for the equivalence.
5049 * New theory of factorial domains.
5051 * Units_l_inv and Units_r_inv are now simp rules by default.
5052 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
5053 and/or r_inv will now also require deletion of these lemmas.
5055 * Renamed the following theorems, INCOMPATIBILITY:
5057 UpperD ~> Upper_memD
5058 LowerD ~> Lower_memD
5059 least_carrier ~> least_closed
5060 greatest_carrier ~> greatest_closed
5061 greatest_Lower_above ~> greatest_Lower_below
5062 one_zero ~> carrier_one_zero
5063 one_not_zero ~> carrier_one_not_zero (collision with assumption)
5068 * Nominal datatypes can now contain type-variables.
5070 * Commands 'nominal_inductive' and 'equivariance' work with local
5073 * Nominal primrec can now works with local theory targets and its
5074 specification syntax now conforms to the general format as seen in
5077 * Method "perm_simp" honours the standard simplifier attributes
5078 (no_asm), (no_asm_use) etc.
5080 * The new predicate #* is defined like freshness, except that on the
5081 left hand side can be a set or list of atoms.
5083 * Experimental command 'nominal_inductive2' derives strong induction
5084 principles for inductive definitions. In contrast to
5085 'nominal_inductive', which can only deal with a fixed number of
5086 binders, it can deal with arbitrary expressions standing for sets of
5087 atoms to be avoided. The only inductive definition we have at the
5088 moment that needs this generalisation is the typing rule for Lets in
5091 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
5092 -----------------------------------------------------------------
5093 Gamma |- Let x be t1 in t2 : T2
5095 In this rule one wants to avoid all the binders that are introduced by
5096 "close Gamma T1". We are looking for other examples where this
5097 feature might be useful. Please let us know.
5102 * Reimplemented the simplification procedure for proving continuity
5103 subgoals. The new simproc is extensible; users can declare additional
5104 continuity introduction rules with the attribute [cont2cont].
5106 * The continuity simproc now uses a different introduction rule for
5107 solving continuity subgoals on terms with lambda abstractions. In
5108 some rare cases the new simproc may fail to solve subgoals that the
5109 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
5110 Potential INCOMPATIBILITY.
5112 * Command 'fixrec': specification syntax now conforms to the general
5113 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
5114 examples. INCOMPATIBILITY.
5119 * Proof of Zorn's Lemma for partial orders.
5124 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
5125 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
5126 depends on multithreading, so timouts will not work before Poly/ML
5129 * High-level support for concurrent ML programming, see
5130 src/Pure/Cuncurrent. The data-oriented model of "future values" is
5131 particularly convenient to organize independent functional
5132 computations. The concept of "synchronized variables" provides a
5133 higher-order interface for components with shared state, avoiding the
5134 delicate details of mutexes and condition variables. (Requires
5135 Poly/ML 5.2.1 or later.)
5137 * ML bindings produced via Isar commands are stored within the Isar
5138 context (theory or proof). Consequently, commands like 'use' and 'ML'
5139 become thread-safe and work with undo as expected (concerning
5140 top-level bindings, not side-effects on global references).
5141 INCOMPATIBILITY, need to provide proper Isar context when invoking the
5142 compiler at runtime; really global bindings need to be given outside a
5143 theory. (Requires Poly/ML 5.2 or later.)
5145 * Command 'ML_prf' is analogous to 'ML' but works within a proof
5146 context. Top-level ML bindings are stored within the proof context in
5147 a purely sequential fashion, disregarding the nested proof structure.
5148 ML bindings introduced by 'ML_prf' are discarded at the end of the
5149 proof. (Requires Poly/ML 5.2 or later.)
5151 * Simplified ML attribute and method setup, cf. functions Attrib.setup
5152 and Method.setup, as well as Isar commands 'attribute_setup' and
5153 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
5154 existing code accordingly, or use plain 'setup' together with old
5157 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
5158 to 'a -> thm, while results are always tagged with an authentic oracle
5159 name. The Isar command 'oracle' is now polymorphic, no argument type
5160 is specified. INCOMPATIBILITY, need to simplify existing oracle code
5161 accordingly. Note that extra performance may be gained by producing
5162 the cterm carefully, avoiding slow Thm.cterm_of.
5164 * Simplified interface for defining document antiquotations via
5165 ThyOutput.antiquotation, ThyOutput.output, and optionally
5166 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
5167 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
5170 * More systematic treatment of long names, abstract name bindings, and
5171 name space operations. Basic operations on qualified names have been
5172 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
5173 Long_Name.append. Old type bstring has been mostly replaced by
5174 abstract type binding (see structure Binding), which supports precise
5175 qualification by packages and local theory targets, as well as proper
5176 tracking of source positions. INCOMPATIBILITY, need to wrap old
5177 bstring values into Binding.name, or better pass through abstract
5178 bindings everywhere. See further src/Pure/General/long_name.ML,
5179 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
5181 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
5182 LocalTheory.note etc.) now refer to the *full* internal name, not the
5183 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
5185 * Disposed old type and term read functions (Sign.read_def_typ,
5186 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
5187 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
5188 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
5189 Syntax.read_term_global etc.; see also OldGoals.read_term as last
5190 resort for legacy applications.
5192 * Disposed old declarations, tactics, tactic combinators that refer to
5193 the simpset or claset of an implicit theory (such as Addsimps,
5194 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
5195 embedded ML text, or local_simpset_of with a proper context passed as
5196 explicit runtime argument.
5198 * Rules and tactics that read instantiations (read_instantiate,
5199 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
5200 context, which is required for parsing and type-checking. Moreover,
5201 the variables are specified as plain indexnames, not string encodings
5202 thereof. INCOMPATIBILITY.
5204 * Generic Toplevel.add_hook interface allows to analyze the result of
5205 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
5206 for theorem dependency output of transactions resulting in a new
5209 * ML antiquotations: block-structured compilation context indicated by
5210 \<lbrace> ... \<rbrace>; additional antiquotation forms:
5212 @{binding name} - basic name binding
5213 @{let ?pat = term} - term abbreviation (HO matching)
5214 @{note name = fact} - fact abbreviation
5215 @{thm fact} - singleton fact (with attributes)
5216 @{thms fact} - general fact (with attributes)
5217 @{lemma prop by method} - singleton goal
5218 @{lemma prop by meth1 meth2} - singleton goal
5219 @{lemma prop1 ... propN by method} - general goal
5220 @{lemma prop1 ... propN by meth1 meth2} - general goal
5221 @{lemma (open) ...} - open derivation
5226 * The Isabelle "emacs" tool provides a specific interface to invoke
5227 Proof General / Emacs, with more explicit failure if that is not
5228 installed (the old isabelle-interface script silently falls back on
5229 isabelle-process). The PROOFGENERAL_HOME setting determines the
5230 installation location of the Proof General distribution.
5232 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
5233 the Isabelle process into a JVM/Scala application. See
5234 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
5235 process wrapper has been discontinued.)
5237 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
5239 * Various status messages (with exact source position information) are
5240 emitted, if proper markup print mode is enabled. This allows
5241 user-interface components to provide detailed feedback on internal
5246 New in Isabelle2008 (June 2008)
5247 -------------------------------
5251 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
5252 and updated, with formally checked references as hyperlinks.
5254 * Theory loader: use_thy (and similar operations) no longer set the
5255 implicit ML context, which was occasionally hard to predict and in
5256 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
5257 provides a proper context already.
5259 * Theory loader: old-style ML proof scripts being *attached* to a thy
5260 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
5261 'use' within a theory file will do the job.
5263 * Name space merge now observes canonical order, i.e. the second space
5264 is inserted into the first one, while existing entries in the first
5265 space take precedence. INCOMPATIBILITY in rare situations, may try to
5266 swap theory imports.
5268 * Syntax: symbol \<chi> is now considered a letter. Potential
5269 INCOMPATIBILITY in identifier syntax etc.
5271 * Outer syntax: string tokens no longer admit escaped white space,
5272 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
5273 white space without escapes.
5275 * Outer syntax: string tokens may contain arbitrary character codes
5276 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
5282 * Context-dependent token translations. Default setup reverts locally
5283 fixed variables, and adds hilite markup for undeclared frees.
5285 * Unused theorems can be found using the new command 'unused_thms'.
5286 There are three ways of invoking it:
5289 Only finds unused theorems in the current theory.
5291 (2) unused_thms thy_1 ... thy_n -
5292 Finds unused theorems in the current theory and all of its ancestors,
5293 excluding the theories thy_1 ... thy_n and all of their ancestors.
5295 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
5296 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
5297 their ancestors, excluding the theories thy_1 ... thy_n and all of
5300 In order to increase the readability of the list produced by
5301 unused_thms, theorems that have been created by a particular instance
5302 of a theory command such as 'inductive' or 'function' are considered
5303 to belong to the same "group", meaning that if at least one theorem in
5304 this group is used, the other theorems in the same group are no longer
5305 reported as unused. Moreover, if all theorems in the group are
5306 unused, only one theorem in the group is displayed.
5308 Note that proof objects have to be switched on in order for
5309 unused_thms to work properly (i.e. !proofs must be >= 1, which is
5310 usually the case when using Proof General with the default settings).
5312 * Authentic naming of facts disallows ad-hoc overwriting of previous
5313 theorems within the same name space. INCOMPATIBILITY, need to remove
5314 duplicate fact bindings, or even accidental fact duplications. Note
5315 that tools may maintain dynamically scoped facts systematically, using
5316 PureThy.add_thms_dynamic.
5318 * Command 'hide' now allows to hide from "fact" name space as well.
5320 * Eliminated destructive theorem database, simpset, claset, and
5321 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
5322 update of theories within ML code.
5324 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
5325 INCOMPATIBILITY, object-logics depending on former Pure require
5326 additional setup PureThy.old_appl_syntax_setup; object-logics
5327 depending on former CPure need to refer to Pure.
5329 * Commands 'use' and 'ML' are now purely functional, operating on
5330 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
5331 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
5334 * Command 'setup': discontinued implicit version with ML reference.
5336 * Instantiation target allows for simultaneous specification of class
5337 instance operations together with an instantiation proof.
5338 Type-checking phase allows to refer to class operations uniformly.
5339 See src/HOL/Complex/Complex.thy for an Isar example and
5340 src/HOL/Library/Eval.thy for an ML example.
5342 * Indexing of literal facts: be more serious about including only
5343 facts from the visible specification/proof context, but not the
5344 background context (locale etc.). Affects `prop` notation and method
5345 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
5348 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
5349 "(open)" option, which used to expose internal bound variables to the
5352 * Isar statements: removed obsolete case "rule_context".
5353 INCOMPATIBILITY, better use explicit fixes/assumes.
5355 * Locale proofs: default proof step now includes 'unfold_locales';
5356 hence 'proof' without argument may be used to unfold locale
5360 *** Document preparation ***
5362 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
5363 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
5364 obsolete thumbpdf setup (contemporary PDF viewers do this on the
5365 spot); renamed link color from "darkblue" to "linkcolor" (default
5366 value unchanged, can be redefined via \definecolor); no longer sets
5367 "a4paper" option (unnecessary or even intrusive).
5369 * Antiquotation @{lemma A method} proves proposition A by the given
5370 method (either a method name or a method name plus (optional) method
5371 arguments in parentheses) and prints A just like @{prop A}.
5376 * New primrec package. Specification syntax conforms in style to
5377 definition/function/.... No separate induction rule is provided. The
5378 "primrec" command distinguishes old-style and new-style specifications
5379 by syntax. The former primrec package is now named OldPrimrecPackage.
5380 When adjusting theories, beware: constants stemming from new-style
5381 primrec specifications have authentic syntax.
5383 * Metis prover is now an order of magnitude faster, and also works
5384 with multithreading.
5386 * Metis: the maximum number of clauses that can be produced from a
5387 theorem is now given by the attribute max_clauses. Theorems that
5388 exceed this number are ignored, with a warning printed.
5390 * Sledgehammer no longer produces structured proofs by default. To
5391 enable, declare [[sledgehammer_full = true]]. Attributes
5392 reconstruction_modulus, reconstruction_sorts renamed
5393 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
5395 * Method "induct_scheme" derives user-specified induction rules
5396 from well-founded induction and completeness of patterns. This factors
5397 out some operations that are done internally by the function package
5398 and makes them available separately. See
5399 src/HOL/ex/Induction_Scheme.thy for examples.
5401 * More flexible generation of measure functions for termination
5402 proofs: Measure functions can be declared by proving a rule of the
5403 form "is_measure f" and giving it the [measure_function] attribute.
5404 The "is_measure" predicate is logically meaningless (always true), and
5405 just guides the heuristic. To find suitable measure functions, the
5406 termination prover sets up the goal "is_measure ?f" of the appropriate
5407 type and generates all solutions by prolog-style backwards proof using
5410 This setup also deals with rules like
5412 "is_measure f ==> is_measure (list_size f)"
5414 which accommodates nested datatypes that recurse through lists.
5415 Similar rules are predeclared for products and option types.
5417 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
5421 - Definitions of overloaded constants on sets have to be replaced by
5422 definitions on => and bool.
5424 - Some definitions of overloaded operators on sets can now be proved
5425 using the definitions of the operators on => and bool. Therefore,
5426 the following theorems have been renamed:
5428 subset_def -> subset_eq
5429 psubset_def -> psubset_eq
5430 set_diff_def -> set_diff_eq
5431 Compl_def -> Compl_eq
5432 Sup_set_def -> Sup_set_eq
5433 Inf_set_def -> Inf_set_eq
5434 sup_set_def -> sup_set_eq
5435 inf_set_def -> inf_set_eq
5437 - Due to the incompleteness of the HO unification algorithm, some
5438 rules such as subst may require manual instantiation, if some of
5439 the unknowns in the rule is a set.
5441 - Higher order unification and forward proofs:
5444 have "P (S::'a set)" <...>
5445 then have "EX S. P S" ..
5447 no longer works (due to the incompleteness of the HO unification
5448 algorithm) and must be replaced by the pattern
5455 - Calculational reasoning with subst (or similar rules):
5458 have "P (S::'a set)" <...>
5459 also have "S = T" <...>
5460 finally have "P T" .
5462 no longer works (for similar reasons as the previous example) and
5463 must be replaced by something like
5465 have "P (S::'a set)" <...>
5466 moreover have "S = T" <...>
5467 ultimately have "P T" by simp
5469 - Tactics or packages written in ML code:
5470 Code performing pattern matching on types via
5472 Type ("set", [T]) => ...
5474 must be rewritten. Moreover, functions like strip_type or
5475 binder_types no longer return the right value when applied to a
5478 T1 => ... => Tn => U => bool
5482 T1 => ... => Tn => U set
5484 * Merged theories Wellfounded_Recursion, Accessible_Part and
5485 Wellfounded_Relations to theory Wellfounded.
5487 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
5489 * Class finite no longer treats UNIV as class parameter. Use class
5490 enum from theory Library/Enum instead to achieve a similar effect.
5493 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
5494 and "Cons". INCOMPATIBILITY.
5496 * HOL (and FOL): renamed variables in rules imp_elim and swap.
5497 Potential INCOMPATIBILITY.
5499 * Theory Product_Type: duplicated lemmas split_Pair_apply and
5500 injective_fst_snd removed, use split_eta and prod_eqI instead.
5501 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
5503 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
5504 the same name in theory Orderings:
5514 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
5515 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
5516 and different variable names.
5518 * Library/Option_ord.thy: Canonical order on option type.
5520 * Library/RBT.thy: Red-black trees, an efficient implementation of
5523 * Library/Countable.thy: Type class for countable types.
5525 * Theory Int: The representation of numerals has changed. The infix
5526 operator BIT and the bit datatype with constructors B0 and B1 have
5527 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
5528 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
5529 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
5532 * Theory Nat: definition of <= and < on natural numbers no longer
5533 depend on well-founded relations. INCOMPATIBILITY. Definitions
5534 le_def and less_def have disappeared. Consider lemmas not_less
5535 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
5537 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
5538 (whose purpose mainly is for various fold_set functionals) have been
5539 abandoned in favor of the existing algebraic classes
5540 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
5541 lower_semilattice (resp. upper_semilattice) and linorder.
5544 * Theory Transitive_Closure: induct and cases rules now declare proper
5545 case_names ("base" and "step"). INCOMPATIBILITY.
5547 * Theorem Inductive.lfp_ordinal_induct generalized to complete
5548 lattices. The form set-specific version is available as
5549 Inductive.lfp_ordinal_induct_set.
5551 * Renamed theorems "power.simps" to "power_int.simps".
5554 * Class semiring_div provides basic abstract properties of semirings
5555 with division and modulo operations. Subsumes former class dvd_mod.
5557 * Merged theories IntDef, Numeral and IntArith into unified theory
5558 Int. INCOMPATIBILITY.
5560 * Theory Library/Code_Index: type "index" now represents natural
5561 numbers rather than integers. INCOMPATIBILITY.
5563 * New class "uminus" with operation "uminus" (split of from class
5564 "minus" which now only has operation "minus", binary).
5567 * Constants "card", "internal_split", "option_map" now with authentic
5568 syntax. INCOMPATIBILITY.
5570 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
5571 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
5572 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
5573 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
5574 Sup_set_def, le_def, less_def, option_map_def now with object
5575 equality. INCOMPATIBILITY.
5577 * Records. Removed K_record, and replaced it by pure lambda term
5578 %x. c. The simplifier setup is now more robust against eta expansion.
5579 INCOMPATIBILITY: in cases explicitly referring to K_record.
5581 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
5583 * Library/ListVector: new theory of arithmetic vector operations.
5585 * Library/Order_Relation: new theory of various orderings as sets of
5586 pairs. Defines preorders, partial orders, linear orders and
5587 well-orders on sets and on types.
5592 * Renamed some theories to allow to loading both ZF and HOL in the
5595 Datatype -> Datatype_ZF
5596 Inductive -> Inductive_ZF
5603 INCOMPATIBILITY: ZF theories that import individual theories below
5604 Main might need to be adapted. Regular theory Main is still
5605 available, as trivial extension of Main_ZF.
5610 * ML within Isar: antiquotation @{const name} or @{const
5611 name(typargs)} produces statically-checked Const term.
5613 * Functor NamedThmsFun: data is available to the user as dynamic fact
5614 (of the same name). Removed obsolete print command.
5616 * Removed obsolete "use_legacy_bindings" function.
5618 * The ``print mode'' is now a thread-local value derived from a global
5619 template (the former print_mode reference), thus access becomes
5620 non-critical. The global print_mode reference is for session
5621 management only; user-code should use print_mode_value,
5622 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
5624 * Functions system/system_out provide a robust way to invoke external
5625 shell commands, with propagation of interrupts (requires Poly/ML
5626 5.2.1). Do not use OS.Process.system etc. from the basis library!
5631 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
5632 in accordance with Proof General 3.7, which prefers GNU emacs.
5634 * isatool tty runs Isabelle process with plain tty interaction;
5635 optional line editor may be specified via ISABELLE_LINE_EDITOR
5636 setting, the default settings attempt to locate "ledit" and "rlwrap".
5638 * isatool browser now works with Cygwin as well, using general
5639 "javapath" function defined in Isabelle process environment.
5641 * YXML notation provides a simple and efficient alternative to
5642 standard XML transfer syntax. See src/Pure/General/yxml.ML and
5643 isatool yxml as described in the Isabelle system manual.
5645 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
5646 provides general wrapper for managing an Isabelle process in a robust
5647 fashion, with ``cooked'' output from stdin/stderr.
5649 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
5650 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
5652 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
5653 way of changing the user's settings is via
5654 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
5657 * Multithreading.max_threads := 0 refers to the number of actual CPU
5658 cores of the underlying machine, which is a good starting point for
5659 optimal performance tuning. The corresponding usedir option -M allows
5660 "max" as an alias for "0". WARNING: does not work on certain versions
5661 of Mac OS (with Poly/ML 5.1).
5663 * isabelle-process: non-ML sessions are run with "nice", to reduce the
5664 adverse effect of Isabelle flooding interactive front-ends (notably
5665 ProofGeneral / XEmacs).
5669 New in Isabelle2007 (November 2007)
5670 -----------------------------------
5674 * More uniform information about legacy features, notably a
5675 warning/error of "Legacy feature: ...", depending on the state of the
5676 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
5677 legacy features will disappear eventually.
5679 * Theory syntax: the header format ``theory A = B + C:'' has been
5680 discontinued in favour of ``theory A imports B C begin''. Use isatool
5681 fixheaders to convert existing theory files. INCOMPATIBILITY.
5683 * Theory syntax: the old non-Isar theory file format has been
5684 discontinued altogether. Note that ML proof scripts may still be used
5685 with Isar theories; migration is usually quite simple with the ML
5686 function use_legacy_bindings. INCOMPATIBILITY.
5688 * Theory syntax: some popular names (e.g. 'class', 'declaration',
5689 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
5692 * Theory loader: be more serious about observing the static theory
5693 header specifications (including optional directories), but not the
5694 accidental file locations of previously successful loads. The strict
5695 update policy of former update_thy is now already performed by
5696 use_thy, so the former has been removed; use_thys updates several
5697 theories simultaneously, just as 'imports' within a theory header
5698 specification, but without merging the results. Potential
5699 INCOMPATIBILITY: may need to refine theory headers and commands
5700 ROOT.ML which depend on load order.
5702 * Theory loader: optional support for content-based file
5703 identification, instead of the traditional scheme of full physical
5704 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
5705 (cf. the system manual). The new scheme allows to work with
5706 non-finished theories in persistent session images, such that source
5707 files may be moved later on without requiring reloads.
5709 * Theory loader: old-style ML proof scripts being *attached* to a thy
5710 file (with the same base name as the theory) are considered a legacy
5711 feature, which will disappear eventually. Even now, the theory loader
5712 no longer maintains dependencies on such files.
5714 * Syntax: the scope for resolving ambiguities via type-inference is
5715 now limited to individual terms, instead of whole simultaneous
5716 specifications as before. This greatly reduces the complexity of the
5717 syntax module and improves flexibility by separating parsing and
5718 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
5719 'fixes' etc.) are required in rare situations.
5721 * Syntax: constants introduced by new-style packages ('definition',
5722 'abbreviation' etc.) are passed through the syntax module in
5723 ``authentic mode''. This means that associated mixfix annotations
5724 really stick to such constants, independently of potential name space
5725 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
5726 trees are represented slightly differently, may need to adapt syntax
5727 translations accordingly. Use CONST marker in 'translations' and
5728 @{const_syntax} antiquotation in 'parse_translation' etc.
5730 * Legacy goal package: reduced interface to the bare minimum required
5731 to keep existing proof scripts running. Most other user-level
5732 functions are now part of the OldGoals structure, which is *not* open
5733 by default (consider isatool expandshort before open OldGoals).
5734 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
5735 these tend to cause confusion about the actual goal (!) context being
5736 used here, which is not necessarily the same as the_context().
5738 * Command 'find_theorems': supports "*" wild-card in "name:"
5739 criterion; "with_dups" option. Certain ProofGeneral versions might
5740 support a specific search form (see ProofGeneral/CHANGES).
5742 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
5743 by default, which means that "prems" (and also "fixed variables") are
5744 suppressed from proof state output. Note that the ProofGeneral
5745 settings mechanism allows to change and save options persistently, but
5746 older versions of Isabelle will fail to start up if a negative prems
5749 * Local theory targets may be specified by non-nested blocks of
5750 ``context/locale/class ... begin'' followed by ``end''. The body may
5751 contain definitions, theorems etc., including any derived mechanism
5752 that has been implemented on top of these primitives. This concept
5753 generalizes the existing ``theorem (in ...)'' towards more versatility
5756 * Proof General interface: proper undo of final 'end' command;
5757 discontinued Isabelle/classic mode (ML proof scripts).
5760 *** Document preparation ***
5762 * Added antiquotation @{theory name} which prints the given name,
5763 after checking that it refers to a valid ancestor theory in the
5766 * Added antiquotations @{ML_type text} and @{ML_struct text} which
5767 check the given source text as ML type/structure, printing verbatim.
5769 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
5770 "c args == rhs" given in the current context. (Any number of
5771 arguments may be given on the LHS.)
5776 * The 'class' package offers a combination of axclass and locale to
5777 achieve Haskell-like type classes in Isabelle. Definitions and
5778 theorems within a class context produce both relative results (with
5779 implicit parameters according to the locale context), and polymorphic
5780 constants with qualified polymorphism (according to the class
5781 context). Within the body context of a 'class' target, a separate
5782 syntax layer ("user space type system") takes care of converting
5783 between global polymorphic consts and internal locale representation.
5784 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
5785 "isatool doc classes" provides a tutorial.
5787 * Generic code generator framework allows to generate executable
5788 code for ML and Haskell (including Isabelle classes). A short usage
5791 internal compilation:
5792 export_code <list of constants (term syntax)> in SML
5793 writing SML code to a file:
5794 export_code <list of constants (term syntax)> in SML <filename>
5795 writing OCaml code to a file:
5796 export_code <list of constants (term syntax)> in OCaml <filename>
5797 writing Haskell code to a bunch of files:
5798 export_code <list of constants (term syntax)> in Haskell <filename>
5800 evaluating closed propositions to True/False using code generation:
5803 Reasonable default setup of framework in HOL.
5805 Theorem attributs for selecting and transforming function equations theorems:
5807 [code fun]: select a theorem as function equation for a specific constant
5808 [code fun del]: deselect a theorem as function equation for a specific constant
5809 [code inline]: select an equation theorem for unfolding (inlining) in place
5810 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
5812 User-defined serializations (target in {SML, OCaml, Haskell}):
5814 code_const <and-list of constants (term syntax)>
5815 {(target) <and-list of const target syntax>}+
5817 code_type <and-list of type constructors>
5818 {(target) <and-list of type target syntax>}+
5820 code_instance <and-list of instances>
5822 where instance ::= <type constructor> :: <class>
5824 code_class <and_list of classes>
5825 {(target) <and-list of class target syntax>}+
5826 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
5828 code_instance and code_class only are effective to target Haskell.
5830 For example usage see src/HOL/ex/Codegenerator.thy and
5831 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
5832 generation from Isabelle/HOL theories is available via "isatool doc
5835 * Code generator: consts in 'consts_code' Isar commands are now
5836 referred to by usual term syntax (including optional type
5839 * Command 'no_translations' removes translation rules from theory
5842 * Overloaded definitions are now actually checked for acyclic
5843 dependencies. The overloading scheme is slightly more general than
5844 that of Haskell98, although Isabelle does not demand an exact
5845 correspondence to type class and instance declarations.
5846 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
5847 exotic versions of overloading -- at the discretion of the user!
5849 Polymorphic constants are represented via type arguments, i.e. the
5850 instantiation that matches an instance against the most general
5851 declaration given in the signature. For example, with the declaration
5852 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
5853 as c(nat). Overloading is essentially simultaneous structural
5854 recursion over such type arguments. Incomplete specification patterns
5855 impose global constraints on all occurrences, e.g. c('a * 'a) on the
5856 LHS means that more general c('a * 'b) will be disallowed on any RHS.
5857 Command 'print_theory' outputs the normalized system of recursive
5858 equations, see section "definitions".
5860 * Configuration options are maintained within the theory or proof
5861 context (with name and type bool/int/string), providing a very simple
5862 interface to a poor-man's version of general context data. Tools may
5863 declare options in ML (e.g. using Attrib.config_int) and then refer to
5864 these values using Config.get etc. Users may change options via an
5865 associated attribute of the same name. This form of context
5866 declaration works particularly well with commands 'declare' or
5867 'using', for example ``declare [[foo = 42]]''. Thus it has become
5868 very easy to avoid global references, which would not observe Isar
5869 toplevel undo/redo and fail to work with multithreading.
5871 Various global ML references of Pure and HOL have been turned into
5872 configuration options:
5874 Unify.search_bound unify_search_bound
5875 Unify.trace_bound unify_trace_bound
5876 Unify.trace_simp unify_trace_simp
5877 Unify.trace_types unify_trace_types
5878 Simplifier.simp_depth_limit simp_depth_limit
5879 Blast.depth_limit blast_depth_limit
5880 DatatypeProp.dtK datatype_distinctness_limit
5881 fast_arith_neq_limit fast_arith_neq_limit
5882 fast_arith_split_limit fast_arith_split_limit
5884 * Named collections of theorems may be easily installed as context
5885 data using the functor NamedThmsFun (see also
5886 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
5887 attributes; there is also a toplevel print command. This facility is
5888 just a common case of general context data, which is the preferred way
5889 for anything more complex than just a list of facts in canonical
5892 * Isar: command 'declaration' augments a local theory by generic
5893 declaration functions written in ML. This enables arbitrary content
5894 being added to the context, depending on a morphism that tells the
5895 difference of the original declaration context wrt. the application
5896 context encountered later on.
5898 * Isar: proper interfaces for simplification procedures. Command
5899 'simproc_setup' declares named simprocs (with match patterns, and body
5900 text in ML). Attribute "simproc" adds/deletes simprocs in the current
5901 context. ML antiquotation @{simproc name} retrieves named simprocs.
5903 * Isar: an extra pair of brackets around attribute declarations
5904 abbreviates a theorem reference involving an internal dummy fact,
5905 which will be ignored later --- only the effect of the attribute on
5906 the background context will persist. This form of in-place
5907 declarations is particularly useful with commands like 'declare' and
5908 'using', for example ``have A using [[simproc a]] by simp''.
5910 * Isar: method "assumption" (and implicit closing of subproofs) now
5911 takes simple non-atomic goal assumptions into account: after applying
5912 an assumption as a rule the resulting subgoals are solved by atomic
5913 assumption steps. This is particularly useful to finish 'obtain'
5914 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
5915 without referring to the original premise "!!x. P x ==> thesis" in the
5916 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
5919 * Isar: implicit use of prems from the Isar proof context is
5920 considered a legacy feature. Common applications like ``have A .''
5921 may be replaced by ``have A by fact'' or ``note `A`''. In general,
5922 referencing facts explicitly here improves readability and
5923 maintainability of proof texts.
5925 * Isar: improper proof element 'guess' is like 'obtain', but derives
5926 the obtained context from the course of reasoning! For example:
5928 assume "EX x y. A x & B y" -- "any previous fact"
5929 then guess x and y by clarify
5931 This technique is potentially adventurous, depending on the facts and
5932 proof tools being involved here.
5934 * Isar: known facts from the proof context may be specified as literal
5935 propositions, using ASCII back-quote syntax. This works wherever
5936 named facts used to be allowed so far, in proof commands, proof
5937 methods, attributes etc. Literal facts are retrieved from the context
5938 according to unification of type and term parameters. For example,
5939 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
5940 theorems in the current context, then these are valid literal facts:
5941 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
5943 There is also a proof method "fact" which does the same composition
5944 for explicit goal states, e.g. the following proof texts coincide with
5945 certain special cases of literal facts:
5947 have "A" by fact == note `A`
5948 have "A ==> B" by fact == note `A ==> B`
5949 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
5950 have "P a ==> Q a" by fact == note `P a ==> Q a`
5952 * Isar: ":" (colon) is no longer a symbolic identifier character in
5953 outer syntax. Thus symbolic identifiers may be used without
5954 additional white space in declarations like this: ``assume *: A''.
5956 * Isar: 'print_facts' prints all local facts of the current context,
5957 both named and unnamed ones.
5959 * Isar: 'def' now admits simultaneous definitions, e.g.:
5961 def x == "t" and y == "u"
5963 * Isar: added command 'unfolding', which is structurally similar to
5964 'using', but affects both the goal state and facts by unfolding given
5965 rewrite rules. Thus many occurrences of the 'unfold' method or
5966 'unfolded' attribute may be replaced by first-class proof text.
5968 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
5969 and command 'unfolding' now all support object-level equalities
5970 (potentially conditional). The underlying notion of rewrite rule is
5971 analogous to the 'rule_format' attribute, but *not* that of the
5972 Simplifier (which is usually more generous).
5974 * Isar: the new attribute [rotated n] (default n = 1) rotates the
5975 premises of a theorem by n. Useful in conjunction with drule.
5977 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
5978 method expression within a sandbox consisting of the first N
5979 sub-goals, which need to exist. For example, ``simp_all [3]''
5980 simplifies the first three sub-goals, while (rule foo, simp_all)[]
5981 simplifies all new goals that emerge from applying rule foo to the
5982 originally first one.
5984 * Isar: schematic goals are no longer restricted to higher-order
5985 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
5988 * Isar: the conclusion of a long theorem statement is now either
5989 'shows' (a simultaneous conjunction, as before), or 'obtains'
5990 (essentially a disjunction of cases with local parameters and
5991 assumptions). The latter allows to express general elimination rules
5992 adequately; in this notation common elimination rules look like this:
5994 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
5996 obtains x where "P x"
5998 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
6002 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
6008 The subsequent classical rules even refer to the formal "thesis"
6011 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
6014 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
6015 obtains "thesis ==> something"
6017 The actual proof of an 'obtains' statement is analogous to that of the
6018 Isar proof element 'obtain', only that there may be several cases.
6019 Optional case names may be specified in parentheses; these will be
6020 available both in the present proof and as annotations in the
6021 resulting rule, for later use with the 'cases' method (cf. attribute
6024 * Isar: the assumptions of a long theorem statement are available as
6025 "assms" fact in the proof context. This is more appropriate than the
6026 (historical) "prems", which refers to all assumptions of the current
6027 context, including those from the target locale, proof body etc.
6029 * Isar: 'print_statement' prints theorems from the current theory or
6030 proof context in long statement form, according to the syntax of a
6033 * Isar: 'obtain' takes an optional case name for the local context
6034 introduction rule (default "that").
6036 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
6037 explicit (is "_ ==> ?foo") in the rare cases where this still happens
6040 * Pure: syntax "CONST name" produces a fully internalized constant
6041 according to the current context. This is particularly useful for
6042 syntax translations that should refer to internal constant
6043 representations independently of name spaces.
6045 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
6046 instead of "FOO ". This allows multiple binder declarations to coexist
6047 in the same context. INCOMPATIBILITY.
6049 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
6050 primitive that also works in a locale context (both for constants and
6051 fixed variables). Type declaration and internal syntactic representation
6052 of given constants retrieved from the context. Likewise, the
6053 'no_notation' command allows to remove given syntax annotations from the
6056 * Isar/locales: new derived specification elements 'axiomatization',
6057 'definition', 'abbreviation', which support type-inference, admit
6058 object-level specifications (equality, equivalence). See also the
6059 isar-ref manual. Examples:
6062 eq (infix "===" 50) where
6063 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
6065 definition "f x y = x + y + 1"
6066 definition g where "g x = f x x"
6069 neq (infix "=!=" 50) where
6070 "x =!= y == ~ (x === y)"
6072 These specifications may be also used in a locale context. Then the
6073 constants being introduced depend on certain fixed parameters, and the
6074 constant name is qualified by the locale base name. An internal
6075 abbreviation takes care for convenient input and output, making the
6076 parameters implicit and using the original short name. See also
6077 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
6078 entities from a monomorphic theory.
6080 Presently, abbreviations are only available 'in' a target locale, but
6081 not inherited by general import expressions. Also note that
6082 'abbreviation' may be used as a type-safe replacement for 'syntax' +
6083 'translations' in common applications. The "no_abbrevs" print mode
6084 prevents folding of abbreviations in term output.
6086 Concrete syntax is attached to specified constants in internal form,
6087 independently of name spaces. The parse tree representation is
6088 slightly different -- use 'notation' instead of raw 'syntax', and
6089 'translations' with explicit "CONST" markup to accommodate this.
6091 * Pure/Isar: unified syntax for new-style specification mechanisms
6092 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
6093 full type inference and dummy patterns ("_"). For example:
6095 definition "K x _ = x"
6097 inductive conj for A B
6098 where "A ==> B ==> conj A B"
6100 * Pure: command 'print_abbrevs' prints all constant abbreviations of
6101 the current context. Print mode "no_abbrevs" prevents inversion of
6102 abbreviations on output.
6104 * Isar/locales: improved parameter handling: use of locales "var" and
6105 "struct" no longer necessary; - parameter renamings are no longer
6106 required to be injective. For example, this allows to define
6107 endomorphisms as locale endom = homom mult mult h.
6109 * Isar/locales: changed the way locales with predicates are defined.
6110 Instead of accumulating the specification, the imported expression is
6111 now an interpretation. INCOMPATIBILITY: different normal form of
6112 locale expressions. In particular, in interpretations of locales with
6113 predicates, goals repesenting already interpreted fragments are not
6114 removed automatically. Use methods `intro_locales' and
6115 `unfold_locales'; see below.
6117 * Isar/locales: new methods `intro_locales' and `unfold_locales'
6118 provide backward reasoning on locales predicates. The methods are
6119 aware of interpretations and discharge corresponding goals.
6120 `intro_locales' is less aggressive then `unfold_locales' and does not
6121 unfold predicates to assumptions.
6123 * Isar/locales: the order in which locale fragments are accumulated
6124 has changed. This enables to override declarations from fragments due
6125 to interpretations -- for example, unwanted simp rules.
6127 * Isar/locales: interpretation in theories and proof contexts has been
6128 extended. One may now specify (and prove) equations, which are
6129 unfolded in interpreted theorems. This is useful for replacing
6130 defined concepts (constants depending on locale parameters) by
6131 concepts already existing in the target context. Example:
6133 interpretation partial_order ["op <= :: [int, int] => bool"]
6134 where "partial_order.less (op <=) (x::int) y = (x < y)"
6136 Typically, the constant `partial_order.less' is created by a
6137 definition specification element in the context of locale
6140 * Method "induct": improved internal context management to support
6141 local fixes and defines on-the-fly. Thus explicit meta-level
6142 connectives !! and ==> are rarely required anymore in inductive goals
6143 (using object-logic connectives for this purpose has been long
6144 obsolete anyway). Common proof patterns are explained in
6145 src/HOL/Induct/Common_Patterns.thy, see also
6146 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
6149 * Method "induct": improved handling of simultaneous goals. Instead of
6150 introducing object-level conjunction, the statement is now split into
6151 several conclusions, while the corresponding symbolic cases are nested
6152 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
6153 see src/HOL/Induct/Common_Patterns.thy, for example.
6155 * Method "induct": mutual induction rules are now specified as a list
6156 of rule sharing the same induction cases. HOL packages usually provide
6157 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
6158 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
6159 mutual induction rules differently, i.e. like this:
6161 (induct rule: foo_bar.inducts)
6162 (induct set: foo bar)
6163 (induct pred: foo bar)
6164 (induct type: foo bar)
6166 The ML function ProjectRule.projections turns old-style rules into the
6169 * Method "coinduct": dual of induction, see
6170 src/HOL/Library/Coinductive_List.thy for various examples.
6172 * Method "cases", "induct", "coinduct": the ``(open)'' option is
6173 considered a legacy feature.
6175 * Attribute "symmetric" produces result with standardized schematic
6176 variables (index 0). Potential INCOMPATIBILITY.
6178 * Simplifier: by default the simplifier trace only shows top level
6179 rewrites now. That is, trace_simp_depth_limit is set to 1 by
6180 default. Thus there is less danger of being flooded by the trace. The
6181 trace indicates where parts have been suppressed.
6183 * Provers/classical: removed obsolete classical version of elim_format
6184 attribute; classical elim/dest rules are now treated uniformly when
6185 manipulating the claset.
6187 * Provers/classical: stricter checks to ensure that supplied intro,
6188 dest and elim rules are well-formed; dest and elim rules must have at
6191 * Provers/classical: attributes dest/elim/intro take an optional
6192 weight argument for the rule (just as the Pure versions). Weights are
6193 ignored by automated tools, but determine the search order of single
6196 * Syntax: input syntax now supports dummy variable binding "%_. b",
6197 where the body does not mention the bound variable. Note that dummy
6198 patterns implicitly depend on their context of bounds, which makes
6199 "{_. _}" match any set comprehension as expected. Potential
6200 INCOMPATIBILITY -- parse translations need to cope with syntactic
6201 constant "_idtdummy" in the binding position.
6203 * Syntax: removed obsolete syntactic constant "_K" and its associated
6204 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
6205 for example "A -> B" => "Pi A (%_. B)".
6207 * Pure: 'class_deps' command visualizes the subclass relation, using
6208 the graph browser tool.
6210 * Pure: 'print_theory' now suppresses certain internal declarations by
6211 default; use '!' option for full details.
6216 * Method "metis" proves goals by applying the Metis general-purpose
6217 resolution prover (see also http://gilith.com/software/metis/).
6218 Examples are in the directory MetisExamples. WARNING: the
6219 Isabelle/HOL-Metis integration does not yet work properly with
6222 * Command 'sledgehammer' invokes external automatic theorem provers as
6223 background processes. It generates calls to the "metis" method if
6224 successful. These can be pasted into the proof. Users do not have to
6225 wait for the automatic provers to return. WARNING: does not really
6226 work with multi-threading.
6228 * New "auto_quickcheck" feature tests outermost goal statements for
6229 potential counter-examples. Controlled by ML references
6230 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
6231 5000 milliseconds). Fails silently if statements is outside of
6232 executable fragment, or any other codgenerator problem occurs.
6234 * New constant "undefined" with axiom "undefined x = undefined".
6236 * Added class "HOL.eq", allowing for code generation with polymorphic
6239 * Some renaming of class constants due to canonical name prefixing in
6240 the new 'class' package:
6242 HOL.abs ~> HOL.abs_class.abs
6243 HOL.divide ~> HOL.divide_class.divide
6244 0 ~> HOL.zero_class.zero
6245 1 ~> HOL.one_class.one
6246 op + ~> HOL.plus_class.plus
6247 op - ~> HOL.minus_class.minus
6248 uminus ~> HOL.minus_class.uminus
6249 op * ~> HOL.times_class.times
6250 op < ~> HOL.ord_class.less
6251 op <= > HOL.ord_class.less_eq
6252 Nat.power ~> Power.power_class.power
6253 Nat.size ~> Nat.size_class.size
6254 Numeral.number_of ~> Numeral.number_class.number_of
6255 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
6256 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
6257 Orderings.min ~> Orderings.ord_class.min
6258 Orderings.max ~> Orderings.ord_class.max
6259 Divides.op div ~> Divides.div_class.div
6260 Divides.op mod ~> Divides.div_class.mod
6261 Divides.op dvd ~> Divides.div_class.dvd
6263 INCOMPATIBILITY. Adaptions may be required in the following cases:
6265 a) User-defined constants using any of the names "plus", "minus",
6266 "times", "less" or "less_eq". The standard syntax translations for
6267 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
6270 b) Variables named "plus", "minus", "times", "less", "less_eq"
6271 INCOMPATIBILITY: use more specific names.
6273 c) Permutative equations (e.g. "a + b = b + a")
6274 Since the change of names also changes the order of terms, permutative
6275 rewrite rules may get applied in a different order. Experience shows
6276 that this is rarely the case (only two adaptions in the whole Isabelle
6277 distribution). INCOMPATIBILITY: rewrite proofs
6279 d) ML code directly refering to constant names
6280 This in general only affects hand-written proof tactics, simprocs and
6281 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
6282 Consider using @{const_name} antiquotation.
6284 * New class "default" with associated constant "default".
6286 * Function "sgn" is now overloaded and available on int, real, complex
6287 (and other numeric types), using class "sgn". Two possible defs of
6288 sgn are given as equational assumptions in the classes sgn_if and
6289 sgn_div_norm; ordered_idom now also inherits from sgn_if.
6292 * Locale "partial_order" now unified with class "order" (cf. theory
6293 Orderings), added parameter "less". INCOMPATIBILITY.
6295 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
6296 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
6297 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
6299 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
6300 changed order of proof goals in instance proofs.
6302 * The transitivity reasoner for partial and linear orders is set up
6303 for classes "order" and "linorder". Instances of the reasoner are available
6304 in all contexts importing or interpreting the corresponding locales.
6305 Method "order" invokes the reasoner separately; the reasoner
6306 is also integrated with the Simplifier as a solver. Diagnostic
6307 command 'print_orders' shows the available instances of the reasoner
6308 in the current context.
6310 * Localized monotonicity predicate in theory "Orderings"; integrated
6311 lemmas max_of_mono and min_of_mono with this predicate.
6314 * Formulation of theorem "dense" changed slightly due to integration
6315 with new class dense_linear_order.
6317 * Uniform lattice theory development in HOL.
6319 constants "meet" and "join" now named "inf" and "sup"
6320 constant "Meet" now named "Inf"
6322 classes "meet_semilorder" and "join_semilorder" now named
6323 "lower_semilattice" and "upper_semilattice"
6324 class "lorder" now named "lattice"
6325 class "comp_lat" now named "complete_lattice"
6327 Instantiation of lattice classes allows explicit definitions
6328 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
6330 INCOMPATIBILITY. Theorem renames:
6332 meet_left_le ~> inf_le1
6333 meet_right_le ~> inf_le2
6334 join_left_le ~> sup_ge1
6335 join_right_le ~> sup_ge2
6336 meet_join_le ~> inf_sup_ord
6339 le_meet ~> le_inf_iff
6340 le_join ~> ge_sup_conv
6341 meet_idempotent ~> inf_idem
6342 join_idempotent ~> sup_idem
6343 meet_comm ~> inf_commute
6344 join_comm ~> sup_commute
6345 meet_leI1 ~> le_infI1
6346 meet_leI2 ~> le_infI2
6347 le_joinI1 ~> le_supI1
6348 le_joinI2 ~> le_supI2
6349 meet_assoc ~> inf_assoc
6350 join_assoc ~> sup_assoc
6351 meet_left_comm ~> inf_left_commute
6352 meet_left_idempotent ~> inf_left_idem
6353 join_left_comm ~> sup_left_commute
6354 join_left_idempotent ~> sup_left_idem
6357 le_def_meet ~> le_iff_inf
6358 le_def_join ~> le_iff_sup
6359 join_absorp2 ~> sup_absorb2
6360 join_absorp1 ~> sup_absorb1
6361 meet_absorp1 ~> inf_absorb1
6362 meet_absorp2 ~> inf_absorb2
6363 meet_join_absorp ~> inf_sup_absorb
6364 join_meet_absorp ~> sup_inf_absorb
6365 distrib_join_le ~> distrib_sup_le
6366 distrib_meet_le ~> distrib_inf_le
6368 add_meet_distrib_left ~> add_inf_distrib_left
6369 add_join_distrib_left ~> add_sup_distrib_left
6370 is_join_neg_meet ~> is_join_neg_inf
6371 is_meet_neg_join ~> is_meet_neg_sup
6372 add_meet_distrib_right ~> add_inf_distrib_right
6373 add_join_distrib_right ~> add_sup_distrib_right
6374 add_meet_join_distribs ~> add_sup_inf_distribs
6375 join_eq_neg_meet ~> sup_eq_neg_inf
6376 meet_eq_neg_join ~> inf_eq_neg_sup
6377 add_eq_meet_join ~> add_eq_inf_sup
6378 meet_0_imp_0 ~> inf_0_imp_0
6379 join_0_imp_0 ~> sup_0_imp_0
6380 meet_0_eq_0 ~> inf_0_eq_0
6381 join_0_eq_0 ~> sup_0_eq_0
6382 neg_meet_eq_join ~> neg_inf_eq_sup
6383 neg_join_eq_meet ~> neg_sup_eq_inf
6384 join_eq_if ~> sup_eq_if
6386 mono_meet ~> mono_inf
6387 mono_join ~> mono_sup
6388 meet_bool_eq ~> inf_bool_eq
6389 join_bool_eq ~> sup_bool_eq
6390 meet_fun_eq ~> inf_fun_eq
6391 join_fun_eq ~> sup_fun_eq
6392 meet_set_eq ~> inf_set_eq
6393 join_set_eq ~> sup_set_eq
6394 meet1_iff ~> inf1_iff
6395 meet2_iff ~> inf2_iff
6404 join1_iff ~> sup1_iff
6405 join2_iff ~> sup2_iff
6415 is_meet_Meet ~> is_meet_Inf
6416 Meet_bool_def ~> Inf_bool_def
6417 Meet_fun_def ~> Inf_fun_def
6418 Meet_greatest ~> Inf_greatest
6419 Meet_lower ~> Inf_lower
6420 Meet_set_def ~> Inf_set_def
6423 Sup_bool_eq ~> Sup_bool_def
6424 Sup_fun_eq ~> Sup_fun_def
6425 Sup_set_eq ~> Sup_set_def
6427 listsp_meetI ~> listsp_infI
6428 listsp_meet_eq ~> listsp_inf_eq
6433 * Added syntactic class "size"; overloaded constant "size" now has
6434 type "'a::size ==> bool"
6436 * Internal reorganisation of `size' of datatypes: size theorems
6437 "foo.size" are no longer subsumed by "foo.simps" (but are still
6438 simplification rules by default!); theorems "prod.size" now named
6441 * Class "div" now inherits from class "times" rather than "type".
6444 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
6445 Linorder etc. have disappeared; operations defined in terms of
6446 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
6448 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
6450 * HOL-Word: New extensive library and type for generic, fixed size
6451 machine words, with arithmetic, bit-wise, shifting and rotating
6452 operations, reflection into int, nat, and bool lists, automation for
6453 linear arithmetic (by automatic reflection into nat or int), including
6454 lemmas on overflow and monotonicity. Instantiated to all appropriate
6455 arithmetic type classes, supporting automatic simplification of
6456 numerals on all operations.
6458 * Library/Boolean_Algebra: locales for abstract boolean algebras.
6460 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
6462 * Code generator library theories:
6463 - Code_Integer represents HOL integers by big integer literals in target
6465 - Code_Char represents HOL characters by character literals in target
6467 - Code_Char_chr like Code_Char, but also offers treatment of character
6468 codes; includes Code_Integer.
6469 - Executable_Set allows to generate code for finite sets using lists.
6470 - Executable_Rat implements rational numbers as triples (sign, enumerator,
6472 - Executable_Real implements a subset of real numbers, namly those
6473 representable by rational numbers.
6474 - Efficient_Nat implements natural numbers by integers, which in general will
6475 result in higher efficency; pattern matching with 0/Suc is eliminated;
6476 includes Code_Integer.
6477 - Code_Index provides an additional datatype index which is mapped to
6478 target-language built-in integers.
6479 - Code_Message provides an additional datatype message_string which is isomorphic to
6480 strings; messages are mapped to target-language strings.
6482 * New package for inductive predicates
6484 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
6487 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
6488 for z_1 :: U_1 and ... and z_n :: U_m
6490 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
6493 with full support for type-inference, rather than
6495 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
6497 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
6498 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
6500 inductive "s z_1 ... z_m"
6502 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
6505 For backward compatibility, there is a wrapper allowing inductive
6506 sets to be defined with the new package via
6509 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
6510 for z_1 :: U_1 and ... and z_n :: U_m
6512 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
6518 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
6519 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
6520 for z_1 :: U_1 and ... and z_n :: U_m
6522 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
6523 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
6526 if the additional syntax "p ..." is required.
6528 Numerous examples can be found in the subdirectories src/HOL/Auth,
6529 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
6533 - Since declaration and definition of inductive sets or predicates
6534 is no longer separated, abbreviations involving the newly
6535 introduced sets or predicates must be specified together with the
6536 introduction rules after the 'where' keyword (see above), rather
6537 than before the actual inductive definition.
6539 - The variables in induction and elimination rules are now
6540 quantified in the order of their occurrence in the introduction
6541 rules, rather than in alphabetical order. Since this may break
6542 some proofs, these proofs either have to be repaired, e.g. by
6543 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
6544 statements of the form
6546 case (rule_i a_i_1 ... a_i_{k_i})
6548 or the old order of quantification has to be restored by explicitly adding
6549 meta-level quantifiers in the introduction rules, i.e.
6551 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
6553 - The format of the elimination rules is now
6555 p z_1 ... z_m x_1 ... x_n ==>
6556 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
6561 (x_1, ..., x_n) : s z_1 ... z_m ==>
6562 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
6565 for sets rather than
6567 x : s z_1 ... z_m ==>
6568 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
6571 This may require terms in goals to be expanded to n-tuples
6572 (e.g. using case_tac or simplification with the split_paired_all
6573 rule) before the above elimination rule is applicable.
6575 - The elimination or case analysis rules for (mutually) inductive
6576 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
6577 list of rules "p_1_..._p_k.elims" is no longer available.
6579 * New package "function"/"fun" for general recursive functions,
6580 supporting mutual and nested recursion, definitions in local contexts,
6581 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
6582 for small examples, and the separate tutorial on the function
6583 package. The old recdef "package" is still available as before, but
6584 users are encouraged to use the new package.
6586 * Method "lexicographic_order" automatically synthesizes termination
6587 relations as lexicographic combinations of size measures.
6589 * Case-expressions allow arbitrary constructor-patterns (including
6590 "_") and take their order into account, like in functional
6591 programming. Internally, this is translated into nested
6592 case-expressions; missing cases are added and mapped to the predefined
6593 constant "undefined". In complicated cases printing may no longer show
6594 the original input but the internal form. Lambda-abstractions allow
6595 the same form of pattern matching: "% pat1 => e1 | ..." is an
6596 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
6599 * IntDef: The constant "int :: nat => int" has been removed; now "int"
6600 is an abbreviation for "of_nat :: nat => int". The simplification
6601 rules for "of_nat" have been changed to work like "int" did
6602 previously. Potential INCOMPATIBILITY:
6603 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
6604 - of_nat_diff and of_nat_mult are no longer default simp rules
6606 * Method "algebra" solves polynomial equations over (semi)rings using
6607 Groebner bases. The (semi)ring structure is defined by locales and the
6608 tool setup depends on that generic context. Installing the method for
6609 a specific type involves instantiating the locale and possibly adding
6610 declarations for computation on the coefficients. The method is
6611 already instantiated for natural numbers and for the axiomatic class
6612 of idoms with numerals. See also the paper by Chaieb and Wenzel at
6613 CALCULEMUS 2007 for the general principles underlying this
6614 architecture of context-aware proof-tools.
6616 * Method "ferrack" implements quantifier elimination over
6617 special-purpose dense linear orders using locales (analogous to
6618 "algebra"). The method is already installed for class
6619 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
6622 * Former constant "List.op @" now named "List.append". Use ML
6623 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
6624 circumvent possible incompatibilities when working on ML level.
6626 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
6628 * New function listsum :: 'a list => 'a for arbitrary monoids.
6629 Special syntax: "SUM x <- xs. f x" (and latex variants)
6631 * New syntax for Haskell-like list comprehension (input only), eg.
6632 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
6634 * The special syntax for function "filter" has changed from [x :
6635 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
6636 comprehension syntax, and for uniformity. INCOMPATIBILITY.
6638 * [a..b] is now defined for arbitrary linear orders. It used to be
6639 defined on nat only, as an abbreviation for [a..<Suc b]
6642 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
6644 * New functions "sorted" and "sort" in src/HOL/List.thy.
6646 * New lemma collection field_simps (an extension of ring_simps) for
6647 manipulating (in)equations involving division. Multiplies with all
6648 denominators that can be proved to be non-zero (in equations) or
6649 positive/negative (in inequations).
6651 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
6652 have been improved and renamed to ring_simps, group_simps and
6653 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
6654 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
6656 * Theory Library/Commutative_Ring: switched from recdef to function
6657 package; constants add, mul, pow now curried. Infix syntax for
6658 algebraic operations.
6660 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
6663 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
6666 * HOL/records: generalised field-update to take a function on the
6667 field rather than the new value: r(|A := x|) is translated to A_update
6668 (K x) r The K-combinator that is internally used is called K_record.
6669 INCOMPATIBILITY: Usage of the plain update functions has to be
6672 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
6673 * x = 0, which are required for a semiring. Richer structures do not
6674 inherit from semiring_0 anymore, because this property is a theorem
6675 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
6676 there is more to prove, but this is mostly trivial.
6678 * Class "recpower" is generalized to arbitrary monoids, not just
6679 commutative semirings. INCOMPATIBILITY: may need to incorporate
6680 commutativity or semiring properties additionally.
6682 * Constant "List.list_all2" in List.thy now uses authentic syntax.
6683 INCOMPATIBILITY: translations containing list_all2 may go wrong,
6684 better use 'abbreviation'.
6686 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
6688 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
6689 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
6690 significant changes for setting up numeral syntax for types:
6691 - New constants Numeral.pred and Numeral.succ instead
6692 of former Numeral.bin_pred and Numeral.bin_succ.
6693 - Use integer operations instead of bin_add, bin_mult and so on.
6694 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
6695 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
6697 See src/HOL/Integ/IntArith.thy for an example setup.
6699 * Command 'normal_form' computes the normal form of a term that may
6700 contain free variables. For example ``normal_form "rev [a, b, c]"''
6701 produces ``[b, c, a]'' (without proof). This command is suitable for
6702 heavy-duty computations because the functions are compiled to ML
6703 first. Correspondingly, a method "normalization" is provided. See
6704 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
6706 * Alternative iff syntax "A <-> B" for equality on bool (with priority
6707 25 like -->); output depends on the "iff" print_mode, the default is
6708 "A = B" (with priority 50).
6710 * Relations less (<) and less_eq (<=) are also available on type bool.
6711 Modified syntax to disallow nesting without explicit parentheses,
6712 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
6715 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
6717 * Relation composition operator "op O" now has precedence 75 and binds
6718 stronger than union and intersection. INCOMPATIBILITY.
6720 * The old set interval syntax "{m..n(}" (and relatives) has been
6721 removed. Use "{m..<n}" (and relatives) instead.
6723 * In the context of the assumption "~(s = t)" the Simplifier rewrites
6724 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
6725 ``declare [[simproc del: neq]]''.
6727 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
6730 * Theorem Cons_eq_map_conv no longer declared as "simp".
6732 * Theorem setsum_mult renamed to setsum_right_distrib.
6734 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
6737 * Reimplemented methods "sat" and "satx", with several improvements:
6738 goals no longer need to be stated as "<prems> ==> False", equivalences
6739 (i.e. "=" on type bool) are handled, variable names of the form
6740 "lit_<n>" are no longer reserved, significant speedup.
6742 * Methods "sat" and "satx" can now replay MiniSat proof traces.
6743 zChaff is still supported as well.
6745 * 'inductive' and 'datatype': provide projections of mutual rules,
6746 bundled as foo_bar.inducts;
6748 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
6751 * Library: moved theory Accessible_Part to main HOL.
6753 * Library: added theory Coinductive_List of potentially infinite lists
6754 as greatest fixed-point.
6756 * Library: added theory AssocList which implements (finite) maps as
6759 * Method "evaluation" solves goals (i.e. a boolean expression)
6760 efficiently by compiling it to ML. The goal is "proved" (via an
6761 oracle) if it evaluates to True.
6763 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
6764 also when invoked by the simplifier. This results in the Simplifier
6765 being more powerful on arithmetic goals. INCOMPATIBILITY.
6766 Configuration option fast_arith_split_limit=0 recovers the old
6769 * Support for hex (0x20) and binary (0b1001) numerals.
6771 * New method: reify eqs (t), where eqs are equations for an
6772 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
6773 parameter, computes a term s::'b and a list xs::'a list and proves the
6774 theorem I xs s = t. This is also known as reification or quoting. The
6775 resulting theorem is applied to the subgoal to substitute t with I xs
6776 s. If t is omitted, the subgoal itself is reified.
6778 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
6779 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
6780 where f is supposed to be a computable function (in the sense of code
6781 generattion). The method uses reify to compute s and xs as above then
6782 applies corr_thm and uses normalization by evaluation to "prove" f s =
6783 r and finally gets the theorem t = r, which is again applied to the
6784 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
6786 * Reflection: Automatic reification now handels binding, an example is
6787 available in src/HOL/ex/ReflectionEx.thy
6789 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
6790 command 'statespace' that is similar to 'record', but introduces an
6791 abstract specification based on the locale infrastructure instead of
6792 HOL types. This leads to extra flexibility in composing state spaces,
6793 in particular multiple inheritance and renaming of components.
6798 * Hyperreal: Functions root and sqrt are now defined on negative real
6799 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
6800 Nonnegativity side conditions have been removed from many lemmas, so
6801 that more subgoals may now be solved by simplification; potential
6804 * Real: new type classes formalize real normed vector spaces and
6805 algebras, using new overloaded constants scaleR :: real => 'a => 'a
6806 and norm :: 'a => real.
6808 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
6809 reals into other types. The overloaded constant Reals :: 'a set is now
6810 defined as range of_real; potential INCOMPATIBILITY.
6812 * Real: proper support for ML code generation, including 'quickcheck'.
6813 Reals are implemented as arbitrary precision rationals.
6815 * Hyperreal: Several constants that previously worked only for the
6816 reals have been generalized, so they now work over arbitrary vector
6817 spaces. Type annotations may need to be added in some cases; potential
6820 Infinitesimal :: ('a::real_normed_vector) star set
6821 HFinite :: ('a::real_normed_vector) star set
6822 HInfinite :: ('a::real_normed_vector) star set
6823 approx :: ('a::real_normed_vector) star => 'a star => bool
6824 monad :: ('a::real_normed_vector) star => 'a star set
6825 galaxy :: ('a::real_normed_vector) star => 'a star set
6826 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
6827 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
6828 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
6829 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
6830 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
6831 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
6832 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
6833 sgn :: 'a::real_normed_vector => 'a
6834 exp :: 'a::{recpower,real_normed_field,banach} => 'a
6836 * Complex: Some complex-specific constants are now abbreviations for
6837 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
6838 hnorm. Other constants have been entirely removed in favor of the
6839 polymorphic versions (INCOMPATIBILITY):
6843 HInfinite <-- CInfinite
6844 Infinitesimal <-- CInfinitesimal
6847 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
6848 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
6849 (ns)deriv <-- (ns)cderiv
6854 * Formalisation of ideals and the quotient construction over rings.
6856 * Order and lattice theory no longer based on records.
6859 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
6860 greatest_closed. INCOMPATIBILITY.
6862 * Method algebra is now set up via an attribute. For examples see
6863 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
6864 of algebraic structures.
6866 * Renamed theory CRing to Ring.
6871 * Substantial, yet incomplete support for nominal datatypes (binding
6872 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
6873 src/HOL/Nominal/Examples. Prospective users should consult
6874 http://isabelle.in.tum.de/nominal/
6879 * ML basics: just one true type int, which coincides with IntInf.int
6882 * ML within Isar: antiquotations allow to embed statically-checked
6883 formal entities in the source, referring to the context available at
6884 compile-time. For example:
6886 ML {* @{sort "{zero,one}"} *}
6887 ML {* @{typ "'a => 'b"} *}
6888 ML {* @{term "%x. x"} *}
6889 ML {* @{prop "x == y"} *}
6890 ML {* @{ctyp "'a => 'b"} *}
6891 ML {* @{cterm "%x. x"} *}
6892 ML {* @{cprop "x == y"} *}
6893 ML {* @{thm asm_rl} *}
6894 ML {* @{thms asm_rl} *}
6895 ML {* @{type_name c} *}
6896 ML {* @{type_syntax c} *}
6897 ML {* @{const_name c} *}
6898 ML {* @{const_syntax c} *}
6901 ML {* @{theory Pure} *}
6902 ML {* @{theory_ref} *}
6903 ML {* @{theory_ref Pure} *}
6906 ML {* @{clasimpset} *}
6908 The same works for sources being ``used'' within an Isar context.
6910 * ML in Isar: improved error reporting; extra verbosity with
6911 ML_Context.trace enabled.
6913 * Pure/General/table.ML: the join operations now works via exceptions
6914 DUP/SAME instead of type option. This is simpler in simple cases, and
6915 admits slightly more efficient complex applications.
6917 * Pure: 'advanced' translation functions (parse_translation etc.) now
6918 use Context.generic instead of just theory.
6920 * Pure: datatype Context.generic joins theory/Proof.context and
6921 provides some facilities for code that works in either kind of
6922 context, notably GenericDataFun for uniform theory and proof data.
6924 * Pure: simplified internal attribute type, which is now always
6925 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
6926 local (Proof.context) attributes have been discontinued, while
6927 minimizing code duplication. Thm.rule_attribute and
6928 Thm.declaration_attribute build canonical attributes; see also structure
6929 Context for further operations on Context.generic, notably
6930 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
6931 declarations and definitions.
6933 * Context data interfaces (Theory/Proof/GenericDataFun): removed
6934 name/print, uninitialized data defaults to ad-hoc copy of empty value,
6935 init only required for impure data. INCOMPATIBILITY: empty really need
6936 to be empty (no dependencies on theory content!)
6938 * Pure/kernel: consts certification ignores sort constraints given in
6939 signature declarations. (This information is not relevant to the
6940 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
6941 potential INCOMPATIBILITY.
6943 * Pure: axiomatic type classes are now purely definitional, with
6944 explicit proofs of class axioms and super class relations performed
6945 internally. See Pure/axclass.ML for the main internal interfaces --
6946 notably AxClass.define_class supercedes AxClass.add_axclass, and
6947 AxClass.axiomatize_class/classrel/arity supersede
6948 Sign.add_classes/classrel/arities.
6950 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
6951 global/local versions on theory vs. Proof.context have been
6952 discontinued; Attrib.syntax and Method.syntax have been adapted
6953 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
6954 attributes, methods, etc.
6956 * Pure: several functions of signature "... -> theory -> theory * ..."
6957 have been reoriented to "... -> theory -> ... * theory" in order to
6958 allow natural usage in combination with the ||>, ||>>, |-> and
6959 fold_map combinators.
6961 * Pure: official theorem names (closed derivations) and additional
6962 comments (tags) are now strictly separate. Name hints -- which are
6963 maintained as tags -- may be attached any time without affecting the
6966 * Pure: primitive rule lift_rule now takes goal cterm instead of an
6967 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
6968 achieve the old behaviour.
6970 * Pure: the "Goal" constant is now called "prop", supporting a
6971 slightly more general idea of ``protecting'' meta-level rule
6974 * Pure: Logic.(un)varify only works in a global context, which is now
6975 enforced instead of silently assumed. INCOMPATIBILITY, may use
6976 Logic.legacy_(un)varify as temporary workaround.
6978 * Pure: structure Name provides scalable operations for generating
6979 internal variable names, notably Name.variants etc. This replaces
6980 some popular functions from term.ML:
6982 Term.variant -> Name.variant
6983 Term.variantlist -> Name.variant_list
6984 Term.invent_names -> Name.invent_list
6986 Note that low-level renaming rarely occurs in new code -- operations
6987 from structure Variable are used instead (see below).
6989 * Pure: structure Variable provides fundamental operations for proper
6990 treatment of fixed/schematic variables in a context. For example,
6991 Variable.import introduces fixes for schematics of given facts and
6992 Variable.export reverses the effect (up to renaming) -- this replaces
6993 various freeze_thaw operations.
6995 * Pure: structure Goal provides simple interfaces for
6996 init/conclude/finish and tactical prove operations (replacing former
6997 Tactic.prove). Goal.prove is the canonical way to prove results
6998 within a given context; Goal.prove_global is a degraded version for
6999 theory level goals, including a global Drule.standard. Note that
7000 OldGoals.prove_goalw_cterm has long been obsolete, since it is
7001 ill-behaved in a local proof context (e.g. with local fixes/assumes or
7002 in a locale context).
7004 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
7005 and type checking (Syntax.check_term etc.), with common combinations
7006 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
7007 which are considered legacy and await removal.
7009 * Pure/Syntax: generic interfaces for type unchecking
7010 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
7011 with common combinations (Syntax.pretty_term, Syntax.string_of_term
7012 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
7013 available for convenience, but refer to the very same operations using
7014 a mere theory instead of a full context.
7016 * Isar: simplified treatment of user-level errors, using exception
7017 ERROR of string uniformly. Function error now merely raises ERROR,
7018 without any side effect on output channels. The Isar toplevel takes
7019 care of proper display of ERROR exceptions. ML code may use plain
7020 handle/can/try; cat_error may be used to concatenate errors like this:
7022 ... handle ERROR msg => cat_error msg "..."
7024 Toplevel ML code (run directly or through the Isar toplevel) may be
7025 embedded into the Isar toplevel with exception display/debug like
7028 Isar.toplevel (fn () => ...)
7030 INCOMPATIBILITY, removed special transform_error facilities, removed
7031 obsolete variants of user-level exceptions (ERROR_MESSAGE,
7032 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
7033 -- use plain ERROR instead.
7035 * Isar: theory setup now has type (theory -> theory), instead of a
7036 list. INCOMPATIBILITY, may use #> to compose setup functions.
7038 * Isar: ML toplevel pretty printer for type Proof.context, subject to
7039 ProofContext.debug/verbose flags.
7041 * Isar: Toplevel.theory_to_proof admits transactions that modify the
7042 theory before entering a proof state. Transactions now always see a
7043 quasi-functional intermediate checkpoint, both in interactive and
7046 * Isar: simplified interfaces for outer syntax. Renamed
7047 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
7048 OuterSyntax.add_parsers -- this functionality is now included in
7049 OuterSyntax.command etc. INCOMPATIBILITY.
7051 * Simplifier: the simpset of a running simplification process now
7052 contains a proof context (cf. Simplifier.the_context), which is the
7053 very context that the initial simpset has been retrieved from (by
7054 simpset_of/local_simpset_of). Consequently, all plug-in components
7055 (solver, looper etc.) may depend on arbitrary proof data.
7057 * Simplifier.inherit_context inherits the proof context (plus the
7058 local bounds) of the current simplification process; any simproc
7059 etc. that calls the Simplifier recursively should do this! Removed
7060 former Simplifier.inherit_bounds, which is already included here --
7061 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
7062 specify an explicit context using Simplifier.context/theory_context.
7064 * Simplifier/Classical Reasoner: more abstract interfaces
7065 change_simpset/claset for modifying the simpset/claset reference of a
7066 theory; raw versions simpset/claset_ref etc. have been discontinued --
7069 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
7075 * settings: the default heap location within ISABELLE_HOME_USER now
7076 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
7077 Isabelle installations.
7079 * isabelle-process: option -S (secure mode) disables some critical
7080 operations, notably runtime compilation and evaluation of ML source
7083 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
7085 * Support for parallel execution, using native multicore support of
7086 Poly/ML 5.1. The theory loader exploits parallelism when processing
7087 independent theories, according to the given theory header
7088 specifications. The maximum number of worker threads is specified via
7089 usedir option -M or the "max-threads" setting in Proof General. A
7090 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
7091 to 6 on a 8-core machine. User-code needs to observe certain
7092 guidelines for thread-safe programming, see appendix A in the Isar
7093 Implementation manual.
7097 New in Isabelle2005 (October 2005)
7098 ----------------------------------
7102 * Theory headers: the new header syntax for Isar theories is
7105 imports <theory1> ... <theoryN>
7106 uses <file1> ... <fileM>
7109 where the 'uses' part is optional. The previous syntax
7111 theory <name> = <theory1> + ... + <theoryN>:
7113 will disappear in the next release. Use isatool fixheaders to convert
7114 existing theory files. Note that there is no change in ancient
7115 non-Isar theories now, but these will disappear soon.
7117 * Theory loader: parent theories can now also be referred to via
7118 relative and absolute paths.
7120 * Command 'find_theorems' searches for a list of criteria instead of a
7121 list of constants. Known criteria are: intro, elim, dest, name:string,
7122 simp:term, and any term. Criteria can be preceded by '-' to select
7123 theorems that do not match. Intro, elim, dest select theorems that
7124 match the current goal, name:s selects theorems whose fully qualified
7125 name contain s, and simp:term selects all simplification rules whose
7126 lhs match term. Any other term is interpreted as pattern and selects
7127 all theorems matching the pattern. Available in ProofGeneral under
7128 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
7130 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
7132 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
7133 matching the current goal as introduction rule and not having "HOL."
7134 in their name (i.e. not being defined in theory HOL).
7136 * Command 'thms_containing' has been discontinued in favour of
7137 'find_theorems'; INCOMPATIBILITY.
7139 * Communication with Proof General is now 8bit clean, which means that
7140 Unicode text in UTF-8 encoding may be used within theory texts (both
7141 formal and informal parts). Cf. option -U of the Isabelle Proof
7142 General interface. Here are some simple examples (cf. src/HOL/ex):
7144 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
7145 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
7147 * Improved efficiency of the Simplifier and, to a lesser degree, the
7148 Classical Reasoner. Typical big applications run around 2 times
7152 *** Document preparation ***
7154 * Commands 'display_drafts' and 'print_drafts' perform simple output
7155 of raw sources. Only those symbols that do not require additional
7156 LaTeX packages (depending on comments in isabellesym.sty) are
7157 displayed properly, everything else is left verbatim. isatool display
7158 and isatool print are used as front ends (these are subject to the
7159 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
7161 * Command tags control specific markup of certain regions of text,
7162 notably folding and hiding. Predefined tags include "theory" (for
7163 theory begin and end), "proof" for proof commands, and "ML" for
7164 commands involving ML code; the additional tags "visible" and
7165 "invisible" are unused by default. Users may give explicit tag
7166 specifications in the text, e.g. ''by %invisible (auto)''. The
7167 interpretation of tags is determined by the LaTeX job during document
7168 preparation: see option -V of isatool usedir, or options -n and -t of
7169 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
7172 Several document versions may be produced at the same time via isatool
7173 usedir (the generated index.html will link all of them). Typical
7174 specifications include ''-V document=theory,proof,ML'' to present
7175 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
7176 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
7177 these parts without any formal replacement text. The Isabelle site
7178 default settings produce ''document'' and ''outline'' versions as
7181 * Several new antiquotations:
7183 @{term_type term} prints a term with its type annotated;
7185 @{typeof term} prints the type of a term;
7187 @{const const} is the same as @{term const}, but checks that the
7188 argument is a known logical constant;
7190 @{term_style style term} and @{thm_style style thm} print a term or
7191 theorem applying a "style" to it
7195 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
7196 definitions, equations, inequations etc., 'concl' printing only the
7197 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
7198 to print the specified premise. TermStyle.add_style provides an ML
7199 interface for introducing further styles. See also the "LaTeX Sugar"
7200 document practical applications. The ML antiquotation prints
7201 type-checked ML expressions verbatim.
7203 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
7204 and 'text' support optional locale specification '(in loc)', which
7205 specifies the default context for interpreting antiquotations. For
7206 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
7208 * Option 'locale=NAME' of antiquotations specifies an alternative
7209 context interpreting the subsequent argument. For example: @{thm
7210 [locale=lattice] inf_assoc}.
7212 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
7215 * Proper output of antiquotations for theory commands involving a
7216 proof context (such as 'locale' or 'theorem (in loc) ...').
7218 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
7219 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
7221 * isatool usedir: new option -C (default true) controls whether option
7222 -D should include a copy of the original document directory; -C false
7223 prevents unwanted effects such as copying of administrative CVS data.
7228 * Considerably improved version of 'constdefs' command. Now performs
7229 automatic type-inference of declared constants; additional support for
7230 local structure declarations (cf. locales and HOL records), see also
7231 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
7232 sequential dependencies of definitions within a single 'constdefs'
7233 section; moreover, the declared name needs to be an identifier. If
7234 all fails, consider to fall back on 'consts' and 'defs' separately.
7236 * Improved indexed syntax and implicit structures. First of all,
7237 indexed syntax provides a notational device for subscripted
7238 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
7239 expressions. Secondly, in a local context with structure
7240 declarations, number indexes \<^sub>n or the empty index (default
7241 number 1) refer to a certain fixed variable implicitly; option
7242 show_structs controls printing of implicit structures. Typical
7243 applications of these concepts involve record types and locales.
7245 * New command 'no_syntax' removes grammar declarations (and
7246 translations) resulting from the given syntax specification, which is
7247 interpreted in the same manner as for the 'syntax' command.
7249 * 'Advanced' translation functions (parse_translation etc.) may depend
7250 on the signature of the theory context being presently used for
7251 parsing/printing, see also isar-ref manual.
7253 * Improved 'oracle' command provides a type-safe interface to turn an
7254 ML expression of type theory -> T -> term into a primitive rule of
7255 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
7256 is already included here); see also FOL/ex/IffExample.thy;
7259 * axclass: name space prefix for class "c" is now "c_class" (was "c"
7260 before); "cI" is no longer bound, use "c.intro" instead.
7261 INCOMPATIBILITY. This change avoids clashes of fact bindings for
7262 axclasses vs. locales.
7264 * Improved internal renaming of symbolic identifiers -- attach primes
7265 instead of base 26 numbers.
7267 * New flag show_question_marks controls printing of leading question
7268 marks in schematic variable names.
7270 * In schematic variable names, *any* symbol following \<^isub> or
7271 \<^isup> is now treated as part of the base name. For example, the
7272 following works without printing of awkward ".0" indexes:
7274 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
7277 * Inner syntax includes (*(*nested*) comments*).
7279 * Pretty printer now supports unbreakable blocks, specified in mixfix
7280 annotations as "(00...)".
7282 * Clear separation of logical types and nonterminals, where the latter
7283 may only occur in 'syntax' specifications or type abbreviations.
7284 Before that distinction was only partially implemented via type class
7285 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
7286 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
7287 exotic syntax specifications may require further adaption
7288 (e.g. Cube/Cube.thy).
7290 * Removed obsolete type class "logic", use the top sort {} instead.
7291 Note that non-logical types should be declared as 'nonterminals'
7292 rather than 'types'. INCOMPATIBILITY for new object-logic
7295 * Attributes 'induct' and 'cases': type or set names may now be
7296 locally fixed variables as well.
7298 * Simplifier: can now control the depth to which conditional rewriting
7299 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
7302 * Simplifier: simplification procedures may now take the current
7303 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
7304 interface), which is very useful for calling the Simplifier
7305 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
7306 is gone -- use prems_of_ss on the simpset instead. Moreover, the
7307 low-level mk_simproc no longer applies Logic.varify internally, to
7308 allow for use in a context of fixed variables.
7310 * thin_tac now works even if the assumption being deleted contains !!
7311 or ==>. More generally, erule now works even if the major premise of
7312 the elimination rule contains !! or ==>.
7314 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
7316 * Reorganized bootstrapping of the Pure theories; CPure is now derived
7317 from Pure, which contains all common declarations already. Both
7318 theories are defined via plain Isabelle/Isar .thy files.
7319 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
7320 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
7321 use isatool fixcpure to adapt your theory and ML sources.
7323 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
7324 selections of theorems in named facts via index ranges.
7326 * 'print_theorems': in theory mode, really print the difference
7327 wrt. the last state (works for interactive theory development only),
7328 in proof mode print all local facts (cf. 'print_facts');
7330 * 'hide': option '(open)' hides only base names.
7332 * More efficient treatment of intermediate checkpoints in interactive
7335 * Code generator is now invoked via code_module (incremental code
7336 generation) and code_library (modular code generation, ML structures
7337 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
7338 must be quoted when used as identifiers.
7340 * New 'value' command for reading, evaluating and printing terms using
7341 the code generator. INCOMPATIBILITY: command keyword 'value' must be
7342 quoted when used as identifier.
7347 * New commands for the interpretation of locale expressions in
7348 theories (1), locales (2) and proof contexts (3). These generate
7349 proof obligations from the expression specification. After the
7350 obligations have been discharged, theorems of the expression are added
7351 to the theory, target locale or proof context. The synopsis of the
7352 commands is a follows:
7354 (1) interpretation expr inst
7355 (2) interpretation target < expr
7356 (3) interpret expr inst
7358 Interpretation in theories and proof contexts require a parameter
7359 instantiation of terms from the current context. This is applied to
7360 specifications and theorems of the interpreted expression.
7361 Interpretation in locales only permits parameter renaming through the
7362 locale expression. Interpretation is smart in that interpretations
7363 that are active already do not occur in proof obligations, neither are
7364 instantiated theorems stored in duplicate. Use 'print_interps' to
7365 inspect active interpretations of a particular locale. For details,
7366 see the Isar Reference manual. Examples can be found in
7367 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
7369 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
7370 'interpret' instead.
7372 * New context element 'constrains' for adding type constraints to
7375 * Context expressions: renaming of parameters with syntax
7378 * Locale declaration: 'includes' disallowed.
7380 * Proper static binding of attribute syntax -- i.e. types / terms /
7381 facts mentioned as arguments are always those of the locale definition
7382 context, independently of the context of later invocations. Moreover,
7383 locale operations (renaming and type / term instantiation) are applied
7384 to attribute arguments as expected.
7386 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
7387 actual attributes; rare situations may require Attrib.attribute to
7388 embed those attributes into Attrib.src that lack concrete syntax.
7389 Attribute implementations need to cooperate properly with the static
7390 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
7391 Attrib.XXX_thm etc. already do the right thing without further
7392 intervention. Only unusual applications -- such as "where" or "of"
7393 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
7394 on the context and the facts involved -- may have to assign parsed
7395 values to argument tokens explicitly.
7397 * Changed parameter management in theorem generation for long goal
7398 statements with 'includes'. INCOMPATIBILITY: produces a different
7399 theorem statement in rare situations.
7401 * Locale inspection command 'print_locale' omits notes elements. Use
7402 'print_locale!' to have them included in the output.
7407 * Provers/hypsubst.ML: improved version of the subst method, for
7408 single-step rewriting: it now works in bound variable contexts. New is
7409 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
7410 rewrite a different subterm than the original subst method, which is
7411 still available as 'simplesubst'.
7413 * Provers/quasi.ML: new transitivity reasoners for transitivity only
7416 * Provers/trancl.ML: new transitivity reasoner for transitive and
7417 reflexive-transitive closure of relations.
7419 * Provers/blast.ML: new reference depth_limit to make blast's depth
7420 limit (previously hard-coded with a value of 20) user-definable.
7422 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
7423 is peformed already. Object-logics merely need to finish their
7424 initial simpset configuration as before. INCOMPATIBILITY.
7429 * Symbolic syntax of Hilbert Choice Operator is now as follows:
7432 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
7434 The symbol \<some> is displayed as the alternative epsilon of LaTeX
7435 and x-symbol; use option '-m epsilon' to get it actually printed.
7436 Moreover, the mathematically important symbolic identifier \<epsilon>
7437 becomes available as variable, constant etc. INCOMPATIBILITY,
7439 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
7440 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
7441 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
7442 support corresponding Isar calculations.
7444 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
7447 * theory SetInterval: changed the syntax for open intervals:
7456 The old syntax is still supported but will disappear in the next
7457 release. For conversion use the following Emacs search and replace
7458 patterns (these are not perfect but work quite well):
7460 {)\([^\.]*\)\.\. -> {\1<\.\.}
7461 \.\.\([^(}]*\)(} -> \.\.<\1}
7463 * Theory Commutative_Ring (in Library): method comm_ring for proving
7464 equalities in commutative rings; method 'algebra' provides a generic
7467 * Theory Finite_Set: changed the syntax for 'setsum', summation over
7468 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
7469 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
7472 Some new syntax forms are available:
7474 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
7475 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
7476 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
7477 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
7479 The latter form "\<Sum>x < k. e" used to be based on a separate
7480 function "Summation", which has been discontinued.
7482 * theory Finite_Set: in structured induction proofs, the insert case
7483 is now 'case (insert x F)' instead of the old counterintuitive 'case
7486 * The 'refute' command has been extended to support a much larger
7487 fragment of HOL, including axiomatic type classes, constdefs and
7488 typedefs, inductive datatypes and recursion.
7490 * New tactics 'sat' and 'satx' to prove propositional tautologies.
7491 Requires zChaff with proof generation to be installed. See
7492 HOL/ex/SAT_Examples.thy for examples.
7494 * Datatype induction via method 'induct' now preserves the name of the
7495 induction variable. For example, when proving P(xs::'a list) by
7496 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
7497 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
7498 in unstructured proof scripts.
7500 * Reworked implementation of records. Improved scalability for
7501 records with many fields, avoiding performance problems for type
7502 inference. Records are no longer composed of nested field types, but
7503 of nested extension types. Therefore the record type only grows linear
7504 in the number of extensions and not in the number of fields. The
7505 top-level (users) view on records is preserved. Potential
7506 INCOMPATIBILITY only in strange cases, where the theory depends on the
7507 old record representation. The type generated for a record is called
7508 <record_name>_ext_type.
7510 Flag record_quick_and_dirty_sensitive can be enabled to skip the
7511 proofs triggered by a record definition or a simproc (if
7512 quick_and_dirty is enabled). Definitions of large records can take
7515 New simproc record_upd_simproc for simplification of multiple record
7516 updates enabled by default. Moreover, trivial updates are also
7517 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
7518 occasionally, since simplification is more powerful by default.
7520 * typedef: proper support for polymorphic sets, which contain extra
7521 type-variables in the term.
7523 * Simplifier: automatically reasons about transitivity chains
7524 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
7525 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
7526 old proofs break occasionally as simplification may now solve more
7527 goals than previously.
7529 * Simplifier: converts x <= y into x = y if assumption y <= x is
7530 present. Works for all partial orders (class "order"), in particular
7531 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
7534 * Simplifier: new simproc for "let x = a in f x". If a is a free or
7535 bound variable or a constant then the let is unfolded. Otherwise
7536 first a is simplified to b, and then f b is simplified to g. If
7537 possible we abstract b from g arriving at "let x = b in h x",
7538 otherwise we unfold the let and arrive at g. The simproc can be
7539 enabled/disabled by the reference use_let_simproc. Potential
7540 INCOMPATIBILITY since simplification is more powerful by default.
7542 * Classical reasoning: the meson method now accepts theorems as arguments.
7544 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
7545 jobs to provide advice on the provability of subgoals.
7547 * Theory OrderedGroup and Ring_and_Field: various additions and
7548 improvements to faciliate calculations involving equalities and
7551 The following theorems have been eliminated or modified
7554 abs_eq now named abs_of_nonneg
7555 abs_of_ge_0 now named abs_of_nonneg
7556 abs_minus_eq now named abs_of_nonpos
7557 imp_abs_id now named abs_of_nonneg
7558 imp_abs_neg_id now named abs_of_nonpos
7559 mult_pos now named mult_pos_pos
7560 mult_pos_le now named mult_nonneg_nonneg
7561 mult_pos_neg_le now named mult_nonneg_nonpos
7562 mult_pos_neg2_le now named mult_nonneg_nonpos2
7563 mult_neg now named mult_neg_neg
7564 mult_neg_le now named mult_nonpos_nonpos
7566 * The following lemmas in Ring_and_Field have been added to the simplifier:
7569 not_square_less_zero
7571 The following lemmas have been deleted from Real/RealPow:
7581 * Theory Parity: added rules for simplifying exponents.
7585 The following theorems have been eliminated or modified
7588 list_all_Nil now named list_all.simps(1)
7589 list_all_Cons now named list_all.simps(2)
7590 list_all_conv now named list_all_iff
7591 set_mem_eq now named mem_iff
7593 * Theories SetsAndFunctions and BigO (see HOL/Library) support
7594 asymptotic "big O" calculations. See the notes in BigO.thy.
7599 * Theory RealDef: better support for embedding natural numbers and
7600 integers in the reals.
7602 The following theorems have been eliminated or modified
7605 exp_ge_add_one_self now requires no hypotheses
7606 real_of_int_add reversed direction of equality (use [symmetric])
7607 real_of_int_minus reversed direction of equality (use [symmetric])
7608 real_of_int_diff reversed direction of equality (use [symmetric])
7609 real_of_int_mult reversed direction of equality (use [symmetric])
7611 * Theory RComplete: expanded support for floor and ceiling functions.
7613 * Theory Ln is new, with properties of the natural logarithm
7615 * Hyperreal: There is a new type constructor "star" for making
7616 nonstandard types. The old type names are now type synonyms:
7620 hcomplex = complex star
7622 * Hyperreal: Many groups of similarly-defined constants have been
7623 replaced by polymorphic versions (INCOMPATIBILITY):
7625 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
7627 starset <-- starsetNat, starsetC
7628 *s* <-- *sNat*, *sc*
7629 starset_n <-- starsetNat_n, starsetC_n
7630 *sn* <-- *sNatn*, *scn*
7631 InternalSets <-- InternalNatSets, InternalCSets
7633 starfun <-- starfun{Nat,Nat2,C,RC,CR}
7634 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
7635 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
7636 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
7637 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
7639 * Hyperreal: Many type-specific theorems have been removed in favor of
7640 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
7642 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
7643 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
7644 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
7645 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
7646 right_minus <-- hypreal_add_minus
7647 left_minus <-- {hypreal,hcomplex}_add_minus_left
7648 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
7649 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
7650 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
7651 mult_1_right <-- hcomplex_mult_one_right
7652 mult_zero_left <-- hcomplex_mult_zero_left
7653 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
7654 right_distrib <-- hypnat_add_mult_distrib2
7655 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
7656 right_inverse <-- hypreal_mult_inverse
7657 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
7658 order_refl <-- {hypreal,hypnat}_le_refl
7659 order_trans <-- {hypreal,hypnat}_le_trans
7660 order_antisym <-- {hypreal,hypnat}_le_anti_sym
7661 order_less_le <-- {hypreal,hypnat}_less_le
7662 linorder_linear <-- {hypreal,hypnat}_le_linear
7663 add_left_mono <-- {hypreal,hypnat}_add_left_mono
7664 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
7665 add_nonneg_nonneg <-- hypreal_le_add_order
7667 * Hyperreal: Separate theorems having to do with type-specific
7668 versions of constants have been merged into theorems that apply to the
7669 new polymorphic constants (INCOMPATIBILITY):
7671 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
7672 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
7673 STAR_Un <-- {STAR,NatStar,STARC}_Un
7674 STAR_Int <-- {STAR,NatStar,STARC}_Int
7675 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
7676 STAR_subset <-- {STAR,NatStar,STARC}_subset
7677 STAR_mem <-- {STAR,NatStar,STARC}_mem
7678 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
7679 STAR_diff <-- {STAR,STARC}_diff
7680 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
7681 STARC_hcomplex_of_complex}_image_subset
7682 starset_n_Un <-- starset{Nat,C}_n_Un
7683 starset_n_Int <-- starset{Nat,C}_n_Int
7684 starset_n_Compl <-- starset{Nat,C}_n_Compl
7685 starset_n_diff <-- starset{Nat,C}_n_diff
7686 InternalSets_Un <-- Internal{Nat,C}Sets_Un
7687 InternalSets_Int <-- Internal{Nat,C}Sets_Int
7688 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
7689 InternalSets_diff <-- Internal{Nat,C}Sets_diff
7690 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
7691 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
7692 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
7693 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
7694 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
7695 starfun <-- starfun{Nat,Nat2,C,RC,CR}
7696 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
7697 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
7698 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
7699 starfun_diff <-- starfun{C,RC,CR}_diff
7700 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
7701 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
7702 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
7703 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
7704 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
7705 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
7706 starfun_Id <-- starfunC_Id
7707 starfun_approx <-- starfun{Nat,CR}_approx
7708 starfun_capprox <-- starfun{C,RC}_capprox
7709 starfun_abs <-- starfunNat_rabs
7710 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
7711 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
7712 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
7713 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
7714 starfun_add_capprox <-- starfun{C,RC}_add_capprox
7715 starfun_add_approx <-- starfunCR_add_approx
7716 starfun_inverse_inverse <-- starfunC_inverse_inverse
7717 starfun_divide <-- starfun{C,CR,RC}_divide
7718 starfun_n <-- starfun{Nat,C}_n
7719 starfun_n_mult <-- starfun{Nat,C}_n_mult
7720 starfun_n_add <-- starfun{Nat,C}_n_add
7721 starfun_n_add_minus <-- starfunNat_n_add_minus
7722 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
7723 starfun_n_minus <-- starfun{Nat,C}_n_minus
7724 starfun_n_eq <-- starfun{Nat,C}_n_eq
7726 star_n_add <-- {hypreal,hypnat,hcomplex}_add
7727 star_n_minus <-- {hypreal,hcomplex}_minus
7728 star_n_diff <-- {hypreal,hcomplex}_diff
7729 star_n_mult <-- {hypreal,hcomplex}_mult
7730 star_n_inverse <-- {hypreal,hcomplex}_inverse
7731 star_n_le <-- {hypreal,hypnat}_le
7732 star_n_less <-- {hypreal,hypnat}_less
7733 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
7734 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
7735 star_n_abs <-- hypreal_hrabs
7736 star_n_divide <-- hcomplex_divide
7738 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
7739 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
7740 star_of_diff <-- hypreal_of_real_diff
7741 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
7742 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
7743 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
7744 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
7745 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
7746 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
7747 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
7748 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
7749 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
7750 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
7751 star_of_number_of <-- {hypreal,hcomplex}_number_of
7752 star_of_number_less <-- number_of_less_hypreal_of_real_iff
7753 star_of_number_le <-- number_of_le_hypreal_of_real_iff
7754 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
7755 star_of_less_number <-- hypreal_of_real_less_number_of_iff
7756 star_of_le_number <-- hypreal_of_real_le_number_of_iff
7757 star_of_power <-- hypreal_of_real_power
7758 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
7760 * Hyperreal: new method "transfer" that implements the transfer
7761 principle of nonstandard analysis. With a subgoal that mentions
7762 nonstandard types like "'a star", the command "apply transfer"
7763 replaces it with an equivalent one that mentions only standard types.
7764 To be successful, all free variables must have standard types; non-
7765 standard variables must have explicit universal quantifiers.
7767 * Hyperreal: A theory of Taylor series.
7772 * Discontinued special version of 'constdefs' (which used to support
7773 continuous functions) in favor of the general Pure one with full
7776 * New simplification procedure for solving continuity conditions; it
7777 is much faster on terms with many nested lambda abstractions (cubic
7778 instead of exponential time).
7780 * New syntax for domain package: selector names are now optional.
7781 Parentheses should be omitted unless argument is lazy, for example:
7783 domain 'a stream = cons "'a" (lazy "'a stream")
7785 * New command 'fixrec' for defining recursive functions with pattern
7786 matching; defining multiple functions with mutual recursion is also
7787 supported. Patterns may include the constants cpair, spair, up, sinl,
7788 sinr, or any data constructor defined by the domain package. The given
7789 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
7790 syntax and examples.
7792 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
7793 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
7794 but the proof obligation additionally includes an admissibility
7795 requirement. The packages generate instances of class cpo or pcpo,
7796 with continuity and strictness theorems for Rep and Abs.
7798 * HOLCF: Many theorems have been renamed according to a more standard naming
7799 scheme (INCOMPATIBILITY):
7801 foo_inject: "foo$x = foo$y ==> x = y"
7802 foo_eq: "(foo$x = foo$y) = (x = y)"
7803 foo_less: "(foo$x << foo$y) = (x << y)"
7804 foo_strict: "foo$UU = UU"
7805 foo_defined: "... ==> foo$x ~= UU"
7806 foo_defined_iff: "(foo$x = UU) = (x = UU)"
7811 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
7812 including the First Isomorphism Theorem (on quotienting by the kernel
7815 * ZF/Simplifier: install second copy of type solver that actually
7816 makes use of TC rules declared to Isar proof contexts (or locales);
7817 the old version is still required for ML proof scripts.
7822 * Converted to Isar theory format; use locales instead of axiomatic
7828 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
7831 * Pure/library.ML no longer defines its own option datatype, but uses
7832 that of the SML basis, which has constructors NONE and SOME instead of
7833 None and Some, as well as exception Option.Option instead of OPTION.
7834 The functions the, if_none, is_some, is_none have been adapted
7835 accordingly, while Option.map replaces apsome.
7837 * Pure/library.ML: the exception LIST has been given up in favour of
7838 the standard exceptions Empty and Subscript, as well as
7839 Library.UnequalLengths. Function like Library.hd and Library.tl are
7840 superceded by the standard hd and tl functions etc.
7842 A number of basic list functions are no longer exported to the ML
7843 toplevel, as they are variants of predefined functions. The following
7844 suggests how one can translate existing code:
7846 rev_append xs ys = List.revAppend (xs, ys)
7847 nth_elem (i, xs) = List.nth (xs, i)
7848 last_elem xs = List.last xs
7849 flat xss = List.concat xss
7850 seq fs = List.app fs
7851 partition P xs = List.partition P xs
7852 mapfilter f xs = List.mapPartial f xs
7854 * Pure/library.ML: several combinators for linear functional
7855 transformations, notably reverse application and composition:
7858 (x, y) |-> f f #-> g
7860 * Pure/library.ML: introduced/changed precedence of infix operators:
7862 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
7864 infix 3 o oo ooo oooo;
7865 infix 4 ~~ upto downto;
7867 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
7870 * Pure/library.ML: natural list combinators fold, fold_rev, and
7871 fold_map support linear functional transformations and nesting. For
7874 fold f [x1, ..., xN] y =
7875 y |> f x1 |> ... |> f xN
7877 (fold o fold) f [xs1, ..., xsN] y =
7878 y |> fold f xs1 |> ... |> fold f xsN
7880 fold f [x1, ..., xN] =
7883 (fold o fold) f [xs1, ..., xsN] =
7884 fold f xs1 #> ... #> fold f xsN
7886 * Pure/library.ML: the following selectors on type 'a option are
7889 the: 'a option -> 'a (*partial*)
7890 these: 'a option -> 'a where 'a = 'b list
7891 the_default: 'a -> 'a option -> 'a
7892 the_list: 'a option -> 'a list
7894 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
7895 basic operations for association lists, following natural argument
7896 order; moreover the explicit equality predicate passed here avoids
7897 potentially expensive polymorphic runtime equality checks.
7898 The old functions may be expressed as follows:
7900 assoc = uncurry (AList.lookup (op =))
7901 assocs = these oo AList.lookup (op =)
7902 overwrite = uncurry (AList.update (op =)) o swap
7904 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
7906 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
7907 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
7909 replacing make_keylist and keyfilter (occassionally used)
7912 make_keylist = AList.make
7913 keyfilter = AList.find (op =)
7915 * eq_fst and eq_snd now take explicit equality parameter, thus
7916 avoiding eqtypes. Naive rewrites:
7918 eq_fst = eq_fst (op =)
7919 eq_snd = eq_snd (op =)
7921 * Removed deprecated apl and apr (rarely used).
7924 apl (n, op) =>>= curry op n
7925 apr (op, m) =>>= fn n => op (n, m)
7927 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
7928 provides a reasonably efficient light-weight implementation of sets as
7931 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
7932 few new operations; existing lookup and update are now curried to
7933 follow natural argument order (for use with fold etc.);
7934 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
7936 * Pure/General: output via the Isabelle channels of
7937 writeln/warning/error etc. is now passed through Output.output, with a
7938 hook for arbitrary transformations depending on the print_mode
7939 (cf. Output.add_mode -- the first active mode that provides a output
7940 function wins). Already formatted output may be embedded into further
7941 text via Output.raw; the result of Pretty.string_of/str_of and derived
7942 functions (string_of_term/cterm/thm etc.) is already marked raw to
7943 accommodate easy composition of diagnostic messages etc. Programmers
7944 rarely need to care about Output.output or Output.raw at all, with
7945 some notable exceptions: Output.output is required when bypassing the
7946 standard channels (writeln etc.), or in token translations to produce
7947 properly formatted results; Output.raw is required when capturing
7948 already output material that will eventually be presented to the user
7949 a second time. For the default print mode, both Output.output and
7950 Output.raw have no effect.
7952 * Pure/General: Output.time_accumulator NAME creates an operator ('a
7953 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
7954 cumulative results are displayed at the end of a batch session.
7956 * Pure/General: File.sysify_path and File.quote_sysify path have been
7957 replaced by File.platform_path and File.shell_path (with appropriate
7958 hooks). This provides a clean interface for unusual systems where the
7959 internal and external process view of file names are different.
7961 * Pure: more efficient orders for basic syntactic entities: added
7962 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
7963 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
7964 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
7965 orders now -- potential INCOMPATIBILITY for code that depends on a
7966 particular order for Symtab.keys, Symtab.dest, etc. (consider using
7967 Library.sort_strings on result).
7969 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
7970 fold_types traverse types/terms from left to right, observing natural
7971 argument order. Supercedes previous foldl_XXX versions, add_frees,
7972 add_vars etc. have been adapted as well: INCOMPATIBILITY.
7974 * Pure: name spaces have been refined, with significant changes of the
7975 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
7976 to extern(_table). The plain name entry path is superceded by a
7977 general 'naming' context, which also includes the 'policy' to produce
7978 a fully qualified name and external accesses of a fully qualified
7979 name; NameSpace.extend is superceded by context dependent
7980 Sign.declare_name. Several theory and proof context operations modify
7981 the naming context. Especially note Theory.restore_naming and
7982 ProofContext.restore_naming to get back to a sane state; note that
7983 Theory.add_path is no longer sufficient to recover from
7984 Theory.absolute_path in particular.
7986 * Pure: new flags short_names (default false) and unique_names
7987 (default true) for controlling output of qualified names. If
7988 short_names is set, names are printed unqualified. If unique_names is
7989 reset, the name prefix is reduced to the minimum required to achieve
7990 the original result when interning again, even if there is an overlap
7991 with earlier declarations.
7993 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
7994 now 'extend', and 'merge' gets an additional Pretty.pp argument
7995 (useful for printing error messages). INCOMPATIBILITY.
7997 * Pure: major reorganization of the theory context. Type Sign.sg and
7998 Theory.theory are now identified, referring to the universal
7999 Context.theory (see Pure/context.ML). Actual signature and theory
8000 content is managed as theory data. The old code and interfaces were
8001 spread over many files and structures; the new arrangement introduces
8002 considerable INCOMPATIBILITY to gain more clarity:
8004 Context -- theory management operations (name, identity, inclusion,
8005 parents, ancestors, merge, etc.), plus generic theory data;
8007 Sign -- logical signature and syntax operations (declaring consts,
8008 types, etc.), plus certify/read for common entities;
8010 Theory -- logical theory operations (stating axioms, definitions,
8011 oracles), plus a copy of logical signature operations (consts,
8012 types, etc.); also a few basic management operations (Theory.copy,
8015 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
8016 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
8017 for convenience -- they merely return the theory.
8019 * Pure: type Type.tsig is superceded by theory in most interfaces.
8021 * Pure: the Isar proof context type is already defined early in Pure
8022 as Context.proof (note that ProofContext.context and Proof.context are
8023 aliases, where the latter is the preferred name). This enables other
8024 Isabelle components to refer to that type even before Isar is present.
8026 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
8027 typeK, constK, axiomK, oracleK), but provide explicit operations for
8028 any of these kinds. For example, Sign.intern typeK is now
8029 Sign.intern_type, Theory.hide_space Sign.typeK is now
8030 Theory.hide_types. Also note that former
8031 Theory.hide_classes/types/consts are now
8032 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
8033 internalize their arguments! INCOMPATIBILITY.
8035 * Pure: get_thm interface (of PureThy and ProofContext) expects
8036 datatype thmref (with constructors Name and NameSelection) instead of
8037 plain string -- INCOMPATIBILITY;
8039 * Pure: cases produced by proof methods specify options, where NONE
8040 means to remove case bindings -- INCOMPATIBILITY in
8043 * Pure: the following operations retrieve axioms or theorems from a
8044 theory node or theory hierarchy, respectively:
8046 Theory.axioms_of: theory -> (string * term) list
8047 Theory.all_axioms_of: theory -> (string * term) list
8048 PureThy.thms_of: theory -> (string * thm) list
8049 PureThy.all_thms_of: theory -> (string * thm) list
8051 * Pure: print_tac now outputs the goal through the trace channel.
8053 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
8054 Reference Toplevel.debug (default false) controls detailed printing
8055 and tracing of low-level exceptions; Toplevel.profiling (default 0)
8056 controls execution profiling -- set to 1 for time and 2 for space
8057 (both increase the runtime).
8059 * Isar session: The initial use of ROOT.ML is now always timed,
8060 i.e. the log will show the actual process times, in contrast to the
8061 elapsed wall-clock time that the outer shell wrapper produces.
8063 * Simplifier: improved handling of bound variables (nameless
8064 representation, avoid allocating new strings). Simprocs that invoke
8065 the Simplifier recursively should use Simplifier.inherit_bounds to
8066 avoid local name clashes. Failure to do so produces warnings
8067 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
8068 for further details.
8070 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
8071 bindings for all theorems stored within a given theory; this may help
8072 in porting non-Isar theories to Isar ones, while keeping ML proof
8073 scripts for the time being.
8075 * ML operator HTML.with_charset specifies the charset begin used for
8076 generated HTML files. For example:
8078 HTML.with_charset "utf-8" use_thy "Hebrew";
8079 HTML.with_charset "utf-8" use_thy "Chinese";
8084 * Allow symlinks to all proper Isabelle executables (Isabelle,
8085 isabelle, isatool etc.).
8087 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
8088 isatool doc, isatool mkdir, display_drafts etc.).
8090 * isatool usedir: option -f allows specification of the ML file to be
8091 used by Isabelle; default is ROOT.ML.
8093 * New isatool version outputs the version identifier of the Isabelle
8094 distribution being used.
8096 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
8097 (containing Boolean satisfiability problems) into Isabelle/HOL
8102 New in Isabelle2004 (April 2004)
8103 --------------------------------
8107 * Provers/order.ML: new efficient reasoner for partial and linear orders.
8108 Replaces linorder.ML.
8110 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
8111 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
8112 (\<a>...\<z>), are now considered normal letters, and can therefore
8113 be used anywhere where an ASCII letter (a...zA...Z) has until
8114 now. COMPATIBILITY: This obviously changes the parsing of some
8115 terms, especially where a symbol has been used as a binder, say
8116 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
8117 as an identifier. Fix it by inserting a space around former
8118 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
8119 existing theory and ML files.
8121 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
8123 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
8124 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
8125 a normal (but invisible) letter. For multiple letter subscripts repeat
8126 \<^isub> like this: x\<^isub>1\<^isub>2.
8128 * Pure: There are now sub-/superscripts that can span more than one
8129 character. Text between \<^bsub> and \<^esub> is set in subscript in
8130 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
8131 superscript. The new control characters are not identifier parts.
8133 * Pure: Control-symbols of the form \<^raw:...> will literally print the
8134 content of "..." to the latex file instead of \isacntrl... . The "..."
8135 may consist of any printable characters excluding the end bracket >.
8137 * Pure: Using new Isar command "finalconsts" (or the ML functions
8138 Theory.add_finals or Theory.add_finals_i) it is now possible to
8139 declare constants "final", which prevents their being given a definition
8140 later. It is useful for constants whose behaviour is fixed axiomatically
8141 rather than definitionally, such as the meta-logic connectives.
8143 * Pure: 'instance' now handles general arities with general sorts
8144 (i.e. intersections of classes),
8146 * Presentation: generated HTML now uses a CSS style sheet to make layout
8147 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
8148 It can be changed to alter the colors/layout of generated pages.
8153 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
8154 cut_tac, subgoal_tac and thin_tac:
8155 - Now understand static (Isar) contexts. As a consequence, users of Isar
8156 locales are no longer forced to write Isar proof scripts.
8157 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
8159 - INCOMPATIBILITY: names of variables to be instantiated may no
8160 longer be enclosed in quotes. Instead, precede variable name with `?'.
8161 This is consistent with the instantiation attribute "where".
8163 * Attributes "where" and "of":
8164 - Now take type variables of instantiated theorem into account when reading
8165 the instantiation string. This fixes a bug that caused instantiated
8166 theorems to have too special types in some circumstances.
8167 - "where" permits explicit instantiations of type variables.
8169 * Calculation commands "moreover" and "also" no longer interfere with
8170 current facts ("this"), admitting arbitrary combinations with "then"
8174 - Goal statements involving the context element "includes" no longer
8175 generate theorems with internal delta predicates (those ending on
8176 "_axioms") in the premise.
8177 Resolve particular premise with <locale>.intro to obtain old form.
8178 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
8179 specification and "includes" elements in goal statement.
8180 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
8181 [intro?] and [elim?] (respectively) by default.
8182 - Experimental command for instantiation of locales in proof contexts:
8183 instantiate <label>[<attrs>]: <loc>
8184 Instantiates locale <loc> and adds all its theorems to the current context
8185 taking into account their attributes. Label and attrs are optional
8186 modifiers, like in theorem declarations. If present, names of
8187 instantiated theorems are qualified with <label>, and the attributes
8188 <attrs> are applied after any attributes these theorems might have already.
8189 If the locale has assumptions, a chained fact of the form
8190 "<loc> t1 ... tn" is expected from which instantiations of the parameters
8191 are derived. The command does not support old-style locales declared
8192 with "locale (open)".
8193 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
8195 * HOL: Tactic emulation methods induct_tac and case_tac understand static
8201 * Proof import: new image HOL4 contains the imported library from
8202 the HOL4 system with about 2500 theorems. It is imported by
8203 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
8204 can be used like any other Isabelle image. See
8205 HOL/Import/HOL/README for more information.
8208 - Much improved handling of linear and partial orders.
8209 Reasoners for linear and partial orders are set up for type classes
8210 "linorder" and "order" respectively, and are added to the default simpset
8211 as solvers. This means that the simplifier can build transitivity chains
8212 to solve goals from the assumptions.
8213 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
8214 of blast or auto after simplification become unnecessary because the goal
8215 is solved by simplification already.
8217 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
8218 all proved in axiomatic type classes for semirings, rings and fields.
8221 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
8222 now formalized using the Ring_and_Field theory mentioned above.
8223 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
8224 than before, because now they are set up once in a generic manner.
8225 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
8226 Look for the general versions in Ring_and_Field (and Power if they concern
8229 * Type "rat" of the rational numbers is now available in HOL-Complex.
8232 - Record types are now by default printed with their type abbreviation
8233 instead of the list of all field types. This can be configured via
8234 the reference "print_record_type_abbr".
8235 - Simproc "record_upd_simproc" for simplification of multiple updates added
8236 (not enabled by default).
8237 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
8238 EX x. x = sel r to True (not enabled by default).
8239 - Tactic "record_split_simp_tac" to split and simplify records added.
8241 * 'specification' command added, allowing for definition by
8242 specification. There is also an 'ax_specification' command that
8243 introduces the new constants axiomatically.
8245 * arith(_tac) is now able to generate counterexamples for reals as well.
8247 * HOL-Algebra: new locale "ring" for non-commutative rings.
8249 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
8250 definitions, thanks to Sava Krsti\'{c} and John Matthews.
8252 * HOL-Matrix: a first theory for matrices in HOL with an application of
8253 matrix theory to linear programming.
8255 * Unions and Intersections:
8256 The latex output syntax of UN and INT has been changed
8257 from "\Union x \in A. B" to "\Union_{x \in A} B"
8258 i.e. the index formulae has become a subscript.
8259 Similarly for "\Union x. B", and for \Inter instead of \Union.
8261 * Unions and Intersections over Intervals:
8262 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
8263 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
8264 like in normal math, and corresponding versions for < and for intersection.
8266 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
8267 lexicographic dictonary ordering has been added as "lexord".
8269 * ML: the legacy theory structures Int and List have been removed. They had
8270 conflicted with ML Basis Library structures having the same names.
8272 * 'refute' command added to search for (finite) countermodels. Only works
8273 for a fragment of HOL. The installation of an external SAT solver is
8274 highly recommended. See "HOL/Refute.thy" for details.
8276 * 'quickcheck' command: Allows to find counterexamples by evaluating
8277 formulae under an assignment of free variables to random values.
8278 In contrast to 'refute', it can deal with inductive datatypes,
8279 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
8285 * Streams now come with concatenation and are part of the HOLCF image
8289 New in Isabelle2003 (May 2003)
8290 ------------------------------
8294 * Provers/simplifier:
8296 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
8297 Assumptions are now subject to complete mutual simplification,
8298 not just from left to right. The simplifier now preserves
8299 the order of assumptions.
8301 Potential INCOMPATIBILITY:
8303 -- simp sometimes diverges where the old version did
8304 not, e.g. invoking simp on the goal
8306 [| P (f x); y = x; f x = f y |] ==> Q
8308 now gives rise to the infinite reduction sequence
8310 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
8312 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
8315 -- Tactics combining classical reasoner and simplification (such as auto)
8316 are also affected by this change, because many of them rely on
8317 simp. They may sometimes diverge as well or yield a different numbers
8318 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
8319 in case of problems. Sometimes subsequent calls to the classical
8320 reasoner will fail because a preceeding call to the simplifier too
8321 eagerly simplified the goal, e.g. deleted redundant premises.
8323 - The simplifier trace now shows the names of the applied rewrite rules
8325 - You can limit the number of recursive invocations of the simplifier
8326 during conditional rewriting (where the simplifie tries to solve the
8327 conditions before applying the rewrite rule):
8328 ML "simp_depth_limit := n"
8329 where n is an integer. Thus you can force termination where previously
8330 the simplifier would diverge.
8332 - Accepts free variables as head terms in congruence rules. Useful in Isar.
8334 - No longer aborts on failed congruence proof. Instead, the
8335 congruence is ignored.
8337 * Pure: New generic framework for extracting programs from constructive
8338 proofs. See HOL/Extraction.thy for an example instantiation, as well
8339 as HOL/Extraction for some case studies.
8341 * Pure: The main goal of the proof state is no longer shown by default, only
8342 the subgoals. This behaviour is controlled by a new flag.
8343 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
8344 (ML: Proof.show_main_goal).
8346 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
8347 rules whose conclusion matches subgoal 1:
8348 PG menu: Isabelle/Isar -> Show me -> matching rules
8349 The rules are ordered by how closely they match the subgoal.
8350 In particular, rules that solve a subgoal outright are displayed first
8351 (or rather last, the way they are printed).
8352 (ML: ProofGeneral.print_intros())
8354 * Pure: New flag trace_unify_fail causes unification to print
8355 diagnostic information (PG: in trace buffer) when it fails. This is
8356 useful for figuring out why single step proofs like rule, erule or
8359 * Pure: Locale specifications now produce predicate definitions
8360 according to the body of text (covering assumptions modulo local
8361 definitions); predicate "loc_axioms" covers newly introduced text,
8362 while "loc" is cumulative wrt. all included locale expressions; the
8363 latter view is presented only on export into the global theory
8364 context; potential INCOMPATIBILITY, use "(open)" option to fall back
8365 on the old view without predicates;
8367 * Pure: predefined locales "var" and "struct" are useful for sharing
8368 parameters (as in CASL, for example); just specify something like
8369 ``var x + var y + struct M'' as import;
8371 * Pure: improved thms_containing: proper indexing of facts instead of
8372 raw theorems; check validity of results wrt. current name space;
8373 include local facts of proof configuration (also covers active
8374 locales), cover fixed variables in index; may use "_" in term
8375 specification; an optional limit for the number of printed facts may
8376 be given (the default is 40);
8378 * Pure: disallow duplicate fact bindings within new-style theory files
8381 * Provers: improved induct method: assumptions introduced by case
8382 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
8383 the goal statement); "foo" still refers to all facts collectively;
8385 * Provers: the function blast.overloaded has been removed: all constants
8386 are regarded as potentially overloaded, which improves robustness in exchange
8387 for slight decrease in efficiency;
8389 * Provers/linorder: New generic prover for transitivity reasoning over
8390 linear orders. Note: this prover is not efficient!
8392 * Isar: preview of problems to finish 'show' now produce an error
8393 rather than just a warning (in interactive mode);
8400 - Produces a counter example if it cannot prove a goal.
8401 Note that the counter example may be spurious if the goal is not a formula
8402 of quantifier-free linear arithmetic.
8403 In ProofGeneral the counter example appears in the trace buffer.
8405 - Knows about div k and mod k where k is a numeral of type nat or int.
8407 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
8408 linear arithmetic fails. This takes account of quantifiers and divisibility.
8409 Presburger arithmetic can also be called explicitly via presburger(_tac).
8411 * simp's arithmetic capabilities have been enhanced a bit: it now
8412 takes ~= in premises into account (by performing a case split);
8414 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
8415 are distributed over a sum of terms;
8417 * New tactic "trans_tac" and method "trans" instantiate
8418 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
8421 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
8422 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
8424 * 'typedef' command has new option "open" to suppress the set
8427 * functions Min and Max on finite sets have been introduced (theory
8430 * attribute [symmetric] now works for relations as well; it turns
8431 (x,y) : R^-1 into (y,x) : R, and vice versa;
8433 * induct over a !!-quantified statement (say !!x1..xn):
8434 each "case" automatically performs "fix x1 .. xn" with exactly those names.
8436 * Map: `empty' is no longer a constant but a syntactic abbreviation for
8437 %x. None. Warning: empty_def now refers to the previously hidden definition
8440 * Algebra: formalization of classical algebra. Intended as base for
8441 any algebraic development in Isabelle. Currently covers group theory
8442 (up to Sylow's theorem) and ring theory (Universal Property of
8443 Univariate Polynomials). Contributions welcome;
8445 * GroupTheory: deleted, since its material has been moved to Algebra;
8447 * Complex: new directory of the complex numbers with numeric constants,
8448 nonstandard complex numbers, and some complex analysis, standard and
8449 nonstandard (Jacques Fleuriot);
8451 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
8453 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
8456 * Real/HahnBanach: updated and adapted to locales;
8458 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
8461 * UNITY: added the Meier-Sanders theory of progress sets;
8463 * MicroJava: bytecode verifier and lightweight bytecode verifier
8464 as abstract algorithms, instantiated to the JVM;
8466 * Bali: Java source language formalization. Type system, operational
8467 semantics, axiomatic semantics. Supported language features:
8468 classes, interfaces, objects,virtual methods, static methods,
8469 static/instance fields, arrays, access modifiers, definite
8470 assignment, exceptions.
8475 * ZF/Constructible: consistency proof for AC (Gdel's constructible
8478 * Main ZF: virtually all theories converted to new-style format;
8483 * Pure: Tactic.prove provides sane interface for internal proofs;
8484 omits the infamous "standard" operation, so this is more appropriate
8485 than prove_goalw_cterm in many situations (e.g. in simprocs);
8487 * Pure: improved error reporting of simprocs;
8489 * Provers: Simplifier.simproc(_i) provides sane interface for setting
8493 *** Document preparation ***
8495 * uses \par instead of \\ for line breaks in theory text. This may
8496 shift some page breaks in large documents. To get the old behaviour
8497 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
8499 * minimized dependencies of isabelle.sty and isabellesym.sty on
8502 * \<euro> now needs package babel/greek instead of marvosym (which
8505 * normal size for \<zero>...\<nine> (uses \mathbf instead of
8510 New in Isabelle2002 (March 2002)
8511 --------------------------------
8513 *** Document preparation ***
8515 * greatly simplified document preparation setup, including more
8516 graceful interpretation of isatool usedir -i/-d/-D options, and more
8517 instructive isatool mkdir; users should basically be able to get
8518 started with "isatool mkdir HOL Test && isatool make"; alternatively,
8519 users may run a separate document processing stage manually like this:
8520 "isatool usedir -D output HOL Test && isatool document Test/output";
8522 * theory dependency graph may now be incorporated into documents;
8523 isatool usedir -g true will produce session_graph.eps/.pdf for use
8524 with \includegraphics of LaTeX;
8526 * proper spacing of consecutive markup elements, especially text
8527 blocks after section headings;
8529 * support bold style (for single symbols only), input syntax is like
8530 this: "\<^bold>\<alpha>" or "\<^bold>A";
8532 * \<bullet> is now output as bold \cdot by default, which looks much
8533 better in printed text;
8535 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
8536 note that these symbols are currently unavailable in Proof General /
8537 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
8539 * isatool latex no longer depends on changed TEXINPUTS, instead
8540 isatool document copies the Isabelle style files to the target
8546 * Pure/Provers: improved proof by cases and induction;
8547 - 'case' command admits impromptu naming of parameters (such as
8549 - 'induct' method divinates rule instantiation from the inductive
8550 claim; no longer requires excessive ?P bindings for proper
8551 instantiation of cases;
8552 - 'induct' method properly enumerates all possibilities of set/type
8553 rules; as a consequence facts may be also passed through *type*
8554 rules without further ado;
8555 - 'induct' method now derives symbolic cases from the *rulified*
8556 rule (before it used to rulify cases stemming from the internal
8557 atomized version); this means that the context of a non-atomic
8558 statement becomes is included in the hypothesis, avoiding the
8559 slightly cumbersome show "PROP ?case" form;
8560 - 'induct' may now use elim-style induction rules without chaining
8561 facts, using ``missing'' premises from the goal state; this allows
8562 rules stemming from inductive sets to be applied in unstructured
8563 scripts, while still benefitting from proper handling of non-atomic
8564 statements; NB: major inductive premises need to be put first, all
8565 the rest of the goal is passed through the induction;
8566 - 'induct' proper support for mutual induction involving non-atomic
8567 rule statements (uses the new concept of simultaneous goals, see
8569 - append all possible rule selections, but only use the first
8570 success (no backtracking);
8571 - removed obsolete "(simplified)" and "(stripped)" options of methods;
8572 - undeclared rule case names default to numbers 1, 2, 3, ...;
8573 - added 'print_induct_rules' (covered by help item in recent Proof
8575 - moved induct/cases attributes to Pure, methods to Provers;
8576 - generic method setup instantiated for FOL and HOL;
8578 * Pure: support multiple simultaneous goal statements, for example
8579 "have a: A and b: B" (same for 'theorem' etc.); being a pure
8580 meta-level mechanism, this acts as if several individual goals had
8581 been stated separately; in particular common proof methods need to be
8582 repeated in order to cover all claims; note that a single elimination
8583 step is *not* sufficient to establish the two conjunctions, so this
8586 assume "A & B" then have A and B .. (*".." fails*)
8588 better use "obtain" in situations as above; alternative refer to
8589 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
8591 * Pure: proper integration with ``locales''; unlike the original
8592 version by Florian Kammller, Isar locales package high-level proof
8593 contexts rather than raw logical ones (e.g. we admit to include
8594 attributes everywhere); operations on locales include merge and
8595 rename; support for implicit arguments (``structures''); simultaneous
8596 type-inference over imports and text; see also HOL/ex/Locales.thy for
8599 * Pure: the following commands have been ``localized'', supporting a
8600 target locale specification "(in name)": 'lemma', 'theorem',
8601 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
8602 stored both within the locale and at the theory level (exported and
8603 qualified by the locale name);
8605 * Pure: theory goals may now be specified in ``long'' form, with
8606 ad-hoc contexts consisting of arbitrary locale elements. for example
8607 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
8608 definitions may be given, too); the result is a meta-level rule with
8609 the context elements being discharged in the obvious way;
8611 * Pure: new proof command 'using' allows to augment currently used
8612 facts after a goal statement ('using' is syntactically analogous to
8613 'apply', but acts on the goal's facts only); this allows chained facts
8614 to be separated into parts given before and after a claim, as in
8615 ``from a and b have C using d and e <proof>'';
8617 * Pure: renamed "antecedent" case to "rule_context";
8619 * Pure: new 'judgment' command records explicit information about the
8620 object-logic embedding (used by several tools internally); no longer
8621 use hard-wired "Trueprop";
8623 * Pure: added 'corollary' command;
8625 * Pure: fixed 'token_translation' command;
8627 * Pure: removed obsolete 'exported' attribute;
8629 * Pure: dummy pattern "_" in is/let is now automatically lifted over
8630 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
8631 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
8633 * Pure: method 'atomize' presents local goal premises as object-level
8634 statements (atomic meta-level propositions); setup controlled via
8635 rewrite rules declarations of 'atomize' attribute; example
8636 application: 'induct' method with proper rule statements in improper
8639 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
8640 now consider the syntactic context of assumptions, giving a better
8641 chance to get type-inference of the arguments right (this is
8642 especially important for locales);
8644 * Pure: "sorry" no longer requires quick_and_dirty in interactive
8647 * Pure/obtain: the formal conclusion "thesis", being marked as
8648 ``internal'', may no longer be reference directly in the text;
8649 potential INCOMPATIBILITY, may need to use "?thesis" in rare
8652 * Pure: generic 'sym' attribute which declares a rule both as pure
8653 'elim?' and for the 'symmetric' operation;
8655 * Pure: marginal comments ``--'' may now occur just anywhere in the
8656 text; the fixed correlation with particular command syntax has been
8659 * Pure: new method 'rules' is particularly well-suited for proof
8660 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
8661 but often produces more compact proof terms with less detours;
8663 * Pure/Provers/classical: simplified integration with pure rule
8664 attributes and methods; the classical "intro?/elim?/dest?"
8665 declarations coincide with the pure ones; the "rule" method no longer
8666 includes classically swapped intros; "intro" and "elim" methods no
8667 longer pick rules from the context; also got rid of ML declarations
8668 AddXIs/AddXEs/AddXDs; all of this has some potential for
8671 * Provers/classical: attribute 'swapped' produces classical inversions
8672 of introduction rules;
8674 * Provers/simplifier: 'simplified' attribute may refer to explicit
8675 rules instead of full simplifier context; 'iff' attribute handles
8678 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
8680 * HOL: 'recdef' now fails on unfinished automated proofs, use
8681 "(permissive)" option to recover old behavior;
8683 * HOL: 'inductive' no longer features separate (collective) attributes
8684 for 'intros' (was found too confusing);
8686 * HOL: properly declared induction rules less_induct and
8692 * HOL: moved over to sane numeral syntax; the new policy is as
8695 - 0 and 1 are polymorphic constants, which are defined on any
8696 numeric type (nat, int, real etc.);
8698 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
8699 binary representation internally;
8701 - type nat has special constructor Suc, and generally prefers Suc 0
8702 over 1::nat and Suc (Suc 0) over 2::nat;
8704 This change may cause significant problems of INCOMPATIBILITY; here
8705 are some hints on converting existing sources:
8707 - due to the new "num" token, "-0" and "-1" etc. are now atomic
8708 entities, so expressions involving "-" (unary or binary minus) need
8709 to be spaced properly;
8711 - existing occurrences of "1" may need to be constraint "1::nat" or
8712 even replaced by Suc 0; similar for old "2";
8714 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
8716 - remove all special provisions on numerals in proofs;
8718 * HOL: simp rules nat_number expand numerals on nat to Suc/0
8719 representation (depends on bin_arith_simps in the default context);
8721 * HOL: symbolic syntax for x^2 (numeral 2);
8723 * HOL: the class of all HOL types is now called "type" rather than
8724 "term"; INCOMPATIBILITY, need to adapt references to this type class
8725 in axclass/classes, instance/arities, and (usually rare) occurrences
8726 in typings (of consts etc.); internally the class is called
8727 "HOL.type", ML programs should refer to HOLogic.typeS;
8729 * HOL/record package improvements:
8730 - new derived operations "fields" to build a partial record section,
8731 "extend" to promote a fixed record to a record scheme, and
8732 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
8733 declared as simp by default;
8734 - shared operations ("more", "fields", etc.) now need to be always
8735 qualified) --- potential INCOMPATIBILITY;
8736 - removed "make_scheme" operations (use "make" with "extend") --
8738 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
8739 - provides cases/induct rules for use with corresponding Isar
8740 methods (for concrete records, record schemes, concrete more
8741 parts, and schematic more parts -- in that order);
8742 - internal definitions directly based on a light-weight abstract
8743 theory of product types over typedef rather than datatype;
8745 * HOL: generic code generator for generating executable ML code from
8746 specifications; specific support for HOL constructs such as inductive
8747 datatypes and sets, as well as recursive functions; can be invoked
8748 via 'generate_code' theory section;
8750 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
8752 * HOL: consolidated and renamed several theories. In particular:
8753 Ord.thy has been absorbed into HOL.thy
8754 String.thy has been absorbed into List.thy
8756 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
8757 (beware of argument permutation!);
8759 * HOL: linorder_less_split superseded by linorder_cases;
8761 * HOL/List: "nodups" renamed to "distinct";
8763 * HOL: added "The" definite description operator; move Hilbert's "Eps"
8764 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
8765 - Ex_def has changed, now need to use some_eq_ex
8767 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
8768 in this (rare) case use:
8770 delSWrapper "split_all_tac"
8771 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
8773 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
8776 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
8777 Isabelle's type classes, ^ on functions and relations has too general
8778 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
8779 necessary to attach explicit type constraints;
8781 * HOL/Relation: the prefix name of the infix "O" has been changed from
8782 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
8783 renamed accordingly (eg "compI" -> "rel_compI").
8785 * HOL: syntax translations now work properly with numerals and records
8788 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
8789 of "lam" -- INCOMPATIBILITY;
8791 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
8792 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
8793 renamed "Product_Type.unit";
8795 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
8797 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
8798 the "cases" method);
8800 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
8803 * HOL/IMP: updated and converted to new-style theory format; several
8804 parts turned into readable document, with proper Isar proof texts and
8805 some explanations (by Gerwin Klein);
8807 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
8809 * HOL-Hyperreal is now a logic image;
8814 * Isar: consts/constdefs supports mixfix syntax for continuous
8817 * Isar: domain package adapted to new-style theory format, e.g. see
8820 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
8821 potential INCOMPATIBILITY; now use plain induct_tac instead of former
8822 lift.induct_tac, always use UU instead of Undef;
8824 * HOLCF/IMP: updated and converted to new-style theory;
8829 * Isar: proper integration of logic-specific tools and packages,
8830 including theory commands '(co)inductive', '(co)datatype',
8831 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
8832 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
8834 * theory Main no longer includes AC; for the Axiom of Choice, base
8835 your theory on Main_ZFC;
8837 * the integer library now covers quotients and remainders, with many
8838 laws relating division to addition, multiplication, etc.;
8840 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
8841 typeless version of the formalism;
8843 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
8846 * ZF/Induct: new directory for examples of inductive definitions,
8847 including theory Multiset for multiset orderings; converted to
8848 new-style theory format;
8850 * ZF: many new theorems about lists, ordinals, etc.;
8855 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
8856 variable proof controls level of detail: 0 = no proofs (only oracle
8857 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
8858 also ref manual for further ML interfaces;
8860 * Pure/axclass: removed obsolete ML interface
8861 goal_subclass/goal_arity;
8863 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
8864 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
8865 separate tokens, so expressions involving minus need to be spaced
8868 * Pure/syntax: support non-oriented infixes, using keyword "infix"
8869 rather than "infixl" or "infixr";
8871 * Pure/syntax: concrete syntax for dummy type variables admits genuine
8872 sort constraint specifications in type inference; e.g. "x::_::foo"
8873 ensures that the type of "x" is of sort "foo" (but not necessarily a
8876 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
8877 control output of nested => (types); the default behavior is
8880 * Pure/syntax: builtin parse translation for "_constify" turns valued
8881 tokens into AST constants;
8883 * Pure/syntax: prefer later declarations of translations and print
8884 translation functions; potential INCOMPATIBILITY: need to reverse
8885 multiple declarations for same syntax element constant;
8887 * Pure/show_hyps reset by default (in accordance to existing Isar
8890 * Provers/classical: renamed addaltern to addafter, addSaltern to
8893 * Provers/clasimp: ``iff'' declarations now handle conditional rules
8896 * system: tested support for MacOS X; should be able to get Isabelle +
8897 Proof General to work in a plain Terminal after installing Poly/ML
8898 (e.g. from the Isabelle distribution area) and GNU bash alone
8899 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
8900 support requires further installations, e.g. from
8901 http://fink.sourceforge.net/);
8903 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
8905 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
8906 of 40 MB), cf. ML_OPTIONS;
8908 * system: Proof General keywords specification is now part of the
8909 Isabelle distribution (see etc/isar-keywords.el);
8911 * system: support for persistent Proof General sessions (refrain from
8912 outdating all loaded theories on startup); user may create writable
8913 logic images like this: ``isabelle -q HOL Test'';
8915 * system: smart selection of Isabelle process versus Isabelle
8916 interface, accommodates case-insensitive file systems (e.g. HFS+); may
8917 run both "isabelle" and "Isabelle" even if file names are badly
8918 damaged (executable inspects the case of the first letter of its own
8919 name); added separate "isabelle-process" and "isabelle-interface";
8921 * system: refrain from any attempt at filtering input streams; no
8922 longer support ``8bit'' encoding of old isabelle font, instead proper
8923 iso-latin characters may now be used; the related isatools
8924 "symbolinput" and "nonascii" have disappeared as well;
8926 * system: removed old "xterm" interface (the print modes "xterm" and
8927 "xterm_color" are still available for direct use in a suitable
8932 New in Isabelle99-2 (February 2001)
8933 -----------------------------------
8935 *** Overview of INCOMPATIBILITIES ***
8937 * HOL: please note that theories in the Library and elsewhere often use the
8938 new-style (Isar) format; to refer to their theorems in an ML script you must
8939 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
8941 * HOL: inductive package no longer splits induction rule aggressively,
8942 but only as far as specified by the introductions given; the old
8943 format may be recovered via ML function complete_split_rule or attribute
8944 'split_rule (complete)';
8946 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
8947 gfp_Tarski to gfp_unfold;
8949 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
8951 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
8952 relation); infix "^^" has been renamed "``"; infix "``" has been
8953 renamed "`"; "univalent" has been renamed "single_valued";
8955 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
8958 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
8960 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
8962 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
8963 consequence, it is no longer monotonic wrt. the local goal context
8964 (which is now passed through the inductive cases);
8966 * Document preparation: renamed standard symbols \<ll> to \<lless> and
8967 \<gg> to \<ggreater>;
8970 *** Document preparation ***
8972 * \isabellestyle{NAME} selects version of Isabelle output (currently
8973 available: are "it" for near math-mode best-style output, "sl" for
8974 slanted text style, and "tt" for plain type-writer; if no
8975 \isabellestyle command is given, output is according to slanted
8978 * support sub/super scripts (for single symbols only), input syntax is
8979 like this: "A\<^sup>*" or "A\<^sup>\<star>";
8981 * some more standard symbols; see Appendix A of the system manual for
8982 the complete list of symbols defined in isabellesym.sty;
8984 * improved isabelle style files; more abstract symbol implementation
8985 (should now use \isamath{...} and \isatext{...} in custom symbol
8988 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
8989 state; Note that presentation of goal states does not conform to
8990 actual human-readable proof documents. Please do not include goal
8991 states into document output unless you really know what you are doing!
8993 * proper indentation of antiquoted output with proportional LaTeX
8996 * no_document ML operator temporarily disables LaTeX document
8999 * isatool unsymbolize tunes sources for plain ASCII communication;
9004 * Pure: Isar now suffers initial goal statements to contain unbound
9005 schematic variables (this does not conform to actual readable proof
9006 documents, due to unpredictable outcome and non-compositional proof
9007 checking); users who know what they are doing may use schematic goals
9008 for Prolog-style synthesis of proven results;
9010 * Pure: assumption method (an implicit finishing) now handles actual
9013 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
9014 initial goal, declare "that" only as Pure intro (only for single
9015 steps); the "that" rule assumption may now be involved in implicit
9016 finishing, thus ".." becomes a feasible for trivial obtains;
9018 * Pure: default proof step now includes 'intro_classes'; thus trivial
9019 instance proofs may be performed by "..";
9021 * Pure: ?thesis / ?this / "..." now work for pure meta-level
9024 * Pure: more robust selection of calculational rules;
9026 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
9027 rule (as well as the assumption rule);
9029 * Pure: 'thm_deps' command visualizes dependencies of theorems and
9030 lemmas, using the graph browser tool;
9032 * Pure: predict failure of "show" in interactive mode;
9034 * Pure: 'thms_containing' now takes actual terms as arguments;
9036 * HOL: improved method 'induct' --- now handles non-atomic goals
9037 (potential INCOMPATIBILITY); tuned error handling;
9039 * HOL: cases and induct rules now provide explicit hints about the
9040 number of facts to be consumed (0 for "type" and 1 for "set" rules);
9041 any remaining facts are inserted into the goal verbatim;
9043 * HOL: local contexts (aka cases) may now contain term bindings as
9044 well; the 'cases' and 'induct' methods new provide a ?case binding for
9045 the result to be shown in each case;
9047 * HOL: added 'recdef_tc' command;
9049 * isatool convert assists in eliminating legacy ML scripts;
9054 * HOL/Library: a collection of generic theories to be used together
9055 with main HOL; the theory loader path already includes this directory
9056 by default; the following existing theories have been moved here:
9057 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
9058 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
9060 * HOL/Unix: "Some aspects of Unix file-system security", a typical
9061 modelling and verification task performed in Isabelle/HOL +
9062 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
9064 * HOL/Algebra: special summation operator SUM no longer exists, it has
9065 been replaced by setsum; infix 'assoc' now has priority 50 (like
9066 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
9067 'domain', this makes the theory consistent with mathematical
9070 * HOL basics: added overloaded operations "inverse" and "divide"
9071 (infix "/"), syntax for generic "abs" operation, generic summation
9074 * HOL/typedef: simplified package, provide more useful rules (see also
9077 * HOL/datatype: induction rule for arbitrarily branching datatypes is
9078 now expressed as a proper nested rule (old-style tactic scripts may
9079 require atomize_strip_tac to cope with non-atomic premises);
9081 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
9082 to "split_conv" (old name still available for compatibility);
9084 * HOL: improved concrete syntax for strings (e.g. allows translation
9085 rules with string literals);
9087 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
9088 and Fleuriot's mechanization of analysis, including the transcendental
9089 functions for the reals;
9091 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
9096 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
9097 "lam" is displayed as TWO lambda-symbols
9099 * CTT: theory Main now available, containing everything (that is, Bool
9105 * Pure: the Simplifier has been implemented properly as a derived rule
9106 outside of the actual kernel (at last!); the overall performance
9107 penalty in practical applications is about 50%, while reliability of
9108 the Isabelle inference kernel has been greatly improved;
9110 * print modes "brackets" and "no_brackets" control output of nested =>
9111 (types) and ==> (props); the default behaviour is "brackets";
9113 * Provers: fast_tac (and friends) now handle actual object-logic rules
9114 as assumptions as well;
9116 * system: support Poly/ML 4.0;
9118 * system: isatool install handles KDE version 1 or 2;
9122 New in Isabelle99-1 (October 2000)
9123 ----------------------------------
9125 *** Overview of INCOMPATIBILITIES ***
9127 * HOL: simplification of natural numbers is much changed; to partly
9128 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
9129 issue the following ML commands:
9131 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
9132 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
9134 * HOL: simplification no longer dives into case-expressions; this is
9135 controlled by "t.weak_case_cong" for each datatype t;
9137 * HOL: nat_less_induct renamed to less_induct;
9139 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
9140 fixsome to patch .thy and .ML sources automatically;
9142 select_equality -> some_equality
9143 select_eq_Ex -> some_eq_ex
9144 selectI2EX -> someI2_ex
9147 select1_equality -> some1_equality
9148 Eps_sym_eq -> some_sym_eq_trivial
9149 Eps_eq -> some_eq_trivial
9151 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
9153 * HOL: removed obsolete theorem binding expand_if (refer to split_if
9156 * HOL: the recursion equations generated by 'recdef' are now called
9157 f.simps instead of f.rules;
9159 * HOL: qed_spec_mp now also handles bounded ALL as well;
9161 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
9162 sometimes be needed;
9164 * HOL: the constant for "f``x" is now "image" rather than "op ``";
9166 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
9168 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
9169 product is now "<*>" instead of "Times"; the lexicographic product is
9170 now "<*lex*>" instead of "**";
9172 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
9173 of main HOL, but was unused); better use HOL's datatype package;
9175 * HOL: removed "symbols" syntax for constant "override" of theory Map;
9176 the old syntax may be recovered as follows:
9179 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
9180 (infixl "\\<oplus>" 100)
9182 * HOL/Real: "rabs" replaced by overloaded "abs" function;
9184 * HOL/ML: even fewer consts are declared as global (see theories Ord,
9185 Lfp, Gfp, WF); this only affects ML packages that refer to const names
9188 * HOL and ZF: syntax for quotienting wrt an equivalence relation
9189 changed from A/r to A//r;
9191 * ZF: new treatment of arithmetic (nat & int) may break some old
9194 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
9195 rulify -> rule_format, elimify -> elim_format, ...);
9197 * Isar/Provers: intro/elim/dest attributes changed; renamed
9198 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
9199 should have to change intro!! to intro? only); replaced "delrule" by
9202 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
9204 * Provers: strengthened force_tac by using new first_best_tac;
9206 * LaTeX document preparation: several changes of isabelle.sty (see
9210 *** Document preparation ***
9212 * formal comments (text blocks etc.) in new-style theories may now
9213 contain antiquotations of thm/prop/term/typ/text to be presented
9214 according to latex print mode; concrete syntax is like this:
9215 @{term[show_types] "f(x) = a + x"};
9217 * isatool mkdir provides easy setup of Isabelle session directories,
9218 including proper document sources;
9220 * generated LaTeX sources are now deleted after successful run
9221 (isatool document -c); may retain a copy somewhere else via -D option
9224 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
9225 style files, achieving self-contained LaTeX sources and simplifying
9228 * old-style theories now produce (crude) LaTeX output as well;
9230 * browser info session directories are now self-contained (may be put
9231 on WWW server seperately); improved graphs of nested sessions; removed
9232 graph for 'all sessions';
9234 * several improvements in isabelle style files; \isabellestyle{it}
9235 produces fake math mode output; \isamarkupheader is now \section by
9236 default; see lib/texinputs/isabelle.sty etc.;
9241 * Isar/Pure: local results and corresponding term bindings are now
9242 subject to Hindley-Milner polymorphism (similar to ML); this
9243 accommodates incremental type-inference very nicely;
9245 * Isar/Pure: new derived language element 'obtain' supports
9246 generalized existence reasoning;
9248 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
9249 support accumulation of results, without applying any rules yet;
9250 useful to collect intermediate results without explicit name
9251 references, and for use with transitivity rules with more than 2
9254 * Isar/Pure: scalable support for case-analysis type proofs: new
9255 'case' language element refers to local contexts symbolically, as
9256 produced by certain proof methods; internally, case names are attached
9257 to theorems as "tags";
9259 * Isar/Pure: theory command 'hide' removes declarations from
9260 class/type/const name spaces;
9262 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
9263 indicate potential overloading;
9265 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
9267 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
9268 "{a,b,c}" instead of {a,b,c};
9270 * Isar/Pure now provides its own version of intro/elim/dest
9271 attributes; useful for building new logics, but beware of confusion
9272 with the version in Provers/classical;
9274 * Isar/Pure: the local context of (non-atomic) goals is provided via
9275 case name 'antecedent';
9277 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
9278 to the current context is now done automatically);
9280 * Isar/Pure: theory command 'method_setup' provides a simple interface
9281 for definining proof methods in ML;
9283 * Isar/Provers: intro/elim/dest attributes changed; renamed
9284 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
9285 most cases, one should have to change intro!! to intro? only);
9286 replaced "delrule" by "rule del";
9288 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
9289 'symmetric' attribute (the latter supercedes [RS sym]);
9291 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
9292 method modifier); 'simp' method: 'only:' modifier removes loopers as
9293 well (including splits);
9295 * Isar/Provers: Simplifier and Classical methods now support all kind
9296 of modifiers used in the past, including 'cong', 'iff', etc.
9298 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
9299 of Simplifier and Classical reasoner);
9301 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
9302 now support named cases; major packages (inductive, datatype, primrec,
9303 recdef) support case names and properly name parameters;
9305 * Isar/HOL: new transitivity rules for substitution in inequalities --
9306 monotonicity conditions are extracted to be proven at end of
9309 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
9312 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
9313 split_if split_if_asm; datatype package provides theorems foo.splits =
9314 foo.split foo.split_asm for each datatype;
9316 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
9317 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
9318 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
9319 use "(cases (simplified))" method in proper proof texts);
9321 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
9323 * Isar: names of theorems etc. may be natural numbers as well;
9325 * Isar: 'pr' command: optional arguments for goals_limit and
9326 ProofContext.prems_limit; no longer prints theory contexts, but only
9329 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
9330 additional print modes to be specified; e.g. "pr(latex)" will print
9331 proof state according to the Isabelle LaTeX style;
9333 * Isar: improved support for emulating tactic scripts, including proof
9334 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
9335 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
9336 (for HOL datatypes);
9338 * Isar: simplified (more robust) goal selection of proof methods: 1st
9339 goal, all goals, or explicit goal specifier (tactic emulation); thus
9340 'proof method scripts' have to be in depth-first order;
9342 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
9344 * Isar: removed 'help' command, which hasn't been too helpful anyway;
9345 should instead use individual commands for printing items
9346 (print_commands, print_methods etc.);
9348 * Isar: added 'nothing' --- the empty list of theorems;
9353 * HOL/MicroJava: formalization of a fragment of Java, together with a
9354 corresponding virtual machine and a specification of its bytecode
9355 verifier and a lightweight bytecode verifier, including proofs of
9356 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
9357 Cornelia Pusch (see also the homepage of project Bali at
9358 http://isabelle.in.tum.de/Bali/);
9360 * HOL/Algebra: new theory of rings and univariate polynomials, by
9363 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
9364 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
9367 * HOL/Lattice: fundamental concepts of lattice theory and order
9368 structures, including duals, properties of bounds versus algebraic
9369 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
9370 Theorem for complete lattices etc.; may also serve as a demonstration
9371 for abstract algebraic reasoning using axiomatic type classes, and
9372 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
9374 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
9377 * HOL/IMPP: extension of IMP with local variables and mutually
9378 recursive procedures, by David von Oheimb;
9380 * HOL/Lambda: converted into new-style theory and document;
9382 * HOL/ex/Multiquote: example of multiple nested quotations and
9383 anti-quotations -- basically a generalized version of de-Bruijn
9384 representation; very useful in avoiding lifting of operations;
9386 * HOL/record: added general record equality rule to simpset; fixed
9387 select-update simplification procedure to handle extended records as
9388 well; admit "r" as field name;
9390 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
9391 other numeric types and also as the identity of groups, rings, etc.;
9393 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
9394 Types nat and int belong to this axclass;
9396 * HOL: greatly improved simplification involving numerals of type nat, int, real:
9397 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
9398 i*j + k + j*#3*i simplifies to #4*(i*j) + k
9399 two terms #m*u and #n*u are replaced by #(m+n)*u
9400 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
9401 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
9402 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
9404 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
9405 powerful prover for predicate logic but knows nothing of clasets; see
9406 ex/mesontest.ML and ex/mesontest2.ML for example applications;
9408 * HOL: new version of "case_tac" subsumes both boolean case split and
9409 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
9410 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
9412 * HOL: simplification no longer dives into case-expressions: only the
9413 selector expression is simplified, but not the remaining arms; to
9414 enable full simplification of case-expressions for datatype t, you may
9415 remove t.weak_case_cong from the simpset, either globally (Delcongs
9416 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
9418 * HOL/recdef: the recursion equations generated by 'recdef' for
9419 function 'f' are now called f.simps instead of f.rules; if all
9420 termination conditions are proved automatically, these simplification
9421 rules are added to the simpset, as in primrec; rules may be named
9422 individually as well, resulting in a separate list of theorems for
9425 * HOL/While is a new theory that provides a while-combinator. It
9426 permits the definition of tail-recursive functions without the
9427 provision of a termination measure. The latter is necessary once the
9428 invariant proof rule for while is applied.
9430 * HOL: new (overloaded) notation for the set of elements below/above
9431 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
9433 * HOL: theorems impI, allI, ballI bound as "strip";
9435 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
9436 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
9437 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
9439 * HOL/Real: "rabs" replaced by overloaded "abs" function;
9441 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
9442 main HOL, but was unused);
9444 * HOL: fewer consts declared as global (e.g. have to refer to
9445 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
9447 * HOL: tuned AST representation of nested pairs, avoiding bogus output
9448 in case of overlap with user translations (e.g. judgements over
9449 tuples); (note that the underlying logical represenation is still
9455 * ZF: simplification automatically cancels common terms in arithmetic
9456 expressions over nat and int;
9458 * ZF: new treatment of nat to minimize type-checking: all operators
9459 coerce their operands to a natural number using the function natify,
9460 making the algebraic laws unconditional;
9462 * ZF: as above, for int: operators coerce their operands to an integer
9463 using the function intify;
9465 * ZF: the integer library now contains many of the usual laws for the
9466 orderings, including $<=, and monotonicity laws for $+ and $*;
9468 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
9471 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
9472 to the simplifier and classical reasoner simultaneously;
9477 * Provers: blast_tac now handles actual object-logic rules as
9478 assumptions; note that auto_tac uses blast_tac internally as well;
9480 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
9481 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
9483 * Provers: delrules now handles destruct rules as well (no longer need
9484 explicit make_elim);
9486 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
9487 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
9488 use instead the strong form,
9489 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
9490 in HOL, FOL and ZF the function cla_make_elim will create such rules
9491 from destruct-rules;
9493 * Provers: Simplifier.easy_setup provides a fast path to basic
9494 Simplifier setup for new object-logics;
9496 * Pure: AST translation rules no longer require constant head on LHS;
9498 * Pure: improved name spaces: ambiguous output is qualified; support
9499 for hiding of names;
9501 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
9502 XSYMBOL_HOME; no longer need to do manual configuration in most
9505 * system: compression of ML heaps images may now be controlled via -c
9506 option of isabelle and isatool usedir (currently only observed by
9509 * system: isatool installfonts may handle X-Symbol fonts as well (very
9510 useful for remote X11);
9512 * system: provide TAGS file for Isabelle sources;
9514 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
9517 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
9518 timing flag supersedes proof_timing and Toplevel.trace;
9520 * ML: new combinators |>> and |>>> for incremental transformations
9521 with secondary results (e.g. certain theory extensions):
9523 * ML: PureThy.add_defs gets additional argument to indicate potential
9524 overloading (usually false);
9526 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
9531 New in Isabelle99 (October 1999)
9532 --------------------------------
9534 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9536 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
9537 are no longer simplified. (This allows the simplifier to unfold recursive
9538 functional programs.) To restore the old behaviour, declare
9540 Delcongs [if_weak_cong];
9542 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
9545 * HOL: the predicate "inj" is now defined by translation to "inj_on";
9547 * HOL/datatype: mutual_induct_tac no longer exists --
9548 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
9550 * HOL/typedef: fixed type inference for representing set; type
9551 arguments now have to occur explicitly on the rhs as type constraints;
9553 * ZF: The con_defs part of an inductive definition may no longer refer
9554 to constants declared in the same theory;
9556 * HOL, ZF: the function mk_cases, generated by the inductive
9557 definition package, has lost an argument. To simplify its result, it
9558 uses the default simpset instead of a supplied list of theorems.
9560 * HOL/List: the constructors of type list are now Nil and Cons;
9562 * Simplifier: the type of the infix ML functions
9563 setSSolver addSSolver setSolver addSolver
9564 is now simpset * solver -> simpset where `solver' is a new abstract type
9565 for packaging solvers. A solver is created via
9566 mk_solver: string -> (thm list -> int -> tactic) -> solver
9567 where the string argument is only a comment.
9572 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
9573 decision procedure for linear arithmetic. Currently it is used for
9574 types `nat', `int', and `real' in HOL (see below); it can, should and
9575 will be instantiated for other types and logics as well.
9577 * The simplifier now accepts rewrite rules with flexible heads, eg
9578 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
9579 They are applied like any rule with a non-pattern lhs, i.e. by first-order
9585 * New Isabelle/Isar subsystem provides an alternative to traditional
9586 tactical theorem proving; together with the ProofGeneral/isar user
9587 interface it offers an interactive environment for developing human
9588 readable proof documents (Isar == Intelligible semi-automated
9589 reasoning); for further information see isatool doc isar-ref,
9590 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
9592 * improved and simplified presentation of theories: better HTML markup
9593 (including colors), graph views in several sizes; isatool usedir now
9594 provides a proper interface for user theories (via -P option); actual
9595 document preparation based on (PDF)LaTeX is available as well (for
9596 new-style theories only); see isatool doc system for more information;
9598 * native support for Proof General, both for classic Isabelle and
9601 * ML function thm_deps visualizes dependencies of theorems and lemmas,
9602 using the graph browser tool;
9604 * Isabelle manuals now also available as PDF;
9606 * theory loader rewritten from scratch (may not be fully
9607 bug-compatible); old loadpath variable has been replaced by show_path,
9608 add_path, del_path, reset_path functions; new operations such as
9609 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
9612 * improved isatool install: option -k creates KDE application icon,
9613 option -p DIR installs standalone binaries;
9615 * added ML_PLATFORM setting (useful for cross-platform installations);
9616 more robust handling of platform specific ML images for SML/NJ;
9618 * the settings environment is now statically scoped, i.e. it is never
9619 created again in sub-processes invoked from isabelle, isatool, or
9622 * path element specification '~~' refers to '$ISABELLE_HOME';
9624 * in locales, the "assumes" and "defines" parts may be omitted if
9627 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
9630 * new print_mode "HTML";
9632 * new flag show_tags controls display of tags of theorems (which are
9633 basically just comments that may be attached by some tools);
9635 * Isamode 2.6 requires patch to accomodate change of Isabelle font
9636 mode and goal output format:
9638 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
9640 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
9642 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
9643 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
9645 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
9647 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
9649 * function bind_thms stores lists of theorems (cf. bind_thm);
9651 * new shorthand tactics ftac, eatac, datac, fatac;
9653 * qed (and friends) now accept "" as result name; in that case the
9654 theorem is not stored, but proper checks and presentation of the
9657 * theorem database now also indexes constants "Trueprop", "all",
9658 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
9663 ** HOL arithmetic **
9665 * There are now decision procedures for linear arithmetic over nat and
9668 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
9669 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
9670 are treated as atomic; subformulae not involving type `nat' or `int'
9671 are ignored; quantified subformulae are ignored unless they are
9672 positive universal or negative existential. The tactic has to be
9673 invoked by hand and can be a little bit slow. In particular, the
9674 running time is exponential in the number of occurrences of `min' and
9675 `max', and `-' on `nat'.
9677 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
9678 (negated) (in)equalities among the premises and the conclusion into
9679 account (i.e. no compound formulae) and does not know about `min' and
9680 `max', and `-' on `nat'. It is fast and is used automatically by the
9683 NB: At the moment, these decision procedures do not cope with mixed
9684 nat/int formulae where the two parts interact, such as `m < n ==>
9687 * HOL/Numeral provides a generic theory of numerals (encoded
9688 efficiently as bit strings); setup for types nat/int/real is in place;
9689 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
9690 int, existing theories and proof scripts may require a few additional
9693 * integer division and remainder can now be performed on constant
9696 * many properties of integer multiplication, division and remainder
9699 * An interface to the Stanford Validity Checker (SVC) is available through the
9700 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
9701 are proved automatically. SVC must be installed separately, and its results
9702 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
9703 invocation of the underlying oracle). For SVC see
9704 http://verify.stanford.edu/SVC
9706 * IsaMakefile: the HOL-Real target now builds an actual image;
9711 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
9712 (in Isabelle/Isar) -- by Gertrud Bauer;
9714 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
9715 analysis for assembly languages with subtypes;
9717 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
9718 -- avoids syntactic ambiguities and treats state, transition, and
9719 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
9720 changed syntax and (many) tactics;
9722 * HOL/inductive: Now also handles more general introduction rules such
9723 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
9724 theorems are now maintained within the theory (maintained via the
9727 * HOL/datatype: Now also handles arbitrarily branching datatypes
9728 (using function types) such as
9730 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
9732 * HOL/record: record_simproc (part of the default simpset) takes care
9733 of selectors applied to updated records; record_split_tac is no longer
9734 part of the default claset; update_defs may now be removed from the
9735 simpset in many cases; COMPATIBILITY: old behavior achieved by
9737 claset_ref () := claset() addSWrapper record_split_wrapper;
9738 Delsimprocs [record_simproc]
9740 * HOL/typedef: fixed type inference for representing set; type
9741 arguments now have to occur explicitly on the rhs as type constraints;
9743 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
9744 names rather than an ML expression;
9746 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
9747 supplied later. Program schemes can be defined, such as
9748 "While B C s = (if B s then While B C (C s) else s)"
9749 where the well-founded relation can be chosen after B and C have been given.
9751 * HOL/List: the constructors of type list are now Nil and Cons;
9752 INCOMPATIBILITY: while [] and infix # syntax is still there, of
9753 course, ML tools referring to List.list.op # etc. have to be adapted;
9755 * HOL_quantifiers flag superseded by "HOL" print mode, which is
9756 disabled by default; run isabelle with option -m HOL to get back to
9757 the original Gordon/HOL-style output;
9759 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
9760 ALL x<=y. P, EX x<y. P, EX x<=y. P;
9762 * HOL basic syntax simplified (more orthogonal): all variants of
9763 All/Ex now support plain / symbolic / HOL notation; plain syntax for
9764 Eps operator is provided as well: "SOME x. P[x]";
9766 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
9768 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
9769 thus available for user theories;
9771 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
9772 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
9775 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
9776 several times and then mp;
9781 * the notation <<...>> is now available as a notation for sequences of
9784 * the simplifier is now installed
9786 * the axiom system has been generalized (thanks to Soren Heilmann)
9788 * the classical reasoner now has a default rule database
9793 * new primrec section allows primitive recursive functions to be given
9794 directly (as in HOL) over datatypes and the natural numbers;
9796 * new tactics induct_tac and exhaust_tac for induction (or case
9797 analysis) over datatypes and the natural numbers;
9799 * the datatype declaration of type T now defines the recursor T_rec;
9801 * simplification automatically does freeness reasoning for datatype
9804 * automatic type-inference, with AddTCs command to insert new
9805 type-checking rules;
9807 * datatype introduction rules are now added as Safe Introduction rules
9810 * the syntax "if P then x else y" is now available in addition to
9814 *** Internal programming interfaces ***
9816 * tuned simplifier trace output; new flag debug_simp;
9818 * structures Vartab / Termtab (instances of TableFun) offer efficient
9819 tables indexed by indexname_ord / term_ord (compatible with aconv);
9821 * AxClass.axclass_tac lost the theory argument;
9823 * tuned current_goals_markers semantics: begin / end goal avoids
9824 printing empty lines;
9826 * removed prs and prs_fn hook, which was broken because it did not
9827 include \n in its semantics, forcing writeln to add one
9828 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
9829 string -> unit if you really want to output text without newline;
9831 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
9832 plain output, interface builders may have to enable 'isabelle_font'
9833 mode to get Isabelle font glyphs as before;
9835 * refined token_translation interface; INCOMPATIBILITY: output length
9836 now of type real instead of int;
9838 * theory loader actions may be traced via new ThyInfo.add_hook
9839 interface (see src/Pure/Thy/thy_info.ML); example application: keep
9840 your own database of information attached to *whole* theories -- as
9841 opposed to intra-theory data slots offered via TheoryDataFun;
9843 * proper handling of dangling sort hypotheses (at last!);
9844 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
9845 extra sort hypotheses that can be witnessed from the type signature;
9846 the force_strip_shyps flag is gone, any remaining shyps are simply
9847 left in the theorem (with a warning issued by strip_shyps_warning);
9851 New in Isabelle98-1 (October 1998)
9852 ----------------------------------
9854 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9856 * several changes of automated proof tools;
9858 * HOL: major changes to the inductive and datatype packages, including
9859 some minor incompatibilities of theory syntax;
9861 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
9864 * HOL: removed duplicate thms in Arith:
9865 less_imp_add_less should be replaced by trans_less_add1
9866 le_imp_add_le should be replaced by trans_le_add1
9868 * HOL: unary minus is now overloaded (new type constraints may be
9871 * HOL and ZF: unary minus for integers is now #- instead of #~. In
9872 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
9873 now taken as an integer constant.
9875 * Pure: ML function 'theory_of' renamed to 'theory';
9881 1. Asm_full_simp_tac is now more aggressive.
9882 1. It will sometimes reorient premises if that increases their power to
9884 2. It does no longer proceed strictly from left to right but may also
9885 rotate premises to achieve further simplification.
9886 For compatibility reasons there is now Asm_lr_simp_tac which is like the
9887 old Asm_full_simp_tac in that it does not rotate premises.
9888 2. The simplifier now knows a little bit about nat-arithmetic.
9890 * Classical reasoner: wrapper mechanism for the classical reasoner now
9891 allows for selected deletion of wrappers, by introduction of names for
9892 wrapper functionals. This implies that addbefore, addSbefore,
9893 addaltern, and addSaltern now take a pair (name, tactic) as argument,
9894 and that adding two tactics with the same name overwrites the first
9895 one (emitting a warning).
9896 type wrapper = (int -> tactic) -> (int -> tactic)
9897 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
9898 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
9899 delWrapper, delSWrapper: claset * string -> claset
9900 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
9902 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
9903 semantics; addbefore now affects only the unsafe part of step_tac
9904 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
9905 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
9908 * Classical reasoner: setwrapper to setWrapper and compwrapper to
9909 compWrapper; added safe wrapper (and access functions for it);
9911 * HOL/split_all_tac is now much faster and fails if there is nothing
9912 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
9913 and the names of the automatically generated variables have changed.
9914 split_all_tac has moved within claset() from unsafe wrappers to safe
9915 wrappers, which means that !!-bound variables are split much more
9916 aggressively, and safe_tac and clarify_tac now split such variables.
9917 If this splitting is not appropriate, use delSWrapper "split_all_tac".
9918 Note: the same holds for record_split_tac, which does the job of
9919 split_all_tac for record fields.
9921 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
9922 permanently to the default simpset using Addsplits just like
9923 Addsimps. They can be removed via Delsplits just like
9924 Delsimps. Lower-case versions are also available.
9926 * HOL/Simplifier: The rule split_if is now part of the default
9927 simpset. This means that the simplifier will eliminate all occurrences
9928 of if-then-else in the conclusion of a goal. To prevent this, you can
9929 either remove split_if completely from the default simpset by
9930 `Delsplits [split_if]' or remove it in a specific call of the
9931 simplifier using `... delsplits [split_if]'. You can also add/delete
9932 other case splitting rules to/from the default simpset: every datatype
9933 generates suitable rules `split_t_case' and `split_t_case_asm' (where
9934 t is the name of the datatype).
9936 * Classical reasoner / Simplifier combination: new force_tac (and
9937 derivatives Force_tac, force) combines rewriting and classical
9938 reasoning (and whatever other tools) similarly to auto_tac, but is
9939 aimed to solve the given subgoal completely.
9944 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
9945 and `goalw': the theory is no longer needed as an explicit argument -
9946 the current theory context is used; assumptions are no longer returned
9947 at the ML-level unless one of them starts with ==> or !!; it is
9948 recommended to convert to these new commands using isatool fixgoal
9949 (backup your sources first!);
9951 * new top-level commands 'thm' and 'thms' for retrieving theorems from
9952 the current theory context, and 'theory' to lookup stored theories;
9954 * new theory section 'locale' for declaring constants, assumptions and
9955 definitions that have local scope;
9957 * new theory section 'nonterminals' for purely syntactic types;
9959 * new theory section 'setup' for generic ML setup functions
9960 (e.g. package initialization);
9962 * the distribution now includes Isabelle icons: see
9963 lib/logo/isabelle-{small,tiny}.xpm;
9965 * isatool install - install binaries with absolute references to
9968 * isatool logo -- create instances of the Isabelle logo (as EPS);
9970 * print mode 'emacs' reserved for Isamode;
9972 * support multiple print (ast) translations per constant name;
9974 * theorems involving oracles are now printed with a suffixed [!];
9979 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
9981 * HOL/inductive package reorganized and improved: now supports mutual
9987 oddI "n : EVEN ==> Suc n : ODD"
9988 evenI "n : ODD ==> Suc n : EVEN"
9990 new theorem list "elims" contains an elimination rule for each of the
9991 recursive sets; inductive definitions now handle disjunctive premises
9992 correctly (also ZF);
9994 INCOMPATIBILITIES: requires Inductive as an ancestor; component
9995 "mutual_induct" no longer exists - the induction rule is always
9996 contained in "induct";
9999 * HOL/datatype package re-implemented and greatly improved: now
10000 supports mutually recursive datatypes such as
10003 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
10004 | SUM ('a aexp) ('a aexp)
10005 | DIFF ('a aexp) ('a aexp)
10008 'a bexp = LESS ('a aexp) ('a aexp)
10009 | AND ('a bexp) ('a bexp)
10010 | OR ('a bexp) ('a bexp)
10012 as well as indirectly recursive datatypes such as
10015 ('a, 'b) term = Var 'a
10016 | App 'b ((('a, 'b) term) list)
10018 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
10019 induction on mutually / indirectly recursive datatypes.
10021 Primrec equations are now stored in theory and can be accessed via
10022 <function_name>.simps.
10026 - Theories using datatypes must now have theory Datatype as an
10028 - The specific <typename>.induct_tac no longer exists - use the
10029 generic induct_tac instead.
10030 - natE has been renamed to nat.exhaust - use exhaust_tac
10031 instead of res_inst_tac ... natE. Note that the variable
10032 names in nat.exhaust differ from the names in natE, this
10033 may cause some "fragile" proofs to fail.
10034 - The theorems split_<typename>_case and split_<typename>_case_asm
10035 have been renamed to <typename>.split and <typename>.split_asm.
10036 - Since default sorts of type variables are now handled correctly,
10037 some datatype definitions may have to be annotated with explicit
10039 - Primrec definitions no longer require function name and type
10040 of recursive argument.
10042 Consider using isatool fixdatatype to adapt your theories and proof
10043 scripts to the new package (backup your sources first!).
10046 * HOL/record package: considerably improved implementation; now
10047 includes concrete syntax for record types, terms, updates; theorems
10048 for surjective pairing and splitting !!-bound record variables; proof
10049 support is as follows:
10051 1) standard conversions (selectors or updates applied to record
10052 constructor terms) are part of the standard simpset;
10054 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
10055 made part of standard simpset and claset via addIffs;
10057 3) a tactic for record field splitting (record_split_tac) is part of
10058 the standard claset (addSWrapper);
10060 To get a better idea about these rules you may retrieve them via
10061 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
10062 the name of your record type.
10064 The split tactic 3) conceptually simplifies by the following rule:
10066 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
10068 Thus any record variable that is bound by meta-all will automatically
10069 blow up into some record constructor term, consequently the
10070 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
10071 solve record problems automatically.
10074 * reorganized the main HOL image: HOL/Integ and String loaded by
10075 default; theory Main includes everything;
10077 * automatic simplification of integer sums and comparisons, using cancellation;
10079 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
10081 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
10083 * many new identities for unions, intersections, set difference, etc.;
10085 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
10086 called split_if, split_split, split_sum_case and split_nat_case (to go
10087 with add/delsplits);
10089 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
10090 (?x::unit) = (); this is made part of the default simpset, which COULD
10091 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
10092 'Delsimprocs [unit_eq_proc];' as last resort); also note that
10093 unit_abs_eta_conv is added in order to counter the effect of
10094 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
10097 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
10100 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
10101 It and 'sym RS equals0D' are now in the default claset, giving automatic
10102 disjointness reasoning but breaking a few old proofs.
10104 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
10105 to 'converse' from 'inverse' (for compatibility with ZF and some
10108 * HOL/recdef can now declare non-recursive functions, with {} supplied as
10109 the well-founded relation;
10111 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
10112 Compl A. The "Compl" syntax remains available as input syntax for this
10115 * HOL/Update: new theory of function updates:
10116 f(a:=b) == %x. if x=a then b else f x
10117 may also be iterated as in f(a:=b,c:=d,...);
10119 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
10122 - new function list_update written xs[i:=v] that updates the i-th
10123 list position. May also be iterated as in xs[i:=a,j:=b,...].
10124 - new function `upt' written [i..j(] which generates the list
10125 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
10126 bound write [i..j], which is a shorthand for [i..j+1(].
10127 - new lexicographic orderings and corresponding wellfoundedness theorems.
10130 - removed 'pred' (predecessor) function;
10131 - generalized some theorems about n-1;
10132 - many new laws about "div" and "mod";
10133 - new laws about greatest common divisors (see theory ex/Primes);
10135 * HOL/Relation: renamed the relational operator r^-1 "converse"
10136 instead of "inverse";
10138 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
10139 of the multiset ordering;
10141 * directory HOL/Real: a construction of the reals using Dedekind cuts
10142 (not included by default);
10144 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
10146 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
10147 programs, i.e. different program variables may have different types.
10149 * calling (stac rew i) now fails if "rew" has no effect on the goal
10150 [previously, this check worked only if the rewrite rule was unconditional]
10151 Now rew can involve either definitions or equalities (either == or =).
10156 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
10157 only the theorems proved on ZF.ML;
10159 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
10160 It and 'sym RS equals0D' are now in the default claset, giving automatic
10161 disjointness reasoning but breaking a few old proofs.
10163 * ZF/Update: new theory of function updates
10164 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
10165 may also be iterated as in f(a:=b,c:=d,...);
10167 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
10169 * calling (stac rew i) now fails if "rew" has no effect on the goal
10170 [previously, this check worked only if the rewrite rule was unconditional]
10171 Now rew can involve either definitions or equalities (either == or =).
10173 * case_tac provided for compatibility with HOL
10174 (like the old excluded_middle_tac, but with subgoals swapped)
10177 *** Internal programming interfaces ***
10179 * Pure: several new basic modules made available for general use, see
10180 also src/Pure/README;
10182 * improved the theory data mechanism to support encapsulation (data
10183 kind name replaced by private Object.kind, acting as authorization
10184 key); new type-safe user interface via functor TheoryDataFun; generic
10185 print_data function becomes basically useless;
10187 * removed global_names compatibility flag -- all theory declarations
10188 are qualified by default;
10190 * module Pure/Syntax now offers quote / antiquote translation
10191 functions (useful for Hoare logic etc. with implicit dependencies);
10192 see HOL/ex/Antiquote for an example use;
10194 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
10197 * new tactical CHANGED_GOAL for checking that a tactic modifies a
10200 * Display.print_goals function moved to Locale.print_goals;
10202 * standard print function for goals supports current_goals_markers
10203 variable for marking begin of proof, end of proof, start of goal; the
10204 default is ("", "", ""); setting current_goals_markers := ("<proof>",
10205 "</proof>", "<goal>") causes SGML like tagged proof state printing,
10210 New in Isabelle98 (January 1998)
10211 --------------------------------
10213 *** Overview of INCOMPATIBILITIES (see below for more details) ***
10215 * changed lexical syntax of terms / types: dots made part of long
10216 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
10218 * simpset (and claset) reference variable replaced by functions
10219 simpset / simpset_ref;
10221 * no longer supports theory aliases (via merge) and non-trivial
10222 implicit merge of thms' signatures;
10224 * most internal names of constants changed due to qualified names;
10226 * changed Pure/Sequence interface (see Pure/seq.ML);
10229 *** General Changes ***
10231 * hierachically structured name spaces (for consts, types, axms, thms
10232 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
10233 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
10234 isatool fixdots ensures space after dots (e.g. "%x. x"); set
10235 long_names for fully qualified output names; NOTE: ML programs
10236 (special tactics, packages etc.) referring to internal names may have
10237 to be adapted to cope with fully qualified names; in case of severe
10238 backward campatibility problems try setting 'global_names' at compile
10239 time to have enrything declared within a flat name space; one may also
10240 fine tune name declarations in theories via the 'global' and 'local'
10243 * reimplemented the implicit simpset and claset using the new anytype
10244 data filed in signatures; references simpset:simpset ref etc. are
10245 replaced by functions simpset:unit->simpset and
10246 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
10247 to patch your ML files accordingly;
10249 * HTML output now includes theory graph data for display with Java
10250 applet or isatool browser; data generated automatically via isatool
10251 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
10253 * defs may now be conditional; improved rewrite_goals_tac to handle
10254 conditional equations;
10256 * defs now admits additional type arguments, using TYPE('a) syntax;
10258 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
10259 creates a new theory node; implicit merge of thms' signatures is
10260 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
10261 transfer:theory->thm->thm in (rare) cases;
10263 * improved handling of draft signatures / theories; draft thms (and
10264 ctyps, cterms) are automatically promoted to real ones;
10266 * slightly changed interfaces for oracles: admit many per theory, named
10267 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
10269 * print_goals: optional output of const types (set show_consts and
10272 * improved output of warnings (###) and errors (***);
10274 * subgoal_tac displays a warning if the new subgoal has type variables;
10276 * removed old README and Makefiles;
10278 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
10280 * removed obsolete init_pps and init_database;
10282 * deleted the obsolete tactical STATE, which was declared by
10283 fun STATE tacfun st = tacfun st st;
10285 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
10286 (which abbreviates $HOME);
10288 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
10289 use isatool fixseq to adapt your ML programs (this works for fully
10290 qualified references to the Sequence structure only!);
10292 * use_thy no longer requires writable current directory; it always
10293 reloads .ML *and* .thy file, if either one is out of date;
10296 *** Classical Reasoner ***
10298 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
10299 tactics that use classical reasoning to simplify a subgoal without
10300 splitting it into several subgoals;
10302 * Safe_tac: like safe_tac but uses the default claset;
10307 * added simplification meta rules:
10308 (asm_)(full_)simplify: simpset -> thm -> thm;
10310 * simplifier.ML no longer part of Pure -- has to be loaded by object
10313 * added prems argument to simplification procedures;
10315 * HOL, FOL, ZF: added infix function `addsplits':
10316 instead of `<simpset> setloop (split_tac <thms>)'
10317 you can simply write `<simpset> addsplits <thms>'
10322 * TYPE('a) syntax for type reflection terms;
10324 * no longer handles consts with name "" -- declare as 'syntax' instead;
10326 * pretty printer: changed order of mixfix annotation preference (again!);
10328 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
10333 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
10334 with `addloop' of the simplifier to faciliate case splitting in premises.
10336 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
10338 * HOL/Auth: new protocol proofs including some for the Internet
10341 * HOL/Map: new theory of `maps' a la VDM;
10343 * HOL/simplifier: simplification procedures nat_cancel_sums for
10344 cancelling out common nat summands from =, <, <= (in)equalities, or
10345 differences; simplification procedures nat_cancel_factor for
10346 cancelling common factor from =, <, <= (in)equalities over natural
10347 sums; nat_cancel contains both kinds of procedures, it is installed by
10348 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
10350 * HOL/simplifier: terms of the form
10351 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
10353 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
10354 and those of the form
10355 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
10357 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
10360 Each datatype `t' now comes with a theorem `split_t_case' of the form
10362 P(t_case f1 ... fn x) =
10363 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
10365 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
10368 and a theorem `split_t_case_asm' of the form
10370 P(t_case f1 ... fn x) =
10371 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
10373 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
10375 which can be added to a simpset via `addsplits'. The existing theorems
10376 expand_list_case and expand_option_case have been renamed to
10377 split_list_case and split_option_case.
10380 - `pred n' is automatically converted to `n-1'.
10381 Users are strongly encouraged not to use `pred' any longer,
10382 because it will disappear altogether at some point.
10383 - Users are strongly encouraged to write "0 < n" rather than
10384 "n ~= 0". Theorems and proof tools have been modified towards this
10388 the function "set_of_list" has been renamed "set" (and its theorems too);
10389 the function "nth" now takes its arguments in the reverse order and
10390 has acquired the infix notation "!" as in "xs!n".
10392 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
10394 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
10395 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
10397 * HOL/record: extensible records with schematic structural subtyping
10398 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
10399 still lacks various theorems and concrete record syntax;
10404 * removed "axioms" and "generated by" sections;
10406 * replaced "ops" section by extended "consts" section, which is capable of
10407 handling the continuous function space "->" directly;
10410 . proves theorems immediately and stores them in the theory,
10411 . creates hierachical name space,
10412 . now uses normal mixfix annotations (instead of cinfix...),
10413 . minor changes to some names and values (for consistency),
10414 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
10415 . separator between mutual domain defs: changed "," to "and",
10416 . improved handling of sort constraints; now they have to
10417 appear on the left-hand side of the equations only;
10419 * fixed LAM <x,y,zs>.b syntax;
10421 * added extended adm_tac to simplifier in HOLCF -- can now discharge
10422 adm (%x. P (t x)), where P is chainfinite and t continuous;
10427 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
10428 with `addloop' of the simplifier to faciliate case splitting in premises.
10430 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
10431 in HOL, they strip ALL and --> from proved theorems;
10435 New in Isabelle94-8 (May 1997)
10436 ------------------------------
10438 *** General Changes ***
10440 * new utilities to build / run / maintain Isabelle etc. (in parts
10441 still somewhat experimental); old Makefiles etc. still functional;
10443 * new 'Isabelle System Manual';
10445 * INSTALL text, together with ./configure and ./build scripts;
10447 * reimplemented type inference for greater efficiency, better error
10448 messages and clean internal interface;
10450 * prlim command for dealing with lots of subgoals (an easier way of
10451 setting goals_limit);
10456 * supports alternative (named) syntax tables (parser and pretty
10457 printer); internal interface is provided by add_modesyntax(_i);
10459 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
10460 be used in conjunction with the Isabelle symbol font; uses the
10461 "symbols" syntax table;
10463 * added token_translation interface (may translate name tokens in
10464 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
10465 the current print_mode); IMPORTANT: user print translation functions
10466 are responsible for marking newly introduced bounds
10467 (Syntax.mark_boundT);
10469 * token translations for modes "xterm" and "xterm_color" that display
10470 names in bold, underline etc. or colors (which requires a color
10473 * infixes may now be declared with names independent of their syntax;
10475 * added typed_print_translation (like print_translation, but may
10476 access type of constant);
10479 *** Classical Reasoner ***
10481 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
10482 some limitations. Blast_tac...
10483 + ignores addss, addbefore, addafter; this restriction is intrinsic
10484 + ignores elimination rules that don't have the correct format
10485 (the conclusion MUST be a formula variable)
10486 + ignores types, which can make HOL proofs fail
10487 + rules must not require higher-order unification, e.g. apply_type in ZF
10488 [message "Function Var's argument not a bound variable" relates to this]
10489 + its proof strategy is more general but can actually be slower
10491 * substitution with equality assumptions no longer permutes other
10494 * minor changes in semantics of addafter (now called addaltern); renamed
10495 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
10496 (and access functions for it);
10498 * improved combination of classical reasoner and simplifier:
10499 + functions for handling clasimpsets
10500 + improvement of addss: now the simplifier is called _after_ the
10502 + safe variant of addss called addSss: uses safe simplifications
10503 _during_ the safe steps. It is more complete as it allows multiple
10504 instantiations of unknowns (e.g. with slow_tac).
10508 * added interface for simplification procedures (functions that
10509 produce *proven* rewrite rules on the fly, depending on current
10512 * ordering on terms as parameter (used for ordered rewriting);
10514 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
10516 * the solver is now split into a safe and an unsafe part.
10517 This should be invisible for the normal user, except that the
10518 functions setsolver and addsolver have been renamed to setSolver and
10519 addSolver; added safe_asm_full_simp_tac;
10524 * a generic induction tactic `induct_tac' which works for all datatypes and
10525 also for type `nat';
10527 * a generic case distinction tactic `exhaust_tac' which works for all
10528 datatypes and also for type `nat';
10530 * each datatype comes with a function `size';
10532 * patterns in case expressions allow tuple patterns as arguments to
10533 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
10535 * primrec now also works with type nat;
10537 * recdef: a new declaration form, allows general recursive functions to be
10538 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
10540 * the constant for negation has been renamed from "not" to "Not" to
10541 harmonize with FOL, ZF, LK, etc.;
10543 * HOL/ex/LFilter theory of a corecursive "filter" functional for
10546 * HOL/Modelcheck demonstrates invocation of model checker oracle;
10548 * HOL/ex/Ring.thy declares cring_simp, which solves equational
10549 problems in commutative rings, using axiomatic type classes for + and *;
10551 * more examples in HOL/MiniML and HOL/Auth;
10553 * more default rewrite rules for quantifiers, union/intersection;
10555 * a new constant `arbitrary == @x.False';
10557 * HOLCF/IOA replaces old HOL/IOA;
10559 * HOLCF changes: derived all rules and arities
10560 + axiomatic type classes instead of classes
10561 + typedef instead of faking type definitions
10562 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
10563 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
10564 + eliminated the types void, one, tr
10565 + use unit lift and bool lift (with translations) instead of one and tr
10566 + eliminated blift from Lift3.thy (use Def instead of blift)
10567 all eliminated rules are derived as theorems --> no visible changes ;
10572 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
10573 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
10574 as ZF_cs addSIs [equalityI];
10578 New in Isabelle94-7 (November 96)
10579 ---------------------------------
10581 * allowing negative levels (as offsets) in prlev and choplev;
10583 * super-linear speedup for large simplifications;
10585 * FOL, ZF and HOL now use miniscoping: rewriting pushes
10586 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
10587 FAIL); can suppress it using the command Delsimps (ex_simps @
10588 all_simps); De Morgan laws are also now included, by default;
10590 * improved printing of ==> : ~:
10592 * new object-logic "Sequents" adds linear logic, while replacing LK
10593 and Modal (thanks to Sara Kalvala);
10595 * HOL/Auth: correctness proofs for authentication protocols;
10597 * HOL: new auto_tac combines rewriting and classical reasoning (many
10598 examples on HOL/Auth);
10600 * HOL: new command AddIffs for declaring theorems of the form P=Q to
10601 the rewriter and classical reasoner simultaneously;
10603 * function uresult no longer returns theorems in "standard" format;
10604 regain previous version by: val uresult = standard o uresult;
10608 New in Isabelle94-6
10609 -------------------
10611 * oracles -- these establish an interface between Isabelle and trusted
10612 external reasoners, which may deliver results as theorems;
10614 * proof objects (in particular record all uses of oracles);
10616 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
10618 * "constdefs" section in theory files;
10620 * "primrec" section (HOL) no longer requires names;
10622 * internal type "tactic" now simply "thm -> thm Sequence.seq";
10626 New in Isabelle94-5
10627 -------------------
10629 * reduced space requirements;
10631 * automatic HTML generation from theories;
10633 * theory files no longer require "..." (quotes) around most types;
10635 * new examples, including two proofs of the Church-Rosser theorem;
10637 * non-curried (1994) version of HOL is no longer distributed;
10641 New in Isabelle94-4
10642 -------------------
10644 * greatly reduced space requirements;
10646 * theory files (.thy) no longer require \...\ escapes at line breaks;
10648 * searchable theorem database (see the section "Retrieving theorems" on
10649 page 8 of the Reference Manual);
10651 * new examples, including Grabczewski's monumental case study of the
10654 * The previous version of HOL renamed to Old_HOL;
10656 * The new version of HOL (previously called CHOL) uses a curried syntax
10657 for functions. Application looks like f a b instead of f(a,b);
10659 * Mutually recursive inductive definitions finally work in HOL;
10661 * In ZF, pattern-matching on tuples is now available in all abstractions and
10662 translates to the operator "split";
10666 New in Isabelle94-3
10667 -------------------
10669 * new infix operator, addss, allowing the classical reasoner to
10670 perform simplification at each step of its search. Example:
10671 fast_tac (cs addss ss)
10673 * a new logic, CHOL, the same as HOL, but with a curried syntax
10674 for functions. Application looks like f a b instead of f(a,b). Also pairs
10675 look like (a,b) instead of <a,b>;
10677 * PLEASE NOTE: CHOL will eventually replace HOL!
10679 * In CHOL, pattern-matching on tuples is now available in all abstractions.
10680 It translates to the operator "split". A new theory of integers is available;
10682 * In ZF, integer numerals now denote two's-complement binary integers.
10683 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
10685 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
10686 of the Axiom of Choice;
10690 New in Isabelle94-2
10691 -------------------
10693 * Significantly faster resolution;
10695 * the different sections in a .thy file can now be mixed and repeated
10698 * Database of theorems for FOL, HOL and ZF. New
10699 commands including qed, qed_goal and bind_thm store theorems in the database.
10701 * Simple database queries: return a named theorem (get_thm) or all theorems of
10702 a given theory (thms_of), or find out what theory a theorem was proved in
10705 * Bugs fixed in the inductive definition and datatype packages;
10707 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
10708 and HOL_dup_cs obsolete;
10710 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
10713 * Simpler definition of function space in ZF;
10715 * new results about cardinal and ordinal arithmetic in ZF;
10717 * 'subtype' facility in HOL for introducing new types as subsets of existing
10720 :mode=isabelle-news:wrap=hard:maxLineLen=72: