moving generic lemmas out of theory parity, disregarding some unused auxiliary lemmas;
tuned presburger
1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in this Isabelle version
5 ----------------------------
9 * Fact name generalization and consolidation:
10 neq_one_mod_two, mod_2_not_eq_zero_eq_one_int ~> not_mod_2_eq_0_eq_1
14 New in Isabelle2013-1 (November 2013)
15 -------------------------------------
19 * Discontinued obsolete 'uses' within theory header. Note that
20 commands like 'ML_file' work without separate declaration of file
21 dependencies. Minor INCOMPATIBILITY.
23 * Discontinued redundant 'use' command, which was superseded by
24 'ML_file' in Isabelle2013. Minor INCOMPATIBILITY.
26 * Simplified subscripts within identifiers, using plain \<^sub>
27 instead of the second copy \<^isub> and \<^isup>. Superscripts are
28 only for literal tokens within notation; explicit mixfix annotations
29 for consts or fixed variables may be used as fall-back for unusual
30 names. Obsolete \<twosuperior> has been expanded to \<^sup>2 in
31 Isabelle/HOL. INCOMPATIBILITY, use "isabelle update_sub_sup" to
32 standardize symbols as a starting point for further manual cleanup.
33 The ML reference variable "legacy_isub_isup" may be set as temporary
34 workaround, to make the prover accept a subset of the old identifier
37 * Document antiquotations: term style "isub" has been renamed to
38 "sub". Minor INCOMPATIBILITY.
40 * Uniform management of "quick_and_dirty" as system option (see also
41 "isabelle options"), configuration option within the context (see also
42 Config.get in Isabelle/ML), and attribute in Isabelle/Isar. Minor
43 INCOMPATIBILITY, need to use more official Isabelle means to access
44 quick_and_dirty, instead of historical poking into mutable reference.
46 * Renamed command 'print_configs' to 'print_options'. Minor
49 * Proper diagnostic command 'print_state'. Old 'pr' (with its
50 implicit change of some global references) is retained for now as
51 control command, e.g. for ProofGeneral 3.7.x.
53 * Discontinued 'print_drafts' command with its old-fashioned PS output
54 and Unix command-line print spooling. Minor INCOMPATIBILITY: use
55 'display_drafts' instead and print via the regular document viewer.
57 * Updated and extended "isar-ref" and "implementation" manual,
58 eliminated old "ref" manual.
61 *** Prover IDE -- Isabelle/Scala/jEdit ***
63 * New manual "jedit" for Isabelle/jEdit, see isabelle doc or
66 * Dockable window "Documentation" provides access to Isabelle
69 * Dockable window "Find" provides query operations for formal entities
70 (GUI front-end to 'find_theorems' command).
72 * Dockable window "Sledgehammer" manages asynchronous / parallel
73 sledgehammer runs over existing document sources, independently of
74 normal editing and checking process.
76 * Dockable window "Timing" provides an overview of relevant command
79 * Improved dockable window "Theories": Continuous checking of proof
80 document (visible and required parts) may be controlled explicitly,
81 using check box or shortcut "C+e ENTER". Individual theory nodes may
82 be marked explicitly as required and checked in full, using check box
83 or shortcut "C+e SPACE".
85 * Strictly monotonic document update, without premature cancellation of
86 running transactions that are still needed: avoid reset/restart of
87 such command executions while editing.
89 * Improved completion mechanism, which is now managed by the
90 Isabelle/jEdit plugin instead of SideKick. Refined table of Isabelle
91 symbol abbreviations (see $ISABELLE_HOME/etc/symbols).
93 * Support for asynchronous print functions, as overlay to existing
96 * Support for automatic tools in HOL, which try to prove or disprove
97 toplevel theorem statements.
99 * Action isabelle.reset-font-size resets main text area font size
100 according to Isabelle/Scala plugin option "jedit_font_reset_size"
101 (cf. keyboard shortcut C+0).
103 * File specifications in jEdit (e.g. file browser) may refer to
104 $ISABELLE_HOME on all platforms. Discontinued obsolete
105 $ISABELLE_HOME_WINDOWS variable.
107 * Improved support for Linux look-and-feel "GTK+", see also "Utilities
108 / Global Options / Appearance".
110 * Improved support of native Mac OS X functionality via "MacOSX"
111 plugin, which is now enabled by default.
116 * Commands 'interpretation' and 'sublocale' are now target-sensitive.
117 In particular, 'interpretation' allows for non-persistent
118 interpretation within "context ... begin ... end" blocks offering a
119 light-weight alternative to 'sublocale'. See "isar-ref" manual for
122 * Improved locales diagnostic command 'print_dependencies'.
124 * Discontinued obsolete 'axioms' command, which has been marked as
125 legacy since Isabelle2009-2. INCOMPATIBILITY, use 'axiomatization'
126 instead, while observing its uniform scope for polymorphism.
128 * Discontinued empty name bindings in 'axiomatization'.
131 * System option "proofs" has been discontinued. Instead the global
132 state of Proofterm.proofs is persistently compiled into logic images
133 as required, notably HOL-Proofs. Users no longer need to change
134 Proofterm.proofs dynamically. Minor INCOMPATIBILITY.
136 * Syntax translation functions (print_translation etc.) always depend
137 on Proof.context. Discontinued former "(advanced)" option -- this is
138 now the default. Minor INCOMPATIBILITY.
140 * Former global reference trace_unify_fail is now available as
141 configuration option "unify_trace_failure" (global context only).
143 * SELECT_GOAL now retains the syntactic context of the overall goal
144 state (schematic variables etc.). Potential INCOMPATIBILITY in rare
150 * Stronger precedence of syntax for big intersection and union on
151 sets, in accordance with corresponding lattice operations.
154 * Notation "{p:A. P}" now allows tuple patterns as well.
156 * Nested case expressions are now translated in a separate check phase
157 rather than during parsing. The data for case combinators is separated
158 from the datatype package. The declaration attribute
159 "case_translation" can be used to register new case combinators:
161 declare [[case_translation case_combinator constructor1 ... constructorN]]
164 - 'code_printing' unifies 'code_const' / 'code_type' / 'code_class' /
166 - 'code_identifier' declares name hints for arbitrary identifiers in
167 generated code, subsuming 'code_modulename'.
169 See the isar-ref manual for syntax diagrams, and the HOL theories for
172 * Attibute 'code': 'code' now declares concrete and abstract code
173 equations uniformly. Use explicit 'code equation' and 'code abstract'
174 to distinguish both when desired.
176 * Discontinued theories Code_Integer and Efficient_Nat by a more
177 fine-grain stack of theories Code_Target_Int, Code_Binary_Nat,
178 Code_Target_Nat and Code_Target_Numeral. See the tutorial on code
179 generation for details. INCOMPATIBILITY.
181 * Numeric types are mapped by default to target language numerals:
182 natural (replaces former code_numeral) and integer (replaces former
183 code_int). Conversions are available as integer_of_natural /
184 natural_of_integer / integer_of_nat / nat_of_integer (in HOL) and
185 Code_Numeral.integer_of_natural / Code_Numeral.natural_of_integer (in
186 ML). INCOMPATIBILITY.
188 * Function package: For mutually recursive functions f and g, separate
189 cases rules f.cases and g.cases are generated instead of unusable
190 f_g.cases which exposed internal sum types. Potential INCOMPATIBILITY,
191 in the case that the unusable rule was used nevertheless.
193 * Function package: For each function f, new rules f.elims are
194 generated, which eliminate equalities of the form "f x = t".
196 * New command 'fun_cases' derives ad-hoc elimination rules for
197 function equations as simplified instances of f.elims, analogous to
198 inductive_cases. See ~~/src/HOL/ex/Fundefs.thy for some examples.
201 - parametrized correspondence relations are now supported:
202 + parametricity theorems for the raw term can be specified in
203 the command lift_definition, which allow us to generate stronger
205 + setup_lifting generates stronger transfer rules if parametric
206 correspondence relation can be generated
207 + various new properties of the relator must be specified to support
209 + parametricity theorem for the Quotient relation can be specified
210 - setup_lifting generates domain rules for the Transfer package
211 - stronger reflexivity prover of respectfulness theorems for type
213 - ===> and --> are now local. The symbols can be introduced
214 by interpreting the locale lifting_syntax (typically in an
216 - Lifting/Transfer relevant parts of Library/Quotient_* are now in
217 Main. Potential INCOMPATIBILITY
218 - new commands for restoring and deleting Lifting/Transfer context:
219 lifting_forget, lifting_update
220 - the command print_quotmaps was renamed to print_quot_maps.
224 - better support for domains in Transfer: replace Domainp T
225 by the actual invariant in a transferred goal
226 - transfer rules can have as assumptions other transfer rules
227 - Experimental support for transferring from the raw level to the
228 abstract level: Transfer.transferred attribute
229 - Attribute version of the transfer method: untransferred attribute
231 * Reification and reflection:
232 - Reification is now directly available in HOL-Main in structure
234 - Reflection now handles multiple lists with variables also.
235 - The whole reflection stack has been decomposed into conversions.
238 * Revised devices for recursive definitions over finite sets:
239 - Only one fundamental fold combinator on finite set remains:
240 Finite_Set.fold :: ('a => 'b => 'b) => 'b => 'a set => 'b
241 This is now identity on infinite sets.
242 - Locales ("mini packages") for fundamental definitions with
243 Finite_Set.fold: folding, folding_idem.
244 - Locales comm_monoid_set, semilattice_order_set and
245 semilattice_neutr_order_set for big operators on sets.
246 See theory Big_Operators for canonical examples.
247 Note that foundational constants comm_monoid_set.F and
248 semilattice_set.F correspond to former combinators fold_image
249 and fold1 respectively. These are now gone. You may use
250 those foundational constants as substitutes, but it is
251 preferable to interpret the above locales accordingly.
252 - Dropped class ab_semigroup_idem_mult (special case of lattice,
253 no longer needed in connection with Finite_Set.fold etc.)
255 card.union_inter ~> card_Un_Int [symmetric]
256 card.union_disjoint ~> card_Un_disjoint
259 * Locale hierarchy for abstract orderings and (semi)lattices.
261 * Complete_Partial_Order.admissible is defined outside the type class
262 ccpo, but with mandatory prefix ccpo. Admissibility theorems lose the
263 class predicate assumption or sort constraint when possible.
266 * Introduce type class "conditionally_complete_lattice": Like a
267 complete lattice but does not assume the existence of the top and
268 bottom elements. Allows to generalize some lemmas about reals and
269 extended reals. Removed SupInf and replaced it by the instantiation
270 of conditionally_complete_lattice for real. Renamed lemmas about
271 conditionally-complete lattice from Sup_... to cSup_... and from
272 Inf_... to cInf_... to avoid hidding of similar complete lattice
275 * Introduce type class linear_continuum as combination of
276 conditionally-complete lattices and inner dense linorders which have
277 more than one element. INCOMPATIBILITY.
279 * Introduced type classes order_top and order_bot. The old classes top
280 and bot only contain the syntax without assumptions. INCOMPATIBILITY:
281 Rename bot -> order_bot, top -> order_top
283 * Introduce type classes "no_top" and "no_bot" for orderings without
284 top and bottom elements.
286 * Split dense_linorder into inner_dense_order and no_top, no_bot.
288 * Complex_Main: Unify and move various concepts from
289 HOL-Multivariate_Analysis to HOL-Complex_Main.
291 - Introduce type class (lin)order_topology and
292 linear_continuum_topology. Allows to generalize theorems about
293 limits and order. Instances are reals and extended reals.
295 - continuous and continuos_on from Multivariate_Analysis:
296 "continuous" is the continuity of a function at a filter. "isCont"
297 is now an abbrevitation: "isCont x f == continuous (at _) f".
299 Generalized continuity lemmas from isCont to continuous on an
302 - compact from Multivariate_Analysis. Use Bolzano's lemma to prove
303 compactness of closed intervals on reals. Continuous functions
304 attain infimum and supremum on compact sets. The inverse of a
305 continuous function is continuous, when the function is continuous
308 - connected from Multivariate_Analysis. Use it to prove the
309 intermediate value theorem. Show connectedness of intervals on
310 linear_continuum_topology).
312 - first_countable_topology from Multivariate_Analysis. Is used to
313 show equivalence of properties on the neighbourhood filter of x and
314 on all sequences converging to x.
316 - FDERIV: Definition of has_derivative moved to Deriv.thy. Moved
317 theorems from Library/FDERIV.thy to Deriv.thy and base the
318 definition of DERIV on FDERIV. Add variants of DERIV and FDERIV
319 which are restricted to sets, i.e. to represent derivatives from
322 - Removed the within-filter. It is replaced by the principal filter:
324 F within X = inf F (principal X)
326 - Introduce "at x within U" as a single constant, "at x" is now an
327 abbreviation for "at x within UNIV"
329 - Introduce named theorem collections tendsto_intros,
330 continuous_intros, continuous_on_intros and FDERIV_intros. Theorems
331 in tendsto_intros (or FDERIV_intros) are also available as
332 tendsto_eq_intros (or FDERIV_eq_intros) where the right-hand side
333 is replaced by a congruence rule. This allows to apply them as
334 intro rules and then proving equivalence by the simplifier.
336 - Restructured theories in HOL-Complex_Main:
338 + Moved RealDef and RComplete into Real
340 + Introduced Topological_Spaces and moved theorems about
341 topological spaces, filters, limits and continuity to it
343 + Renamed RealVector to Real_Vector_Spaces
345 + Split Lim, SEQ, Series into Topological_Spaces,
346 Real_Vector_Spaces, and Limits
348 + Moved Ln and Log to Transcendental
350 + Moved theorems about continuity from Deriv to Topological_Spaces
352 - Remove various auxiliary lemmas.
358 - Reduce incidence of "too high arity" errors
362 isar_shrink ~> isar_compress
364 - Added options "isar_try0", "spy"
365 - Better support for "isar_proofs"
366 - MaSh has been fined-tuned and now runs as a local server
368 * Improved support for ad hoc overloading of constants (see also
369 isar-ref manual and ~~/src/HOL/ex/Adhoc_Overloading_Examples.thy).
371 * Library/Polynomial.thy:
372 - Use lifting for primitive definitions.
373 - Explicit conversions from and to lists of coefficients, used for
375 - Replaced recursion operator poly_rec by fold_coeffs.
376 - Prefer pre-existing gcd operation for gcd.
378 poly_eq_iff ~> poly_eq_poly_eq_iff
380 expand_poly_eq ~> poly_eq_iff
383 * New Library/Simps_Case_Conv.thy: Provides commands simps_of_case and
384 case_of_simps to convert function definitions between a list of
385 equations with patterns on the lhs and a single equation with case
386 expressions on the rhs. See also Ex/Simps_Case_Conv_Examples.thy.
388 * New Library/FSet.thy: type of finite sets defined as a subtype of
389 sets defined by Lifting/Transfer.
391 * Discontinued theory src/HOL/Library/Eval_Witness. INCOMPATIBILITY.
393 * Consolidation of library theories on product orders:
395 Product_Lattice ~> Product_Order -- pointwise order on products
396 Product_ord ~> Product_Lexorder -- lexicographic order on products
400 * Imperative-HOL: The MREC combinator is considered legacy and no
401 longer included by default. INCOMPATIBILITY, use partial_function
402 instead, or import theory Legacy_Mrec as a fallback.
404 * HOL-Algebra: Discontinued theories ~~/src/HOL/Algebra/abstract and
405 ~~/src/HOL/Algebra/poly. Existing theories should be based on
406 ~~/src/HOL/Library/Polynomial instead. The latter provides
407 integration with HOL's type classes for rings. INCOMPATIBILITY.
410 - Various improvements to BNF-based (co)datatype package, including
411 new commands "primrec_new", "primcorec", and
412 "datatype_new_compat", as well as documentation. See
413 "datatypes.pdf" for details.
414 - New "coinduction" method to avoid some boilerplate (compared to
420 - Renamed many generated theorems, including
422 map_comp' ~> map_comp
432 * Spec_Check is a Quickcheck tool for Isabelle/ML. The ML function
433 "check_property" allows to check specifications of the form "ALL x y
434 z. prop x y z". See also ~~/src/Tools/Spec_Check/ with its
435 Examples.thy in particular.
437 * Improved printing of exception trace in Poly/ML 5.5.1, with regular
438 tracing output in the command transaction context instead of physical
439 stdout. See also Toplevel.debug, Toplevel.debugging and
440 ML_Compiler.exn_trace.
442 * ML type "theory" is now immutable, without any special treatment of
443 drafts or linear updates (which could lead to "stale theory" errors in
444 the past). Discontinued obsolete operations like Theory.copy,
445 Theory.checkpoint, and the auxiliary type theory_ref. Minor
448 * More uniform naming of goal functions for skipped proofs:
450 Skip_Proof.prove ~> Goal.prove_sorry
451 Skip_Proof.prove_global ~> Goal.prove_sorry_global
453 Minor INCOMPATIBILITY.
455 * Simplifier tactics and tools use proper Proof.context instead of
456 historic type simpset. Old-style declarations like addsimps,
457 addsimprocs etc. operate directly on Proof.context. Raw type simpset
458 retains its use as snapshot of the main Simplifier context, using
459 simpset_of and put_simpset on Proof.context. INCOMPATIBILITY -- port
460 old tools by making them depend on (ctxt : Proof.context) instead of
461 (ss : simpset), then turn (simpset_of ctxt) into ctxt.
463 * Modifiers for classical wrappers (e.g. addWrapper, delWrapper)
464 operate on Proof.context instead of claset, for uniformity with addIs,
465 addEs, addDs etc. Note that claset_of and put_claset allow to manage
466 clasets separately from the context.
468 * Discontinued obsolete ML antiquotations @{claset} and @{simpset}.
469 INCOMPATIBILITY, use @{context} instead.
471 * Antiquotation @{theory_context A} is similar to @{theory A}, but
472 presents the result as initial Proof.context.
477 * Discontinued obsolete isabelle usedir, mkdir, make -- superseded by
478 "isabelle build" in Isabelle2013. INCOMPATIBILITY.
480 * Discontinued obsolete isabelle-process options -f and -u (former
481 administrative aliases of option -e). Minor INCOMPATIBILITY.
483 * Discontinued obsolete isabelle print tool, and PRINT_COMMAND
486 * Discontinued ISABELLE_DOC_FORMAT settings variable and historic
487 document formats: dvi.gz, ps, ps.gz -- the default document format is
490 * Isabelle settings variable ISABELLE_BUILD_JAVA_OPTIONS allows to
491 specify global resources of the JVM process run by isabelle build.
493 * Toplevel executable $ISABELLE_HOME/bin/isabelle_scala_script allows
494 to run Isabelle/Scala source files as standalone programs.
496 * Improved "isabelle keywords" tool (for old-style ProofGeneral
497 keyword tables): use Isabelle/Scala operations, which inspect outer
498 syntax without requiring to build sessions first.
500 * Sessions may be organized via 'chapter' specifications in the ROOT
501 file, which determines a two-level hierarchy of browser info. The old
502 tree-like organization via implicit sub-session relation (with its
503 tendency towards erratic fluctuation of URLs) has been discontinued.
504 The default chapter is called "Unsorted". Potential INCOMPATIBILITY
505 for HTML presentation of theories.
509 New in Isabelle2013 (February 2013)
510 -----------------------------------
514 * Theorem status about oracles and unfinished/failed future proofs is
515 no longer printed by default, since it is incompatible with
516 incremental / parallel checking of the persistent document model. ML
517 function Thm.peek_status may be used to inspect a snapshot of the
518 ongoing evaluation process. Note that in batch mode --- notably
519 isabelle build --- the system ensures that future proofs of all
520 accessible theorems in the theory context are finished (as before).
522 * Configuration option show_markup controls direct inlining of markup
523 into the printed representation of formal entities --- notably type
524 and sort constraints. This enables Prover IDE users to retrieve that
525 information via tooltips in the output window, for example.
527 * Command 'ML_file' evaluates ML text from a file directly within the
528 theory, without any predeclaration via 'uses' in the theory header.
530 * Old command 'use' command and corresponding keyword 'uses' in the
531 theory header are legacy features and will be discontinued soon.
532 Tools that load their additional source files may imitate the
533 'ML_file' implementation, such that the system can take care of
534 dependencies properly.
536 * Discontinued obsolete method fastsimp / tactic fast_simp_tac, which
537 is called fastforce / fast_force_tac already since Isabelle2011-1.
539 * Updated and extended "isar-ref" and "implementation" manual, reduced
540 remaining material in old "ref" manual.
542 * Improved support for auxiliary contexts that indicate block structure
543 for specifications. Nesting of "context fixes ... context assumes ..."
544 and "class ... context ...".
546 * Attribute "consumes" allows a negative value as well, which is
547 interpreted relatively to the total number of premises of the rule in
548 the target context. This form of declaration is stable when exported
549 from a nested 'context' with additional assumptions. It is the
550 preferred form for definitional packages, notably cases/rules produced
551 in HOL/inductive and HOL/function.
553 * More informative error messages for Isar proof commands involving
554 lazy enumerations (method applications etc.).
556 * Refined 'help' command to retrieve outer syntax commands according
557 to name patterns (with clickable results).
560 *** Prover IDE -- Isabelle/Scala/jEdit ***
562 * Parallel terminal proofs ('by') are enabled by default, likewise
563 proofs that are built into packages like 'datatype', 'function'. This
564 allows to "run ahead" checking the theory specifications on the
565 surface, while the prover is still crunching on internal
566 justifications. Unfinished / cancelled proofs are restarted as
567 required to complete full proof checking eventually.
569 * Improved output panel with tooltips, hyperlinks etc. based on the
570 same Rich_Text_Area as regular Isabelle/jEdit buffers. Activation of
571 tooltips leads to some window that supports the same recursively,
572 which can lead to stacks of tooltips as the semantic document content
573 is explored. ESCAPE closes the whole stack, individual windows may be
574 closed separately, or detached to become independent jEdit dockables.
576 * Improved support for commands that produce graph output: the text
577 message contains a clickable area to open a new instance of the graph
580 * More robust incremental parsing of outer syntax (partial comments,
581 malformed symbols). Changing the balance of open/close quotes and
582 comment delimiters works more conveniently with unfinished situations
583 that frequently occur in user interaction.
585 * More efficient painting and improved reactivity when editing large
586 files. More scalable management of formal document content.
588 * Smarter handling of tracing messages: prover process pauses after
589 certain number of messages per command transaction, with some user
590 dialog to stop or continue. This avoids swamping the front-end with
591 potentially infinite message streams.
593 * More plugin options and preferences, based on Isabelle/Scala. The
594 jEdit plugin option panel provides access to some Isabelle/Scala
595 options, including tuning parameters for editor reactivity and color
598 * Dockable window "Symbols" provides some editing support for Isabelle
601 * Dockable window "Monitor" shows ML runtime statistics. Note that
602 continuous display of the chart slows down the system.
604 * Improved editing support for control styles: subscript, superscript,
605 bold, reset of style -- operating on single symbols or text
606 selections. Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT.
608 * Actions isabelle.increase-font-size and isabelle.decrease-font-size
609 adjust the main text area font size, and its derivatives for output,
610 tooltips etc. Cf. keyboard shortcuts C-PLUS and C-MINUS, which often
611 need to be adapted to local keyboard layouts.
613 * More reactive completion popup by default: use \t (TAB) instead of
614 \n (NEWLINE) to minimize intrusion into regular flow of editing. See
615 also "Plugin Options / SideKick / General / Code Completion Options".
617 * Implicit check and build dialog of the specified logic session
618 image. For example, HOL, HOLCF, HOL-Nominal can be produced on
619 demand, without bundling big platform-dependent heap images in the
620 Isabelle distribution.
622 * Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates
623 from Oracle provide better multi-platform experience. This version is
624 now bundled exclusively with Isabelle.
629 * Code generation for Haskell: restrict unqualified imports from
630 Haskell Prelude to a small set of fundamental operations.
632 * Command 'export_code': relative file names are interpreted
633 relatively to master directory of current theory rather than the
634 rather arbitrary current working directory. INCOMPATIBILITY.
636 * Discontinued obsolete attribute "COMP". Potential INCOMPATIBILITY,
637 use regular rule composition via "OF" / "THEN", or explicit proof
638 structure instead. Note that Isabelle/ML provides a variety of
639 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied
640 with some care where this is really required.
642 * Command 'typ' supports an additional variant with explicit sort
643 constraint, to infer and check the most general type conforming to a
644 given sort. Example (in HOL):
646 typ "_ * _ * bool * unit" :: finite
648 * Command 'locale_deps' visualizes all locales and their relations as
656 - Added MaSh relevance filter based on machine-learning; see the
657 Sledgehammer manual for details.
658 - Polished Isar proofs generated with "isar_proofs" option.
659 - Rationalized type encodings ("type_enc" option).
660 - Renamed "kill_provers" subcommand to "kill_all".
662 isar_proof ~> isar_proofs
663 isar_shrink_factor ~> isar_shrink
664 max_relevant ~> max_facts
665 relevance_thresholds ~> fact_thresholds
667 * Quickcheck: added an optimisation for equality premises. It is
668 switched on by default, and can be switched off by setting the
669 configuration quickcheck_optimise_equality to false.
671 * Quotient: only one quotient can be defined by quotient_type
675 - generation of an abstraction function equation in lift_definition
677 - renamed no_abs_code -> no_code (INCOMPATIBILITY.)
679 * Simproc "finite_Collect" rewrites set comprehensions into pointfree
682 * Preprocessing of the code generator rewrites set comprehensions into
683 pointfree expressions.
685 * The SMT solver Z3 has now by default a restricted set of directly
686 supported features. For the full set of features (div/mod, nonlinear
687 arithmetic, datatypes/records) with potential proof reconstruction
688 failures, enable the configuration option "z3_with_extensions". Minor
691 * Simplified 'typedef' specifications: historical options for implicit
692 set definition and alternative name have been discontinued. The
693 former behavior of "typedef (open) t = A" is now the default, but
694 written just "typedef t = A". INCOMPATIBILITY, need to adapt theories
697 * Removed constant "chars"; prefer "Enum.enum" on type "char"
698 directly. INCOMPATIBILITY.
700 * Moved operation product, sublists and n_lists from theory Enum to
701 List. INCOMPATIBILITY.
703 * Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY.
705 * Class "comm_monoid_diff" formalises properties of bounded
706 subtraction, with natural numbers and multisets as typical instances.
708 * Added combinator "Option.these" with type "'a option set => 'a set".
710 * Theory "Transitive_Closure": renamed lemmas
712 reflcl_tranclp -> reflclp_tranclp
713 rtranclp_reflcl -> rtranclp_reflclp
717 * Theory "Rings": renamed lemmas (in class semiring)
719 left_distrib ~> distrib_right
720 right_distrib ~> distrib_left
724 * Generalized the definition of limits:
726 - Introduced the predicate filterlim (LIM x F. f x :> G) which
727 expresses that when the input values x converge to F then the
728 output f x converges to G.
730 - Added filters for convergence to positive (at_top) and negative
733 - Moved infinity in the norm (at_infinity) from
734 Multivariate_Analysis to Complex_Main.
736 - Removed real_tendsto_inf, it is superseded by "LIM x F. f x :>
741 * Theory "Library/Option_ord" provides instantiation of option type to
742 lattice type classes.
744 * Theory "Library/Multiset": renamed
746 constant fold_mset ~> Multiset.fold
747 fact fold_mset_commute ~> fold_mset_comm
751 * Renamed theory Library/List_Prefix to Library/Sublist, with related
754 - Renamed constants (and related lemmas)
757 strict_prefix ~> prefix
759 - Replaced constant "postfix" by "suffixeq" with swapped argument
760 order (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped
761 old infix syntax "xs >>= ys"; use "suffixeq ys xs" instead.
762 Renamed lemmas accordingly.
764 - Added constant "list_hembeq" for homeomorphic embedding on
765 lists. Added abbreviation "sublisteq" for special case
766 "list_hembeq (op =)".
768 - Theory Library/Sublist no longer provides "order" and "bot" type
769 class instances for the prefix order (merely corresponding locale
770 interpretations). The type class instances are now in theory
771 Library/Prefix_Order.
773 - The sublist relation of theory Library/Sublist_Order is now based
774 on "Sublist.sublisteq". Renamed lemmas accordingly:
776 le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff
777 le_list_append_mono ~> Sublist.list_hembeq_append_mono
778 le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2
779 le_list_Cons_EX ~> Sublist.list_hembeq_ConsD
780 le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2'
781 le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq
782 le_list_drop_Cons ~> Sublist.sublisteq_Cons'
783 le_list_drop_many ~> Sublist.sublisteq_drop_many
784 le_list_filter_left ~> Sublist.sublisteq_filter_left
785 le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many
786 le_list_rev_take_iff ~> Sublist.sublisteq_append
787 le_list_same_length ~> Sublist.sublisteq_same_length
788 le_list_take_many_iff ~> Sublist.sublisteq_append'
789 less_eq_list.drop ~> less_eq_list_drop
790 less_eq_list.induct ~> less_eq_list_induct
791 not_le_list_length ~> Sublist.not_sublisteq_length
795 * New theory Library/Countable_Set.
797 * Theory Library/Debug and Library/Parallel provide debugging and
798 parallel execution for code generated towards Isabelle/ML.
800 * Theory Library/FuncSet: Extended support for Pi and extensional and
801 introduce the extensional dependent function space "PiE". Replaced
802 extensional_funcset by an abbreviation, and renamed lemmas from
803 extensional_funcset to PiE as follows:
805 extensional_empty ~> PiE_empty
806 extensional_funcset_empty_domain ~> PiE_empty_domain
807 extensional_funcset_empty_range ~> PiE_empty_range
808 extensional_funcset_arb ~> PiE_arb
809 extensional_funcset_mem ~> PiE_mem
810 extensional_funcset_extend_domainI ~> PiE_fun_upd
811 extensional_funcset_restrict_domain ~> fun_upd_in_PiE
812 extensional_funcset_extend_domain_eq ~> PiE_insert_eq
813 card_extensional_funcset ~> card_PiE
814 finite_extensional_funcset ~> finite_PiE
818 * Theory Library/FinFun: theory of almost everywhere constant
819 functions (supersedes the AFP entry "Code Generation for Functions as
822 * Theory Library/Phantom: generic phantom type to make a type
823 parameter appear in a constant's type. This alternative to adding
824 TYPE('a) as another parameter avoids unnecessary closures in generated
827 * Theory Library/RBT_Impl: efficient construction of red-black trees
828 from sorted associative lists. Merging two trees with rbt_union may
829 return a structurally different tree than before. Potential
832 * Theory Library/IArray: immutable arrays with code generation.
834 * Theory Library/Finite_Lattice: theory of finite lattices.
836 * HOL/Multivariate_Analysis: replaced
838 "basis :: 'a::euclidean_space => nat => real"
839 "\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space"
841 on euclidean spaces by using the inner product "_ \<bullet> _" with
842 vectors from the Basis set: "\<Chi>\<Chi> i. f i" is superseded by
843 "SUM i : Basis. f i * r i".
845 With this change the following constants are also changed or removed:
847 DIM('a) :: nat ~> card (Basis :: 'a set) (is an abbreviation)
848 a $$ i ~> inner a i (where i : Basis)
850 \<pi>, \<pi>' removed
852 Theorems about these constants where removed.
856 component_le_norm ~> Basis_le_norm
857 euclidean_eq ~> euclidean_eq_iff
858 differential_zero_maxmin_component ~> differential_zero_maxmin_cart
859 euclidean_simps ~> inner_simps
860 independent_basis ~> independent_Basis
861 span_basis ~> span_Basis
862 in_span_basis ~> in_span_Basis
863 norm_bound_component_le ~> norm_boound_Basis_le
864 norm_bound_component_lt ~> norm_boound_Basis_lt
865 component_le_infnorm ~> Basis_le_infnorm
871 - Added simproc "measurable" to automatically prove measurability.
873 - Added induction rules for sigma sets with disjoint union
874 (sigma_sets_induct_disjoint) and for Borel-measurable functions
875 (borel_measurable_induct).
877 - Added the Daniell-Kolmogorov theorem (the existence the limit of a
880 * HOL/Cardinals: Theories of ordinals and cardinals (supersedes the
881 AFP entry "Ordinals_and_Cardinals").
883 * HOL/BNF: New (co)datatype package based on bounded natural functors
884 with support for mixed, nested recursion and interesting non-free
887 * HOL/Finite_Set and Relation: added new set and relation operations
888 expressed by Finite_Set.fold.
890 * New theory HOL/Library/RBT_Set: implementation of sets by red-black
891 trees for the code generator.
893 * HOL/Library/RBT and HOL/Library/Mapping have been converted to
895 possible INCOMPATIBILITY.
897 * HOL/Set: renamed Set.project -> Set.filter
901 *** Document preparation ***
903 * Dropped legacy antiquotations "term_style" and "thm_style", since
904 styles may be given as arguments to "term" and "thm" already.
905 Discontinued legacy styles "prem1" .. "prem19".
907 * Default LaTeX rendering for \<euro> is now based on eurosym package,
908 instead of slightly exotic babel/greek.
910 * Document variant NAME may use different LaTeX entry point
911 document/root_NAME.tex if that file exists, instead of the common
914 * Simplified custom document/build script, instead of old-style
915 document/IsaMakefile. Minor INCOMPATIBILITY.
920 * The default limit for maximum number of worker threads is now 8,
921 instead of 4, in correspondence to capabilities of contemporary
922 hardware and Poly/ML runtime system.
924 * Type Seq.results and related operations support embedded error
925 messages within lazy enumerations, and thus allow to provide
926 informative errors in the absence of any usable results.
928 * Renamed Position.str_of to Position.here to emphasize that this is a
929 formal device to inline positions into message text, but not
930 necessarily printing visible text.
935 * Advanced support for Isabelle sessions and build management, see
936 "system" manual for the chapter of that name, especially the "isabelle
937 build" tool and its examples. The "isabelle mkroot" tool prepares
938 session root directories for use with "isabelle build", similar to
939 former "isabelle mkdir" for "isabelle usedir". Note that this affects
940 document preparation as well. INCOMPATIBILITY, isabelle usedir /
941 mkdir / make are rendered obsolete.
943 * Discontinued obsolete Isabelle/build script, it is superseded by the
944 regular isabelle build tool. For example:
946 isabelle build -s -b HOL
948 * Discontinued obsolete "isabelle makeall".
950 * Discontinued obsolete IsaMakefile and ROOT.ML files from the
951 Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that
952 provides some traditional targets that invoke "isabelle build". Note
953 that this is inefficient! Applications of Isabelle/HOL involving
954 "isabelle make" should be upgraded to use "isabelle build" directly.
956 * The "isabelle options" tool prints Isabelle system options, as
957 required for "isabelle build", for example.
959 * The "isabelle logo" tool produces EPS and PDF format simultaneously.
960 Minor INCOMPATIBILITY in command-line options.
962 * The "isabelle install" tool has now a simpler command-line. Minor
965 * The "isabelle components" tool helps to resolve add-on components
966 that are not bundled, or referenced from a bare-bones repository
969 * Settings variable ISABELLE_PLATFORM_FAMILY refers to the general
970 platform family: "linux", "macos", "windows".
972 * The ML system is configured as regular component, and no longer
973 picked up from some surrounding directory. Potential INCOMPATIBILITY
974 for home-made settings.
976 * Improved ML runtime statistics (heap, threads, future tasks etc.).
978 * Discontinued support for Poly/ML 5.2.1, which was the last version
979 without exception positions and advanced ML compiler/toplevel
982 * Discontinued special treatment of Proof General -- no longer guess
983 PROOFGENERAL_HOME based on accidental file-system layout. Minor
984 INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS
985 settings manually, or use a Proof General version that has been
986 bundled as Isabelle component.
990 New in Isabelle2012 (May 2012)
991 ------------------------------
995 * Prover IDE (PIDE) improvements:
997 - more robust Sledgehammer integration (as before the sledgehammer
998 command-line needs to be typed into the source buffer)
999 - markup for bound variables
1000 - markup for types of term variables (displayed as tooltips)
1001 - support for user-defined Isar commands within the running session
1002 - improved support for Unicode outside original 16bit range
1003 e.g. glyph for \<A> (thanks to jEdit 4.5.1)
1005 * Forward declaration of outer syntax keywords within the theory
1006 header -- minor INCOMPATIBILITY for user-defined commands. Allow new
1007 commands to be used in the same theory where defined.
1009 * Auxiliary contexts indicate block structure for specifications with
1010 additional parameters and assumptions. Such unnamed contexts may be
1011 nested within other targets, like 'theory', 'locale', 'class',
1012 'instantiation' etc. Results from the local context are generalized
1013 accordingly and applied to the enclosing target context. Example:
1017 assumes xy: "x = y" and yz: "y = z"
1020 lemma my_trans: "x = z" using xy yz by simp
1026 The most basic application is to factor-out context elements of
1027 several fixes/assumes/shows theorem statements, e.g. see
1028 ~~/src/HOL/Isar_Examples/Group_Context.thy
1030 Any other local theory specification element works within the "context
1031 ... begin ... end" block as well.
1033 * Bundled declarations associate attributed fact expressions with a
1034 given name in the context. These may be later included in other
1035 contexts. This allows to manage context extensions casually, without
1036 the logical dependencies of locales and locale interpretation. See
1037 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.
1039 * Commands 'lemmas' and 'theorems' allow local variables using 'for'
1040 declaration, and results are standardized before being stored. Thus
1041 old-style "standard" after instantiation or composition of facts
1042 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of
1043 indices of schematic variables.
1045 * Rule attributes in local theory declarations (e.g. locale or class)
1046 are now statically evaluated: the resulting theorem is stored instead
1047 of the original expression. INCOMPATIBILITY in rare situations, where
1048 the historic accident of dynamic re-evaluation in interpretations
1051 * New tutorial "Programming and Proving in Isabelle/HOL"
1052 ("prog-prove"). It completely supersedes "A Tutorial Introduction to
1053 Structured Isar Proofs" ("isar-overview"), which has been removed. It
1054 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order
1055 Logic" as the recommended beginners tutorial, but does not cover all
1056 of the material of that old tutorial.
1058 * Updated and extended reference manuals: "isar-ref",
1059 "implementation", "system"; reduced remaining material in old "ref"
1065 * Command 'definition' no longer exports the foundational "raw_def"
1066 into the user context. Minor INCOMPATIBILITY, may use the regular
1067 "def" result with attribute "abs_def" to imitate the old version.
1069 * Attribute "abs_def" turns an equation of the form "f x y == t" into
1070 "f == %x y. t", which ensures that "simp" or "unfold" steps always
1071 expand it. This also works for object-logic equality. (Formerly
1072 undocumented feature.)
1074 * Sort constraints are now propagated in simultaneous statements, just
1075 like type constraints. INCOMPATIBILITY in rare situations, where
1076 distinct sorts used to be assigned accidentally. For example:
1078 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"
1080 lemma "P (x::'a)" and "Q (y::'a::bar)"
1081 -- "now uniform 'a::bar instead of default sort for first occurrence (!)"
1083 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more
1084 tolerant against multiple unifiers, as long as the final result is
1085 unique. (As before, rules are composed in canonical right-to-left
1086 order to accommodate newly introduced premises.)
1088 * Renamed some inner syntax categories:
1094 Minor INCOMPATIBILITY. Note that in practice "num_const" or
1095 "num_position" etc. are mainly used instead (which also include
1096 position information via constraints).
1098 * Simplified configuration options for syntax ambiguity: see
1099 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
1100 manual. Minor INCOMPATIBILITY.
1102 * Discontinued configuration option "syntax_positions": atomic terms
1103 in parse trees are always annotated by position constraints.
1105 * Old code generator for SML and its commands 'code_module',
1106 'code_library', 'consts_code', 'types_code' have been discontinued.
1107 Use commands of the generic code generator instead. INCOMPATIBILITY.
1109 * Redundant attribute "code_inline" has been discontinued. Use
1110 "code_unfold" instead. INCOMPATIBILITY.
1112 * Dropped attribute "code_unfold_post" in favor of the its dual
1113 "code_abbrev", which yields a common pattern in definitions like
1115 definition [code_abbrev]: "f = t"
1119 * Obsolete 'types' command has been discontinued. Use 'type_synonym'
1120 instead. INCOMPATIBILITY.
1122 * Discontinued old "prems" fact, which used to refer to the accidental
1123 collection of foundational premises in the context (already marked as
1124 legacy since Isabelle2011).
1129 * Type 'a set is now a proper type constructor (just as before
1130 Isabelle2008). Definitions mem_def and Collect_def have disappeared.
1131 Non-trivial INCOMPATIBILITY. For developments keeping predicates and
1132 sets separate, it is often sufficient to rephrase some set S that has
1133 been accidentally used as predicates by "%x. x : S", and some
1134 predicate P that has been accidentally used as set by "{x. P x}".
1135 Corresponding proofs in a first step should be pruned from any
1136 tinkering with former theorems mem_def and Collect_def as far as
1139 For developments which deliberately mix predicates and sets, a
1140 planning step is necessary to determine what should become a predicate
1141 and what a set. It can be helpful to carry out that step in
1142 Isabelle2011-1 before jumping right into the current release.
1144 * Code generation by default implements sets as container type rather
1145 than predicates. INCOMPATIBILITY.
1147 * New type synonym 'a rel = ('a * 'a) set
1149 * The representation of numerals has changed. Datatype "num"
1150 represents strictly positive binary numerals, along with functions
1151 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent
1152 positive and negated numeric literals, respectively. See also
1153 definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some
1154 user theories may require adaptations as follows:
1156 - Theorems with number_ring or number_semiring constraints: These
1157 classes are gone; use comm_ring_1 or comm_semiring_1 instead.
1159 - Theories defining numeric types: Remove number, number_semiring,
1160 and number_ring instances. Defer all theorems about numerals until
1161 after classes one and semigroup_add have been instantiated.
1163 - Numeral-only simp rules: Replace each rule having a "number_of v"
1164 pattern with two copies, one for numeral and one for neg_numeral.
1166 - Theorems about subclasses of semiring_1 or ring_1: These classes
1167 automatically support numerals now, so more simp rules and
1168 simprocs may now apply within the proof.
1170 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:
1171 Redefine using other integer operations.
1173 * Transfer: New package intended to generalize the existing
1174 "descending" method and related theorem attributes from the Quotient
1175 package. (Not all functionality is implemented yet, but future
1176 development will focus on Transfer as an eventual replacement for the
1177 corresponding parts of the Quotient package.)
1179 - transfer_rule attribute: Maintains a collection of transfer rules,
1180 which relate constants at two different types. Transfer rules may
1181 relate different type instances of the same polymorphic constant,
1182 or they may relate an operation on a raw type to a corresponding
1183 operation on an abstract type (quotient or subtype). For example:
1185 ((A ===> B) ===> list_all2 A ===> list_all2 B) map map
1186 (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int
1188 - transfer method: Replaces a subgoal on abstract types with an
1189 equivalent subgoal on the corresponding raw types. Constants are
1190 replaced with corresponding ones according to the transfer rules.
1191 Goals are generalized over all free variables by default; this is
1192 necessary for variables whose types change, but can be overridden
1193 for specific variables with e.g. "transfer fixing: x y z". The
1194 variant transfer' method allows replacing a subgoal with one that
1195 is logically stronger (rather than equivalent).
1197 - relator_eq attribute: Collects identity laws for relators of
1198 various type constructors, e.g. "list_all2 (op =) = (op =)". The
1199 transfer method uses these lemmas to infer transfer rules for
1200 non-polymorphic constants on the fly.
1202 - transfer_prover method: Assists with proving a transfer rule for a
1203 new constant, provided the constant is defined in terms of other
1204 constants that already have transfer rules. It should be applied
1205 after unfolding the constant definitions.
1207 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer
1208 from type nat to type int.
1210 * Lifting: New package intended to generalize the quotient_definition
1211 facility of the Quotient package; designed to work with Transfer.
1213 - lift_definition command: Defines operations on an abstract type in
1214 terms of a corresponding operation on a representation
1215 type. Example syntax:
1217 lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"
1220 Users must discharge a respectfulness proof obligation when each
1221 constant is defined. (For a type copy, i.e. a typedef with UNIV,
1222 the proof is discharged automatically.) The obligation is
1223 presented in a user-friendly, readable form; a respectfulness
1224 theorem in the standard format and a transfer rule are generated
1227 - Integration with code_abstype: For typedefs (e.g. subtypes
1228 corresponding to a datatype invariant, such as dlist),
1229 lift_definition generates a code certificate theorem and sets up
1230 code generation for each constant.
1232 - setup_lifting command: Sets up the Lifting package to work with a
1233 user-defined type. The user must provide either a quotient theorem
1234 or a type_definition theorem. The package configures transfer
1235 rules for equality and quantifiers on the type, and sets up the
1236 lift_definition command to work with the type.
1238 - Usage examples: See Quotient_Examples/Lift_DList.thy,
1239 Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,
1240 Word/Word.thy and Library/Float.thy.
1244 - The 'quotient_type' command now supports a 'morphisms' option with
1245 rep and abs functions, similar to typedef.
1247 - 'quotient_type' sets up new types to work with the Lifting and
1248 Transfer packages, as with 'setup_lifting'.
1250 - The 'quotient_definition' command now requires the user to prove a
1251 respectfulness property at the point where the constant is
1252 defined, similar to lift_definition; INCOMPATIBILITY.
1254 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems
1255 accordingly, INCOMPATIBILITY.
1257 * New diagnostic command 'find_unused_assms' to find potentially
1258 superfluous assumptions in theorems using Quickcheck.
1262 - Quickcheck returns variable assignments as counterexamples, which
1263 allows to reveal the underspecification of functions under test.
1264 For example, refuting "hd xs = x", it presents the variable
1265 assignment xs = [] and x = a1 as a counterexample, assuming that
1266 any property is false whenever "hd []" occurs in it.
1268 These counterexample are marked as potentially spurious, as
1269 Quickcheck also returns "xs = []" as a counterexample to the
1270 obvious theorem "hd xs = hd xs".
1272 After finding a potentially spurious counterexample, Quickcheck
1273 continues searching for genuine ones.
1275 By default, Quickcheck shows potentially spurious and genuine
1276 counterexamples. The option "genuine_only" sets quickcheck to only
1277 show genuine counterexamples.
1279 - The command 'quickcheck_generator' creates random and exhaustive
1280 value generators for a given type and operations.
1282 It generates values by using the operations as if they were
1283 constructors of that type.
1285 - Support for multisets.
1287 - Added "use_subtype" options.
1289 - Added "quickcheck_locale" configuration to specify how to process
1290 conjectures in a locale context.
1292 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option
1293 and affecting 'rat' and 'real'.
1296 - Integrated more tightly with SPASS, as described in the ITP 2012
1297 paper "More SPASS with Isabelle".
1298 - Made it try "smt" as a fallback if "metis" fails or times out.
1299 - Added support for the following provers: Alt-Ergo (via Why3 and
1300 TFF1), iProver, iProver-Eq.
1301 - Sped up the minimizer.
1302 - Added "lam_trans", "uncurry_aliases", and "minimize" options.
1303 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
1304 - Renamed "sound" option to "strict".
1306 * Metis: Added possibility to specify lambda translations scheme as a
1307 parenthesized argument (e.g., "by (metis (lifting) ...)").
1309 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".
1311 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.
1313 * New "case_product" attribute to generate a case rule doing multiple
1314 case distinctions at the same time. E.g.
1316 list.exhaust [case_product nat.exhaust]
1318 produces a rule which can be used to perform case distinction on both
1321 * New "eventually_elim" method as a generalized variant of the
1322 eventually_elim* rules. Supports structured proofs.
1324 * Typedef with implicit set definition is considered legacy. Use
1325 "typedef (open)" form instead, which will eventually become the
1328 * Record: code generation can be switched off manually with
1330 declare [[record_coden = false]] -- "default true"
1332 * Datatype: type parameters allow explicit sort constraints.
1334 * Concrete syntax for case expressions includes constraints for source
1335 positions, and thus produces Prover IDE markup for its bindings.
1336 INCOMPATIBILITY for old-style syntax translations that augment the
1337 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
1340 * Clarified attribute "mono_set": pure declaration without modifying
1341 the result of the fact expression.
1343 * More default pred/set conversions on a couple of relation operations
1344 and predicates. Added powers of predicate relations. Consolidation
1345 of some relation theorems:
1347 converse_def ~> converse_unfold
1348 rel_comp_def ~> relcomp_unfold
1349 symp_def ~> (modified, use symp_def and sym_def instead)
1350 transp_def ~> transp_trans
1351 Domain_def ~> Domain_unfold
1352 Range_def ~> Domain_converse [symmetric]
1354 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.
1356 See theory "Relation" for examples for making use of pred/set
1357 conversions by means of attributes "to_set" and "to_pred".
1361 * Renamed facts about the power operation on relations, i.e., relpow
1362 to match the constant's name:
1364 rel_pow_1 ~> relpow_1
1365 rel_pow_0_I ~> relpow_0_I
1366 rel_pow_Suc_I ~> relpow_Suc_I
1367 rel_pow_Suc_I2 ~> relpow_Suc_I2
1368 rel_pow_0_E ~> relpow_0_E
1369 rel_pow_Suc_E ~> relpow_Suc_E
1370 rel_pow_E ~> relpow_E
1371 rel_pow_Suc_D2 ~> relpow_Suc_D2
1372 rel_pow_Suc_E2 ~> relpow_Suc_E2
1373 rel_pow_Suc_D2' ~> relpow_Suc_D2'
1374 rel_pow_E2 ~> relpow_E2
1375 rel_pow_add ~> relpow_add
1376 rel_pow_commute ~> relpow
1377 rel_pow_empty ~> relpow_empty:
1378 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
1379 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
1380 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
1381 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
1382 rel_pow_fun_conv ~> relpow_fun_conv
1383 rel_pow_finite_bounded1 ~> relpow_finite_bounded1
1384 rel_pow_finite_bounded ~> relpow_finite_bounded
1385 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
1386 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
1387 single_valued_rel_pow ~> single_valued_relpow
1391 * Theory Relation: Consolidated constant name for relation composition
1392 and corresponding theorem names:
1394 - Renamed constant rel_comp to relcomp.
1396 - Dropped abbreviation pred_comp. Use relcompp instead.
1400 rel_compI ~> relcompI
1401 rel_compEpair ~> relcompEpair
1402 rel_compE ~> relcompE
1403 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq
1404 rel_comp_empty1 ~> relcomp_empty1
1405 rel_comp_mono ~> relcomp_mono
1406 rel_comp_subset_Sigma ~> relcomp_subset_Sigma
1407 rel_comp_distrib ~> relcomp_distrib
1408 rel_comp_distrib2 ~> relcomp_distrib2
1409 rel_comp_UNION_distrib ~> relcomp_UNION_distrib
1410 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2
1411 single_valued_rel_comp ~> single_valued_relcomp
1412 rel_comp_def ~> relcomp_unfold
1413 converse_rel_comp ~> converse_relcomp
1414 pred_compI ~> relcomppI
1415 pred_compE ~> relcomppE
1416 pred_comp_bot1 ~> relcompp_bot1
1417 pred_comp_bot2 ~> relcompp_bot2
1418 transp_pred_comp_less_eq ~> transp_relcompp_less_eq
1419 pred_comp_mono ~> relcompp_mono
1420 pred_comp_distrib ~> relcompp_distrib
1421 pred_comp_distrib2 ~> relcompp_distrib2
1422 converse_pred_comp ~> converse_relcompp
1424 finite_rel_comp ~> finite_relcomp
1426 set_rel_comp ~> set_relcomp
1430 * Theory Divides: Discontinued redundant theorems about div and mod.
1431 INCOMPATIBILITY, use the corresponding generic theorems instead.
1433 DIVISION_BY_ZERO ~> div_by_0, mod_by_0
1434 zdiv_self ~> div_self
1435 zmod_self ~> mod_self
1438 zdiv_zmod_equality ~> div_mod_equality2
1439 zdiv_zmod_equality2 ~> div_mod_equality
1440 zmod_zdiv_trivial ~> mod_div_trivial
1441 zdiv_zminus_zminus ~> div_minus_minus
1442 zmod_zminus_zminus ~> mod_minus_minus
1443 zdiv_zminus2 ~> div_minus_right
1444 zmod_zminus2 ~> mod_minus_right
1445 zdiv_minus1_right ~> div_minus1_right
1446 zmod_minus1_right ~> mod_minus1_right
1447 zdvd_mult_div_cancel ~> dvd_mult_div_cancel
1448 zmod_zmult1_eq ~> mod_mult_right_eq
1449 zpower_zmod ~> power_mod
1450 zdvd_zmod ~> dvd_mod
1451 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd
1452 mod_mult_distrib ~> mult_mod_left
1453 mod_mult_distrib2 ~> mult_mod_right
1455 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use
1456 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.
1458 * Finite_Set.fold now qualified. INCOMPATIBILITY.
1460 * Consolidated theorem names concerning fold combinators:
1462 inf_INFI_fold_inf ~> inf_INF_fold_inf
1463 sup_SUPR_fold_sup ~> sup_SUP_fold_sup
1464 INFI_fold_inf ~> INF_fold_inf
1465 SUPR_fold_sup ~> SUP_fold_sup
1466 union_set ~> union_set_fold
1467 minus_set ~> minus_set_fold
1468 INFI_set_fold ~> INF_set_fold
1469 SUPR_set_fold ~> SUP_set_fold
1470 INF_code ~> INF_set_foldr
1471 SUP_code ~> SUP_set_foldr
1472 foldr.simps ~> foldr.simps (in point-free formulation)
1473 foldr_fold_rev ~> foldr_conv_fold
1474 foldl_fold ~> foldl_conv_fold
1475 foldr_foldr ~> foldr_conv_foldl
1476 foldl_foldr ~> foldl_conv_foldr
1477 fold_set_remdups ~> fold_set_fold_remdups
1478 fold_set ~> fold_set_fold
1479 fold1_set ~> fold1_set_fold
1483 * Dropped rarely useful theorems concerning fold combinators:
1484 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
1485 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
1486 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
1487 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
1488 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,
1489 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.
1490 INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0"
1491 and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be
1492 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by
1493 unfolding "foldr_conv_fold" and "foldl_conv_fold".
1495 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,
1496 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,
1497 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,
1498 INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding
1499 lemmas over fold rather than foldr, or make use of lemmas
1500 fold_conv_foldr and fold_rev.
1502 * Congruence rules Option.map_cong and Option.bind_cong for recursion
1503 through option types.
1505 * "Transitive_Closure.ntrancl": bounded transitive closure on
1508 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.
1510 * Theory Int: Discontinued many legacy theorems specific to type int.
1511 INCOMPATIBILITY, use the corresponding generic theorems instead.
1513 zminus_zminus ~> minus_minus
1514 zminus_0 ~> minus_zero
1515 zminus_zadd_distrib ~> minus_add_distrib
1516 zadd_commute ~> add_commute
1517 zadd_assoc ~> add_assoc
1518 zadd_left_commute ~> add_left_commute
1521 zadd_0 ~> add_0_left
1522 zadd_0_right ~> add_0_right
1523 zadd_zminus_inverse2 ~> left_minus
1524 zmult_zminus ~> mult_minus_left
1525 zmult_commute ~> mult_commute
1526 zmult_assoc ~> mult_assoc
1527 zadd_zmult_distrib ~> left_distrib
1528 zadd_zmult_distrib2 ~> right_distrib
1529 zdiff_zmult_distrib ~> left_diff_distrib
1530 zdiff_zmult_distrib2 ~> right_diff_distrib
1531 zmult_1 ~> mult_1_left
1532 zmult_1_right ~> mult_1_right
1533 zle_refl ~> order_refl
1534 zle_trans ~> order_trans
1535 zle_antisym ~> order_antisym
1536 zle_linear ~> linorder_linear
1537 zless_linear ~> linorder_less_linear
1538 zadd_left_mono ~> add_left_mono
1539 zadd_strict_right_mono ~> add_strict_right_mono
1540 zadd_zless_mono ~> add_less_le_mono
1541 int_0_less_1 ~> zero_less_one
1542 int_0_neq_1 ~> zero_neq_one
1544 zpower_zadd_distrib ~> power_add
1545 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
1546 zero_le_zpower_abs ~> zero_le_power_abs
1548 * Theory Deriv: Renamed
1550 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
1552 * Theory Library/Multiset: Improved code generation of multisets.
1554 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets
1555 are expressed via type classes again. The special syntax
1556 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant
1557 setsum_set, which is now subsumed by Big_Operators.setsum.
1560 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
1561 use theory HOL/Library/Nat_Bijection instead.
1563 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black
1564 trees is now inside a type class context. Names of affected
1565 operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for
1566 theories working directly with raw red-black trees, adapt the names as
1570 bulkload -> rbt_bulkload
1571 del_from_left -> rbt_del_from_left
1572 del_from_right -> rbt_del_from_right
1574 delete -> rbt_delete
1576 insert -> rbt_insert
1577 insertw -> rbt_insert_with
1578 insert_with_key -> rbt_insert_with_key
1579 map_entry -> rbt_map_entry
1580 lookup -> rbt_lookup
1581 sorted -> rbt_sorted
1582 tree_greater -> rbt_greater
1583 tree_less -> rbt_less
1584 tree_less_symbol -> rbt_less_symbol
1586 union_with -> rbt_union_with
1587 union_with_key -> rbt_union_with_key
1590 balance_left_sorted -> balance_left_rbt_sorted
1591 balance_left_tree_greater -> balance_left_rbt_greater
1592 balance_left_tree_less -> balance_left_rbt_less
1593 balance_right_sorted -> balance_right_rbt_sorted
1594 balance_right_tree_greater -> balance_right_rbt_greater
1595 balance_right_tree_less -> balance_right_rbt_less
1596 balance_sorted -> balance_rbt_sorted
1597 balance_tree_greater -> balance_rbt_greater
1598 balance_tree_less -> balance_rbt_less
1599 bulkload_is_rbt -> rbt_bulkload_is_rbt
1600 combine_sorted -> combine_rbt_sorted
1601 combine_tree_greater -> combine_rbt_greater
1602 combine_tree_less -> combine_rbt_less
1603 delete_in_tree -> rbt_delete_in_tree
1604 delete_is_rbt -> rbt_delete_is_rbt
1605 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater
1606 del_from_left_tree_less -> rbt_del_from_left_rbt_less
1607 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater
1608 del_from_right_tree_less -> rbt_del_from_right_rbt_less
1609 del_in_tree -> rbt_del_in_tree
1610 del_inv1_inv2 -> rbt_del_inv1_inv2
1611 del_sorted -> rbt_del_rbt_sorted
1612 del_tree_greater -> rbt_del_rbt_greater
1613 del_tree_less -> rbt_del_rbt_less
1614 dom_lookup_Branch -> dom_rbt_lookup_Branch
1615 entries_lookup -> entries_rbt_lookup
1616 finite_dom_lookup -> finite_dom_rbt_lookup
1617 insert_sorted -> rbt_insert_rbt_sorted
1618 insertw_is_rbt -> rbt_insertw_is_rbt
1619 insertwk_is_rbt -> rbt_insertwk_is_rbt
1620 insertwk_sorted -> rbt_insertwk_rbt_sorted
1621 insertw_sorted -> rbt_insertw_rbt_sorted
1622 ins_sorted -> ins_rbt_sorted
1623 ins_tree_greater -> ins_rbt_greater
1624 ins_tree_less -> ins_rbt_less
1625 is_rbt_sorted -> is_rbt_rbt_sorted
1626 lookup_balance -> rbt_lookup_balance
1627 lookup_bulkload -> rbt_lookup_rbt_bulkload
1628 lookup_delete -> rbt_lookup_rbt_delete
1629 lookup_Empty -> rbt_lookup_Empty
1630 lookup_from_in_tree -> rbt_lookup_from_in_tree
1631 lookup_in_tree -> rbt_lookup_in_tree
1632 lookup_ins -> rbt_lookup_ins
1633 lookup_insert -> rbt_lookup_rbt_insert
1634 lookup_insertw -> rbt_lookup_rbt_insertw
1635 lookup_insertwk -> rbt_lookup_rbt_insertwk
1636 lookup_keys -> rbt_lookup_keys
1637 lookup_map -> rbt_lookup_map
1638 lookup_map_entry -> rbt_lookup_rbt_map_entry
1639 lookup_tree_greater -> rbt_lookup_rbt_greater
1640 lookup_tree_less -> rbt_lookup_rbt_less
1641 lookup_union -> rbt_lookup_rbt_union
1642 map_entry_color_of -> rbt_map_entry_color_of
1643 map_entry_inv1 -> rbt_map_entry_inv1
1644 map_entry_inv2 -> rbt_map_entry_inv2
1645 map_entry_is_rbt -> rbt_map_entry_is_rbt
1646 map_entry_sorted -> rbt_map_entry_rbt_sorted
1647 map_entry_tree_greater -> rbt_map_entry_rbt_greater
1648 map_entry_tree_less -> rbt_map_entry_rbt_less
1649 map_tree_greater -> map_rbt_greater
1650 map_tree_less -> map_rbt_less
1651 map_sorted -> map_rbt_sorted
1652 paint_sorted -> paint_rbt_sorted
1653 paint_lookup -> paint_rbt_lookup
1654 paint_tree_greater -> paint_rbt_greater
1655 paint_tree_less -> paint_rbt_less
1656 sorted_entries -> rbt_sorted_entries
1657 tree_greater_eq_trans -> rbt_greater_eq_trans
1658 tree_greater_nit -> rbt_greater_nit
1659 tree_greater_prop -> rbt_greater_prop
1660 tree_greater_simps -> rbt_greater_simps
1661 tree_greater_trans -> rbt_greater_trans
1662 tree_less_eq_trans -> rbt_less_eq_trans
1663 tree_less_nit -> rbt_less_nit
1664 tree_less_prop -> rbt_less_prop
1665 tree_less_simps -> rbt_less_simps
1666 tree_less_trans -> rbt_less_trans
1667 tree_ord_props -> rbt_ord_props
1668 union_Branch -> rbt_union_Branch
1669 union_is_rbt -> rbt_union_is_rbt
1670 unionw_is_rbt -> rbt_unionw_is_rbt
1671 unionwk_is_rbt -> rbt_unionwk_is_rbt
1672 unionwk_sorted -> rbt_unionwk_rbt_sorted
1674 * Theory HOL/Library/Float: Floating point numbers are now defined as
1675 a subset of the real numbers. All operations are defined using the
1676 lifing-framework and proofs use the transfer method. INCOMPATIBILITY.
1683 round_down -> float_round_down
1684 round_up -> float_round_up
1688 ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod
1691 abs_float_def -> Float.compute_float_abs
1692 bitlen_ge0 -> bitlen_nonneg
1693 bitlen.simps -> Float.compute_bitlen
1694 float_components -> Float_mantissa_exponent
1695 float_divl.simps -> Float.compute_float_divl
1696 float_divr.simps -> Float.compute_float_divr
1697 float_eq_odd -> mult_powr_eq_mult_powr_iff
1698 float_power -> real_of_float_power
1699 lapprox_posrat_def -> Float.compute_lapprox_posrat
1700 lapprox_rat.simps -> Float.compute_lapprox_rat
1701 le_float_def' -> Float.compute_float_le
1702 le_float_def -> less_eq_float.rep_eq
1703 less_float_def' -> Float.compute_float_less
1704 less_float_def -> less_float.rep_eq
1705 normfloat_def -> Float.compute_normfloat
1706 normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0
1707 normfloat -> normfloat_def
1708 normfloat_unique -> use normfloat_def
1709 number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral
1710 one_float_def -> Float.compute_float_one
1711 plus_float_def -> Float.compute_float_plus
1712 rapprox_posrat_def -> Float.compute_rapprox_posrat
1713 rapprox_rat.simps -> Float.compute_rapprox_rat
1714 real_of_float_0 -> zero_float.rep_eq
1715 real_of_float_1 -> one_float.rep_eq
1716 real_of_float_abs -> abs_float.rep_eq
1717 real_of_float_add -> plus_float.rep_eq
1718 real_of_float_minus -> uminus_float.rep_eq
1719 real_of_float_mult -> times_float.rep_eq
1720 real_of_float_simp -> Float.rep_eq
1721 real_of_float_sub -> minus_float.rep_eq
1722 round_down.simps -> Float.compute_float_round_down
1723 round_up.simps -> Float.compute_float_round_up
1724 times_float_def -> Float.compute_float_times
1725 uminus_float_def -> Float.compute_float_uminus
1726 zero_float_def -> Float.compute_float_zero
1728 Lemmas not necessary anymore, use the transfer method:
1729 bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,
1730 float_divr, float_le_simp, float_less1_mantissa_bound,
1731 float_less_simp, float_less_zero, float_le_zero,
1732 float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,
1733 floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,
1734 lapprox_rat_bottom, normalized_float, rapprox_posrat,
1735 rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,
1736 real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,
1737 round_up, zero_le_float, zero_less_float
1739 * New theory HOL/Library/DAList provides an abstract type for
1740 association lists with distinct keys.
1742 * Session HOL/IMP: Added new theory of abstract interpretation of
1745 * Session HOL-Import: Re-implementation from scratch is faster,
1746 simpler, and more scalable. Requires a proof bundle, which is
1747 available as an external component. Discontinued old (and mostly
1748 dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY.
1750 * Session HOL-Word: Discontinued many redundant theorems specific to
1751 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
1754 word_sub_alt ~> word_sub_wi
1755 word_add_alt ~> word_add_def
1756 word_mult_alt ~> word_mult_def
1757 word_minus_alt ~> word_minus_def
1758 word_0_alt ~> word_0_wi
1759 word_1_alt ~> word_1_wi
1760 word_add_0 ~> add_0_left
1761 word_add_0_right ~> add_0_right
1762 word_mult_1 ~> mult_1_left
1763 word_mult_1_right ~> mult_1_right
1764 word_add_commute ~> add_commute
1765 word_add_assoc ~> add_assoc
1766 word_add_left_commute ~> add_left_commute
1767 word_mult_commute ~> mult_commute
1768 word_mult_assoc ~> mult_assoc
1769 word_mult_left_commute ~> mult_left_commute
1770 word_left_distrib ~> left_distrib
1771 word_right_distrib ~> right_distrib
1772 word_left_minus ~> left_minus
1773 word_diff_0_right ~> diff_0_right
1774 word_diff_self ~> diff_self
1775 word_sub_def ~> diff_minus
1776 word_diff_minus ~> diff_minus
1777 word_add_ac ~> add_ac
1778 word_mult_ac ~> mult_ac
1779 word_plus_ac0 ~> add_0_left add_0_right add_ac
1780 word_times_ac1 ~> mult_1_left mult_1_right mult_ac
1781 word_order_trans ~> order_trans
1782 word_order_refl ~> order_refl
1783 word_order_antisym ~> order_antisym
1784 word_order_linear ~> linorder_linear
1785 lenw1_zero_neq_one ~> zero_neq_one
1786 word_number_of_eq ~> number_of_eq
1787 word_of_int_add_hom ~> wi_hom_add
1788 word_of_int_sub_hom ~> wi_hom_sub
1789 word_of_int_mult_hom ~> wi_hom_mult
1790 word_of_int_minus_hom ~> wi_hom_neg
1791 word_of_int_succ_hom ~> wi_hom_succ
1792 word_of_int_pred_hom ~> wi_hom_pred
1793 word_of_int_0_hom ~> word_0_wi
1794 word_of_int_1_hom ~> word_1_wi
1796 * Session HOL-Word: New proof method "word_bitwise" for splitting
1797 machine word equalities and inequalities into logical circuits,
1798 defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction,
1799 multiplication, shifting by constants, bitwise operators and numeric
1800 constants. Requires fixed-length word types, not 'a word. Solves
1801 many standard word identities outright and converts more into first
1802 order problems amenable to blast or similar. See also examples in
1803 HOL/Word/Examples/WordExamples.thy.
1805 * Session HOL-Probability: Introduced the type "'a measure" to
1806 represent measures, this replaces the records 'a algebra and 'a
1807 measure_space. The locales based on subset_class now have two
1808 locale-parameters the space \<Omega> and the set of measurable sets M.
1809 The product of probability spaces uses now the same constant as the
1810 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)
1811 measure". Most constants are defined now outside of locales and gain
1812 an additional parameter, like null_sets, almost_eventually or \<mu>'.
1813 Measure space constructions for distributions and densities now got
1814 their own constants distr and density. Instead of using locales to
1815 describe measure spaces with a finite space, the measure count_space
1816 and point_measure is introduced. INCOMPATIBILITY.
1820 finite_measure.\<mu>' -> measure
1821 product_algebra_generator -> prod_algebra
1822 product_prob_space.emb -> prod_emb
1823 product_prob_space.infprod_algebra -> PiM
1826 completeable_measure_space
1827 finite_measure_space
1829 finite_product_finite_prob_space
1830 finite_product_sigma_algebra
1831 finite_sigma_algebra
1833 pair_finite_prob_space
1834 pair_finite_sigma_algebra
1837 product_sigma_algebra
1841 distribution -> use distr measure, or distributed predicate
1843 joint_distribution -> use distr measure, or distributed predicate
1844 pair_measure_generator
1845 product_prob_space.infprod_algebra -> use PiM
1848 Replacement theorems:
1849 finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite
1850 finite_measure.empty_measure -> measure_empty
1851 finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq
1852 finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq
1853 finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably
1854 finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure
1855 finite_measure.finite_measure -> finite_measure.emeasure_finite
1856 finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton
1857 finite_measure.positive_measure' -> measure_nonneg
1858 finite_measure.real_measure -> finite_measure.emeasure_real
1859 finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb
1860 finite_product_sigma_algebra.in_P -> sets_PiM_I_finite
1861 finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty
1862 information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed
1863 information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple
1864 information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple
1865 information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple
1866 information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple
1867 information_space.entropy_commute -> information_space.entropy_commute_simple
1868 information_space.entropy_eq -> information_space.entropy_simple_distributed
1869 information_space.entropy_generic_eq -> information_space.entropy_simple_distributed
1870 information_space.entropy_positive -> information_space.entropy_nonneg_simple
1871 information_space.entropy_uniform_max -> information_space.entropy_uniform
1872 information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq
1873 information_space.KL_eq_0 -> information_space.KL_same_eq_0
1874 information_space.KL_ge_0 -> information_space.KL_nonneg
1875 information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed
1876 information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple
1877 Int_stable_cuboids -> Int_stable_atLeastAtMost
1878 Int_stable_product_algebra_generator -> positive_integral
1879 measure_preserving -> equality "distr M N f = N" "f : measurable M N"
1880 measure_space.additive -> emeasure_additive
1881 measure_space.AE_iff_null_set -> AE_iff_null
1882 measure_space.almost_everywhere_def -> eventually_ae_filter
1883 measure_space.almost_everywhere_vimage -> AE_distrD
1884 measure_space.continuity_from_above -> INF_emeasure_decseq
1885 measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq
1886 measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq
1887 measure_space.continuity_from_below -> SUP_emeasure_incseq
1888 measure_space_density -> emeasure_density
1889 measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density
1890 measure_space.integrable_vimage -> integrable_distr
1891 measure_space.integral_translated_density -> integral_density
1892 measure_space.integral_vimage -> integral_distr
1893 measure_space.measure_additive -> plus_emeasure
1894 measure_space.measure_compl -> emeasure_compl
1895 measure_space.measure_countable_increasing -> emeasure_countable_increasing
1896 measure_space.measure_countably_subadditive -> emeasure_subadditive_countably
1897 measure_space.measure_decseq -> decseq_emeasure
1898 measure_space.measure_Diff -> emeasure_Diff
1899 measure_space.measure_Diff_null_set -> emeasure_Diff_null_set
1900 measure_space.measure_eq_0 -> emeasure_eq_0
1901 measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite
1902 measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton
1903 measure_space.measure_incseq -> incseq_emeasure
1904 measure_space.measure_insert -> emeasure_insert
1905 measure_space.measure_mono -> emeasure_mono
1906 measure_space.measure_not_negative -> emeasure_not_MInf
1907 measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq
1908 measure_space.measure_setsum -> setsum_emeasure
1909 measure_space.measure_setsum_split -> setsum_emeasure_cover
1910 measure_space.measure_space_vimage -> emeasure_distr
1911 measure_space.measure_subadditive_finite -> emeasure_subadditive_finite
1912 measure_space.measure_subadditive -> subadditive
1913 measure_space.measure_top -> emeasure_space
1914 measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0
1915 measure_space.measure_Un_null_set -> emeasure_Un_null_set
1916 measure_space.positive_integral_translated_density -> positive_integral_density
1917 measure_space.positive_integral_vimage -> positive_integral_distr
1918 measure_space.real_continuity_from_above -> Lim_measure_decseq
1919 measure_space.real_continuity_from_below -> Lim_measure_incseq
1920 measure_space.real_measure_countably_subadditive -> measure_subadditive_countably
1921 measure_space.real_measure_Diff -> measure_Diff
1922 measure_space.real_measure_finite_Union -> measure_finite_Union
1923 measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton
1924 measure_space.real_measure_subadditive -> measure_subadditive
1925 measure_space.real_measure_Union -> measure_Union
1926 measure_space.real_measure_UNION -> measure_UNION
1927 measure_space.simple_function_vimage -> simple_function_comp
1928 measure_space.simple_integral_vimage -> simple_integral_distr
1929 measure_space.simple_integral_vimage -> simple_integral_distr
1930 measure_unique_Int_stable -> measure_eqI_generator_eq
1931 measure_unique_Int_stable_vimage -> measure_eqI_generator_eq
1932 pair_sigma_algebra.measurable_cut_fst -> sets_Pair1
1933 pair_sigma_algebra.measurable_cut_snd -> sets_Pair2
1934 pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1
1935 pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2
1936 pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff
1937 pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap
1938 pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'
1939 pair_sigma_algebra.sets_swap -> sets_pair_swap
1940 pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1
1941 pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2
1942 pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap
1943 pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2
1944 pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt
1945 pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times
1946 prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM
1947 prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq
1948 prob_space.measure_space_1 -> prob_space.emeasure_space_1
1949 prob_space.prob_space_vimage -> prob_space_distr
1950 prob_space.random_variable_restrict -> measurable_restrict
1951 prob_space_unique_Int_stable -> measure_eqI_prob_space
1952 product_algebraE -> prod_algebraE_all
1953 product_algebra_generator_der -> prod_algebra_eq_finite
1954 product_algebra_generator_into_space -> prod_algebra_sets_into_space
1955 product_algebraI -> sets_PiM_I_finite
1956 product_measure_exists -> product_sigma_finite.sigma_finite
1957 product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator
1958 product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb
1959 product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty
1960 product_prob_space.measurable_component -> measurable_component_singleton
1961 product_prob_space.measurable_emb -> measurable_prod_emb
1962 product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single
1963 product_prob_space.measurable_singleton_infprod -> measurable_component_singleton
1964 product_prob_space.measure_emb -> emeasure_prod_emb
1965 product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict
1966 product_sigma_algebra.product_algebra_into_space -> space_closed
1967 product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge
1968 product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton
1969 product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge
1970 sequence_space.measure_infprod -> sequence_space.measure_PiM_countable
1971 sets_product_algebra -> sets_PiM
1972 sigma_algebra.measurable_sigma -> measurable_measure_of
1973 sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint
1974 sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr
1975 sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq
1976 space_product_algebra -> space_PiM
1978 * Session HOL-TPTP: support to parse and import TPTP problems (all
1979 languages) into Isabelle/HOL.
1984 * New "case_product" attribute (see HOL).
1989 * Greater support for structured proofs involving induction or case
1992 * Much greater use of mathematical symbols.
1994 * Removal of many ML theorem bindings. INCOMPATIBILITY.
1999 * Antiquotation @{keyword "name"} produces a parser for outer syntax
2000 from a minor keyword introduced via theory header declaration.
2002 * Antiquotation @{command_spec "name"} produces the
2003 Outer_Syntax.command_spec from a major keyword introduced via theory
2004 header declaration; it can be passed to Outer_Syntax.command etc.
2006 * Local_Theory.define no longer hard-wires default theorem name
2007 "foo_def", but retains the binding as given. If that is Binding.empty
2008 / Attrib.empty_binding, the result is not registered as user-level
2009 fact. The Local_Theory.define_internal variant allows to specify a
2010 non-empty name (used for the foundation in the background theory),
2011 while omitting the fact binding in the user-context. Potential
2012 INCOMPATIBILITY for derived definitional packages: need to specify
2013 naming policy for primitive definitions more explicitly.
2015 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
2016 conformance with similar operations in structure Term and Logic.
2018 * Antiquotation @{attributes [...]} embeds attribute source
2019 representation into the ML text, which is particularly useful with
2020 declarations like Local_Theory.note.
2022 * Structure Proof_Context follows standard naming scheme. Old
2023 ProofContext has been discontinued. INCOMPATIBILITY.
2025 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
2026 change of semantics: update is applied to auxiliary local theory
2029 * Modernized some old-style infix operations:
2031 addeqcongs ~> Simplifier.add_eqcong
2032 deleqcongs ~> Simplifier.del_eqcong
2033 addcongs ~> Simplifier.add_cong
2034 delcongs ~> Simplifier.del_cong
2035 setmksimps ~> Simplifier.set_mksimps
2036 setmkcong ~> Simplifier.set_mkcong
2037 setmksym ~> Simplifier.set_mksym
2038 setmkeqTrue ~> Simplifier.set_mkeqTrue
2039 settermless ~> Simplifier.set_termless
2040 setsubgoaler ~> Simplifier.set_subgoaler
2041 addsplits ~> Splitter.add_split
2042 delsplits ~> Splitter.del_split
2047 * USER_HOME settings variable points to cross-platform user home
2048 directory, which coincides with HOME on POSIX systems only. Likewise,
2049 the Isabelle path specification "~" now expands to $USER_HOME, instead
2050 of former $HOME. A different default for USER_HOME may be set
2051 explicitly in shell environment, before Isabelle settings are
2052 evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where
2053 the generic user home was intended.
2055 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
2056 notation, which is useful for the jEdit file browser, for example.
2058 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
2063 New in Isabelle2011-1 (October 2011)
2064 ------------------------------------
2068 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
2069 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
2071 - Management of multiple theory files directly from the editor
2072 buffer store -- bypassing the file-system (no requirement to save
2073 files for checking).
2075 - Markup of formal entities within the text buffer, with semantic
2076 highlighting, tooltips and hyperlinks to jump to defining source
2079 - Improved text rendering, with sub/superscripts in the source
2080 buffer (including support for copy/paste wrt. output panel, HTML
2081 theory output and other non-Isabelle text boxes).
2083 - Refined scheduling of proof checking and printing of results,
2084 based on interactive editor view. (Note: jEdit folding and
2085 narrowing allows to restrict buffer perspectives explicitly.)
2087 - Reduced CPU performance requirements, usable on machines with few
2090 - Reduced memory requirements due to pruning of unused document
2091 versions (garbage collection).
2093 See also ~~/src/Tools/jEdit/README.html for further information,
2094 including some remaining limitations.
2096 * Theory loader: source files are exclusively located via the master
2097 directory of each theory node (where the .thy file itself resides).
2098 The global load path (such as src/HOL/Library) has been discontinued.
2099 Note that the path element ~~ may be used to reference theories in the
2100 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
2103 * Theory loader: source files are identified by content via SHA1
2104 digests. Discontinued former path/modtime identification and optional
2105 ISABELLE_FILE_IDENT plugin scripts.
2107 * Parallelization of nested Isar proofs is subject to
2108 Goal.parallel_proofs_threshold (default 100). See also isabelle
2111 * Name space: former unsynchronized references are now proper
2112 configuration options, with more conventional names:
2114 long_names ~> names_long
2115 short_names ~> names_short
2116 unique_names ~> names_unique
2118 Minor INCOMPATIBILITY, need to declare options in context like this:
2120 declare [[names_unique = false]]
2122 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note
2123 that the result needs to be unique, which means fact specifications
2124 may have to be refined after enriching a proof context.
2126 * Attribute "case_names" has been refined: the assumptions in each case
2127 can be named now by following the case name with [name1 name2 ...].
2129 * Isabelle/Isar reference manual has been updated and extended:
2130 - "Synopsis" provides a catalog of main Isar language concepts.
2131 - Formal references in syntax diagrams, via @{rail} antiquotation.
2132 - Updated material from classic "ref" manual, notably about
2133 "Classical Reasoner".
2138 * Class bot and top require underlying partial order rather than
2139 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.
2141 * Class complete_lattice: generalized a couple of lemmas from sets;
2142 generalized theorems INF_cong and SUP_cong. New type classes for
2143 complete boolean algebras and complete linear orders. Lemmas
2144 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
2145 class complete_linorder.
2147 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
2148 Sup_fun_def, Inf_apply, Sup_apply.
2150 Removed redundant lemmas (the right hand side gives hints how to
2151 replace them for (metis ...), or (simp only: ...) proofs):
2153 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
2154 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
2155 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
2156 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
2157 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
2158 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
2159 Inter_def ~> INF_def, image_def
2160 Union_def ~> SUP_def, image_def
2161 INT_eq ~> INF_def, and image_def
2162 UN_eq ~> SUP_def, and image_def
2163 INF_subset ~> INF_superset_mono [OF _ order_refl]
2165 More consistent and comprehensive names:
2167 INTER_eq_Inter_image ~> INF_def
2168 UNION_eq_Union_image ~> SUP_def
2171 INF_leI ~> INF_lower
2172 INF_leI2 ~> INF_lower2
2173 le_INFI ~> INF_greatest
2174 le_SUPI ~> SUP_upper
2175 le_SUPI2 ~> SUP_upper2
2176 SUP_leI ~> SUP_least
2177 INFI_bool_eq ~> INF_bool_eq
2178 SUPR_bool_eq ~> SUP_bool_eq
2179 INFI_apply ~> INF_apply
2180 SUPR_apply ~> SUP_apply
2181 INTER_def ~> INTER_eq
2182 UNION_def ~> UNION_eq
2186 * Renamed theory Complete_Lattice to Complete_Lattices.
2189 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
2190 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
2191 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
2192 Sup_insert are now declared as [simp]. INCOMPATIBILITY.
2194 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
2195 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
2196 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor
2199 * Added syntactic classes "inf" and "sup" for the respective
2200 constants. INCOMPATIBILITY: Changes in the argument order of the
2201 (mostly internal) locale predicates for some derived classes.
2203 * Theorem collections ball_simps and bex_simps do not contain theorems
2204 referring to UNION any longer; these have been moved to collection
2205 UN_ball_bex_simps. INCOMPATIBILITY.
2207 * Theory Archimedean_Field: floor now is defined as parameter of a
2208 separate type class floor_ceiling.
2210 * Theory Finite_Set: more coherent development of fold_set locales:
2212 locale fun_left_comm ~> locale comp_fun_commute
2213 locale fun_left_comm_idem ~> locale comp_fun_idem
2215 Both use point-free characterization; interpretation proofs may need
2216 adjustment. INCOMPATIBILITY.
2218 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
2219 accordance with standard mathematical terminology. INCOMPATIBILITY.
2221 * Theory Complex_Main: The locale interpretations for the
2222 bounded_linear and bounded_bilinear locales have been removed, in
2223 order to reduce the number of duplicate lemmas. Users must use the
2224 original names for distributivity theorems, potential INCOMPATIBILITY.
2226 divide.add ~> add_divide_distrib
2227 divide.diff ~> diff_divide_distrib
2228 divide.setsum ~> setsum_divide_distrib
2229 mult.add_right ~> right_distrib
2230 mult.diff_right ~> right_diff_distrib
2231 mult_right.setsum ~> setsum_right_distrib
2232 mult_left.diff ~> left_diff_distrib
2234 * Theory Complex_Main: Several redundant theorems have been removed or
2235 replaced by more general versions. INCOMPATIBILITY.
2237 real_diff_def ~> minus_real_def
2238 real_divide_def ~> divide_real_def
2239 real_less_def ~> less_le
2240 real_abs_def ~> abs_real_def
2241 real_sgn_def ~> sgn_real_def
2242 real_mult_commute ~> mult_commute
2243 real_mult_assoc ~> mult_assoc
2244 real_mult_1 ~> mult_1_left
2245 real_add_mult_distrib ~> left_distrib
2246 real_zero_not_eq_one ~> zero_neq_one
2247 real_mult_inverse_left ~> left_inverse
2248 INVERSE_ZERO ~> inverse_zero
2249 real_le_refl ~> order_refl
2250 real_le_antisym ~> order_antisym
2251 real_le_trans ~> order_trans
2252 real_le_linear ~> linear
2253 real_le_eq_diff ~> le_iff_diff_le_0
2254 real_add_left_mono ~> add_left_mono
2255 real_mult_order ~> mult_pos_pos
2256 real_mult_less_mono2 ~> mult_strict_left_mono
2257 real_of_int_real_of_nat ~> real_of_int_of_nat_eq
2258 real_0_le_divide_iff ~> zero_le_divide_iff
2259 realpow_two_disj ~> power2_eq_iff
2260 real_squared_diff_one_factored ~> square_diff_one_factored
2261 realpow_two_diff ~> square_diff_square_factored
2262 reals_complete2 ~> complete_real
2263 real_sum_squared_expand ~> power2_sum
2264 exp_ln_eq ~> ln_unique
2266 expi_zero ~> exp_zero
2267 lemma_DERIV_subst ~> DERIV_cong
2268 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
2269 LIMSEQ_const ~> tendsto_const
2270 LIMSEQ_norm ~> tendsto_norm
2271 LIMSEQ_add ~> tendsto_add
2272 LIMSEQ_minus ~> tendsto_minus
2273 LIMSEQ_minus_cancel ~> tendsto_minus_cancel
2274 LIMSEQ_diff ~> tendsto_diff
2275 bounded_linear.LIMSEQ ~> bounded_linear.tendsto
2276 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
2277 LIMSEQ_mult ~> tendsto_mult
2278 LIMSEQ_inverse ~> tendsto_inverse
2279 LIMSEQ_divide ~> tendsto_divide
2280 LIMSEQ_pow ~> tendsto_power
2281 LIMSEQ_setsum ~> tendsto_setsum
2282 LIMSEQ_setprod ~> tendsto_setprod
2283 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
2284 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
2285 LIMSEQ_imp_rabs ~> tendsto_rabs
2286 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
2287 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
2288 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
2289 LIMSEQ_Complex ~> tendsto_Complex
2290 LIM_ident ~> tendsto_ident_at
2291 LIM_const ~> tendsto_const
2292 LIM_add ~> tendsto_add
2293 LIM_add_zero ~> tendsto_add_zero
2294 LIM_minus ~> tendsto_minus
2295 LIM_diff ~> tendsto_diff
2296 LIM_norm ~> tendsto_norm
2297 LIM_norm_zero ~> tendsto_norm_zero
2298 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
2299 LIM_norm_zero_iff ~> tendsto_norm_zero_iff
2300 LIM_rabs ~> tendsto_rabs
2301 LIM_rabs_zero ~> tendsto_rabs_zero
2302 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
2303 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
2304 LIM_compose ~> tendsto_compose
2305 LIM_mult ~> tendsto_mult
2306 LIM_scaleR ~> tendsto_scaleR
2307 LIM_of_real ~> tendsto_of_real
2308 LIM_power ~> tendsto_power
2309 LIM_inverse ~> tendsto_inverse
2310 LIM_sgn ~> tendsto_sgn
2311 isCont_LIM_compose ~> isCont_tendsto_compose
2312 bounded_linear.LIM ~> bounded_linear.tendsto
2313 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
2314 bounded_bilinear.LIM ~> bounded_bilinear.tendsto
2315 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
2316 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
2317 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
2318 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
2320 * Theory Complex_Main: The definition of infinite series was
2321 generalized. Now it is defined on the type class {topological_space,
2322 comm_monoid_add}. Hence it is useable also for extended real numbers.
2324 * Theory Complex_Main: The complex exponential function "expi" is now
2325 a type-constrained abbreviation for "exp :: complex => complex"; thus
2326 several polymorphic lemmas about "exp" are now applicable to "expi".
2330 - Theory Library/Code_Char_ord provides native ordering of
2331 characters in the target language.
2333 - Commands code_module and code_library are legacy, use export_code
2336 - Method "evaluation" is legacy, use method "eval" instead.
2338 - Legacy evaluator "SML" is deactivated by default. May be
2339 reactivated by the following theory command:
2341 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
2343 * Declare ext [intro] by default. Rare INCOMPATIBILITY.
2345 * New proof method "induction" that gives induction hypotheses the
2346 name "IH", thus distinguishing them from further hypotheses that come
2347 from rule induction. The latter are still called "hyps". Method
2348 "induction" is a thin wrapper around "induct" and follows the same
2351 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
2352 still available as a legacy feature for some time.
2355 - Added "need" and "total_consts" options.
2356 - Reintroduced "show_skolems" option by popular demand.
2357 - Renamed attribute: nitpick_def ~> nitpick_unfold.
2361 - Use quasi-sound (and efficient) translations by default.
2362 - Added support for the following provers: E-ToFoF, LEO-II,
2363 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
2364 - Automatically preplay and minimize proofs before showing them if
2365 this can be done within reasonable time.
2366 - sledgehammer available_provers ~> sledgehammer supported_provers.
2368 - Added "preplay_timeout", "slicing", "type_enc", "sound",
2369 "max_mono_iters", and "max_new_mono_instances" options.
2370 - Removed "explicit_apply" and "full_types" options as well as "Full
2371 Types" Proof General menu item. INCOMPATIBILITY.
2374 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
2375 - Obsoleted "metisFT" -- use "metis (full_types)" instead.
2379 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
2380 "elim:" options. INCOMPATIBILITY.
2381 - Introduced 'try' that not only runs 'try_methods' but also
2382 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
2385 - Added "eval" option to evaluate terms for the found counterexample
2386 (currently only supported by the default (exhaustive) tester).
2387 - Added post-processing of terms to obtain readable counterexamples
2388 (currently only supported by the default (exhaustive) tester).
2389 - New counterexample generator quickcheck[narrowing] enables
2390 narrowing-based testing. Requires the Glasgow Haskell compiler
2391 with its installation location defined in the Isabelle settings
2392 environment as ISABELLE_GHC.
2393 - Removed quickcheck tester "SML" based on the SML code generator
2394 (formly in HOL/Library).
2396 * Function package: discontinued option "tailrec". INCOMPATIBILITY,
2397 use 'partial_function' instead.
2399 * Theory Library/Extended_Reals replaces now the positive extended
2400 reals found in probability theory. This file is extended by
2401 Multivariate_Analysis/Extended_Real_Limits.
2403 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,
2404 from where it must be imported explicitly if it is really required.
2407 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
2408 been moved here. INCOMPATIBILITY.
2410 * Theory Library/Saturated provides type of numbers with saturated
2413 * Theory Library/Product_Lattice defines a pointwise ordering for the
2414 product type 'a * 'b, and provides instance proofs for various order
2415 and lattice type classes.
2417 * Theory Library/Countable now provides the "countable_datatype" proof
2418 method for proving "countable" class instances for datatypes.
2420 * Theory Library/Cset_Monad allows do notation for computable sets
2421 (cset) via the generic monad ad-hoc overloading facility.
2423 * Library: Theories of common data structures are split into theories
2424 for implementation, an invariant-ensuring type, and connection to an
2425 abstract type. INCOMPATIBILITY.
2427 - RBT is split into RBT and RBT_Mapping.
2428 - AssocList is split and renamed into AList and AList_Mapping.
2429 - DList is split into DList_Impl, DList, and DList_Cset.
2430 - Cset is split into Cset and List_Cset.
2432 * Theory Library/Nat_Infinity has been renamed to
2433 Library/Extended_Nat, with name changes of the following types and
2436 type inat ~> type enat
2438 Infty ~> infinity (overloaded)
2442 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
2443 been renamed accordingly. INCOMPATIBILITY.
2445 * Session Multivariate_Analysis: The euclidean_space type class now
2446 fixes a constant "Basis :: 'a set" consisting of the standard
2447 orthonormal basis for the type. Users now have the option of
2448 quantifying over this set instead of using the "basis" function, e.g.
2449 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
2451 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
2452 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
2453 "Cart_nth" and "Cart_lambda" have been respectively renamed to
2454 "vec_nth" and "vec_lambda"; theorems mentioning those names have
2455 changed to match. Definition theorems for overloaded constants now use
2456 the standard "foo_vec_def" naming scheme. A few other theorems have
2457 been renamed as follows (INCOMPATIBILITY):
2459 Cart_eq ~> vec_eq_iff
2460 dist_nth_le_cart ~> dist_vec_nth_le
2461 tendsto_vector ~> vec_tendstoI
2462 Cauchy_vector ~> vec_CauchyI
2464 * Session Multivariate_Analysis: Several duplicate theorems have been
2465 removed, and other theorems have been renamed or replaced with more
2466 general versions. INCOMPATIBILITY.
2468 finite_choice ~> finite_set_choice
2469 eventually_conjI ~> eventually_conj
2470 eventually_and ~> eventually_conj_iff
2471 eventually_false ~> eventually_False
2472 setsum_norm ~> norm_setsum
2473 Lim_sequentially ~> LIMSEQ_def
2474 Lim_ident_at ~> LIM_ident
2475 Lim_const ~> tendsto_const
2476 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
2477 Lim_neg ~> tendsto_minus
2478 Lim_add ~> tendsto_add
2479 Lim_sub ~> tendsto_diff
2480 Lim_mul ~> tendsto_scaleR
2481 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
2482 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
2483 Lim_linear ~> bounded_linear.tendsto
2484 Lim_component ~> tendsto_euclidean_component
2485 Lim_component_cart ~> tendsto_vec_nth
2486 Lim_inner ~> tendsto_inner [OF tendsto_const]
2487 dot_lsum ~> inner_setsum_left
2488 dot_rsum ~> inner_setsum_right
2489 continuous_cmul ~> continuous_scaleR [OF continuous_const]
2490 continuous_neg ~> continuous_minus
2491 continuous_sub ~> continuous_diff
2492 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
2493 continuous_mul ~> continuous_scaleR
2494 continuous_inv ~> continuous_inverse
2495 continuous_at_within_inv ~> continuous_at_within_inverse
2496 continuous_at_inv ~> continuous_at_inverse
2497 continuous_at_norm ~> continuous_norm [OF continuous_at_id]
2498 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
2499 continuous_at_component ~> continuous_component [OF continuous_at_id]
2500 continuous_on_neg ~> continuous_on_minus
2501 continuous_on_sub ~> continuous_on_diff
2502 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
2503 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
2504 continuous_on_mul ~> continuous_on_scaleR
2505 continuous_on_mul_real ~> continuous_on_mult
2506 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
2507 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
2508 continuous_on_inverse ~> continuous_on_inv
2509 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
2510 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
2511 subset_interior ~> interior_mono
2512 subset_closure ~> closure_mono
2513 closure_univ ~> closure_UNIV
2514 real_arch_lt ~> reals_Archimedean2
2515 real_arch ~> reals_Archimedean3
2516 real_abs_norm ~> abs_norm_cancel
2517 real_abs_sub_norm ~> norm_triangle_ineq3
2518 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
2520 * Session HOL-Probability:
2521 - Caratheodory's extension lemma is now proved for ring_of_sets.
2522 - Infinite products of probability measures are now available.
2523 - Sigma closure is independent, if the generator is independent
2524 - Use extended reals instead of positive extended
2525 reals. INCOMPATIBILITY.
2527 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
2529 expand_fun_below ~> fun_below_iff
2530 below_fun_ext ~> fun_belowI
2531 expand_cfun_eq ~> cfun_eq_iff
2532 ext_cfun ~> cfun_eqI
2533 expand_cfun_below ~> cfun_below_iff
2534 below_cfun_ext ~> cfun_belowI
2535 monofun_fun_fun ~> fun_belowD
2536 monofun_fun_arg ~> monofunE
2537 monofun_lub_fun ~> adm_monofun [THEN admD]
2538 cont_lub_fun ~> adm_cont [THEN admD]
2539 cont2cont_Rep_CFun ~> cont2cont_APP
2540 cont_Rep_CFun_app ~> cont_APP_app
2541 cont_Rep_CFun_app_app ~> cont_APP_app_app
2542 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
2543 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
2544 contlub_cfun ~> lub_APP [symmetric]
2545 contlub_LAM ~> lub_LAM [symmetric]
2548 lift_distinct1 ~> lift.distinct(1)
2549 lift_distinct2 ~> lift.distinct(2)
2550 Def_not_UU ~> lift.distinct(2)
2551 Def_inject ~> lift.inject
2552 below_UU_iff ~> below_bottom_iff
2553 eq_UU_iff ~> eq_bottom_iff
2556 *** Document preparation ***
2558 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
2559 isar-ref manual, both for description and actual application of the
2562 * Antiquotation @{value} evaluates the given term and presents its
2565 * Antiquotations: term style "isub" provides ad-hoc conversion of
2566 variables x1, y23 into subscripted form x\<^isub>1,
2567 y\<^isub>2\<^isub>3.
2569 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
2570 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
2572 * Localized \isabellestyle switch can be used within blocks or groups
2575 \isabellestyle{it} %preferred default
2576 {\isabellestylett @{text "typewriter stuff"}}
2578 * Discontinued special treatment of hard tabulators. Implicit
2579 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual
2585 * The inner syntax of sort/type/term/prop supports inlined YXML
2586 representations within quoted string tokens. By encoding logical
2587 entities via Term_XML (in ML or Scala) concrete syntax can be
2588 bypassed, which is particularly useful for producing bits of text
2589 under external program control.
2591 * Antiquotations for ML and document preparation are managed as theory
2592 data, which requires explicit setup.
2594 * Isabelle_Process.is_active allows tools to check if the official
2595 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
2596 (better known as Proof General).
2598 * Structure Proof_Context follows standard naming scheme. Old
2599 ProofContext is still available for some time as legacy alias.
2601 * Structure Timing provides various operations for timing; supersedes
2602 former start_timing/end_timing etc.
2604 * Path.print is the official way to show file-system paths to users
2605 (including quotes etc.).
2607 * Inner syntax: identifiers in parse trees of generic categories
2608 "logic", "aprop", "idt" etc. carry position information (disguised as
2609 type constraints). Occasional INCOMPATIBILITY with non-compliant
2610 translations that choke on unexpected type constraints. Positions can
2611 be stripped in ML translations via Syntax.strip_positions /
2612 Syntax.strip_positions_ast, or via the syntax constant
2613 "_strip_positions" within parse trees. As last resort, positions can
2614 be disabled via the configuration option Syntax.positions, which is
2615 called "syntax_positions" in Isar attribute syntax.
2617 * Discontinued special status of various ML structures that contribute
2618 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
2619 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
2620 refer directly to Ast.Constant, Lexicon.is_identifier,
2621 Syntax_Trans.mk_binder_tr etc.
2623 * Typed print translation: discontinued show_sorts argument, which is
2624 already available via context of "advanced" translation.
2626 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
2627 goal states; body tactic needs to address all subgoals uniformly.
2629 * Slightly more special eq_list/eq_set, with shortcut involving
2630 pointer equality (assumes that eq relation is reflexive).
2632 * Classical tactics use proper Proof.context instead of historic types
2633 claset/clasimpset. Old-style declarations like addIs, addEs, addDs
2634 operate directly on Proof.context. Raw type claset retains its use as
2635 snapshot of the classical context, which can be recovered via
2636 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.
2637 INCOMPATIBILITY, classical tactics and derived proof methods require
2638 proper Proof.context.
2643 * Discontinued support for Poly/ML 5.2, which was the last version
2644 without proper multithreading and TimeLimit implementation.
2646 * Discontinued old lib/scripts/polyml-platform, which has been
2647 obsolete since Isabelle2009-2.
2649 * Various optional external tools are referenced more robustly and
2650 uniformly by explicit Isabelle settings as follows:
2652 ISABELLE_CSDP (formerly CSDP_EXE)
2653 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)
2654 ISABELLE_OCAML (formerly EXEC_OCAML)
2655 ISABELLE_SWIPL (formerly EXEC_SWIPL)
2656 ISABELLE_YAP (formerly EXEC_YAP)
2658 Note that automated detection from the file-system or search path has
2659 been discontinued. INCOMPATIBILITY.
2661 * Scala layer provides JVM method invocation service for static
2662 methods of type (String)String, see Invoke_Scala.method in ML. For
2665 Invoke_Scala.method "java.lang.System.getProperty" "java.home"
2667 Together with YXML.string_of_body/parse_body and XML.Encode/Decode
2668 this allows to pass structured values between ML and Scala.
2670 * The IsabelleText fonts includes some further glyphs to support the
2671 Prover IDE. Potential INCOMPATIBILITY: users who happen to have
2672 installed a local copy (which is normally *not* required) need to
2673 delete or update it from ~~/lib/fonts/.
2677 New in Isabelle2011 (January 2011)
2678 ----------------------------------
2682 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
2683 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
2684 useful tooltips and hyperlinks produced from its static analysis. The
2685 bundled component provides an executable Isabelle tool that can be run
2688 Isabelle2011/bin/isabelle jedit
2690 * Significantly improved Isabelle/Isar implementation manual.
2692 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
2693 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
2694 while the default heap location within that directory lacks that extra
2695 suffix. This isolates multiple Isabelle installations from each
2696 other, avoiding problems with old settings in new versions.
2697 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
2699 * Source files are always encoded as UTF-8, instead of old-fashioned
2700 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
2701 the following package declarations:
2703 \usepackage[utf8]{inputenc}
2704 \usepackage{textcomp}
2706 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
2707 a Unicode character is treated as a single symbol, not a sequence of
2708 non-ASCII bytes as before. Since Isabelle/ML string literals may
2709 contain symbols without further backslash escapes, Unicode can now be
2710 used here as well. Recall that Symbol.explode in ML provides a
2711 consistent view on symbols, while raw explode (or String.explode)
2712 merely give a byte-oriented representation.
2714 * Theory loader: source files are primarily located via the master
2715 directory of each theory node (where the .thy file itself resides).
2716 The global load path is still partially available as legacy feature.
2717 Minor INCOMPATIBILITY due to subtle change in file lookup: use
2718 explicit paths, relatively to the theory.
2720 * Special treatment of ML file names has been discontinued.
2721 Historically, optional extensions .ML or .sml were added on demand --
2722 at the cost of clarity of file dependencies. Recall that Isabelle/ML
2723 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
2725 * Various options that affect pretty printing etc. are now properly
2726 handled within the context via configuration options, instead of
2727 unsynchronized references or print modes. There are both ML Config.T
2728 entities and Isar declaration attributes to access these.
2730 ML (Config.T) Isar (attribute)
2732 eta_contract eta_contract
2733 show_brackets show_brackets
2734 show_sorts show_sorts
2735 show_types show_types
2736 show_question_marks show_question_marks
2737 show_consts show_consts
2738 show_abbrevs show_abbrevs
2740 Syntax.ast_trace syntax_ast_trace
2741 Syntax.ast_stat syntax_ast_stat
2742 Syntax.ambiguity_level syntax_ambiguity_level
2744 Goal_Display.goals_limit goals_limit
2745 Goal_Display.show_main_goal show_main_goal
2747 Method.rule_trace rule_trace
2749 Thy_Output.display thy_output_display
2750 Thy_Output.quotes thy_output_quotes
2751 Thy_Output.indent thy_output_indent
2752 Thy_Output.source thy_output_source
2753 Thy_Output.break thy_output_break
2755 Note that corresponding "..._default" references in ML may only be
2756 changed globally at the ROOT session setup, but *not* within a theory.
2757 The option "show_abbrevs" supersedes the former print mode
2758 "no_abbrevs" with inverted meaning.
2760 * More systematic naming of some configuration options.
2763 trace_simp ~> simp_trace
2764 debug_simp ~> simp_debug
2766 * Support for real valued configuration options, using simplistic
2767 floating-point notation that coincides with the inner syntax for
2770 * Support for real valued preferences (with approximative PGIP type):
2771 front-ends need to accept "pgint" values in float notation.
2774 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
2777 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
2782 * Command 'type_synonym' (with single argument) replaces somewhat
2783 outdated 'types', which is still available as legacy feature for some
2786 * Command 'nonterminal' (with 'and' separated list of arguments)
2787 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
2789 * Command 'notepad' replaces former 'example_proof' for
2790 experimentation in Isar without any result. INCOMPATIBILITY.
2792 * Locale interpretation commands 'interpret' and 'sublocale' accept
2793 lists of equations to map definitions in a locale to appropriate
2794 entities in the context of the interpretation. The 'interpretation'
2795 command already provided this functionality.
2797 * Diagnostic command 'print_dependencies' prints the locale instances
2798 that would be activated if the specified expression was interpreted in
2799 the current context. Variant "print_dependencies!" assumes a context
2800 without interpretations.
2802 * Diagnostic command 'print_interps' prints interpretations in proofs
2803 in addition to interpretations in theories.
2805 * Discontinued obsolete 'global' and 'local' commands to manipulate
2806 the theory name space. Rare INCOMPATIBILITY. The ML functions
2807 Sign.root_path and Sign.local_path may be applied directly where this
2808 feature is still required for historical reasons.
2810 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
2811 'definition' instead.
2813 * The "prems" fact, which refers to the accidental collection of
2814 foundational premises in the context, is now explicitly marked as
2815 legacy feature and will be discontinued soon. Consider using "assms"
2816 of the head statement or reference facts by explicit names.
2818 * Document antiquotations @{class} and @{type} print classes and type
2821 * Document antiquotation @{file} checks file/directory entries within
2822 the local file system.
2827 * Coercive subtyping: functions can be declared as coercions and type
2828 inference will add them as necessary upon input of a term. Theory
2829 Complex_Main declares real :: nat => real and real :: int => real as
2830 coercions. A coercion function f is declared like this:
2832 declare [[coercion f]]
2834 To lift coercions through type constructors (e.g. from nat => real to
2835 nat list => real list), map functions can be declared, e.g.
2837 declare [[coercion_map map]]
2839 Currently coercion inference is activated only in theories including
2840 real numbers, i.e. descendants of Complex_Main. This is controlled by
2841 the configuration option "coercion_enabled", e.g. it can be enabled in
2842 other theories like this:
2844 declare [[coercion_enabled]]
2846 * Command 'partial_function' provides basic support for recursive
2847 function definitions over complete partial orders. Concrete instances
2848 are provided for i) the option type, ii) tail recursion on arbitrary
2849 types, and iii) the heap monad of Imperative_HOL. See
2850 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
2853 * Function package: f.psimps rules are no longer implicitly declared
2854 as [simp]. INCOMPATIBILITY.
2856 * Datatype package: theorems generated for executable equality (class
2857 "eq") carry proper names and are treated as default code equations.
2859 * Inductive package: now offers command 'inductive_simps' to
2860 automatically derive instantiated and simplified equations for
2861 inductive predicates, similar to 'inductive_cases'.
2863 * Command 'enriched_type' allows to register properties of the
2864 functorial structure of types.
2866 * Improved infrastructure for term evaluation using code generator
2867 techniques, in particular static evaluation conversions.
2869 * Code generator: Scala (2.8 or higher) has been added to the target
2872 * Code generator: globbing constant expressions "*" and "Theory.*"
2873 have been replaced by the more idiomatic "_" and "Theory._".
2876 * Code generator: export_code without explicit file declaration prints
2877 to standard output. INCOMPATIBILITY.
2879 * Code generator: do not print function definitions for case
2880 combinators any longer.
2882 * Code generator: simplification with rules determined with
2883 src/Tools/Code/code_simp.ML and method "code_simp".
2885 * Code generator for records: more idiomatic representation of record
2886 types. Warning: records are not covered by ancient SML code
2887 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
2888 rep_datatype declaration helps to succeed then:
2892 rep_datatype foo_ext ...
2894 * Records: logical foundation type for records does not carry a
2895 '_type' suffix any longer (obsolete due to authentic syntax).
2898 * Quickcheck now by default uses exhaustive testing instead of random
2899 testing. Random testing can be invoked by "quickcheck [random]",
2900 exhaustive testing by "quickcheck [exhaustive]".
2902 * Quickcheck instantiates polymorphic types with small finite
2903 datatypes by default. This enables a simple execution mechanism to
2904 handle quantifiers and function equality over the finite datatypes.
2906 * Quickcheck random generator has been renamed from "code" to
2907 "random". INCOMPATIBILITY.
2909 * Quickcheck now has a configurable time limit which is set to 30
2910 seconds by default. This can be changed by adding [timeout = n] to the
2911 quickcheck command. The time limit for Auto Quickcheck is still set
2914 * Quickcheck in locales considers interpretations of that locale for
2915 counter example search.
2918 - Added "smt" and "remote_smt" provers based on the "smt" proof
2919 method. See the Sledgehammer manual for details ("isabelle doc
2922 sledgehammer atp_info ~> sledgehammer running_provers
2923 sledgehammer atp_kill ~> sledgehammer kill_provers
2924 sledgehammer available_atps ~> sledgehammer available_provers
2927 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
2928 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
2929 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
2930 (and "ms" and "min" are no longer supported)
2935 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
2936 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
2938 - Added support for partial quotient types.
2939 - Added local versions of the "Nitpick.register_xxx" functions.
2940 - Added "whack" option.
2941 - Allow registration of quotient types as codatatypes.
2942 - Improved "merge_type_vars" option to merge more types.
2943 - Removed unsound "fast_descrs" option.
2944 - Added custom symmetry breaking for datatypes, making it possible to reach
2945 higher cardinalities.
2946 - Prevent the expansion of too large definitions.
2948 * Proof methods "metis" and "meson" now have configuration options
2949 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
2950 to diagnose these tools. E.g.
2952 using [[metis_trace = true]]
2954 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
2955 manually as command 'solve_direct'.
2957 * The default SMT solver Z3 must be enabled explicitly (due to
2958 licensing issues) by setting the environment variable
2959 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
2960 commercial applications, the SMT solver CVC3 is provided as fall-back;
2961 changing the SMT solver is done via the configuration option
2964 * Remote SMT solvers need to be referred to by the "remote_" prefix,
2965 i.e. "remote_cvc3" and "remote_z3".
2967 * Added basic SMT support for datatypes, records, and typedefs using
2968 the oracle mode (no proofs). Direct support of pairs has been dropped
2969 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
2970 support for a similar behavior). Minor INCOMPATIBILITY.
2972 * Changed SMT configuration options:
2974 z3_proofs ~> smt_oracle (with inverted meaning)
2975 z3_trace_assms ~> smt_trace_used_facts
2988 * Boogie output files (.b2i files) need to be declared in the theory
2991 * Simplification procedure "list_to_set_comprehension" rewrites list
2992 comprehensions applied to List.set to set comprehensions. Occasional
2993 INCOMPATIBILITY, may be deactivated like this:
2995 declare [[simproc del: list_to_set_comprehension]]
2997 * Removed old version of primrec package. INCOMPATIBILITY.
2999 * Removed simplifier congruence rule of "prod_case", as has for long
3000 been the case with "split". INCOMPATIBILITY.
3002 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
3004 * Removed [split_format ... and ... and ...] version of
3005 [split_format]. Potential INCOMPATIBILITY.
3007 * Predicate "sorted" now defined inductively, with nice induction
3008 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
3010 * Constant "contents" renamed to "the_elem", to free the generic name
3011 contents for other uses. INCOMPATIBILITY.
3013 * Renamed class eq and constant eq (for code generation) to class
3014 equal and constant equal, plus renaming of related facts and various
3015 tuning. INCOMPATIBILITY.
3017 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
3019 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
3022 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
3023 avoid confusion with finite sets. INCOMPATIBILITY.
3025 * Abandoned locales equiv, congruent and congruent2 for equivalence
3026 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
3029 * Some previously unqualified names have been qualified:
3036 Trueprop ~> HOL.Trueprop
3041 op --> ~> HOL.implies
3053 Pair ~> Product_Type.Pair
3054 fst ~> Product_Type.fst
3055 snd ~> Product_Type.snd
3056 curry ~> Product_Type.curry
3058 Collect ~> Set.Collect
3062 * More canonical naming convention for some fundamental definitions:
3064 bot_bool_eq ~> bot_bool_def
3065 top_bool_eq ~> top_bool_def
3066 inf_bool_eq ~> inf_bool_def
3067 sup_bool_eq ~> sup_bool_def
3068 bot_fun_eq ~> bot_fun_def
3069 top_fun_eq ~> top_fun_def
3070 inf_fun_eq ~> inf_fun_def
3071 sup_fun_eq ~> sup_fun_def
3075 * More stylized fact names:
3077 expand_fun_eq ~> fun_eq_iff
3078 expand_set_eq ~> set_eq_iff
3080 nat_number ~> eval_nat_numeral
3084 * Refactoring of code-generation specific operations in theory List:
3090 mem_iff ~> member_def
3091 null_empty ~> null_def
3093 INCOMPATIBILITY. Note that these were not supposed to be used
3094 regularly unless for striking reasons; their main purpose was code
3097 Various operations from the Haskell prelude are used for generating
3100 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
3101 "surj f" is now an abbreviation of "range f = UNIV". The theorems
3102 bij_def and surj_def are unchanged. INCOMPATIBILITY.
3104 * Abolished some non-alphabetic type names: "prod" and "sum" replace
3105 "*" and "+" respectively. INCOMPATIBILITY.
3107 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
3108 "Sum_Type.Plus" instead.
3110 * Constant "split" has been merged with constant "prod_case"; names of
3111 ML functions, facts etc. involving split have been retained so far,
3112 though. INCOMPATIBILITY.
3114 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
3115 instead. INCOMPATIBILITY.
3117 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
3120 * Former theory Library/Enum is now part of the HOL-Main image.
3121 INCOMPATIBILITY: all constants of the Enum theory now have to be
3122 referred to by its qualified name.
3125 nlists ~> Enum.nlists
3126 product ~> Enum.product
3128 * Theory Library/Monad_Syntax provides do-syntax for monad types.
3129 Syntax in Library/State_Monad has been changed to avoid ambiguities.
3132 * Theory Library/SetsAndFunctions has been split into
3133 Library/Function_Algebras and Library/Set_Algebras; canonical names
3134 for instance definitions for functions; various improvements.
3137 * Theory Library/Multiset provides stable quicksort implementation of
3140 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
3143 * Session Multivariate_Analysis: introduced a type class for euclidean
3144 space. Most theorems are now stated in terms of euclidean spaces
3145 instead of finite cartesian products.
3148 real ^ 'n ~> 'a::real_vector
3149 ~> 'a::euclidean_space
3150 ~> 'a::ordered_euclidean_space
3151 (depends on your needs)
3155 \<chi> x. _ ~> \<chi>\<chi> x. _
3158 Also note that the indices are now natural numbers and not from some
3159 finite type. Finite cartesian products of euclidean spaces, products
3160 of euclidean spaces the real and complex numbers are instantiated to
3161 be euclidean_spaces. INCOMPATIBILITY.
3163 * Session Probability: introduced pextreal as positive extended real
3164 numbers. Use pextreal as value for measures. Introduce the
3165 Radon-Nikodym derivative, product spaces and Fubini's theorem for
3166 arbitrary sigma finite measures. Introduces Lebesgue measure based on
3167 the integral in Multivariate Analysis. INCOMPATIBILITY.
3169 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
3172 * Session SPARK (with image HOL-SPARK) provides commands to load and
3173 prove verification conditions generated by the SPARK Ada program
3174 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
3179 * Theorems for additive ring operations (locale abelian_monoid and
3180 descendants) are generated by interpretation from their multiplicative
3181 counterparts. Names (in particular theorem names) have the mandatory
3182 qualifier 'add'. Previous theorem names are redeclared for
3185 * Structure "int_ring" is now an abbreviation (previously a
3186 definition). This fits more natural with advanced interpretations.
3191 * The domain package now runs in definitional mode by default: The
3192 former command 'new_domain' is now called 'domain'. To use the domain
3193 package in its original axiomatic mode, use 'domain (unsafe)'.
3196 * The new class "domain" is now the default sort. Class "predomain"
3197 is an unpointed version of "domain". Theories can be updated by
3198 replacing sort annotations as shown below. INCOMPATIBILITY.
3200 'a::type ~> 'a::countable
3201 'a::cpo ~> 'a::predomain
3202 'a::pcpo ~> 'a::domain
3204 * The old type class "rep" has been superseded by class "domain".
3205 Accordingly, users of the definitional package must remove any
3206 "default_sort rep" declarations. INCOMPATIBILITY.
3208 * The domain package (definitional mode) now supports unpointed
3209 predomain argument types, as long as they are marked 'lazy'. (Strict
3210 arguments must be in class "domain".) For example, the following
3211 domain definition now works:
3213 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
3215 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
3216 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
3217 'a option, and 'a list. Additionally, it configures fixrec and the
3218 domain package to work with these types. For example:
3220 fixrec isInl :: "('a + 'b) u -> tr"
3221 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
3223 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
3225 * The "(permissive)" option of fixrec has been replaced with a
3226 per-equation "(unchecked)" option. See
3227 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
3229 * The "bifinite" class no longer fixes a constant "approx"; the class
3230 now just asserts that such a function exists. INCOMPATIBILITY.
3232 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
3233 defines an embedding of type 'a defl into udom by default; instances
3234 of "bifinite" and "domain" classes are available in
3235 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
3237 * The syntax "REP('a)" has been replaced with "DEFL('a)".
3239 * The predicate "directed" has been removed. INCOMPATIBILITY.
3241 * The type class "finite_po" has been removed. INCOMPATIBILITY.
3243 * The function "cprod_map" has been renamed to "prod_map".
3246 * The monadic bind operator on each powerdomain has new binder syntax
3247 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
3248 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
3250 * The infix syntax for binary union on each powerdomain has changed
3251 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
3252 syntax. INCOMPATIBILITY.
3254 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
3255 still supported as an input translation.
3257 * Renamed some theorems (the original names are also still available).
3259 expand_fun_below ~> fun_below_iff
3260 below_fun_ext ~> fun_belowI
3261 expand_cfun_eq ~> cfun_eq_iff
3262 ext_cfun ~> cfun_eqI
3263 expand_cfun_below ~> cfun_below_iff
3264 below_cfun_ext ~> cfun_belowI
3265 cont2cont_Rep_CFun ~> cont2cont_APP
3267 * The Abs and Rep functions for various types have changed names.
3268 Related theorem names have also changed to match. INCOMPATIBILITY.
3270 Rep_CFun ~> Rep_cfun
3271 Abs_CFun ~> Abs_cfun
3272 Rep_Sprod ~> Rep_sprod
3273 Abs_Sprod ~> Abs_sprod
3274 Rep_Ssum ~> Rep_ssum
3275 Abs_Ssum ~> Abs_ssum
3277 * Lemmas with names of the form *_defined_iff or *_strict_iff have
3278 been renamed to *_bottom_iff. INCOMPATIBILITY.
3280 * Various changes to bisimulation/coinduction with domain package:
3282 - Definitions of "bisim" constants no longer mention definedness.
3283 - With mutual recursion, "bisim" predicate is now curried.
3284 - With mutual recursion, each type gets a separate coind theorem.
3285 - Variable names in bisim_def and coinduct rules have changed.
3289 * Case combinators generated by the domain package for type "foo" are
3290 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
3292 * Several theorems have been renamed to more accurately reflect the
3293 names of constants and types involved. INCOMPATIBILITY.
3295 thelub_const ~> lub_const
3296 lub_const ~> is_lub_const
3298 is_lub_lub ~> is_lubD2
3300 unique_lub ~> is_lub_unique
3301 is_ub_lub ~> is_lub_rangeD1
3302 lub_bin_chain ~> is_lub_bin_chain
3303 lub_fun ~> is_lub_fun
3304 thelub_fun ~> lub_fun
3305 thelub_cfun ~> lub_cfun
3306 thelub_Pair ~> lub_Pair
3307 lub_cprod ~> is_lub_prod
3308 thelub_cprod ~> lub_prod
3309 minimal_cprod ~> minimal_prod
3310 inst_cprod_pcpo ~> inst_prod_pcpo
3312 compact_UU ~> compact_bottom
3313 deflation_UU ~> deflation_bottom
3314 finite_deflation_UU ~> finite_deflation_bottom
3316 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
3318 sq_ord_less_eq_trans ~> below_eq_trans
3319 sq_ord_eq_less_trans ~> eq_below_trans
3320 refl_less ~> below_refl
3321 trans_less ~> below_trans
3322 antisym_less ~> below_antisym
3323 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
3324 box_less ~> box_below
3325 rev_trans_less ~> rev_below_trans
3326 not_less2not_eq ~> not_below2not_eq
3327 less_UU_iff ~> below_UU_iff
3328 flat_less_iff ~> flat_below_iff
3329 adm_less ~> adm_below
3330 adm_not_less ~> adm_not_below
3331 adm_compact_not_less ~> adm_compact_not_below
3332 less_fun_def ~> below_fun_def
3333 expand_fun_less ~> fun_below_iff
3334 less_fun_ext ~> fun_belowI
3335 less_discr_def ~> below_discr_def
3336 discr_less_eq ~> discr_below_eq
3337 less_unit_def ~> below_unit_def
3338 less_cprod_def ~> below_prod_def
3339 prod_lessI ~> prod_belowI
3340 Pair_less_iff ~> Pair_below_iff
3341 fst_less_iff ~> fst_below_iff
3342 snd_less_iff ~> snd_below_iff
3343 expand_cfun_less ~> cfun_below_iff
3344 less_cfun_ext ~> cfun_belowI
3345 injection_less ~> injection_below
3346 less_up_def ~> below_up_def
3347 not_Iup_less ~> not_Iup_below
3348 Iup_less ~> Iup_below
3350 Def_inject_less_eq ~> Def_below_Def
3351 Def_less_is_eq ~> Def_below_iff
3352 spair_less_iff ~> spair_below_iff
3353 less_sprod ~> below_sprod
3354 spair_less ~> spair_below
3355 sfst_less_iff ~> sfst_below_iff
3356 ssnd_less_iff ~> ssnd_below_iff
3357 fix_least_less ~> fix_least_below
3358 dist_less_one ~> dist_below_one
3359 less_ONE ~> below_ONE
3360 ONE_less_iff ~> ONE_below_iff
3361 less_sinlD ~> below_sinlD
3362 less_sinrD ~> below_sinrD
3367 * All constant names are now qualified internally and use proper
3368 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
3373 * Antiquotation @{assert} inlines a function bool -> unit that raises
3374 Fail if the argument is false. Due to inlining the source position of
3375 failed assertions is included in the error output.
3377 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
3378 text is in practice always evaluated with a stable theory checkpoint.
3379 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
3381 * Antiquotation @{theory A} refers to theory A from the ancestry of
3382 the current context, not any accidental theory loader state as before.
3383 Potential INCOMPATIBILITY, subtle change in semantics.
3385 * Syntax.pretty_priority (default 0) configures the required priority
3386 of pretty-printed output and thus affects insertion of parentheses.
3388 * Syntax.default_root (default "any") configures the inner syntax
3389 category (nonterminal symbol) for parsing of terms.
3391 * Former exception Library.UnequalLengths now coincides with
3392 ListPair.UnequalLengths.
3394 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
3395 main functionality is provided by structure Simplifier.
3397 * Renamed raw "explode" function to "raw_explode" to emphasize its
3398 meaning. Note that internally to Isabelle, Symbol.explode is used in
3399 almost all situations.
3401 * Discontinued obsolete function sys_error and exception SYS_ERROR.
3402 See implementation manual for further details on exceptions in
3405 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
3408 * Renamed structure PureThy to Pure_Thy and moved most of its
3409 operations to structure Global_Theory, to emphasize that this is
3410 rarely-used global-only stuff.
3412 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
3413 instead (or tracing for high-volume output).
3415 * Configuration option show_question_marks only affects regular pretty
3416 printing of types and terms, not raw Term.string_of_vname.
3418 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
3419 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
3420 @{thms} for most purposes.
3422 * ML structure Unsynchronized is never opened, not even in Isar
3423 interaction mode as before. Old Unsynchronized.set etc. have been
3424 discontinued -- use plain := instead. This should be *rare* anyway,
3425 since modern tools always work via official context data, notably
3426 configuration options.
3428 * Parallel and asynchronous execution requires special care concerning
3429 interrupts. Structure Exn provides some convenience functions that
3430 avoid working directly with raw Interrupt. User code must not absorb
3431 interrupts -- intermediate handling (for cleanup etc.) needs to be
3432 followed by re-raising of the original exception. Another common
3433 source of mistakes are "handle _" patterns, which make the meaning of
3434 the program subject to physical effects of the environment.
3438 New in Isabelle2009-2 (June 2010)
3439 ---------------------------------
3443 * Authentic syntax for *all* logical entities (type classes, type
3444 constructors, term constants): provides simple and robust
3445 correspondence between formal entities and concrete syntax. Within
3446 the parse tree / AST representations, "constants" are decorated by
3447 their category (class, type, const) and spelled out explicitly with
3448 their full internal name.
3450 Substantial INCOMPATIBILITY concerning low-level syntax declarations
3451 and translations (translation rules and translation functions in ML).
3452 Some hints on upgrading:
3454 - Many existing uses of 'syntax' and 'translations' can be replaced
3455 by more modern 'type_notation', 'notation' and 'abbreviation',
3456 which are independent of this issue.
3458 - 'translations' require markup within the AST; the term syntax
3459 provides the following special forms:
3461 CONST c -- produces syntax version of constant c from context
3462 XCONST c -- literally c, checked as constant from context
3463 c -- literally c, if declared by 'syntax'
3465 Plain identifiers are treated as AST variables -- occasionally the
3466 system indicates accidental variables via the error "rhs contains
3469 Type classes and type constructors are marked according to their
3470 concrete syntax. Some old translations rules need to be written
3471 for the "type" category, using type constructor application
3472 instead of pseudo-term application of the default category
3475 - 'parse_translation' etc. in ML may use the following
3478 @{class_syntax c} -- type class c within parse tree / AST
3479 @{term_syntax c} -- type constructor c within parse tree / AST
3480 @{const_syntax c} -- ML version of "CONST c" above
3481 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
3483 - Literal types within 'typed_print_translations', i.e. those *not*
3484 represented as pseudo-terms are represented verbatim. Use @{class
3485 c} or @{type_name c} here instead of the above syntax
3488 Note that old non-authentic syntax was based on unqualified base
3489 names, so all of the above "constant" names would coincide. Recall
3490 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
3491 diagnose syntax problems.
3493 * Type constructors admit general mixfix syntax, not just infix.
3495 * Concrete syntax may be attached to local entities without a proof
3496 body, too. This works via regular mixfix annotations for 'fix',
3497 'def', 'obtain' etc. or via the explicit 'write' command, which is
3498 similar to the 'notation' command in theory specifications.
3500 * Discontinued unnamed infix syntax (legacy feature for many years) --
3501 need to specify constant name and syntax separately. Internal ML
3502 datatype constructors have been renamed from InfixName to Infix etc.
3503 Minor INCOMPATIBILITY.
3505 * Schematic theorem statements need to be explicitly markup as such,
3506 via commands 'schematic_lemma', 'schematic_theorem',
3507 'schematic_corollary'. Thus the relevance of the proof is made
3508 syntactically clear, which impacts performance in a parallel or
3509 asynchronous interactive environment. Minor INCOMPATIBILITY.
3511 * Use of cumulative prems via "!" in some proof methods has been
3512 discontinued (old legacy feature).
3514 * References 'trace_simp' and 'debug_simp' have been replaced by
3515 configuration options stored in the context. Enabling tracing (the
3516 case of debugging is similar) in proofs works via
3518 using [[trace_simp = true]]
3520 Tracing is then active for all invocations of the simplifier in
3521 subsequent goal refinement steps. Tracing may also still be enabled or
3522 disabled via the ProofGeneral settings menu.
3524 * Separate commands 'hide_class', 'hide_type', 'hide_const',
3525 'hide_fact' replace the former 'hide' KIND command. Minor
3528 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
3529 more efficient than combinations with -q1 or -q2.
3534 * Proofterms record type-class reasoning explicitly, using the
3535 "unconstrain" operation internally. This eliminates all sort
3536 constraints from a theorem and proof, introducing explicit
3537 OFCLASS-premises. On the proof term level, this operation is
3538 automatically applied at theorem boundaries, such that closed proofs
3539 are always free of sort constraints. INCOMPATIBILITY for tools that
3540 inspect proof terms.
3542 * Local theory specifications may depend on extra type variables that
3543 are not present in the result type -- arguments TYPE('a) :: 'a itself
3544 are added internally. For example:
3546 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
3548 * Predicates of locales introduced by classes carry a mandatory
3549 "class" prefix. INCOMPATIBILITY.
3551 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
3553 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
3556 * Command 'code_reflect' allows to incorporate generated ML code into
3557 runtime environment; replaces immature code_datatype antiquotation.
3560 * Code generator: simple concept for abstract datatypes obeying
3563 * Code generator: details of internal data cache have no impact on the
3564 user space functionality any longer.
3566 * Methods "unfold_locales" and "intro_locales" ignore non-locale
3567 subgoals. This is more appropriate for interpretations with 'where'.
3570 * Command 'example_proof' opens an empty proof body. This allows to
3571 experiment with Isar, without producing any persistent result.
3573 * Commands 'type_notation' and 'no_type_notation' declare type syntax
3574 within a local theory context, with explicit checking of the
3575 constructors involved (in contrast to the raw 'syntax' versions).
3577 * Commands 'types' and 'typedecl' now work within a local theory
3578 context -- without introducing dependencies on parameters or
3579 assumptions, which is not possible in Isabelle/Pure.
3581 * Command 'defaultsort' has been renamed to 'default_sort', it works
3582 within a local theory context. Minor INCOMPATIBILITY.
3587 * Command 'typedef' now works within a local theory context -- without
3588 introducing dependencies on parameters or assumptions, which is not
3589 possible in Isabelle/Pure/HOL. Note that the logical environment may
3590 contain multiple interpretations of local typedefs (with different
3591 non-emptiness proofs), even in a global theory context.
3593 * New package for quotient types. Commands 'quotient_type' and
3594 'quotient_definition' may be used for defining types and constants by
3595 quotient constructions. An example is the type of integers created by
3596 quotienting pairs of natural numbers:
3599 intrel :: "(nat * nat) => (nat * nat) => bool"
3601 "intrel (x, y) (u, v) = (x + v = u + y)"
3603 quotient_type int = "nat * nat" / intrel
3604 by (auto simp add: equivp_def expand_fun_eq)
3607 "0::int" is "(0::nat, 0::nat)"
3609 The method "lifting" can be used to lift of theorems from the
3610 underlying "raw" type to the quotient type. The example
3611 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
3612 construction and provides a reasoning infrastructure for finite sets.
3614 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
3615 clash with new theory Quotient in Main HOL.
3617 * Moved the SMT binding into the main HOL session, eliminating
3618 separate HOL-SMT session.
3620 * List membership infix mem operation is only an input abbreviation.
3623 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
3624 for future developements; former Library/Word.thy is still present in
3625 the AFP entry RSAPPS.
3627 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
3628 longer shadowed. INCOMPATIBILITY.
3630 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
3633 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
3636 * Dropped normalizing_semiring etc; use the facts in semiring classes
3637 instead. INCOMPATIBILITY.
3639 * Dropped several real-specific versions of lemmas about floor and
3640 ceiling; use the generic lemmas from theory "Archimedean_Field"
3641 instead. INCOMPATIBILITY.
3643 floor_number_of_eq ~> floor_number_of
3644 le_floor_eq_number_of ~> number_of_le_floor
3645 le_floor_eq_zero ~> zero_le_floor
3646 le_floor_eq_one ~> one_le_floor
3647 floor_less_eq_number_of ~> floor_less_number_of
3648 floor_less_eq_zero ~> floor_less_zero
3649 floor_less_eq_one ~> floor_less_one
3650 less_floor_eq_number_of ~> number_of_less_floor
3651 less_floor_eq_zero ~> zero_less_floor
3652 less_floor_eq_one ~> one_less_floor
3653 floor_le_eq_number_of ~> floor_le_number_of
3654 floor_le_eq_zero ~> floor_le_zero
3655 floor_le_eq_one ~> floor_le_one
3656 floor_subtract_number_of ~> floor_diff_number_of
3657 floor_subtract_one ~> floor_diff_one
3658 ceiling_number_of_eq ~> ceiling_number_of
3659 ceiling_le_eq_number_of ~> ceiling_le_number_of
3660 ceiling_le_zero_eq ~> ceiling_le_zero
3661 ceiling_le_eq_one ~> ceiling_le_one
3662 less_ceiling_eq_number_of ~> number_of_less_ceiling
3663 less_ceiling_eq_zero ~> zero_less_ceiling
3664 less_ceiling_eq_one ~> one_less_ceiling
3665 ceiling_less_eq_number_of ~> ceiling_less_number_of
3666 ceiling_less_eq_zero ~> ceiling_less_zero
3667 ceiling_less_eq_one ~> ceiling_less_one
3668 le_ceiling_eq_number_of ~> number_of_le_ceiling
3669 le_ceiling_eq_zero ~> zero_le_ceiling
3670 le_ceiling_eq_one ~> one_le_ceiling
3671 ceiling_subtract_number_of ~> ceiling_diff_number_of
3672 ceiling_subtract_one ~> ceiling_diff_one
3674 * Theory "Finite_Set": various folding_XXX locales facilitate the
3675 application of the various fold combinators on finite sets.
3677 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
3678 provides abstract red-black tree type which is backed by "RBT_Impl" as
3679 implementation. INCOMPATIBILTY.
3681 * Theory Library/Coinductive_List has been removed -- superseded by
3682 AFP/thys/Coinductive.
3684 * Theory PReal, including the type "preal" and related operations, has
3685 been removed. INCOMPATIBILITY.
3687 * Real: new development using Cauchy Sequences.
3689 * Split off theory "Big_Operators" containing setsum, setprod,
3690 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
3692 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
3693 "Int" etc. INCOMPATIBILITY.
3695 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
3697 * New set of rules "ac_simps" provides combined assoc / commute
3698 rewrites for all interpretations of the appropriate generic locales.
3700 * Renamed theory "OrderedGroup" to "Groups" and split theory
3701 "Ring_and_Field" into theories "Rings" and "Fields"; for more
3702 appropriate and more consistent names suitable for name prefixes
3703 within the HOL theories. INCOMPATIBILITY.
3705 * Some generic constants have been put to appropriate theories:
3706 - less_eq, less: Orderings
3707 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
3708 - inverse, divide: Rings
3711 * More consistent naming of type classes involving orderings (and
3714 lower_semilattice ~> semilattice_inf
3715 upper_semilattice ~> semilattice_sup
3717 dense_linear_order ~> dense_linorder
3719 pordered_ab_group_add ~> ordered_ab_group_add
3720 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
3721 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
3722 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
3723 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
3724 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
3725 pordered_cancel_semiring ~> ordered_cancel_semiring
3726 pordered_comm_monoid_add ~> ordered_comm_monoid_add
3727 pordered_comm_ring ~> ordered_comm_ring
3728 pordered_comm_semiring ~> ordered_comm_semiring
3729 pordered_ring ~> ordered_ring
3730 pordered_ring_abs ~> ordered_ring_abs
3731 pordered_semiring ~> ordered_semiring
3733 ordered_ab_group_add ~> linordered_ab_group_add
3734 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
3735 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
3736 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
3737 ordered_field ~> linordered_field
3738 ordered_field_no_lb ~> linordered_field_no_lb
3739 ordered_field_no_ub ~> linordered_field_no_ub
3740 ordered_field_dense_linear_order ~> dense_linordered_field
3741 ordered_idom ~> linordered_idom
3742 ordered_ring ~> linordered_ring
3743 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
3744 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
3745 ordered_ring_strict ~> linordered_ring_strict
3746 ordered_semidom ~> linordered_semidom
3747 ordered_semiring ~> linordered_semiring
3748 ordered_semiring_1 ~> linordered_semiring_1
3749 ordered_semiring_1_strict ~> linordered_semiring_1_strict
3750 ordered_semiring_strict ~> linordered_semiring_strict
3752 The following slightly odd type classes have been moved to a
3753 separate theory Library/Lattice_Algebras:
3755 lordered_ab_group_add ~> lattice_ab_group_add
3756 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
3757 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
3758 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
3759 lordered_ring ~> lattice_ring
3763 * Refined field classes:
3764 - classes division_ring_inverse_zero, field_inverse_zero,
3765 linordered_field_inverse_zero include rule inverse 0 = 0 --
3766 subsumes former division_by_zero class;
3767 - numerous lemmas have been ported from field to division_ring.
3770 * Refined algebra theorem collections:
3771 - dropped theorem group group_simps, use algebra_simps instead;
3772 - dropped theorem group ring_simps, use field_simps instead;
3773 - proper theorem collection field_simps subsumes former theorem
3774 groups field_eq_simps and field_simps;
3775 - dropped lemma eq_minus_self_iff which is a duplicate for
3779 * Theory Finite_Set and List: some lemmas have been generalized from
3782 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
3783 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
3784 inter_Inter_fold_inter ~> inf_Inf_fold_inf
3785 union_Union_fold_union ~> sup_Sup_fold_sup
3786 Inter_fold_inter ~> Inf_fold_inf
3787 Union_fold_union ~> Sup_fold_sup
3788 inter_INTER_fold_inter ~> inf_INFI_fold_inf
3789 union_UNION_fold_union ~> sup_SUPR_fold_sup
3790 INTER_fold_inter ~> INFI_fold_inf
3791 UNION_fold_union ~> SUPR_fold_sup
3793 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
3794 replaced by the more convenient lemmas Inf_empty and Sup_empty.
3795 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
3796 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
3797 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
3798 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
3800 * Reorganized theory Multiset: swapped notation of pointwise and
3803 - pointwise ordering is instance of class order with standard syntax
3805 - multiset ordering has syntax <=# and <#; partial order properties
3806 are provided by means of interpretation with prefix
3808 - less duplication, less historical organization of sections,
3809 conversion from associations lists to multisets, rudimentary code
3811 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
3816 multiset_eq_conv_count_eq ~> multiset_ext_iff
3817 multi_count_ext ~> multiset_ext
3818 diff_union_inverse2 ~> diff_union_cancelR
3822 * Theory Permutation: replaced local "remove" by List.remove1.
3824 * Code generation: ML and OCaml code is decorated with signatures.
3826 * Theory List: added transpose.
3828 * Library/Nat_Bijection.thy is a collection of bijective functions
3829 between nat and other types, which supersedes the older libraries
3830 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
3833 Nat_Int_Bij.nat2_to_nat ~> prod_encode
3834 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
3835 Nat_Int_Bij.int_to_nat_bij ~> int_encode
3836 Nat_Int_Bij.nat_to_int_bij ~> int_decode
3837 Countable.pair_encode ~> prod_encode
3838 NatIso.prod2nat ~> prod_encode
3839 NatIso.nat2prod ~> prod_decode
3840 NatIso.sum2nat ~> sum_encode
3841 NatIso.nat2sum ~> sum_decode
3842 NatIso.list2nat ~> list_encode
3843 NatIso.nat2list ~> list_decode
3844 NatIso.set2nat ~> set_encode
3845 NatIso.nat2set ~> set_decode
3848 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
3849 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
3850 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
3851 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
3852 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
3853 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
3854 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
3855 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
3856 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
3857 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
3858 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
3859 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
3860 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
3863 - Renamed ATP commands:
3864 atp_info ~> sledgehammer running_atps
3865 atp_kill ~> sledgehammer kill_atps
3866 atp_messages ~> sledgehammer messages
3867 atp_minimize ~> sledgehammer minimize
3868 print_atps ~> sledgehammer available_atps
3870 - Added user's manual ("isabelle doc sledgehammer").
3871 - Added option syntax and "sledgehammer_params" to customize
3872 Sledgehammer's behavior. See the manual for details.
3873 - Modified the Isar proof reconstruction code so that it produces
3874 direct proofs rather than proofs by contradiction. (This feature
3875 is still experimental.)
3876 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
3878 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
3881 - Added and implemented "binary_ints" and "bits" options.
3882 - Added "std" option and implemented support for nonstandard models.
3883 - Added and implemented "finitize" option to improve the precision
3884 of infinite datatypes based on a monotonicity analysis.
3885 - Added support for quotient types.
3886 - Added support for "specification" and "ax_specification"
3888 - Added support for local definitions (for "function" and
3889 "termination" proofs).
3890 - Added support for term postprocessors.
3891 - Optimized "Multiset.multiset" and "FinFun.finfun".
3892 - Improved efficiency of "destroy_constrs" optimization.
3893 - Fixed soundness bugs related to "destroy_constrs" optimization and
3895 - Fixed soundness bug related to higher-order constructors.
3896 - Fixed soundness bug when "full_descrs" is enabled.
3897 - Improved precision of set constructs.
3898 - Added "atoms" option.
3899 - Added cache to speed up repeated Kodkod invocations on the same
3901 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
3902 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
3903 "SAT4J_Light". INCOMPATIBILITY.
3904 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
3905 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
3906 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
3908 * Method "induct" now takes instantiations of the form t, where t is not
3909 a variable, as a shorthand for "x == t", where x is a fresh variable.
3910 If this is not intended, t has to be enclosed in parentheses.
3911 By default, the equalities generated by definitional instantiations
3912 are pre-simplified, which may cause parameters of inductive cases
3913 to disappear, or may even delete some of the inductive cases.
3914 Use "induct (no_simp)" instead of "induct" to restore the old
3915 behaviour. The (no_simp) option is also understood by the "cases"
3916 and "nominal_induct" methods, which now perform pre-simplification, too.
3922 * Variable names in lemmas generated by the domain package have
3923 changed; the naming scheme is now consistent with the HOL datatype
3924 package. Some proof scripts may be affected, INCOMPATIBILITY.
3926 * The domain package no longer defines the function "foo_copy" for
3927 recursive domain "foo". The reach lemma is now stated directly in
3928 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
3929 be reformulated in terms of "foo_take", INCOMPATIBILITY.
3931 * Most definedness lemmas generated by the domain package (previously
3932 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
3933 like "foo$x = UU <-> x = UU", which works better as a simp rule.
3934 Proofs that used definedness lemmas as intro rules may break,
3935 potential INCOMPATIBILITY.
3937 * Induction and casedist rules generated by the domain package now
3938 declare proper case_names (one called "bottom", and one named for each
3939 constructor). INCOMPATIBILITY.
3941 * For mutually-recursive domains, separate "reach" and "take_lemma"
3942 rules are generated for each domain, INCOMPATIBILITY.
3944 foo_bar.reach ~> foo.reach bar.reach
3945 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
3947 * Some lemmas generated by the domain package have been renamed for
3948 consistency with the datatype package, INCOMPATIBILITY.
3950 foo.ind ~> foo.induct
3951 foo.finite_ind ~> foo.finite_induct
3952 foo.coind ~> foo.coinduct
3953 foo.casedist ~> foo.exhaust
3954 foo.exhaust ~> foo.nchotomy
3956 * For consistency with other definition packages, the fixrec package
3957 now generates qualified theorem names, INCOMPATIBILITY.
3959 foo_simps ~> foo.simps
3960 foo_unfold ~> foo.unfold
3961 foo_induct ~> foo.induct
3963 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
3964 method and internal fixrec proofs now use the default simpset instead.
3967 * The "contlub" predicate has been removed. Proof scripts should use
3968 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
3970 * The "admw" predicate has been removed, INCOMPATIBILITY.
3972 * The constants cpair, cfst, and csnd have been removed in favor of
3973 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
3978 * Antiquotations for basic formal entities:
3980 @{class NAME} -- type class
3981 @{class_syntax NAME} -- syntax representation of the above
3983 @{type_name NAME} -- logical type
3984 @{type_abbrev NAME} -- type abbreviation
3985 @{nonterminal NAME} -- type of concrete syntactic category
3986 @{type_syntax NAME} -- syntax representation of any of the above
3988 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
3989 @{const_abbrev NAME} -- abbreviated constant
3990 @{const_syntax NAME} -- syntax representation of any of the above
3992 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
3993 syntax constant (cf. 'syntax' command).
3995 * Antiquotation @{make_string} inlines a function to print arbitrary
3996 values similar to the ML toplevel. The result is compiler dependent
3997 and may fall back on "?" in certain situations.
3999 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
4000 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
4001 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
4002 not work with the asynchronous Isar document model.
4004 * Configuration options now admit dynamic default values, depending on
4005 the context or even global references.
4007 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
4008 uses an efficient external library if available (for Poly/ML).
4010 * Renamed some important ML structures, while keeping the old names
4011 for some time as aliases within the structure Legacy:
4013 OuterKeyword ~> Keyword
4016 OuterSyntax ~> Outer_Syntax
4017 PrintMode ~> Print_Mode
4018 SpecParse ~> Parse_Spec
4021 ThyOutput ~> Thy_Output
4022 TypeInfer ~> Type_Infer
4024 Note that "open Legacy" simplifies porting of sources, but forgetting
4025 to remove it again will complicate porting again in the future.
4027 * Most operations that refer to a global context are named
4028 accordingly, e.g. Simplifier.global_context or
4029 ProofContext.init_global. There are some situations where a global
4030 context actually works, but under normal circumstances one needs to
4031 pass the proper local context through the code!
4033 * Discontinued old TheoryDataFun with its copy/init operation -- data
4034 needs to be pure. Functor Theory_Data_PP retains the traditional
4035 Pretty.pp argument to merge, which is absent in the standard
4036 Theory_Data version.
4038 * Sorts.certify_sort and derived "cert" operations for types and terms
4039 no longer minimize sorts. Thus certification at the boundary of the
4040 inference kernel becomes invariant under addition of class relations,
4041 which is an important monotonicity principle. Sorts are now minimized
4042 in the syntax layer only, at the boundary between the end-user and the
4043 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
4044 explicitly in rare situations.
4046 * Renamed old-style Drule.standard to Drule.export_without_context, to
4047 emphasize that this is in no way a standard operation.
4050 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
4051 usual for resolution. Rare INCOMPATIBILITY.
4053 * Renamed varify/unvarify operations to varify_global/unvarify_global
4054 to emphasize that these only work in a global situation (which is
4057 * Curried take and drop in library.ML; negative length is interpreted
4058 as infinity (as in chop). Subtle INCOMPATIBILITY.
4060 * Proof terms: type substitutions on proof constants now use canonical
4061 order of type variables. INCOMPATIBILITY for tools working with proof
4064 * Raw axioms/defs may no longer carry sort constraints, and raw defs
4065 may no longer carry premises. User-level specifications are
4066 transformed accordingly by Thm.add_axiom/add_def.
4071 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
4072 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
4073 proof terms are enabled unconditionally in the new HOL-Proofs image.
4075 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
4076 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
4079 * Old lib/scripts/polyml-platform is superseded by the
4080 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
4081 variant, even on a 64 bit machine. The following example setting
4082 prefers 64 bit if available:
4084 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
4086 * The preliminary Isabelle/jEdit application demonstrates the emerging
4087 Isabelle/Scala layer for advanced prover interaction and integration.
4088 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
4091 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
4092 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
4093 similar to the default assignment of the document preparation system
4094 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
4095 provides some operations for direct access to the font without asking
4096 the user for manual installation.
4100 New in Isabelle2009-1 (December 2009)
4101 -------------------------------------
4105 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
4106 one backslash should be used, even in ML sources.
4111 * Locale interpretation propagates mixins along the locale hierarchy.
4112 The currently only available mixins are the equations used to map
4113 local definitions to terms of the target domain of an interpretation.
4115 * Reactivated diagnostic command 'print_interps'. Use "print_interps
4116 loc" to print all interpretations of locale "loc" in the theory.
4117 Interpretations in proofs are not shown.
4119 * Thoroughly revised locales tutorial. New section on conditional
4122 * On instantiation of classes, remaining undefined class parameters
4123 are formally declared. INCOMPATIBILITY.
4126 *** Document preparation ***
4128 * New generalized style concept for printing terms: @{foo (style) ...}
4129 instead of @{foo_style style ...} (old form is still retained for
4130 backward compatibility). Styles can be also applied for
4131 antiquotations prop, term_type and typeof.
4136 * New proof method "smt" for a combination of first-order logic with
4137 equality, linear and nonlinear (natural/integer/real) arithmetic, and
4138 fixed-size bitvectors; there is also basic support for higher-order
4139 features (esp. lambda abstractions). It is an incomplete decision
4140 procedure based on external SMT solvers using the oracle mechanism;
4141 for the SMT solver Z3, this method is proof-producing. Certificates
4142 are provided to avoid calling the external solvers solely for
4143 re-checking proofs. Due to a remote SMT service there is no need for
4144 installing SMT solvers locally. See src/HOL/SMT.
4146 * New commands to load and prove verification conditions generated by
4147 the Boogie program verifier or derived systems (e.g. the Verifying C
4148 Compiler (VCC) or Spec#). See src/HOL/Boogie.
4150 * New counterexample generator tool 'nitpick' based on the Kodkod
4151 relational model finder. See src/HOL/Tools/Nitpick and
4152 src/HOL/Nitpick_Examples.
4154 * New commands 'code_pred' and 'values' to invoke the predicate
4155 compiler and to enumerate values of inductive predicates.
4157 * A tabled implementation of the reflexive transitive closure.
4159 * New implementation of quickcheck uses generic code generator;
4160 default generators are provided for all suitable HOL types, records
4161 and datatypes. Old quickcheck can be re-activated importing theory
4162 Library/SML_Quickcheck.
4164 * New testing tool Mirabelle for automated proof tools. Applies
4165 several tools and tactics like sledgehammer, metis, or quickcheck, to
4166 every proof step in a theory. To be used in batch mode via the
4167 "mirabelle" utility.
4169 * New proof method "sos" (sum of squares) for nonlinear real
4170 arithmetic (originally due to John Harison). It requires theory
4171 Library/Sum_Of_Squares. It is not a complete decision procedure but
4172 works well in practice on quantifier-free real arithmetic with +, -,
4173 *, ^, =, <= and <, i.e. boolean combinations of equalities and
4174 inequalities between polynomials. It makes use of external
4175 semidefinite programming solvers. Method "sos" generates a
4176 certificate that can be pasted into the proof thus avoiding the need
4177 to call an external tool every time the proof is checked. See
4178 src/HOL/Library/Sum_Of_Squares.
4180 * New method "linarith" invokes existing linear arithmetic decision
4183 * New command 'atp_minimal' reduces result produced by Sledgehammer.
4185 * New Sledgehammer option "Full Types" in Proof General settings menu.
4186 Causes full type information to be output to the ATPs. This slows
4187 ATPs down considerably but eliminates a source of unsound "proofs"
4190 * New method "metisFT": A version of metis that uses full type
4191 information in order to avoid failures of proof reconstruction.
4193 * New evaluator "approximate" approximates an real valued term using
4194 the same method as the approximation method.
4196 * Method "approximate" now supports arithmetic expressions as
4197 boundaries of intervals and implements interval splitting and Taylor
4200 * ML antiquotation @{code_datatype} inserts definition of a datatype
4201 generated by the code generator; e.g. see src/HOL/Predicate.thy.
4203 * New theory SupInf of the supremum and infimum operators for sets of
4206 * New theory Probability, which contains a development of measure
4207 theory, eventually leading to Lebesgue integration and probability.
4209 * Extended Multivariate Analysis to include derivation and Brouwer's
4212 * Reorganization of number theory, INCOMPATIBILITY:
4213 - new number theory development for nat and int, in theories Divides
4214 and GCD as well as in new session Number_Theory
4215 - some constants and facts now suffixed with _nat and _int
4217 - former session NumberTheory now named Old_Number_Theory, including
4218 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
4219 - moved theory Pocklington from src/HOL/Library to
4220 src/HOL/Old_Number_Theory
4222 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
4223 lcm of finite and infinite sets. It is shown that they form a complete
4226 * Class semiring_div requires superclass no_zero_divisors and proof of
4227 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
4228 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
4229 generalized to class semiring_div, subsuming former theorems
4230 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
4231 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
4234 * Refinements to lattice classes and sets:
4235 - less default intro/elim rules in locale variant, more default
4236 intro/elim rules in class variant: more uniformity
4237 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
4239 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
4241 - renamed ACI to inf_sup_aci
4242 - new class "boolean_algebra"
4243 - class "complete_lattice" moved to separate theory
4244 "Complete_Lattice"; corresponding constants (and abbreviations)
4245 renamed and with authentic syntax:
4246 Set.Inf ~> Complete_Lattice.Inf
4247 Set.Sup ~> Complete_Lattice.Sup
4248 Set.INFI ~> Complete_Lattice.INFI
4249 Set.SUPR ~> Complete_Lattice.SUPR
4250 Set.Inter ~> Complete_Lattice.Inter
4251 Set.Union ~> Complete_Lattice.Union
4252 Set.INTER ~> Complete_Lattice.INTER
4253 Set.UNION ~> Complete_Lattice.UNION
4254 - authentic syntax for
4257 - mere abbreviations:
4260 Set.inter (for inf, formerly Set.Int)
4261 Set.union (for sup, formerly Set.Un)
4262 Complete_Lattice.Inter (for Inf)
4263 Complete_Lattice.Union (for Sup)
4264 Complete_Lattice.INTER (for INFI)
4265 Complete_Lattice.UNION (for SUPR)
4266 - object-logic definitions as far as appropriate
4268 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
4269 Un_subset_iff are explicitly deleted as default simp rules; then also
4270 their lattice counterparts le_inf_iff and le_sup_iff have to be
4271 deleted to achieve the desired effect.
4273 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
4274 rules by default any longer; the same applies to min_max.inf_absorb1
4275 etc. INCOMPATIBILITY.
4277 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
4278 pred_set_conv by default. INCOMPATIBILITY.
4280 * Power operations on relations and functions are now one dedicated
4281 constant "compow" with infix syntax "^^". Power operation on
4282 multiplicative monoids retains syntax "^" and is now defined generic
4283 in class power. INCOMPATIBILITY.
4285 * Relation composition "R O S" now has a more standard argument order:
4286 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
4287 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
4288 break, since the O_assoc rule was not rewritten like this. Fix using
4289 O_assoc[symmetric]. The same applies to the curried version "R OO S".
4291 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
4292 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
4295 * Most rules produced by inductive and datatype package have mandatory
4296 prefixes. INCOMPATIBILITY.
4298 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
4299 the attribute of the same name. Each of the theorems in the list
4300 DERIV_intros assumes composition with an additional function and
4301 matches a variable to the derivative, which has to be solved by the
4302 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
4303 of most elementary terms. Former Maclauren.DERIV_tac and
4304 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
4307 * Code generator attributes follow the usual underscore convention:
4308 code_unfold replaces code unfold
4309 code_post replaces code post
4314 sizechange -> size_change
4315 induct_scheme -> induction_schema
4318 * Discontinued abbreviation "arbitrary" of constant "undefined".
4319 INCOMPATIBILITY, use "undefined" directly.
4322 Suc_eq_add_numeral_1 -> Suc_eq_plus1
4323 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
4324 Suc_plus1 -> Suc_eq_plus1
4325 *anti_sym -> *antisym*
4326 vector_less_eq_def -> vector_le_def
4329 * Added theorem List.map_map as [simp]. Removed List.map_compose.
4332 * Removed predicate "M hassize n" (<--> card M = n & finite M).
4338 * Theory Representable defines a class "rep" of domains that are
4339 representable (via an ep-pair) in the universal domain type "udom".
4340 Instances are provided for all type constructors defined in HOLCF.
4342 * The 'new_domain' command is a purely definitional version of the
4343 domain package, for representable domains. Syntax is identical to the
4344 old domain package. The 'new_domain' package also supports indirect
4345 recursion using previously-defined type constructors. See
4346 src/HOLCF/ex/New_Domain.thy for examples.
4348 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
4349 on the left-hand side of an equation, and then performs
4350 simplification. Rewriting is done using rules declared with the
4351 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
4352 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
4354 * The pattern-match compiler in 'fixrec' can now handle constructors
4355 with HOL function types. Pattern-match combinators for the Pair
4356 constructor are pre-configured.
4358 * The 'fixrec' package now produces better fixed-point induction rules
4359 for mutually-recursive definitions: Induction rules have conclusions
4360 of the form "P foo bar" instead of "P <foo, bar>".
4362 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
4363 been renamed to "below". The name "below" now replaces "less" in many
4364 theorem names. (Legacy theorem names using "less" are still supported
4367 * The 'fixrec' package now supports "bottom patterns". Bottom
4368 patterns can be used to generate strictness rules, or to make
4369 functions more strict (much like the bang-patterns supported by the
4370 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
4376 * Support for Poly/ML 5.3.0, with improved reporting of compiler
4377 errors and run-time exceptions, including detailed source positions.
4379 * Structure Name_Space (formerly NameSpace) now manages uniquely
4380 identified entries, with some additional information such as source
4381 position, logical grouping etc.
4383 * Theory and context data is now introduced by the simplified and
4384 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
4385 to be pure, but the old TheoryDataFun for mutable data (with explicit
4386 copy operation) is still available for some time.
4388 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
4389 provides a high-level programming interface to synchronized state
4390 variables with atomic update. This works via pure function
4391 application within a critical section -- its runtime should be as
4392 short as possible; beware of deadlocks if critical code is nested,
4393 either directly or indirectly via other synchronized variables!
4395 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
4396 wraps raw ML references, explicitly indicating their non-thread-safe
4397 behaviour. The Isar toplevel keeps this structure open, to
4398 accommodate Proof General as well as quick and dirty interactive
4399 experiments with references.
4401 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
4402 parallel tactical reasoning.
4404 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
4405 are similar to SUBPROOF, but are slightly more flexible: only the
4406 specified parts of the subgoal are imported into the context, and the
4407 body tactic may introduce new subgoals and schematic variables.
4409 * Old tactical METAHYPS, which does not observe the proof context, has
4410 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
4411 or Subgoal.FOCUS etc.
4413 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
4414 functors have their own ML name space there is no point to mark them
4415 separately.) Minor INCOMPATIBILITY.
4417 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
4419 * Renamed several structures FooBar to Foo_Bar. Occasional,
4422 * Operations of structure Skip_Proof no longer require quick_and_dirty
4423 mode, which avoids critical setmp.
4425 * Eliminated old Attrib.add_attributes, Method.add_methods and related
4426 combinators for "args". INCOMPATIBILITY, need to use simplified
4427 Attrib/Method.setup introduced in Isabelle2009.
4429 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
4430 back on global_simpset_of, global_claset_of, global_clasimpset_of as
4431 last resort. INCOMPATIBILITY.
4433 * Display.pretty_thm now requires a proper context (cf. former
4434 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
4435 or even Display.pretty_thm_without_context as last resort.
4438 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
4439 Syntax.pretty_typ/term directly, preferably with proper context
4440 instead of global theory.
4445 * Further fine tuning of parallel proof checking, scales up to 8 cores
4446 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
4449 * Support for additional "Isabelle components" via etc/components, see
4450 also the system manual.
4452 * The isabelle makeall tool now operates on all components with
4453 IsaMakefile, not just hardwired "logics".
4455 * Removed "compress" option from isabelle-process and isabelle usedir;
4456 this is always enabled.
4458 * Discontinued support for Poly/ML 4.x versions.
4460 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
4461 on a given logic image. This requires the lighttpd webserver and is
4462 currently supported on Linux only.
4466 New in Isabelle2009 (April 2009)
4467 --------------------------------
4471 * Simplified main Isabelle executables, with less surprises on
4472 case-insensitive file-systems (such as Mac OS).
4474 - The main Isabelle tool wrapper is now called "isabelle" instead of
4477 - The former "isabelle" alias for "isabelle-process" has been
4478 removed (should rarely occur to regular users).
4480 - The former "isabelle-interface" and its alias "Isabelle" have been
4481 removed (interfaces are now regular Isabelle tools).
4483 Within scripts and make files, the Isabelle environment variables
4484 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
4485 respectively. (The latter are still available as legacy feature.)
4487 The old isabelle-interface wrapper could react in confusing ways if
4488 the interface was uninstalled or changed otherwise. Individual
4489 interface tool configuration is now more explicit, see also the
4490 Isabelle system manual. In particular, Proof General is now available
4491 via "isabelle emacs".
4493 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
4494 purge installed copies of Isabelle executables and re-run "isabelle
4495 install -p ...", or use symlinks.
4497 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
4498 old ~/isabelle, which was slightly non-standard and apt to cause
4499 surprises on case-insensitive file-systems (such as Mac OS).
4501 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
4502 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
4503 care is required when using older releases of Isabelle. Note that
4504 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
4505 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
4507 * Proofs of fully specified statements are run in parallel on
4508 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
4509 a regular 4-core machine, if the initial heap space is made reasonably
4510 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
4512 * The main reference manuals ("isar-ref", "implementation", and
4513 "system") have been updated and extended. Formally checked references
4514 as hyperlinks are now available uniformly.
4519 * Complete re-implementation of locales. INCOMPATIBILITY in several
4520 respects. The most important changes are listed below. See the
4521 Tutorial on Locales ("locales" manual) for details.
4523 - In locale expressions, instantiation replaces renaming. Parameters
4524 must be declared in a for clause. To aid compatibility with previous
4525 parameter inheritance, in locale declarations, parameters that are not
4526 'touched' (instantiation position "_" or omitted) are implicitly added
4527 with their syntax at the beginning of the for clause.
4529 - Syntax from abbreviations and definitions in locales is available in
4530 locale expressions and context elements. The latter is particularly
4531 useful in locale declarations.
4533 - More flexible mechanisms to qualify names generated by locale
4534 expressions. Qualifiers (prefixes) may be specified in locale
4535 expressions, and can be marked as mandatory (syntax: "name!:") or
4536 optional (syntax "name?:"). The default depends for plain "name:"
4537 depends on the situation where a locale expression is used: in
4538 commands 'locale' and 'sublocale' prefixes are optional, in
4539 'interpretation' and 'interpret' prefixes are mandatory. The old
4540 implicit qualifiers derived from the parameter names of a locale are
4541 no longer generated.
4543 - Command "sublocale l < e" replaces "interpretation l < e". The
4544 instantiation clause in "interpretation" and "interpret" (square
4545 brackets) is no longer available. Use locale expressions.
4547 - When converting proof scripts, mandatory qualifiers in
4548 'interpretation' and 'interpret' should be retained by default, even
4549 if this is an INCOMPATIBILITY compared to former behavior. In the
4550 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
4551 in locale expressions range over a single locale instance only.
4553 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
4554 In existing theorem specifications replace the includes element by the
4555 respective context elements of the included locale, omitting those
4556 that are already present in the theorem specification. Multiple
4557 assume elements of a locale should be replaced by a single one
4558 involving the locale predicate. In the proof body, declarations (most
4559 notably theorems) may be regained by interpreting the respective
4560 locales in the proof context as required (command "interpret").
4562 If using "includes" in replacement of a target solely because the
4563 parameter types in the theorem are not as general as in the target,
4564 consider declaring a new locale with additional type constraints on
4565 the parameters (context element "constrains").
4567 - Discontinued "locale (open)". INCOMPATIBILITY.
4569 - Locale interpretation commands no longer attempt to simplify goal.
4570 INCOMPATIBILITY: in rare situations the generated goal differs. Use
4571 methods intro_locales and unfold_locales to clarify.
4573 - Locale interpretation commands no longer accept interpretation
4574 attributes. INCOMPATIBILITY.
4576 * Class declaration: so-called "base sort" must not be given in import
4577 list any longer, but is inferred from the specification. Particularly
4584 class foo = type + ...
4586 * Class target: global versions of theorems stemming do not carry a
4587 parameter prefix any longer. INCOMPATIBILITY.
4589 * Class 'instance' command no longer accepts attached definitions.
4590 INCOMPATIBILITY, use proper 'instantiation' target instead.
4592 * Recovered hiding of consts, which was accidentally broken in
4593 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
4594 makes c inaccessible; consider using ``hide (open) const c'' instead.
4596 * Slightly more coherent Pure syntax, with updated documentation in
4597 isar-ref manual. Removed locales meta_term_syntax and
4598 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
4599 INCOMPATIBILITY in rare situations. Note that &&& should not be used
4600 directly in regular applications.
4602 * There is a new syntactic category "float_const" for signed decimal
4603 fractions (e.g. 123.45 or -123.45).
4605 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
4606 interface with 'setup' command instead.
4608 * Command 'local_setup' is similar to 'setup', but operates on a local
4611 * The 'axiomatization' command now only works within a global theory
4612 context. INCOMPATIBILITY.
4614 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
4615 hypotheses. Sorts required in the course of reasoning need to be
4616 covered by the constraints in the initial statement, completed by the
4617 type instance information of the background theory. Non-trivial sort
4618 hypotheses, which rarely occur in practice, may be specified via
4619 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
4621 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
4623 The result contains an implicit sort hypotheses as before --
4624 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
4627 * Generalized Isar history, with support for linear undo, direct state
4630 * Changed defaults for unify configuration options:
4632 unify_trace_bound = 50 (formerly 25)
4633 unify_search_bound = 60 (formerly 30)
4635 * Different bookkeeping for code equations (INCOMPATIBILITY):
4637 a) On theory merge, the last set of code equations for a particular
4638 constant is taken (in accordance with the policy applied by other
4639 parts of the code generator framework).
4641 b) Code equations stemming from explicit declarations (e.g. code
4642 attribute) gain priority over default code equations stemming
4643 from definition, primrec, fun etc.
4645 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
4647 * Unified theorem tables for both code generators. Thus [code
4648 func] has disappeared and only [code] remains. INCOMPATIBILITY.
4650 * Command 'find_consts' searches for constants based on type and name
4653 find_consts "_ => bool"
4655 By default, matching is against subtypes, but it may be restricted to
4656 the whole type. Searching by name is possible. Multiple queries are
4657 conjunctive and queries may be negated by prefixing them with a
4660 find_consts strict: "_ => bool" name: "Int" -"int => int"
4662 * New 'find_theorems' criterion "solves" matches theorems that
4663 directly solve the current goal (modulo higher-order unification).
4665 * Auto solve feature for main theorem statements: whenever a new goal
4666 is stated, "find_theorems solves" is called; any theorems that could
4667 solve the lemma directly are listed as part of the goal state.
4668 Cf. associated options in Proof General Isabelle settings menu,
4669 enabled by default, with reasonable timeout for pathological cases of
4670 higher-order unification.
4673 *** Document preparation ***
4675 * Antiquotation @{lemma} now imitates a regular terminal proof,
4676 demanding keyword 'by' and supporting the full method expression
4677 syntax just like the Isar command 'by'.
4682 * Integrated main parts of former image HOL-Complex with HOL. Entry
4683 points Main and Complex_Main remain as before.
4685 * Logic image HOL-Plain provides a minimal HOL with the most important
4686 tools available (inductive, datatype, primrec, ...). This facilitates
4687 experimentation and tool development. Note that user applications
4688 (and library theories) should never refer to anything below theory
4691 * Logic image HOL-Main stops at theory Main, and thus facilitates
4692 experimentation due to shorter build times.
4694 * Logic image HOL-NSA contains theories of nonstandard analysis which
4695 were previously part of former HOL-Complex. Entry point Hyperreal
4696 remains valid, but theories formerly using Complex_Main should now use
4697 new entry point Hypercomplex.
4699 * Generic ATP manager for Sledgehammer, based on ML threads instead of
4700 Posix processes. Avoids potentially expensive forking of the ML
4701 process. New thread-based implementation also works on non-Unix
4702 platforms (Cygwin). Provers are no longer hardwired, but defined
4703 within the theory via plain ML wrapper functions. Basic Sledgehammer
4704 commands are covered in the isar-ref manual.
4706 * Wrapper scripts for remote SystemOnTPTP service allows to use
4707 sledgehammer without local ATP installation (Vampire etc.). Other
4708 provers may be included via suitable ML wrappers, see also
4709 src/HOL/ATP_Linkup.thy.
4711 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
4714 * The metis method no longer fails because the theorem is too trivial
4715 (contains the empty clause).
4717 * The metis method now fails in the usual manner, rather than raising
4718 an exception, if it determines that it cannot prove the theorem.
4720 * Method "coherent" implements a prover for coherent logic (see also
4721 src/Tools/coherent.ML).
4723 * Constants "undefined" and "default" replace "arbitrary". Usually
4724 "undefined" is the right choice to replace "arbitrary", though
4725 logically there is no difference. INCOMPATIBILITY.
4727 * Command "value" now integrates different evaluation mechanisms. The
4728 result of the first successful evaluation mechanism is printed. In
4729 square brackets a particular named evaluation mechanisms may be
4730 specified (currently, [SML], [code] or [nbe]). See further
4731 src/HOL/ex/Eval_Examples.thy.
4733 * Normalization by evaluation now allows non-leftlinear equations.
4734 Declare with attribute [code nbe].
4736 * Methods "case_tac" and "induct_tac" now refer to the very same rules
4737 as the structured Isar versions "cases" and "induct", cf. the
4738 corresponding "cases" and "induct" attributes. Mutual induction rules
4739 are now presented as a list of individual projections
4740 (e.g. foo_bar.inducts for types foo and bar); the old format with
4741 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
4742 rare situations a different rule is selected --- notably nested tuple
4743 elimination instead of former prod.exhaust: use explicit (case_tac t
4744 rule: prod.exhaust) here.
4746 * Attributes "cases", "induct", "coinduct" support "del" option.
4748 * Removed fact "case_split_thm", which duplicates "case_split".
4750 * The option datatype has been moved to a new theory Option. Renamed
4751 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
4753 * New predicate "strict_mono" classifies strict functions on partial
4754 orders. With strict functions on linear orders, reasoning about
4755 (in)equalities is facilitated by theorems "strict_mono_eq",
4756 "strict_mono_less_eq" and "strict_mono_less".
4758 * Some set operations are now proper qualified constants with
4759 authentic syntax. INCOMPATIBILITY:
4770 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
4773 * Auxiliary class "itself" has disappeared -- classes without any
4774 parameter are treated as expected by the 'class' command.
4776 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
4778 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
4779 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
4781 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
4782 method "approximation". It proves formulas on real values by using
4783 interval arithmetic. In the formulas are also the transcendental
4784 functions sin, cos, tan, atan, ln, exp and the constant pi are
4785 allowed. For examples see
4786 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
4788 * Theory "Reflection" now resides in HOL/Library.
4790 * Entry point to Word library now simply named "Word".
4793 * Made source layout more coherent with logical distribution
4796 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
4797 src/HOL/Library/Code_Message.thy ~> src/HOL/
4798 src/HOL/Library/GCD.thy ~> src/HOL/
4799 src/HOL/Library/Order_Relation.thy ~> src/HOL/
4800 src/HOL/Library/Parity.thy ~> src/HOL/
4801 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
4802 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
4803 src/HOL/Real/Lubs.thy ~> src/HOL/
4804 src/HOL/Real/PReal.thy ~> src/HOL/
4805 src/HOL/Real/Rational.thy ~> src/HOL/
4806 src/HOL/Real/RComplete.thy ~> src/HOL/
4807 src/HOL/Real/RealDef.thy ~> src/HOL/
4808 src/HOL/Real/RealPow.thy ~> src/HOL/
4809 src/HOL/Real/Real.thy ~> src/HOL/
4810 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
4811 src/HOL/Complex/Complex.thy ~> src/HOL/
4812 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
4813 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
4814 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
4815 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
4816 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
4817 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
4818 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
4819 src/HOL/Hyperreal/Log.thy ~> src/HOL/
4820 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
4821 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
4822 src/HOL/Hyperreal/Series.thy ~> src/HOL/
4823 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
4824 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
4825 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
4826 src/HOL/Real/Float ~> src/HOL/Library/
4827 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
4828 src/HOL/Real/RealVector.thy ~> src/HOL/
4830 src/HOL/arith_data.ML ~> src/HOL/Tools
4831 src/HOL/hologic.ML ~> src/HOL/Tools
4832 src/HOL/simpdata.ML ~> src/HOL/Tools
4833 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
4834 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
4835 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
4836 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
4837 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
4838 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
4839 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
4841 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
4842 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
4843 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
4844 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
4845 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
4846 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
4848 * If methods "eval" and "evaluation" encounter a structured proof
4849 state with !!/==>, only the conclusion is evaluated to True (if
4850 possible), avoiding strange error messages.
4852 * Method "sizechange" automates termination proofs using (a
4853 modification of) the size-change principle. Requires SAT solver. See
4854 src/HOL/ex/Termination.thy for examples.
4856 * Simplifier: simproc for let expressions now unfolds if bound
4857 variable occurs at most once in let expression body. INCOMPATIBILITY.
4859 * Method "arith": Linear arithmetic now ignores all inequalities when
4860 fast_arith_neq_limit is exceeded, instead of giving up entirely.
4862 * New attribute "arith" for facts that should always be used
4863 automatically by arithmetic. It is intended to be used locally in
4866 assumes [arith]: "x > 0"
4868 Global usage is discouraged because of possible performance impact.
4870 * New classes "top" and "bot" with corresponding operations "top" and
4871 "bot" in theory Orderings; instantiation of class "complete_lattice"
4872 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
4874 * Changed definition lemma "less_fun_def" in order to provide an
4875 instance for preorders on functions; use lemma "less_le" instead.
4878 * Theory Orderings: class "wellorder" moved here, with explicit
4879 induction rule "less_induct" as assumption. For instantiation of
4880 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
4883 * Theory Orderings: added class "preorder" as superclass of "order".
4884 INCOMPATIBILITY: Instantiation proofs for order, linorder
4885 etc. slightly changed. Some theorems named order_class.* now named
4888 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
4891 * Theory Finite_Set: added a new fold combinator of type
4893 ('a => 'b => 'b) => 'b => 'a set => 'b
4895 Occasionally this is more convenient than the old fold combinator
4896 which is now defined in terms of the new one and renamed to
4899 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
4900 and "ring_simps" have been replaced by "algebra_simps" (which can be
4901 extended with further lemmas!). At the moment both still exist but
4902 the former will disappear at some point.
4904 * Theory Power: Lemma power_Suc is now declared as a simp rule in
4905 class recpower. Type-specific simp rules for various recpower types
4906 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
4908 rat_power_0 -> power_0
4909 rat_power_Suc -> power_Suc
4910 realpow_0 -> power_0
4911 realpow_Suc -> power_Suc
4912 complexpow_0 -> power_0
4913 complexpow_Suc -> power_Suc
4914 power_poly_0 -> power_0
4915 power_poly_Suc -> power_Suc
4917 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
4918 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
4919 dvd has been generalized to class comm_semiring_1. Likewise a bunch
4920 of lemmas from Divides has been generalized from nat to class
4921 semiring_div. INCOMPATIBILITY. This involves the following theorem
4922 renames resulting from duplicate elimination:
4924 dvd_def_mod ~> dvd_eq_mod_eq_0
4925 zero_dvd_iff ~> dvd_0_left_iff
4926 dvd_0 ~> dvd_0_right
4927 DIVISION_BY_ZERO_DIV ~> div_by_0
4928 DIVISION_BY_ZERO_MOD ~> mod_by_0
4929 mult_div ~> div_mult_self2_is_id
4930 mult_mod ~> mod_mult_self2_is_0
4932 * Theory IntDiv: removed many lemmas that are instances of class-based
4933 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
4934 rename old lemmas as follows:
4936 dvd_diff -> nat_dvd_diff
4937 dvd_zminus_iff -> dvd_minus_iff
4938 mod_add1_eq -> mod_add_eq
4939 mod_mult1_eq -> mod_mult_right_eq
4940 mod_mult1_eq' -> mod_mult_left_eq
4941 mod_mult_distrib_mod -> mod_mult_eq
4942 nat_mod_add_left_eq -> mod_add_left_eq
4943 nat_mod_add_right_eq -> mod_add_right_eq
4944 nat_mod_div_trivial -> mod_div_trivial
4945 nat_mod_mod_trivial -> mod_mod_trivial
4946 zdiv_zadd_self1 -> div_add_self1
4947 zdiv_zadd_self2 -> div_add_self2
4948 zdiv_zmult_self1 -> div_mult_self2_is_id
4949 zdiv_zmult_self2 -> div_mult_self1_is_id
4950 zdvd_triv_left -> dvd_triv_left
4951 zdvd_triv_right -> dvd_triv_right
4952 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
4953 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
4954 zmod_zadd_left_eq -> mod_add_left_eq
4955 zmod_zadd_right_eq -> mod_add_right_eq
4956 zmod_zadd_self1 -> mod_add_self1
4957 zmod_zadd_self2 -> mod_add_self2
4958 zmod_zadd1_eq -> mod_add_eq
4959 zmod_zdiff1_eq -> mod_diff_eq
4960 zmod_zdvd_zmod -> mod_mod_cancel
4961 zmod_zmod_cancel -> mod_mod_cancel
4962 zmod_zmult_self1 -> mod_mult_self2_is_0
4963 zmod_zmult_self2 -> mod_mult_self1_is_0
4966 zdvd_abs1 -> abs_dvd_iff
4967 zdvd_abs2 -> dvd_abs_iff
4968 zdvd_refl -> dvd_refl
4969 zdvd_trans -> dvd_trans
4970 zdvd_zadd -> dvd_add
4971 zdvd_zdiff -> dvd_diff
4972 zdvd_zminus_iff -> dvd_minus_iff
4973 zdvd_zminus2_iff -> minus_dvd_iff
4974 zdvd_zmultD -> dvd_mult_right
4975 zdvd_zmultD2 -> dvd_mult_left
4976 zdvd_zmult_mono -> mult_dvd_mono
4977 zdvd_0_right -> dvd_0_right
4978 zdvd_0_left -> dvd_0_left_iff
4979 zdvd_1_left -> one_dvd
4980 zminus_dvd_iff -> minus_dvd_iff
4982 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
4984 * The real numbers offer decimal input syntax: 12.34 is translated
4985 into 1234/10^2. This translation is not reversed upon output.
4987 * Theory Library/Polynomial defines an abstract type 'a poly of
4988 univariate polynomials with coefficients of type 'a. In addition to
4989 the standard ring operations, it also supports div and mod. Code
4990 generation is also supported, using list-style constructors.
4992 * Theory Library/Inner_Product defines a class of real_inner for real
4993 inner product spaces, with an overloaded operation inner :: 'a => 'a
4994 => real. Class real_inner is a subclass of real_normed_vector from
4997 * Theory Library/Product_Vector provides instances for the product
4998 type 'a * 'b of several classes from RealVector and Inner_Product.
4999 Definitions of addition, subtraction, scalar multiplication, norms,
5000 and inner products are included.
5002 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
5003 addition to the field operations, numerals and case syntax are also
5006 * Theory Library/Diagonalize provides constructive version of Cantor's
5007 first diagonalization argument.
5009 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
5010 zlcm (for int); carried together from various gcd/lcm developements in
5011 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
5012 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
5013 may recover tupled syntax as follows:
5015 hide (open) const gcd
5016 abbreviation gcd where
5017 "gcd == (%(a, b). GCD.gcd a b)"
5019 GCD.gcd ("gcd '(_, _')")
5021 The same works for lcm, zgcd, zlcm.
5023 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
5024 instantiations for algebraic structures. Removed some duplicate
5025 theorems. Changes in simp rules. INCOMPATIBILITY.
5027 * ML antiquotation @{code} takes a constant as argument and generates
5028 corresponding code in background and inserts name of the corresponding
5029 resulting ML value/function/datatype constructor binding in place.
5030 All occurrences of @{code} with a single ML block are generated
5031 simultaneously. Provides a generic and safe interface for
5032 instrumentalizing code generation. See
5033 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
5034 In future you ought to refrain from ad-hoc compiling generated SML
5035 code on the ML toplevel. Note that (for technical reasons) @{code}
5036 cannot refer to constants for which user-defined serializations are
5037 set. Refer to the corresponding ML counterpart directly in that
5040 * Command 'rep_datatype': instead of theorem names the command now
5041 takes a list of terms denoting the constructors of the type to be
5042 represented as datatype. The characteristic theorems have to be
5043 proven. INCOMPATIBILITY. Also observe that the following theorems
5044 have disappeared in favour of existing ones:
5046 unit_induct ~> unit.induct
5047 prod_induct ~> prod.induct
5048 sum_induct ~> sum.induct
5049 Suc_Suc_eq ~> nat.inject
5050 Suc_not_Zero Zero_not_Suc ~> nat.distinct
5055 * New locales for orders and lattices where the equivalence relation
5056 is not restricted to equality. INCOMPATIBILITY: all order and lattice
5057 locales use a record structure with field eq for the equivalence.
5059 * New theory of factorial domains.
5061 * Units_l_inv and Units_r_inv are now simp rules by default.
5062 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
5063 and/or r_inv will now also require deletion of these lemmas.
5065 * Renamed the following theorems, INCOMPATIBILITY:
5067 UpperD ~> Upper_memD
5068 LowerD ~> Lower_memD
5069 least_carrier ~> least_closed
5070 greatest_carrier ~> greatest_closed
5071 greatest_Lower_above ~> greatest_Lower_below
5072 one_zero ~> carrier_one_zero
5073 one_not_zero ~> carrier_one_not_zero (collision with assumption)
5078 * Nominal datatypes can now contain type-variables.
5080 * Commands 'nominal_inductive' and 'equivariance' work with local
5083 * Nominal primrec can now works with local theory targets and its
5084 specification syntax now conforms to the general format as seen in
5087 * Method "perm_simp" honours the standard simplifier attributes
5088 (no_asm), (no_asm_use) etc.
5090 * The new predicate #* is defined like freshness, except that on the
5091 left hand side can be a set or list of atoms.
5093 * Experimental command 'nominal_inductive2' derives strong induction
5094 principles for inductive definitions. In contrast to
5095 'nominal_inductive', which can only deal with a fixed number of
5096 binders, it can deal with arbitrary expressions standing for sets of
5097 atoms to be avoided. The only inductive definition we have at the
5098 moment that needs this generalisation is the typing rule for Lets in
5101 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
5102 -----------------------------------------------------------------
5103 Gamma |- Let x be t1 in t2 : T2
5105 In this rule one wants to avoid all the binders that are introduced by
5106 "close Gamma T1". We are looking for other examples where this
5107 feature might be useful. Please let us know.
5112 * Reimplemented the simplification procedure for proving continuity
5113 subgoals. The new simproc is extensible; users can declare additional
5114 continuity introduction rules with the attribute [cont2cont].
5116 * The continuity simproc now uses a different introduction rule for
5117 solving continuity subgoals on terms with lambda abstractions. In
5118 some rare cases the new simproc may fail to solve subgoals that the
5119 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
5120 Potential INCOMPATIBILITY.
5122 * Command 'fixrec': specification syntax now conforms to the general
5123 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
5124 examples. INCOMPATIBILITY.
5129 * Proof of Zorn's Lemma for partial orders.
5134 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
5135 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
5136 depends on multithreading, so timouts will not work before Poly/ML
5139 * High-level support for concurrent ML programming, see
5140 src/Pure/Cuncurrent. The data-oriented model of "future values" is
5141 particularly convenient to organize independent functional
5142 computations. The concept of "synchronized variables" provides a
5143 higher-order interface for components with shared state, avoiding the
5144 delicate details of mutexes and condition variables. (Requires
5145 Poly/ML 5.2.1 or later.)
5147 * ML bindings produced via Isar commands are stored within the Isar
5148 context (theory or proof). Consequently, commands like 'use' and 'ML'
5149 become thread-safe and work with undo as expected (concerning
5150 top-level bindings, not side-effects on global references).
5151 INCOMPATIBILITY, need to provide proper Isar context when invoking the
5152 compiler at runtime; really global bindings need to be given outside a
5153 theory. (Requires Poly/ML 5.2 or later.)
5155 * Command 'ML_prf' is analogous to 'ML' but works within a proof
5156 context. Top-level ML bindings are stored within the proof context in
5157 a purely sequential fashion, disregarding the nested proof structure.
5158 ML bindings introduced by 'ML_prf' are discarded at the end of the
5159 proof. (Requires Poly/ML 5.2 or later.)
5161 * Simplified ML attribute and method setup, cf. functions Attrib.setup
5162 and Method.setup, as well as Isar commands 'attribute_setup' and
5163 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
5164 existing code accordingly, or use plain 'setup' together with old
5167 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
5168 to 'a -> thm, while results are always tagged with an authentic oracle
5169 name. The Isar command 'oracle' is now polymorphic, no argument type
5170 is specified. INCOMPATIBILITY, need to simplify existing oracle code
5171 accordingly. Note that extra performance may be gained by producing
5172 the cterm carefully, avoiding slow Thm.cterm_of.
5174 * Simplified interface for defining document antiquotations via
5175 ThyOutput.antiquotation, ThyOutput.output, and optionally
5176 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
5177 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
5180 * More systematic treatment of long names, abstract name bindings, and
5181 name space operations. Basic operations on qualified names have been
5182 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
5183 Long_Name.append. Old type bstring has been mostly replaced by
5184 abstract type binding (see structure Binding), which supports precise
5185 qualification by packages and local theory targets, as well as proper
5186 tracking of source positions. INCOMPATIBILITY, need to wrap old
5187 bstring values into Binding.name, or better pass through abstract
5188 bindings everywhere. See further src/Pure/General/long_name.ML,
5189 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
5191 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
5192 LocalTheory.note etc.) now refer to the *full* internal name, not the
5193 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
5195 * Disposed old type and term read functions (Sign.read_def_typ,
5196 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
5197 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
5198 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
5199 Syntax.read_term_global etc.; see also OldGoals.read_term as last
5200 resort for legacy applications.
5202 * Disposed old declarations, tactics, tactic combinators that refer to
5203 the simpset or claset of an implicit theory (such as Addsimps,
5204 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
5205 embedded ML text, or local_simpset_of with a proper context passed as
5206 explicit runtime argument.
5208 * Rules and tactics that read instantiations (read_instantiate,
5209 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
5210 context, which is required for parsing and type-checking. Moreover,
5211 the variables are specified as plain indexnames, not string encodings
5212 thereof. INCOMPATIBILITY.
5214 * Generic Toplevel.add_hook interface allows to analyze the result of
5215 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
5216 for theorem dependency output of transactions resulting in a new
5219 * ML antiquotations: block-structured compilation context indicated by
5220 \<lbrace> ... \<rbrace>; additional antiquotation forms:
5222 @{binding name} - basic name binding
5223 @{let ?pat = term} - term abbreviation (HO matching)
5224 @{note name = fact} - fact abbreviation
5225 @{thm fact} - singleton fact (with attributes)
5226 @{thms fact} - general fact (with attributes)
5227 @{lemma prop by method} - singleton goal
5228 @{lemma prop by meth1 meth2} - singleton goal
5229 @{lemma prop1 ... propN by method} - general goal
5230 @{lemma prop1 ... propN by meth1 meth2} - general goal
5231 @{lemma (open) ...} - open derivation
5236 * The Isabelle "emacs" tool provides a specific interface to invoke
5237 Proof General / Emacs, with more explicit failure if that is not
5238 installed (the old isabelle-interface script silently falls back on
5239 isabelle-process). The PROOFGENERAL_HOME setting determines the
5240 installation location of the Proof General distribution.
5242 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
5243 the Isabelle process into a JVM/Scala application. See
5244 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
5245 process wrapper has been discontinued.)
5247 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
5249 * Various status messages (with exact source position information) are
5250 emitted, if proper markup print mode is enabled. This allows
5251 user-interface components to provide detailed feedback on internal
5256 New in Isabelle2008 (June 2008)
5257 -------------------------------
5261 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
5262 and updated, with formally checked references as hyperlinks.
5264 * Theory loader: use_thy (and similar operations) no longer set the
5265 implicit ML context, which was occasionally hard to predict and in
5266 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
5267 provides a proper context already.
5269 * Theory loader: old-style ML proof scripts being *attached* to a thy
5270 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
5271 'use' within a theory file will do the job.
5273 * Name space merge now observes canonical order, i.e. the second space
5274 is inserted into the first one, while existing entries in the first
5275 space take precedence. INCOMPATIBILITY in rare situations, may try to
5276 swap theory imports.
5278 * Syntax: symbol \<chi> is now considered a letter. Potential
5279 INCOMPATIBILITY in identifier syntax etc.
5281 * Outer syntax: string tokens no longer admit escaped white space,
5282 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
5283 white space without escapes.
5285 * Outer syntax: string tokens may contain arbitrary character codes
5286 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
5292 * Context-dependent token translations. Default setup reverts locally
5293 fixed variables, and adds hilite markup for undeclared frees.
5295 * Unused theorems can be found using the new command 'unused_thms'.
5296 There are three ways of invoking it:
5299 Only finds unused theorems in the current theory.
5301 (2) unused_thms thy_1 ... thy_n -
5302 Finds unused theorems in the current theory and all of its ancestors,
5303 excluding the theories thy_1 ... thy_n and all of their ancestors.
5305 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
5306 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
5307 their ancestors, excluding the theories thy_1 ... thy_n and all of
5310 In order to increase the readability of the list produced by
5311 unused_thms, theorems that have been created by a particular instance
5312 of a theory command such as 'inductive' or 'function' are considered
5313 to belong to the same "group", meaning that if at least one theorem in
5314 this group is used, the other theorems in the same group are no longer
5315 reported as unused. Moreover, if all theorems in the group are
5316 unused, only one theorem in the group is displayed.
5318 Note that proof objects have to be switched on in order for
5319 unused_thms to work properly (i.e. !proofs must be >= 1, which is
5320 usually the case when using Proof General with the default settings).
5322 * Authentic naming of facts disallows ad-hoc overwriting of previous
5323 theorems within the same name space. INCOMPATIBILITY, need to remove
5324 duplicate fact bindings, or even accidental fact duplications. Note
5325 that tools may maintain dynamically scoped facts systematically, using
5326 PureThy.add_thms_dynamic.
5328 * Command 'hide' now allows to hide from "fact" name space as well.
5330 * Eliminated destructive theorem database, simpset, claset, and
5331 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
5332 update of theories within ML code.
5334 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
5335 INCOMPATIBILITY, object-logics depending on former Pure require
5336 additional setup PureThy.old_appl_syntax_setup; object-logics
5337 depending on former CPure need to refer to Pure.
5339 * Commands 'use' and 'ML' are now purely functional, operating on
5340 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
5341 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
5344 * Command 'setup': discontinued implicit version with ML reference.
5346 * Instantiation target allows for simultaneous specification of class
5347 instance operations together with an instantiation proof.
5348 Type-checking phase allows to refer to class operations uniformly.
5349 See src/HOL/Complex/Complex.thy for an Isar example and
5350 src/HOL/Library/Eval.thy for an ML example.
5352 * Indexing of literal facts: be more serious about including only
5353 facts from the visible specification/proof context, but not the
5354 background context (locale etc.). Affects `prop` notation and method
5355 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
5358 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
5359 "(open)" option, which used to expose internal bound variables to the
5362 * Isar statements: removed obsolete case "rule_context".
5363 INCOMPATIBILITY, better use explicit fixes/assumes.
5365 * Locale proofs: default proof step now includes 'unfold_locales';
5366 hence 'proof' without argument may be used to unfold locale
5370 *** Document preparation ***
5372 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
5373 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
5374 obsolete thumbpdf setup (contemporary PDF viewers do this on the
5375 spot); renamed link color from "darkblue" to "linkcolor" (default
5376 value unchanged, can be redefined via \definecolor); no longer sets
5377 "a4paper" option (unnecessary or even intrusive).
5379 * Antiquotation @{lemma A method} proves proposition A by the given
5380 method (either a method name or a method name plus (optional) method
5381 arguments in parentheses) and prints A just like @{prop A}.
5386 * New primrec package. Specification syntax conforms in style to
5387 definition/function/.... No separate induction rule is provided. The
5388 "primrec" command distinguishes old-style and new-style specifications
5389 by syntax. The former primrec package is now named OldPrimrecPackage.
5390 When adjusting theories, beware: constants stemming from new-style
5391 primrec specifications have authentic syntax.
5393 * Metis prover is now an order of magnitude faster, and also works
5394 with multithreading.
5396 * Metis: the maximum number of clauses that can be produced from a
5397 theorem is now given by the attribute max_clauses. Theorems that
5398 exceed this number are ignored, with a warning printed.
5400 * Sledgehammer no longer produces structured proofs by default. To
5401 enable, declare [[sledgehammer_full = true]]. Attributes
5402 reconstruction_modulus, reconstruction_sorts renamed
5403 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
5405 * Method "induct_scheme" derives user-specified induction rules
5406 from well-founded induction and completeness of patterns. This factors
5407 out some operations that are done internally by the function package
5408 and makes them available separately. See
5409 src/HOL/ex/Induction_Scheme.thy for examples.
5411 * More flexible generation of measure functions for termination
5412 proofs: Measure functions can be declared by proving a rule of the
5413 form "is_measure f" and giving it the [measure_function] attribute.
5414 The "is_measure" predicate is logically meaningless (always true), and
5415 just guides the heuristic. To find suitable measure functions, the
5416 termination prover sets up the goal "is_measure ?f" of the appropriate
5417 type and generates all solutions by prolog-style backwards proof using
5420 This setup also deals with rules like
5422 "is_measure f ==> is_measure (list_size f)"
5424 which accommodates nested datatypes that recurse through lists.
5425 Similar rules are predeclared for products and option types.
5427 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
5431 - Definitions of overloaded constants on sets have to be replaced by
5432 definitions on => and bool.
5434 - Some definitions of overloaded operators on sets can now be proved
5435 using the definitions of the operators on => and bool. Therefore,
5436 the following theorems have been renamed:
5438 subset_def -> subset_eq
5439 psubset_def -> psubset_eq
5440 set_diff_def -> set_diff_eq
5441 Compl_def -> Compl_eq
5442 Sup_set_def -> Sup_set_eq
5443 Inf_set_def -> Inf_set_eq
5444 sup_set_def -> sup_set_eq
5445 inf_set_def -> inf_set_eq
5447 - Due to the incompleteness of the HO unification algorithm, some
5448 rules such as subst may require manual instantiation, if some of
5449 the unknowns in the rule is a set.
5451 - Higher order unification and forward proofs:
5454 have "P (S::'a set)" <...>
5455 then have "EX S. P S" ..
5457 no longer works (due to the incompleteness of the HO unification
5458 algorithm) and must be replaced by the pattern
5465 - Calculational reasoning with subst (or similar rules):
5468 have "P (S::'a set)" <...>
5469 also have "S = T" <...>
5470 finally have "P T" .
5472 no longer works (for similar reasons as the previous example) and
5473 must be replaced by something like
5475 have "P (S::'a set)" <...>
5476 moreover have "S = T" <...>
5477 ultimately have "P T" by simp
5479 - Tactics or packages written in ML code:
5480 Code performing pattern matching on types via
5482 Type ("set", [T]) => ...
5484 must be rewritten. Moreover, functions like strip_type or
5485 binder_types no longer return the right value when applied to a
5488 T1 => ... => Tn => U => bool
5492 T1 => ... => Tn => U set
5494 * Merged theories Wellfounded_Recursion, Accessible_Part and
5495 Wellfounded_Relations to theory Wellfounded.
5497 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
5499 * Class finite no longer treats UNIV as class parameter. Use class
5500 enum from theory Library/Enum instead to achieve a similar effect.
5503 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
5504 and "Cons". INCOMPATIBILITY.
5506 * HOL (and FOL): renamed variables in rules imp_elim and swap.
5507 Potential INCOMPATIBILITY.
5509 * Theory Product_Type: duplicated lemmas split_Pair_apply and
5510 injective_fst_snd removed, use split_eta and prod_eqI instead.
5511 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
5513 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
5514 the same name in theory Orderings:
5524 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
5525 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
5526 and different variable names.
5528 * Library/Option_ord.thy: Canonical order on option type.
5530 * Library/RBT.thy: Red-black trees, an efficient implementation of
5533 * Library/Countable.thy: Type class for countable types.
5535 * Theory Int: The representation of numerals has changed. The infix
5536 operator BIT and the bit datatype with constructors B0 and B1 have
5537 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
5538 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
5539 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
5542 * Theory Nat: definition of <= and < on natural numbers no longer
5543 depend on well-founded relations. INCOMPATIBILITY. Definitions
5544 le_def and less_def have disappeared. Consider lemmas not_less
5545 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
5547 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
5548 (whose purpose mainly is for various fold_set functionals) have been
5549 abandoned in favor of the existing algebraic classes
5550 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
5551 lower_semilattice (resp. upper_semilattice) and linorder.
5554 * Theory Transitive_Closure: induct and cases rules now declare proper
5555 case_names ("base" and "step"). INCOMPATIBILITY.
5557 * Theorem Inductive.lfp_ordinal_induct generalized to complete
5558 lattices. The form set-specific version is available as
5559 Inductive.lfp_ordinal_induct_set.
5561 * Renamed theorems "power.simps" to "power_int.simps".
5564 * Class semiring_div provides basic abstract properties of semirings
5565 with division and modulo operations. Subsumes former class dvd_mod.
5567 * Merged theories IntDef, Numeral and IntArith into unified theory
5568 Int. INCOMPATIBILITY.
5570 * Theory Library/Code_Index: type "index" now represents natural
5571 numbers rather than integers. INCOMPATIBILITY.
5573 * New class "uminus" with operation "uminus" (split of from class
5574 "minus" which now only has operation "minus", binary).
5577 * Constants "card", "internal_split", "option_map" now with authentic
5578 syntax. INCOMPATIBILITY.
5580 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
5581 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
5582 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
5583 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
5584 Sup_set_def, le_def, less_def, option_map_def now with object
5585 equality. INCOMPATIBILITY.
5587 * Records. Removed K_record, and replaced it by pure lambda term
5588 %x. c. The simplifier setup is now more robust against eta expansion.
5589 INCOMPATIBILITY: in cases explicitly referring to K_record.
5591 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
5593 * Library/ListVector: new theory of arithmetic vector operations.
5595 * Library/Order_Relation: new theory of various orderings as sets of
5596 pairs. Defines preorders, partial orders, linear orders and
5597 well-orders on sets and on types.
5602 * Renamed some theories to allow to loading both ZF and HOL in the
5605 Datatype -> Datatype_ZF
5606 Inductive -> Inductive_ZF
5613 INCOMPATIBILITY: ZF theories that import individual theories below
5614 Main might need to be adapted. Regular theory Main is still
5615 available, as trivial extension of Main_ZF.
5620 * ML within Isar: antiquotation @{const name} or @{const
5621 name(typargs)} produces statically-checked Const term.
5623 * Functor NamedThmsFun: data is available to the user as dynamic fact
5624 (of the same name). Removed obsolete print command.
5626 * Removed obsolete "use_legacy_bindings" function.
5628 * The ``print mode'' is now a thread-local value derived from a global
5629 template (the former print_mode reference), thus access becomes
5630 non-critical. The global print_mode reference is for session
5631 management only; user-code should use print_mode_value,
5632 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
5634 * Functions system/system_out provide a robust way to invoke external
5635 shell commands, with propagation of interrupts (requires Poly/ML
5636 5.2.1). Do not use OS.Process.system etc. from the basis library!
5641 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
5642 in accordance with Proof General 3.7, which prefers GNU emacs.
5644 * isatool tty runs Isabelle process with plain tty interaction;
5645 optional line editor may be specified via ISABELLE_LINE_EDITOR
5646 setting, the default settings attempt to locate "ledit" and "rlwrap".
5648 * isatool browser now works with Cygwin as well, using general
5649 "javapath" function defined in Isabelle process environment.
5651 * YXML notation provides a simple and efficient alternative to
5652 standard XML transfer syntax. See src/Pure/General/yxml.ML and
5653 isatool yxml as described in the Isabelle system manual.
5655 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
5656 provides general wrapper for managing an Isabelle process in a robust
5657 fashion, with ``cooked'' output from stdin/stderr.
5659 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
5660 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
5662 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
5663 way of changing the user's settings is via
5664 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
5667 * Multithreading.max_threads := 0 refers to the number of actual CPU
5668 cores of the underlying machine, which is a good starting point for
5669 optimal performance tuning. The corresponding usedir option -M allows
5670 "max" as an alias for "0". WARNING: does not work on certain versions
5671 of Mac OS (with Poly/ML 5.1).
5673 * isabelle-process: non-ML sessions are run with "nice", to reduce the
5674 adverse effect of Isabelle flooding interactive front-ends (notably
5675 ProofGeneral / XEmacs).
5679 New in Isabelle2007 (November 2007)
5680 -----------------------------------
5684 * More uniform information about legacy features, notably a
5685 warning/error of "Legacy feature: ...", depending on the state of the
5686 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
5687 legacy features will disappear eventually.
5689 * Theory syntax: the header format ``theory A = B + C:'' has been
5690 discontinued in favour of ``theory A imports B C begin''. Use isatool
5691 fixheaders to convert existing theory files. INCOMPATIBILITY.
5693 * Theory syntax: the old non-Isar theory file format has been
5694 discontinued altogether. Note that ML proof scripts may still be used
5695 with Isar theories; migration is usually quite simple with the ML
5696 function use_legacy_bindings. INCOMPATIBILITY.
5698 * Theory syntax: some popular names (e.g. 'class', 'declaration',
5699 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
5702 * Theory loader: be more serious about observing the static theory
5703 header specifications (including optional directories), but not the
5704 accidental file locations of previously successful loads. The strict
5705 update policy of former update_thy is now already performed by
5706 use_thy, so the former has been removed; use_thys updates several
5707 theories simultaneously, just as 'imports' within a theory header
5708 specification, but without merging the results. Potential
5709 INCOMPATIBILITY: may need to refine theory headers and commands
5710 ROOT.ML which depend on load order.
5712 * Theory loader: optional support for content-based file
5713 identification, instead of the traditional scheme of full physical
5714 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
5715 (cf. the system manual). The new scheme allows to work with
5716 non-finished theories in persistent session images, such that source
5717 files may be moved later on without requiring reloads.
5719 * Theory loader: old-style ML proof scripts being *attached* to a thy
5720 file (with the same base name as the theory) are considered a legacy
5721 feature, which will disappear eventually. Even now, the theory loader
5722 no longer maintains dependencies on such files.
5724 * Syntax: the scope for resolving ambiguities via type-inference is
5725 now limited to individual terms, instead of whole simultaneous
5726 specifications as before. This greatly reduces the complexity of the
5727 syntax module and improves flexibility by separating parsing and
5728 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
5729 'fixes' etc.) are required in rare situations.
5731 * Syntax: constants introduced by new-style packages ('definition',
5732 'abbreviation' etc.) are passed through the syntax module in
5733 ``authentic mode''. This means that associated mixfix annotations
5734 really stick to such constants, independently of potential name space
5735 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
5736 trees are represented slightly differently, may need to adapt syntax
5737 translations accordingly. Use CONST marker in 'translations' and
5738 @{const_syntax} antiquotation in 'parse_translation' etc.
5740 * Legacy goal package: reduced interface to the bare minimum required
5741 to keep existing proof scripts running. Most other user-level
5742 functions are now part of the OldGoals structure, which is *not* open
5743 by default (consider isatool expandshort before open OldGoals).
5744 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
5745 these tend to cause confusion about the actual goal (!) context being
5746 used here, which is not necessarily the same as the_context().
5748 * Command 'find_theorems': supports "*" wild-card in "name:"
5749 criterion; "with_dups" option. Certain ProofGeneral versions might
5750 support a specific search form (see ProofGeneral/CHANGES).
5752 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
5753 by default, which means that "prems" (and also "fixed variables") are
5754 suppressed from proof state output. Note that the ProofGeneral
5755 settings mechanism allows to change and save options persistently, but
5756 older versions of Isabelle will fail to start up if a negative prems
5759 * Local theory targets may be specified by non-nested blocks of
5760 ``context/locale/class ... begin'' followed by ``end''. The body may
5761 contain definitions, theorems etc., including any derived mechanism
5762 that has been implemented on top of these primitives. This concept
5763 generalizes the existing ``theorem (in ...)'' towards more versatility
5766 * Proof General interface: proper undo of final 'end' command;
5767 discontinued Isabelle/classic mode (ML proof scripts).
5770 *** Document preparation ***
5772 * Added antiquotation @{theory name} which prints the given name,
5773 after checking that it refers to a valid ancestor theory in the
5776 * Added antiquotations @{ML_type text} and @{ML_struct text} which
5777 check the given source text as ML type/structure, printing verbatim.
5779 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
5780 "c args == rhs" given in the current context. (Any number of
5781 arguments may be given on the LHS.)
5786 * The 'class' package offers a combination of axclass and locale to
5787 achieve Haskell-like type classes in Isabelle. Definitions and
5788 theorems within a class context produce both relative results (with
5789 implicit parameters according to the locale context), and polymorphic
5790 constants with qualified polymorphism (according to the class
5791 context). Within the body context of a 'class' target, a separate
5792 syntax layer ("user space type system") takes care of converting
5793 between global polymorphic consts and internal locale representation.
5794 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
5795 "isatool doc classes" provides a tutorial.
5797 * Generic code generator framework allows to generate executable
5798 code for ML and Haskell (including Isabelle classes). A short usage
5801 internal compilation:
5802 export_code <list of constants (term syntax)> in SML
5803 writing SML code to a file:
5804 export_code <list of constants (term syntax)> in SML <filename>
5805 writing OCaml code to a file:
5806 export_code <list of constants (term syntax)> in OCaml <filename>
5807 writing Haskell code to a bunch of files:
5808 export_code <list of constants (term syntax)> in Haskell <filename>
5810 evaluating closed propositions to True/False using code generation:
5813 Reasonable default setup of framework in HOL.
5815 Theorem attributs for selecting and transforming function equations theorems:
5817 [code fun]: select a theorem as function equation for a specific constant
5818 [code fun del]: deselect a theorem as function equation for a specific constant
5819 [code inline]: select an equation theorem for unfolding (inlining) in place
5820 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
5822 User-defined serializations (target in {SML, OCaml, Haskell}):
5824 code_const <and-list of constants (term syntax)>
5825 {(target) <and-list of const target syntax>}+
5827 code_type <and-list of type constructors>
5828 {(target) <and-list of type target syntax>}+
5830 code_instance <and-list of instances>
5832 where instance ::= <type constructor> :: <class>
5834 code_class <and_list of classes>
5835 {(target) <and-list of class target syntax>}+
5836 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
5838 code_instance and code_class only are effective to target Haskell.
5840 For example usage see src/HOL/ex/Codegenerator.thy and
5841 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
5842 generation from Isabelle/HOL theories is available via "isatool doc
5845 * Code generator: consts in 'consts_code' Isar commands are now
5846 referred to by usual term syntax (including optional type
5849 * Command 'no_translations' removes translation rules from theory
5852 * Overloaded definitions are now actually checked for acyclic
5853 dependencies. The overloading scheme is slightly more general than
5854 that of Haskell98, although Isabelle does not demand an exact
5855 correspondence to type class and instance declarations.
5856 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
5857 exotic versions of overloading -- at the discretion of the user!
5859 Polymorphic constants are represented via type arguments, i.e. the
5860 instantiation that matches an instance against the most general
5861 declaration given in the signature. For example, with the declaration
5862 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
5863 as c(nat). Overloading is essentially simultaneous structural
5864 recursion over such type arguments. Incomplete specification patterns
5865 impose global constraints on all occurrences, e.g. c('a * 'a) on the
5866 LHS means that more general c('a * 'b) will be disallowed on any RHS.
5867 Command 'print_theory' outputs the normalized system of recursive
5868 equations, see section "definitions".
5870 * Configuration options are maintained within the theory or proof
5871 context (with name and type bool/int/string), providing a very simple
5872 interface to a poor-man's version of general context data. Tools may
5873 declare options in ML (e.g. using Attrib.config_int) and then refer to
5874 these values using Config.get etc. Users may change options via an
5875 associated attribute of the same name. This form of context
5876 declaration works particularly well with commands 'declare' or
5877 'using', for example ``declare [[foo = 42]]''. Thus it has become
5878 very easy to avoid global references, which would not observe Isar
5879 toplevel undo/redo and fail to work with multithreading.
5881 Various global ML references of Pure and HOL have been turned into
5882 configuration options:
5884 Unify.search_bound unify_search_bound
5885 Unify.trace_bound unify_trace_bound
5886 Unify.trace_simp unify_trace_simp
5887 Unify.trace_types unify_trace_types
5888 Simplifier.simp_depth_limit simp_depth_limit
5889 Blast.depth_limit blast_depth_limit
5890 DatatypeProp.dtK datatype_distinctness_limit
5891 fast_arith_neq_limit fast_arith_neq_limit
5892 fast_arith_split_limit fast_arith_split_limit
5894 * Named collections of theorems may be easily installed as context
5895 data using the functor NamedThmsFun (see also
5896 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
5897 attributes; there is also a toplevel print command. This facility is
5898 just a common case of general context data, which is the preferred way
5899 for anything more complex than just a list of facts in canonical
5902 * Isar: command 'declaration' augments a local theory by generic
5903 declaration functions written in ML. This enables arbitrary content
5904 being added to the context, depending on a morphism that tells the
5905 difference of the original declaration context wrt. the application
5906 context encountered later on.
5908 * Isar: proper interfaces for simplification procedures. Command
5909 'simproc_setup' declares named simprocs (with match patterns, and body
5910 text in ML). Attribute "simproc" adds/deletes simprocs in the current
5911 context. ML antiquotation @{simproc name} retrieves named simprocs.
5913 * Isar: an extra pair of brackets around attribute declarations
5914 abbreviates a theorem reference involving an internal dummy fact,
5915 which will be ignored later --- only the effect of the attribute on
5916 the background context will persist. This form of in-place
5917 declarations is particularly useful with commands like 'declare' and
5918 'using', for example ``have A using [[simproc a]] by simp''.
5920 * Isar: method "assumption" (and implicit closing of subproofs) now
5921 takes simple non-atomic goal assumptions into account: after applying
5922 an assumption as a rule the resulting subgoals are solved by atomic
5923 assumption steps. This is particularly useful to finish 'obtain'
5924 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
5925 without referring to the original premise "!!x. P x ==> thesis" in the
5926 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
5929 * Isar: implicit use of prems from the Isar proof context is
5930 considered a legacy feature. Common applications like ``have A .''
5931 may be replaced by ``have A by fact'' or ``note `A`''. In general,
5932 referencing facts explicitly here improves readability and
5933 maintainability of proof texts.
5935 * Isar: improper proof element 'guess' is like 'obtain', but derives
5936 the obtained context from the course of reasoning! For example:
5938 assume "EX x y. A x & B y" -- "any previous fact"
5939 then guess x and y by clarify
5941 This technique is potentially adventurous, depending on the facts and
5942 proof tools being involved here.
5944 * Isar: known facts from the proof context may be specified as literal
5945 propositions, using ASCII back-quote syntax. This works wherever
5946 named facts used to be allowed so far, in proof commands, proof
5947 methods, attributes etc. Literal facts are retrieved from the context
5948 according to unification of type and term parameters. For example,
5949 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
5950 theorems in the current context, then these are valid literal facts:
5951 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
5953 There is also a proof method "fact" which does the same composition
5954 for explicit goal states, e.g. the following proof texts coincide with
5955 certain special cases of literal facts:
5957 have "A" by fact == note `A`
5958 have "A ==> B" by fact == note `A ==> B`
5959 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
5960 have "P a ==> Q a" by fact == note `P a ==> Q a`
5962 * Isar: ":" (colon) is no longer a symbolic identifier character in
5963 outer syntax. Thus symbolic identifiers may be used without
5964 additional white space in declarations like this: ``assume *: A''.
5966 * Isar: 'print_facts' prints all local facts of the current context,
5967 both named and unnamed ones.
5969 * Isar: 'def' now admits simultaneous definitions, e.g.:
5971 def x == "t" and y == "u"
5973 * Isar: added command 'unfolding', which is structurally similar to
5974 'using', but affects both the goal state and facts by unfolding given
5975 rewrite rules. Thus many occurrences of the 'unfold' method or
5976 'unfolded' attribute may be replaced by first-class proof text.
5978 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
5979 and command 'unfolding' now all support object-level equalities
5980 (potentially conditional). The underlying notion of rewrite rule is
5981 analogous to the 'rule_format' attribute, but *not* that of the
5982 Simplifier (which is usually more generous).
5984 * Isar: the new attribute [rotated n] (default n = 1) rotates the
5985 premises of a theorem by n. Useful in conjunction with drule.
5987 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
5988 method expression within a sandbox consisting of the first N
5989 sub-goals, which need to exist. For example, ``simp_all [3]''
5990 simplifies the first three sub-goals, while (rule foo, simp_all)[]
5991 simplifies all new goals that emerge from applying rule foo to the
5992 originally first one.
5994 * Isar: schematic goals are no longer restricted to higher-order
5995 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
5998 * Isar: the conclusion of a long theorem statement is now either
5999 'shows' (a simultaneous conjunction, as before), or 'obtains'
6000 (essentially a disjunction of cases with local parameters and
6001 assumptions). The latter allows to express general elimination rules
6002 adequately; in this notation common elimination rules look like this:
6004 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
6006 obtains x where "P x"
6008 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
6012 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
6018 The subsequent classical rules even refer to the formal "thesis"
6021 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
6024 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
6025 obtains "thesis ==> something"
6027 The actual proof of an 'obtains' statement is analogous to that of the
6028 Isar proof element 'obtain', only that there may be several cases.
6029 Optional case names may be specified in parentheses; these will be
6030 available both in the present proof and as annotations in the
6031 resulting rule, for later use with the 'cases' method (cf. attribute
6034 * Isar: the assumptions of a long theorem statement are available as
6035 "assms" fact in the proof context. This is more appropriate than the
6036 (historical) "prems", which refers to all assumptions of the current
6037 context, including those from the target locale, proof body etc.
6039 * Isar: 'print_statement' prints theorems from the current theory or
6040 proof context in long statement form, according to the syntax of a
6043 * Isar: 'obtain' takes an optional case name for the local context
6044 introduction rule (default "that").
6046 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
6047 explicit (is "_ ==> ?foo") in the rare cases where this still happens
6050 * Pure: syntax "CONST name" produces a fully internalized constant
6051 according to the current context. This is particularly useful for
6052 syntax translations that should refer to internal constant
6053 representations independently of name spaces.
6055 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
6056 instead of "FOO ". This allows multiple binder declarations to coexist
6057 in the same context. INCOMPATIBILITY.
6059 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
6060 primitive that also works in a locale context (both for constants and
6061 fixed variables). Type declaration and internal syntactic representation
6062 of given constants retrieved from the context. Likewise, the
6063 'no_notation' command allows to remove given syntax annotations from the
6066 * Isar/locales: new derived specification elements 'axiomatization',
6067 'definition', 'abbreviation', which support type-inference, admit
6068 object-level specifications (equality, equivalence). See also the
6069 isar-ref manual. Examples:
6072 eq (infix "===" 50) where
6073 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
6075 definition "f x y = x + y + 1"
6076 definition g where "g x = f x x"
6079 neq (infix "=!=" 50) where
6080 "x =!= y == ~ (x === y)"
6082 These specifications may be also used in a locale context. Then the
6083 constants being introduced depend on certain fixed parameters, and the
6084 constant name is qualified by the locale base name. An internal
6085 abbreviation takes care for convenient input and output, making the
6086 parameters implicit and using the original short name. See also
6087 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
6088 entities from a monomorphic theory.
6090 Presently, abbreviations are only available 'in' a target locale, but
6091 not inherited by general import expressions. Also note that
6092 'abbreviation' may be used as a type-safe replacement for 'syntax' +
6093 'translations' in common applications. The "no_abbrevs" print mode
6094 prevents folding of abbreviations in term output.
6096 Concrete syntax is attached to specified constants in internal form,
6097 independently of name spaces. The parse tree representation is
6098 slightly different -- use 'notation' instead of raw 'syntax', and
6099 'translations' with explicit "CONST" markup to accommodate this.
6101 * Pure/Isar: unified syntax for new-style specification mechanisms
6102 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
6103 full type inference and dummy patterns ("_"). For example:
6105 definition "K x _ = x"
6107 inductive conj for A B
6108 where "A ==> B ==> conj A B"
6110 * Pure: command 'print_abbrevs' prints all constant abbreviations of
6111 the current context. Print mode "no_abbrevs" prevents inversion of
6112 abbreviations on output.
6114 * Isar/locales: improved parameter handling: use of locales "var" and
6115 "struct" no longer necessary; - parameter renamings are no longer
6116 required to be injective. For example, this allows to define
6117 endomorphisms as locale endom = homom mult mult h.
6119 * Isar/locales: changed the way locales with predicates are defined.
6120 Instead of accumulating the specification, the imported expression is
6121 now an interpretation. INCOMPATIBILITY: different normal form of
6122 locale expressions. In particular, in interpretations of locales with
6123 predicates, goals repesenting already interpreted fragments are not
6124 removed automatically. Use methods `intro_locales' and
6125 `unfold_locales'; see below.
6127 * Isar/locales: new methods `intro_locales' and `unfold_locales'
6128 provide backward reasoning on locales predicates. The methods are
6129 aware of interpretations and discharge corresponding goals.
6130 `intro_locales' is less aggressive then `unfold_locales' and does not
6131 unfold predicates to assumptions.
6133 * Isar/locales: the order in which locale fragments are accumulated
6134 has changed. This enables to override declarations from fragments due
6135 to interpretations -- for example, unwanted simp rules.
6137 * Isar/locales: interpretation in theories and proof contexts has been
6138 extended. One may now specify (and prove) equations, which are
6139 unfolded in interpreted theorems. This is useful for replacing
6140 defined concepts (constants depending on locale parameters) by
6141 concepts already existing in the target context. Example:
6143 interpretation partial_order ["op <= :: [int, int] => bool"]
6144 where "partial_order.less (op <=) (x::int) y = (x < y)"
6146 Typically, the constant `partial_order.less' is created by a
6147 definition specification element in the context of locale
6150 * Method "induct": improved internal context management to support
6151 local fixes and defines on-the-fly. Thus explicit meta-level
6152 connectives !! and ==> are rarely required anymore in inductive goals
6153 (using object-logic connectives for this purpose has been long
6154 obsolete anyway). Common proof patterns are explained in
6155 src/HOL/Induct/Common_Patterns.thy, see also
6156 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
6159 * Method "induct": improved handling of simultaneous goals. Instead of
6160 introducing object-level conjunction, the statement is now split into
6161 several conclusions, while the corresponding symbolic cases are nested
6162 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
6163 see src/HOL/Induct/Common_Patterns.thy, for example.
6165 * Method "induct": mutual induction rules are now specified as a list
6166 of rule sharing the same induction cases. HOL packages usually provide
6167 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
6168 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
6169 mutual induction rules differently, i.e. like this:
6171 (induct rule: foo_bar.inducts)
6172 (induct set: foo bar)
6173 (induct pred: foo bar)
6174 (induct type: foo bar)
6176 The ML function ProjectRule.projections turns old-style rules into the
6179 * Method "coinduct": dual of induction, see
6180 src/HOL/Library/Coinductive_List.thy for various examples.
6182 * Method "cases", "induct", "coinduct": the ``(open)'' option is
6183 considered a legacy feature.
6185 * Attribute "symmetric" produces result with standardized schematic
6186 variables (index 0). Potential INCOMPATIBILITY.
6188 * Simplifier: by default the simplifier trace only shows top level
6189 rewrites now. That is, trace_simp_depth_limit is set to 1 by
6190 default. Thus there is less danger of being flooded by the trace. The
6191 trace indicates where parts have been suppressed.
6193 * Provers/classical: removed obsolete classical version of elim_format
6194 attribute; classical elim/dest rules are now treated uniformly when
6195 manipulating the claset.
6197 * Provers/classical: stricter checks to ensure that supplied intro,
6198 dest and elim rules are well-formed; dest and elim rules must have at
6201 * Provers/classical: attributes dest/elim/intro take an optional
6202 weight argument for the rule (just as the Pure versions). Weights are
6203 ignored by automated tools, but determine the search order of single
6206 * Syntax: input syntax now supports dummy variable binding "%_. b",
6207 where the body does not mention the bound variable. Note that dummy
6208 patterns implicitly depend on their context of bounds, which makes
6209 "{_. _}" match any set comprehension as expected. Potential
6210 INCOMPATIBILITY -- parse translations need to cope with syntactic
6211 constant "_idtdummy" in the binding position.
6213 * Syntax: removed obsolete syntactic constant "_K" and its associated
6214 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
6215 for example "A -> B" => "Pi A (%_. B)".
6217 * Pure: 'class_deps' command visualizes the subclass relation, using
6218 the graph browser tool.
6220 * Pure: 'print_theory' now suppresses certain internal declarations by
6221 default; use '!' option for full details.
6226 * Method "metis" proves goals by applying the Metis general-purpose
6227 resolution prover (see also http://gilith.com/software/metis/).
6228 Examples are in the directory MetisExamples. WARNING: the
6229 Isabelle/HOL-Metis integration does not yet work properly with
6232 * Command 'sledgehammer' invokes external automatic theorem provers as
6233 background processes. It generates calls to the "metis" method if
6234 successful. These can be pasted into the proof. Users do not have to
6235 wait for the automatic provers to return. WARNING: does not really
6236 work with multi-threading.
6238 * New "auto_quickcheck" feature tests outermost goal statements for
6239 potential counter-examples. Controlled by ML references
6240 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
6241 5000 milliseconds). Fails silently if statements is outside of
6242 executable fragment, or any other codgenerator problem occurs.
6244 * New constant "undefined" with axiom "undefined x = undefined".
6246 * Added class "HOL.eq", allowing for code generation with polymorphic
6249 * Some renaming of class constants due to canonical name prefixing in
6250 the new 'class' package:
6252 HOL.abs ~> HOL.abs_class.abs
6253 HOL.divide ~> HOL.divide_class.divide
6254 0 ~> HOL.zero_class.zero
6255 1 ~> HOL.one_class.one
6256 op + ~> HOL.plus_class.plus
6257 op - ~> HOL.minus_class.minus
6258 uminus ~> HOL.minus_class.uminus
6259 op * ~> HOL.times_class.times
6260 op < ~> HOL.ord_class.less
6261 op <= > HOL.ord_class.less_eq
6262 Nat.power ~> Power.power_class.power
6263 Nat.size ~> Nat.size_class.size
6264 Numeral.number_of ~> Numeral.number_class.number_of
6265 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
6266 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
6267 Orderings.min ~> Orderings.ord_class.min
6268 Orderings.max ~> Orderings.ord_class.max
6269 Divides.op div ~> Divides.div_class.div
6270 Divides.op mod ~> Divides.div_class.mod
6271 Divides.op dvd ~> Divides.div_class.dvd
6273 INCOMPATIBILITY. Adaptions may be required in the following cases:
6275 a) User-defined constants using any of the names "plus", "minus",
6276 "times", "less" or "less_eq". The standard syntax translations for
6277 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
6280 b) Variables named "plus", "minus", "times", "less", "less_eq"
6281 INCOMPATIBILITY: use more specific names.
6283 c) Permutative equations (e.g. "a + b = b + a")
6284 Since the change of names also changes the order of terms, permutative
6285 rewrite rules may get applied in a different order. Experience shows
6286 that this is rarely the case (only two adaptions in the whole Isabelle
6287 distribution). INCOMPATIBILITY: rewrite proofs
6289 d) ML code directly refering to constant names
6290 This in general only affects hand-written proof tactics, simprocs and
6291 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
6292 Consider using @{const_name} antiquotation.
6294 * New class "default" with associated constant "default".
6296 * Function "sgn" is now overloaded and available on int, real, complex
6297 (and other numeric types), using class "sgn". Two possible defs of
6298 sgn are given as equational assumptions in the classes sgn_if and
6299 sgn_div_norm; ordered_idom now also inherits from sgn_if.
6302 * Locale "partial_order" now unified with class "order" (cf. theory
6303 Orderings), added parameter "less". INCOMPATIBILITY.
6305 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
6306 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
6307 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
6309 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
6310 changed order of proof goals in instance proofs.
6312 * The transitivity reasoner for partial and linear orders is set up
6313 for classes "order" and "linorder". Instances of the reasoner are available
6314 in all contexts importing or interpreting the corresponding locales.
6315 Method "order" invokes the reasoner separately; the reasoner
6316 is also integrated with the Simplifier as a solver. Diagnostic
6317 command 'print_orders' shows the available instances of the reasoner
6318 in the current context.
6320 * Localized monotonicity predicate in theory "Orderings"; integrated
6321 lemmas max_of_mono and min_of_mono with this predicate.
6324 * Formulation of theorem "dense" changed slightly due to integration
6325 with new class dense_linear_order.
6327 * Uniform lattice theory development in HOL.
6329 constants "meet" and "join" now named "inf" and "sup"
6330 constant "Meet" now named "Inf"
6332 classes "meet_semilorder" and "join_semilorder" now named
6333 "lower_semilattice" and "upper_semilattice"
6334 class "lorder" now named "lattice"
6335 class "comp_lat" now named "complete_lattice"
6337 Instantiation of lattice classes allows explicit definitions
6338 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
6340 INCOMPATIBILITY. Theorem renames:
6342 meet_left_le ~> inf_le1
6343 meet_right_le ~> inf_le2
6344 join_left_le ~> sup_ge1
6345 join_right_le ~> sup_ge2
6346 meet_join_le ~> inf_sup_ord
6349 le_meet ~> le_inf_iff
6350 le_join ~> ge_sup_conv
6351 meet_idempotent ~> inf_idem
6352 join_idempotent ~> sup_idem
6353 meet_comm ~> inf_commute
6354 join_comm ~> sup_commute
6355 meet_leI1 ~> le_infI1
6356 meet_leI2 ~> le_infI2
6357 le_joinI1 ~> le_supI1
6358 le_joinI2 ~> le_supI2
6359 meet_assoc ~> inf_assoc
6360 join_assoc ~> sup_assoc
6361 meet_left_comm ~> inf_left_commute
6362 meet_left_idempotent ~> inf_left_idem
6363 join_left_comm ~> sup_left_commute
6364 join_left_idempotent ~> sup_left_idem
6367 le_def_meet ~> le_iff_inf
6368 le_def_join ~> le_iff_sup
6369 join_absorp2 ~> sup_absorb2
6370 join_absorp1 ~> sup_absorb1
6371 meet_absorp1 ~> inf_absorb1
6372 meet_absorp2 ~> inf_absorb2
6373 meet_join_absorp ~> inf_sup_absorb
6374 join_meet_absorp ~> sup_inf_absorb
6375 distrib_join_le ~> distrib_sup_le
6376 distrib_meet_le ~> distrib_inf_le
6378 add_meet_distrib_left ~> add_inf_distrib_left
6379 add_join_distrib_left ~> add_sup_distrib_left
6380 is_join_neg_meet ~> is_join_neg_inf
6381 is_meet_neg_join ~> is_meet_neg_sup
6382 add_meet_distrib_right ~> add_inf_distrib_right
6383 add_join_distrib_right ~> add_sup_distrib_right
6384 add_meet_join_distribs ~> add_sup_inf_distribs
6385 join_eq_neg_meet ~> sup_eq_neg_inf
6386 meet_eq_neg_join ~> inf_eq_neg_sup
6387 add_eq_meet_join ~> add_eq_inf_sup
6388 meet_0_imp_0 ~> inf_0_imp_0
6389 join_0_imp_0 ~> sup_0_imp_0
6390 meet_0_eq_0 ~> inf_0_eq_0
6391 join_0_eq_0 ~> sup_0_eq_0
6392 neg_meet_eq_join ~> neg_inf_eq_sup
6393 neg_join_eq_meet ~> neg_sup_eq_inf
6394 join_eq_if ~> sup_eq_if
6396 mono_meet ~> mono_inf
6397 mono_join ~> mono_sup
6398 meet_bool_eq ~> inf_bool_eq
6399 join_bool_eq ~> sup_bool_eq
6400 meet_fun_eq ~> inf_fun_eq
6401 join_fun_eq ~> sup_fun_eq
6402 meet_set_eq ~> inf_set_eq
6403 join_set_eq ~> sup_set_eq
6404 meet1_iff ~> inf1_iff
6405 meet2_iff ~> inf2_iff
6414 join1_iff ~> sup1_iff
6415 join2_iff ~> sup2_iff
6425 is_meet_Meet ~> is_meet_Inf
6426 Meet_bool_def ~> Inf_bool_def
6427 Meet_fun_def ~> Inf_fun_def
6428 Meet_greatest ~> Inf_greatest
6429 Meet_lower ~> Inf_lower
6430 Meet_set_def ~> Inf_set_def
6433 Sup_bool_eq ~> Sup_bool_def
6434 Sup_fun_eq ~> Sup_fun_def
6435 Sup_set_eq ~> Sup_set_def
6437 listsp_meetI ~> listsp_infI
6438 listsp_meet_eq ~> listsp_inf_eq
6443 * Added syntactic class "size"; overloaded constant "size" now has
6444 type "'a::size ==> bool"
6446 * Internal reorganisation of `size' of datatypes: size theorems
6447 "foo.size" are no longer subsumed by "foo.simps" (but are still
6448 simplification rules by default!); theorems "prod.size" now named
6451 * Class "div" now inherits from class "times" rather than "type".
6454 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
6455 Linorder etc. have disappeared; operations defined in terms of
6456 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
6458 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
6460 * HOL-Word: New extensive library and type for generic, fixed size
6461 machine words, with arithmetic, bit-wise, shifting and rotating
6462 operations, reflection into int, nat, and bool lists, automation for
6463 linear arithmetic (by automatic reflection into nat or int), including
6464 lemmas on overflow and monotonicity. Instantiated to all appropriate
6465 arithmetic type classes, supporting automatic simplification of
6466 numerals on all operations.
6468 * Library/Boolean_Algebra: locales for abstract boolean algebras.
6470 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
6472 * Code generator library theories:
6473 - Code_Integer represents HOL integers by big integer literals in target
6475 - Code_Char represents HOL characters by character literals in target
6477 - Code_Char_chr like Code_Char, but also offers treatment of character
6478 codes; includes Code_Integer.
6479 - Executable_Set allows to generate code for finite sets using lists.
6480 - Executable_Rat implements rational numbers as triples (sign, enumerator,
6482 - Executable_Real implements a subset of real numbers, namly those
6483 representable by rational numbers.
6484 - Efficient_Nat implements natural numbers by integers, which in general will
6485 result in higher efficency; pattern matching with 0/Suc is eliminated;
6486 includes Code_Integer.
6487 - Code_Index provides an additional datatype index which is mapped to
6488 target-language built-in integers.
6489 - Code_Message provides an additional datatype message_string which is isomorphic to
6490 strings; messages are mapped to target-language strings.
6492 * New package for inductive predicates
6494 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
6497 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
6498 for z_1 :: U_1 and ... and z_n :: U_m
6500 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
6503 with full support for type-inference, rather than
6505 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
6507 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
6508 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
6510 inductive "s z_1 ... z_m"
6512 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
6515 For backward compatibility, there is a wrapper allowing inductive
6516 sets to be defined with the new package via
6519 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
6520 for z_1 :: U_1 and ... and z_n :: U_m
6522 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
6528 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
6529 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
6530 for z_1 :: U_1 and ... and z_n :: U_m
6532 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
6533 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
6536 if the additional syntax "p ..." is required.
6538 Numerous examples can be found in the subdirectories src/HOL/Auth,
6539 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
6543 - Since declaration and definition of inductive sets or predicates
6544 is no longer separated, abbreviations involving the newly
6545 introduced sets or predicates must be specified together with the
6546 introduction rules after the 'where' keyword (see above), rather
6547 than before the actual inductive definition.
6549 - The variables in induction and elimination rules are now
6550 quantified in the order of their occurrence in the introduction
6551 rules, rather than in alphabetical order. Since this may break
6552 some proofs, these proofs either have to be repaired, e.g. by
6553 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
6554 statements of the form
6556 case (rule_i a_i_1 ... a_i_{k_i})
6558 or the old order of quantification has to be restored by explicitly adding
6559 meta-level quantifiers in the introduction rules, i.e.
6561 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
6563 - The format of the elimination rules is now
6565 p z_1 ... z_m x_1 ... x_n ==>
6566 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
6571 (x_1, ..., x_n) : s z_1 ... z_m ==>
6572 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
6575 for sets rather than
6577 x : s z_1 ... z_m ==>
6578 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
6581 This may require terms in goals to be expanded to n-tuples
6582 (e.g. using case_tac or simplification with the split_paired_all
6583 rule) before the above elimination rule is applicable.
6585 - The elimination or case analysis rules for (mutually) inductive
6586 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
6587 list of rules "p_1_..._p_k.elims" is no longer available.
6589 * New package "function"/"fun" for general recursive functions,
6590 supporting mutual and nested recursion, definitions in local contexts,
6591 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
6592 for small examples, and the separate tutorial on the function
6593 package. The old recdef "package" is still available as before, but
6594 users are encouraged to use the new package.
6596 * Method "lexicographic_order" automatically synthesizes termination
6597 relations as lexicographic combinations of size measures.
6599 * Case-expressions allow arbitrary constructor-patterns (including
6600 "_") and take their order into account, like in functional
6601 programming. Internally, this is translated into nested
6602 case-expressions; missing cases are added and mapped to the predefined
6603 constant "undefined". In complicated cases printing may no longer show
6604 the original input but the internal form. Lambda-abstractions allow
6605 the same form of pattern matching: "% pat1 => e1 | ..." is an
6606 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
6609 * IntDef: The constant "int :: nat => int" has been removed; now "int"
6610 is an abbreviation for "of_nat :: nat => int". The simplification
6611 rules for "of_nat" have been changed to work like "int" did
6612 previously. Potential INCOMPATIBILITY:
6613 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
6614 - of_nat_diff and of_nat_mult are no longer default simp rules
6616 * Method "algebra" solves polynomial equations over (semi)rings using
6617 Groebner bases. The (semi)ring structure is defined by locales and the
6618 tool setup depends on that generic context. Installing the method for
6619 a specific type involves instantiating the locale and possibly adding
6620 declarations for computation on the coefficients. The method is
6621 already instantiated for natural numbers and for the axiomatic class
6622 of idoms with numerals. See also the paper by Chaieb and Wenzel at
6623 CALCULEMUS 2007 for the general principles underlying this
6624 architecture of context-aware proof-tools.
6626 * Method "ferrack" implements quantifier elimination over
6627 special-purpose dense linear orders using locales (analogous to
6628 "algebra"). The method is already installed for class
6629 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
6632 * Former constant "List.op @" now named "List.append". Use ML
6633 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
6634 circumvent possible incompatibilities when working on ML level.
6636 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
6638 * New function listsum :: 'a list => 'a for arbitrary monoids.
6639 Special syntax: "SUM x <- xs. f x" (and latex variants)
6641 * New syntax for Haskell-like list comprehension (input only), eg.
6642 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
6644 * The special syntax for function "filter" has changed from [x :
6645 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
6646 comprehension syntax, and for uniformity. INCOMPATIBILITY.
6648 * [a..b] is now defined for arbitrary linear orders. It used to be
6649 defined on nat only, as an abbreviation for [a..<Suc b]
6652 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
6654 * New functions "sorted" and "sort" in src/HOL/List.thy.
6656 * New lemma collection field_simps (an extension of ring_simps) for
6657 manipulating (in)equations involving division. Multiplies with all
6658 denominators that can be proved to be non-zero (in equations) or
6659 positive/negative (in inequations).
6661 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
6662 have been improved and renamed to ring_simps, group_simps and
6663 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
6664 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
6666 * Theory Library/Commutative_Ring: switched from recdef to function
6667 package; constants add, mul, pow now curried. Infix syntax for
6668 algebraic operations.
6670 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
6673 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
6676 * HOL/records: generalised field-update to take a function on the
6677 field rather than the new value: r(|A := x|) is translated to A_update
6678 (K x) r The K-combinator that is internally used is called K_record.
6679 INCOMPATIBILITY: Usage of the plain update functions has to be
6682 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
6683 * x = 0, which are required for a semiring. Richer structures do not
6684 inherit from semiring_0 anymore, because this property is a theorem
6685 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
6686 there is more to prove, but this is mostly trivial.
6688 * Class "recpower" is generalized to arbitrary monoids, not just
6689 commutative semirings. INCOMPATIBILITY: may need to incorporate
6690 commutativity or semiring properties additionally.
6692 * Constant "List.list_all2" in List.thy now uses authentic syntax.
6693 INCOMPATIBILITY: translations containing list_all2 may go wrong,
6694 better use 'abbreviation'.
6696 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
6698 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
6699 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
6700 significant changes for setting up numeral syntax for types:
6701 - New constants Numeral.pred and Numeral.succ instead
6702 of former Numeral.bin_pred and Numeral.bin_succ.
6703 - Use integer operations instead of bin_add, bin_mult and so on.
6704 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
6705 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
6707 See src/HOL/Integ/IntArith.thy for an example setup.
6709 * Command 'normal_form' computes the normal form of a term that may
6710 contain free variables. For example ``normal_form "rev [a, b, c]"''
6711 produces ``[b, c, a]'' (without proof). This command is suitable for
6712 heavy-duty computations because the functions are compiled to ML
6713 first. Correspondingly, a method "normalization" is provided. See
6714 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
6716 * Alternative iff syntax "A <-> B" for equality on bool (with priority
6717 25 like -->); output depends on the "iff" print_mode, the default is
6718 "A = B" (with priority 50).
6720 * Relations less (<) and less_eq (<=) are also available on type bool.
6721 Modified syntax to disallow nesting without explicit parentheses,
6722 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
6725 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
6727 * Relation composition operator "op O" now has precedence 75 and binds
6728 stronger than union and intersection. INCOMPATIBILITY.
6730 * The old set interval syntax "{m..n(}" (and relatives) has been
6731 removed. Use "{m..<n}" (and relatives) instead.
6733 * In the context of the assumption "~(s = t)" the Simplifier rewrites
6734 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
6735 ``declare [[simproc del: neq]]''.
6737 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
6740 * Theorem Cons_eq_map_conv no longer declared as "simp".
6742 * Theorem setsum_mult renamed to setsum_right_distrib.
6744 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
6747 * Reimplemented methods "sat" and "satx", with several improvements:
6748 goals no longer need to be stated as "<prems> ==> False", equivalences
6749 (i.e. "=" on type bool) are handled, variable names of the form
6750 "lit_<n>" are no longer reserved, significant speedup.
6752 * Methods "sat" and "satx" can now replay MiniSat proof traces.
6753 zChaff is still supported as well.
6755 * 'inductive' and 'datatype': provide projections of mutual rules,
6756 bundled as foo_bar.inducts;
6758 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
6761 * Library: moved theory Accessible_Part to main HOL.
6763 * Library: added theory Coinductive_List of potentially infinite lists
6764 as greatest fixed-point.
6766 * Library: added theory AssocList which implements (finite) maps as
6769 * Method "evaluation" solves goals (i.e. a boolean expression)
6770 efficiently by compiling it to ML. The goal is "proved" (via an
6771 oracle) if it evaluates to True.
6773 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
6774 also when invoked by the simplifier. This results in the Simplifier
6775 being more powerful on arithmetic goals. INCOMPATIBILITY.
6776 Configuration option fast_arith_split_limit=0 recovers the old
6779 * Support for hex (0x20) and binary (0b1001) numerals.
6781 * New method: reify eqs (t), where eqs are equations for an
6782 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
6783 parameter, computes a term s::'b and a list xs::'a list and proves the
6784 theorem I xs s = t. This is also known as reification or quoting. The
6785 resulting theorem is applied to the subgoal to substitute t with I xs
6786 s. If t is omitted, the subgoal itself is reified.
6788 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
6789 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
6790 where f is supposed to be a computable function (in the sense of code
6791 generattion). The method uses reify to compute s and xs as above then
6792 applies corr_thm and uses normalization by evaluation to "prove" f s =
6793 r and finally gets the theorem t = r, which is again applied to the
6794 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
6796 * Reflection: Automatic reification now handels binding, an example is
6797 available in src/HOL/ex/ReflectionEx.thy
6799 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
6800 command 'statespace' that is similar to 'record', but introduces an
6801 abstract specification based on the locale infrastructure instead of
6802 HOL types. This leads to extra flexibility in composing state spaces,
6803 in particular multiple inheritance and renaming of components.
6808 * Hyperreal: Functions root and sqrt are now defined on negative real
6809 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
6810 Nonnegativity side conditions have been removed from many lemmas, so
6811 that more subgoals may now be solved by simplification; potential
6814 * Real: new type classes formalize real normed vector spaces and
6815 algebras, using new overloaded constants scaleR :: real => 'a => 'a
6816 and norm :: 'a => real.
6818 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
6819 reals into other types. The overloaded constant Reals :: 'a set is now
6820 defined as range of_real; potential INCOMPATIBILITY.
6822 * Real: proper support for ML code generation, including 'quickcheck'.
6823 Reals are implemented as arbitrary precision rationals.
6825 * Hyperreal: Several constants that previously worked only for the
6826 reals have been generalized, so they now work over arbitrary vector
6827 spaces. Type annotations may need to be added in some cases; potential
6830 Infinitesimal :: ('a::real_normed_vector) star set
6831 HFinite :: ('a::real_normed_vector) star set
6832 HInfinite :: ('a::real_normed_vector) star set
6833 approx :: ('a::real_normed_vector) star => 'a star => bool
6834 monad :: ('a::real_normed_vector) star => 'a star set
6835 galaxy :: ('a::real_normed_vector) star => 'a star set
6836 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
6837 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
6838 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
6839 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
6840 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
6841 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
6842 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
6843 sgn :: 'a::real_normed_vector => 'a
6844 exp :: 'a::{recpower,real_normed_field,banach} => 'a
6846 * Complex: Some complex-specific constants are now abbreviations for
6847 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
6848 hnorm. Other constants have been entirely removed in favor of the
6849 polymorphic versions (INCOMPATIBILITY):
6853 HInfinite <-- CInfinite
6854 Infinitesimal <-- CInfinitesimal
6857 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
6858 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
6859 (ns)deriv <-- (ns)cderiv
6864 * Formalisation of ideals and the quotient construction over rings.
6866 * Order and lattice theory no longer based on records.
6869 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
6870 greatest_closed. INCOMPATIBILITY.
6872 * Method algebra is now set up via an attribute. For examples see
6873 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
6874 of algebraic structures.
6876 * Renamed theory CRing to Ring.
6881 * Substantial, yet incomplete support for nominal datatypes (binding
6882 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
6883 src/HOL/Nominal/Examples. Prospective users should consult
6884 http://isabelle.in.tum.de/nominal/
6889 * ML basics: just one true type int, which coincides with IntInf.int
6892 * ML within Isar: antiquotations allow to embed statically-checked
6893 formal entities in the source, referring to the context available at
6894 compile-time. For example:
6896 ML {* @{sort "{zero,one}"} *}
6897 ML {* @{typ "'a => 'b"} *}
6898 ML {* @{term "%x. x"} *}
6899 ML {* @{prop "x == y"} *}
6900 ML {* @{ctyp "'a => 'b"} *}
6901 ML {* @{cterm "%x. x"} *}
6902 ML {* @{cprop "x == y"} *}
6903 ML {* @{thm asm_rl} *}
6904 ML {* @{thms asm_rl} *}
6905 ML {* @{type_name c} *}
6906 ML {* @{type_syntax c} *}
6907 ML {* @{const_name c} *}
6908 ML {* @{const_syntax c} *}
6911 ML {* @{theory Pure} *}
6912 ML {* @{theory_ref} *}
6913 ML {* @{theory_ref Pure} *}
6916 ML {* @{clasimpset} *}
6918 The same works for sources being ``used'' within an Isar context.
6920 * ML in Isar: improved error reporting; extra verbosity with
6921 ML_Context.trace enabled.
6923 * Pure/General/table.ML: the join operations now works via exceptions
6924 DUP/SAME instead of type option. This is simpler in simple cases, and
6925 admits slightly more efficient complex applications.
6927 * Pure: 'advanced' translation functions (parse_translation etc.) now
6928 use Context.generic instead of just theory.
6930 * Pure: datatype Context.generic joins theory/Proof.context and
6931 provides some facilities for code that works in either kind of
6932 context, notably GenericDataFun for uniform theory and proof data.
6934 * Pure: simplified internal attribute type, which is now always
6935 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
6936 local (Proof.context) attributes have been discontinued, while
6937 minimizing code duplication. Thm.rule_attribute and
6938 Thm.declaration_attribute build canonical attributes; see also structure
6939 Context for further operations on Context.generic, notably
6940 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
6941 declarations and definitions.
6943 * Context data interfaces (Theory/Proof/GenericDataFun): removed
6944 name/print, uninitialized data defaults to ad-hoc copy of empty value,
6945 init only required for impure data. INCOMPATIBILITY: empty really need
6946 to be empty (no dependencies on theory content!)
6948 * Pure/kernel: consts certification ignores sort constraints given in
6949 signature declarations. (This information is not relevant to the
6950 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
6951 potential INCOMPATIBILITY.
6953 * Pure: axiomatic type classes are now purely definitional, with
6954 explicit proofs of class axioms and super class relations performed
6955 internally. See Pure/axclass.ML for the main internal interfaces --
6956 notably AxClass.define_class supercedes AxClass.add_axclass, and
6957 AxClass.axiomatize_class/classrel/arity supersede
6958 Sign.add_classes/classrel/arities.
6960 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
6961 global/local versions on theory vs. Proof.context have been
6962 discontinued; Attrib.syntax and Method.syntax have been adapted
6963 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
6964 attributes, methods, etc.
6966 * Pure: several functions of signature "... -> theory -> theory * ..."
6967 have been reoriented to "... -> theory -> ... * theory" in order to
6968 allow natural usage in combination with the ||>, ||>>, |-> and
6969 fold_map combinators.
6971 * Pure: official theorem names (closed derivations) and additional
6972 comments (tags) are now strictly separate. Name hints -- which are
6973 maintained as tags -- may be attached any time without affecting the
6976 * Pure: primitive rule lift_rule now takes goal cterm instead of an
6977 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
6978 achieve the old behaviour.
6980 * Pure: the "Goal" constant is now called "prop", supporting a
6981 slightly more general idea of ``protecting'' meta-level rule
6984 * Pure: Logic.(un)varify only works in a global context, which is now
6985 enforced instead of silently assumed. INCOMPATIBILITY, may use
6986 Logic.legacy_(un)varify as temporary workaround.
6988 * Pure: structure Name provides scalable operations for generating
6989 internal variable names, notably Name.variants etc. This replaces
6990 some popular functions from term.ML:
6992 Term.variant -> Name.variant
6993 Term.variantlist -> Name.variant_list
6994 Term.invent_names -> Name.invent_list
6996 Note that low-level renaming rarely occurs in new code -- operations
6997 from structure Variable are used instead (see below).
6999 * Pure: structure Variable provides fundamental operations for proper
7000 treatment of fixed/schematic variables in a context. For example,
7001 Variable.import introduces fixes for schematics of given facts and
7002 Variable.export reverses the effect (up to renaming) -- this replaces
7003 various freeze_thaw operations.
7005 * Pure: structure Goal provides simple interfaces for
7006 init/conclude/finish and tactical prove operations (replacing former
7007 Tactic.prove). Goal.prove is the canonical way to prove results
7008 within a given context; Goal.prove_global is a degraded version for
7009 theory level goals, including a global Drule.standard. Note that
7010 OldGoals.prove_goalw_cterm has long been obsolete, since it is
7011 ill-behaved in a local proof context (e.g. with local fixes/assumes or
7012 in a locale context).
7014 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
7015 and type checking (Syntax.check_term etc.), with common combinations
7016 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
7017 which are considered legacy and await removal.
7019 * Pure/Syntax: generic interfaces for type unchecking
7020 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
7021 with common combinations (Syntax.pretty_term, Syntax.string_of_term
7022 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
7023 available for convenience, but refer to the very same operations using
7024 a mere theory instead of a full context.
7026 * Isar: simplified treatment of user-level errors, using exception
7027 ERROR of string uniformly. Function error now merely raises ERROR,
7028 without any side effect on output channels. The Isar toplevel takes
7029 care of proper display of ERROR exceptions. ML code may use plain
7030 handle/can/try; cat_error may be used to concatenate errors like this:
7032 ... handle ERROR msg => cat_error msg "..."
7034 Toplevel ML code (run directly or through the Isar toplevel) may be
7035 embedded into the Isar toplevel with exception display/debug like
7038 Isar.toplevel (fn () => ...)
7040 INCOMPATIBILITY, removed special transform_error facilities, removed
7041 obsolete variants of user-level exceptions (ERROR_MESSAGE,
7042 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
7043 -- use plain ERROR instead.
7045 * Isar: theory setup now has type (theory -> theory), instead of a
7046 list. INCOMPATIBILITY, may use #> to compose setup functions.
7048 * Isar: ML toplevel pretty printer for type Proof.context, subject to
7049 ProofContext.debug/verbose flags.
7051 * Isar: Toplevel.theory_to_proof admits transactions that modify the
7052 theory before entering a proof state. Transactions now always see a
7053 quasi-functional intermediate checkpoint, both in interactive and
7056 * Isar: simplified interfaces for outer syntax. Renamed
7057 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
7058 OuterSyntax.add_parsers -- this functionality is now included in
7059 OuterSyntax.command etc. INCOMPATIBILITY.
7061 * Simplifier: the simpset of a running simplification process now
7062 contains a proof context (cf. Simplifier.the_context), which is the
7063 very context that the initial simpset has been retrieved from (by
7064 simpset_of/local_simpset_of). Consequently, all plug-in components
7065 (solver, looper etc.) may depend on arbitrary proof data.
7067 * Simplifier.inherit_context inherits the proof context (plus the
7068 local bounds) of the current simplification process; any simproc
7069 etc. that calls the Simplifier recursively should do this! Removed
7070 former Simplifier.inherit_bounds, which is already included here --
7071 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
7072 specify an explicit context using Simplifier.context/theory_context.
7074 * Simplifier/Classical Reasoner: more abstract interfaces
7075 change_simpset/claset for modifying the simpset/claset reference of a
7076 theory; raw versions simpset/claset_ref etc. have been discontinued --
7079 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
7085 * settings: the default heap location within ISABELLE_HOME_USER now
7086 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
7087 Isabelle installations.
7089 * isabelle-process: option -S (secure mode) disables some critical
7090 operations, notably runtime compilation and evaluation of ML source
7093 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
7095 * Support for parallel execution, using native multicore support of
7096 Poly/ML 5.1. The theory loader exploits parallelism when processing
7097 independent theories, according to the given theory header
7098 specifications. The maximum number of worker threads is specified via
7099 usedir option -M or the "max-threads" setting in Proof General. A
7100 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
7101 to 6 on a 8-core machine. User-code needs to observe certain
7102 guidelines for thread-safe programming, see appendix A in the Isar
7103 Implementation manual.
7107 New in Isabelle2005 (October 2005)
7108 ----------------------------------
7112 * Theory headers: the new header syntax for Isar theories is
7115 imports <theory1> ... <theoryN>
7116 uses <file1> ... <fileM>
7119 where the 'uses' part is optional. The previous syntax
7121 theory <name> = <theory1> + ... + <theoryN>:
7123 will disappear in the next release. Use isatool fixheaders to convert
7124 existing theory files. Note that there is no change in ancient
7125 non-Isar theories now, but these will disappear soon.
7127 * Theory loader: parent theories can now also be referred to via
7128 relative and absolute paths.
7130 * Command 'find_theorems' searches for a list of criteria instead of a
7131 list of constants. Known criteria are: intro, elim, dest, name:string,
7132 simp:term, and any term. Criteria can be preceded by '-' to select
7133 theorems that do not match. Intro, elim, dest select theorems that
7134 match the current goal, name:s selects theorems whose fully qualified
7135 name contain s, and simp:term selects all simplification rules whose
7136 lhs match term. Any other term is interpreted as pattern and selects
7137 all theorems matching the pattern. Available in ProofGeneral under
7138 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
7140 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
7142 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
7143 matching the current goal as introduction rule and not having "HOL."
7144 in their name (i.e. not being defined in theory HOL).
7146 * Command 'thms_containing' has been discontinued in favour of
7147 'find_theorems'; INCOMPATIBILITY.
7149 * Communication with Proof General is now 8bit clean, which means that
7150 Unicode text in UTF-8 encoding may be used within theory texts (both
7151 formal and informal parts). Cf. option -U of the Isabelle Proof
7152 General interface. Here are some simple examples (cf. src/HOL/ex):
7154 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
7155 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
7157 * Improved efficiency of the Simplifier and, to a lesser degree, the
7158 Classical Reasoner. Typical big applications run around 2 times
7162 *** Document preparation ***
7164 * Commands 'display_drafts' and 'print_drafts' perform simple output
7165 of raw sources. Only those symbols that do not require additional
7166 LaTeX packages (depending on comments in isabellesym.sty) are
7167 displayed properly, everything else is left verbatim. isatool display
7168 and isatool print are used as front ends (these are subject to the
7169 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
7171 * Command tags control specific markup of certain regions of text,
7172 notably folding and hiding. Predefined tags include "theory" (for
7173 theory begin and end), "proof" for proof commands, and "ML" for
7174 commands involving ML code; the additional tags "visible" and
7175 "invisible" are unused by default. Users may give explicit tag
7176 specifications in the text, e.g. ''by %invisible (auto)''. The
7177 interpretation of tags is determined by the LaTeX job during document
7178 preparation: see option -V of isatool usedir, or options -n and -t of
7179 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
7182 Several document versions may be produced at the same time via isatool
7183 usedir (the generated index.html will link all of them). Typical
7184 specifications include ''-V document=theory,proof,ML'' to present
7185 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
7186 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
7187 these parts without any formal replacement text. The Isabelle site
7188 default settings produce ''document'' and ''outline'' versions as
7191 * Several new antiquotations:
7193 @{term_type term} prints a term with its type annotated;
7195 @{typeof term} prints the type of a term;
7197 @{const const} is the same as @{term const}, but checks that the
7198 argument is a known logical constant;
7200 @{term_style style term} and @{thm_style style thm} print a term or
7201 theorem applying a "style" to it
7205 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
7206 definitions, equations, inequations etc., 'concl' printing only the
7207 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
7208 to print the specified premise. TermStyle.add_style provides an ML
7209 interface for introducing further styles. See also the "LaTeX Sugar"
7210 document practical applications. The ML antiquotation prints
7211 type-checked ML expressions verbatim.
7213 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
7214 and 'text' support optional locale specification '(in loc)', which
7215 specifies the default context for interpreting antiquotations. For
7216 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
7218 * Option 'locale=NAME' of antiquotations specifies an alternative
7219 context interpreting the subsequent argument. For example: @{thm
7220 [locale=lattice] inf_assoc}.
7222 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
7225 * Proper output of antiquotations for theory commands involving a
7226 proof context (such as 'locale' or 'theorem (in loc) ...').
7228 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
7229 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
7231 * isatool usedir: new option -C (default true) controls whether option
7232 -D should include a copy of the original document directory; -C false
7233 prevents unwanted effects such as copying of administrative CVS data.
7238 * Considerably improved version of 'constdefs' command. Now performs
7239 automatic type-inference of declared constants; additional support for
7240 local structure declarations (cf. locales and HOL records), see also
7241 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
7242 sequential dependencies of definitions within a single 'constdefs'
7243 section; moreover, the declared name needs to be an identifier. If
7244 all fails, consider to fall back on 'consts' and 'defs' separately.
7246 * Improved indexed syntax and implicit structures. First of all,
7247 indexed syntax provides a notational device for subscripted
7248 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
7249 expressions. Secondly, in a local context with structure
7250 declarations, number indexes \<^sub>n or the empty index (default
7251 number 1) refer to a certain fixed variable implicitly; option
7252 show_structs controls printing of implicit structures. Typical
7253 applications of these concepts involve record types and locales.
7255 * New command 'no_syntax' removes grammar declarations (and
7256 translations) resulting from the given syntax specification, which is
7257 interpreted in the same manner as for the 'syntax' command.
7259 * 'Advanced' translation functions (parse_translation etc.) may depend
7260 on the signature of the theory context being presently used for
7261 parsing/printing, see also isar-ref manual.
7263 * Improved 'oracle' command provides a type-safe interface to turn an
7264 ML expression of type theory -> T -> term into a primitive rule of
7265 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
7266 is already included here); see also FOL/ex/IffExample.thy;
7269 * axclass: name space prefix for class "c" is now "c_class" (was "c"
7270 before); "cI" is no longer bound, use "c.intro" instead.
7271 INCOMPATIBILITY. This change avoids clashes of fact bindings for
7272 axclasses vs. locales.
7274 * Improved internal renaming of symbolic identifiers -- attach primes
7275 instead of base 26 numbers.
7277 * New flag show_question_marks controls printing of leading question
7278 marks in schematic variable names.
7280 * In schematic variable names, *any* symbol following \<^isub> or
7281 \<^isup> is now treated as part of the base name. For example, the
7282 following works without printing of awkward ".0" indexes:
7284 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
7287 * Inner syntax includes (*(*nested*) comments*).
7289 * Pretty printer now supports unbreakable blocks, specified in mixfix
7290 annotations as "(00...)".
7292 * Clear separation of logical types and nonterminals, where the latter
7293 may only occur in 'syntax' specifications or type abbreviations.
7294 Before that distinction was only partially implemented via type class
7295 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
7296 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
7297 exotic syntax specifications may require further adaption
7298 (e.g. Cube/Cube.thy).
7300 * Removed obsolete type class "logic", use the top sort {} instead.
7301 Note that non-logical types should be declared as 'nonterminals'
7302 rather than 'types'. INCOMPATIBILITY for new object-logic
7305 * Attributes 'induct' and 'cases': type or set names may now be
7306 locally fixed variables as well.
7308 * Simplifier: can now control the depth to which conditional rewriting
7309 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
7312 * Simplifier: simplification procedures may now take the current
7313 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
7314 interface), which is very useful for calling the Simplifier
7315 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
7316 is gone -- use prems_of_ss on the simpset instead. Moreover, the
7317 low-level mk_simproc no longer applies Logic.varify internally, to
7318 allow for use in a context of fixed variables.
7320 * thin_tac now works even if the assumption being deleted contains !!
7321 or ==>. More generally, erule now works even if the major premise of
7322 the elimination rule contains !! or ==>.
7324 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
7326 * Reorganized bootstrapping of the Pure theories; CPure is now derived
7327 from Pure, which contains all common declarations already. Both
7328 theories are defined via plain Isabelle/Isar .thy files.
7329 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
7330 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
7331 use isatool fixcpure to adapt your theory and ML sources.
7333 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
7334 selections of theorems in named facts via index ranges.
7336 * 'print_theorems': in theory mode, really print the difference
7337 wrt. the last state (works for interactive theory development only),
7338 in proof mode print all local facts (cf. 'print_facts');
7340 * 'hide': option '(open)' hides only base names.
7342 * More efficient treatment of intermediate checkpoints in interactive
7345 * Code generator is now invoked via code_module (incremental code
7346 generation) and code_library (modular code generation, ML structures
7347 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
7348 must be quoted when used as identifiers.
7350 * New 'value' command for reading, evaluating and printing terms using
7351 the code generator. INCOMPATIBILITY: command keyword 'value' must be
7352 quoted when used as identifier.
7357 * New commands for the interpretation of locale expressions in
7358 theories (1), locales (2) and proof contexts (3). These generate
7359 proof obligations from the expression specification. After the
7360 obligations have been discharged, theorems of the expression are added
7361 to the theory, target locale or proof context. The synopsis of the
7362 commands is a follows:
7364 (1) interpretation expr inst
7365 (2) interpretation target < expr
7366 (3) interpret expr inst
7368 Interpretation in theories and proof contexts require a parameter
7369 instantiation of terms from the current context. This is applied to
7370 specifications and theorems of the interpreted expression.
7371 Interpretation in locales only permits parameter renaming through the
7372 locale expression. Interpretation is smart in that interpretations
7373 that are active already do not occur in proof obligations, neither are
7374 instantiated theorems stored in duplicate. Use 'print_interps' to
7375 inspect active interpretations of a particular locale. For details,
7376 see the Isar Reference manual. Examples can be found in
7377 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
7379 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
7380 'interpret' instead.
7382 * New context element 'constrains' for adding type constraints to
7385 * Context expressions: renaming of parameters with syntax
7388 * Locale declaration: 'includes' disallowed.
7390 * Proper static binding of attribute syntax -- i.e. types / terms /
7391 facts mentioned as arguments are always those of the locale definition
7392 context, independently of the context of later invocations. Moreover,
7393 locale operations (renaming and type / term instantiation) are applied
7394 to attribute arguments as expected.
7396 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
7397 actual attributes; rare situations may require Attrib.attribute to
7398 embed those attributes into Attrib.src that lack concrete syntax.
7399 Attribute implementations need to cooperate properly with the static
7400 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
7401 Attrib.XXX_thm etc. already do the right thing without further
7402 intervention. Only unusual applications -- such as "where" or "of"
7403 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
7404 on the context and the facts involved -- may have to assign parsed
7405 values to argument tokens explicitly.
7407 * Changed parameter management in theorem generation for long goal
7408 statements with 'includes'. INCOMPATIBILITY: produces a different
7409 theorem statement in rare situations.
7411 * Locale inspection command 'print_locale' omits notes elements. Use
7412 'print_locale!' to have them included in the output.
7417 * Provers/hypsubst.ML: improved version of the subst method, for
7418 single-step rewriting: it now works in bound variable contexts. New is
7419 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
7420 rewrite a different subterm than the original subst method, which is
7421 still available as 'simplesubst'.
7423 * Provers/quasi.ML: new transitivity reasoners for transitivity only
7426 * Provers/trancl.ML: new transitivity reasoner for transitive and
7427 reflexive-transitive closure of relations.
7429 * Provers/blast.ML: new reference depth_limit to make blast's depth
7430 limit (previously hard-coded with a value of 20) user-definable.
7432 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
7433 is peformed already. Object-logics merely need to finish their
7434 initial simpset configuration as before. INCOMPATIBILITY.
7439 * Symbolic syntax of Hilbert Choice Operator is now as follows:
7442 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
7444 The symbol \<some> is displayed as the alternative epsilon of LaTeX
7445 and x-symbol; use option '-m epsilon' to get it actually printed.
7446 Moreover, the mathematically important symbolic identifier \<epsilon>
7447 becomes available as variable, constant etc. INCOMPATIBILITY,
7449 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
7450 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
7451 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
7452 support corresponding Isar calculations.
7454 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
7457 * theory SetInterval: changed the syntax for open intervals:
7466 The old syntax is still supported but will disappear in the next
7467 release. For conversion use the following Emacs search and replace
7468 patterns (these are not perfect but work quite well):
7470 {)\([^\.]*\)\.\. -> {\1<\.\.}
7471 \.\.\([^(}]*\)(} -> \.\.<\1}
7473 * Theory Commutative_Ring (in Library): method comm_ring for proving
7474 equalities in commutative rings; method 'algebra' provides a generic
7477 * Theory Finite_Set: changed the syntax for 'setsum', summation over
7478 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
7479 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
7482 Some new syntax forms are available:
7484 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
7485 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
7486 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
7487 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
7489 The latter form "\<Sum>x < k. e" used to be based on a separate
7490 function "Summation", which has been discontinued.
7492 * theory Finite_Set: in structured induction proofs, the insert case
7493 is now 'case (insert x F)' instead of the old counterintuitive 'case
7496 * The 'refute' command has been extended to support a much larger
7497 fragment of HOL, including axiomatic type classes, constdefs and
7498 typedefs, inductive datatypes and recursion.
7500 * New tactics 'sat' and 'satx' to prove propositional tautologies.
7501 Requires zChaff with proof generation to be installed. See
7502 HOL/ex/SAT_Examples.thy for examples.
7504 * Datatype induction via method 'induct' now preserves the name of the
7505 induction variable. For example, when proving P(xs::'a list) by
7506 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
7507 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
7508 in unstructured proof scripts.
7510 * Reworked implementation of records. Improved scalability for
7511 records with many fields, avoiding performance problems for type
7512 inference. Records are no longer composed of nested field types, but
7513 of nested extension types. Therefore the record type only grows linear
7514 in the number of extensions and not in the number of fields. The
7515 top-level (users) view on records is preserved. Potential
7516 INCOMPATIBILITY only in strange cases, where the theory depends on the
7517 old record representation. The type generated for a record is called
7518 <record_name>_ext_type.
7520 Flag record_quick_and_dirty_sensitive can be enabled to skip the
7521 proofs triggered by a record definition or a simproc (if
7522 quick_and_dirty is enabled). Definitions of large records can take
7525 New simproc record_upd_simproc for simplification of multiple record
7526 updates enabled by default. Moreover, trivial updates are also
7527 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
7528 occasionally, since simplification is more powerful by default.
7530 * typedef: proper support for polymorphic sets, which contain extra
7531 type-variables in the term.
7533 * Simplifier: automatically reasons about transitivity chains
7534 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
7535 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
7536 old proofs break occasionally as simplification may now solve more
7537 goals than previously.
7539 * Simplifier: converts x <= y into x = y if assumption y <= x is
7540 present. Works for all partial orders (class "order"), in particular
7541 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
7544 * Simplifier: new simproc for "let x = a in f x". If a is a free or
7545 bound variable or a constant then the let is unfolded. Otherwise
7546 first a is simplified to b, and then f b is simplified to g. If
7547 possible we abstract b from g arriving at "let x = b in h x",
7548 otherwise we unfold the let and arrive at g. The simproc can be
7549 enabled/disabled by the reference use_let_simproc. Potential
7550 INCOMPATIBILITY since simplification is more powerful by default.
7552 * Classical reasoning: the meson method now accepts theorems as arguments.
7554 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
7555 jobs to provide advice on the provability of subgoals.
7557 * Theory OrderedGroup and Ring_and_Field: various additions and
7558 improvements to faciliate calculations involving equalities and
7561 The following theorems have been eliminated or modified
7564 abs_eq now named abs_of_nonneg
7565 abs_of_ge_0 now named abs_of_nonneg
7566 abs_minus_eq now named abs_of_nonpos
7567 imp_abs_id now named abs_of_nonneg
7568 imp_abs_neg_id now named abs_of_nonpos
7569 mult_pos now named mult_pos_pos
7570 mult_pos_le now named mult_nonneg_nonneg
7571 mult_pos_neg_le now named mult_nonneg_nonpos
7572 mult_pos_neg2_le now named mult_nonneg_nonpos2
7573 mult_neg now named mult_neg_neg
7574 mult_neg_le now named mult_nonpos_nonpos
7576 * The following lemmas in Ring_and_Field have been added to the simplifier:
7579 not_square_less_zero
7581 The following lemmas have been deleted from Real/RealPow:
7591 * Theory Parity: added rules for simplifying exponents.
7595 The following theorems have been eliminated or modified
7598 list_all_Nil now named list_all.simps(1)
7599 list_all_Cons now named list_all.simps(2)
7600 list_all_conv now named list_all_iff
7601 set_mem_eq now named mem_iff
7603 * Theories SetsAndFunctions and BigO (see HOL/Library) support
7604 asymptotic "big O" calculations. See the notes in BigO.thy.
7609 * Theory RealDef: better support for embedding natural numbers and
7610 integers in the reals.
7612 The following theorems have been eliminated or modified
7615 exp_ge_add_one_self now requires no hypotheses
7616 real_of_int_add reversed direction of equality (use [symmetric])
7617 real_of_int_minus reversed direction of equality (use [symmetric])
7618 real_of_int_diff reversed direction of equality (use [symmetric])
7619 real_of_int_mult reversed direction of equality (use [symmetric])
7621 * Theory RComplete: expanded support for floor and ceiling functions.
7623 * Theory Ln is new, with properties of the natural logarithm
7625 * Hyperreal: There is a new type constructor "star" for making
7626 nonstandard types. The old type names are now type synonyms:
7630 hcomplex = complex star
7632 * Hyperreal: Many groups of similarly-defined constants have been
7633 replaced by polymorphic versions (INCOMPATIBILITY):
7635 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
7637 starset <-- starsetNat, starsetC
7638 *s* <-- *sNat*, *sc*
7639 starset_n <-- starsetNat_n, starsetC_n
7640 *sn* <-- *sNatn*, *scn*
7641 InternalSets <-- InternalNatSets, InternalCSets
7643 starfun <-- starfun{Nat,Nat2,C,RC,CR}
7644 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
7645 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
7646 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
7647 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
7649 * Hyperreal: Many type-specific theorems have been removed in favor of
7650 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
7652 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
7653 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
7654 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
7655 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
7656 right_minus <-- hypreal_add_minus
7657 left_minus <-- {hypreal,hcomplex}_add_minus_left
7658 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
7659 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
7660 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
7661 mult_1_right <-- hcomplex_mult_one_right
7662 mult_zero_left <-- hcomplex_mult_zero_left
7663 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
7664 right_distrib <-- hypnat_add_mult_distrib2
7665 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
7666 right_inverse <-- hypreal_mult_inverse
7667 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
7668 order_refl <-- {hypreal,hypnat}_le_refl
7669 order_trans <-- {hypreal,hypnat}_le_trans
7670 order_antisym <-- {hypreal,hypnat}_le_anti_sym
7671 order_less_le <-- {hypreal,hypnat}_less_le
7672 linorder_linear <-- {hypreal,hypnat}_le_linear
7673 add_left_mono <-- {hypreal,hypnat}_add_left_mono
7674 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
7675 add_nonneg_nonneg <-- hypreal_le_add_order
7677 * Hyperreal: Separate theorems having to do with type-specific
7678 versions of constants have been merged into theorems that apply to the
7679 new polymorphic constants (INCOMPATIBILITY):
7681 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
7682 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
7683 STAR_Un <-- {STAR,NatStar,STARC}_Un
7684 STAR_Int <-- {STAR,NatStar,STARC}_Int
7685 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
7686 STAR_subset <-- {STAR,NatStar,STARC}_subset
7687 STAR_mem <-- {STAR,NatStar,STARC}_mem
7688 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
7689 STAR_diff <-- {STAR,STARC}_diff
7690 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
7691 STARC_hcomplex_of_complex}_image_subset
7692 starset_n_Un <-- starset{Nat,C}_n_Un
7693 starset_n_Int <-- starset{Nat,C}_n_Int
7694 starset_n_Compl <-- starset{Nat,C}_n_Compl
7695 starset_n_diff <-- starset{Nat,C}_n_diff
7696 InternalSets_Un <-- Internal{Nat,C}Sets_Un
7697 InternalSets_Int <-- Internal{Nat,C}Sets_Int
7698 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
7699 InternalSets_diff <-- Internal{Nat,C}Sets_diff
7700 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
7701 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
7702 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
7703 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
7704 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
7705 starfun <-- starfun{Nat,Nat2,C,RC,CR}
7706 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
7707 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
7708 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
7709 starfun_diff <-- starfun{C,RC,CR}_diff
7710 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
7711 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
7712 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
7713 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
7714 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
7715 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
7716 starfun_Id <-- starfunC_Id
7717 starfun_approx <-- starfun{Nat,CR}_approx
7718 starfun_capprox <-- starfun{C,RC}_capprox
7719 starfun_abs <-- starfunNat_rabs
7720 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
7721 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
7722 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
7723 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
7724 starfun_add_capprox <-- starfun{C,RC}_add_capprox
7725 starfun_add_approx <-- starfunCR_add_approx
7726 starfun_inverse_inverse <-- starfunC_inverse_inverse
7727 starfun_divide <-- starfun{C,CR,RC}_divide
7728 starfun_n <-- starfun{Nat,C}_n
7729 starfun_n_mult <-- starfun{Nat,C}_n_mult
7730 starfun_n_add <-- starfun{Nat,C}_n_add
7731 starfun_n_add_minus <-- starfunNat_n_add_minus
7732 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
7733 starfun_n_minus <-- starfun{Nat,C}_n_minus
7734 starfun_n_eq <-- starfun{Nat,C}_n_eq
7736 star_n_add <-- {hypreal,hypnat,hcomplex}_add
7737 star_n_minus <-- {hypreal,hcomplex}_minus
7738 star_n_diff <-- {hypreal,hcomplex}_diff
7739 star_n_mult <-- {hypreal,hcomplex}_mult
7740 star_n_inverse <-- {hypreal,hcomplex}_inverse
7741 star_n_le <-- {hypreal,hypnat}_le
7742 star_n_less <-- {hypreal,hypnat}_less
7743 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
7744 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
7745 star_n_abs <-- hypreal_hrabs
7746 star_n_divide <-- hcomplex_divide
7748 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
7749 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
7750 star_of_diff <-- hypreal_of_real_diff
7751 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
7752 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
7753 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
7754 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
7755 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
7756 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
7757 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
7758 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
7759 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
7760 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
7761 star_of_number_of <-- {hypreal,hcomplex}_number_of
7762 star_of_number_less <-- number_of_less_hypreal_of_real_iff
7763 star_of_number_le <-- number_of_le_hypreal_of_real_iff
7764 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
7765 star_of_less_number <-- hypreal_of_real_less_number_of_iff
7766 star_of_le_number <-- hypreal_of_real_le_number_of_iff
7767 star_of_power <-- hypreal_of_real_power
7768 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
7770 * Hyperreal: new method "transfer" that implements the transfer
7771 principle of nonstandard analysis. With a subgoal that mentions
7772 nonstandard types like "'a star", the command "apply transfer"
7773 replaces it with an equivalent one that mentions only standard types.
7774 To be successful, all free variables must have standard types; non-
7775 standard variables must have explicit universal quantifiers.
7777 * Hyperreal: A theory of Taylor series.
7782 * Discontinued special version of 'constdefs' (which used to support
7783 continuous functions) in favor of the general Pure one with full
7786 * New simplification procedure for solving continuity conditions; it
7787 is much faster on terms with many nested lambda abstractions (cubic
7788 instead of exponential time).
7790 * New syntax for domain package: selector names are now optional.
7791 Parentheses should be omitted unless argument is lazy, for example:
7793 domain 'a stream = cons "'a" (lazy "'a stream")
7795 * New command 'fixrec' for defining recursive functions with pattern
7796 matching; defining multiple functions with mutual recursion is also
7797 supported. Patterns may include the constants cpair, spair, up, sinl,
7798 sinr, or any data constructor defined by the domain package. The given
7799 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
7800 syntax and examples.
7802 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
7803 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
7804 but the proof obligation additionally includes an admissibility
7805 requirement. The packages generate instances of class cpo or pcpo,
7806 with continuity and strictness theorems for Rep and Abs.
7808 * HOLCF: Many theorems have been renamed according to a more standard naming
7809 scheme (INCOMPATIBILITY):
7811 foo_inject: "foo$x = foo$y ==> x = y"
7812 foo_eq: "(foo$x = foo$y) = (x = y)"
7813 foo_less: "(foo$x << foo$y) = (x << y)"
7814 foo_strict: "foo$UU = UU"
7815 foo_defined: "... ==> foo$x ~= UU"
7816 foo_defined_iff: "(foo$x = UU) = (x = UU)"
7821 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
7822 including the First Isomorphism Theorem (on quotienting by the kernel
7825 * ZF/Simplifier: install second copy of type solver that actually
7826 makes use of TC rules declared to Isar proof contexts (or locales);
7827 the old version is still required for ML proof scripts.
7832 * Converted to Isar theory format; use locales instead of axiomatic
7838 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
7841 * Pure/library.ML no longer defines its own option datatype, but uses
7842 that of the SML basis, which has constructors NONE and SOME instead of
7843 None and Some, as well as exception Option.Option instead of OPTION.
7844 The functions the, if_none, is_some, is_none have been adapted
7845 accordingly, while Option.map replaces apsome.
7847 * Pure/library.ML: the exception LIST has been given up in favour of
7848 the standard exceptions Empty and Subscript, as well as
7849 Library.UnequalLengths. Function like Library.hd and Library.tl are
7850 superceded by the standard hd and tl functions etc.
7852 A number of basic list functions are no longer exported to the ML
7853 toplevel, as they are variants of predefined functions. The following
7854 suggests how one can translate existing code:
7856 rev_append xs ys = List.revAppend (xs, ys)
7857 nth_elem (i, xs) = List.nth (xs, i)
7858 last_elem xs = List.last xs
7859 flat xss = List.concat xss
7860 seq fs = List.app fs
7861 partition P xs = List.partition P xs
7862 mapfilter f xs = List.mapPartial f xs
7864 * Pure/library.ML: several combinators for linear functional
7865 transformations, notably reverse application and composition:
7868 (x, y) |-> f f #-> g
7870 * Pure/library.ML: introduced/changed precedence of infix operators:
7872 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
7874 infix 3 o oo ooo oooo;
7875 infix 4 ~~ upto downto;
7877 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
7880 * Pure/library.ML: natural list combinators fold, fold_rev, and
7881 fold_map support linear functional transformations and nesting. For
7884 fold f [x1, ..., xN] y =
7885 y |> f x1 |> ... |> f xN
7887 (fold o fold) f [xs1, ..., xsN] y =
7888 y |> fold f xs1 |> ... |> fold f xsN
7890 fold f [x1, ..., xN] =
7893 (fold o fold) f [xs1, ..., xsN] =
7894 fold f xs1 #> ... #> fold f xsN
7896 * Pure/library.ML: the following selectors on type 'a option are
7899 the: 'a option -> 'a (*partial*)
7900 these: 'a option -> 'a where 'a = 'b list
7901 the_default: 'a -> 'a option -> 'a
7902 the_list: 'a option -> 'a list
7904 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
7905 basic operations for association lists, following natural argument
7906 order; moreover the explicit equality predicate passed here avoids
7907 potentially expensive polymorphic runtime equality checks.
7908 The old functions may be expressed as follows:
7910 assoc = uncurry (AList.lookup (op =))
7911 assocs = these oo AList.lookup (op =)
7912 overwrite = uncurry (AList.update (op =)) o swap
7914 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
7916 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
7917 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
7919 replacing make_keylist and keyfilter (occassionally used)
7922 make_keylist = AList.make
7923 keyfilter = AList.find (op =)
7925 * eq_fst and eq_snd now take explicit equality parameter, thus
7926 avoiding eqtypes. Naive rewrites:
7928 eq_fst = eq_fst (op =)
7929 eq_snd = eq_snd (op =)
7931 * Removed deprecated apl and apr (rarely used).
7934 apl (n, op) =>>= curry op n
7935 apr (op, m) =>>= fn n => op (n, m)
7937 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
7938 provides a reasonably efficient light-weight implementation of sets as
7941 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
7942 few new operations; existing lookup and update are now curried to
7943 follow natural argument order (for use with fold etc.);
7944 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
7946 * Pure/General: output via the Isabelle channels of
7947 writeln/warning/error etc. is now passed through Output.output, with a
7948 hook for arbitrary transformations depending on the print_mode
7949 (cf. Output.add_mode -- the first active mode that provides a output
7950 function wins). Already formatted output may be embedded into further
7951 text via Output.raw; the result of Pretty.string_of/str_of and derived
7952 functions (string_of_term/cterm/thm etc.) is already marked raw to
7953 accommodate easy composition of diagnostic messages etc. Programmers
7954 rarely need to care about Output.output or Output.raw at all, with
7955 some notable exceptions: Output.output is required when bypassing the
7956 standard channels (writeln etc.), or in token translations to produce
7957 properly formatted results; Output.raw is required when capturing
7958 already output material that will eventually be presented to the user
7959 a second time. For the default print mode, both Output.output and
7960 Output.raw have no effect.
7962 * Pure/General: Output.time_accumulator NAME creates an operator ('a
7963 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
7964 cumulative results are displayed at the end of a batch session.
7966 * Pure/General: File.sysify_path and File.quote_sysify path have been
7967 replaced by File.platform_path and File.shell_path (with appropriate
7968 hooks). This provides a clean interface for unusual systems where the
7969 internal and external process view of file names are different.
7971 * Pure: more efficient orders for basic syntactic entities: added
7972 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
7973 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
7974 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
7975 orders now -- potential INCOMPATIBILITY for code that depends on a
7976 particular order for Symtab.keys, Symtab.dest, etc. (consider using
7977 Library.sort_strings on result).
7979 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
7980 fold_types traverse types/terms from left to right, observing natural
7981 argument order. Supercedes previous foldl_XXX versions, add_frees,
7982 add_vars etc. have been adapted as well: INCOMPATIBILITY.
7984 * Pure: name spaces have been refined, with significant changes of the
7985 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
7986 to extern(_table). The plain name entry path is superceded by a
7987 general 'naming' context, which also includes the 'policy' to produce
7988 a fully qualified name and external accesses of a fully qualified
7989 name; NameSpace.extend is superceded by context dependent
7990 Sign.declare_name. Several theory and proof context operations modify
7991 the naming context. Especially note Theory.restore_naming and
7992 ProofContext.restore_naming to get back to a sane state; note that
7993 Theory.add_path is no longer sufficient to recover from
7994 Theory.absolute_path in particular.
7996 * Pure: new flags short_names (default false) and unique_names
7997 (default true) for controlling output of qualified names. If
7998 short_names is set, names are printed unqualified. If unique_names is
7999 reset, the name prefix is reduced to the minimum required to achieve
8000 the original result when interning again, even if there is an overlap
8001 with earlier declarations.
8003 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
8004 now 'extend', and 'merge' gets an additional Pretty.pp argument
8005 (useful for printing error messages). INCOMPATIBILITY.
8007 * Pure: major reorganization of the theory context. Type Sign.sg and
8008 Theory.theory are now identified, referring to the universal
8009 Context.theory (see Pure/context.ML). Actual signature and theory
8010 content is managed as theory data. The old code and interfaces were
8011 spread over many files and structures; the new arrangement introduces
8012 considerable INCOMPATIBILITY to gain more clarity:
8014 Context -- theory management operations (name, identity, inclusion,
8015 parents, ancestors, merge, etc.), plus generic theory data;
8017 Sign -- logical signature and syntax operations (declaring consts,
8018 types, etc.), plus certify/read for common entities;
8020 Theory -- logical theory operations (stating axioms, definitions,
8021 oracles), plus a copy of logical signature operations (consts,
8022 types, etc.); also a few basic management operations (Theory.copy,
8025 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
8026 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
8027 for convenience -- they merely return the theory.
8029 * Pure: type Type.tsig is superceded by theory in most interfaces.
8031 * Pure: the Isar proof context type is already defined early in Pure
8032 as Context.proof (note that ProofContext.context and Proof.context are
8033 aliases, where the latter is the preferred name). This enables other
8034 Isabelle components to refer to that type even before Isar is present.
8036 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
8037 typeK, constK, axiomK, oracleK), but provide explicit operations for
8038 any of these kinds. For example, Sign.intern typeK is now
8039 Sign.intern_type, Theory.hide_space Sign.typeK is now
8040 Theory.hide_types. Also note that former
8041 Theory.hide_classes/types/consts are now
8042 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
8043 internalize their arguments! INCOMPATIBILITY.
8045 * Pure: get_thm interface (of PureThy and ProofContext) expects
8046 datatype thmref (with constructors Name and NameSelection) instead of
8047 plain string -- INCOMPATIBILITY;
8049 * Pure: cases produced by proof methods specify options, where NONE
8050 means to remove case bindings -- INCOMPATIBILITY in
8053 * Pure: the following operations retrieve axioms or theorems from a
8054 theory node or theory hierarchy, respectively:
8056 Theory.axioms_of: theory -> (string * term) list
8057 Theory.all_axioms_of: theory -> (string * term) list
8058 PureThy.thms_of: theory -> (string * thm) list
8059 PureThy.all_thms_of: theory -> (string * thm) list
8061 * Pure: print_tac now outputs the goal through the trace channel.
8063 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
8064 Reference Toplevel.debug (default false) controls detailed printing
8065 and tracing of low-level exceptions; Toplevel.profiling (default 0)
8066 controls execution profiling -- set to 1 for time and 2 for space
8067 (both increase the runtime).
8069 * Isar session: The initial use of ROOT.ML is now always timed,
8070 i.e. the log will show the actual process times, in contrast to the
8071 elapsed wall-clock time that the outer shell wrapper produces.
8073 * Simplifier: improved handling of bound variables (nameless
8074 representation, avoid allocating new strings). Simprocs that invoke
8075 the Simplifier recursively should use Simplifier.inherit_bounds to
8076 avoid local name clashes. Failure to do so produces warnings
8077 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
8078 for further details.
8080 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
8081 bindings for all theorems stored within a given theory; this may help
8082 in porting non-Isar theories to Isar ones, while keeping ML proof
8083 scripts for the time being.
8085 * ML operator HTML.with_charset specifies the charset begin used for
8086 generated HTML files. For example:
8088 HTML.with_charset "utf-8" use_thy "Hebrew";
8089 HTML.with_charset "utf-8" use_thy "Chinese";
8094 * Allow symlinks to all proper Isabelle executables (Isabelle,
8095 isabelle, isatool etc.).
8097 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
8098 isatool doc, isatool mkdir, display_drafts etc.).
8100 * isatool usedir: option -f allows specification of the ML file to be
8101 used by Isabelle; default is ROOT.ML.
8103 * New isatool version outputs the version identifier of the Isabelle
8104 distribution being used.
8106 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
8107 (containing Boolean satisfiability problems) into Isabelle/HOL
8112 New in Isabelle2004 (April 2004)
8113 --------------------------------
8117 * Provers/order.ML: new efficient reasoner for partial and linear orders.
8118 Replaces linorder.ML.
8120 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
8121 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
8122 (\<a>...\<z>), are now considered normal letters, and can therefore
8123 be used anywhere where an ASCII letter (a...zA...Z) has until
8124 now. COMPATIBILITY: This obviously changes the parsing of some
8125 terms, especially where a symbol has been used as a binder, say
8126 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
8127 as an identifier. Fix it by inserting a space around former
8128 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
8129 existing theory and ML files.
8131 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
8133 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
8134 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
8135 a normal (but invisible) letter. For multiple letter subscripts repeat
8136 \<^isub> like this: x\<^isub>1\<^isub>2.
8138 * Pure: There are now sub-/superscripts that can span more than one
8139 character. Text between \<^bsub> and \<^esub> is set in subscript in
8140 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
8141 superscript. The new control characters are not identifier parts.
8143 * Pure: Control-symbols of the form \<^raw:...> will literally print the
8144 content of "..." to the latex file instead of \isacntrl... . The "..."
8145 may consist of any printable characters excluding the end bracket >.
8147 * Pure: Using new Isar command "finalconsts" (or the ML functions
8148 Theory.add_finals or Theory.add_finals_i) it is now possible to
8149 declare constants "final", which prevents their being given a definition
8150 later. It is useful for constants whose behaviour is fixed axiomatically
8151 rather than definitionally, such as the meta-logic connectives.
8153 * Pure: 'instance' now handles general arities with general sorts
8154 (i.e. intersections of classes),
8156 * Presentation: generated HTML now uses a CSS style sheet to make layout
8157 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
8158 It can be changed to alter the colors/layout of generated pages.
8163 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
8164 cut_tac, subgoal_tac and thin_tac:
8165 - Now understand static (Isar) contexts. As a consequence, users of Isar
8166 locales are no longer forced to write Isar proof scripts.
8167 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
8169 - INCOMPATIBILITY: names of variables to be instantiated may no
8170 longer be enclosed in quotes. Instead, precede variable name with `?'.
8171 This is consistent with the instantiation attribute "where".
8173 * Attributes "where" and "of":
8174 - Now take type variables of instantiated theorem into account when reading
8175 the instantiation string. This fixes a bug that caused instantiated
8176 theorems to have too special types in some circumstances.
8177 - "where" permits explicit instantiations of type variables.
8179 * Calculation commands "moreover" and "also" no longer interfere with
8180 current facts ("this"), admitting arbitrary combinations with "then"
8184 - Goal statements involving the context element "includes" no longer
8185 generate theorems with internal delta predicates (those ending on
8186 "_axioms") in the premise.
8187 Resolve particular premise with <locale>.intro to obtain old form.
8188 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
8189 specification and "includes" elements in goal statement.
8190 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
8191 [intro?] and [elim?] (respectively) by default.
8192 - Experimental command for instantiation of locales in proof contexts:
8193 instantiate <label>[<attrs>]: <loc>
8194 Instantiates locale <loc> and adds all its theorems to the current context
8195 taking into account their attributes. Label and attrs are optional
8196 modifiers, like in theorem declarations. If present, names of
8197 instantiated theorems are qualified with <label>, and the attributes
8198 <attrs> are applied after any attributes these theorems might have already.
8199 If the locale has assumptions, a chained fact of the form
8200 "<loc> t1 ... tn" is expected from which instantiations of the parameters
8201 are derived. The command does not support old-style locales declared
8202 with "locale (open)".
8203 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
8205 * HOL: Tactic emulation methods induct_tac and case_tac understand static
8211 * Proof import: new image HOL4 contains the imported library from
8212 the HOL4 system with about 2500 theorems. It is imported by
8213 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
8214 can be used like any other Isabelle image. See
8215 HOL/Import/HOL/README for more information.
8218 - Much improved handling of linear and partial orders.
8219 Reasoners for linear and partial orders are set up for type classes
8220 "linorder" and "order" respectively, and are added to the default simpset
8221 as solvers. This means that the simplifier can build transitivity chains
8222 to solve goals from the assumptions.
8223 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
8224 of blast or auto after simplification become unnecessary because the goal
8225 is solved by simplification already.
8227 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
8228 all proved in axiomatic type classes for semirings, rings and fields.
8231 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
8232 now formalized using the Ring_and_Field theory mentioned above.
8233 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
8234 than before, because now they are set up once in a generic manner.
8235 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
8236 Look for the general versions in Ring_and_Field (and Power if they concern
8239 * Type "rat" of the rational numbers is now available in HOL-Complex.
8242 - Record types are now by default printed with their type abbreviation
8243 instead of the list of all field types. This can be configured via
8244 the reference "print_record_type_abbr".
8245 - Simproc "record_upd_simproc" for simplification of multiple updates added
8246 (not enabled by default).
8247 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
8248 EX x. x = sel r to True (not enabled by default).
8249 - Tactic "record_split_simp_tac" to split and simplify records added.
8251 * 'specification' command added, allowing for definition by
8252 specification. There is also an 'ax_specification' command that
8253 introduces the new constants axiomatically.
8255 * arith(_tac) is now able to generate counterexamples for reals as well.
8257 * HOL-Algebra: new locale "ring" for non-commutative rings.
8259 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
8260 definitions, thanks to Sava Krsti\'{c} and John Matthews.
8262 * HOL-Matrix: a first theory for matrices in HOL with an application of
8263 matrix theory to linear programming.
8265 * Unions and Intersections:
8266 The latex output syntax of UN and INT has been changed
8267 from "\Union x \in A. B" to "\Union_{x \in A} B"
8268 i.e. the index formulae has become a subscript.
8269 Similarly for "\Union x. B", and for \Inter instead of \Union.
8271 * Unions and Intersections over Intervals:
8272 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
8273 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
8274 like in normal math, and corresponding versions for < and for intersection.
8276 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
8277 lexicographic dictonary ordering has been added as "lexord".
8279 * ML: the legacy theory structures Int and List have been removed. They had
8280 conflicted with ML Basis Library structures having the same names.
8282 * 'refute' command added to search for (finite) countermodels. Only works
8283 for a fragment of HOL. The installation of an external SAT solver is
8284 highly recommended. See "HOL/Refute.thy" for details.
8286 * 'quickcheck' command: Allows to find counterexamples by evaluating
8287 formulae under an assignment of free variables to random values.
8288 In contrast to 'refute', it can deal with inductive datatypes,
8289 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
8295 * Streams now come with concatenation and are part of the HOLCF image
8299 New in Isabelle2003 (May 2003)
8300 ------------------------------
8304 * Provers/simplifier:
8306 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
8307 Assumptions are now subject to complete mutual simplification,
8308 not just from left to right. The simplifier now preserves
8309 the order of assumptions.
8311 Potential INCOMPATIBILITY:
8313 -- simp sometimes diverges where the old version did
8314 not, e.g. invoking simp on the goal
8316 [| P (f x); y = x; f x = f y |] ==> Q
8318 now gives rise to the infinite reduction sequence
8320 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
8322 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
8325 -- Tactics combining classical reasoner and simplification (such as auto)
8326 are also affected by this change, because many of them rely on
8327 simp. They may sometimes diverge as well or yield a different numbers
8328 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
8329 in case of problems. Sometimes subsequent calls to the classical
8330 reasoner will fail because a preceeding call to the simplifier too
8331 eagerly simplified the goal, e.g. deleted redundant premises.
8333 - The simplifier trace now shows the names of the applied rewrite rules
8335 - You can limit the number of recursive invocations of the simplifier
8336 during conditional rewriting (where the simplifie tries to solve the
8337 conditions before applying the rewrite rule):
8338 ML "simp_depth_limit := n"
8339 where n is an integer. Thus you can force termination where previously
8340 the simplifier would diverge.
8342 - Accepts free variables as head terms in congruence rules. Useful in Isar.
8344 - No longer aborts on failed congruence proof. Instead, the
8345 congruence is ignored.
8347 * Pure: New generic framework for extracting programs from constructive
8348 proofs. See HOL/Extraction.thy for an example instantiation, as well
8349 as HOL/Extraction for some case studies.
8351 * Pure: The main goal of the proof state is no longer shown by default, only
8352 the subgoals. This behaviour is controlled by a new flag.
8353 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
8354 (ML: Proof.show_main_goal).
8356 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
8357 rules whose conclusion matches subgoal 1:
8358 PG menu: Isabelle/Isar -> Show me -> matching rules
8359 The rules are ordered by how closely they match the subgoal.
8360 In particular, rules that solve a subgoal outright are displayed first
8361 (or rather last, the way they are printed).
8362 (ML: ProofGeneral.print_intros())
8364 * Pure: New flag trace_unify_fail causes unification to print
8365 diagnostic information (PG: in trace buffer) when it fails. This is
8366 useful for figuring out why single step proofs like rule, erule or
8369 * Pure: Locale specifications now produce predicate definitions
8370 according to the body of text (covering assumptions modulo local
8371 definitions); predicate "loc_axioms" covers newly introduced text,
8372 while "loc" is cumulative wrt. all included locale expressions; the
8373 latter view is presented only on export into the global theory
8374 context; potential INCOMPATIBILITY, use "(open)" option to fall back
8375 on the old view without predicates;
8377 * Pure: predefined locales "var" and "struct" are useful for sharing
8378 parameters (as in CASL, for example); just specify something like
8379 ``var x + var y + struct M'' as import;
8381 * Pure: improved thms_containing: proper indexing of facts instead of
8382 raw theorems; check validity of results wrt. current name space;
8383 include local facts of proof configuration (also covers active
8384 locales), cover fixed variables in index; may use "_" in term
8385 specification; an optional limit for the number of printed facts may
8386 be given (the default is 40);
8388 * Pure: disallow duplicate fact bindings within new-style theory files
8391 * Provers: improved induct method: assumptions introduced by case
8392 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
8393 the goal statement); "foo" still refers to all facts collectively;
8395 * Provers: the function blast.overloaded has been removed: all constants
8396 are regarded as potentially overloaded, which improves robustness in exchange
8397 for slight decrease in efficiency;
8399 * Provers/linorder: New generic prover for transitivity reasoning over
8400 linear orders. Note: this prover is not efficient!
8402 * Isar: preview of problems to finish 'show' now produce an error
8403 rather than just a warning (in interactive mode);
8410 - Produces a counter example if it cannot prove a goal.
8411 Note that the counter example may be spurious if the goal is not a formula
8412 of quantifier-free linear arithmetic.
8413 In ProofGeneral the counter example appears in the trace buffer.
8415 - Knows about div k and mod k where k is a numeral of type nat or int.
8417 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
8418 linear arithmetic fails. This takes account of quantifiers and divisibility.
8419 Presburger arithmetic can also be called explicitly via presburger(_tac).
8421 * simp's arithmetic capabilities have been enhanced a bit: it now
8422 takes ~= in premises into account (by performing a case split);
8424 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
8425 are distributed over a sum of terms;
8427 * New tactic "trans_tac" and method "trans" instantiate
8428 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
8431 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
8432 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
8434 * 'typedef' command has new option "open" to suppress the set
8437 * functions Min and Max on finite sets have been introduced (theory
8440 * attribute [symmetric] now works for relations as well; it turns
8441 (x,y) : R^-1 into (y,x) : R, and vice versa;
8443 * induct over a !!-quantified statement (say !!x1..xn):
8444 each "case" automatically performs "fix x1 .. xn" with exactly those names.
8446 * Map: `empty' is no longer a constant but a syntactic abbreviation for
8447 %x. None. Warning: empty_def now refers to the previously hidden definition
8450 * Algebra: formalization of classical algebra. Intended as base for
8451 any algebraic development in Isabelle. Currently covers group theory
8452 (up to Sylow's theorem) and ring theory (Universal Property of
8453 Univariate Polynomials). Contributions welcome;
8455 * GroupTheory: deleted, since its material has been moved to Algebra;
8457 * Complex: new directory of the complex numbers with numeric constants,
8458 nonstandard complex numbers, and some complex analysis, standard and
8459 nonstandard (Jacques Fleuriot);
8461 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
8463 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
8466 * Real/HahnBanach: updated and adapted to locales;
8468 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
8471 * UNITY: added the Meier-Sanders theory of progress sets;
8473 * MicroJava: bytecode verifier and lightweight bytecode verifier
8474 as abstract algorithms, instantiated to the JVM;
8476 * Bali: Java source language formalization. Type system, operational
8477 semantics, axiomatic semantics. Supported language features:
8478 classes, interfaces, objects,virtual methods, static methods,
8479 static/instance fields, arrays, access modifiers, definite
8480 assignment, exceptions.
8485 * ZF/Constructible: consistency proof for AC (Gdel's constructible
8488 * Main ZF: virtually all theories converted to new-style format;
8493 * Pure: Tactic.prove provides sane interface for internal proofs;
8494 omits the infamous "standard" operation, so this is more appropriate
8495 than prove_goalw_cterm in many situations (e.g. in simprocs);
8497 * Pure: improved error reporting of simprocs;
8499 * Provers: Simplifier.simproc(_i) provides sane interface for setting
8503 *** Document preparation ***
8505 * uses \par instead of \\ for line breaks in theory text. This may
8506 shift some page breaks in large documents. To get the old behaviour
8507 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
8509 * minimized dependencies of isabelle.sty and isabellesym.sty on
8512 * \<euro> now needs package babel/greek instead of marvosym (which
8515 * normal size for \<zero>...\<nine> (uses \mathbf instead of
8520 New in Isabelle2002 (March 2002)
8521 --------------------------------
8523 *** Document preparation ***
8525 * greatly simplified document preparation setup, including more
8526 graceful interpretation of isatool usedir -i/-d/-D options, and more
8527 instructive isatool mkdir; users should basically be able to get
8528 started with "isatool mkdir HOL Test && isatool make"; alternatively,
8529 users may run a separate document processing stage manually like this:
8530 "isatool usedir -D output HOL Test && isatool document Test/output";
8532 * theory dependency graph may now be incorporated into documents;
8533 isatool usedir -g true will produce session_graph.eps/.pdf for use
8534 with \includegraphics of LaTeX;
8536 * proper spacing of consecutive markup elements, especially text
8537 blocks after section headings;
8539 * support bold style (for single symbols only), input syntax is like
8540 this: "\<^bold>\<alpha>" or "\<^bold>A";
8542 * \<bullet> is now output as bold \cdot by default, which looks much
8543 better in printed text;
8545 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
8546 note that these symbols are currently unavailable in Proof General /
8547 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
8549 * isatool latex no longer depends on changed TEXINPUTS, instead
8550 isatool document copies the Isabelle style files to the target
8556 * Pure/Provers: improved proof by cases and induction;
8557 - 'case' command admits impromptu naming of parameters (such as
8559 - 'induct' method divinates rule instantiation from the inductive
8560 claim; no longer requires excessive ?P bindings for proper
8561 instantiation of cases;
8562 - 'induct' method properly enumerates all possibilities of set/type
8563 rules; as a consequence facts may be also passed through *type*
8564 rules without further ado;
8565 - 'induct' method now derives symbolic cases from the *rulified*
8566 rule (before it used to rulify cases stemming from the internal
8567 atomized version); this means that the context of a non-atomic
8568 statement becomes is included in the hypothesis, avoiding the
8569 slightly cumbersome show "PROP ?case" form;
8570 - 'induct' may now use elim-style induction rules without chaining
8571 facts, using ``missing'' premises from the goal state; this allows
8572 rules stemming from inductive sets to be applied in unstructured
8573 scripts, while still benefitting from proper handling of non-atomic
8574 statements; NB: major inductive premises need to be put first, all
8575 the rest of the goal is passed through the induction;
8576 - 'induct' proper support for mutual induction involving non-atomic
8577 rule statements (uses the new concept of simultaneous goals, see
8579 - append all possible rule selections, but only use the first
8580 success (no backtracking);
8581 - removed obsolete "(simplified)" and "(stripped)" options of methods;
8582 - undeclared rule case names default to numbers 1, 2, 3, ...;
8583 - added 'print_induct_rules' (covered by help item in recent Proof
8585 - moved induct/cases attributes to Pure, methods to Provers;
8586 - generic method setup instantiated for FOL and HOL;
8588 * Pure: support multiple simultaneous goal statements, for example
8589 "have a: A and b: B" (same for 'theorem' etc.); being a pure
8590 meta-level mechanism, this acts as if several individual goals had
8591 been stated separately; in particular common proof methods need to be
8592 repeated in order to cover all claims; note that a single elimination
8593 step is *not* sufficient to establish the two conjunctions, so this
8596 assume "A & B" then have A and B .. (*".." fails*)
8598 better use "obtain" in situations as above; alternative refer to
8599 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
8601 * Pure: proper integration with ``locales''; unlike the original
8602 version by Florian Kammller, Isar locales package high-level proof
8603 contexts rather than raw logical ones (e.g. we admit to include
8604 attributes everywhere); operations on locales include merge and
8605 rename; support for implicit arguments (``structures''); simultaneous
8606 type-inference over imports and text; see also HOL/ex/Locales.thy for
8609 * Pure: the following commands have been ``localized'', supporting a
8610 target locale specification "(in name)": 'lemma', 'theorem',
8611 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
8612 stored both within the locale and at the theory level (exported and
8613 qualified by the locale name);
8615 * Pure: theory goals may now be specified in ``long'' form, with
8616 ad-hoc contexts consisting of arbitrary locale elements. for example
8617 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
8618 definitions may be given, too); the result is a meta-level rule with
8619 the context elements being discharged in the obvious way;
8621 * Pure: new proof command 'using' allows to augment currently used
8622 facts after a goal statement ('using' is syntactically analogous to
8623 'apply', but acts on the goal's facts only); this allows chained facts
8624 to be separated into parts given before and after a claim, as in
8625 ``from a and b have C using d and e <proof>'';
8627 * Pure: renamed "antecedent" case to "rule_context";
8629 * Pure: new 'judgment' command records explicit information about the
8630 object-logic embedding (used by several tools internally); no longer
8631 use hard-wired "Trueprop";
8633 * Pure: added 'corollary' command;
8635 * Pure: fixed 'token_translation' command;
8637 * Pure: removed obsolete 'exported' attribute;
8639 * Pure: dummy pattern "_" in is/let is now automatically lifted over
8640 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
8641 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
8643 * Pure: method 'atomize' presents local goal premises as object-level
8644 statements (atomic meta-level propositions); setup controlled via
8645 rewrite rules declarations of 'atomize' attribute; example
8646 application: 'induct' method with proper rule statements in improper
8649 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
8650 now consider the syntactic context of assumptions, giving a better
8651 chance to get type-inference of the arguments right (this is
8652 especially important for locales);
8654 * Pure: "sorry" no longer requires quick_and_dirty in interactive
8657 * Pure/obtain: the formal conclusion "thesis", being marked as
8658 ``internal'', may no longer be reference directly in the text;
8659 potential INCOMPATIBILITY, may need to use "?thesis" in rare
8662 * Pure: generic 'sym' attribute which declares a rule both as pure
8663 'elim?' and for the 'symmetric' operation;
8665 * Pure: marginal comments ``--'' may now occur just anywhere in the
8666 text; the fixed correlation with particular command syntax has been
8669 * Pure: new method 'rules' is particularly well-suited for proof
8670 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
8671 but often produces more compact proof terms with less detours;
8673 * Pure/Provers/classical: simplified integration with pure rule
8674 attributes and methods; the classical "intro?/elim?/dest?"
8675 declarations coincide with the pure ones; the "rule" method no longer
8676 includes classically swapped intros; "intro" and "elim" methods no
8677 longer pick rules from the context; also got rid of ML declarations
8678 AddXIs/AddXEs/AddXDs; all of this has some potential for
8681 * Provers/classical: attribute 'swapped' produces classical inversions
8682 of introduction rules;
8684 * Provers/simplifier: 'simplified' attribute may refer to explicit
8685 rules instead of full simplifier context; 'iff' attribute handles
8688 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
8690 * HOL: 'recdef' now fails on unfinished automated proofs, use
8691 "(permissive)" option to recover old behavior;
8693 * HOL: 'inductive' no longer features separate (collective) attributes
8694 for 'intros' (was found too confusing);
8696 * HOL: properly declared induction rules less_induct and
8702 * HOL: moved over to sane numeral syntax; the new policy is as
8705 - 0 and 1 are polymorphic constants, which are defined on any
8706 numeric type (nat, int, real etc.);
8708 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
8709 binary representation internally;
8711 - type nat has special constructor Suc, and generally prefers Suc 0
8712 over 1::nat and Suc (Suc 0) over 2::nat;
8714 This change may cause significant problems of INCOMPATIBILITY; here
8715 are some hints on converting existing sources:
8717 - due to the new "num" token, "-0" and "-1" etc. are now atomic
8718 entities, so expressions involving "-" (unary or binary minus) need
8719 to be spaced properly;
8721 - existing occurrences of "1" may need to be constraint "1::nat" or
8722 even replaced by Suc 0; similar for old "2";
8724 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
8726 - remove all special provisions on numerals in proofs;
8728 * HOL: simp rules nat_number expand numerals on nat to Suc/0
8729 representation (depends on bin_arith_simps in the default context);
8731 * HOL: symbolic syntax for x^2 (numeral 2);
8733 * HOL: the class of all HOL types is now called "type" rather than
8734 "term"; INCOMPATIBILITY, need to adapt references to this type class
8735 in axclass/classes, instance/arities, and (usually rare) occurrences
8736 in typings (of consts etc.); internally the class is called
8737 "HOL.type", ML programs should refer to HOLogic.typeS;
8739 * HOL/record package improvements:
8740 - new derived operations "fields" to build a partial record section,
8741 "extend" to promote a fixed record to a record scheme, and
8742 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
8743 declared as simp by default;
8744 - shared operations ("more", "fields", etc.) now need to be always
8745 qualified) --- potential INCOMPATIBILITY;
8746 - removed "make_scheme" operations (use "make" with "extend") --
8748 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
8749 - provides cases/induct rules for use with corresponding Isar
8750 methods (for concrete records, record schemes, concrete more
8751 parts, and schematic more parts -- in that order);
8752 - internal definitions directly based on a light-weight abstract
8753 theory of product types over typedef rather than datatype;
8755 * HOL: generic code generator for generating executable ML code from
8756 specifications; specific support for HOL constructs such as inductive
8757 datatypes and sets, as well as recursive functions; can be invoked
8758 via 'generate_code' theory section;
8760 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
8762 * HOL: consolidated and renamed several theories. In particular:
8763 Ord.thy has been absorbed into HOL.thy
8764 String.thy has been absorbed into List.thy
8766 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
8767 (beware of argument permutation!);
8769 * HOL: linorder_less_split superseded by linorder_cases;
8771 * HOL/List: "nodups" renamed to "distinct";
8773 * HOL: added "The" definite description operator; move Hilbert's "Eps"
8774 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
8775 - Ex_def has changed, now need to use some_eq_ex
8777 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
8778 in this (rare) case use:
8780 delSWrapper "split_all_tac"
8781 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
8783 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
8786 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
8787 Isabelle's type classes, ^ on functions and relations has too general
8788 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
8789 necessary to attach explicit type constraints;
8791 * HOL/Relation: the prefix name of the infix "O" has been changed from
8792 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
8793 renamed accordingly (eg "compI" -> "rel_compI").
8795 * HOL: syntax translations now work properly with numerals and records
8798 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
8799 of "lam" -- INCOMPATIBILITY;
8801 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
8802 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
8803 renamed "Product_Type.unit";
8805 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
8807 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
8808 the "cases" method);
8810 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
8813 * HOL/IMP: updated and converted to new-style theory format; several
8814 parts turned into readable document, with proper Isar proof texts and
8815 some explanations (by Gerwin Klein);
8817 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
8819 * HOL-Hyperreal is now a logic image;
8824 * Isar: consts/constdefs supports mixfix syntax for continuous
8827 * Isar: domain package adapted to new-style theory format, e.g. see
8830 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
8831 potential INCOMPATIBILITY; now use plain induct_tac instead of former
8832 lift.induct_tac, always use UU instead of Undef;
8834 * HOLCF/IMP: updated and converted to new-style theory;
8839 * Isar: proper integration of logic-specific tools and packages,
8840 including theory commands '(co)inductive', '(co)datatype',
8841 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
8842 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
8844 * theory Main no longer includes AC; for the Axiom of Choice, base
8845 your theory on Main_ZFC;
8847 * the integer library now covers quotients and remainders, with many
8848 laws relating division to addition, multiplication, etc.;
8850 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
8851 typeless version of the formalism;
8853 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
8856 * ZF/Induct: new directory for examples of inductive definitions,
8857 including theory Multiset for multiset orderings; converted to
8858 new-style theory format;
8860 * ZF: many new theorems about lists, ordinals, etc.;
8865 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
8866 variable proof controls level of detail: 0 = no proofs (only oracle
8867 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
8868 also ref manual for further ML interfaces;
8870 * Pure/axclass: removed obsolete ML interface
8871 goal_subclass/goal_arity;
8873 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
8874 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
8875 separate tokens, so expressions involving minus need to be spaced
8878 * Pure/syntax: support non-oriented infixes, using keyword "infix"
8879 rather than "infixl" or "infixr";
8881 * Pure/syntax: concrete syntax for dummy type variables admits genuine
8882 sort constraint specifications in type inference; e.g. "x::_::foo"
8883 ensures that the type of "x" is of sort "foo" (but not necessarily a
8886 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
8887 control output of nested => (types); the default behavior is
8890 * Pure/syntax: builtin parse translation for "_constify" turns valued
8891 tokens into AST constants;
8893 * Pure/syntax: prefer later declarations of translations and print
8894 translation functions; potential INCOMPATIBILITY: need to reverse
8895 multiple declarations for same syntax element constant;
8897 * Pure/show_hyps reset by default (in accordance to existing Isar
8900 * Provers/classical: renamed addaltern to addafter, addSaltern to
8903 * Provers/clasimp: ``iff'' declarations now handle conditional rules
8906 * system: tested support for MacOS X; should be able to get Isabelle +
8907 Proof General to work in a plain Terminal after installing Poly/ML
8908 (e.g. from the Isabelle distribution area) and GNU bash alone
8909 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
8910 support requires further installations, e.g. from
8911 http://fink.sourceforge.net/);
8913 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
8915 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
8916 of 40 MB), cf. ML_OPTIONS;
8918 * system: Proof General keywords specification is now part of the
8919 Isabelle distribution (see etc/isar-keywords.el);
8921 * system: support for persistent Proof General sessions (refrain from
8922 outdating all loaded theories on startup); user may create writable
8923 logic images like this: ``isabelle -q HOL Test'';
8925 * system: smart selection of Isabelle process versus Isabelle
8926 interface, accommodates case-insensitive file systems (e.g. HFS+); may
8927 run both "isabelle" and "Isabelle" even if file names are badly
8928 damaged (executable inspects the case of the first letter of its own
8929 name); added separate "isabelle-process" and "isabelle-interface";
8931 * system: refrain from any attempt at filtering input streams; no
8932 longer support ``8bit'' encoding of old isabelle font, instead proper
8933 iso-latin characters may now be used; the related isatools
8934 "symbolinput" and "nonascii" have disappeared as well;
8936 * system: removed old "xterm" interface (the print modes "xterm" and
8937 "xterm_color" are still available for direct use in a suitable
8942 New in Isabelle99-2 (February 2001)
8943 -----------------------------------
8945 *** Overview of INCOMPATIBILITIES ***
8947 * HOL: please note that theories in the Library and elsewhere often use the
8948 new-style (Isar) format; to refer to their theorems in an ML script you must
8949 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
8951 * HOL: inductive package no longer splits induction rule aggressively,
8952 but only as far as specified by the introductions given; the old
8953 format may be recovered via ML function complete_split_rule or attribute
8954 'split_rule (complete)';
8956 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
8957 gfp_Tarski to gfp_unfold;
8959 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
8961 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
8962 relation); infix "^^" has been renamed "``"; infix "``" has been
8963 renamed "`"; "univalent" has been renamed "single_valued";
8965 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
8968 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
8970 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
8972 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
8973 consequence, it is no longer monotonic wrt. the local goal context
8974 (which is now passed through the inductive cases);
8976 * Document preparation: renamed standard symbols \<ll> to \<lless> and
8977 \<gg> to \<ggreater>;
8980 *** Document preparation ***
8982 * \isabellestyle{NAME} selects version of Isabelle output (currently
8983 available: are "it" for near math-mode best-style output, "sl" for
8984 slanted text style, and "tt" for plain type-writer; if no
8985 \isabellestyle command is given, output is according to slanted
8988 * support sub/super scripts (for single symbols only), input syntax is
8989 like this: "A\<^sup>*" or "A\<^sup>\<star>";
8991 * some more standard symbols; see Appendix A of the system manual for
8992 the complete list of symbols defined in isabellesym.sty;
8994 * improved isabelle style files; more abstract symbol implementation
8995 (should now use \isamath{...} and \isatext{...} in custom symbol
8998 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
8999 state; Note that presentation of goal states does not conform to
9000 actual human-readable proof documents. Please do not include goal
9001 states into document output unless you really know what you are doing!
9003 * proper indentation of antiquoted output with proportional LaTeX
9006 * no_document ML operator temporarily disables LaTeX document
9009 * isatool unsymbolize tunes sources for plain ASCII communication;
9014 * Pure: Isar now suffers initial goal statements to contain unbound
9015 schematic variables (this does not conform to actual readable proof
9016 documents, due to unpredictable outcome and non-compositional proof
9017 checking); users who know what they are doing may use schematic goals
9018 for Prolog-style synthesis of proven results;
9020 * Pure: assumption method (an implicit finishing) now handles actual
9023 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
9024 initial goal, declare "that" only as Pure intro (only for single
9025 steps); the "that" rule assumption may now be involved in implicit
9026 finishing, thus ".." becomes a feasible for trivial obtains;
9028 * Pure: default proof step now includes 'intro_classes'; thus trivial
9029 instance proofs may be performed by "..";
9031 * Pure: ?thesis / ?this / "..." now work for pure meta-level
9034 * Pure: more robust selection of calculational rules;
9036 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
9037 rule (as well as the assumption rule);
9039 * Pure: 'thm_deps' command visualizes dependencies of theorems and
9040 lemmas, using the graph browser tool;
9042 * Pure: predict failure of "show" in interactive mode;
9044 * Pure: 'thms_containing' now takes actual terms as arguments;
9046 * HOL: improved method 'induct' --- now handles non-atomic goals
9047 (potential INCOMPATIBILITY); tuned error handling;
9049 * HOL: cases and induct rules now provide explicit hints about the
9050 number of facts to be consumed (0 for "type" and 1 for "set" rules);
9051 any remaining facts are inserted into the goal verbatim;
9053 * HOL: local contexts (aka cases) may now contain term bindings as
9054 well; the 'cases' and 'induct' methods new provide a ?case binding for
9055 the result to be shown in each case;
9057 * HOL: added 'recdef_tc' command;
9059 * isatool convert assists in eliminating legacy ML scripts;
9064 * HOL/Library: a collection of generic theories to be used together
9065 with main HOL; the theory loader path already includes this directory
9066 by default; the following existing theories have been moved here:
9067 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
9068 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
9070 * HOL/Unix: "Some aspects of Unix file-system security", a typical
9071 modelling and verification task performed in Isabelle/HOL +
9072 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
9074 * HOL/Algebra: special summation operator SUM no longer exists, it has
9075 been replaced by setsum; infix 'assoc' now has priority 50 (like
9076 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
9077 'domain', this makes the theory consistent with mathematical
9080 * HOL basics: added overloaded operations "inverse" and "divide"
9081 (infix "/"), syntax for generic "abs" operation, generic summation
9084 * HOL/typedef: simplified package, provide more useful rules (see also
9087 * HOL/datatype: induction rule for arbitrarily branching datatypes is
9088 now expressed as a proper nested rule (old-style tactic scripts may
9089 require atomize_strip_tac to cope with non-atomic premises);
9091 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
9092 to "split_conv" (old name still available for compatibility);
9094 * HOL: improved concrete syntax for strings (e.g. allows translation
9095 rules with string literals);
9097 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
9098 and Fleuriot's mechanization of analysis, including the transcendental
9099 functions for the reals;
9101 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
9106 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
9107 "lam" is displayed as TWO lambda-symbols
9109 * CTT: theory Main now available, containing everything (that is, Bool
9115 * Pure: the Simplifier has been implemented properly as a derived rule
9116 outside of the actual kernel (at last!); the overall performance
9117 penalty in practical applications is about 50%, while reliability of
9118 the Isabelle inference kernel has been greatly improved;
9120 * print modes "brackets" and "no_brackets" control output of nested =>
9121 (types) and ==> (props); the default behaviour is "brackets";
9123 * Provers: fast_tac (and friends) now handle actual object-logic rules
9124 as assumptions as well;
9126 * system: support Poly/ML 4.0;
9128 * system: isatool install handles KDE version 1 or 2;
9132 New in Isabelle99-1 (October 2000)
9133 ----------------------------------
9135 *** Overview of INCOMPATIBILITIES ***
9137 * HOL: simplification of natural numbers is much changed; to partly
9138 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
9139 issue the following ML commands:
9141 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
9142 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
9144 * HOL: simplification no longer dives into case-expressions; this is
9145 controlled by "t.weak_case_cong" for each datatype t;
9147 * HOL: nat_less_induct renamed to less_induct;
9149 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
9150 fixsome to patch .thy and .ML sources automatically;
9152 select_equality -> some_equality
9153 select_eq_Ex -> some_eq_ex
9154 selectI2EX -> someI2_ex
9157 select1_equality -> some1_equality
9158 Eps_sym_eq -> some_sym_eq_trivial
9159 Eps_eq -> some_eq_trivial
9161 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
9163 * HOL: removed obsolete theorem binding expand_if (refer to split_if
9166 * HOL: the recursion equations generated by 'recdef' are now called
9167 f.simps instead of f.rules;
9169 * HOL: qed_spec_mp now also handles bounded ALL as well;
9171 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
9172 sometimes be needed;
9174 * HOL: the constant for "f``x" is now "image" rather than "op ``";
9176 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
9178 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
9179 product is now "<*>" instead of "Times"; the lexicographic product is
9180 now "<*lex*>" instead of "**";
9182 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
9183 of main HOL, but was unused); better use HOL's datatype package;
9185 * HOL: removed "symbols" syntax for constant "override" of theory Map;
9186 the old syntax may be recovered as follows:
9189 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
9190 (infixl "\\<oplus>" 100)
9192 * HOL/Real: "rabs" replaced by overloaded "abs" function;
9194 * HOL/ML: even fewer consts are declared as global (see theories Ord,
9195 Lfp, Gfp, WF); this only affects ML packages that refer to const names
9198 * HOL and ZF: syntax for quotienting wrt an equivalence relation
9199 changed from A/r to A//r;
9201 * ZF: new treatment of arithmetic (nat & int) may break some old
9204 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
9205 rulify -> rule_format, elimify -> elim_format, ...);
9207 * Isar/Provers: intro/elim/dest attributes changed; renamed
9208 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
9209 should have to change intro!! to intro? only); replaced "delrule" by
9212 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
9214 * Provers: strengthened force_tac by using new first_best_tac;
9216 * LaTeX document preparation: several changes of isabelle.sty (see
9220 *** Document preparation ***
9222 * formal comments (text blocks etc.) in new-style theories may now
9223 contain antiquotations of thm/prop/term/typ/text to be presented
9224 according to latex print mode; concrete syntax is like this:
9225 @{term[show_types] "f(x) = a + x"};
9227 * isatool mkdir provides easy setup of Isabelle session directories,
9228 including proper document sources;
9230 * generated LaTeX sources are now deleted after successful run
9231 (isatool document -c); may retain a copy somewhere else via -D option
9234 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
9235 style files, achieving self-contained LaTeX sources and simplifying
9238 * old-style theories now produce (crude) LaTeX output as well;
9240 * browser info session directories are now self-contained (may be put
9241 on WWW server seperately); improved graphs of nested sessions; removed
9242 graph for 'all sessions';
9244 * several improvements in isabelle style files; \isabellestyle{it}
9245 produces fake math mode output; \isamarkupheader is now \section by
9246 default; see lib/texinputs/isabelle.sty etc.;
9251 * Isar/Pure: local results and corresponding term bindings are now
9252 subject to Hindley-Milner polymorphism (similar to ML); this
9253 accommodates incremental type-inference very nicely;
9255 * Isar/Pure: new derived language element 'obtain' supports
9256 generalized existence reasoning;
9258 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
9259 support accumulation of results, without applying any rules yet;
9260 useful to collect intermediate results without explicit name
9261 references, and for use with transitivity rules with more than 2
9264 * Isar/Pure: scalable support for case-analysis type proofs: new
9265 'case' language element refers to local contexts symbolically, as
9266 produced by certain proof methods; internally, case names are attached
9267 to theorems as "tags";
9269 * Isar/Pure: theory command 'hide' removes declarations from
9270 class/type/const name spaces;
9272 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
9273 indicate potential overloading;
9275 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
9277 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
9278 "{a,b,c}" instead of {a,b,c};
9280 * Isar/Pure now provides its own version of intro/elim/dest
9281 attributes; useful for building new logics, but beware of confusion
9282 with the version in Provers/classical;
9284 * Isar/Pure: the local context of (non-atomic) goals is provided via
9285 case name 'antecedent';
9287 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
9288 to the current context is now done automatically);
9290 * Isar/Pure: theory command 'method_setup' provides a simple interface
9291 for definining proof methods in ML;
9293 * Isar/Provers: intro/elim/dest attributes changed; renamed
9294 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
9295 most cases, one should have to change intro!! to intro? only);
9296 replaced "delrule" by "rule del";
9298 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
9299 'symmetric' attribute (the latter supercedes [RS sym]);
9301 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
9302 method modifier); 'simp' method: 'only:' modifier removes loopers as
9303 well (including splits);
9305 * Isar/Provers: Simplifier and Classical methods now support all kind
9306 of modifiers used in the past, including 'cong', 'iff', etc.
9308 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
9309 of Simplifier and Classical reasoner);
9311 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
9312 now support named cases; major packages (inductive, datatype, primrec,
9313 recdef) support case names and properly name parameters;
9315 * Isar/HOL: new transitivity rules for substitution in inequalities --
9316 monotonicity conditions are extracted to be proven at end of
9319 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
9322 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
9323 split_if split_if_asm; datatype package provides theorems foo.splits =
9324 foo.split foo.split_asm for each datatype;
9326 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
9327 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
9328 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
9329 use "(cases (simplified))" method in proper proof texts);
9331 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
9333 * Isar: names of theorems etc. may be natural numbers as well;
9335 * Isar: 'pr' command: optional arguments for goals_limit and
9336 ProofContext.prems_limit; no longer prints theory contexts, but only
9339 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
9340 additional print modes to be specified; e.g. "pr(latex)" will print
9341 proof state according to the Isabelle LaTeX style;
9343 * Isar: improved support for emulating tactic scripts, including proof
9344 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
9345 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
9346 (for HOL datatypes);
9348 * Isar: simplified (more robust) goal selection of proof methods: 1st
9349 goal, all goals, or explicit goal specifier (tactic emulation); thus
9350 'proof method scripts' have to be in depth-first order;
9352 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
9354 * Isar: removed 'help' command, which hasn't been too helpful anyway;
9355 should instead use individual commands for printing items
9356 (print_commands, print_methods etc.);
9358 * Isar: added 'nothing' --- the empty list of theorems;
9363 * HOL/MicroJava: formalization of a fragment of Java, together with a
9364 corresponding virtual machine and a specification of its bytecode
9365 verifier and a lightweight bytecode verifier, including proofs of
9366 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
9367 Cornelia Pusch (see also the homepage of project Bali at
9368 http://isabelle.in.tum.de/Bali/);
9370 * HOL/Algebra: new theory of rings and univariate polynomials, by
9373 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
9374 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
9377 * HOL/Lattice: fundamental concepts of lattice theory and order
9378 structures, including duals, properties of bounds versus algebraic
9379 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
9380 Theorem for complete lattices etc.; may also serve as a demonstration
9381 for abstract algebraic reasoning using axiomatic type classes, and
9382 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
9384 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
9387 * HOL/IMPP: extension of IMP with local variables and mutually
9388 recursive procedures, by David von Oheimb;
9390 * HOL/Lambda: converted into new-style theory and document;
9392 * HOL/ex/Multiquote: example of multiple nested quotations and
9393 anti-quotations -- basically a generalized version of de-Bruijn
9394 representation; very useful in avoiding lifting of operations;
9396 * HOL/record: added general record equality rule to simpset; fixed
9397 select-update simplification procedure to handle extended records as
9398 well; admit "r" as field name;
9400 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
9401 other numeric types and also as the identity of groups, rings, etc.;
9403 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
9404 Types nat and int belong to this axclass;
9406 * HOL: greatly improved simplification involving numerals of type nat, int, real:
9407 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
9408 i*j + k + j*#3*i simplifies to #4*(i*j) + k
9409 two terms #m*u and #n*u are replaced by #(m+n)*u
9410 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
9411 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
9412 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
9414 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
9415 powerful prover for predicate logic but knows nothing of clasets; see
9416 ex/mesontest.ML and ex/mesontest2.ML for example applications;
9418 * HOL: new version of "case_tac" subsumes both boolean case split and
9419 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
9420 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
9422 * HOL: simplification no longer dives into case-expressions: only the
9423 selector expression is simplified, but not the remaining arms; to
9424 enable full simplification of case-expressions for datatype t, you may
9425 remove t.weak_case_cong from the simpset, either globally (Delcongs
9426 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
9428 * HOL/recdef: the recursion equations generated by 'recdef' for
9429 function 'f' are now called f.simps instead of f.rules; if all
9430 termination conditions are proved automatically, these simplification
9431 rules are added to the simpset, as in primrec; rules may be named
9432 individually as well, resulting in a separate list of theorems for
9435 * HOL/While is a new theory that provides a while-combinator. It
9436 permits the definition of tail-recursive functions without the
9437 provision of a termination measure. The latter is necessary once the
9438 invariant proof rule for while is applied.
9440 * HOL: new (overloaded) notation for the set of elements below/above
9441 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
9443 * HOL: theorems impI, allI, ballI bound as "strip";
9445 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
9446 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
9447 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
9449 * HOL/Real: "rabs" replaced by overloaded "abs" function;
9451 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
9452 main HOL, but was unused);
9454 * HOL: fewer consts declared as global (e.g. have to refer to
9455 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
9457 * HOL: tuned AST representation of nested pairs, avoiding bogus output
9458 in case of overlap with user translations (e.g. judgements over
9459 tuples); (note that the underlying logical represenation is still
9465 * ZF: simplification automatically cancels common terms in arithmetic
9466 expressions over nat and int;
9468 * ZF: new treatment of nat to minimize type-checking: all operators
9469 coerce their operands to a natural number using the function natify,
9470 making the algebraic laws unconditional;
9472 * ZF: as above, for int: operators coerce their operands to an integer
9473 using the function intify;
9475 * ZF: the integer library now contains many of the usual laws for the
9476 orderings, including $<=, and monotonicity laws for $+ and $*;
9478 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
9481 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
9482 to the simplifier and classical reasoner simultaneously;
9487 * Provers: blast_tac now handles actual object-logic rules as
9488 assumptions; note that auto_tac uses blast_tac internally as well;
9490 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
9491 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
9493 * Provers: delrules now handles destruct rules as well (no longer need
9494 explicit make_elim);
9496 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
9497 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
9498 use instead the strong form,
9499 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
9500 in HOL, FOL and ZF the function cla_make_elim will create such rules
9501 from destruct-rules;
9503 * Provers: Simplifier.easy_setup provides a fast path to basic
9504 Simplifier setup for new object-logics;
9506 * Pure: AST translation rules no longer require constant head on LHS;
9508 * Pure: improved name spaces: ambiguous output is qualified; support
9509 for hiding of names;
9511 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
9512 XSYMBOL_HOME; no longer need to do manual configuration in most
9515 * system: compression of ML heaps images may now be controlled via -c
9516 option of isabelle and isatool usedir (currently only observed by
9519 * system: isatool installfonts may handle X-Symbol fonts as well (very
9520 useful for remote X11);
9522 * system: provide TAGS file for Isabelle sources;
9524 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
9527 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
9528 timing flag supersedes proof_timing and Toplevel.trace;
9530 * ML: new combinators |>> and |>>> for incremental transformations
9531 with secondary results (e.g. certain theory extensions):
9533 * ML: PureThy.add_defs gets additional argument to indicate potential
9534 overloading (usually false);
9536 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
9541 New in Isabelle99 (October 1999)
9542 --------------------------------
9544 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9546 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
9547 are no longer simplified. (This allows the simplifier to unfold recursive
9548 functional programs.) To restore the old behaviour, declare
9550 Delcongs [if_weak_cong];
9552 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
9555 * HOL: the predicate "inj" is now defined by translation to "inj_on";
9557 * HOL/datatype: mutual_induct_tac no longer exists --
9558 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
9560 * HOL/typedef: fixed type inference for representing set; type
9561 arguments now have to occur explicitly on the rhs as type constraints;
9563 * ZF: The con_defs part of an inductive definition may no longer refer
9564 to constants declared in the same theory;
9566 * HOL, ZF: the function mk_cases, generated by the inductive
9567 definition package, has lost an argument. To simplify its result, it
9568 uses the default simpset instead of a supplied list of theorems.
9570 * HOL/List: the constructors of type list are now Nil and Cons;
9572 * Simplifier: the type of the infix ML functions
9573 setSSolver addSSolver setSolver addSolver
9574 is now simpset * solver -> simpset where `solver' is a new abstract type
9575 for packaging solvers. A solver is created via
9576 mk_solver: string -> (thm list -> int -> tactic) -> solver
9577 where the string argument is only a comment.
9582 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
9583 decision procedure for linear arithmetic. Currently it is used for
9584 types `nat', `int', and `real' in HOL (see below); it can, should and
9585 will be instantiated for other types and logics as well.
9587 * The simplifier now accepts rewrite rules with flexible heads, eg
9588 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
9589 They are applied like any rule with a non-pattern lhs, i.e. by first-order
9595 * New Isabelle/Isar subsystem provides an alternative to traditional
9596 tactical theorem proving; together with the ProofGeneral/isar user
9597 interface it offers an interactive environment for developing human
9598 readable proof documents (Isar == Intelligible semi-automated
9599 reasoning); for further information see isatool doc isar-ref,
9600 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
9602 * improved and simplified presentation of theories: better HTML markup
9603 (including colors), graph views in several sizes; isatool usedir now
9604 provides a proper interface for user theories (via -P option); actual
9605 document preparation based on (PDF)LaTeX is available as well (for
9606 new-style theories only); see isatool doc system for more information;
9608 * native support for Proof General, both for classic Isabelle and
9611 * ML function thm_deps visualizes dependencies of theorems and lemmas,
9612 using the graph browser tool;
9614 * Isabelle manuals now also available as PDF;
9616 * theory loader rewritten from scratch (may not be fully
9617 bug-compatible); old loadpath variable has been replaced by show_path,
9618 add_path, del_path, reset_path functions; new operations such as
9619 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
9622 * improved isatool install: option -k creates KDE application icon,
9623 option -p DIR installs standalone binaries;
9625 * added ML_PLATFORM setting (useful for cross-platform installations);
9626 more robust handling of platform specific ML images for SML/NJ;
9628 * the settings environment is now statically scoped, i.e. it is never
9629 created again in sub-processes invoked from isabelle, isatool, or
9632 * path element specification '~~' refers to '$ISABELLE_HOME';
9634 * in locales, the "assumes" and "defines" parts may be omitted if
9637 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
9640 * new print_mode "HTML";
9642 * new flag show_tags controls display of tags of theorems (which are
9643 basically just comments that may be attached by some tools);
9645 * Isamode 2.6 requires patch to accomodate change of Isabelle font
9646 mode and goal output format:
9648 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
9650 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
9652 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
9653 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
9655 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
9657 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
9659 * function bind_thms stores lists of theorems (cf. bind_thm);
9661 * new shorthand tactics ftac, eatac, datac, fatac;
9663 * qed (and friends) now accept "" as result name; in that case the
9664 theorem is not stored, but proper checks and presentation of the
9667 * theorem database now also indexes constants "Trueprop", "all",
9668 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
9673 ** HOL arithmetic **
9675 * There are now decision procedures for linear arithmetic over nat and
9678 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
9679 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
9680 are treated as atomic; subformulae not involving type `nat' or `int'
9681 are ignored; quantified subformulae are ignored unless they are
9682 positive universal or negative existential. The tactic has to be
9683 invoked by hand and can be a little bit slow. In particular, the
9684 running time is exponential in the number of occurrences of `min' and
9685 `max', and `-' on `nat'.
9687 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
9688 (negated) (in)equalities among the premises and the conclusion into
9689 account (i.e. no compound formulae) and does not know about `min' and
9690 `max', and `-' on `nat'. It is fast and is used automatically by the
9693 NB: At the moment, these decision procedures do not cope with mixed
9694 nat/int formulae where the two parts interact, such as `m < n ==>
9697 * HOL/Numeral provides a generic theory of numerals (encoded
9698 efficiently as bit strings); setup for types nat/int/real is in place;
9699 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
9700 int, existing theories and proof scripts may require a few additional
9703 * integer division and remainder can now be performed on constant
9706 * many properties of integer multiplication, division and remainder
9709 * An interface to the Stanford Validity Checker (SVC) is available through the
9710 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
9711 are proved automatically. SVC must be installed separately, and its results
9712 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
9713 invocation of the underlying oracle). For SVC see
9714 http://verify.stanford.edu/SVC
9716 * IsaMakefile: the HOL-Real target now builds an actual image;
9721 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
9722 (in Isabelle/Isar) -- by Gertrud Bauer;
9724 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
9725 analysis for assembly languages with subtypes;
9727 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
9728 -- avoids syntactic ambiguities and treats state, transition, and
9729 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
9730 changed syntax and (many) tactics;
9732 * HOL/inductive: Now also handles more general introduction rules such
9733 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
9734 theorems are now maintained within the theory (maintained via the
9737 * HOL/datatype: Now also handles arbitrarily branching datatypes
9738 (using function types) such as
9740 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
9742 * HOL/record: record_simproc (part of the default simpset) takes care
9743 of selectors applied to updated records; record_split_tac is no longer
9744 part of the default claset; update_defs may now be removed from the
9745 simpset in many cases; COMPATIBILITY: old behavior achieved by
9747 claset_ref () := claset() addSWrapper record_split_wrapper;
9748 Delsimprocs [record_simproc]
9750 * HOL/typedef: fixed type inference for representing set; type
9751 arguments now have to occur explicitly on the rhs as type constraints;
9753 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
9754 names rather than an ML expression;
9756 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
9757 supplied later. Program schemes can be defined, such as
9758 "While B C s = (if B s then While B C (C s) else s)"
9759 where the well-founded relation can be chosen after B and C have been given.
9761 * HOL/List: the constructors of type list are now Nil and Cons;
9762 INCOMPATIBILITY: while [] and infix # syntax is still there, of
9763 course, ML tools referring to List.list.op # etc. have to be adapted;
9765 * HOL_quantifiers flag superseded by "HOL" print mode, which is
9766 disabled by default; run isabelle with option -m HOL to get back to
9767 the original Gordon/HOL-style output;
9769 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
9770 ALL x<=y. P, EX x<y. P, EX x<=y. P;
9772 * HOL basic syntax simplified (more orthogonal): all variants of
9773 All/Ex now support plain / symbolic / HOL notation; plain syntax for
9774 Eps operator is provided as well: "SOME x. P[x]";
9776 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
9778 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
9779 thus available for user theories;
9781 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
9782 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
9785 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
9786 several times and then mp;
9791 * the notation <<...>> is now available as a notation for sequences of
9794 * the simplifier is now installed
9796 * the axiom system has been generalized (thanks to Soren Heilmann)
9798 * the classical reasoner now has a default rule database
9803 * new primrec section allows primitive recursive functions to be given
9804 directly (as in HOL) over datatypes and the natural numbers;
9806 * new tactics induct_tac and exhaust_tac for induction (or case
9807 analysis) over datatypes and the natural numbers;
9809 * the datatype declaration of type T now defines the recursor T_rec;
9811 * simplification automatically does freeness reasoning for datatype
9814 * automatic type-inference, with AddTCs command to insert new
9815 type-checking rules;
9817 * datatype introduction rules are now added as Safe Introduction rules
9820 * the syntax "if P then x else y" is now available in addition to
9824 *** Internal programming interfaces ***
9826 * tuned simplifier trace output; new flag debug_simp;
9828 * structures Vartab / Termtab (instances of TableFun) offer efficient
9829 tables indexed by indexname_ord / term_ord (compatible with aconv);
9831 * AxClass.axclass_tac lost the theory argument;
9833 * tuned current_goals_markers semantics: begin / end goal avoids
9834 printing empty lines;
9836 * removed prs and prs_fn hook, which was broken because it did not
9837 include \n in its semantics, forcing writeln to add one
9838 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
9839 string -> unit if you really want to output text without newline;
9841 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
9842 plain output, interface builders may have to enable 'isabelle_font'
9843 mode to get Isabelle font glyphs as before;
9845 * refined token_translation interface; INCOMPATIBILITY: output length
9846 now of type real instead of int;
9848 * theory loader actions may be traced via new ThyInfo.add_hook
9849 interface (see src/Pure/Thy/thy_info.ML); example application: keep
9850 your own database of information attached to *whole* theories -- as
9851 opposed to intra-theory data slots offered via TheoryDataFun;
9853 * proper handling of dangling sort hypotheses (at last!);
9854 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
9855 extra sort hypotheses that can be witnessed from the type signature;
9856 the force_strip_shyps flag is gone, any remaining shyps are simply
9857 left in the theorem (with a warning issued by strip_shyps_warning);
9861 New in Isabelle98-1 (October 1998)
9862 ----------------------------------
9864 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9866 * several changes of automated proof tools;
9868 * HOL: major changes to the inductive and datatype packages, including
9869 some minor incompatibilities of theory syntax;
9871 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
9874 * HOL: removed duplicate thms in Arith:
9875 less_imp_add_less should be replaced by trans_less_add1
9876 le_imp_add_le should be replaced by trans_le_add1
9878 * HOL: unary minus is now overloaded (new type constraints may be
9881 * HOL and ZF: unary minus for integers is now #- instead of #~. In
9882 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
9883 now taken as an integer constant.
9885 * Pure: ML function 'theory_of' renamed to 'theory';
9891 1. Asm_full_simp_tac is now more aggressive.
9892 1. It will sometimes reorient premises if that increases their power to
9894 2. It does no longer proceed strictly from left to right but may also
9895 rotate premises to achieve further simplification.
9896 For compatibility reasons there is now Asm_lr_simp_tac which is like the
9897 old Asm_full_simp_tac in that it does not rotate premises.
9898 2. The simplifier now knows a little bit about nat-arithmetic.
9900 * Classical reasoner: wrapper mechanism for the classical reasoner now
9901 allows for selected deletion of wrappers, by introduction of names for
9902 wrapper functionals. This implies that addbefore, addSbefore,
9903 addaltern, and addSaltern now take a pair (name, tactic) as argument,
9904 and that adding two tactics with the same name overwrites the first
9905 one (emitting a warning).
9906 type wrapper = (int -> tactic) -> (int -> tactic)
9907 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
9908 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
9909 delWrapper, delSWrapper: claset * string -> claset
9910 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
9912 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
9913 semantics; addbefore now affects only the unsafe part of step_tac
9914 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
9915 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
9918 * Classical reasoner: setwrapper to setWrapper and compwrapper to
9919 compWrapper; added safe wrapper (and access functions for it);
9921 * HOL/split_all_tac is now much faster and fails if there is nothing
9922 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
9923 and the names of the automatically generated variables have changed.
9924 split_all_tac has moved within claset() from unsafe wrappers to safe
9925 wrappers, which means that !!-bound variables are split much more
9926 aggressively, and safe_tac and clarify_tac now split such variables.
9927 If this splitting is not appropriate, use delSWrapper "split_all_tac".
9928 Note: the same holds for record_split_tac, which does the job of
9929 split_all_tac for record fields.
9931 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
9932 permanently to the default simpset using Addsplits just like
9933 Addsimps. They can be removed via Delsplits just like
9934 Delsimps. Lower-case versions are also available.
9936 * HOL/Simplifier: The rule split_if is now part of the default
9937 simpset. This means that the simplifier will eliminate all occurrences
9938 of if-then-else in the conclusion of a goal. To prevent this, you can
9939 either remove split_if completely from the default simpset by
9940 `Delsplits [split_if]' or remove it in a specific call of the
9941 simplifier using `... delsplits [split_if]'. You can also add/delete
9942 other case splitting rules to/from the default simpset: every datatype
9943 generates suitable rules `split_t_case' and `split_t_case_asm' (where
9944 t is the name of the datatype).
9946 * Classical reasoner / Simplifier combination: new force_tac (and
9947 derivatives Force_tac, force) combines rewriting and classical
9948 reasoning (and whatever other tools) similarly to auto_tac, but is
9949 aimed to solve the given subgoal completely.
9954 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
9955 and `goalw': the theory is no longer needed as an explicit argument -
9956 the current theory context is used; assumptions are no longer returned
9957 at the ML-level unless one of them starts with ==> or !!; it is
9958 recommended to convert to these new commands using isatool fixgoal
9959 (backup your sources first!);
9961 * new top-level commands 'thm' and 'thms' for retrieving theorems from
9962 the current theory context, and 'theory' to lookup stored theories;
9964 * new theory section 'locale' for declaring constants, assumptions and
9965 definitions that have local scope;
9967 * new theory section 'nonterminals' for purely syntactic types;
9969 * new theory section 'setup' for generic ML setup functions
9970 (e.g. package initialization);
9972 * the distribution now includes Isabelle icons: see
9973 lib/logo/isabelle-{small,tiny}.xpm;
9975 * isatool install - install binaries with absolute references to
9978 * isatool logo -- create instances of the Isabelle logo (as EPS);
9980 * print mode 'emacs' reserved for Isamode;
9982 * support multiple print (ast) translations per constant name;
9984 * theorems involving oracles are now printed with a suffixed [!];
9989 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
9991 * HOL/inductive package reorganized and improved: now supports mutual
9997 oddI "n : EVEN ==> Suc n : ODD"
9998 evenI "n : ODD ==> Suc n : EVEN"
10000 new theorem list "elims" contains an elimination rule for each of the
10001 recursive sets; inductive definitions now handle disjunctive premises
10002 correctly (also ZF);
10004 INCOMPATIBILITIES: requires Inductive as an ancestor; component
10005 "mutual_induct" no longer exists - the induction rule is always
10006 contained in "induct";
10009 * HOL/datatype package re-implemented and greatly improved: now
10010 supports mutually recursive datatypes such as
10013 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
10014 | SUM ('a aexp) ('a aexp)
10015 | DIFF ('a aexp) ('a aexp)
10018 'a bexp = LESS ('a aexp) ('a aexp)
10019 | AND ('a bexp) ('a bexp)
10020 | OR ('a bexp) ('a bexp)
10022 as well as indirectly recursive datatypes such as
10025 ('a, 'b) term = Var 'a
10026 | App 'b ((('a, 'b) term) list)
10028 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
10029 induction on mutually / indirectly recursive datatypes.
10031 Primrec equations are now stored in theory and can be accessed via
10032 <function_name>.simps.
10036 - Theories using datatypes must now have theory Datatype as an
10038 - The specific <typename>.induct_tac no longer exists - use the
10039 generic induct_tac instead.
10040 - natE has been renamed to nat.exhaust - use exhaust_tac
10041 instead of res_inst_tac ... natE. Note that the variable
10042 names in nat.exhaust differ from the names in natE, this
10043 may cause some "fragile" proofs to fail.
10044 - The theorems split_<typename>_case and split_<typename>_case_asm
10045 have been renamed to <typename>.split and <typename>.split_asm.
10046 - Since default sorts of type variables are now handled correctly,
10047 some datatype definitions may have to be annotated with explicit
10049 - Primrec definitions no longer require function name and type
10050 of recursive argument.
10052 Consider using isatool fixdatatype to adapt your theories and proof
10053 scripts to the new package (backup your sources first!).
10056 * HOL/record package: considerably improved implementation; now
10057 includes concrete syntax for record types, terms, updates; theorems
10058 for surjective pairing and splitting !!-bound record variables; proof
10059 support is as follows:
10061 1) standard conversions (selectors or updates applied to record
10062 constructor terms) are part of the standard simpset;
10064 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
10065 made part of standard simpset and claset via addIffs;
10067 3) a tactic for record field splitting (record_split_tac) is part of
10068 the standard claset (addSWrapper);
10070 To get a better idea about these rules you may retrieve them via
10071 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
10072 the name of your record type.
10074 The split tactic 3) conceptually simplifies by the following rule:
10076 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
10078 Thus any record variable that is bound by meta-all will automatically
10079 blow up into some record constructor term, consequently the
10080 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
10081 solve record problems automatically.
10084 * reorganized the main HOL image: HOL/Integ and String loaded by
10085 default; theory Main includes everything;
10087 * automatic simplification of integer sums and comparisons, using cancellation;
10089 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
10091 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
10093 * many new identities for unions, intersections, set difference, etc.;
10095 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
10096 called split_if, split_split, split_sum_case and split_nat_case (to go
10097 with add/delsplits);
10099 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
10100 (?x::unit) = (); this is made part of the default simpset, which COULD
10101 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
10102 'Delsimprocs [unit_eq_proc];' as last resort); also note that
10103 unit_abs_eta_conv is added in order to counter the effect of
10104 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
10107 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
10110 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
10111 It and 'sym RS equals0D' are now in the default claset, giving automatic
10112 disjointness reasoning but breaking a few old proofs.
10114 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
10115 to 'converse' from 'inverse' (for compatibility with ZF and some
10118 * HOL/recdef can now declare non-recursive functions, with {} supplied as
10119 the well-founded relation;
10121 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
10122 Compl A. The "Compl" syntax remains available as input syntax for this
10125 * HOL/Update: new theory of function updates:
10126 f(a:=b) == %x. if x=a then b else f x
10127 may also be iterated as in f(a:=b,c:=d,...);
10129 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
10132 - new function list_update written xs[i:=v] that updates the i-th
10133 list position. May also be iterated as in xs[i:=a,j:=b,...].
10134 - new function `upt' written [i..j(] which generates the list
10135 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
10136 bound write [i..j], which is a shorthand for [i..j+1(].
10137 - new lexicographic orderings and corresponding wellfoundedness theorems.
10140 - removed 'pred' (predecessor) function;
10141 - generalized some theorems about n-1;
10142 - many new laws about "div" and "mod";
10143 - new laws about greatest common divisors (see theory ex/Primes);
10145 * HOL/Relation: renamed the relational operator r^-1 "converse"
10146 instead of "inverse";
10148 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
10149 of the multiset ordering;
10151 * directory HOL/Real: a construction of the reals using Dedekind cuts
10152 (not included by default);
10154 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
10156 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
10157 programs, i.e. different program variables may have different types.
10159 * calling (stac rew i) now fails if "rew" has no effect on the goal
10160 [previously, this check worked only if the rewrite rule was unconditional]
10161 Now rew can involve either definitions or equalities (either == or =).
10166 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
10167 only the theorems proved on ZF.ML;
10169 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
10170 It and 'sym RS equals0D' are now in the default claset, giving automatic
10171 disjointness reasoning but breaking a few old proofs.
10173 * ZF/Update: new theory of function updates
10174 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
10175 may also be iterated as in f(a:=b,c:=d,...);
10177 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
10179 * calling (stac rew i) now fails if "rew" has no effect on the goal
10180 [previously, this check worked only if the rewrite rule was unconditional]
10181 Now rew can involve either definitions or equalities (either == or =).
10183 * case_tac provided for compatibility with HOL
10184 (like the old excluded_middle_tac, but with subgoals swapped)
10187 *** Internal programming interfaces ***
10189 * Pure: several new basic modules made available for general use, see
10190 also src/Pure/README;
10192 * improved the theory data mechanism to support encapsulation (data
10193 kind name replaced by private Object.kind, acting as authorization
10194 key); new type-safe user interface via functor TheoryDataFun; generic
10195 print_data function becomes basically useless;
10197 * removed global_names compatibility flag -- all theory declarations
10198 are qualified by default;
10200 * module Pure/Syntax now offers quote / antiquote translation
10201 functions (useful for Hoare logic etc. with implicit dependencies);
10202 see HOL/ex/Antiquote for an example use;
10204 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
10207 * new tactical CHANGED_GOAL for checking that a tactic modifies a
10210 * Display.print_goals function moved to Locale.print_goals;
10212 * standard print function for goals supports current_goals_markers
10213 variable for marking begin of proof, end of proof, start of goal; the
10214 default is ("", "", ""); setting current_goals_markers := ("<proof>",
10215 "</proof>", "<goal>") causes SGML like tagged proof state printing,
10220 New in Isabelle98 (January 1998)
10221 --------------------------------
10223 *** Overview of INCOMPATIBILITIES (see below for more details) ***
10225 * changed lexical syntax of terms / types: dots made part of long
10226 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
10228 * simpset (and claset) reference variable replaced by functions
10229 simpset / simpset_ref;
10231 * no longer supports theory aliases (via merge) and non-trivial
10232 implicit merge of thms' signatures;
10234 * most internal names of constants changed due to qualified names;
10236 * changed Pure/Sequence interface (see Pure/seq.ML);
10239 *** General Changes ***
10241 * hierachically structured name spaces (for consts, types, axms, thms
10242 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
10243 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
10244 isatool fixdots ensures space after dots (e.g. "%x. x"); set
10245 long_names for fully qualified output names; NOTE: ML programs
10246 (special tactics, packages etc.) referring to internal names may have
10247 to be adapted to cope with fully qualified names; in case of severe
10248 backward campatibility problems try setting 'global_names' at compile
10249 time to have enrything declared within a flat name space; one may also
10250 fine tune name declarations in theories via the 'global' and 'local'
10253 * reimplemented the implicit simpset and claset using the new anytype
10254 data filed in signatures; references simpset:simpset ref etc. are
10255 replaced by functions simpset:unit->simpset and
10256 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
10257 to patch your ML files accordingly;
10259 * HTML output now includes theory graph data for display with Java
10260 applet or isatool browser; data generated automatically via isatool
10261 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
10263 * defs may now be conditional; improved rewrite_goals_tac to handle
10264 conditional equations;
10266 * defs now admits additional type arguments, using TYPE('a) syntax;
10268 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
10269 creates a new theory node; implicit merge of thms' signatures is
10270 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
10271 transfer:theory->thm->thm in (rare) cases;
10273 * improved handling of draft signatures / theories; draft thms (and
10274 ctyps, cterms) are automatically promoted to real ones;
10276 * slightly changed interfaces for oracles: admit many per theory, named
10277 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
10279 * print_goals: optional output of const types (set show_consts and
10282 * improved output of warnings (###) and errors (***);
10284 * subgoal_tac displays a warning if the new subgoal has type variables;
10286 * removed old README and Makefiles;
10288 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
10290 * removed obsolete init_pps and init_database;
10292 * deleted the obsolete tactical STATE, which was declared by
10293 fun STATE tacfun st = tacfun st st;
10295 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
10296 (which abbreviates $HOME);
10298 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
10299 use isatool fixseq to adapt your ML programs (this works for fully
10300 qualified references to the Sequence structure only!);
10302 * use_thy no longer requires writable current directory; it always
10303 reloads .ML *and* .thy file, if either one is out of date;
10306 *** Classical Reasoner ***
10308 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
10309 tactics that use classical reasoning to simplify a subgoal without
10310 splitting it into several subgoals;
10312 * Safe_tac: like safe_tac but uses the default claset;
10317 * added simplification meta rules:
10318 (asm_)(full_)simplify: simpset -> thm -> thm;
10320 * simplifier.ML no longer part of Pure -- has to be loaded by object
10323 * added prems argument to simplification procedures;
10325 * HOL, FOL, ZF: added infix function `addsplits':
10326 instead of `<simpset> setloop (split_tac <thms>)'
10327 you can simply write `<simpset> addsplits <thms>'
10332 * TYPE('a) syntax for type reflection terms;
10334 * no longer handles consts with name "" -- declare as 'syntax' instead;
10336 * pretty printer: changed order of mixfix annotation preference (again!);
10338 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
10343 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
10344 with `addloop' of the simplifier to faciliate case splitting in premises.
10346 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
10348 * HOL/Auth: new protocol proofs including some for the Internet
10351 * HOL/Map: new theory of `maps' a la VDM;
10353 * HOL/simplifier: simplification procedures nat_cancel_sums for
10354 cancelling out common nat summands from =, <, <= (in)equalities, or
10355 differences; simplification procedures nat_cancel_factor for
10356 cancelling common factor from =, <, <= (in)equalities over natural
10357 sums; nat_cancel contains both kinds of procedures, it is installed by
10358 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
10360 * HOL/simplifier: terms of the form
10361 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
10363 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
10364 and those of the form
10365 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
10367 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
10370 Each datatype `t' now comes with a theorem `split_t_case' of the form
10372 P(t_case f1 ... fn x) =
10373 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
10375 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
10378 and a theorem `split_t_case_asm' of the form
10380 P(t_case f1 ... fn x) =
10381 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
10383 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
10385 which can be added to a simpset via `addsplits'. The existing theorems
10386 expand_list_case and expand_option_case have been renamed to
10387 split_list_case and split_option_case.
10390 - `pred n' is automatically converted to `n-1'.
10391 Users are strongly encouraged not to use `pred' any longer,
10392 because it will disappear altogether at some point.
10393 - Users are strongly encouraged to write "0 < n" rather than
10394 "n ~= 0". Theorems and proof tools have been modified towards this
10398 the function "set_of_list" has been renamed "set" (and its theorems too);
10399 the function "nth" now takes its arguments in the reverse order and
10400 has acquired the infix notation "!" as in "xs!n".
10402 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
10404 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
10405 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
10407 * HOL/record: extensible records with schematic structural subtyping
10408 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
10409 still lacks various theorems and concrete record syntax;
10414 * removed "axioms" and "generated by" sections;
10416 * replaced "ops" section by extended "consts" section, which is capable of
10417 handling the continuous function space "->" directly;
10420 . proves theorems immediately and stores them in the theory,
10421 . creates hierachical name space,
10422 . now uses normal mixfix annotations (instead of cinfix...),
10423 . minor changes to some names and values (for consistency),
10424 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
10425 . separator between mutual domain defs: changed "," to "and",
10426 . improved handling of sort constraints; now they have to
10427 appear on the left-hand side of the equations only;
10429 * fixed LAM <x,y,zs>.b syntax;
10431 * added extended adm_tac to simplifier in HOLCF -- can now discharge
10432 adm (%x. P (t x)), where P is chainfinite and t continuous;
10437 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
10438 with `addloop' of the simplifier to faciliate case splitting in premises.
10440 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
10441 in HOL, they strip ALL and --> from proved theorems;
10445 New in Isabelle94-8 (May 1997)
10446 ------------------------------
10448 *** General Changes ***
10450 * new utilities to build / run / maintain Isabelle etc. (in parts
10451 still somewhat experimental); old Makefiles etc. still functional;
10453 * new 'Isabelle System Manual';
10455 * INSTALL text, together with ./configure and ./build scripts;
10457 * reimplemented type inference for greater efficiency, better error
10458 messages and clean internal interface;
10460 * prlim command for dealing with lots of subgoals (an easier way of
10461 setting goals_limit);
10466 * supports alternative (named) syntax tables (parser and pretty
10467 printer); internal interface is provided by add_modesyntax(_i);
10469 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
10470 be used in conjunction with the Isabelle symbol font; uses the
10471 "symbols" syntax table;
10473 * added token_translation interface (may translate name tokens in
10474 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
10475 the current print_mode); IMPORTANT: user print translation functions
10476 are responsible for marking newly introduced bounds
10477 (Syntax.mark_boundT);
10479 * token translations for modes "xterm" and "xterm_color" that display
10480 names in bold, underline etc. or colors (which requires a color
10483 * infixes may now be declared with names independent of their syntax;
10485 * added typed_print_translation (like print_translation, but may
10486 access type of constant);
10489 *** Classical Reasoner ***
10491 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
10492 some limitations. Blast_tac...
10493 + ignores addss, addbefore, addafter; this restriction is intrinsic
10494 + ignores elimination rules that don't have the correct format
10495 (the conclusion MUST be a formula variable)
10496 + ignores types, which can make HOL proofs fail
10497 + rules must not require higher-order unification, e.g. apply_type in ZF
10498 [message "Function Var's argument not a bound variable" relates to this]
10499 + its proof strategy is more general but can actually be slower
10501 * substitution with equality assumptions no longer permutes other
10504 * minor changes in semantics of addafter (now called addaltern); renamed
10505 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
10506 (and access functions for it);
10508 * improved combination of classical reasoner and simplifier:
10509 + functions for handling clasimpsets
10510 + improvement of addss: now the simplifier is called _after_ the
10512 + safe variant of addss called addSss: uses safe simplifications
10513 _during_ the safe steps. It is more complete as it allows multiple
10514 instantiations of unknowns (e.g. with slow_tac).
10518 * added interface for simplification procedures (functions that
10519 produce *proven* rewrite rules on the fly, depending on current
10522 * ordering on terms as parameter (used for ordered rewriting);
10524 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
10526 * the solver is now split into a safe and an unsafe part.
10527 This should be invisible for the normal user, except that the
10528 functions setsolver and addsolver have been renamed to setSolver and
10529 addSolver; added safe_asm_full_simp_tac;
10534 * a generic induction tactic `induct_tac' which works for all datatypes and
10535 also for type `nat';
10537 * a generic case distinction tactic `exhaust_tac' which works for all
10538 datatypes and also for type `nat';
10540 * each datatype comes with a function `size';
10542 * patterns in case expressions allow tuple patterns as arguments to
10543 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
10545 * primrec now also works with type nat;
10547 * recdef: a new declaration form, allows general recursive functions to be
10548 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
10550 * the constant for negation has been renamed from "not" to "Not" to
10551 harmonize with FOL, ZF, LK, etc.;
10553 * HOL/ex/LFilter theory of a corecursive "filter" functional for
10556 * HOL/Modelcheck demonstrates invocation of model checker oracle;
10558 * HOL/ex/Ring.thy declares cring_simp, which solves equational
10559 problems in commutative rings, using axiomatic type classes for + and *;
10561 * more examples in HOL/MiniML and HOL/Auth;
10563 * more default rewrite rules for quantifiers, union/intersection;
10565 * a new constant `arbitrary == @x.False';
10567 * HOLCF/IOA replaces old HOL/IOA;
10569 * HOLCF changes: derived all rules and arities
10570 + axiomatic type classes instead of classes
10571 + typedef instead of faking type definitions
10572 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
10573 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
10574 + eliminated the types void, one, tr
10575 + use unit lift and bool lift (with translations) instead of one and tr
10576 + eliminated blift from Lift3.thy (use Def instead of blift)
10577 all eliminated rules are derived as theorems --> no visible changes ;
10582 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
10583 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
10584 as ZF_cs addSIs [equalityI];
10588 New in Isabelle94-7 (November 96)
10589 ---------------------------------
10591 * allowing negative levels (as offsets) in prlev and choplev;
10593 * super-linear speedup for large simplifications;
10595 * FOL, ZF and HOL now use miniscoping: rewriting pushes
10596 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
10597 FAIL); can suppress it using the command Delsimps (ex_simps @
10598 all_simps); De Morgan laws are also now included, by default;
10600 * improved printing of ==> : ~:
10602 * new object-logic "Sequents" adds linear logic, while replacing LK
10603 and Modal (thanks to Sara Kalvala);
10605 * HOL/Auth: correctness proofs for authentication protocols;
10607 * HOL: new auto_tac combines rewriting and classical reasoning (many
10608 examples on HOL/Auth);
10610 * HOL: new command AddIffs for declaring theorems of the form P=Q to
10611 the rewriter and classical reasoner simultaneously;
10613 * function uresult no longer returns theorems in "standard" format;
10614 regain previous version by: val uresult = standard o uresult;
10618 New in Isabelle94-6
10619 -------------------
10621 * oracles -- these establish an interface between Isabelle and trusted
10622 external reasoners, which may deliver results as theorems;
10624 * proof objects (in particular record all uses of oracles);
10626 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
10628 * "constdefs" section in theory files;
10630 * "primrec" section (HOL) no longer requires names;
10632 * internal type "tactic" now simply "thm -> thm Sequence.seq";
10636 New in Isabelle94-5
10637 -------------------
10639 * reduced space requirements;
10641 * automatic HTML generation from theories;
10643 * theory files no longer require "..." (quotes) around most types;
10645 * new examples, including two proofs of the Church-Rosser theorem;
10647 * non-curried (1994) version of HOL is no longer distributed;
10651 New in Isabelle94-4
10652 -------------------
10654 * greatly reduced space requirements;
10656 * theory files (.thy) no longer require \...\ escapes at line breaks;
10658 * searchable theorem database (see the section "Retrieving theorems" on
10659 page 8 of the Reference Manual);
10661 * new examples, including Grabczewski's monumental case study of the
10664 * The previous version of HOL renamed to Old_HOL;
10666 * The new version of HOL (previously called CHOL) uses a curried syntax
10667 for functions. Application looks like f a b instead of f(a,b);
10669 * Mutually recursive inductive definitions finally work in HOL;
10671 * In ZF, pattern-matching on tuples is now available in all abstractions and
10672 translates to the operator "split";
10676 New in Isabelle94-3
10677 -------------------
10679 * new infix operator, addss, allowing the classical reasoner to
10680 perform simplification at each step of its search. Example:
10681 fast_tac (cs addss ss)
10683 * a new logic, CHOL, the same as HOL, but with a curried syntax
10684 for functions. Application looks like f a b instead of f(a,b). Also pairs
10685 look like (a,b) instead of <a,b>;
10687 * PLEASE NOTE: CHOL will eventually replace HOL!
10689 * In CHOL, pattern-matching on tuples is now available in all abstractions.
10690 It translates to the operator "split". A new theory of integers is available;
10692 * In ZF, integer numerals now denote two's-complement binary integers.
10693 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
10695 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
10696 of the Axiom of Choice;
10700 New in Isabelle94-2
10701 -------------------
10703 * Significantly faster resolution;
10705 * the different sections in a .thy file can now be mixed and repeated
10708 * Database of theorems for FOL, HOL and ZF. New
10709 commands including qed, qed_goal and bind_thm store theorems in the database.
10711 * Simple database queries: return a named theorem (get_thm) or all theorems of
10712 a given theory (thms_of), or find out what theory a theorem was proved in
10715 * Bugs fixed in the inductive definition and datatype packages;
10717 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
10718 and HOL_dup_cs obsolete;
10720 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
10723 * Simpler definition of function space in ZF;
10725 * new results about cardinal and ordinal arithmetic in ZF;
10727 * 'subtype' facility in HOL for introducing new types as subsets of existing
10730 :mode=isabelle-news:wrap=hard:maxLineLen=72: