1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in Isabelle2013-2 (December 2013)
5 -------------------------------------
7 *** Prover IDE -- Isabelle/Scala/jEdit ***
9 * More robust editing of running commands with internal forks,
10 e.g. non-terminating 'by' steps.
12 * More relaxed Sledgehammer panel: avoid repeated application of query
13 after edits surrounding the command location.
15 * More status information about commands that are interrupted
16 accidentally (via physical event or Poly/ML runtime system signal,
19 * Reactivated Isabelle/Scala kill command for external processes on
20 Mac OS X, which was accidentally broken in Isabelle2013-1 due to a
21 workaround for some Debian/Ubuntu Linux versions from 2013.
25 New in Isabelle2013-1 (November 2013)
26 -------------------------------------
30 * Discontinued obsolete 'uses' within theory header. Note that
31 commands like 'ML_file' work without separate declaration of file
32 dependencies. Minor INCOMPATIBILITY.
34 * Discontinued redundant 'use' command, which was superseded by
35 'ML_file' in Isabelle2013. Minor INCOMPATIBILITY.
37 * Simplified subscripts within identifiers, using plain \<^sub>
38 instead of the second copy \<^isub> and \<^isup>. Superscripts are
39 only for literal tokens within notation; explicit mixfix annotations
40 for consts or fixed variables may be used as fall-back for unusual
41 names. Obsolete \<twosuperior> has been expanded to \<^sup>2 in
42 Isabelle/HOL. INCOMPATIBILITY, use "isabelle update_sub_sup" to
43 standardize symbols as a starting point for further manual cleanup.
44 The ML reference variable "legacy_isub_isup" may be set as temporary
45 workaround, to make the prover accept a subset of the old identifier
48 * Document antiquotations: term style "isub" has been renamed to
49 "sub". Minor INCOMPATIBILITY.
51 * Uniform management of "quick_and_dirty" as system option (see also
52 "isabelle options"), configuration option within the context (see also
53 Config.get in Isabelle/ML), and attribute in Isabelle/Isar. Minor
54 INCOMPATIBILITY, need to use more official Isabelle means to access
55 quick_and_dirty, instead of historical poking into mutable reference.
57 * Renamed command 'print_configs' to 'print_options'. Minor
60 * Proper diagnostic command 'print_state'. Old 'pr' (with its
61 implicit change of some global references) is retained for now as
62 control command, e.g. for ProofGeneral 3.7.x.
64 * Discontinued 'print_drafts' command with its old-fashioned PS output
65 and Unix command-line print spooling. Minor INCOMPATIBILITY: use
66 'display_drafts' instead and print via the regular document viewer.
68 * Updated and extended "isar-ref" and "implementation" manual,
69 eliminated old "ref" manual.
72 *** Prover IDE -- Isabelle/Scala/jEdit ***
74 * New manual "jedit" for Isabelle/jEdit, see isabelle doc or
77 * Dockable window "Documentation" provides access to Isabelle
80 * Dockable window "Find" provides query operations for formal entities
81 (GUI front-end to 'find_theorems' command).
83 * Dockable window "Sledgehammer" manages asynchronous / parallel
84 sledgehammer runs over existing document sources, independently of
85 normal editing and checking process.
87 * Dockable window "Timing" provides an overview of relevant command
88 timing information, depending on option jedit_timing_threshold. The
89 same timing information is shown in the extended tooltip of the
90 command keyword, when hovering the mouse over it while the CONTROL or
91 COMMAND modifier is pressed.
93 * Improved dockable window "Theories": Continuous checking of proof
94 document (visible and required parts) may be controlled explicitly,
95 using check box or shortcut "C+e ENTER". Individual theory nodes may
96 be marked explicitly as required and checked in full, using check box
97 or shortcut "C+e SPACE".
99 * Improved completion mechanism, which is now managed by the
100 Isabelle/jEdit plugin instead of SideKick. Refined table of Isabelle
101 symbol abbreviations (see $ISABELLE_HOME/etc/symbols).
103 * Standard jEdit keyboard shortcut C+b complete-word is remapped to
104 isabelle.complete for explicit completion in Isabelle sources.
105 INCOMPATIBILITY wrt. jEdit defaults, may have to invent new shortcuts
108 * Improved support of various "minor modes" for Isabelle NEWS,
109 options, session ROOT etc., with completion and SideKick tree view.
111 * Strictly monotonic document update, without premature cancellation of
112 running transactions that are still needed: avoid reset/restart of
113 such command executions while editing.
115 * Support for asynchronous print functions, as overlay to existing
118 * Support for automatic tools in HOL, which try to prove or disprove
119 toplevel theorem statements.
121 * Action isabelle.reset-font-size resets main text area font size
122 according to Isabelle/Scala plugin option "jedit_font_reset_size" (see
123 also "Plugin Options / Isabelle / General"). It can be bound to some
124 keyboard shortcut by the user (e.g. C+0 and/or C+NUMPAD0).
126 * File specifications in jEdit (e.g. file browser) may refer to
127 $ISABELLE_HOME and $ISABELLE_HOME_USER on all platforms. Discontinued
128 obsolete $ISABELLE_HOME_WINDOWS variable.
130 * Improved support for Linux look-and-feel "GTK+", see also "Utilities
131 / Global Options / Appearance".
133 * Improved support of native Mac OS X functionality via "MacOSX"
134 plugin, which is now enabled by default.
139 * Commands 'interpretation' and 'sublocale' are now target-sensitive.
140 In particular, 'interpretation' allows for non-persistent
141 interpretation within "context ... begin ... end" blocks offering a
142 light-weight alternative to 'sublocale'. See "isar-ref" manual for
145 * Improved locales diagnostic command 'print_dependencies'.
147 * Discontinued obsolete 'axioms' command, which has been marked as
148 legacy since Isabelle2009-2. INCOMPATIBILITY, use 'axiomatization'
149 instead, while observing its uniform scope for polymorphism.
151 * Discontinued empty name bindings in 'axiomatization'.
154 * System option "proofs" has been discontinued. Instead the global
155 state of Proofterm.proofs is persistently compiled into logic images
156 as required, notably HOL-Proofs. Users no longer need to change
157 Proofterm.proofs dynamically. Minor INCOMPATIBILITY.
159 * Syntax translation functions (print_translation etc.) always depend
160 on Proof.context. Discontinued former "(advanced)" option -- this is
161 now the default. Minor INCOMPATIBILITY.
163 * Former global reference trace_unify_fail is now available as
164 configuration option "unify_trace_failure" (global context only).
166 * SELECT_GOAL now retains the syntactic context of the overall goal
167 state (schematic variables etc.). Potential INCOMPATIBILITY in rare
173 * Stronger precedence of syntax for big intersection and union on
174 sets, in accordance with corresponding lattice operations.
177 * Notation "{p:A. P}" now allows tuple patterns as well.
179 * Nested case expressions are now translated in a separate check phase
180 rather than during parsing. The data for case combinators is separated
181 from the datatype package. The declaration attribute
182 "case_translation" can be used to register new case combinators:
184 declare [[case_translation case_combinator constructor1 ... constructorN]]
187 - 'code_printing' unifies 'code_const' / 'code_type' / 'code_class' /
189 - 'code_identifier' declares name hints for arbitrary identifiers in
190 generated code, subsuming 'code_modulename'.
192 See the isar-ref manual for syntax diagrams, and the HOL theories for
195 * Attibute 'code': 'code' now declares concrete and abstract code
196 equations uniformly. Use explicit 'code equation' and 'code abstract'
197 to distinguish both when desired.
199 * Discontinued theories Code_Integer and Efficient_Nat by a more
200 fine-grain stack of theories Code_Target_Int, Code_Binary_Nat,
201 Code_Target_Nat and Code_Target_Numeral. See the tutorial on code
202 generation for details. INCOMPATIBILITY.
204 * Numeric types are mapped by default to target language numerals:
205 natural (replaces former code_numeral) and integer (replaces former
206 code_int). Conversions are available as integer_of_natural /
207 natural_of_integer / integer_of_nat / nat_of_integer (in HOL) and
208 Code_Numeral.integer_of_natural / Code_Numeral.natural_of_integer (in
209 ML). INCOMPATIBILITY.
211 * Function package: For mutually recursive functions f and g, separate
212 cases rules f.cases and g.cases are generated instead of unusable
213 f_g.cases which exposed internal sum types. Potential INCOMPATIBILITY,
214 in the case that the unusable rule was used nevertheless.
216 * Function package: For each function f, new rules f.elims are
217 generated, which eliminate equalities of the form "f x = t".
219 * New command 'fun_cases' derives ad-hoc elimination rules for
220 function equations as simplified instances of f.elims, analogous to
221 inductive_cases. See ~~/src/HOL/ex/Fundefs.thy for some examples.
224 - parametrized correspondence relations are now supported:
225 + parametricity theorems for the raw term can be specified in
226 the command lift_definition, which allow us to generate stronger
228 + setup_lifting generates stronger transfer rules if parametric
229 correspondence relation can be generated
230 + various new properties of the relator must be specified to support
232 + parametricity theorem for the Quotient relation can be specified
233 - setup_lifting generates domain rules for the Transfer package
234 - stronger reflexivity prover of respectfulness theorems for type
236 - ===> and --> are now local. The symbols can be introduced
237 by interpreting the locale lifting_syntax (typically in an
239 - Lifting/Transfer relevant parts of Library/Quotient_* are now in
240 Main. Potential INCOMPATIBILITY
241 - new commands for restoring and deleting Lifting/Transfer context:
242 lifting_forget, lifting_update
243 - the command print_quotmaps was renamed to print_quot_maps.
247 - better support for domains in Transfer: replace Domainp T
248 by the actual invariant in a transferred goal
249 - transfer rules can have as assumptions other transfer rules
250 - Experimental support for transferring from the raw level to the
251 abstract level: Transfer.transferred attribute
252 - Attribute version of the transfer method: untransferred attribute
254 * Reification and reflection:
255 - Reification is now directly available in HOL-Main in structure
257 - Reflection now handles multiple lists with variables also.
258 - The whole reflection stack has been decomposed into conversions.
261 * Revised devices for recursive definitions over finite sets:
262 - Only one fundamental fold combinator on finite set remains:
263 Finite_Set.fold :: ('a => 'b => 'b) => 'b => 'a set => 'b
264 This is now identity on infinite sets.
265 - Locales ("mini packages") for fundamental definitions with
266 Finite_Set.fold: folding, folding_idem.
267 - Locales comm_monoid_set, semilattice_order_set and
268 semilattice_neutr_order_set for big operators on sets.
269 See theory Big_Operators for canonical examples.
270 Note that foundational constants comm_monoid_set.F and
271 semilattice_set.F correspond to former combinators fold_image
272 and fold1 respectively. These are now gone. You may use
273 those foundational constants as substitutes, but it is
274 preferable to interpret the above locales accordingly.
275 - Dropped class ab_semigroup_idem_mult (special case of lattice,
276 no longer needed in connection with Finite_Set.fold etc.)
278 card.union_inter ~> card_Un_Int [symmetric]
279 card.union_disjoint ~> card_Un_disjoint
282 * Locale hierarchy for abstract orderings and (semi)lattices.
284 * Complete_Partial_Order.admissible is defined outside the type class
285 ccpo, but with mandatory prefix ccpo. Admissibility theorems lose the
286 class predicate assumption or sort constraint when possible.
289 * Introduce type class "conditionally_complete_lattice": Like a
290 complete lattice but does not assume the existence of the top and
291 bottom elements. Allows to generalize some lemmas about reals and
292 extended reals. Removed SupInf and replaced it by the instantiation
293 of conditionally_complete_lattice for real. Renamed lemmas about
294 conditionally-complete lattice from Sup_... to cSup_... and from
295 Inf_... to cInf_... to avoid hidding of similar complete lattice
298 * Introduce type class linear_continuum as combination of
299 conditionally-complete lattices and inner dense linorders which have
300 more than one element. INCOMPATIBILITY.
302 * Introduced type classes order_top and order_bot. The old classes top
303 and bot only contain the syntax without assumptions. INCOMPATIBILITY:
304 Rename bot -> order_bot, top -> order_top
306 * Introduce type classes "no_top" and "no_bot" for orderings without
307 top and bottom elements.
309 * Split dense_linorder into inner_dense_order and no_top, no_bot.
311 * Complex_Main: Unify and move various concepts from
312 HOL-Multivariate_Analysis to HOL-Complex_Main.
314 - Introduce type class (lin)order_topology and
315 linear_continuum_topology. Allows to generalize theorems about
316 limits and order. Instances are reals and extended reals.
318 - continuous and continuos_on from Multivariate_Analysis:
319 "continuous" is the continuity of a function at a filter. "isCont"
320 is now an abbrevitation: "isCont x f == continuous (at _) f".
322 Generalized continuity lemmas from isCont to continuous on an
325 - compact from Multivariate_Analysis. Use Bolzano's lemma to prove
326 compactness of closed intervals on reals. Continuous functions
327 attain infimum and supremum on compact sets. The inverse of a
328 continuous function is continuous, when the function is continuous
331 - connected from Multivariate_Analysis. Use it to prove the
332 intermediate value theorem. Show connectedness of intervals on
333 linear_continuum_topology).
335 - first_countable_topology from Multivariate_Analysis. Is used to
336 show equivalence of properties on the neighbourhood filter of x and
337 on all sequences converging to x.
339 - FDERIV: Definition of has_derivative moved to Deriv.thy. Moved
340 theorems from Library/FDERIV.thy to Deriv.thy and base the
341 definition of DERIV on FDERIV. Add variants of DERIV and FDERIV
342 which are restricted to sets, i.e. to represent derivatives from
345 - Removed the within-filter. It is replaced by the principal filter:
347 F within X = inf F (principal X)
349 - Introduce "at x within U" as a single constant, "at x" is now an
350 abbreviation for "at x within UNIV"
352 - Introduce named theorem collections tendsto_intros,
353 continuous_intros, continuous_on_intros and FDERIV_intros. Theorems
354 in tendsto_intros (or FDERIV_intros) are also available as
355 tendsto_eq_intros (or FDERIV_eq_intros) where the right-hand side
356 is replaced by a congruence rule. This allows to apply them as
357 intro rules and then proving equivalence by the simplifier.
359 - Restructured theories in HOL-Complex_Main:
361 + Moved RealDef and RComplete into Real
363 + Introduced Topological_Spaces and moved theorems about
364 topological spaces, filters, limits and continuity to it
366 + Renamed RealVector to Real_Vector_Spaces
368 + Split Lim, SEQ, Series into Topological_Spaces,
369 Real_Vector_Spaces, and Limits
371 + Moved Ln and Log to Transcendental
373 + Moved theorems about continuity from Deriv to Topological_Spaces
375 - Remove various auxiliary lemmas.
381 - Reduce incidence of "too high arity" errors
385 isar_shrink ~> isar_compress
387 - Added options "isar_try0", "spy"
388 - Better support for "isar_proofs"
389 - MaSh has been fined-tuned and now runs as a local server
391 * Improved support for ad hoc overloading of constants (see also
392 isar-ref manual and ~~/src/HOL/ex/Adhoc_Overloading_Examples.thy).
394 * Library/Polynomial.thy:
395 - Use lifting for primitive definitions.
396 - Explicit conversions from and to lists of coefficients, used for
398 - Replaced recursion operator poly_rec by fold_coeffs.
399 - Prefer pre-existing gcd operation for gcd.
401 poly_eq_iff ~> poly_eq_poly_eq_iff
403 expand_poly_eq ~> poly_eq_iff
406 * New Library/Simps_Case_Conv.thy: Provides commands simps_of_case and
407 case_of_simps to convert function definitions between a list of
408 equations with patterns on the lhs and a single equation with case
409 expressions on the rhs. See also Ex/Simps_Case_Conv_Examples.thy.
411 * New Library/FSet.thy: type of finite sets defined as a subtype of
412 sets defined by Lifting/Transfer.
414 * Discontinued theory src/HOL/Library/Eval_Witness. INCOMPATIBILITY.
416 * Consolidation of library theories on product orders:
418 Product_Lattice ~> Product_Order -- pointwise order on products
419 Product_ord ~> Product_Lexorder -- lexicographic order on products
423 * Imperative-HOL: The MREC combinator is considered legacy and no
424 longer included by default. INCOMPATIBILITY, use partial_function
425 instead, or import theory Legacy_Mrec as a fallback.
427 * HOL-Algebra: Discontinued theories ~~/src/HOL/Algebra/abstract and
428 ~~/src/HOL/Algebra/poly. Existing theories should be based on
429 ~~/src/HOL/Library/Polynomial instead. The latter provides
430 integration with HOL's type classes for rings. INCOMPATIBILITY.
433 - Various improvements to BNF-based (co)datatype package, including
434 new commands "primrec_new", "primcorec", and
435 "datatype_new_compat", as well as documentation. See
436 "datatypes.pdf" for details.
437 - New "coinduction" method to avoid some boilerplate (compared to
443 - Renamed many generated theorems, including
445 map_comp' ~> map_comp
455 * Spec_Check is a Quickcheck tool for Isabelle/ML. The ML function
456 "check_property" allows to check specifications of the form "ALL x y
457 z. prop x y z". See also ~~/src/Tools/Spec_Check/ with its
458 Examples.thy in particular.
460 * Improved printing of exception trace in Poly/ML 5.5.1, with regular
461 tracing output in the command transaction context instead of physical
462 stdout. See also Toplevel.debug, Toplevel.debugging and
463 ML_Compiler.exn_trace.
465 * ML type "theory" is now immutable, without any special treatment of
466 drafts or linear updates (which could lead to "stale theory" errors in
467 the past). Discontinued obsolete operations like Theory.copy,
468 Theory.checkpoint, and the auxiliary type theory_ref. Minor
471 * More uniform naming of goal functions for skipped proofs:
473 Skip_Proof.prove ~> Goal.prove_sorry
474 Skip_Proof.prove_global ~> Goal.prove_sorry_global
476 Minor INCOMPATIBILITY.
478 * Simplifier tactics and tools use proper Proof.context instead of
479 historic type simpset. Old-style declarations like addsimps,
480 addsimprocs etc. operate directly on Proof.context. Raw type simpset
481 retains its use as snapshot of the main Simplifier context, using
482 simpset_of and put_simpset on Proof.context. INCOMPATIBILITY -- port
483 old tools by making them depend on (ctxt : Proof.context) instead of
484 (ss : simpset), then turn (simpset_of ctxt) into ctxt.
486 * Modifiers for classical wrappers (e.g. addWrapper, delWrapper)
487 operate on Proof.context instead of claset, for uniformity with addIs,
488 addEs, addDs etc. Note that claset_of and put_claset allow to manage
489 clasets separately from the context.
491 * Discontinued obsolete ML antiquotations @{claset} and @{simpset}.
492 INCOMPATIBILITY, use @{context} instead.
494 * Antiquotation @{theory_context A} is similar to @{theory A}, but
495 presents the result as initial Proof.context.
500 * Discontinued obsolete isabelle usedir, mkdir, make -- superseded by
501 "isabelle build" in Isabelle2013. INCOMPATIBILITY.
503 * Discontinued obsolete isabelle-process options -f and -u (former
504 administrative aliases of option -e). Minor INCOMPATIBILITY.
506 * Discontinued obsolete isabelle print tool, and PRINT_COMMAND
509 * Discontinued ISABELLE_DOC_FORMAT settings variable and historic
510 document formats: dvi.gz, ps, ps.gz -- the default document format is
513 * Isabelle settings variable ISABELLE_BUILD_JAVA_OPTIONS allows to
514 specify global resources of the JVM process run by isabelle build.
516 * Toplevel executable $ISABELLE_HOME/bin/isabelle_scala_script allows
517 to run Isabelle/Scala source files as standalone programs.
519 * Improved "isabelle keywords" tool (for old-style ProofGeneral
520 keyword tables): use Isabelle/Scala operations, which inspect outer
521 syntax without requiring to build sessions first.
523 * Sessions may be organized via 'chapter' specifications in the ROOT
524 file, which determines a two-level hierarchy of browser info. The old
525 tree-like organization via implicit sub-session relation (with its
526 tendency towards erratic fluctuation of URLs) has been discontinued.
527 The default chapter is called "Unsorted". Potential INCOMPATIBILITY
528 for HTML presentation of theories.
532 New in Isabelle2013 (February 2013)
533 -----------------------------------
537 * Theorem status about oracles and unfinished/failed future proofs is
538 no longer printed by default, since it is incompatible with
539 incremental / parallel checking of the persistent document model. ML
540 function Thm.peek_status may be used to inspect a snapshot of the
541 ongoing evaluation process. Note that in batch mode --- notably
542 isabelle build --- the system ensures that future proofs of all
543 accessible theorems in the theory context are finished (as before).
545 * Configuration option show_markup controls direct inlining of markup
546 into the printed representation of formal entities --- notably type
547 and sort constraints. This enables Prover IDE users to retrieve that
548 information via tooltips in the output window, for example.
550 * Command 'ML_file' evaluates ML text from a file directly within the
551 theory, without any predeclaration via 'uses' in the theory header.
553 * Old command 'use' command and corresponding keyword 'uses' in the
554 theory header are legacy features and will be discontinued soon.
555 Tools that load their additional source files may imitate the
556 'ML_file' implementation, such that the system can take care of
557 dependencies properly.
559 * Discontinued obsolete method fastsimp / tactic fast_simp_tac, which
560 is called fastforce / fast_force_tac already since Isabelle2011-1.
562 * Updated and extended "isar-ref" and "implementation" manual, reduced
563 remaining material in old "ref" manual.
565 * Improved support for auxiliary contexts that indicate block structure
566 for specifications. Nesting of "context fixes ... context assumes ..."
567 and "class ... context ...".
569 * Attribute "consumes" allows a negative value as well, which is
570 interpreted relatively to the total number of premises of the rule in
571 the target context. This form of declaration is stable when exported
572 from a nested 'context' with additional assumptions. It is the
573 preferred form for definitional packages, notably cases/rules produced
574 in HOL/inductive and HOL/function.
576 * More informative error messages for Isar proof commands involving
577 lazy enumerations (method applications etc.).
579 * Refined 'help' command to retrieve outer syntax commands according
580 to name patterns (with clickable results).
583 *** Prover IDE -- Isabelle/Scala/jEdit ***
585 * Parallel terminal proofs ('by') are enabled by default, likewise
586 proofs that are built into packages like 'datatype', 'function'. This
587 allows to "run ahead" checking the theory specifications on the
588 surface, while the prover is still crunching on internal
589 justifications. Unfinished / cancelled proofs are restarted as
590 required to complete full proof checking eventually.
592 * Improved output panel with tooltips, hyperlinks etc. based on the
593 same Rich_Text_Area as regular Isabelle/jEdit buffers. Activation of
594 tooltips leads to some window that supports the same recursively,
595 which can lead to stacks of tooltips as the semantic document content
596 is explored. ESCAPE closes the whole stack, individual windows may be
597 closed separately, or detached to become independent jEdit dockables.
599 * Improved support for commands that produce graph output: the text
600 message contains a clickable area to open a new instance of the graph
603 * More robust incremental parsing of outer syntax (partial comments,
604 malformed symbols). Changing the balance of open/close quotes and
605 comment delimiters works more conveniently with unfinished situations
606 that frequently occur in user interaction.
608 * More efficient painting and improved reactivity when editing large
609 files. More scalable management of formal document content.
611 * Smarter handling of tracing messages: prover process pauses after
612 certain number of messages per command transaction, with some user
613 dialog to stop or continue. This avoids swamping the front-end with
614 potentially infinite message streams.
616 * More plugin options and preferences, based on Isabelle/Scala. The
617 jEdit plugin option panel provides access to some Isabelle/Scala
618 options, including tuning parameters for editor reactivity and color
621 * Dockable window "Symbols" provides some editing support for Isabelle
624 * Dockable window "Monitor" shows ML runtime statistics. Note that
625 continuous display of the chart slows down the system.
627 * Improved editing support for control styles: subscript, superscript,
628 bold, reset of style -- operating on single symbols or text
629 selections. Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT.
631 * Actions isabelle.increase-font-size and isabelle.decrease-font-size
632 adjust the main text area font size, and its derivatives for output,
633 tooltips etc. Cf. keyboard shortcuts C-PLUS and C-MINUS, which often
634 need to be adapted to local keyboard layouts.
636 * More reactive completion popup by default: use \t (TAB) instead of
637 \n (NEWLINE) to minimize intrusion into regular flow of editing. See
638 also "Plugin Options / SideKick / General / Code Completion Options".
640 * Implicit check and build dialog of the specified logic session
641 image. For example, HOL, HOLCF, HOL-Nominal can be produced on
642 demand, without bundling big platform-dependent heap images in the
643 Isabelle distribution.
645 * Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates
646 from Oracle provide better multi-platform experience. This version is
647 now bundled exclusively with Isabelle.
652 * Code generation for Haskell: restrict unqualified imports from
653 Haskell Prelude to a small set of fundamental operations.
655 * Command 'export_code': relative file names are interpreted
656 relatively to master directory of current theory rather than the
657 rather arbitrary current working directory. INCOMPATIBILITY.
659 * Discontinued obsolete attribute "COMP". Potential INCOMPATIBILITY,
660 use regular rule composition via "OF" / "THEN", or explicit proof
661 structure instead. Note that Isabelle/ML provides a variety of
662 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied
663 with some care where this is really required.
665 * Command 'typ' supports an additional variant with explicit sort
666 constraint, to infer and check the most general type conforming to a
667 given sort. Example (in HOL):
669 typ "_ * _ * bool * unit" :: finite
671 * Command 'locale_deps' visualizes all locales and their relations as
679 - Added MaSh relevance filter based on machine-learning; see the
680 Sledgehammer manual for details.
681 - Polished Isar proofs generated with "isar_proofs" option.
682 - Rationalized type encodings ("type_enc" option).
683 - Renamed "kill_provers" subcommand to "kill_all".
685 isar_proof ~> isar_proofs
686 isar_shrink_factor ~> isar_shrink
687 max_relevant ~> max_facts
688 relevance_thresholds ~> fact_thresholds
690 * Quickcheck: added an optimisation for equality premises. It is
691 switched on by default, and can be switched off by setting the
692 configuration quickcheck_optimise_equality to false.
694 * Quotient: only one quotient can be defined by quotient_type
698 - generation of an abstraction function equation in lift_definition
700 - renamed no_abs_code -> no_code (INCOMPATIBILITY.)
702 * Simproc "finite_Collect" rewrites set comprehensions into pointfree
705 * Preprocessing of the code generator rewrites set comprehensions into
706 pointfree expressions.
708 * The SMT solver Z3 has now by default a restricted set of directly
709 supported features. For the full set of features (div/mod, nonlinear
710 arithmetic, datatypes/records) with potential proof reconstruction
711 failures, enable the configuration option "z3_with_extensions". Minor
714 * Simplified 'typedef' specifications: historical options for implicit
715 set definition and alternative name have been discontinued. The
716 former behavior of "typedef (open) t = A" is now the default, but
717 written just "typedef t = A". INCOMPATIBILITY, need to adapt theories
720 * Removed constant "chars"; prefer "Enum.enum" on type "char"
721 directly. INCOMPATIBILITY.
723 * Moved operation product, sublists and n_lists from theory Enum to
724 List. INCOMPATIBILITY.
726 * Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY.
728 * Class "comm_monoid_diff" formalises properties of bounded
729 subtraction, with natural numbers and multisets as typical instances.
731 * Added combinator "Option.these" with type "'a option set => 'a set".
733 * Theory "Transitive_Closure": renamed lemmas
735 reflcl_tranclp -> reflclp_tranclp
736 rtranclp_reflcl -> rtranclp_reflclp
740 * Theory "Rings": renamed lemmas (in class semiring)
742 left_distrib ~> distrib_right
743 right_distrib ~> distrib_left
747 * Generalized the definition of limits:
749 - Introduced the predicate filterlim (LIM x F. f x :> G) which
750 expresses that when the input values x converge to F then the
751 output f x converges to G.
753 - Added filters for convergence to positive (at_top) and negative
756 - Moved infinity in the norm (at_infinity) from
757 Multivariate_Analysis to Complex_Main.
759 - Removed real_tendsto_inf, it is superseded by "LIM x F. f x :>
764 * Theory "Library/Option_ord" provides instantiation of option type to
765 lattice type classes.
767 * Theory "Library/Multiset": renamed
769 constant fold_mset ~> Multiset.fold
770 fact fold_mset_commute ~> fold_mset_comm
774 * Renamed theory Library/List_Prefix to Library/Sublist, with related
777 - Renamed constants (and related lemmas)
780 strict_prefix ~> prefix
782 - Replaced constant "postfix" by "suffixeq" with swapped argument
783 order (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped
784 old infix syntax "xs >>= ys"; use "suffixeq ys xs" instead.
785 Renamed lemmas accordingly.
787 - Added constant "list_hembeq" for homeomorphic embedding on
788 lists. Added abbreviation "sublisteq" for special case
789 "list_hembeq (op =)".
791 - Theory Library/Sublist no longer provides "order" and "bot" type
792 class instances for the prefix order (merely corresponding locale
793 interpretations). The type class instances are now in theory
794 Library/Prefix_Order.
796 - The sublist relation of theory Library/Sublist_Order is now based
797 on "Sublist.sublisteq". Renamed lemmas accordingly:
799 le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff
800 le_list_append_mono ~> Sublist.list_hembeq_append_mono
801 le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2
802 le_list_Cons_EX ~> Sublist.list_hembeq_ConsD
803 le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2'
804 le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq
805 le_list_drop_Cons ~> Sublist.sublisteq_Cons'
806 le_list_drop_many ~> Sublist.sublisteq_drop_many
807 le_list_filter_left ~> Sublist.sublisteq_filter_left
808 le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many
809 le_list_rev_take_iff ~> Sublist.sublisteq_append
810 le_list_same_length ~> Sublist.sublisteq_same_length
811 le_list_take_many_iff ~> Sublist.sublisteq_append'
812 less_eq_list.drop ~> less_eq_list_drop
813 less_eq_list.induct ~> less_eq_list_induct
814 not_le_list_length ~> Sublist.not_sublisteq_length
818 * New theory Library/Countable_Set.
820 * Theory Library/Debug and Library/Parallel provide debugging and
821 parallel execution for code generated towards Isabelle/ML.
823 * Theory Library/FuncSet: Extended support for Pi and extensional and
824 introduce the extensional dependent function space "PiE". Replaced
825 extensional_funcset by an abbreviation, and renamed lemmas from
826 extensional_funcset to PiE as follows:
828 extensional_empty ~> PiE_empty
829 extensional_funcset_empty_domain ~> PiE_empty_domain
830 extensional_funcset_empty_range ~> PiE_empty_range
831 extensional_funcset_arb ~> PiE_arb
832 extensional_funcset_mem ~> PiE_mem
833 extensional_funcset_extend_domainI ~> PiE_fun_upd
834 extensional_funcset_restrict_domain ~> fun_upd_in_PiE
835 extensional_funcset_extend_domain_eq ~> PiE_insert_eq
836 card_extensional_funcset ~> card_PiE
837 finite_extensional_funcset ~> finite_PiE
841 * Theory Library/FinFun: theory of almost everywhere constant
842 functions (supersedes the AFP entry "Code Generation for Functions as
845 * Theory Library/Phantom: generic phantom type to make a type
846 parameter appear in a constant's type. This alternative to adding
847 TYPE('a) as another parameter avoids unnecessary closures in generated
850 * Theory Library/RBT_Impl: efficient construction of red-black trees
851 from sorted associative lists. Merging two trees with rbt_union may
852 return a structurally different tree than before. Potential
855 * Theory Library/IArray: immutable arrays with code generation.
857 * Theory Library/Finite_Lattice: theory of finite lattices.
859 * HOL/Multivariate_Analysis: replaced
861 "basis :: 'a::euclidean_space => nat => real"
862 "\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space"
864 on euclidean spaces by using the inner product "_ \<bullet> _" with
865 vectors from the Basis set: "\<Chi>\<Chi> i. f i" is superseded by
866 "SUM i : Basis. f i * r i".
868 With this change the following constants are also changed or removed:
870 DIM('a) :: nat ~> card (Basis :: 'a set) (is an abbreviation)
871 a $$ i ~> inner a i (where i : Basis)
873 \<pi>, \<pi>' removed
875 Theorems about these constants where removed.
879 component_le_norm ~> Basis_le_norm
880 euclidean_eq ~> euclidean_eq_iff
881 differential_zero_maxmin_component ~> differential_zero_maxmin_cart
882 euclidean_simps ~> inner_simps
883 independent_basis ~> independent_Basis
884 span_basis ~> span_Basis
885 in_span_basis ~> in_span_Basis
886 norm_bound_component_le ~> norm_boound_Basis_le
887 norm_bound_component_lt ~> norm_boound_Basis_lt
888 component_le_infnorm ~> Basis_le_infnorm
894 - Added simproc "measurable" to automatically prove measurability.
896 - Added induction rules for sigma sets with disjoint union
897 (sigma_sets_induct_disjoint) and for Borel-measurable functions
898 (borel_measurable_induct).
900 - Added the Daniell-Kolmogorov theorem (the existence the limit of a
903 * HOL/Cardinals: Theories of ordinals and cardinals (supersedes the
904 AFP entry "Ordinals_and_Cardinals").
906 * HOL/BNF: New (co)datatype package based on bounded natural functors
907 with support for mixed, nested recursion and interesting non-free
910 * HOL/Finite_Set and Relation: added new set and relation operations
911 expressed by Finite_Set.fold.
913 * New theory HOL/Library/RBT_Set: implementation of sets by red-black
914 trees for the code generator.
916 * HOL/Library/RBT and HOL/Library/Mapping have been converted to
918 possible INCOMPATIBILITY.
920 * HOL/Set: renamed Set.project -> Set.filter
924 *** Document preparation ***
926 * Dropped legacy antiquotations "term_style" and "thm_style", since
927 styles may be given as arguments to "term" and "thm" already.
928 Discontinued legacy styles "prem1" .. "prem19".
930 * Default LaTeX rendering for \<euro> is now based on eurosym package,
931 instead of slightly exotic babel/greek.
933 * Document variant NAME may use different LaTeX entry point
934 document/root_NAME.tex if that file exists, instead of the common
937 * Simplified custom document/build script, instead of old-style
938 document/IsaMakefile. Minor INCOMPATIBILITY.
943 * The default limit for maximum number of worker threads is now 8,
944 instead of 4, in correspondence to capabilities of contemporary
945 hardware and Poly/ML runtime system.
947 * Type Seq.results and related operations support embedded error
948 messages within lazy enumerations, and thus allow to provide
949 informative errors in the absence of any usable results.
951 * Renamed Position.str_of to Position.here to emphasize that this is a
952 formal device to inline positions into message text, but not
953 necessarily printing visible text.
958 * Advanced support for Isabelle sessions and build management, see
959 "system" manual for the chapter of that name, especially the "isabelle
960 build" tool and its examples. The "isabelle mkroot" tool prepares
961 session root directories for use with "isabelle build", similar to
962 former "isabelle mkdir" for "isabelle usedir". Note that this affects
963 document preparation as well. INCOMPATIBILITY, isabelle usedir /
964 mkdir / make are rendered obsolete.
966 * Discontinued obsolete Isabelle/build script, it is superseded by the
967 regular isabelle build tool. For example:
969 isabelle build -s -b HOL
971 * Discontinued obsolete "isabelle makeall".
973 * Discontinued obsolete IsaMakefile and ROOT.ML files from the
974 Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that
975 provides some traditional targets that invoke "isabelle build". Note
976 that this is inefficient! Applications of Isabelle/HOL involving
977 "isabelle make" should be upgraded to use "isabelle build" directly.
979 * The "isabelle options" tool prints Isabelle system options, as
980 required for "isabelle build", for example.
982 * The "isabelle logo" tool produces EPS and PDF format simultaneously.
983 Minor INCOMPATIBILITY in command-line options.
985 * The "isabelle install" tool has now a simpler command-line. Minor
988 * The "isabelle components" tool helps to resolve add-on components
989 that are not bundled, or referenced from a bare-bones repository
992 * Settings variable ISABELLE_PLATFORM_FAMILY refers to the general
993 platform family: "linux", "macos", "windows".
995 * The ML system is configured as regular component, and no longer
996 picked up from some surrounding directory. Potential INCOMPATIBILITY
997 for home-made settings.
999 * Improved ML runtime statistics (heap, threads, future tasks etc.).
1001 * Discontinued support for Poly/ML 5.2.1, which was the last version
1002 without exception positions and advanced ML compiler/toplevel
1005 * Discontinued special treatment of Proof General -- no longer guess
1006 PROOFGENERAL_HOME based on accidental file-system layout. Minor
1007 INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS
1008 settings manually, or use a Proof General version that has been
1009 bundled as Isabelle component.
1013 New in Isabelle2012 (May 2012)
1014 ------------------------------
1018 * Prover IDE (PIDE) improvements:
1020 - more robust Sledgehammer integration (as before the sledgehammer
1021 command-line needs to be typed into the source buffer)
1022 - markup for bound variables
1023 - markup for types of term variables (displayed as tooltips)
1024 - support for user-defined Isar commands within the running session
1025 - improved support for Unicode outside original 16bit range
1026 e.g. glyph for \<A> (thanks to jEdit 4.5.1)
1028 * Forward declaration of outer syntax keywords within the theory
1029 header -- minor INCOMPATIBILITY for user-defined commands. Allow new
1030 commands to be used in the same theory where defined.
1032 * Auxiliary contexts indicate block structure for specifications with
1033 additional parameters and assumptions. Such unnamed contexts may be
1034 nested within other targets, like 'theory', 'locale', 'class',
1035 'instantiation' etc. Results from the local context are generalized
1036 accordingly and applied to the enclosing target context. Example:
1040 assumes xy: "x = y" and yz: "y = z"
1043 lemma my_trans: "x = z" using xy yz by simp
1049 The most basic application is to factor-out context elements of
1050 several fixes/assumes/shows theorem statements, e.g. see
1051 ~~/src/HOL/Isar_Examples/Group_Context.thy
1053 Any other local theory specification element works within the "context
1054 ... begin ... end" block as well.
1056 * Bundled declarations associate attributed fact expressions with a
1057 given name in the context. These may be later included in other
1058 contexts. This allows to manage context extensions casually, without
1059 the logical dependencies of locales and locale interpretation. See
1060 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.
1062 * Commands 'lemmas' and 'theorems' allow local variables using 'for'
1063 declaration, and results are standardized before being stored. Thus
1064 old-style "standard" after instantiation or composition of facts
1065 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of
1066 indices of schematic variables.
1068 * Rule attributes in local theory declarations (e.g. locale or class)
1069 are now statically evaluated: the resulting theorem is stored instead
1070 of the original expression. INCOMPATIBILITY in rare situations, where
1071 the historic accident of dynamic re-evaluation in interpretations
1074 * New tutorial "Programming and Proving in Isabelle/HOL"
1075 ("prog-prove"). It completely supersedes "A Tutorial Introduction to
1076 Structured Isar Proofs" ("isar-overview"), which has been removed. It
1077 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order
1078 Logic" as the recommended beginners tutorial, but does not cover all
1079 of the material of that old tutorial.
1081 * Updated and extended reference manuals: "isar-ref",
1082 "implementation", "system"; reduced remaining material in old "ref"
1088 * Command 'definition' no longer exports the foundational "raw_def"
1089 into the user context. Minor INCOMPATIBILITY, may use the regular
1090 "def" result with attribute "abs_def" to imitate the old version.
1092 * Attribute "abs_def" turns an equation of the form "f x y == t" into
1093 "f == %x y. t", which ensures that "simp" or "unfold" steps always
1094 expand it. This also works for object-logic equality. (Formerly
1095 undocumented feature.)
1097 * Sort constraints are now propagated in simultaneous statements, just
1098 like type constraints. INCOMPATIBILITY in rare situations, where
1099 distinct sorts used to be assigned accidentally. For example:
1101 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"
1103 lemma "P (x::'a)" and "Q (y::'a::bar)"
1104 -- "now uniform 'a::bar instead of default sort for first occurrence (!)"
1106 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more
1107 tolerant against multiple unifiers, as long as the final result is
1108 unique. (As before, rules are composed in canonical right-to-left
1109 order to accommodate newly introduced premises.)
1111 * Renamed some inner syntax categories:
1117 Minor INCOMPATIBILITY. Note that in practice "num_const" or
1118 "num_position" etc. are mainly used instead (which also include
1119 position information via constraints).
1121 * Simplified configuration options for syntax ambiguity: see
1122 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
1123 manual. Minor INCOMPATIBILITY.
1125 * Discontinued configuration option "syntax_positions": atomic terms
1126 in parse trees are always annotated by position constraints.
1128 * Old code generator for SML and its commands 'code_module',
1129 'code_library', 'consts_code', 'types_code' have been discontinued.
1130 Use commands of the generic code generator instead. INCOMPATIBILITY.
1132 * Redundant attribute "code_inline" has been discontinued. Use
1133 "code_unfold" instead. INCOMPATIBILITY.
1135 * Dropped attribute "code_unfold_post" in favor of the its dual
1136 "code_abbrev", which yields a common pattern in definitions like
1138 definition [code_abbrev]: "f = t"
1142 * Obsolete 'types' command has been discontinued. Use 'type_synonym'
1143 instead. INCOMPATIBILITY.
1145 * Discontinued old "prems" fact, which used to refer to the accidental
1146 collection of foundational premises in the context (already marked as
1147 legacy since Isabelle2011).
1152 * Type 'a set is now a proper type constructor (just as before
1153 Isabelle2008). Definitions mem_def and Collect_def have disappeared.
1154 Non-trivial INCOMPATIBILITY. For developments keeping predicates and
1155 sets separate, it is often sufficient to rephrase some set S that has
1156 been accidentally used as predicates by "%x. x : S", and some
1157 predicate P that has been accidentally used as set by "{x. P x}".
1158 Corresponding proofs in a first step should be pruned from any
1159 tinkering with former theorems mem_def and Collect_def as far as
1162 For developments which deliberately mix predicates and sets, a
1163 planning step is necessary to determine what should become a predicate
1164 and what a set. It can be helpful to carry out that step in
1165 Isabelle2011-1 before jumping right into the current release.
1167 * Code generation by default implements sets as container type rather
1168 than predicates. INCOMPATIBILITY.
1170 * New type synonym 'a rel = ('a * 'a) set
1172 * The representation of numerals has changed. Datatype "num"
1173 represents strictly positive binary numerals, along with functions
1174 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent
1175 positive and negated numeric literals, respectively. See also
1176 definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some
1177 user theories may require adaptations as follows:
1179 - Theorems with number_ring or number_semiring constraints: These
1180 classes are gone; use comm_ring_1 or comm_semiring_1 instead.
1182 - Theories defining numeric types: Remove number, number_semiring,
1183 and number_ring instances. Defer all theorems about numerals until
1184 after classes one and semigroup_add have been instantiated.
1186 - Numeral-only simp rules: Replace each rule having a "number_of v"
1187 pattern with two copies, one for numeral and one for neg_numeral.
1189 - Theorems about subclasses of semiring_1 or ring_1: These classes
1190 automatically support numerals now, so more simp rules and
1191 simprocs may now apply within the proof.
1193 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:
1194 Redefine using other integer operations.
1196 * Transfer: New package intended to generalize the existing
1197 "descending" method and related theorem attributes from the Quotient
1198 package. (Not all functionality is implemented yet, but future
1199 development will focus on Transfer as an eventual replacement for the
1200 corresponding parts of the Quotient package.)
1202 - transfer_rule attribute: Maintains a collection of transfer rules,
1203 which relate constants at two different types. Transfer rules may
1204 relate different type instances of the same polymorphic constant,
1205 or they may relate an operation on a raw type to a corresponding
1206 operation on an abstract type (quotient or subtype). For example:
1208 ((A ===> B) ===> list_all2 A ===> list_all2 B) map map
1209 (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int
1211 - transfer method: Replaces a subgoal on abstract types with an
1212 equivalent subgoal on the corresponding raw types. Constants are
1213 replaced with corresponding ones according to the transfer rules.
1214 Goals are generalized over all free variables by default; this is
1215 necessary for variables whose types change, but can be overridden
1216 for specific variables with e.g. "transfer fixing: x y z". The
1217 variant transfer' method allows replacing a subgoal with one that
1218 is logically stronger (rather than equivalent).
1220 - relator_eq attribute: Collects identity laws for relators of
1221 various type constructors, e.g. "list_all2 (op =) = (op =)". The
1222 transfer method uses these lemmas to infer transfer rules for
1223 non-polymorphic constants on the fly.
1225 - transfer_prover method: Assists with proving a transfer rule for a
1226 new constant, provided the constant is defined in terms of other
1227 constants that already have transfer rules. It should be applied
1228 after unfolding the constant definitions.
1230 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer
1231 from type nat to type int.
1233 * Lifting: New package intended to generalize the quotient_definition
1234 facility of the Quotient package; designed to work with Transfer.
1236 - lift_definition command: Defines operations on an abstract type in
1237 terms of a corresponding operation on a representation
1238 type. Example syntax:
1240 lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"
1243 Users must discharge a respectfulness proof obligation when each
1244 constant is defined. (For a type copy, i.e. a typedef with UNIV,
1245 the proof is discharged automatically.) The obligation is
1246 presented in a user-friendly, readable form; a respectfulness
1247 theorem in the standard format and a transfer rule are generated
1250 - Integration with code_abstype: For typedefs (e.g. subtypes
1251 corresponding to a datatype invariant, such as dlist),
1252 lift_definition generates a code certificate theorem and sets up
1253 code generation for each constant.
1255 - setup_lifting command: Sets up the Lifting package to work with a
1256 user-defined type. The user must provide either a quotient theorem
1257 or a type_definition theorem. The package configures transfer
1258 rules for equality and quantifiers on the type, and sets up the
1259 lift_definition command to work with the type.
1261 - Usage examples: See Quotient_Examples/Lift_DList.thy,
1262 Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,
1263 Word/Word.thy and Library/Float.thy.
1267 - The 'quotient_type' command now supports a 'morphisms' option with
1268 rep and abs functions, similar to typedef.
1270 - 'quotient_type' sets up new types to work with the Lifting and
1271 Transfer packages, as with 'setup_lifting'.
1273 - The 'quotient_definition' command now requires the user to prove a
1274 respectfulness property at the point where the constant is
1275 defined, similar to lift_definition; INCOMPATIBILITY.
1277 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems
1278 accordingly, INCOMPATIBILITY.
1280 * New diagnostic command 'find_unused_assms' to find potentially
1281 superfluous assumptions in theorems using Quickcheck.
1285 - Quickcheck returns variable assignments as counterexamples, which
1286 allows to reveal the underspecification of functions under test.
1287 For example, refuting "hd xs = x", it presents the variable
1288 assignment xs = [] and x = a1 as a counterexample, assuming that
1289 any property is false whenever "hd []" occurs in it.
1291 These counterexample are marked as potentially spurious, as
1292 Quickcheck also returns "xs = []" as a counterexample to the
1293 obvious theorem "hd xs = hd xs".
1295 After finding a potentially spurious counterexample, Quickcheck
1296 continues searching for genuine ones.
1298 By default, Quickcheck shows potentially spurious and genuine
1299 counterexamples. The option "genuine_only" sets quickcheck to only
1300 show genuine counterexamples.
1302 - The command 'quickcheck_generator' creates random and exhaustive
1303 value generators for a given type and operations.
1305 It generates values by using the operations as if they were
1306 constructors of that type.
1308 - Support for multisets.
1310 - Added "use_subtype" options.
1312 - Added "quickcheck_locale" configuration to specify how to process
1313 conjectures in a locale context.
1315 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option
1316 and affecting 'rat' and 'real'.
1319 - Integrated more tightly with SPASS, as described in the ITP 2012
1320 paper "More SPASS with Isabelle".
1321 - Made it try "smt" as a fallback if "metis" fails or times out.
1322 - Added support for the following provers: Alt-Ergo (via Why3 and
1323 TFF1), iProver, iProver-Eq.
1324 - Sped up the minimizer.
1325 - Added "lam_trans", "uncurry_aliases", and "minimize" options.
1326 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
1327 - Renamed "sound" option to "strict".
1329 * Metis: Added possibility to specify lambda translations scheme as a
1330 parenthesized argument (e.g., "by (metis (lifting) ...)").
1332 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".
1334 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.
1336 * New "case_product" attribute to generate a case rule doing multiple
1337 case distinctions at the same time. E.g.
1339 list.exhaust [case_product nat.exhaust]
1341 produces a rule which can be used to perform case distinction on both
1344 * New "eventually_elim" method as a generalized variant of the
1345 eventually_elim* rules. Supports structured proofs.
1347 * Typedef with implicit set definition is considered legacy. Use
1348 "typedef (open)" form instead, which will eventually become the
1351 * Record: code generation can be switched off manually with
1353 declare [[record_coden = false]] -- "default true"
1355 * Datatype: type parameters allow explicit sort constraints.
1357 * Concrete syntax for case expressions includes constraints for source
1358 positions, and thus produces Prover IDE markup for its bindings.
1359 INCOMPATIBILITY for old-style syntax translations that augment the
1360 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
1363 * Clarified attribute "mono_set": pure declaration without modifying
1364 the result of the fact expression.
1366 * More default pred/set conversions on a couple of relation operations
1367 and predicates. Added powers of predicate relations. Consolidation
1368 of some relation theorems:
1370 converse_def ~> converse_unfold
1371 rel_comp_def ~> relcomp_unfold
1372 symp_def ~> (modified, use symp_def and sym_def instead)
1373 transp_def ~> transp_trans
1374 Domain_def ~> Domain_unfold
1375 Range_def ~> Domain_converse [symmetric]
1377 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.
1379 See theory "Relation" for examples for making use of pred/set
1380 conversions by means of attributes "to_set" and "to_pred".
1384 * Renamed facts about the power operation on relations, i.e., relpow
1385 to match the constant's name:
1387 rel_pow_1 ~> relpow_1
1388 rel_pow_0_I ~> relpow_0_I
1389 rel_pow_Suc_I ~> relpow_Suc_I
1390 rel_pow_Suc_I2 ~> relpow_Suc_I2
1391 rel_pow_0_E ~> relpow_0_E
1392 rel_pow_Suc_E ~> relpow_Suc_E
1393 rel_pow_E ~> relpow_E
1394 rel_pow_Suc_D2 ~> relpow_Suc_D2
1395 rel_pow_Suc_E2 ~> relpow_Suc_E2
1396 rel_pow_Suc_D2' ~> relpow_Suc_D2'
1397 rel_pow_E2 ~> relpow_E2
1398 rel_pow_add ~> relpow_add
1399 rel_pow_commute ~> relpow
1400 rel_pow_empty ~> relpow_empty:
1401 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
1402 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
1403 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
1404 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
1405 rel_pow_fun_conv ~> relpow_fun_conv
1406 rel_pow_finite_bounded1 ~> relpow_finite_bounded1
1407 rel_pow_finite_bounded ~> relpow_finite_bounded
1408 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
1409 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
1410 single_valued_rel_pow ~> single_valued_relpow
1414 * Theory Relation: Consolidated constant name for relation composition
1415 and corresponding theorem names:
1417 - Renamed constant rel_comp to relcomp.
1419 - Dropped abbreviation pred_comp. Use relcompp instead.
1423 rel_compI ~> relcompI
1424 rel_compEpair ~> relcompEpair
1425 rel_compE ~> relcompE
1426 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq
1427 rel_comp_empty1 ~> relcomp_empty1
1428 rel_comp_mono ~> relcomp_mono
1429 rel_comp_subset_Sigma ~> relcomp_subset_Sigma
1430 rel_comp_distrib ~> relcomp_distrib
1431 rel_comp_distrib2 ~> relcomp_distrib2
1432 rel_comp_UNION_distrib ~> relcomp_UNION_distrib
1433 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2
1434 single_valued_rel_comp ~> single_valued_relcomp
1435 rel_comp_def ~> relcomp_unfold
1436 converse_rel_comp ~> converse_relcomp
1437 pred_compI ~> relcomppI
1438 pred_compE ~> relcomppE
1439 pred_comp_bot1 ~> relcompp_bot1
1440 pred_comp_bot2 ~> relcompp_bot2
1441 transp_pred_comp_less_eq ~> transp_relcompp_less_eq
1442 pred_comp_mono ~> relcompp_mono
1443 pred_comp_distrib ~> relcompp_distrib
1444 pred_comp_distrib2 ~> relcompp_distrib2
1445 converse_pred_comp ~> converse_relcompp
1447 finite_rel_comp ~> finite_relcomp
1449 set_rel_comp ~> set_relcomp
1453 * Theory Divides: Discontinued redundant theorems about div and mod.
1454 INCOMPATIBILITY, use the corresponding generic theorems instead.
1456 DIVISION_BY_ZERO ~> div_by_0, mod_by_0
1457 zdiv_self ~> div_self
1458 zmod_self ~> mod_self
1461 zdiv_zmod_equality ~> div_mod_equality2
1462 zdiv_zmod_equality2 ~> div_mod_equality
1463 zmod_zdiv_trivial ~> mod_div_trivial
1464 zdiv_zminus_zminus ~> div_minus_minus
1465 zmod_zminus_zminus ~> mod_minus_minus
1466 zdiv_zminus2 ~> div_minus_right
1467 zmod_zminus2 ~> mod_minus_right
1468 zdiv_minus1_right ~> div_minus1_right
1469 zmod_minus1_right ~> mod_minus1_right
1470 zdvd_mult_div_cancel ~> dvd_mult_div_cancel
1471 zmod_zmult1_eq ~> mod_mult_right_eq
1472 zpower_zmod ~> power_mod
1473 zdvd_zmod ~> dvd_mod
1474 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd
1475 mod_mult_distrib ~> mult_mod_left
1476 mod_mult_distrib2 ~> mult_mod_right
1478 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use
1479 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.
1481 * Finite_Set.fold now qualified. INCOMPATIBILITY.
1483 * Consolidated theorem names concerning fold combinators:
1485 inf_INFI_fold_inf ~> inf_INF_fold_inf
1486 sup_SUPR_fold_sup ~> sup_SUP_fold_sup
1487 INFI_fold_inf ~> INF_fold_inf
1488 SUPR_fold_sup ~> SUP_fold_sup
1489 union_set ~> union_set_fold
1490 minus_set ~> minus_set_fold
1491 INFI_set_fold ~> INF_set_fold
1492 SUPR_set_fold ~> SUP_set_fold
1493 INF_code ~> INF_set_foldr
1494 SUP_code ~> SUP_set_foldr
1495 foldr.simps ~> foldr.simps (in point-free formulation)
1496 foldr_fold_rev ~> foldr_conv_fold
1497 foldl_fold ~> foldl_conv_fold
1498 foldr_foldr ~> foldr_conv_foldl
1499 foldl_foldr ~> foldl_conv_foldr
1500 fold_set_remdups ~> fold_set_fold_remdups
1501 fold_set ~> fold_set_fold
1502 fold1_set ~> fold1_set_fold
1506 * Dropped rarely useful theorems concerning fold combinators:
1507 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
1508 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
1509 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
1510 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
1511 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,
1512 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.
1513 INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0"
1514 and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be
1515 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by
1516 unfolding "foldr_conv_fold" and "foldl_conv_fold".
1518 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,
1519 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,
1520 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,
1521 INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding
1522 lemmas over fold rather than foldr, or make use of lemmas
1523 fold_conv_foldr and fold_rev.
1525 * Congruence rules Option.map_cong and Option.bind_cong for recursion
1526 through option types.
1528 * "Transitive_Closure.ntrancl": bounded transitive closure on
1531 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.
1533 * Theory Int: Discontinued many legacy theorems specific to type int.
1534 INCOMPATIBILITY, use the corresponding generic theorems instead.
1536 zminus_zminus ~> minus_minus
1537 zminus_0 ~> minus_zero
1538 zminus_zadd_distrib ~> minus_add_distrib
1539 zadd_commute ~> add_commute
1540 zadd_assoc ~> add_assoc
1541 zadd_left_commute ~> add_left_commute
1544 zadd_0 ~> add_0_left
1545 zadd_0_right ~> add_0_right
1546 zadd_zminus_inverse2 ~> left_minus
1547 zmult_zminus ~> mult_minus_left
1548 zmult_commute ~> mult_commute
1549 zmult_assoc ~> mult_assoc
1550 zadd_zmult_distrib ~> left_distrib
1551 zadd_zmult_distrib2 ~> right_distrib
1552 zdiff_zmult_distrib ~> left_diff_distrib
1553 zdiff_zmult_distrib2 ~> right_diff_distrib
1554 zmult_1 ~> mult_1_left
1555 zmult_1_right ~> mult_1_right
1556 zle_refl ~> order_refl
1557 zle_trans ~> order_trans
1558 zle_antisym ~> order_antisym
1559 zle_linear ~> linorder_linear
1560 zless_linear ~> linorder_less_linear
1561 zadd_left_mono ~> add_left_mono
1562 zadd_strict_right_mono ~> add_strict_right_mono
1563 zadd_zless_mono ~> add_less_le_mono
1564 int_0_less_1 ~> zero_less_one
1565 int_0_neq_1 ~> zero_neq_one
1567 zpower_zadd_distrib ~> power_add
1568 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
1569 zero_le_zpower_abs ~> zero_le_power_abs
1571 * Theory Deriv: Renamed
1573 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
1575 * Theory Library/Multiset: Improved code generation of multisets.
1577 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets
1578 are expressed via type classes again. The special syntax
1579 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant
1580 setsum_set, which is now subsumed by Big_Operators.setsum.
1583 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
1584 use theory HOL/Library/Nat_Bijection instead.
1586 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black
1587 trees is now inside a type class context. Names of affected
1588 operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for
1589 theories working directly with raw red-black trees, adapt the names as
1593 bulkload -> rbt_bulkload
1594 del_from_left -> rbt_del_from_left
1595 del_from_right -> rbt_del_from_right
1597 delete -> rbt_delete
1599 insert -> rbt_insert
1600 insertw -> rbt_insert_with
1601 insert_with_key -> rbt_insert_with_key
1602 map_entry -> rbt_map_entry
1603 lookup -> rbt_lookup
1604 sorted -> rbt_sorted
1605 tree_greater -> rbt_greater
1606 tree_less -> rbt_less
1607 tree_less_symbol -> rbt_less_symbol
1609 union_with -> rbt_union_with
1610 union_with_key -> rbt_union_with_key
1613 balance_left_sorted -> balance_left_rbt_sorted
1614 balance_left_tree_greater -> balance_left_rbt_greater
1615 balance_left_tree_less -> balance_left_rbt_less
1616 balance_right_sorted -> balance_right_rbt_sorted
1617 balance_right_tree_greater -> balance_right_rbt_greater
1618 balance_right_tree_less -> balance_right_rbt_less
1619 balance_sorted -> balance_rbt_sorted
1620 balance_tree_greater -> balance_rbt_greater
1621 balance_tree_less -> balance_rbt_less
1622 bulkload_is_rbt -> rbt_bulkload_is_rbt
1623 combine_sorted -> combine_rbt_sorted
1624 combine_tree_greater -> combine_rbt_greater
1625 combine_tree_less -> combine_rbt_less
1626 delete_in_tree -> rbt_delete_in_tree
1627 delete_is_rbt -> rbt_delete_is_rbt
1628 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater
1629 del_from_left_tree_less -> rbt_del_from_left_rbt_less
1630 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater
1631 del_from_right_tree_less -> rbt_del_from_right_rbt_less
1632 del_in_tree -> rbt_del_in_tree
1633 del_inv1_inv2 -> rbt_del_inv1_inv2
1634 del_sorted -> rbt_del_rbt_sorted
1635 del_tree_greater -> rbt_del_rbt_greater
1636 del_tree_less -> rbt_del_rbt_less
1637 dom_lookup_Branch -> dom_rbt_lookup_Branch
1638 entries_lookup -> entries_rbt_lookup
1639 finite_dom_lookup -> finite_dom_rbt_lookup
1640 insert_sorted -> rbt_insert_rbt_sorted
1641 insertw_is_rbt -> rbt_insertw_is_rbt
1642 insertwk_is_rbt -> rbt_insertwk_is_rbt
1643 insertwk_sorted -> rbt_insertwk_rbt_sorted
1644 insertw_sorted -> rbt_insertw_rbt_sorted
1645 ins_sorted -> ins_rbt_sorted
1646 ins_tree_greater -> ins_rbt_greater
1647 ins_tree_less -> ins_rbt_less
1648 is_rbt_sorted -> is_rbt_rbt_sorted
1649 lookup_balance -> rbt_lookup_balance
1650 lookup_bulkload -> rbt_lookup_rbt_bulkload
1651 lookup_delete -> rbt_lookup_rbt_delete
1652 lookup_Empty -> rbt_lookup_Empty
1653 lookup_from_in_tree -> rbt_lookup_from_in_tree
1654 lookup_in_tree -> rbt_lookup_in_tree
1655 lookup_ins -> rbt_lookup_ins
1656 lookup_insert -> rbt_lookup_rbt_insert
1657 lookup_insertw -> rbt_lookup_rbt_insertw
1658 lookup_insertwk -> rbt_lookup_rbt_insertwk
1659 lookup_keys -> rbt_lookup_keys
1660 lookup_map -> rbt_lookup_map
1661 lookup_map_entry -> rbt_lookup_rbt_map_entry
1662 lookup_tree_greater -> rbt_lookup_rbt_greater
1663 lookup_tree_less -> rbt_lookup_rbt_less
1664 lookup_union -> rbt_lookup_rbt_union
1665 map_entry_color_of -> rbt_map_entry_color_of
1666 map_entry_inv1 -> rbt_map_entry_inv1
1667 map_entry_inv2 -> rbt_map_entry_inv2
1668 map_entry_is_rbt -> rbt_map_entry_is_rbt
1669 map_entry_sorted -> rbt_map_entry_rbt_sorted
1670 map_entry_tree_greater -> rbt_map_entry_rbt_greater
1671 map_entry_tree_less -> rbt_map_entry_rbt_less
1672 map_tree_greater -> map_rbt_greater
1673 map_tree_less -> map_rbt_less
1674 map_sorted -> map_rbt_sorted
1675 paint_sorted -> paint_rbt_sorted
1676 paint_lookup -> paint_rbt_lookup
1677 paint_tree_greater -> paint_rbt_greater
1678 paint_tree_less -> paint_rbt_less
1679 sorted_entries -> rbt_sorted_entries
1680 tree_greater_eq_trans -> rbt_greater_eq_trans
1681 tree_greater_nit -> rbt_greater_nit
1682 tree_greater_prop -> rbt_greater_prop
1683 tree_greater_simps -> rbt_greater_simps
1684 tree_greater_trans -> rbt_greater_trans
1685 tree_less_eq_trans -> rbt_less_eq_trans
1686 tree_less_nit -> rbt_less_nit
1687 tree_less_prop -> rbt_less_prop
1688 tree_less_simps -> rbt_less_simps
1689 tree_less_trans -> rbt_less_trans
1690 tree_ord_props -> rbt_ord_props
1691 union_Branch -> rbt_union_Branch
1692 union_is_rbt -> rbt_union_is_rbt
1693 unionw_is_rbt -> rbt_unionw_is_rbt
1694 unionwk_is_rbt -> rbt_unionwk_is_rbt
1695 unionwk_sorted -> rbt_unionwk_rbt_sorted
1697 * Theory HOL/Library/Float: Floating point numbers are now defined as
1698 a subset of the real numbers. All operations are defined using the
1699 lifing-framework and proofs use the transfer method. INCOMPATIBILITY.
1706 round_down -> float_round_down
1707 round_up -> float_round_up
1711 ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod
1714 abs_float_def -> Float.compute_float_abs
1715 bitlen_ge0 -> bitlen_nonneg
1716 bitlen.simps -> Float.compute_bitlen
1717 float_components -> Float_mantissa_exponent
1718 float_divl.simps -> Float.compute_float_divl
1719 float_divr.simps -> Float.compute_float_divr
1720 float_eq_odd -> mult_powr_eq_mult_powr_iff
1721 float_power -> real_of_float_power
1722 lapprox_posrat_def -> Float.compute_lapprox_posrat
1723 lapprox_rat.simps -> Float.compute_lapprox_rat
1724 le_float_def' -> Float.compute_float_le
1725 le_float_def -> less_eq_float.rep_eq
1726 less_float_def' -> Float.compute_float_less
1727 less_float_def -> less_float.rep_eq
1728 normfloat_def -> Float.compute_normfloat
1729 normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0
1730 normfloat -> normfloat_def
1731 normfloat_unique -> use normfloat_def
1732 number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral
1733 one_float_def -> Float.compute_float_one
1734 plus_float_def -> Float.compute_float_plus
1735 rapprox_posrat_def -> Float.compute_rapprox_posrat
1736 rapprox_rat.simps -> Float.compute_rapprox_rat
1737 real_of_float_0 -> zero_float.rep_eq
1738 real_of_float_1 -> one_float.rep_eq
1739 real_of_float_abs -> abs_float.rep_eq
1740 real_of_float_add -> plus_float.rep_eq
1741 real_of_float_minus -> uminus_float.rep_eq
1742 real_of_float_mult -> times_float.rep_eq
1743 real_of_float_simp -> Float.rep_eq
1744 real_of_float_sub -> minus_float.rep_eq
1745 round_down.simps -> Float.compute_float_round_down
1746 round_up.simps -> Float.compute_float_round_up
1747 times_float_def -> Float.compute_float_times
1748 uminus_float_def -> Float.compute_float_uminus
1749 zero_float_def -> Float.compute_float_zero
1751 Lemmas not necessary anymore, use the transfer method:
1752 bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,
1753 float_divr, float_le_simp, float_less1_mantissa_bound,
1754 float_less_simp, float_less_zero, float_le_zero,
1755 float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,
1756 floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,
1757 lapprox_rat_bottom, normalized_float, rapprox_posrat,
1758 rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,
1759 real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,
1760 round_up, zero_le_float, zero_less_float
1762 * New theory HOL/Library/DAList provides an abstract type for
1763 association lists with distinct keys.
1765 * Session HOL/IMP: Added new theory of abstract interpretation of
1768 * Session HOL-Import: Re-implementation from scratch is faster,
1769 simpler, and more scalable. Requires a proof bundle, which is
1770 available as an external component. Discontinued old (and mostly
1771 dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY.
1773 * Session HOL-Word: Discontinued many redundant theorems specific to
1774 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
1777 word_sub_alt ~> word_sub_wi
1778 word_add_alt ~> word_add_def
1779 word_mult_alt ~> word_mult_def
1780 word_minus_alt ~> word_minus_def
1781 word_0_alt ~> word_0_wi
1782 word_1_alt ~> word_1_wi
1783 word_add_0 ~> add_0_left
1784 word_add_0_right ~> add_0_right
1785 word_mult_1 ~> mult_1_left
1786 word_mult_1_right ~> mult_1_right
1787 word_add_commute ~> add_commute
1788 word_add_assoc ~> add_assoc
1789 word_add_left_commute ~> add_left_commute
1790 word_mult_commute ~> mult_commute
1791 word_mult_assoc ~> mult_assoc
1792 word_mult_left_commute ~> mult_left_commute
1793 word_left_distrib ~> left_distrib
1794 word_right_distrib ~> right_distrib
1795 word_left_minus ~> left_minus
1796 word_diff_0_right ~> diff_0_right
1797 word_diff_self ~> diff_self
1798 word_sub_def ~> diff_minus
1799 word_diff_minus ~> diff_minus
1800 word_add_ac ~> add_ac
1801 word_mult_ac ~> mult_ac
1802 word_plus_ac0 ~> add_0_left add_0_right add_ac
1803 word_times_ac1 ~> mult_1_left mult_1_right mult_ac
1804 word_order_trans ~> order_trans
1805 word_order_refl ~> order_refl
1806 word_order_antisym ~> order_antisym
1807 word_order_linear ~> linorder_linear
1808 lenw1_zero_neq_one ~> zero_neq_one
1809 word_number_of_eq ~> number_of_eq
1810 word_of_int_add_hom ~> wi_hom_add
1811 word_of_int_sub_hom ~> wi_hom_sub
1812 word_of_int_mult_hom ~> wi_hom_mult
1813 word_of_int_minus_hom ~> wi_hom_neg
1814 word_of_int_succ_hom ~> wi_hom_succ
1815 word_of_int_pred_hom ~> wi_hom_pred
1816 word_of_int_0_hom ~> word_0_wi
1817 word_of_int_1_hom ~> word_1_wi
1819 * Session HOL-Word: New proof method "word_bitwise" for splitting
1820 machine word equalities and inequalities into logical circuits,
1821 defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction,
1822 multiplication, shifting by constants, bitwise operators and numeric
1823 constants. Requires fixed-length word types, not 'a word. Solves
1824 many standard word identities outright and converts more into first
1825 order problems amenable to blast or similar. See also examples in
1826 HOL/Word/Examples/WordExamples.thy.
1828 * Session HOL-Probability: Introduced the type "'a measure" to
1829 represent measures, this replaces the records 'a algebra and 'a
1830 measure_space. The locales based on subset_class now have two
1831 locale-parameters the space \<Omega> and the set of measurable sets M.
1832 The product of probability spaces uses now the same constant as the
1833 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)
1834 measure". Most constants are defined now outside of locales and gain
1835 an additional parameter, like null_sets, almost_eventually or \<mu>'.
1836 Measure space constructions for distributions and densities now got
1837 their own constants distr and density. Instead of using locales to
1838 describe measure spaces with a finite space, the measure count_space
1839 and point_measure is introduced. INCOMPATIBILITY.
1843 finite_measure.\<mu>' -> measure
1844 product_algebra_generator -> prod_algebra
1845 product_prob_space.emb -> prod_emb
1846 product_prob_space.infprod_algebra -> PiM
1849 completeable_measure_space
1850 finite_measure_space
1852 finite_product_finite_prob_space
1853 finite_product_sigma_algebra
1854 finite_sigma_algebra
1856 pair_finite_prob_space
1857 pair_finite_sigma_algebra
1860 product_sigma_algebra
1864 distribution -> use distr measure, or distributed predicate
1866 joint_distribution -> use distr measure, or distributed predicate
1867 pair_measure_generator
1868 product_prob_space.infprod_algebra -> use PiM
1871 Replacement theorems:
1872 finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite
1873 finite_measure.empty_measure -> measure_empty
1874 finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq
1875 finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq
1876 finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably
1877 finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure
1878 finite_measure.finite_measure -> finite_measure.emeasure_finite
1879 finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton
1880 finite_measure.positive_measure' -> measure_nonneg
1881 finite_measure.real_measure -> finite_measure.emeasure_real
1882 finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb
1883 finite_product_sigma_algebra.in_P -> sets_PiM_I_finite
1884 finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty
1885 information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed
1886 information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple
1887 information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple
1888 information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple
1889 information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple
1890 information_space.entropy_commute -> information_space.entropy_commute_simple
1891 information_space.entropy_eq -> information_space.entropy_simple_distributed
1892 information_space.entropy_generic_eq -> information_space.entropy_simple_distributed
1893 information_space.entropy_positive -> information_space.entropy_nonneg_simple
1894 information_space.entropy_uniform_max -> information_space.entropy_uniform
1895 information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq
1896 information_space.KL_eq_0 -> information_space.KL_same_eq_0
1897 information_space.KL_ge_0 -> information_space.KL_nonneg
1898 information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed
1899 information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple
1900 Int_stable_cuboids -> Int_stable_atLeastAtMost
1901 Int_stable_product_algebra_generator -> positive_integral
1902 measure_preserving -> equality "distr M N f = N" "f : measurable M N"
1903 measure_space.additive -> emeasure_additive
1904 measure_space.AE_iff_null_set -> AE_iff_null
1905 measure_space.almost_everywhere_def -> eventually_ae_filter
1906 measure_space.almost_everywhere_vimage -> AE_distrD
1907 measure_space.continuity_from_above -> INF_emeasure_decseq
1908 measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq
1909 measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq
1910 measure_space.continuity_from_below -> SUP_emeasure_incseq
1911 measure_space_density -> emeasure_density
1912 measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density
1913 measure_space.integrable_vimage -> integrable_distr
1914 measure_space.integral_translated_density -> integral_density
1915 measure_space.integral_vimage -> integral_distr
1916 measure_space.measure_additive -> plus_emeasure
1917 measure_space.measure_compl -> emeasure_compl
1918 measure_space.measure_countable_increasing -> emeasure_countable_increasing
1919 measure_space.measure_countably_subadditive -> emeasure_subadditive_countably
1920 measure_space.measure_decseq -> decseq_emeasure
1921 measure_space.measure_Diff -> emeasure_Diff
1922 measure_space.measure_Diff_null_set -> emeasure_Diff_null_set
1923 measure_space.measure_eq_0 -> emeasure_eq_0
1924 measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite
1925 measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton
1926 measure_space.measure_incseq -> incseq_emeasure
1927 measure_space.measure_insert -> emeasure_insert
1928 measure_space.measure_mono -> emeasure_mono
1929 measure_space.measure_not_negative -> emeasure_not_MInf
1930 measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq
1931 measure_space.measure_setsum -> setsum_emeasure
1932 measure_space.measure_setsum_split -> setsum_emeasure_cover
1933 measure_space.measure_space_vimage -> emeasure_distr
1934 measure_space.measure_subadditive_finite -> emeasure_subadditive_finite
1935 measure_space.measure_subadditive -> subadditive
1936 measure_space.measure_top -> emeasure_space
1937 measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0
1938 measure_space.measure_Un_null_set -> emeasure_Un_null_set
1939 measure_space.positive_integral_translated_density -> positive_integral_density
1940 measure_space.positive_integral_vimage -> positive_integral_distr
1941 measure_space.real_continuity_from_above -> Lim_measure_decseq
1942 measure_space.real_continuity_from_below -> Lim_measure_incseq
1943 measure_space.real_measure_countably_subadditive -> measure_subadditive_countably
1944 measure_space.real_measure_Diff -> measure_Diff
1945 measure_space.real_measure_finite_Union -> measure_finite_Union
1946 measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton
1947 measure_space.real_measure_subadditive -> measure_subadditive
1948 measure_space.real_measure_Union -> measure_Union
1949 measure_space.real_measure_UNION -> measure_UNION
1950 measure_space.simple_function_vimage -> simple_function_comp
1951 measure_space.simple_integral_vimage -> simple_integral_distr
1952 measure_space.simple_integral_vimage -> simple_integral_distr
1953 measure_unique_Int_stable -> measure_eqI_generator_eq
1954 measure_unique_Int_stable_vimage -> measure_eqI_generator_eq
1955 pair_sigma_algebra.measurable_cut_fst -> sets_Pair1
1956 pair_sigma_algebra.measurable_cut_snd -> sets_Pair2
1957 pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1
1958 pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2
1959 pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff
1960 pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap
1961 pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'
1962 pair_sigma_algebra.sets_swap -> sets_pair_swap
1963 pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1
1964 pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2
1965 pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap
1966 pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2
1967 pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt
1968 pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times
1969 prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM
1970 prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq
1971 prob_space.measure_space_1 -> prob_space.emeasure_space_1
1972 prob_space.prob_space_vimage -> prob_space_distr
1973 prob_space.random_variable_restrict -> measurable_restrict
1974 prob_space_unique_Int_stable -> measure_eqI_prob_space
1975 product_algebraE -> prod_algebraE_all
1976 product_algebra_generator_der -> prod_algebra_eq_finite
1977 product_algebra_generator_into_space -> prod_algebra_sets_into_space
1978 product_algebraI -> sets_PiM_I_finite
1979 product_measure_exists -> product_sigma_finite.sigma_finite
1980 product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator
1981 product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb
1982 product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty
1983 product_prob_space.measurable_component -> measurable_component_singleton
1984 product_prob_space.measurable_emb -> measurable_prod_emb
1985 product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single
1986 product_prob_space.measurable_singleton_infprod -> measurable_component_singleton
1987 product_prob_space.measure_emb -> emeasure_prod_emb
1988 product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict
1989 product_sigma_algebra.product_algebra_into_space -> space_closed
1990 product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge
1991 product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton
1992 product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge
1993 sequence_space.measure_infprod -> sequence_space.measure_PiM_countable
1994 sets_product_algebra -> sets_PiM
1995 sigma_algebra.measurable_sigma -> measurable_measure_of
1996 sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint
1997 sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr
1998 sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq
1999 space_product_algebra -> space_PiM
2001 * Session HOL-TPTP: support to parse and import TPTP problems (all
2002 languages) into Isabelle/HOL.
2007 * New "case_product" attribute (see HOL).
2012 * Greater support for structured proofs involving induction or case
2015 * Much greater use of mathematical symbols.
2017 * Removal of many ML theorem bindings. INCOMPATIBILITY.
2022 * Antiquotation @{keyword "name"} produces a parser for outer syntax
2023 from a minor keyword introduced via theory header declaration.
2025 * Antiquotation @{command_spec "name"} produces the
2026 Outer_Syntax.command_spec from a major keyword introduced via theory
2027 header declaration; it can be passed to Outer_Syntax.command etc.
2029 * Local_Theory.define no longer hard-wires default theorem name
2030 "foo_def", but retains the binding as given. If that is Binding.empty
2031 / Attrib.empty_binding, the result is not registered as user-level
2032 fact. The Local_Theory.define_internal variant allows to specify a
2033 non-empty name (used for the foundation in the background theory),
2034 while omitting the fact binding in the user-context. Potential
2035 INCOMPATIBILITY for derived definitional packages: need to specify
2036 naming policy for primitive definitions more explicitly.
2038 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
2039 conformance with similar operations in structure Term and Logic.
2041 * Antiquotation @{attributes [...]} embeds attribute source
2042 representation into the ML text, which is particularly useful with
2043 declarations like Local_Theory.note.
2045 * Structure Proof_Context follows standard naming scheme. Old
2046 ProofContext has been discontinued. INCOMPATIBILITY.
2048 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
2049 change of semantics: update is applied to auxiliary local theory
2052 * Modernized some old-style infix operations:
2054 addeqcongs ~> Simplifier.add_eqcong
2055 deleqcongs ~> Simplifier.del_eqcong
2056 addcongs ~> Simplifier.add_cong
2057 delcongs ~> Simplifier.del_cong
2058 setmksimps ~> Simplifier.set_mksimps
2059 setmkcong ~> Simplifier.set_mkcong
2060 setmksym ~> Simplifier.set_mksym
2061 setmkeqTrue ~> Simplifier.set_mkeqTrue
2062 settermless ~> Simplifier.set_termless
2063 setsubgoaler ~> Simplifier.set_subgoaler
2064 addsplits ~> Splitter.add_split
2065 delsplits ~> Splitter.del_split
2070 * USER_HOME settings variable points to cross-platform user home
2071 directory, which coincides with HOME on POSIX systems only. Likewise,
2072 the Isabelle path specification "~" now expands to $USER_HOME, instead
2073 of former $HOME. A different default for USER_HOME may be set
2074 explicitly in shell environment, before Isabelle settings are
2075 evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where
2076 the generic user home was intended.
2078 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
2079 notation, which is useful for the jEdit file browser, for example.
2081 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
2086 New in Isabelle2011-1 (October 2011)
2087 ------------------------------------
2091 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
2092 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
2094 - Management of multiple theory files directly from the editor
2095 buffer store -- bypassing the file-system (no requirement to save
2096 files for checking).
2098 - Markup of formal entities within the text buffer, with semantic
2099 highlighting, tooltips and hyperlinks to jump to defining source
2102 - Improved text rendering, with sub/superscripts in the source
2103 buffer (including support for copy/paste wrt. output panel, HTML
2104 theory output and other non-Isabelle text boxes).
2106 - Refined scheduling of proof checking and printing of results,
2107 based on interactive editor view. (Note: jEdit folding and
2108 narrowing allows to restrict buffer perspectives explicitly.)
2110 - Reduced CPU performance requirements, usable on machines with few
2113 - Reduced memory requirements due to pruning of unused document
2114 versions (garbage collection).
2116 See also ~~/src/Tools/jEdit/README.html for further information,
2117 including some remaining limitations.
2119 * Theory loader: source files are exclusively located via the master
2120 directory of each theory node (where the .thy file itself resides).
2121 The global load path (such as src/HOL/Library) has been discontinued.
2122 Note that the path element ~~ may be used to reference theories in the
2123 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
2126 * Theory loader: source files are identified by content via SHA1
2127 digests. Discontinued former path/modtime identification and optional
2128 ISABELLE_FILE_IDENT plugin scripts.
2130 * Parallelization of nested Isar proofs is subject to
2131 Goal.parallel_proofs_threshold (default 100). See also isabelle
2134 * Name space: former unsynchronized references are now proper
2135 configuration options, with more conventional names:
2137 long_names ~> names_long
2138 short_names ~> names_short
2139 unique_names ~> names_unique
2141 Minor INCOMPATIBILITY, need to declare options in context like this:
2143 declare [[names_unique = false]]
2145 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note
2146 that the result needs to be unique, which means fact specifications
2147 may have to be refined after enriching a proof context.
2149 * Attribute "case_names" has been refined: the assumptions in each case
2150 can be named now by following the case name with [name1 name2 ...].
2152 * Isabelle/Isar reference manual has been updated and extended:
2153 - "Synopsis" provides a catalog of main Isar language concepts.
2154 - Formal references in syntax diagrams, via @{rail} antiquotation.
2155 - Updated material from classic "ref" manual, notably about
2156 "Classical Reasoner".
2161 * Class bot and top require underlying partial order rather than
2162 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.
2164 * Class complete_lattice: generalized a couple of lemmas from sets;
2165 generalized theorems INF_cong and SUP_cong. New type classes for
2166 complete boolean algebras and complete linear orders. Lemmas
2167 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
2168 class complete_linorder.
2170 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
2171 Sup_fun_def, Inf_apply, Sup_apply.
2173 Removed redundant lemmas (the right hand side gives hints how to
2174 replace them for (metis ...), or (simp only: ...) proofs):
2176 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
2177 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
2178 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
2179 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
2180 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
2181 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
2182 Inter_def ~> INF_def, image_def
2183 Union_def ~> SUP_def, image_def
2184 INT_eq ~> INF_def, and image_def
2185 UN_eq ~> SUP_def, and image_def
2186 INF_subset ~> INF_superset_mono [OF _ order_refl]
2188 More consistent and comprehensive names:
2190 INTER_eq_Inter_image ~> INF_def
2191 UNION_eq_Union_image ~> SUP_def
2194 INF_leI ~> INF_lower
2195 INF_leI2 ~> INF_lower2
2196 le_INFI ~> INF_greatest
2197 le_SUPI ~> SUP_upper
2198 le_SUPI2 ~> SUP_upper2
2199 SUP_leI ~> SUP_least
2200 INFI_bool_eq ~> INF_bool_eq
2201 SUPR_bool_eq ~> SUP_bool_eq
2202 INFI_apply ~> INF_apply
2203 SUPR_apply ~> SUP_apply
2204 INTER_def ~> INTER_eq
2205 UNION_def ~> UNION_eq
2209 * Renamed theory Complete_Lattice to Complete_Lattices.
2212 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
2213 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
2214 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
2215 Sup_insert are now declared as [simp]. INCOMPATIBILITY.
2217 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
2218 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
2219 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor
2222 * Added syntactic classes "inf" and "sup" for the respective
2223 constants. INCOMPATIBILITY: Changes in the argument order of the
2224 (mostly internal) locale predicates for some derived classes.
2226 * Theorem collections ball_simps and bex_simps do not contain theorems
2227 referring to UNION any longer; these have been moved to collection
2228 UN_ball_bex_simps. INCOMPATIBILITY.
2230 * Theory Archimedean_Field: floor now is defined as parameter of a
2231 separate type class floor_ceiling.
2233 * Theory Finite_Set: more coherent development of fold_set locales:
2235 locale fun_left_comm ~> locale comp_fun_commute
2236 locale fun_left_comm_idem ~> locale comp_fun_idem
2238 Both use point-free characterization; interpretation proofs may need
2239 adjustment. INCOMPATIBILITY.
2241 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
2242 accordance with standard mathematical terminology. INCOMPATIBILITY.
2244 * Theory Complex_Main: The locale interpretations for the
2245 bounded_linear and bounded_bilinear locales have been removed, in
2246 order to reduce the number of duplicate lemmas. Users must use the
2247 original names for distributivity theorems, potential INCOMPATIBILITY.
2249 divide.add ~> add_divide_distrib
2250 divide.diff ~> diff_divide_distrib
2251 divide.setsum ~> setsum_divide_distrib
2252 mult.add_right ~> right_distrib
2253 mult.diff_right ~> right_diff_distrib
2254 mult_right.setsum ~> setsum_right_distrib
2255 mult_left.diff ~> left_diff_distrib
2257 * Theory Complex_Main: Several redundant theorems have been removed or
2258 replaced by more general versions. INCOMPATIBILITY.
2260 real_diff_def ~> minus_real_def
2261 real_divide_def ~> divide_real_def
2262 real_less_def ~> less_le
2263 real_abs_def ~> abs_real_def
2264 real_sgn_def ~> sgn_real_def
2265 real_mult_commute ~> mult_commute
2266 real_mult_assoc ~> mult_assoc
2267 real_mult_1 ~> mult_1_left
2268 real_add_mult_distrib ~> left_distrib
2269 real_zero_not_eq_one ~> zero_neq_one
2270 real_mult_inverse_left ~> left_inverse
2271 INVERSE_ZERO ~> inverse_zero
2272 real_le_refl ~> order_refl
2273 real_le_antisym ~> order_antisym
2274 real_le_trans ~> order_trans
2275 real_le_linear ~> linear
2276 real_le_eq_diff ~> le_iff_diff_le_0
2277 real_add_left_mono ~> add_left_mono
2278 real_mult_order ~> mult_pos_pos
2279 real_mult_less_mono2 ~> mult_strict_left_mono
2280 real_of_int_real_of_nat ~> real_of_int_of_nat_eq
2281 real_0_le_divide_iff ~> zero_le_divide_iff
2282 realpow_two_disj ~> power2_eq_iff
2283 real_squared_diff_one_factored ~> square_diff_one_factored
2284 realpow_two_diff ~> square_diff_square_factored
2285 reals_complete2 ~> complete_real
2286 real_sum_squared_expand ~> power2_sum
2287 exp_ln_eq ~> ln_unique
2289 expi_zero ~> exp_zero
2290 lemma_DERIV_subst ~> DERIV_cong
2291 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
2292 LIMSEQ_const ~> tendsto_const
2293 LIMSEQ_norm ~> tendsto_norm
2294 LIMSEQ_add ~> tendsto_add
2295 LIMSEQ_minus ~> tendsto_minus
2296 LIMSEQ_minus_cancel ~> tendsto_minus_cancel
2297 LIMSEQ_diff ~> tendsto_diff
2298 bounded_linear.LIMSEQ ~> bounded_linear.tendsto
2299 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
2300 LIMSEQ_mult ~> tendsto_mult
2301 LIMSEQ_inverse ~> tendsto_inverse
2302 LIMSEQ_divide ~> tendsto_divide
2303 LIMSEQ_pow ~> tendsto_power
2304 LIMSEQ_setsum ~> tendsto_setsum
2305 LIMSEQ_setprod ~> tendsto_setprod
2306 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
2307 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
2308 LIMSEQ_imp_rabs ~> tendsto_rabs
2309 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
2310 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
2311 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
2312 LIMSEQ_Complex ~> tendsto_Complex
2313 LIM_ident ~> tendsto_ident_at
2314 LIM_const ~> tendsto_const
2315 LIM_add ~> tendsto_add
2316 LIM_add_zero ~> tendsto_add_zero
2317 LIM_minus ~> tendsto_minus
2318 LIM_diff ~> tendsto_diff
2319 LIM_norm ~> tendsto_norm
2320 LIM_norm_zero ~> tendsto_norm_zero
2321 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
2322 LIM_norm_zero_iff ~> tendsto_norm_zero_iff
2323 LIM_rabs ~> tendsto_rabs
2324 LIM_rabs_zero ~> tendsto_rabs_zero
2325 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
2326 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
2327 LIM_compose ~> tendsto_compose
2328 LIM_mult ~> tendsto_mult
2329 LIM_scaleR ~> tendsto_scaleR
2330 LIM_of_real ~> tendsto_of_real
2331 LIM_power ~> tendsto_power
2332 LIM_inverse ~> tendsto_inverse
2333 LIM_sgn ~> tendsto_sgn
2334 isCont_LIM_compose ~> isCont_tendsto_compose
2335 bounded_linear.LIM ~> bounded_linear.tendsto
2336 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
2337 bounded_bilinear.LIM ~> bounded_bilinear.tendsto
2338 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
2339 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
2340 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
2341 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
2343 * Theory Complex_Main: The definition of infinite series was
2344 generalized. Now it is defined on the type class {topological_space,
2345 comm_monoid_add}. Hence it is useable also for extended real numbers.
2347 * Theory Complex_Main: The complex exponential function "expi" is now
2348 a type-constrained abbreviation for "exp :: complex => complex"; thus
2349 several polymorphic lemmas about "exp" are now applicable to "expi".
2353 - Theory Library/Code_Char_ord provides native ordering of
2354 characters in the target language.
2356 - Commands code_module and code_library are legacy, use export_code
2359 - Method "evaluation" is legacy, use method "eval" instead.
2361 - Legacy evaluator "SML" is deactivated by default. May be
2362 reactivated by the following theory command:
2364 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
2366 * Declare ext [intro] by default. Rare INCOMPATIBILITY.
2368 * New proof method "induction" that gives induction hypotheses the
2369 name "IH", thus distinguishing them from further hypotheses that come
2370 from rule induction. The latter are still called "hyps". Method
2371 "induction" is a thin wrapper around "induct" and follows the same
2374 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
2375 still available as a legacy feature for some time.
2378 - Added "need" and "total_consts" options.
2379 - Reintroduced "show_skolems" option by popular demand.
2380 - Renamed attribute: nitpick_def ~> nitpick_unfold.
2384 - Use quasi-sound (and efficient) translations by default.
2385 - Added support for the following provers: E-ToFoF, LEO-II,
2386 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
2387 - Automatically preplay and minimize proofs before showing them if
2388 this can be done within reasonable time.
2389 - sledgehammer available_provers ~> sledgehammer supported_provers.
2391 - Added "preplay_timeout", "slicing", "type_enc", "sound",
2392 "max_mono_iters", and "max_new_mono_instances" options.
2393 - Removed "explicit_apply" and "full_types" options as well as "Full
2394 Types" Proof General menu item. INCOMPATIBILITY.
2397 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
2398 - Obsoleted "metisFT" -- use "metis (full_types)" instead.
2402 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
2403 "elim:" options. INCOMPATIBILITY.
2404 - Introduced 'try' that not only runs 'try_methods' but also
2405 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
2408 - Added "eval" option to evaluate terms for the found counterexample
2409 (currently only supported by the default (exhaustive) tester).
2410 - Added post-processing of terms to obtain readable counterexamples
2411 (currently only supported by the default (exhaustive) tester).
2412 - New counterexample generator quickcheck[narrowing] enables
2413 narrowing-based testing. Requires the Glasgow Haskell compiler
2414 with its installation location defined in the Isabelle settings
2415 environment as ISABELLE_GHC.
2416 - Removed quickcheck tester "SML" based on the SML code generator
2417 (formly in HOL/Library).
2419 * Function package: discontinued option "tailrec". INCOMPATIBILITY,
2420 use 'partial_function' instead.
2422 * Theory Library/Extended_Reals replaces now the positive extended
2423 reals found in probability theory. This file is extended by
2424 Multivariate_Analysis/Extended_Real_Limits.
2426 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,
2427 from where it must be imported explicitly if it is really required.
2430 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
2431 been moved here. INCOMPATIBILITY.
2433 * Theory Library/Saturated provides type of numbers with saturated
2436 * Theory Library/Product_Lattice defines a pointwise ordering for the
2437 product type 'a * 'b, and provides instance proofs for various order
2438 and lattice type classes.
2440 * Theory Library/Countable now provides the "countable_datatype" proof
2441 method for proving "countable" class instances for datatypes.
2443 * Theory Library/Cset_Monad allows do notation for computable sets
2444 (cset) via the generic monad ad-hoc overloading facility.
2446 * Library: Theories of common data structures are split into theories
2447 for implementation, an invariant-ensuring type, and connection to an
2448 abstract type. INCOMPATIBILITY.
2450 - RBT is split into RBT and RBT_Mapping.
2451 - AssocList is split and renamed into AList and AList_Mapping.
2452 - DList is split into DList_Impl, DList, and DList_Cset.
2453 - Cset is split into Cset and List_Cset.
2455 * Theory Library/Nat_Infinity has been renamed to
2456 Library/Extended_Nat, with name changes of the following types and
2459 type inat ~> type enat
2461 Infty ~> infinity (overloaded)
2465 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
2466 been renamed accordingly. INCOMPATIBILITY.
2468 * Session Multivariate_Analysis: The euclidean_space type class now
2469 fixes a constant "Basis :: 'a set" consisting of the standard
2470 orthonormal basis for the type. Users now have the option of
2471 quantifying over this set instead of using the "basis" function, e.g.
2472 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
2474 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
2475 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
2476 "Cart_nth" and "Cart_lambda" have been respectively renamed to
2477 "vec_nth" and "vec_lambda"; theorems mentioning those names have
2478 changed to match. Definition theorems for overloaded constants now use
2479 the standard "foo_vec_def" naming scheme. A few other theorems have
2480 been renamed as follows (INCOMPATIBILITY):
2482 Cart_eq ~> vec_eq_iff
2483 dist_nth_le_cart ~> dist_vec_nth_le
2484 tendsto_vector ~> vec_tendstoI
2485 Cauchy_vector ~> vec_CauchyI
2487 * Session Multivariate_Analysis: Several duplicate theorems have been
2488 removed, and other theorems have been renamed or replaced with more
2489 general versions. INCOMPATIBILITY.
2491 finite_choice ~> finite_set_choice
2492 eventually_conjI ~> eventually_conj
2493 eventually_and ~> eventually_conj_iff
2494 eventually_false ~> eventually_False
2495 setsum_norm ~> norm_setsum
2496 Lim_sequentially ~> LIMSEQ_def
2497 Lim_ident_at ~> LIM_ident
2498 Lim_const ~> tendsto_const
2499 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
2500 Lim_neg ~> tendsto_minus
2501 Lim_add ~> tendsto_add
2502 Lim_sub ~> tendsto_diff
2503 Lim_mul ~> tendsto_scaleR
2504 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
2505 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
2506 Lim_linear ~> bounded_linear.tendsto
2507 Lim_component ~> tendsto_euclidean_component
2508 Lim_component_cart ~> tendsto_vec_nth
2509 Lim_inner ~> tendsto_inner [OF tendsto_const]
2510 dot_lsum ~> inner_setsum_left
2511 dot_rsum ~> inner_setsum_right
2512 continuous_cmul ~> continuous_scaleR [OF continuous_const]
2513 continuous_neg ~> continuous_minus
2514 continuous_sub ~> continuous_diff
2515 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
2516 continuous_mul ~> continuous_scaleR
2517 continuous_inv ~> continuous_inverse
2518 continuous_at_within_inv ~> continuous_at_within_inverse
2519 continuous_at_inv ~> continuous_at_inverse
2520 continuous_at_norm ~> continuous_norm [OF continuous_at_id]
2521 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
2522 continuous_at_component ~> continuous_component [OF continuous_at_id]
2523 continuous_on_neg ~> continuous_on_minus
2524 continuous_on_sub ~> continuous_on_diff
2525 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
2526 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
2527 continuous_on_mul ~> continuous_on_scaleR
2528 continuous_on_mul_real ~> continuous_on_mult
2529 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
2530 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
2531 continuous_on_inverse ~> continuous_on_inv
2532 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
2533 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
2534 subset_interior ~> interior_mono
2535 subset_closure ~> closure_mono
2536 closure_univ ~> closure_UNIV
2537 real_arch_lt ~> reals_Archimedean2
2538 real_arch ~> reals_Archimedean3
2539 real_abs_norm ~> abs_norm_cancel
2540 real_abs_sub_norm ~> norm_triangle_ineq3
2541 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
2543 * Session HOL-Probability:
2544 - Caratheodory's extension lemma is now proved for ring_of_sets.
2545 - Infinite products of probability measures are now available.
2546 - Sigma closure is independent, if the generator is independent
2547 - Use extended reals instead of positive extended
2548 reals. INCOMPATIBILITY.
2550 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
2552 expand_fun_below ~> fun_below_iff
2553 below_fun_ext ~> fun_belowI
2554 expand_cfun_eq ~> cfun_eq_iff
2555 ext_cfun ~> cfun_eqI
2556 expand_cfun_below ~> cfun_below_iff
2557 below_cfun_ext ~> cfun_belowI
2558 monofun_fun_fun ~> fun_belowD
2559 monofun_fun_arg ~> monofunE
2560 monofun_lub_fun ~> adm_monofun [THEN admD]
2561 cont_lub_fun ~> adm_cont [THEN admD]
2562 cont2cont_Rep_CFun ~> cont2cont_APP
2563 cont_Rep_CFun_app ~> cont_APP_app
2564 cont_Rep_CFun_app_app ~> cont_APP_app_app
2565 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
2566 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
2567 contlub_cfun ~> lub_APP [symmetric]
2568 contlub_LAM ~> lub_LAM [symmetric]
2571 lift_distinct1 ~> lift.distinct(1)
2572 lift_distinct2 ~> lift.distinct(2)
2573 Def_not_UU ~> lift.distinct(2)
2574 Def_inject ~> lift.inject
2575 below_UU_iff ~> below_bottom_iff
2576 eq_UU_iff ~> eq_bottom_iff
2579 *** Document preparation ***
2581 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
2582 isar-ref manual, both for description and actual application of the
2585 * Antiquotation @{value} evaluates the given term and presents its
2588 * Antiquotations: term style "isub" provides ad-hoc conversion of
2589 variables x1, y23 into subscripted form x\<^isub>1,
2590 y\<^isub>2\<^isub>3.
2592 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
2593 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
2595 * Localized \isabellestyle switch can be used within blocks or groups
2598 \isabellestyle{it} %preferred default
2599 {\isabellestylett @{text "typewriter stuff"}}
2601 * Discontinued special treatment of hard tabulators. Implicit
2602 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual
2608 * The inner syntax of sort/type/term/prop supports inlined YXML
2609 representations within quoted string tokens. By encoding logical
2610 entities via Term_XML (in ML or Scala) concrete syntax can be
2611 bypassed, which is particularly useful for producing bits of text
2612 under external program control.
2614 * Antiquotations for ML and document preparation are managed as theory
2615 data, which requires explicit setup.
2617 * Isabelle_Process.is_active allows tools to check if the official
2618 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
2619 (better known as Proof General).
2621 * Structure Proof_Context follows standard naming scheme. Old
2622 ProofContext is still available for some time as legacy alias.
2624 * Structure Timing provides various operations for timing; supersedes
2625 former start_timing/end_timing etc.
2627 * Path.print is the official way to show file-system paths to users
2628 (including quotes etc.).
2630 * Inner syntax: identifiers in parse trees of generic categories
2631 "logic", "aprop", "idt" etc. carry position information (disguised as
2632 type constraints). Occasional INCOMPATIBILITY with non-compliant
2633 translations that choke on unexpected type constraints. Positions can
2634 be stripped in ML translations via Syntax.strip_positions /
2635 Syntax.strip_positions_ast, or via the syntax constant
2636 "_strip_positions" within parse trees. As last resort, positions can
2637 be disabled via the configuration option Syntax.positions, which is
2638 called "syntax_positions" in Isar attribute syntax.
2640 * Discontinued special status of various ML structures that contribute
2641 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
2642 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
2643 refer directly to Ast.Constant, Lexicon.is_identifier,
2644 Syntax_Trans.mk_binder_tr etc.
2646 * Typed print translation: discontinued show_sorts argument, which is
2647 already available via context of "advanced" translation.
2649 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
2650 goal states; body tactic needs to address all subgoals uniformly.
2652 * Slightly more special eq_list/eq_set, with shortcut involving
2653 pointer equality (assumes that eq relation is reflexive).
2655 * Classical tactics use proper Proof.context instead of historic types
2656 claset/clasimpset. Old-style declarations like addIs, addEs, addDs
2657 operate directly on Proof.context. Raw type claset retains its use as
2658 snapshot of the classical context, which can be recovered via
2659 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.
2660 INCOMPATIBILITY, classical tactics and derived proof methods require
2661 proper Proof.context.
2666 * Discontinued support for Poly/ML 5.2, which was the last version
2667 without proper multithreading and TimeLimit implementation.
2669 * Discontinued old lib/scripts/polyml-platform, which has been
2670 obsolete since Isabelle2009-2.
2672 * Various optional external tools are referenced more robustly and
2673 uniformly by explicit Isabelle settings as follows:
2675 ISABELLE_CSDP (formerly CSDP_EXE)
2676 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)
2677 ISABELLE_OCAML (formerly EXEC_OCAML)
2678 ISABELLE_SWIPL (formerly EXEC_SWIPL)
2679 ISABELLE_YAP (formerly EXEC_YAP)
2681 Note that automated detection from the file-system or search path has
2682 been discontinued. INCOMPATIBILITY.
2684 * Scala layer provides JVM method invocation service for static
2685 methods of type (String)String, see Invoke_Scala.method in ML. For
2688 Invoke_Scala.method "java.lang.System.getProperty" "java.home"
2690 Together with YXML.string_of_body/parse_body and XML.Encode/Decode
2691 this allows to pass structured values between ML and Scala.
2693 * The IsabelleText fonts includes some further glyphs to support the
2694 Prover IDE. Potential INCOMPATIBILITY: users who happen to have
2695 installed a local copy (which is normally *not* required) need to
2696 delete or update it from ~~/lib/fonts/.
2700 New in Isabelle2011 (January 2011)
2701 ----------------------------------
2705 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
2706 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
2707 useful tooltips and hyperlinks produced from its static analysis. The
2708 bundled component provides an executable Isabelle tool that can be run
2711 Isabelle2011/bin/isabelle jedit
2713 * Significantly improved Isabelle/Isar implementation manual.
2715 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
2716 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
2717 while the default heap location within that directory lacks that extra
2718 suffix. This isolates multiple Isabelle installations from each
2719 other, avoiding problems with old settings in new versions.
2720 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
2722 * Source files are always encoded as UTF-8, instead of old-fashioned
2723 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
2724 the following package declarations:
2726 \usepackage[utf8]{inputenc}
2727 \usepackage{textcomp}
2729 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
2730 a Unicode character is treated as a single symbol, not a sequence of
2731 non-ASCII bytes as before. Since Isabelle/ML string literals may
2732 contain symbols without further backslash escapes, Unicode can now be
2733 used here as well. Recall that Symbol.explode in ML provides a
2734 consistent view on symbols, while raw explode (or String.explode)
2735 merely give a byte-oriented representation.
2737 * Theory loader: source files are primarily located via the master
2738 directory of each theory node (where the .thy file itself resides).
2739 The global load path is still partially available as legacy feature.
2740 Minor INCOMPATIBILITY due to subtle change in file lookup: use
2741 explicit paths, relatively to the theory.
2743 * Special treatment of ML file names has been discontinued.
2744 Historically, optional extensions .ML or .sml were added on demand --
2745 at the cost of clarity of file dependencies. Recall that Isabelle/ML
2746 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
2748 * Various options that affect pretty printing etc. are now properly
2749 handled within the context via configuration options, instead of
2750 unsynchronized references or print modes. There are both ML Config.T
2751 entities and Isar declaration attributes to access these.
2753 ML (Config.T) Isar (attribute)
2755 eta_contract eta_contract
2756 show_brackets show_brackets
2757 show_sorts show_sorts
2758 show_types show_types
2759 show_question_marks show_question_marks
2760 show_consts show_consts
2761 show_abbrevs show_abbrevs
2763 Syntax.ast_trace syntax_ast_trace
2764 Syntax.ast_stat syntax_ast_stat
2765 Syntax.ambiguity_level syntax_ambiguity_level
2767 Goal_Display.goals_limit goals_limit
2768 Goal_Display.show_main_goal show_main_goal
2770 Method.rule_trace rule_trace
2772 Thy_Output.display thy_output_display
2773 Thy_Output.quotes thy_output_quotes
2774 Thy_Output.indent thy_output_indent
2775 Thy_Output.source thy_output_source
2776 Thy_Output.break thy_output_break
2778 Note that corresponding "..._default" references in ML may only be
2779 changed globally at the ROOT session setup, but *not* within a theory.
2780 The option "show_abbrevs" supersedes the former print mode
2781 "no_abbrevs" with inverted meaning.
2783 * More systematic naming of some configuration options.
2786 trace_simp ~> simp_trace
2787 debug_simp ~> simp_debug
2789 * Support for real valued configuration options, using simplistic
2790 floating-point notation that coincides with the inner syntax for
2793 * Support for real valued preferences (with approximative PGIP type):
2794 front-ends need to accept "pgint" values in float notation.
2797 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
2800 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
2805 * Command 'type_synonym' (with single argument) replaces somewhat
2806 outdated 'types', which is still available as legacy feature for some
2809 * Command 'nonterminal' (with 'and' separated list of arguments)
2810 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
2812 * Command 'notepad' replaces former 'example_proof' for
2813 experimentation in Isar without any result. INCOMPATIBILITY.
2815 * Locale interpretation commands 'interpret' and 'sublocale' accept
2816 lists of equations to map definitions in a locale to appropriate
2817 entities in the context of the interpretation. The 'interpretation'
2818 command already provided this functionality.
2820 * Diagnostic command 'print_dependencies' prints the locale instances
2821 that would be activated if the specified expression was interpreted in
2822 the current context. Variant "print_dependencies!" assumes a context
2823 without interpretations.
2825 * Diagnostic command 'print_interps' prints interpretations in proofs
2826 in addition to interpretations in theories.
2828 * Discontinued obsolete 'global' and 'local' commands to manipulate
2829 the theory name space. Rare INCOMPATIBILITY. The ML functions
2830 Sign.root_path and Sign.local_path may be applied directly where this
2831 feature is still required for historical reasons.
2833 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
2834 'definition' instead.
2836 * The "prems" fact, which refers to the accidental collection of
2837 foundational premises in the context, is now explicitly marked as
2838 legacy feature and will be discontinued soon. Consider using "assms"
2839 of the head statement or reference facts by explicit names.
2841 * Document antiquotations @{class} and @{type} print classes and type
2844 * Document antiquotation @{file} checks file/directory entries within
2845 the local file system.
2850 * Coercive subtyping: functions can be declared as coercions and type
2851 inference will add them as necessary upon input of a term. Theory
2852 Complex_Main declares real :: nat => real and real :: int => real as
2853 coercions. A coercion function f is declared like this:
2855 declare [[coercion f]]
2857 To lift coercions through type constructors (e.g. from nat => real to
2858 nat list => real list), map functions can be declared, e.g.
2860 declare [[coercion_map map]]
2862 Currently coercion inference is activated only in theories including
2863 real numbers, i.e. descendants of Complex_Main. This is controlled by
2864 the configuration option "coercion_enabled", e.g. it can be enabled in
2865 other theories like this:
2867 declare [[coercion_enabled]]
2869 * Command 'partial_function' provides basic support for recursive
2870 function definitions over complete partial orders. Concrete instances
2871 are provided for i) the option type, ii) tail recursion on arbitrary
2872 types, and iii) the heap monad of Imperative_HOL. See
2873 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
2876 * Function package: f.psimps rules are no longer implicitly declared
2877 as [simp]. INCOMPATIBILITY.
2879 * Datatype package: theorems generated for executable equality (class
2880 "eq") carry proper names and are treated as default code equations.
2882 * Inductive package: now offers command 'inductive_simps' to
2883 automatically derive instantiated and simplified equations for
2884 inductive predicates, similar to 'inductive_cases'.
2886 * Command 'enriched_type' allows to register properties of the
2887 functorial structure of types.
2889 * Improved infrastructure for term evaluation using code generator
2890 techniques, in particular static evaluation conversions.
2892 * Code generator: Scala (2.8 or higher) has been added to the target
2895 * Code generator: globbing constant expressions "*" and "Theory.*"
2896 have been replaced by the more idiomatic "_" and "Theory._".
2899 * Code generator: export_code without explicit file declaration prints
2900 to standard output. INCOMPATIBILITY.
2902 * Code generator: do not print function definitions for case
2903 combinators any longer.
2905 * Code generator: simplification with rules determined with
2906 src/Tools/Code/code_simp.ML and method "code_simp".
2908 * Code generator for records: more idiomatic representation of record
2909 types. Warning: records are not covered by ancient SML code
2910 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
2911 rep_datatype declaration helps to succeed then:
2915 rep_datatype foo_ext ...
2917 * Records: logical foundation type for records does not carry a
2918 '_type' suffix any longer (obsolete due to authentic syntax).
2921 * Quickcheck now by default uses exhaustive testing instead of random
2922 testing. Random testing can be invoked by "quickcheck [random]",
2923 exhaustive testing by "quickcheck [exhaustive]".
2925 * Quickcheck instantiates polymorphic types with small finite
2926 datatypes by default. This enables a simple execution mechanism to
2927 handle quantifiers and function equality over the finite datatypes.
2929 * Quickcheck random generator has been renamed from "code" to
2930 "random". INCOMPATIBILITY.
2932 * Quickcheck now has a configurable time limit which is set to 30
2933 seconds by default. This can be changed by adding [timeout = n] to the
2934 quickcheck command. The time limit for Auto Quickcheck is still set
2937 * Quickcheck in locales considers interpretations of that locale for
2938 counter example search.
2941 - Added "smt" and "remote_smt" provers based on the "smt" proof
2942 method. See the Sledgehammer manual for details ("isabelle doc
2945 sledgehammer atp_info ~> sledgehammer running_provers
2946 sledgehammer atp_kill ~> sledgehammer kill_provers
2947 sledgehammer available_atps ~> sledgehammer available_provers
2950 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
2951 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
2952 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
2953 (and "ms" and "min" are no longer supported)
2958 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
2959 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
2961 - Added support for partial quotient types.
2962 - Added local versions of the "Nitpick.register_xxx" functions.
2963 - Added "whack" option.
2964 - Allow registration of quotient types as codatatypes.
2965 - Improved "merge_type_vars" option to merge more types.
2966 - Removed unsound "fast_descrs" option.
2967 - Added custom symmetry breaking for datatypes, making it possible to reach
2968 higher cardinalities.
2969 - Prevent the expansion of too large definitions.
2971 * Proof methods "metis" and "meson" now have configuration options
2972 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
2973 to diagnose these tools. E.g.
2975 using [[metis_trace = true]]
2977 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
2978 manually as command 'solve_direct'.
2980 * The default SMT solver Z3 must be enabled explicitly (due to
2981 licensing issues) by setting the environment variable
2982 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
2983 commercial applications, the SMT solver CVC3 is provided as fall-back;
2984 changing the SMT solver is done via the configuration option
2987 * Remote SMT solvers need to be referred to by the "remote_" prefix,
2988 i.e. "remote_cvc3" and "remote_z3".
2990 * Added basic SMT support for datatypes, records, and typedefs using
2991 the oracle mode (no proofs). Direct support of pairs has been dropped
2992 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
2993 support for a similar behavior). Minor INCOMPATIBILITY.
2995 * Changed SMT configuration options:
2997 z3_proofs ~> smt_oracle (with inverted meaning)
2998 z3_trace_assms ~> smt_trace_used_facts
3011 * Boogie output files (.b2i files) need to be declared in the theory
3014 * Simplification procedure "list_to_set_comprehension" rewrites list
3015 comprehensions applied to List.set to set comprehensions. Occasional
3016 INCOMPATIBILITY, may be deactivated like this:
3018 declare [[simproc del: list_to_set_comprehension]]
3020 * Removed old version of primrec package. INCOMPATIBILITY.
3022 * Removed simplifier congruence rule of "prod_case", as has for long
3023 been the case with "split". INCOMPATIBILITY.
3025 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
3027 * Removed [split_format ... and ... and ...] version of
3028 [split_format]. Potential INCOMPATIBILITY.
3030 * Predicate "sorted" now defined inductively, with nice induction
3031 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
3033 * Constant "contents" renamed to "the_elem", to free the generic name
3034 contents for other uses. INCOMPATIBILITY.
3036 * Renamed class eq and constant eq (for code generation) to class
3037 equal and constant equal, plus renaming of related facts and various
3038 tuning. INCOMPATIBILITY.
3040 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
3042 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
3045 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
3046 avoid confusion with finite sets. INCOMPATIBILITY.
3048 * Abandoned locales equiv, congruent and congruent2 for equivalence
3049 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
3052 * Some previously unqualified names have been qualified:
3059 Trueprop ~> HOL.Trueprop
3064 op --> ~> HOL.implies
3076 Pair ~> Product_Type.Pair
3077 fst ~> Product_Type.fst
3078 snd ~> Product_Type.snd
3079 curry ~> Product_Type.curry
3081 Collect ~> Set.Collect
3085 * More canonical naming convention for some fundamental definitions:
3087 bot_bool_eq ~> bot_bool_def
3088 top_bool_eq ~> top_bool_def
3089 inf_bool_eq ~> inf_bool_def
3090 sup_bool_eq ~> sup_bool_def
3091 bot_fun_eq ~> bot_fun_def
3092 top_fun_eq ~> top_fun_def
3093 inf_fun_eq ~> inf_fun_def
3094 sup_fun_eq ~> sup_fun_def
3098 * More stylized fact names:
3100 expand_fun_eq ~> fun_eq_iff
3101 expand_set_eq ~> set_eq_iff
3103 nat_number ~> eval_nat_numeral
3107 * Refactoring of code-generation specific operations in theory List:
3113 mem_iff ~> member_def
3114 null_empty ~> null_def
3116 INCOMPATIBILITY. Note that these were not supposed to be used
3117 regularly unless for striking reasons; their main purpose was code
3120 Various operations from the Haskell prelude are used for generating
3123 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
3124 "surj f" is now an abbreviation of "range f = UNIV". The theorems
3125 bij_def and surj_def are unchanged. INCOMPATIBILITY.
3127 * Abolished some non-alphabetic type names: "prod" and "sum" replace
3128 "*" and "+" respectively. INCOMPATIBILITY.
3130 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
3131 "Sum_Type.Plus" instead.
3133 * Constant "split" has been merged with constant "prod_case"; names of
3134 ML functions, facts etc. involving split have been retained so far,
3135 though. INCOMPATIBILITY.
3137 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
3138 instead. INCOMPATIBILITY.
3140 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
3143 * Former theory Library/Enum is now part of the HOL-Main image.
3144 INCOMPATIBILITY: all constants of the Enum theory now have to be
3145 referred to by its qualified name.
3148 nlists ~> Enum.nlists
3149 product ~> Enum.product
3151 * Theory Library/Monad_Syntax provides do-syntax for monad types.
3152 Syntax in Library/State_Monad has been changed to avoid ambiguities.
3155 * Theory Library/SetsAndFunctions has been split into
3156 Library/Function_Algebras and Library/Set_Algebras; canonical names
3157 for instance definitions for functions; various improvements.
3160 * Theory Library/Multiset provides stable quicksort implementation of
3163 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
3166 * Session Multivariate_Analysis: introduced a type class for euclidean
3167 space. Most theorems are now stated in terms of euclidean spaces
3168 instead of finite cartesian products.
3171 real ^ 'n ~> 'a::real_vector
3172 ~> 'a::euclidean_space
3173 ~> 'a::ordered_euclidean_space
3174 (depends on your needs)
3178 \<chi> x. _ ~> \<chi>\<chi> x. _
3181 Also note that the indices are now natural numbers and not from some
3182 finite type. Finite cartesian products of euclidean spaces, products
3183 of euclidean spaces the real and complex numbers are instantiated to
3184 be euclidean_spaces. INCOMPATIBILITY.
3186 * Session Probability: introduced pextreal as positive extended real
3187 numbers. Use pextreal as value for measures. Introduce the
3188 Radon-Nikodym derivative, product spaces and Fubini's theorem for
3189 arbitrary sigma finite measures. Introduces Lebesgue measure based on
3190 the integral in Multivariate Analysis. INCOMPATIBILITY.
3192 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
3195 * Session SPARK (with image HOL-SPARK) provides commands to load and
3196 prove verification conditions generated by the SPARK Ada program
3197 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
3202 * Theorems for additive ring operations (locale abelian_monoid and
3203 descendants) are generated by interpretation from their multiplicative
3204 counterparts. Names (in particular theorem names) have the mandatory
3205 qualifier 'add'. Previous theorem names are redeclared for
3208 * Structure "int_ring" is now an abbreviation (previously a
3209 definition). This fits more natural with advanced interpretations.
3214 * The domain package now runs in definitional mode by default: The
3215 former command 'new_domain' is now called 'domain'. To use the domain
3216 package in its original axiomatic mode, use 'domain (unsafe)'.
3219 * The new class "domain" is now the default sort. Class "predomain"
3220 is an unpointed version of "domain". Theories can be updated by
3221 replacing sort annotations as shown below. INCOMPATIBILITY.
3223 'a::type ~> 'a::countable
3224 'a::cpo ~> 'a::predomain
3225 'a::pcpo ~> 'a::domain
3227 * The old type class "rep" has been superseded by class "domain".
3228 Accordingly, users of the definitional package must remove any
3229 "default_sort rep" declarations. INCOMPATIBILITY.
3231 * The domain package (definitional mode) now supports unpointed
3232 predomain argument types, as long as they are marked 'lazy'. (Strict
3233 arguments must be in class "domain".) For example, the following
3234 domain definition now works:
3236 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
3238 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
3239 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
3240 'a option, and 'a list. Additionally, it configures fixrec and the
3241 domain package to work with these types. For example:
3243 fixrec isInl :: "('a + 'b) u -> tr"
3244 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
3246 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
3248 * The "(permissive)" option of fixrec has been replaced with a
3249 per-equation "(unchecked)" option. See
3250 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
3252 * The "bifinite" class no longer fixes a constant "approx"; the class
3253 now just asserts that such a function exists. INCOMPATIBILITY.
3255 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
3256 defines an embedding of type 'a defl into udom by default; instances
3257 of "bifinite" and "domain" classes are available in
3258 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
3260 * The syntax "REP('a)" has been replaced with "DEFL('a)".
3262 * The predicate "directed" has been removed. INCOMPATIBILITY.
3264 * The type class "finite_po" has been removed. INCOMPATIBILITY.
3266 * The function "cprod_map" has been renamed to "prod_map".
3269 * The monadic bind operator on each powerdomain has new binder syntax
3270 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
3271 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
3273 * The infix syntax for binary union on each powerdomain has changed
3274 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
3275 syntax. INCOMPATIBILITY.
3277 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
3278 still supported as an input translation.
3280 * Renamed some theorems (the original names are also still available).
3282 expand_fun_below ~> fun_below_iff
3283 below_fun_ext ~> fun_belowI
3284 expand_cfun_eq ~> cfun_eq_iff
3285 ext_cfun ~> cfun_eqI
3286 expand_cfun_below ~> cfun_below_iff
3287 below_cfun_ext ~> cfun_belowI
3288 cont2cont_Rep_CFun ~> cont2cont_APP
3290 * The Abs and Rep functions for various types have changed names.
3291 Related theorem names have also changed to match. INCOMPATIBILITY.
3293 Rep_CFun ~> Rep_cfun
3294 Abs_CFun ~> Abs_cfun
3295 Rep_Sprod ~> Rep_sprod
3296 Abs_Sprod ~> Abs_sprod
3297 Rep_Ssum ~> Rep_ssum
3298 Abs_Ssum ~> Abs_ssum
3300 * Lemmas with names of the form *_defined_iff or *_strict_iff have
3301 been renamed to *_bottom_iff. INCOMPATIBILITY.
3303 * Various changes to bisimulation/coinduction with domain package:
3305 - Definitions of "bisim" constants no longer mention definedness.
3306 - With mutual recursion, "bisim" predicate is now curried.
3307 - With mutual recursion, each type gets a separate coind theorem.
3308 - Variable names in bisim_def and coinduct rules have changed.
3312 * Case combinators generated by the domain package for type "foo" are
3313 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
3315 * Several theorems have been renamed to more accurately reflect the
3316 names of constants and types involved. INCOMPATIBILITY.
3318 thelub_const ~> lub_const
3319 lub_const ~> is_lub_const
3321 is_lub_lub ~> is_lubD2
3323 unique_lub ~> is_lub_unique
3324 is_ub_lub ~> is_lub_rangeD1
3325 lub_bin_chain ~> is_lub_bin_chain
3326 lub_fun ~> is_lub_fun
3327 thelub_fun ~> lub_fun
3328 thelub_cfun ~> lub_cfun
3329 thelub_Pair ~> lub_Pair
3330 lub_cprod ~> is_lub_prod
3331 thelub_cprod ~> lub_prod
3332 minimal_cprod ~> minimal_prod
3333 inst_cprod_pcpo ~> inst_prod_pcpo
3335 compact_UU ~> compact_bottom
3336 deflation_UU ~> deflation_bottom
3337 finite_deflation_UU ~> finite_deflation_bottom
3339 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
3341 sq_ord_less_eq_trans ~> below_eq_trans
3342 sq_ord_eq_less_trans ~> eq_below_trans
3343 refl_less ~> below_refl
3344 trans_less ~> below_trans
3345 antisym_less ~> below_antisym
3346 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
3347 box_less ~> box_below
3348 rev_trans_less ~> rev_below_trans
3349 not_less2not_eq ~> not_below2not_eq
3350 less_UU_iff ~> below_UU_iff
3351 flat_less_iff ~> flat_below_iff
3352 adm_less ~> adm_below
3353 adm_not_less ~> adm_not_below
3354 adm_compact_not_less ~> adm_compact_not_below
3355 less_fun_def ~> below_fun_def
3356 expand_fun_less ~> fun_below_iff
3357 less_fun_ext ~> fun_belowI
3358 less_discr_def ~> below_discr_def
3359 discr_less_eq ~> discr_below_eq
3360 less_unit_def ~> below_unit_def
3361 less_cprod_def ~> below_prod_def
3362 prod_lessI ~> prod_belowI
3363 Pair_less_iff ~> Pair_below_iff
3364 fst_less_iff ~> fst_below_iff
3365 snd_less_iff ~> snd_below_iff
3366 expand_cfun_less ~> cfun_below_iff
3367 less_cfun_ext ~> cfun_belowI
3368 injection_less ~> injection_below
3369 less_up_def ~> below_up_def
3370 not_Iup_less ~> not_Iup_below
3371 Iup_less ~> Iup_below
3373 Def_inject_less_eq ~> Def_below_Def
3374 Def_less_is_eq ~> Def_below_iff
3375 spair_less_iff ~> spair_below_iff
3376 less_sprod ~> below_sprod
3377 spair_less ~> spair_below
3378 sfst_less_iff ~> sfst_below_iff
3379 ssnd_less_iff ~> ssnd_below_iff
3380 fix_least_less ~> fix_least_below
3381 dist_less_one ~> dist_below_one
3382 less_ONE ~> below_ONE
3383 ONE_less_iff ~> ONE_below_iff
3384 less_sinlD ~> below_sinlD
3385 less_sinrD ~> below_sinrD
3390 * All constant names are now qualified internally and use proper
3391 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
3396 * Antiquotation @{assert} inlines a function bool -> unit that raises
3397 Fail if the argument is false. Due to inlining the source position of
3398 failed assertions is included in the error output.
3400 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
3401 text is in practice always evaluated with a stable theory checkpoint.
3402 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
3404 * Antiquotation @{theory A} refers to theory A from the ancestry of
3405 the current context, not any accidental theory loader state as before.
3406 Potential INCOMPATIBILITY, subtle change in semantics.
3408 * Syntax.pretty_priority (default 0) configures the required priority
3409 of pretty-printed output and thus affects insertion of parentheses.
3411 * Syntax.default_root (default "any") configures the inner syntax
3412 category (nonterminal symbol) for parsing of terms.
3414 * Former exception Library.UnequalLengths now coincides with
3415 ListPair.UnequalLengths.
3417 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
3418 main functionality is provided by structure Simplifier.
3420 * Renamed raw "explode" function to "raw_explode" to emphasize its
3421 meaning. Note that internally to Isabelle, Symbol.explode is used in
3422 almost all situations.
3424 * Discontinued obsolete function sys_error and exception SYS_ERROR.
3425 See implementation manual for further details on exceptions in
3428 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
3431 * Renamed structure PureThy to Pure_Thy and moved most of its
3432 operations to structure Global_Theory, to emphasize that this is
3433 rarely-used global-only stuff.
3435 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
3436 instead (or tracing for high-volume output).
3438 * Configuration option show_question_marks only affects regular pretty
3439 printing of types and terms, not raw Term.string_of_vname.
3441 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
3442 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
3443 @{thms} for most purposes.
3445 * ML structure Unsynchronized is never opened, not even in Isar
3446 interaction mode as before. Old Unsynchronized.set etc. have been
3447 discontinued -- use plain := instead. This should be *rare* anyway,
3448 since modern tools always work via official context data, notably
3449 configuration options.
3451 * Parallel and asynchronous execution requires special care concerning
3452 interrupts. Structure Exn provides some convenience functions that
3453 avoid working directly with raw Interrupt. User code must not absorb
3454 interrupts -- intermediate handling (for cleanup etc.) needs to be
3455 followed by re-raising of the original exception. Another common
3456 source of mistakes are "handle _" patterns, which make the meaning of
3457 the program subject to physical effects of the environment.
3461 New in Isabelle2009-2 (June 2010)
3462 ---------------------------------
3466 * Authentic syntax for *all* logical entities (type classes, type
3467 constructors, term constants): provides simple and robust
3468 correspondence between formal entities and concrete syntax. Within
3469 the parse tree / AST representations, "constants" are decorated by
3470 their category (class, type, const) and spelled out explicitly with
3471 their full internal name.
3473 Substantial INCOMPATIBILITY concerning low-level syntax declarations
3474 and translations (translation rules and translation functions in ML).
3475 Some hints on upgrading:
3477 - Many existing uses of 'syntax' and 'translations' can be replaced
3478 by more modern 'type_notation', 'notation' and 'abbreviation',
3479 which are independent of this issue.
3481 - 'translations' require markup within the AST; the term syntax
3482 provides the following special forms:
3484 CONST c -- produces syntax version of constant c from context
3485 XCONST c -- literally c, checked as constant from context
3486 c -- literally c, if declared by 'syntax'
3488 Plain identifiers are treated as AST variables -- occasionally the
3489 system indicates accidental variables via the error "rhs contains
3492 Type classes and type constructors are marked according to their
3493 concrete syntax. Some old translations rules need to be written
3494 for the "type" category, using type constructor application
3495 instead of pseudo-term application of the default category
3498 - 'parse_translation' etc. in ML may use the following
3501 @{class_syntax c} -- type class c within parse tree / AST
3502 @{term_syntax c} -- type constructor c within parse tree / AST
3503 @{const_syntax c} -- ML version of "CONST c" above
3504 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
3506 - Literal types within 'typed_print_translations', i.e. those *not*
3507 represented as pseudo-terms are represented verbatim. Use @{class
3508 c} or @{type_name c} here instead of the above syntax
3511 Note that old non-authentic syntax was based on unqualified base
3512 names, so all of the above "constant" names would coincide. Recall
3513 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
3514 diagnose syntax problems.
3516 * Type constructors admit general mixfix syntax, not just infix.
3518 * Concrete syntax may be attached to local entities without a proof
3519 body, too. This works via regular mixfix annotations for 'fix',
3520 'def', 'obtain' etc. or via the explicit 'write' command, which is
3521 similar to the 'notation' command in theory specifications.
3523 * Discontinued unnamed infix syntax (legacy feature for many years) --
3524 need to specify constant name and syntax separately. Internal ML
3525 datatype constructors have been renamed from InfixName to Infix etc.
3526 Minor INCOMPATIBILITY.
3528 * Schematic theorem statements need to be explicitly markup as such,
3529 via commands 'schematic_lemma', 'schematic_theorem',
3530 'schematic_corollary'. Thus the relevance of the proof is made
3531 syntactically clear, which impacts performance in a parallel or
3532 asynchronous interactive environment. Minor INCOMPATIBILITY.
3534 * Use of cumulative prems via "!" in some proof methods has been
3535 discontinued (old legacy feature).
3537 * References 'trace_simp' and 'debug_simp' have been replaced by
3538 configuration options stored in the context. Enabling tracing (the
3539 case of debugging is similar) in proofs works via
3541 using [[trace_simp = true]]
3543 Tracing is then active for all invocations of the simplifier in
3544 subsequent goal refinement steps. Tracing may also still be enabled or
3545 disabled via the ProofGeneral settings menu.
3547 * Separate commands 'hide_class', 'hide_type', 'hide_const',
3548 'hide_fact' replace the former 'hide' KIND command. Minor
3551 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
3552 more efficient than combinations with -q1 or -q2.
3557 * Proofterms record type-class reasoning explicitly, using the
3558 "unconstrain" operation internally. This eliminates all sort
3559 constraints from a theorem and proof, introducing explicit
3560 OFCLASS-premises. On the proof term level, this operation is
3561 automatically applied at theorem boundaries, such that closed proofs
3562 are always free of sort constraints. INCOMPATIBILITY for tools that
3563 inspect proof terms.
3565 * Local theory specifications may depend on extra type variables that
3566 are not present in the result type -- arguments TYPE('a) :: 'a itself
3567 are added internally. For example:
3569 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
3571 * Predicates of locales introduced by classes carry a mandatory
3572 "class" prefix. INCOMPATIBILITY.
3574 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
3576 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
3579 * Command 'code_reflect' allows to incorporate generated ML code into
3580 runtime environment; replaces immature code_datatype antiquotation.
3583 * Code generator: simple concept for abstract datatypes obeying
3586 * Code generator: details of internal data cache have no impact on the
3587 user space functionality any longer.
3589 * Methods "unfold_locales" and "intro_locales" ignore non-locale
3590 subgoals. This is more appropriate for interpretations with 'where'.
3593 * Command 'example_proof' opens an empty proof body. This allows to
3594 experiment with Isar, without producing any persistent result.
3596 * Commands 'type_notation' and 'no_type_notation' declare type syntax
3597 within a local theory context, with explicit checking of the
3598 constructors involved (in contrast to the raw 'syntax' versions).
3600 * Commands 'types' and 'typedecl' now work within a local theory
3601 context -- without introducing dependencies on parameters or
3602 assumptions, which is not possible in Isabelle/Pure.
3604 * Command 'defaultsort' has been renamed to 'default_sort', it works
3605 within a local theory context. Minor INCOMPATIBILITY.
3610 * Command 'typedef' now works within a local theory context -- without
3611 introducing dependencies on parameters or assumptions, which is not
3612 possible in Isabelle/Pure/HOL. Note that the logical environment may
3613 contain multiple interpretations of local typedefs (with different
3614 non-emptiness proofs), even in a global theory context.
3616 * New package for quotient types. Commands 'quotient_type' and
3617 'quotient_definition' may be used for defining types and constants by
3618 quotient constructions. An example is the type of integers created by
3619 quotienting pairs of natural numbers:
3622 intrel :: "(nat * nat) => (nat * nat) => bool"
3624 "intrel (x, y) (u, v) = (x + v = u + y)"
3626 quotient_type int = "nat * nat" / intrel
3627 by (auto simp add: equivp_def expand_fun_eq)
3630 "0::int" is "(0::nat, 0::nat)"
3632 The method "lifting" can be used to lift of theorems from the
3633 underlying "raw" type to the quotient type. The example
3634 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
3635 construction and provides a reasoning infrastructure for finite sets.
3637 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
3638 clash with new theory Quotient in Main HOL.
3640 * Moved the SMT binding into the main HOL session, eliminating
3641 separate HOL-SMT session.
3643 * List membership infix mem operation is only an input abbreviation.
3646 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
3647 for future developements; former Library/Word.thy is still present in
3648 the AFP entry RSAPPS.
3650 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
3651 longer shadowed. INCOMPATIBILITY.
3653 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
3656 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
3659 * Dropped normalizing_semiring etc; use the facts in semiring classes
3660 instead. INCOMPATIBILITY.
3662 * Dropped several real-specific versions of lemmas about floor and
3663 ceiling; use the generic lemmas from theory "Archimedean_Field"
3664 instead. INCOMPATIBILITY.
3666 floor_number_of_eq ~> floor_number_of
3667 le_floor_eq_number_of ~> number_of_le_floor
3668 le_floor_eq_zero ~> zero_le_floor
3669 le_floor_eq_one ~> one_le_floor
3670 floor_less_eq_number_of ~> floor_less_number_of
3671 floor_less_eq_zero ~> floor_less_zero
3672 floor_less_eq_one ~> floor_less_one
3673 less_floor_eq_number_of ~> number_of_less_floor
3674 less_floor_eq_zero ~> zero_less_floor
3675 less_floor_eq_one ~> one_less_floor
3676 floor_le_eq_number_of ~> floor_le_number_of
3677 floor_le_eq_zero ~> floor_le_zero
3678 floor_le_eq_one ~> floor_le_one
3679 floor_subtract_number_of ~> floor_diff_number_of
3680 floor_subtract_one ~> floor_diff_one
3681 ceiling_number_of_eq ~> ceiling_number_of
3682 ceiling_le_eq_number_of ~> ceiling_le_number_of
3683 ceiling_le_zero_eq ~> ceiling_le_zero
3684 ceiling_le_eq_one ~> ceiling_le_one
3685 less_ceiling_eq_number_of ~> number_of_less_ceiling
3686 less_ceiling_eq_zero ~> zero_less_ceiling
3687 less_ceiling_eq_one ~> one_less_ceiling
3688 ceiling_less_eq_number_of ~> ceiling_less_number_of
3689 ceiling_less_eq_zero ~> ceiling_less_zero
3690 ceiling_less_eq_one ~> ceiling_less_one
3691 le_ceiling_eq_number_of ~> number_of_le_ceiling
3692 le_ceiling_eq_zero ~> zero_le_ceiling
3693 le_ceiling_eq_one ~> one_le_ceiling
3694 ceiling_subtract_number_of ~> ceiling_diff_number_of
3695 ceiling_subtract_one ~> ceiling_diff_one
3697 * Theory "Finite_Set": various folding_XXX locales facilitate the
3698 application of the various fold combinators on finite sets.
3700 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
3701 provides abstract red-black tree type which is backed by "RBT_Impl" as
3702 implementation. INCOMPATIBILTY.
3704 * Theory Library/Coinductive_List has been removed -- superseded by
3705 AFP/thys/Coinductive.
3707 * Theory PReal, including the type "preal" and related operations, has
3708 been removed. INCOMPATIBILITY.
3710 * Real: new development using Cauchy Sequences.
3712 * Split off theory "Big_Operators" containing setsum, setprod,
3713 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
3715 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
3716 "Int" etc. INCOMPATIBILITY.
3718 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
3720 * New set of rules "ac_simps" provides combined assoc / commute
3721 rewrites for all interpretations of the appropriate generic locales.
3723 * Renamed theory "OrderedGroup" to "Groups" and split theory
3724 "Ring_and_Field" into theories "Rings" and "Fields"; for more
3725 appropriate and more consistent names suitable for name prefixes
3726 within the HOL theories. INCOMPATIBILITY.
3728 * Some generic constants have been put to appropriate theories:
3729 - less_eq, less: Orderings
3730 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
3731 - inverse, divide: Rings
3734 * More consistent naming of type classes involving orderings (and
3737 lower_semilattice ~> semilattice_inf
3738 upper_semilattice ~> semilattice_sup
3740 dense_linear_order ~> dense_linorder
3742 pordered_ab_group_add ~> ordered_ab_group_add
3743 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
3744 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
3745 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
3746 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
3747 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
3748 pordered_cancel_semiring ~> ordered_cancel_semiring
3749 pordered_comm_monoid_add ~> ordered_comm_monoid_add
3750 pordered_comm_ring ~> ordered_comm_ring
3751 pordered_comm_semiring ~> ordered_comm_semiring
3752 pordered_ring ~> ordered_ring
3753 pordered_ring_abs ~> ordered_ring_abs
3754 pordered_semiring ~> ordered_semiring
3756 ordered_ab_group_add ~> linordered_ab_group_add
3757 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
3758 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
3759 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
3760 ordered_field ~> linordered_field
3761 ordered_field_no_lb ~> linordered_field_no_lb
3762 ordered_field_no_ub ~> linordered_field_no_ub
3763 ordered_field_dense_linear_order ~> dense_linordered_field
3764 ordered_idom ~> linordered_idom
3765 ordered_ring ~> linordered_ring
3766 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
3767 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
3768 ordered_ring_strict ~> linordered_ring_strict
3769 ordered_semidom ~> linordered_semidom
3770 ordered_semiring ~> linordered_semiring
3771 ordered_semiring_1 ~> linordered_semiring_1
3772 ordered_semiring_1_strict ~> linordered_semiring_1_strict
3773 ordered_semiring_strict ~> linordered_semiring_strict
3775 The following slightly odd type classes have been moved to a
3776 separate theory Library/Lattice_Algebras:
3778 lordered_ab_group_add ~> lattice_ab_group_add
3779 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
3780 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
3781 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
3782 lordered_ring ~> lattice_ring
3786 * Refined field classes:
3787 - classes division_ring_inverse_zero, field_inverse_zero,
3788 linordered_field_inverse_zero include rule inverse 0 = 0 --
3789 subsumes former division_by_zero class;
3790 - numerous lemmas have been ported from field to division_ring.
3793 * Refined algebra theorem collections:
3794 - dropped theorem group group_simps, use algebra_simps instead;
3795 - dropped theorem group ring_simps, use field_simps instead;
3796 - proper theorem collection field_simps subsumes former theorem
3797 groups field_eq_simps and field_simps;
3798 - dropped lemma eq_minus_self_iff which is a duplicate for
3802 * Theory Finite_Set and List: some lemmas have been generalized from
3805 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
3806 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
3807 inter_Inter_fold_inter ~> inf_Inf_fold_inf
3808 union_Union_fold_union ~> sup_Sup_fold_sup
3809 Inter_fold_inter ~> Inf_fold_inf
3810 Union_fold_union ~> Sup_fold_sup
3811 inter_INTER_fold_inter ~> inf_INFI_fold_inf
3812 union_UNION_fold_union ~> sup_SUPR_fold_sup
3813 INTER_fold_inter ~> INFI_fold_inf
3814 UNION_fold_union ~> SUPR_fold_sup
3816 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
3817 replaced by the more convenient lemmas Inf_empty and Sup_empty.
3818 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
3819 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
3820 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
3821 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
3823 * Reorganized theory Multiset: swapped notation of pointwise and
3826 - pointwise ordering is instance of class order with standard syntax
3828 - multiset ordering has syntax <=# and <#; partial order properties
3829 are provided by means of interpretation with prefix
3831 - less duplication, less historical organization of sections,
3832 conversion from associations lists to multisets, rudimentary code
3834 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
3839 multiset_eq_conv_count_eq ~> multiset_ext_iff
3840 multi_count_ext ~> multiset_ext
3841 diff_union_inverse2 ~> diff_union_cancelR
3845 * Theory Permutation: replaced local "remove" by List.remove1.
3847 * Code generation: ML and OCaml code is decorated with signatures.
3849 * Theory List: added transpose.
3851 * Library/Nat_Bijection.thy is a collection of bijective functions
3852 between nat and other types, which supersedes the older libraries
3853 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
3856 Nat_Int_Bij.nat2_to_nat ~> prod_encode
3857 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
3858 Nat_Int_Bij.int_to_nat_bij ~> int_encode
3859 Nat_Int_Bij.nat_to_int_bij ~> int_decode
3860 Countable.pair_encode ~> prod_encode
3861 NatIso.prod2nat ~> prod_encode
3862 NatIso.nat2prod ~> prod_decode
3863 NatIso.sum2nat ~> sum_encode
3864 NatIso.nat2sum ~> sum_decode
3865 NatIso.list2nat ~> list_encode
3866 NatIso.nat2list ~> list_decode
3867 NatIso.set2nat ~> set_encode
3868 NatIso.nat2set ~> set_decode
3871 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
3872 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
3873 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
3874 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
3875 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
3876 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
3877 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
3878 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
3879 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
3880 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
3881 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
3882 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
3883 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
3886 - Renamed ATP commands:
3887 atp_info ~> sledgehammer running_atps
3888 atp_kill ~> sledgehammer kill_atps
3889 atp_messages ~> sledgehammer messages
3890 atp_minimize ~> sledgehammer minimize
3891 print_atps ~> sledgehammer available_atps
3893 - Added user's manual ("isabelle doc sledgehammer").
3894 - Added option syntax and "sledgehammer_params" to customize
3895 Sledgehammer's behavior. See the manual for details.
3896 - Modified the Isar proof reconstruction code so that it produces
3897 direct proofs rather than proofs by contradiction. (This feature
3898 is still experimental.)
3899 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
3901 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
3904 - Added and implemented "binary_ints" and "bits" options.
3905 - Added "std" option and implemented support for nonstandard models.
3906 - Added and implemented "finitize" option to improve the precision
3907 of infinite datatypes based on a monotonicity analysis.
3908 - Added support for quotient types.
3909 - Added support for "specification" and "ax_specification"
3911 - Added support for local definitions (for "function" and
3912 "termination" proofs).
3913 - Added support for term postprocessors.
3914 - Optimized "Multiset.multiset" and "FinFun.finfun".
3915 - Improved efficiency of "destroy_constrs" optimization.
3916 - Fixed soundness bugs related to "destroy_constrs" optimization and
3918 - Fixed soundness bug related to higher-order constructors.
3919 - Fixed soundness bug when "full_descrs" is enabled.
3920 - Improved precision of set constructs.
3921 - Added "atoms" option.
3922 - Added cache to speed up repeated Kodkod invocations on the same
3924 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
3925 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
3926 "SAT4J_Light". INCOMPATIBILITY.
3927 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
3928 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
3929 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
3931 * Method "induct" now takes instantiations of the form t, where t is not
3932 a variable, as a shorthand for "x == t", where x is a fresh variable.
3933 If this is not intended, t has to be enclosed in parentheses.
3934 By default, the equalities generated by definitional instantiations
3935 are pre-simplified, which may cause parameters of inductive cases
3936 to disappear, or may even delete some of the inductive cases.
3937 Use "induct (no_simp)" instead of "induct" to restore the old
3938 behaviour. The (no_simp) option is also understood by the "cases"
3939 and "nominal_induct" methods, which now perform pre-simplification, too.
3945 * Variable names in lemmas generated by the domain package have
3946 changed; the naming scheme is now consistent with the HOL datatype
3947 package. Some proof scripts may be affected, INCOMPATIBILITY.
3949 * The domain package no longer defines the function "foo_copy" for
3950 recursive domain "foo". The reach lemma is now stated directly in
3951 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
3952 be reformulated in terms of "foo_take", INCOMPATIBILITY.
3954 * Most definedness lemmas generated by the domain package (previously
3955 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
3956 like "foo$x = UU <-> x = UU", which works better as a simp rule.
3957 Proofs that used definedness lemmas as intro rules may break,
3958 potential INCOMPATIBILITY.
3960 * Induction and casedist rules generated by the domain package now
3961 declare proper case_names (one called "bottom", and one named for each
3962 constructor). INCOMPATIBILITY.
3964 * For mutually-recursive domains, separate "reach" and "take_lemma"
3965 rules are generated for each domain, INCOMPATIBILITY.
3967 foo_bar.reach ~> foo.reach bar.reach
3968 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
3970 * Some lemmas generated by the domain package have been renamed for
3971 consistency with the datatype package, INCOMPATIBILITY.
3973 foo.ind ~> foo.induct
3974 foo.finite_ind ~> foo.finite_induct
3975 foo.coind ~> foo.coinduct
3976 foo.casedist ~> foo.exhaust
3977 foo.exhaust ~> foo.nchotomy
3979 * For consistency with other definition packages, the fixrec package
3980 now generates qualified theorem names, INCOMPATIBILITY.
3982 foo_simps ~> foo.simps
3983 foo_unfold ~> foo.unfold
3984 foo_induct ~> foo.induct
3986 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
3987 method and internal fixrec proofs now use the default simpset instead.
3990 * The "contlub" predicate has been removed. Proof scripts should use
3991 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
3993 * The "admw" predicate has been removed, INCOMPATIBILITY.
3995 * The constants cpair, cfst, and csnd have been removed in favor of
3996 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
4001 * Antiquotations for basic formal entities:
4003 @{class NAME} -- type class
4004 @{class_syntax NAME} -- syntax representation of the above
4006 @{type_name NAME} -- logical type
4007 @{type_abbrev NAME} -- type abbreviation
4008 @{nonterminal NAME} -- type of concrete syntactic category
4009 @{type_syntax NAME} -- syntax representation of any of the above
4011 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
4012 @{const_abbrev NAME} -- abbreviated constant
4013 @{const_syntax NAME} -- syntax representation of any of the above
4015 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
4016 syntax constant (cf. 'syntax' command).
4018 * Antiquotation @{make_string} inlines a function to print arbitrary
4019 values similar to the ML toplevel. The result is compiler dependent
4020 and may fall back on "?" in certain situations.
4022 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
4023 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
4024 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
4025 not work with the asynchronous Isar document model.
4027 * Configuration options now admit dynamic default values, depending on
4028 the context or even global references.
4030 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
4031 uses an efficient external library if available (for Poly/ML).
4033 * Renamed some important ML structures, while keeping the old names
4034 for some time as aliases within the structure Legacy:
4036 OuterKeyword ~> Keyword
4039 OuterSyntax ~> Outer_Syntax
4040 PrintMode ~> Print_Mode
4041 SpecParse ~> Parse_Spec
4044 ThyOutput ~> Thy_Output
4045 TypeInfer ~> Type_Infer
4047 Note that "open Legacy" simplifies porting of sources, but forgetting
4048 to remove it again will complicate porting again in the future.
4050 * Most operations that refer to a global context are named
4051 accordingly, e.g. Simplifier.global_context or
4052 ProofContext.init_global. There are some situations where a global
4053 context actually works, but under normal circumstances one needs to
4054 pass the proper local context through the code!
4056 * Discontinued old TheoryDataFun with its copy/init operation -- data
4057 needs to be pure. Functor Theory_Data_PP retains the traditional
4058 Pretty.pp argument to merge, which is absent in the standard
4059 Theory_Data version.
4061 * Sorts.certify_sort and derived "cert" operations for types and terms
4062 no longer minimize sorts. Thus certification at the boundary of the
4063 inference kernel becomes invariant under addition of class relations,
4064 which is an important monotonicity principle. Sorts are now minimized
4065 in the syntax layer only, at the boundary between the end-user and the
4066 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
4067 explicitly in rare situations.
4069 * Renamed old-style Drule.standard to Drule.export_without_context, to
4070 emphasize that this is in no way a standard operation.
4073 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
4074 usual for resolution. Rare INCOMPATIBILITY.
4076 * Renamed varify/unvarify operations to varify_global/unvarify_global
4077 to emphasize that these only work in a global situation (which is
4080 * Curried take and drop in library.ML; negative length is interpreted
4081 as infinity (as in chop). Subtle INCOMPATIBILITY.
4083 * Proof terms: type substitutions on proof constants now use canonical
4084 order of type variables. INCOMPATIBILITY for tools working with proof
4087 * Raw axioms/defs may no longer carry sort constraints, and raw defs
4088 may no longer carry premises. User-level specifications are
4089 transformed accordingly by Thm.add_axiom/add_def.
4094 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
4095 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
4096 proof terms are enabled unconditionally in the new HOL-Proofs image.
4098 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
4099 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
4102 * Old lib/scripts/polyml-platform is superseded by the
4103 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
4104 variant, even on a 64 bit machine. The following example setting
4105 prefers 64 bit if available:
4107 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
4109 * The preliminary Isabelle/jEdit application demonstrates the emerging
4110 Isabelle/Scala layer for advanced prover interaction and integration.
4111 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
4114 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
4115 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
4116 similar to the default assignment of the document preparation system
4117 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
4118 provides some operations for direct access to the font without asking
4119 the user for manual installation.
4123 New in Isabelle2009-1 (December 2009)
4124 -------------------------------------
4128 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
4129 one backslash should be used, even in ML sources.
4134 * Locale interpretation propagates mixins along the locale hierarchy.
4135 The currently only available mixins are the equations used to map
4136 local definitions to terms of the target domain of an interpretation.
4138 * Reactivated diagnostic command 'print_interps'. Use "print_interps
4139 loc" to print all interpretations of locale "loc" in the theory.
4140 Interpretations in proofs are not shown.
4142 * Thoroughly revised locales tutorial. New section on conditional
4145 * On instantiation of classes, remaining undefined class parameters
4146 are formally declared. INCOMPATIBILITY.
4149 *** Document preparation ***
4151 * New generalized style concept for printing terms: @{foo (style) ...}
4152 instead of @{foo_style style ...} (old form is still retained for
4153 backward compatibility). Styles can be also applied for
4154 antiquotations prop, term_type and typeof.
4159 * New proof method "smt" for a combination of first-order logic with
4160 equality, linear and nonlinear (natural/integer/real) arithmetic, and
4161 fixed-size bitvectors; there is also basic support for higher-order
4162 features (esp. lambda abstractions). It is an incomplete decision
4163 procedure based on external SMT solvers using the oracle mechanism;
4164 for the SMT solver Z3, this method is proof-producing. Certificates
4165 are provided to avoid calling the external solvers solely for
4166 re-checking proofs. Due to a remote SMT service there is no need for
4167 installing SMT solvers locally. See src/HOL/SMT.
4169 * New commands to load and prove verification conditions generated by
4170 the Boogie program verifier or derived systems (e.g. the Verifying C
4171 Compiler (VCC) or Spec#). See src/HOL/Boogie.
4173 * New counterexample generator tool 'nitpick' based on the Kodkod
4174 relational model finder. See src/HOL/Tools/Nitpick and
4175 src/HOL/Nitpick_Examples.
4177 * New commands 'code_pred' and 'values' to invoke the predicate
4178 compiler and to enumerate values of inductive predicates.
4180 * A tabled implementation of the reflexive transitive closure.
4182 * New implementation of quickcheck uses generic code generator;
4183 default generators are provided for all suitable HOL types, records
4184 and datatypes. Old quickcheck can be re-activated importing theory
4185 Library/SML_Quickcheck.
4187 * New testing tool Mirabelle for automated proof tools. Applies
4188 several tools and tactics like sledgehammer, metis, or quickcheck, to
4189 every proof step in a theory. To be used in batch mode via the
4190 "mirabelle" utility.
4192 * New proof method "sos" (sum of squares) for nonlinear real
4193 arithmetic (originally due to John Harison). It requires theory
4194 Library/Sum_Of_Squares. It is not a complete decision procedure but
4195 works well in practice on quantifier-free real arithmetic with +, -,
4196 *, ^, =, <= and <, i.e. boolean combinations of equalities and
4197 inequalities between polynomials. It makes use of external
4198 semidefinite programming solvers. Method "sos" generates a
4199 certificate that can be pasted into the proof thus avoiding the need
4200 to call an external tool every time the proof is checked. See
4201 src/HOL/Library/Sum_Of_Squares.
4203 * New method "linarith" invokes existing linear arithmetic decision
4206 * New command 'atp_minimal' reduces result produced by Sledgehammer.
4208 * New Sledgehammer option "Full Types" in Proof General settings menu.
4209 Causes full type information to be output to the ATPs. This slows
4210 ATPs down considerably but eliminates a source of unsound "proofs"
4213 * New method "metisFT": A version of metis that uses full type
4214 information in order to avoid failures of proof reconstruction.
4216 * New evaluator "approximate" approximates an real valued term using
4217 the same method as the approximation method.
4219 * Method "approximate" now supports arithmetic expressions as
4220 boundaries of intervals and implements interval splitting and Taylor
4223 * ML antiquotation @{code_datatype} inserts definition of a datatype
4224 generated by the code generator; e.g. see src/HOL/Predicate.thy.
4226 * New theory SupInf of the supremum and infimum operators for sets of
4229 * New theory Probability, which contains a development of measure
4230 theory, eventually leading to Lebesgue integration and probability.
4232 * Extended Multivariate Analysis to include derivation and Brouwer's
4235 * Reorganization of number theory, INCOMPATIBILITY:
4236 - new number theory development for nat and int, in theories Divides
4237 and GCD as well as in new session Number_Theory
4238 - some constants and facts now suffixed with _nat and _int
4240 - former session NumberTheory now named Old_Number_Theory, including
4241 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
4242 - moved theory Pocklington from src/HOL/Library to
4243 src/HOL/Old_Number_Theory
4245 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
4246 lcm of finite and infinite sets. It is shown that they form a complete
4249 * Class semiring_div requires superclass no_zero_divisors and proof of
4250 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
4251 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
4252 generalized to class semiring_div, subsuming former theorems
4253 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
4254 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
4257 * Refinements to lattice classes and sets:
4258 - less default intro/elim rules in locale variant, more default
4259 intro/elim rules in class variant: more uniformity
4260 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
4262 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
4264 - renamed ACI to inf_sup_aci
4265 - new class "boolean_algebra"
4266 - class "complete_lattice" moved to separate theory
4267 "Complete_Lattice"; corresponding constants (and abbreviations)
4268 renamed and with authentic syntax:
4269 Set.Inf ~> Complete_Lattice.Inf
4270 Set.Sup ~> Complete_Lattice.Sup
4271 Set.INFI ~> Complete_Lattice.INFI
4272 Set.SUPR ~> Complete_Lattice.SUPR
4273 Set.Inter ~> Complete_Lattice.Inter
4274 Set.Union ~> Complete_Lattice.Union
4275 Set.INTER ~> Complete_Lattice.INTER
4276 Set.UNION ~> Complete_Lattice.UNION
4277 - authentic syntax for
4280 - mere abbreviations:
4283 Set.inter (for inf, formerly Set.Int)
4284 Set.union (for sup, formerly Set.Un)
4285 Complete_Lattice.Inter (for Inf)
4286 Complete_Lattice.Union (for Sup)
4287 Complete_Lattice.INTER (for INFI)
4288 Complete_Lattice.UNION (for SUPR)
4289 - object-logic definitions as far as appropriate
4291 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
4292 Un_subset_iff are explicitly deleted as default simp rules; then also
4293 their lattice counterparts le_inf_iff and le_sup_iff have to be
4294 deleted to achieve the desired effect.
4296 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
4297 rules by default any longer; the same applies to min_max.inf_absorb1
4298 etc. INCOMPATIBILITY.
4300 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
4301 pred_set_conv by default. INCOMPATIBILITY.
4303 * Power operations on relations and functions are now one dedicated
4304 constant "compow" with infix syntax "^^". Power operation on
4305 multiplicative monoids retains syntax "^" and is now defined generic
4306 in class power. INCOMPATIBILITY.
4308 * Relation composition "R O S" now has a more standard argument order:
4309 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
4310 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
4311 break, since the O_assoc rule was not rewritten like this. Fix using
4312 O_assoc[symmetric]. The same applies to the curried version "R OO S".
4314 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
4315 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
4318 * Most rules produced by inductive and datatype package have mandatory
4319 prefixes. INCOMPATIBILITY.
4321 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
4322 the attribute of the same name. Each of the theorems in the list
4323 DERIV_intros assumes composition with an additional function and
4324 matches a variable to the derivative, which has to be solved by the
4325 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
4326 of most elementary terms. Former Maclauren.DERIV_tac and
4327 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
4330 * Code generator attributes follow the usual underscore convention:
4331 code_unfold replaces code unfold
4332 code_post replaces code post
4337 sizechange -> size_change
4338 induct_scheme -> induction_schema
4341 * Discontinued abbreviation "arbitrary" of constant "undefined".
4342 INCOMPATIBILITY, use "undefined" directly.
4345 Suc_eq_add_numeral_1 -> Suc_eq_plus1
4346 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
4347 Suc_plus1 -> Suc_eq_plus1
4348 *anti_sym -> *antisym*
4349 vector_less_eq_def -> vector_le_def
4352 * Added theorem List.map_map as [simp]. Removed List.map_compose.
4355 * Removed predicate "M hassize n" (<--> card M = n & finite M).
4361 * Theory Representable defines a class "rep" of domains that are
4362 representable (via an ep-pair) in the universal domain type "udom".
4363 Instances are provided for all type constructors defined in HOLCF.
4365 * The 'new_domain' command is a purely definitional version of the
4366 domain package, for representable domains. Syntax is identical to the
4367 old domain package. The 'new_domain' package also supports indirect
4368 recursion using previously-defined type constructors. See
4369 src/HOLCF/ex/New_Domain.thy for examples.
4371 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
4372 on the left-hand side of an equation, and then performs
4373 simplification. Rewriting is done using rules declared with the
4374 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
4375 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
4377 * The pattern-match compiler in 'fixrec' can now handle constructors
4378 with HOL function types. Pattern-match combinators for the Pair
4379 constructor are pre-configured.
4381 * The 'fixrec' package now produces better fixed-point induction rules
4382 for mutually-recursive definitions: Induction rules have conclusions
4383 of the form "P foo bar" instead of "P <foo, bar>".
4385 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
4386 been renamed to "below". The name "below" now replaces "less" in many
4387 theorem names. (Legacy theorem names using "less" are still supported
4390 * The 'fixrec' package now supports "bottom patterns". Bottom
4391 patterns can be used to generate strictness rules, or to make
4392 functions more strict (much like the bang-patterns supported by the
4393 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
4399 * Support for Poly/ML 5.3.0, with improved reporting of compiler
4400 errors and run-time exceptions, including detailed source positions.
4402 * Structure Name_Space (formerly NameSpace) now manages uniquely
4403 identified entries, with some additional information such as source
4404 position, logical grouping etc.
4406 * Theory and context data is now introduced by the simplified and
4407 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
4408 to be pure, but the old TheoryDataFun for mutable data (with explicit
4409 copy operation) is still available for some time.
4411 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
4412 provides a high-level programming interface to synchronized state
4413 variables with atomic update. This works via pure function
4414 application within a critical section -- its runtime should be as
4415 short as possible; beware of deadlocks if critical code is nested,
4416 either directly or indirectly via other synchronized variables!
4418 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
4419 wraps raw ML references, explicitly indicating their non-thread-safe
4420 behaviour. The Isar toplevel keeps this structure open, to
4421 accommodate Proof General as well as quick and dirty interactive
4422 experiments with references.
4424 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
4425 parallel tactical reasoning.
4427 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
4428 are similar to SUBPROOF, but are slightly more flexible: only the
4429 specified parts of the subgoal are imported into the context, and the
4430 body tactic may introduce new subgoals and schematic variables.
4432 * Old tactical METAHYPS, which does not observe the proof context, has
4433 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
4434 or Subgoal.FOCUS etc.
4436 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
4437 functors have their own ML name space there is no point to mark them
4438 separately.) Minor INCOMPATIBILITY.
4440 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
4442 * Renamed several structures FooBar to Foo_Bar. Occasional,
4445 * Operations of structure Skip_Proof no longer require quick_and_dirty
4446 mode, which avoids critical setmp.
4448 * Eliminated old Attrib.add_attributes, Method.add_methods and related
4449 combinators for "args". INCOMPATIBILITY, need to use simplified
4450 Attrib/Method.setup introduced in Isabelle2009.
4452 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
4453 back on global_simpset_of, global_claset_of, global_clasimpset_of as
4454 last resort. INCOMPATIBILITY.
4456 * Display.pretty_thm now requires a proper context (cf. former
4457 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
4458 or even Display.pretty_thm_without_context as last resort.
4461 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
4462 Syntax.pretty_typ/term directly, preferably with proper context
4463 instead of global theory.
4468 * Further fine tuning of parallel proof checking, scales up to 8 cores
4469 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
4472 * Support for additional "Isabelle components" via etc/components, see
4473 also the system manual.
4475 * The isabelle makeall tool now operates on all components with
4476 IsaMakefile, not just hardwired "logics".
4478 * Removed "compress" option from isabelle-process and isabelle usedir;
4479 this is always enabled.
4481 * Discontinued support for Poly/ML 4.x versions.
4483 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
4484 on a given logic image. This requires the lighttpd webserver and is
4485 currently supported on Linux only.
4489 New in Isabelle2009 (April 2009)
4490 --------------------------------
4494 * Simplified main Isabelle executables, with less surprises on
4495 case-insensitive file-systems (such as Mac OS).
4497 - The main Isabelle tool wrapper is now called "isabelle" instead of
4500 - The former "isabelle" alias for "isabelle-process" has been
4501 removed (should rarely occur to regular users).
4503 - The former "isabelle-interface" and its alias "Isabelle" have been
4504 removed (interfaces are now regular Isabelle tools).
4506 Within scripts and make files, the Isabelle environment variables
4507 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
4508 respectively. (The latter are still available as legacy feature.)
4510 The old isabelle-interface wrapper could react in confusing ways if
4511 the interface was uninstalled or changed otherwise. Individual
4512 interface tool configuration is now more explicit, see also the
4513 Isabelle system manual. In particular, Proof General is now available
4514 via "isabelle emacs".
4516 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
4517 purge installed copies of Isabelle executables and re-run "isabelle
4518 install -p ...", or use symlinks.
4520 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
4521 old ~/isabelle, which was slightly non-standard and apt to cause
4522 surprises on case-insensitive file-systems (such as Mac OS).
4524 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
4525 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
4526 care is required when using older releases of Isabelle. Note that
4527 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
4528 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
4530 * Proofs of fully specified statements are run in parallel on
4531 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
4532 a regular 4-core machine, if the initial heap space is made reasonably
4533 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
4535 * The main reference manuals ("isar-ref", "implementation", and
4536 "system") have been updated and extended. Formally checked references
4537 as hyperlinks are now available uniformly.
4542 * Complete re-implementation of locales. INCOMPATIBILITY in several
4543 respects. The most important changes are listed below. See the
4544 Tutorial on Locales ("locales" manual) for details.
4546 - In locale expressions, instantiation replaces renaming. Parameters
4547 must be declared in a for clause. To aid compatibility with previous
4548 parameter inheritance, in locale declarations, parameters that are not
4549 'touched' (instantiation position "_" or omitted) are implicitly added
4550 with their syntax at the beginning of the for clause.
4552 - Syntax from abbreviations and definitions in locales is available in
4553 locale expressions and context elements. The latter is particularly
4554 useful in locale declarations.
4556 - More flexible mechanisms to qualify names generated by locale
4557 expressions. Qualifiers (prefixes) may be specified in locale
4558 expressions, and can be marked as mandatory (syntax: "name!:") or
4559 optional (syntax "name?:"). The default depends for plain "name:"
4560 depends on the situation where a locale expression is used: in
4561 commands 'locale' and 'sublocale' prefixes are optional, in
4562 'interpretation' and 'interpret' prefixes are mandatory. The old
4563 implicit qualifiers derived from the parameter names of a locale are
4564 no longer generated.
4566 - Command "sublocale l < e" replaces "interpretation l < e". The
4567 instantiation clause in "interpretation" and "interpret" (square
4568 brackets) is no longer available. Use locale expressions.
4570 - When converting proof scripts, mandatory qualifiers in
4571 'interpretation' and 'interpret' should be retained by default, even
4572 if this is an INCOMPATIBILITY compared to former behavior. In the
4573 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
4574 in locale expressions range over a single locale instance only.
4576 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
4577 In existing theorem specifications replace the includes element by the
4578 respective context elements of the included locale, omitting those
4579 that are already present in the theorem specification. Multiple
4580 assume elements of a locale should be replaced by a single one
4581 involving the locale predicate. In the proof body, declarations (most
4582 notably theorems) may be regained by interpreting the respective
4583 locales in the proof context as required (command "interpret").
4585 If using "includes" in replacement of a target solely because the
4586 parameter types in the theorem are not as general as in the target,
4587 consider declaring a new locale with additional type constraints on
4588 the parameters (context element "constrains").
4590 - Discontinued "locale (open)". INCOMPATIBILITY.
4592 - Locale interpretation commands no longer attempt to simplify goal.
4593 INCOMPATIBILITY: in rare situations the generated goal differs. Use
4594 methods intro_locales and unfold_locales to clarify.
4596 - Locale interpretation commands no longer accept interpretation
4597 attributes. INCOMPATIBILITY.
4599 * Class declaration: so-called "base sort" must not be given in import
4600 list any longer, but is inferred from the specification. Particularly
4607 class foo = type + ...
4609 * Class target: global versions of theorems stemming do not carry a
4610 parameter prefix any longer. INCOMPATIBILITY.
4612 * Class 'instance' command no longer accepts attached definitions.
4613 INCOMPATIBILITY, use proper 'instantiation' target instead.
4615 * Recovered hiding of consts, which was accidentally broken in
4616 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
4617 makes c inaccessible; consider using ``hide (open) const c'' instead.
4619 * Slightly more coherent Pure syntax, with updated documentation in
4620 isar-ref manual. Removed locales meta_term_syntax and
4621 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
4622 INCOMPATIBILITY in rare situations. Note that &&& should not be used
4623 directly in regular applications.
4625 * There is a new syntactic category "float_const" for signed decimal
4626 fractions (e.g. 123.45 or -123.45).
4628 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
4629 interface with 'setup' command instead.
4631 * Command 'local_setup' is similar to 'setup', but operates on a local
4634 * The 'axiomatization' command now only works within a global theory
4635 context. INCOMPATIBILITY.
4637 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
4638 hypotheses. Sorts required in the course of reasoning need to be
4639 covered by the constraints in the initial statement, completed by the
4640 type instance information of the background theory. Non-trivial sort
4641 hypotheses, which rarely occur in practice, may be specified via
4642 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
4644 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
4646 The result contains an implicit sort hypotheses as before --
4647 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
4650 * Generalized Isar history, with support for linear undo, direct state
4653 * Changed defaults for unify configuration options:
4655 unify_trace_bound = 50 (formerly 25)
4656 unify_search_bound = 60 (formerly 30)
4658 * Different bookkeeping for code equations (INCOMPATIBILITY):
4660 a) On theory merge, the last set of code equations for a particular
4661 constant is taken (in accordance with the policy applied by other
4662 parts of the code generator framework).
4664 b) Code equations stemming from explicit declarations (e.g. code
4665 attribute) gain priority over default code equations stemming
4666 from definition, primrec, fun etc.
4668 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
4670 * Unified theorem tables for both code generators. Thus [code
4671 func] has disappeared and only [code] remains. INCOMPATIBILITY.
4673 * Command 'find_consts' searches for constants based on type and name
4676 find_consts "_ => bool"
4678 By default, matching is against subtypes, but it may be restricted to
4679 the whole type. Searching by name is possible. Multiple queries are
4680 conjunctive and queries may be negated by prefixing them with a
4683 find_consts strict: "_ => bool" name: "Int" -"int => int"
4685 * New 'find_theorems' criterion "solves" matches theorems that
4686 directly solve the current goal (modulo higher-order unification).
4688 * Auto solve feature for main theorem statements: whenever a new goal
4689 is stated, "find_theorems solves" is called; any theorems that could
4690 solve the lemma directly are listed as part of the goal state.
4691 Cf. associated options in Proof General Isabelle settings menu,
4692 enabled by default, with reasonable timeout for pathological cases of
4693 higher-order unification.
4696 *** Document preparation ***
4698 * Antiquotation @{lemma} now imitates a regular terminal proof,
4699 demanding keyword 'by' and supporting the full method expression
4700 syntax just like the Isar command 'by'.
4705 * Integrated main parts of former image HOL-Complex with HOL. Entry
4706 points Main and Complex_Main remain as before.
4708 * Logic image HOL-Plain provides a minimal HOL with the most important
4709 tools available (inductive, datatype, primrec, ...). This facilitates
4710 experimentation and tool development. Note that user applications
4711 (and library theories) should never refer to anything below theory
4714 * Logic image HOL-Main stops at theory Main, and thus facilitates
4715 experimentation due to shorter build times.
4717 * Logic image HOL-NSA contains theories of nonstandard analysis which
4718 were previously part of former HOL-Complex. Entry point Hyperreal
4719 remains valid, but theories formerly using Complex_Main should now use
4720 new entry point Hypercomplex.
4722 * Generic ATP manager for Sledgehammer, based on ML threads instead of
4723 Posix processes. Avoids potentially expensive forking of the ML
4724 process. New thread-based implementation also works on non-Unix
4725 platforms (Cygwin). Provers are no longer hardwired, but defined
4726 within the theory via plain ML wrapper functions. Basic Sledgehammer
4727 commands are covered in the isar-ref manual.
4729 * Wrapper scripts for remote SystemOnTPTP service allows to use
4730 sledgehammer without local ATP installation (Vampire etc.). Other
4731 provers may be included via suitable ML wrappers, see also
4732 src/HOL/ATP_Linkup.thy.
4734 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
4737 * The metis method no longer fails because the theorem is too trivial
4738 (contains the empty clause).
4740 * The metis method now fails in the usual manner, rather than raising
4741 an exception, if it determines that it cannot prove the theorem.
4743 * Method "coherent" implements a prover for coherent logic (see also
4744 src/Tools/coherent.ML).
4746 * Constants "undefined" and "default" replace "arbitrary". Usually
4747 "undefined" is the right choice to replace "arbitrary", though
4748 logically there is no difference. INCOMPATIBILITY.
4750 * Command "value" now integrates different evaluation mechanisms. The
4751 result of the first successful evaluation mechanism is printed. In
4752 square brackets a particular named evaluation mechanisms may be
4753 specified (currently, [SML], [code] or [nbe]). See further
4754 src/HOL/ex/Eval_Examples.thy.
4756 * Normalization by evaluation now allows non-leftlinear equations.
4757 Declare with attribute [code nbe].
4759 * Methods "case_tac" and "induct_tac" now refer to the very same rules
4760 as the structured Isar versions "cases" and "induct", cf. the
4761 corresponding "cases" and "induct" attributes. Mutual induction rules
4762 are now presented as a list of individual projections
4763 (e.g. foo_bar.inducts for types foo and bar); the old format with
4764 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
4765 rare situations a different rule is selected --- notably nested tuple
4766 elimination instead of former prod.exhaust: use explicit (case_tac t
4767 rule: prod.exhaust) here.
4769 * Attributes "cases", "induct", "coinduct" support "del" option.
4771 * Removed fact "case_split_thm", which duplicates "case_split".
4773 * The option datatype has been moved to a new theory Option. Renamed
4774 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
4776 * New predicate "strict_mono" classifies strict functions on partial
4777 orders. With strict functions on linear orders, reasoning about
4778 (in)equalities is facilitated by theorems "strict_mono_eq",
4779 "strict_mono_less_eq" and "strict_mono_less".
4781 * Some set operations are now proper qualified constants with
4782 authentic syntax. INCOMPATIBILITY:
4793 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
4796 * Auxiliary class "itself" has disappeared -- classes without any
4797 parameter are treated as expected by the 'class' command.
4799 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
4801 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
4802 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
4804 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
4805 method "approximation". It proves formulas on real values by using
4806 interval arithmetic. In the formulas are also the transcendental
4807 functions sin, cos, tan, atan, ln, exp and the constant pi are
4808 allowed. For examples see
4809 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
4811 * Theory "Reflection" now resides in HOL/Library.
4813 * Entry point to Word library now simply named "Word".
4816 * Made source layout more coherent with logical distribution
4819 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
4820 src/HOL/Library/Code_Message.thy ~> src/HOL/
4821 src/HOL/Library/GCD.thy ~> src/HOL/
4822 src/HOL/Library/Order_Relation.thy ~> src/HOL/
4823 src/HOL/Library/Parity.thy ~> src/HOL/
4824 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
4825 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
4826 src/HOL/Real/Lubs.thy ~> src/HOL/
4827 src/HOL/Real/PReal.thy ~> src/HOL/
4828 src/HOL/Real/Rational.thy ~> src/HOL/
4829 src/HOL/Real/RComplete.thy ~> src/HOL/
4830 src/HOL/Real/RealDef.thy ~> src/HOL/
4831 src/HOL/Real/RealPow.thy ~> src/HOL/
4832 src/HOL/Real/Real.thy ~> src/HOL/
4833 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
4834 src/HOL/Complex/Complex.thy ~> src/HOL/
4835 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
4836 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
4837 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
4838 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
4839 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
4840 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
4841 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
4842 src/HOL/Hyperreal/Log.thy ~> src/HOL/
4843 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
4844 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
4845 src/HOL/Hyperreal/Series.thy ~> src/HOL/
4846 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
4847 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
4848 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
4849 src/HOL/Real/Float ~> src/HOL/Library/
4850 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
4851 src/HOL/Real/RealVector.thy ~> src/HOL/
4853 src/HOL/arith_data.ML ~> src/HOL/Tools
4854 src/HOL/hologic.ML ~> src/HOL/Tools
4855 src/HOL/simpdata.ML ~> src/HOL/Tools
4856 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
4857 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
4858 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
4859 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
4860 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
4861 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
4862 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
4864 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
4865 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
4866 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
4867 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
4868 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
4869 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
4871 * If methods "eval" and "evaluation" encounter a structured proof
4872 state with !!/==>, only the conclusion is evaluated to True (if
4873 possible), avoiding strange error messages.
4875 * Method "sizechange" automates termination proofs using (a
4876 modification of) the size-change principle. Requires SAT solver. See
4877 src/HOL/ex/Termination.thy for examples.
4879 * Simplifier: simproc for let expressions now unfolds if bound
4880 variable occurs at most once in let expression body. INCOMPATIBILITY.
4882 * Method "arith": Linear arithmetic now ignores all inequalities when
4883 fast_arith_neq_limit is exceeded, instead of giving up entirely.
4885 * New attribute "arith" for facts that should always be used
4886 automatically by arithmetic. It is intended to be used locally in
4889 assumes [arith]: "x > 0"
4891 Global usage is discouraged because of possible performance impact.
4893 * New classes "top" and "bot" with corresponding operations "top" and
4894 "bot" in theory Orderings; instantiation of class "complete_lattice"
4895 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
4897 * Changed definition lemma "less_fun_def" in order to provide an
4898 instance for preorders on functions; use lemma "less_le" instead.
4901 * Theory Orderings: class "wellorder" moved here, with explicit
4902 induction rule "less_induct" as assumption. For instantiation of
4903 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
4906 * Theory Orderings: added class "preorder" as superclass of "order".
4907 INCOMPATIBILITY: Instantiation proofs for order, linorder
4908 etc. slightly changed. Some theorems named order_class.* now named
4911 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
4914 * Theory Finite_Set: added a new fold combinator of type
4916 ('a => 'b => 'b) => 'b => 'a set => 'b
4918 Occasionally this is more convenient than the old fold combinator
4919 which is now defined in terms of the new one and renamed to
4922 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
4923 and "ring_simps" have been replaced by "algebra_simps" (which can be
4924 extended with further lemmas!). At the moment both still exist but
4925 the former will disappear at some point.
4927 * Theory Power: Lemma power_Suc is now declared as a simp rule in
4928 class recpower. Type-specific simp rules for various recpower types
4929 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
4931 rat_power_0 -> power_0
4932 rat_power_Suc -> power_Suc
4933 realpow_0 -> power_0
4934 realpow_Suc -> power_Suc
4935 complexpow_0 -> power_0
4936 complexpow_Suc -> power_Suc
4937 power_poly_0 -> power_0
4938 power_poly_Suc -> power_Suc
4940 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
4941 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
4942 dvd has been generalized to class comm_semiring_1. Likewise a bunch
4943 of lemmas from Divides has been generalized from nat to class
4944 semiring_div. INCOMPATIBILITY. This involves the following theorem
4945 renames resulting from duplicate elimination:
4947 dvd_def_mod ~> dvd_eq_mod_eq_0
4948 zero_dvd_iff ~> dvd_0_left_iff
4949 dvd_0 ~> dvd_0_right
4950 DIVISION_BY_ZERO_DIV ~> div_by_0
4951 DIVISION_BY_ZERO_MOD ~> mod_by_0
4952 mult_div ~> div_mult_self2_is_id
4953 mult_mod ~> mod_mult_self2_is_0
4955 * Theory IntDiv: removed many lemmas that are instances of class-based
4956 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
4957 rename old lemmas as follows:
4959 dvd_diff -> nat_dvd_diff
4960 dvd_zminus_iff -> dvd_minus_iff
4961 mod_add1_eq -> mod_add_eq
4962 mod_mult1_eq -> mod_mult_right_eq
4963 mod_mult1_eq' -> mod_mult_left_eq
4964 mod_mult_distrib_mod -> mod_mult_eq
4965 nat_mod_add_left_eq -> mod_add_left_eq
4966 nat_mod_add_right_eq -> mod_add_right_eq
4967 nat_mod_div_trivial -> mod_div_trivial
4968 nat_mod_mod_trivial -> mod_mod_trivial
4969 zdiv_zadd_self1 -> div_add_self1
4970 zdiv_zadd_self2 -> div_add_self2
4971 zdiv_zmult_self1 -> div_mult_self2_is_id
4972 zdiv_zmult_self2 -> div_mult_self1_is_id
4973 zdvd_triv_left -> dvd_triv_left
4974 zdvd_triv_right -> dvd_triv_right
4975 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
4976 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
4977 zmod_zadd_left_eq -> mod_add_left_eq
4978 zmod_zadd_right_eq -> mod_add_right_eq
4979 zmod_zadd_self1 -> mod_add_self1
4980 zmod_zadd_self2 -> mod_add_self2
4981 zmod_zadd1_eq -> mod_add_eq
4982 zmod_zdiff1_eq -> mod_diff_eq
4983 zmod_zdvd_zmod -> mod_mod_cancel
4984 zmod_zmod_cancel -> mod_mod_cancel
4985 zmod_zmult_self1 -> mod_mult_self2_is_0
4986 zmod_zmult_self2 -> mod_mult_self1_is_0
4989 zdvd_abs1 -> abs_dvd_iff
4990 zdvd_abs2 -> dvd_abs_iff
4991 zdvd_refl -> dvd_refl
4992 zdvd_trans -> dvd_trans
4993 zdvd_zadd -> dvd_add
4994 zdvd_zdiff -> dvd_diff
4995 zdvd_zminus_iff -> dvd_minus_iff
4996 zdvd_zminus2_iff -> minus_dvd_iff
4997 zdvd_zmultD -> dvd_mult_right
4998 zdvd_zmultD2 -> dvd_mult_left
4999 zdvd_zmult_mono -> mult_dvd_mono
5000 zdvd_0_right -> dvd_0_right
5001 zdvd_0_left -> dvd_0_left_iff
5002 zdvd_1_left -> one_dvd
5003 zminus_dvd_iff -> minus_dvd_iff
5005 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
5007 * The real numbers offer decimal input syntax: 12.34 is translated
5008 into 1234/10^2. This translation is not reversed upon output.
5010 * Theory Library/Polynomial defines an abstract type 'a poly of
5011 univariate polynomials with coefficients of type 'a. In addition to
5012 the standard ring operations, it also supports div and mod. Code
5013 generation is also supported, using list-style constructors.
5015 * Theory Library/Inner_Product defines a class of real_inner for real
5016 inner product spaces, with an overloaded operation inner :: 'a => 'a
5017 => real. Class real_inner is a subclass of real_normed_vector from
5020 * Theory Library/Product_Vector provides instances for the product
5021 type 'a * 'b of several classes from RealVector and Inner_Product.
5022 Definitions of addition, subtraction, scalar multiplication, norms,
5023 and inner products are included.
5025 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
5026 addition to the field operations, numerals and case syntax are also
5029 * Theory Library/Diagonalize provides constructive version of Cantor's
5030 first diagonalization argument.
5032 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
5033 zlcm (for int); carried together from various gcd/lcm developements in
5034 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
5035 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
5036 may recover tupled syntax as follows:
5038 hide (open) const gcd
5039 abbreviation gcd where
5040 "gcd == (%(a, b). GCD.gcd a b)"
5042 GCD.gcd ("gcd '(_, _')")
5044 The same works for lcm, zgcd, zlcm.
5046 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
5047 instantiations for algebraic structures. Removed some duplicate
5048 theorems. Changes in simp rules. INCOMPATIBILITY.
5050 * ML antiquotation @{code} takes a constant as argument and generates
5051 corresponding code in background and inserts name of the corresponding
5052 resulting ML value/function/datatype constructor binding in place.
5053 All occurrences of @{code} with a single ML block are generated
5054 simultaneously. Provides a generic and safe interface for
5055 instrumentalizing code generation. See
5056 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
5057 In future you ought to refrain from ad-hoc compiling generated SML
5058 code on the ML toplevel. Note that (for technical reasons) @{code}
5059 cannot refer to constants for which user-defined serializations are
5060 set. Refer to the corresponding ML counterpart directly in that
5063 * Command 'rep_datatype': instead of theorem names the command now
5064 takes a list of terms denoting the constructors of the type to be
5065 represented as datatype. The characteristic theorems have to be
5066 proven. INCOMPATIBILITY. Also observe that the following theorems
5067 have disappeared in favour of existing ones:
5069 unit_induct ~> unit.induct
5070 prod_induct ~> prod.induct
5071 sum_induct ~> sum.induct
5072 Suc_Suc_eq ~> nat.inject
5073 Suc_not_Zero Zero_not_Suc ~> nat.distinct
5078 * New locales for orders and lattices where the equivalence relation
5079 is not restricted to equality. INCOMPATIBILITY: all order and lattice
5080 locales use a record structure with field eq for the equivalence.
5082 * New theory of factorial domains.
5084 * Units_l_inv and Units_r_inv are now simp rules by default.
5085 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
5086 and/or r_inv will now also require deletion of these lemmas.
5088 * Renamed the following theorems, INCOMPATIBILITY:
5090 UpperD ~> Upper_memD
5091 LowerD ~> Lower_memD
5092 least_carrier ~> least_closed
5093 greatest_carrier ~> greatest_closed
5094 greatest_Lower_above ~> greatest_Lower_below
5095 one_zero ~> carrier_one_zero
5096 one_not_zero ~> carrier_one_not_zero (collision with assumption)
5101 * Nominal datatypes can now contain type-variables.
5103 * Commands 'nominal_inductive' and 'equivariance' work with local
5106 * Nominal primrec can now works with local theory targets and its
5107 specification syntax now conforms to the general format as seen in
5110 * Method "perm_simp" honours the standard simplifier attributes
5111 (no_asm), (no_asm_use) etc.
5113 * The new predicate #* is defined like freshness, except that on the
5114 left hand side can be a set or list of atoms.
5116 * Experimental command 'nominal_inductive2' derives strong induction
5117 principles for inductive definitions. In contrast to
5118 'nominal_inductive', which can only deal with a fixed number of
5119 binders, it can deal with arbitrary expressions standing for sets of
5120 atoms to be avoided. The only inductive definition we have at the
5121 moment that needs this generalisation is the typing rule for Lets in
5124 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
5125 -----------------------------------------------------------------
5126 Gamma |- Let x be t1 in t2 : T2
5128 In this rule one wants to avoid all the binders that are introduced by
5129 "close Gamma T1". We are looking for other examples where this
5130 feature might be useful. Please let us know.
5135 * Reimplemented the simplification procedure for proving continuity
5136 subgoals. The new simproc is extensible; users can declare additional
5137 continuity introduction rules with the attribute [cont2cont].
5139 * The continuity simproc now uses a different introduction rule for
5140 solving continuity subgoals on terms with lambda abstractions. In
5141 some rare cases the new simproc may fail to solve subgoals that the
5142 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
5143 Potential INCOMPATIBILITY.
5145 * Command 'fixrec': specification syntax now conforms to the general
5146 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
5147 examples. INCOMPATIBILITY.
5152 * Proof of Zorn's Lemma for partial orders.
5157 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
5158 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
5159 depends on multithreading, so timouts will not work before Poly/ML
5162 * High-level support for concurrent ML programming, see
5163 src/Pure/Cuncurrent. The data-oriented model of "future values" is
5164 particularly convenient to organize independent functional
5165 computations. The concept of "synchronized variables" provides a
5166 higher-order interface for components with shared state, avoiding the
5167 delicate details of mutexes and condition variables. (Requires
5168 Poly/ML 5.2.1 or later.)
5170 * ML bindings produced via Isar commands are stored within the Isar
5171 context (theory or proof). Consequently, commands like 'use' and 'ML'
5172 become thread-safe and work with undo as expected (concerning
5173 top-level bindings, not side-effects on global references).
5174 INCOMPATIBILITY, need to provide proper Isar context when invoking the
5175 compiler at runtime; really global bindings need to be given outside a
5176 theory. (Requires Poly/ML 5.2 or later.)
5178 * Command 'ML_prf' is analogous to 'ML' but works within a proof
5179 context. Top-level ML bindings are stored within the proof context in
5180 a purely sequential fashion, disregarding the nested proof structure.
5181 ML bindings introduced by 'ML_prf' are discarded at the end of the
5182 proof. (Requires Poly/ML 5.2 or later.)
5184 * Simplified ML attribute and method setup, cf. functions Attrib.setup
5185 and Method.setup, as well as Isar commands 'attribute_setup' and
5186 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
5187 existing code accordingly, or use plain 'setup' together with old
5190 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
5191 to 'a -> thm, while results are always tagged with an authentic oracle
5192 name. The Isar command 'oracle' is now polymorphic, no argument type
5193 is specified. INCOMPATIBILITY, need to simplify existing oracle code
5194 accordingly. Note that extra performance may be gained by producing
5195 the cterm carefully, avoiding slow Thm.cterm_of.
5197 * Simplified interface for defining document antiquotations via
5198 ThyOutput.antiquotation, ThyOutput.output, and optionally
5199 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
5200 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
5203 * More systematic treatment of long names, abstract name bindings, and
5204 name space operations. Basic operations on qualified names have been
5205 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
5206 Long_Name.append. Old type bstring has been mostly replaced by
5207 abstract type binding (see structure Binding), which supports precise
5208 qualification by packages and local theory targets, as well as proper
5209 tracking of source positions. INCOMPATIBILITY, need to wrap old
5210 bstring values into Binding.name, or better pass through abstract
5211 bindings everywhere. See further src/Pure/General/long_name.ML,
5212 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
5214 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
5215 LocalTheory.note etc.) now refer to the *full* internal name, not the
5216 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
5218 * Disposed old type and term read functions (Sign.read_def_typ,
5219 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
5220 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
5221 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
5222 Syntax.read_term_global etc.; see also OldGoals.read_term as last
5223 resort for legacy applications.
5225 * Disposed old declarations, tactics, tactic combinators that refer to
5226 the simpset or claset of an implicit theory (such as Addsimps,
5227 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
5228 embedded ML text, or local_simpset_of with a proper context passed as
5229 explicit runtime argument.
5231 * Rules and tactics that read instantiations (read_instantiate,
5232 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
5233 context, which is required for parsing and type-checking. Moreover,
5234 the variables are specified as plain indexnames, not string encodings
5235 thereof. INCOMPATIBILITY.
5237 * Generic Toplevel.add_hook interface allows to analyze the result of
5238 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
5239 for theorem dependency output of transactions resulting in a new
5242 * ML antiquotations: block-structured compilation context indicated by
5243 \<lbrace> ... \<rbrace>; additional antiquotation forms:
5245 @{binding name} - basic name binding
5246 @{let ?pat = term} - term abbreviation (HO matching)
5247 @{note name = fact} - fact abbreviation
5248 @{thm fact} - singleton fact (with attributes)
5249 @{thms fact} - general fact (with attributes)
5250 @{lemma prop by method} - singleton goal
5251 @{lemma prop by meth1 meth2} - singleton goal
5252 @{lemma prop1 ... propN by method} - general goal
5253 @{lemma prop1 ... propN by meth1 meth2} - general goal
5254 @{lemma (open) ...} - open derivation
5259 * The Isabelle "emacs" tool provides a specific interface to invoke
5260 Proof General / Emacs, with more explicit failure if that is not
5261 installed (the old isabelle-interface script silently falls back on
5262 isabelle-process). The PROOFGENERAL_HOME setting determines the
5263 installation location of the Proof General distribution.
5265 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
5266 the Isabelle process into a JVM/Scala application. See
5267 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
5268 process wrapper has been discontinued.)
5270 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
5272 * Various status messages (with exact source position information) are
5273 emitted, if proper markup print mode is enabled. This allows
5274 user-interface components to provide detailed feedback on internal
5279 New in Isabelle2008 (June 2008)
5280 -------------------------------
5284 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
5285 and updated, with formally checked references as hyperlinks.
5287 * Theory loader: use_thy (and similar operations) no longer set the
5288 implicit ML context, which was occasionally hard to predict and in
5289 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
5290 provides a proper context already.
5292 * Theory loader: old-style ML proof scripts being *attached* to a thy
5293 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
5294 'use' within a theory file will do the job.
5296 * Name space merge now observes canonical order, i.e. the second space
5297 is inserted into the first one, while existing entries in the first
5298 space take precedence. INCOMPATIBILITY in rare situations, may try to
5299 swap theory imports.
5301 * Syntax: symbol \<chi> is now considered a letter. Potential
5302 INCOMPATIBILITY in identifier syntax etc.
5304 * Outer syntax: string tokens no longer admit escaped white space,
5305 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
5306 white space without escapes.
5308 * Outer syntax: string tokens may contain arbitrary character codes
5309 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
5315 * Context-dependent token translations. Default setup reverts locally
5316 fixed variables, and adds hilite markup for undeclared frees.
5318 * Unused theorems can be found using the new command 'unused_thms'.
5319 There are three ways of invoking it:
5322 Only finds unused theorems in the current theory.
5324 (2) unused_thms thy_1 ... thy_n -
5325 Finds unused theorems in the current theory and all of its ancestors,
5326 excluding the theories thy_1 ... thy_n and all of their ancestors.
5328 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
5329 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
5330 their ancestors, excluding the theories thy_1 ... thy_n and all of
5333 In order to increase the readability of the list produced by
5334 unused_thms, theorems that have been created by a particular instance
5335 of a theory command such as 'inductive' or 'function' are considered
5336 to belong to the same "group", meaning that if at least one theorem in
5337 this group is used, the other theorems in the same group are no longer
5338 reported as unused. Moreover, if all theorems in the group are
5339 unused, only one theorem in the group is displayed.
5341 Note that proof objects have to be switched on in order for
5342 unused_thms to work properly (i.e. !proofs must be >= 1, which is
5343 usually the case when using Proof General with the default settings).
5345 * Authentic naming of facts disallows ad-hoc overwriting of previous
5346 theorems within the same name space. INCOMPATIBILITY, need to remove
5347 duplicate fact bindings, or even accidental fact duplications. Note
5348 that tools may maintain dynamically scoped facts systematically, using
5349 PureThy.add_thms_dynamic.
5351 * Command 'hide' now allows to hide from "fact" name space as well.
5353 * Eliminated destructive theorem database, simpset, claset, and
5354 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
5355 update of theories within ML code.
5357 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
5358 INCOMPATIBILITY, object-logics depending on former Pure require
5359 additional setup PureThy.old_appl_syntax_setup; object-logics
5360 depending on former CPure need to refer to Pure.
5362 * Commands 'use' and 'ML' are now purely functional, operating on
5363 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
5364 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
5367 * Command 'setup': discontinued implicit version with ML reference.
5369 * Instantiation target allows for simultaneous specification of class
5370 instance operations together with an instantiation proof.
5371 Type-checking phase allows to refer to class operations uniformly.
5372 See src/HOL/Complex/Complex.thy for an Isar example and
5373 src/HOL/Library/Eval.thy for an ML example.
5375 * Indexing of literal facts: be more serious about including only
5376 facts from the visible specification/proof context, but not the
5377 background context (locale etc.). Affects `prop` notation and method
5378 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
5381 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
5382 "(open)" option, which used to expose internal bound variables to the
5385 * Isar statements: removed obsolete case "rule_context".
5386 INCOMPATIBILITY, better use explicit fixes/assumes.
5388 * Locale proofs: default proof step now includes 'unfold_locales';
5389 hence 'proof' without argument may be used to unfold locale
5393 *** Document preparation ***
5395 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
5396 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
5397 obsolete thumbpdf setup (contemporary PDF viewers do this on the
5398 spot); renamed link color from "darkblue" to "linkcolor" (default
5399 value unchanged, can be redefined via \definecolor); no longer sets
5400 "a4paper" option (unnecessary or even intrusive).
5402 * Antiquotation @{lemma A method} proves proposition A by the given
5403 method (either a method name or a method name plus (optional) method
5404 arguments in parentheses) and prints A just like @{prop A}.
5409 * New primrec package. Specification syntax conforms in style to
5410 definition/function/.... No separate induction rule is provided. The
5411 "primrec" command distinguishes old-style and new-style specifications
5412 by syntax. The former primrec package is now named OldPrimrecPackage.
5413 When adjusting theories, beware: constants stemming from new-style
5414 primrec specifications have authentic syntax.
5416 * Metis prover is now an order of magnitude faster, and also works
5417 with multithreading.
5419 * Metis: the maximum number of clauses that can be produced from a
5420 theorem is now given by the attribute max_clauses. Theorems that
5421 exceed this number are ignored, with a warning printed.
5423 * Sledgehammer no longer produces structured proofs by default. To
5424 enable, declare [[sledgehammer_full = true]]. Attributes
5425 reconstruction_modulus, reconstruction_sorts renamed
5426 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
5428 * Method "induct_scheme" derives user-specified induction rules
5429 from well-founded induction and completeness of patterns. This factors
5430 out some operations that are done internally by the function package
5431 and makes them available separately. See
5432 src/HOL/ex/Induction_Scheme.thy for examples.
5434 * More flexible generation of measure functions for termination
5435 proofs: Measure functions can be declared by proving a rule of the
5436 form "is_measure f" and giving it the [measure_function] attribute.
5437 The "is_measure" predicate is logically meaningless (always true), and
5438 just guides the heuristic. To find suitable measure functions, the
5439 termination prover sets up the goal "is_measure ?f" of the appropriate
5440 type and generates all solutions by prolog-style backwards proof using
5443 This setup also deals with rules like
5445 "is_measure f ==> is_measure (list_size f)"
5447 which accommodates nested datatypes that recurse through lists.
5448 Similar rules are predeclared for products and option types.
5450 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
5454 - Definitions of overloaded constants on sets have to be replaced by
5455 definitions on => and bool.
5457 - Some definitions of overloaded operators on sets can now be proved
5458 using the definitions of the operators on => and bool. Therefore,
5459 the following theorems have been renamed:
5461 subset_def -> subset_eq
5462 psubset_def -> psubset_eq
5463 set_diff_def -> set_diff_eq
5464 Compl_def -> Compl_eq
5465 Sup_set_def -> Sup_set_eq
5466 Inf_set_def -> Inf_set_eq
5467 sup_set_def -> sup_set_eq
5468 inf_set_def -> inf_set_eq
5470 - Due to the incompleteness of the HO unification algorithm, some
5471 rules such as subst may require manual instantiation, if some of
5472 the unknowns in the rule is a set.
5474 - Higher order unification and forward proofs:
5477 have "P (S::'a set)" <...>
5478 then have "EX S. P S" ..
5480 no longer works (due to the incompleteness of the HO unification
5481 algorithm) and must be replaced by the pattern
5488 - Calculational reasoning with subst (or similar rules):
5491 have "P (S::'a set)" <...>
5492 also have "S = T" <...>
5493 finally have "P T" .
5495 no longer works (for similar reasons as the previous example) and
5496 must be replaced by something like
5498 have "P (S::'a set)" <...>
5499 moreover have "S = T" <...>
5500 ultimately have "P T" by simp
5502 - Tactics or packages written in ML code:
5503 Code performing pattern matching on types via
5505 Type ("set", [T]) => ...
5507 must be rewritten. Moreover, functions like strip_type or
5508 binder_types no longer return the right value when applied to a
5511 T1 => ... => Tn => U => bool
5515 T1 => ... => Tn => U set
5517 * Merged theories Wellfounded_Recursion, Accessible_Part and
5518 Wellfounded_Relations to theory Wellfounded.
5520 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
5522 * Class finite no longer treats UNIV as class parameter. Use class
5523 enum from theory Library/Enum instead to achieve a similar effect.
5526 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
5527 and "Cons". INCOMPATIBILITY.
5529 * HOL (and FOL): renamed variables in rules imp_elim and swap.
5530 Potential INCOMPATIBILITY.
5532 * Theory Product_Type: duplicated lemmas split_Pair_apply and
5533 injective_fst_snd removed, use split_eta and prod_eqI instead.
5534 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
5536 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
5537 the same name in theory Orderings:
5547 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
5548 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
5549 and different variable names.
5551 * Library/Option_ord.thy: Canonical order on option type.
5553 * Library/RBT.thy: Red-black trees, an efficient implementation of
5556 * Library/Countable.thy: Type class for countable types.
5558 * Theory Int: The representation of numerals has changed. The infix
5559 operator BIT and the bit datatype with constructors B0 and B1 have
5560 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
5561 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
5562 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
5565 * Theory Nat: definition of <= and < on natural numbers no longer
5566 depend on well-founded relations. INCOMPATIBILITY. Definitions
5567 le_def and less_def have disappeared. Consider lemmas not_less
5568 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
5570 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
5571 (whose purpose mainly is for various fold_set functionals) have been
5572 abandoned in favor of the existing algebraic classes
5573 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
5574 lower_semilattice (resp. upper_semilattice) and linorder.
5577 * Theory Transitive_Closure: induct and cases rules now declare proper
5578 case_names ("base" and "step"). INCOMPATIBILITY.
5580 * Theorem Inductive.lfp_ordinal_induct generalized to complete
5581 lattices. The form set-specific version is available as
5582 Inductive.lfp_ordinal_induct_set.
5584 * Renamed theorems "power.simps" to "power_int.simps".
5587 * Class semiring_div provides basic abstract properties of semirings
5588 with division and modulo operations. Subsumes former class dvd_mod.
5590 * Merged theories IntDef, Numeral and IntArith into unified theory
5591 Int. INCOMPATIBILITY.
5593 * Theory Library/Code_Index: type "index" now represents natural
5594 numbers rather than integers. INCOMPATIBILITY.
5596 * New class "uminus" with operation "uminus" (split of from class
5597 "minus" which now only has operation "minus", binary).
5600 * Constants "card", "internal_split", "option_map" now with authentic
5601 syntax. INCOMPATIBILITY.
5603 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
5604 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
5605 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
5606 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
5607 Sup_set_def, le_def, less_def, option_map_def now with object
5608 equality. INCOMPATIBILITY.
5610 * Records. Removed K_record, and replaced it by pure lambda term
5611 %x. c. The simplifier setup is now more robust against eta expansion.
5612 INCOMPATIBILITY: in cases explicitly referring to K_record.
5614 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
5616 * Library/ListVector: new theory of arithmetic vector operations.
5618 * Library/Order_Relation: new theory of various orderings as sets of
5619 pairs. Defines preorders, partial orders, linear orders and
5620 well-orders on sets and on types.
5625 * Renamed some theories to allow to loading both ZF and HOL in the
5628 Datatype -> Datatype_ZF
5629 Inductive -> Inductive_ZF
5636 INCOMPATIBILITY: ZF theories that import individual theories below
5637 Main might need to be adapted. Regular theory Main is still
5638 available, as trivial extension of Main_ZF.
5643 * ML within Isar: antiquotation @{const name} or @{const
5644 name(typargs)} produces statically-checked Const term.
5646 * Functor NamedThmsFun: data is available to the user as dynamic fact
5647 (of the same name). Removed obsolete print command.
5649 * Removed obsolete "use_legacy_bindings" function.
5651 * The ``print mode'' is now a thread-local value derived from a global
5652 template (the former print_mode reference), thus access becomes
5653 non-critical. The global print_mode reference is for session
5654 management only; user-code should use print_mode_value,
5655 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
5657 * Functions system/system_out provide a robust way to invoke external
5658 shell commands, with propagation of interrupts (requires Poly/ML
5659 5.2.1). Do not use OS.Process.system etc. from the basis library!
5664 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
5665 in accordance with Proof General 3.7, which prefers GNU emacs.
5667 * isatool tty runs Isabelle process with plain tty interaction;
5668 optional line editor may be specified via ISABELLE_LINE_EDITOR
5669 setting, the default settings attempt to locate "ledit" and "rlwrap".
5671 * isatool browser now works with Cygwin as well, using general
5672 "javapath" function defined in Isabelle process environment.
5674 * YXML notation provides a simple and efficient alternative to
5675 standard XML transfer syntax. See src/Pure/General/yxml.ML and
5676 isatool yxml as described in the Isabelle system manual.
5678 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
5679 provides general wrapper for managing an Isabelle process in a robust
5680 fashion, with ``cooked'' output from stdin/stderr.
5682 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
5683 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
5685 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
5686 way of changing the user's settings is via
5687 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
5690 * Multithreading.max_threads := 0 refers to the number of actual CPU
5691 cores of the underlying machine, which is a good starting point for
5692 optimal performance tuning. The corresponding usedir option -M allows
5693 "max" as an alias for "0". WARNING: does not work on certain versions
5694 of Mac OS (with Poly/ML 5.1).
5696 * isabelle-process: non-ML sessions are run with "nice", to reduce the
5697 adverse effect of Isabelle flooding interactive front-ends (notably
5698 ProofGeneral / XEmacs).
5702 New in Isabelle2007 (November 2007)
5703 -----------------------------------
5707 * More uniform information about legacy features, notably a
5708 warning/error of "Legacy feature: ...", depending on the state of the
5709 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
5710 legacy features will disappear eventually.
5712 * Theory syntax: the header format ``theory A = B + C:'' has been
5713 discontinued in favour of ``theory A imports B C begin''. Use isatool
5714 fixheaders to convert existing theory files. INCOMPATIBILITY.
5716 * Theory syntax: the old non-Isar theory file format has been
5717 discontinued altogether. Note that ML proof scripts may still be used
5718 with Isar theories; migration is usually quite simple with the ML
5719 function use_legacy_bindings. INCOMPATIBILITY.
5721 * Theory syntax: some popular names (e.g. 'class', 'declaration',
5722 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
5725 * Theory loader: be more serious about observing the static theory
5726 header specifications (including optional directories), but not the
5727 accidental file locations of previously successful loads. The strict
5728 update policy of former update_thy is now already performed by
5729 use_thy, so the former has been removed; use_thys updates several
5730 theories simultaneously, just as 'imports' within a theory header
5731 specification, but without merging the results. Potential
5732 INCOMPATIBILITY: may need to refine theory headers and commands
5733 ROOT.ML which depend on load order.
5735 * Theory loader: optional support for content-based file
5736 identification, instead of the traditional scheme of full physical
5737 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
5738 (cf. the system manual). The new scheme allows to work with
5739 non-finished theories in persistent session images, such that source
5740 files may be moved later on without requiring reloads.
5742 * Theory loader: old-style ML proof scripts being *attached* to a thy
5743 file (with the same base name as the theory) are considered a legacy
5744 feature, which will disappear eventually. Even now, the theory loader
5745 no longer maintains dependencies on such files.
5747 * Syntax: the scope for resolving ambiguities via type-inference is
5748 now limited to individual terms, instead of whole simultaneous
5749 specifications as before. This greatly reduces the complexity of the
5750 syntax module and improves flexibility by separating parsing and
5751 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
5752 'fixes' etc.) are required in rare situations.
5754 * Syntax: constants introduced by new-style packages ('definition',
5755 'abbreviation' etc.) are passed through the syntax module in
5756 ``authentic mode''. This means that associated mixfix annotations
5757 really stick to such constants, independently of potential name space
5758 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
5759 trees are represented slightly differently, may need to adapt syntax
5760 translations accordingly. Use CONST marker in 'translations' and
5761 @{const_syntax} antiquotation in 'parse_translation' etc.
5763 * Legacy goal package: reduced interface to the bare minimum required
5764 to keep existing proof scripts running. Most other user-level
5765 functions are now part of the OldGoals structure, which is *not* open
5766 by default (consider isatool expandshort before open OldGoals).
5767 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
5768 these tend to cause confusion about the actual goal (!) context being
5769 used here, which is not necessarily the same as the_context().
5771 * Command 'find_theorems': supports "*" wild-card in "name:"
5772 criterion; "with_dups" option. Certain ProofGeneral versions might
5773 support a specific search form (see ProofGeneral/CHANGES).
5775 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
5776 by default, which means that "prems" (and also "fixed variables") are
5777 suppressed from proof state output. Note that the ProofGeneral
5778 settings mechanism allows to change and save options persistently, but
5779 older versions of Isabelle will fail to start up if a negative prems
5782 * Local theory targets may be specified by non-nested blocks of
5783 ``context/locale/class ... begin'' followed by ``end''. The body may
5784 contain definitions, theorems etc., including any derived mechanism
5785 that has been implemented on top of these primitives. This concept
5786 generalizes the existing ``theorem (in ...)'' towards more versatility
5789 * Proof General interface: proper undo of final 'end' command;
5790 discontinued Isabelle/classic mode (ML proof scripts).
5793 *** Document preparation ***
5795 * Added antiquotation @{theory name} which prints the given name,
5796 after checking that it refers to a valid ancestor theory in the
5799 * Added antiquotations @{ML_type text} and @{ML_struct text} which
5800 check the given source text as ML type/structure, printing verbatim.
5802 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
5803 "c args == rhs" given in the current context. (Any number of
5804 arguments may be given on the LHS.)
5809 * The 'class' package offers a combination of axclass and locale to
5810 achieve Haskell-like type classes in Isabelle. Definitions and
5811 theorems within a class context produce both relative results (with
5812 implicit parameters according to the locale context), and polymorphic
5813 constants with qualified polymorphism (according to the class
5814 context). Within the body context of a 'class' target, a separate
5815 syntax layer ("user space type system") takes care of converting
5816 between global polymorphic consts and internal locale representation.
5817 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
5818 "isatool doc classes" provides a tutorial.
5820 * Generic code generator framework allows to generate executable
5821 code for ML and Haskell (including Isabelle classes). A short usage
5824 internal compilation:
5825 export_code <list of constants (term syntax)> in SML
5826 writing SML code to a file:
5827 export_code <list of constants (term syntax)> in SML <filename>
5828 writing OCaml code to a file:
5829 export_code <list of constants (term syntax)> in OCaml <filename>
5830 writing Haskell code to a bunch of files:
5831 export_code <list of constants (term syntax)> in Haskell <filename>
5833 evaluating closed propositions to True/False using code generation:
5836 Reasonable default setup of framework in HOL.
5838 Theorem attributs for selecting and transforming function equations theorems:
5840 [code fun]: select a theorem as function equation for a specific constant
5841 [code fun del]: deselect a theorem as function equation for a specific constant
5842 [code inline]: select an equation theorem for unfolding (inlining) in place
5843 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
5845 User-defined serializations (target in {SML, OCaml, Haskell}):
5847 code_const <and-list of constants (term syntax)>
5848 {(target) <and-list of const target syntax>}+
5850 code_type <and-list of type constructors>
5851 {(target) <and-list of type target syntax>}+
5853 code_instance <and-list of instances>
5855 where instance ::= <type constructor> :: <class>
5857 code_class <and_list of classes>
5858 {(target) <and-list of class target syntax>}+
5859 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
5861 code_instance and code_class only are effective to target Haskell.
5863 For example usage see src/HOL/ex/Codegenerator.thy and
5864 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
5865 generation from Isabelle/HOL theories is available via "isatool doc
5868 * Code generator: consts in 'consts_code' Isar commands are now
5869 referred to by usual term syntax (including optional type
5872 * Command 'no_translations' removes translation rules from theory
5875 * Overloaded definitions are now actually checked for acyclic
5876 dependencies. The overloading scheme is slightly more general than
5877 that of Haskell98, although Isabelle does not demand an exact
5878 correspondence to type class and instance declarations.
5879 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
5880 exotic versions of overloading -- at the discretion of the user!
5882 Polymorphic constants are represented via type arguments, i.e. the
5883 instantiation that matches an instance against the most general
5884 declaration given in the signature. For example, with the declaration
5885 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
5886 as c(nat). Overloading is essentially simultaneous structural
5887 recursion over such type arguments. Incomplete specification patterns
5888 impose global constraints on all occurrences, e.g. c('a * 'a) on the
5889 LHS means that more general c('a * 'b) will be disallowed on any RHS.
5890 Command 'print_theory' outputs the normalized system of recursive
5891 equations, see section "definitions".
5893 * Configuration options are maintained within the theory or proof
5894 context (with name and type bool/int/string), providing a very simple
5895 interface to a poor-man's version of general context data. Tools may
5896 declare options in ML (e.g. using Attrib.config_int) and then refer to
5897 these values using Config.get etc. Users may change options via an
5898 associated attribute of the same name. This form of context
5899 declaration works particularly well with commands 'declare' or
5900 'using', for example ``declare [[foo = 42]]''. Thus it has become
5901 very easy to avoid global references, which would not observe Isar
5902 toplevel undo/redo and fail to work with multithreading.
5904 Various global ML references of Pure and HOL have been turned into
5905 configuration options:
5907 Unify.search_bound unify_search_bound
5908 Unify.trace_bound unify_trace_bound
5909 Unify.trace_simp unify_trace_simp
5910 Unify.trace_types unify_trace_types
5911 Simplifier.simp_depth_limit simp_depth_limit
5912 Blast.depth_limit blast_depth_limit
5913 DatatypeProp.dtK datatype_distinctness_limit
5914 fast_arith_neq_limit fast_arith_neq_limit
5915 fast_arith_split_limit fast_arith_split_limit
5917 * Named collections of theorems may be easily installed as context
5918 data using the functor NamedThmsFun (see also
5919 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
5920 attributes; there is also a toplevel print command. This facility is
5921 just a common case of general context data, which is the preferred way
5922 for anything more complex than just a list of facts in canonical
5925 * Isar: command 'declaration' augments a local theory by generic
5926 declaration functions written in ML. This enables arbitrary content
5927 being added to the context, depending on a morphism that tells the
5928 difference of the original declaration context wrt. the application
5929 context encountered later on.
5931 * Isar: proper interfaces for simplification procedures. Command
5932 'simproc_setup' declares named simprocs (with match patterns, and body
5933 text in ML). Attribute "simproc" adds/deletes simprocs in the current
5934 context. ML antiquotation @{simproc name} retrieves named simprocs.
5936 * Isar: an extra pair of brackets around attribute declarations
5937 abbreviates a theorem reference involving an internal dummy fact,
5938 which will be ignored later --- only the effect of the attribute on
5939 the background context will persist. This form of in-place
5940 declarations is particularly useful with commands like 'declare' and
5941 'using', for example ``have A using [[simproc a]] by simp''.
5943 * Isar: method "assumption" (and implicit closing of subproofs) now
5944 takes simple non-atomic goal assumptions into account: after applying
5945 an assumption as a rule the resulting subgoals are solved by atomic
5946 assumption steps. This is particularly useful to finish 'obtain'
5947 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
5948 without referring to the original premise "!!x. P x ==> thesis" in the
5949 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
5952 * Isar: implicit use of prems from the Isar proof context is
5953 considered a legacy feature. Common applications like ``have A .''
5954 may be replaced by ``have A by fact'' or ``note `A`''. In general,
5955 referencing facts explicitly here improves readability and
5956 maintainability of proof texts.
5958 * Isar: improper proof element 'guess' is like 'obtain', but derives
5959 the obtained context from the course of reasoning! For example:
5961 assume "EX x y. A x & B y" -- "any previous fact"
5962 then guess x and y by clarify
5964 This technique is potentially adventurous, depending on the facts and
5965 proof tools being involved here.
5967 * Isar: known facts from the proof context may be specified as literal
5968 propositions, using ASCII back-quote syntax. This works wherever
5969 named facts used to be allowed so far, in proof commands, proof
5970 methods, attributes etc. Literal facts are retrieved from the context
5971 according to unification of type and term parameters. For example,
5972 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
5973 theorems in the current context, then these are valid literal facts:
5974 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
5976 There is also a proof method "fact" which does the same composition
5977 for explicit goal states, e.g. the following proof texts coincide with
5978 certain special cases of literal facts:
5980 have "A" by fact == note `A`
5981 have "A ==> B" by fact == note `A ==> B`
5982 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
5983 have "P a ==> Q a" by fact == note `P a ==> Q a`
5985 * Isar: ":" (colon) is no longer a symbolic identifier character in
5986 outer syntax. Thus symbolic identifiers may be used without
5987 additional white space in declarations like this: ``assume *: A''.
5989 * Isar: 'print_facts' prints all local facts of the current context,
5990 both named and unnamed ones.
5992 * Isar: 'def' now admits simultaneous definitions, e.g.:
5994 def x == "t" and y == "u"
5996 * Isar: added command 'unfolding', which is structurally similar to
5997 'using', but affects both the goal state and facts by unfolding given
5998 rewrite rules. Thus many occurrences of the 'unfold' method or
5999 'unfolded' attribute may be replaced by first-class proof text.
6001 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
6002 and command 'unfolding' now all support object-level equalities
6003 (potentially conditional). The underlying notion of rewrite rule is
6004 analogous to the 'rule_format' attribute, but *not* that of the
6005 Simplifier (which is usually more generous).
6007 * Isar: the new attribute [rotated n] (default n = 1) rotates the
6008 premises of a theorem by n. Useful in conjunction with drule.
6010 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
6011 method expression within a sandbox consisting of the first N
6012 sub-goals, which need to exist. For example, ``simp_all [3]''
6013 simplifies the first three sub-goals, while (rule foo, simp_all)[]
6014 simplifies all new goals that emerge from applying rule foo to the
6015 originally first one.
6017 * Isar: schematic goals are no longer restricted to higher-order
6018 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
6021 * Isar: the conclusion of a long theorem statement is now either
6022 'shows' (a simultaneous conjunction, as before), or 'obtains'
6023 (essentially a disjunction of cases with local parameters and
6024 assumptions). The latter allows to express general elimination rules
6025 adequately; in this notation common elimination rules look like this:
6027 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
6029 obtains x where "P x"
6031 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
6035 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
6041 The subsequent classical rules even refer to the formal "thesis"
6044 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
6047 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
6048 obtains "thesis ==> something"
6050 The actual proof of an 'obtains' statement is analogous to that of the
6051 Isar proof element 'obtain', only that there may be several cases.
6052 Optional case names may be specified in parentheses; these will be
6053 available both in the present proof and as annotations in the
6054 resulting rule, for later use with the 'cases' method (cf. attribute
6057 * Isar: the assumptions of a long theorem statement are available as
6058 "assms" fact in the proof context. This is more appropriate than the
6059 (historical) "prems", which refers to all assumptions of the current
6060 context, including those from the target locale, proof body etc.
6062 * Isar: 'print_statement' prints theorems from the current theory or
6063 proof context in long statement form, according to the syntax of a
6066 * Isar: 'obtain' takes an optional case name for the local context
6067 introduction rule (default "that").
6069 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
6070 explicit (is "_ ==> ?foo") in the rare cases where this still happens
6073 * Pure: syntax "CONST name" produces a fully internalized constant
6074 according to the current context. This is particularly useful for
6075 syntax translations that should refer to internal constant
6076 representations independently of name spaces.
6078 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
6079 instead of "FOO ". This allows multiple binder declarations to coexist
6080 in the same context. INCOMPATIBILITY.
6082 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
6083 primitive that also works in a locale context (both for constants and
6084 fixed variables). Type declaration and internal syntactic representation
6085 of given constants retrieved from the context. Likewise, the
6086 'no_notation' command allows to remove given syntax annotations from the
6089 * Isar/locales: new derived specification elements 'axiomatization',
6090 'definition', 'abbreviation', which support type-inference, admit
6091 object-level specifications (equality, equivalence). See also the
6092 isar-ref manual. Examples:
6095 eq (infix "===" 50) where
6096 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
6098 definition "f x y = x + y + 1"
6099 definition g where "g x = f x x"
6102 neq (infix "=!=" 50) where
6103 "x =!= y == ~ (x === y)"
6105 These specifications may be also used in a locale context. Then the
6106 constants being introduced depend on certain fixed parameters, and the
6107 constant name is qualified by the locale base name. An internal
6108 abbreviation takes care for convenient input and output, making the
6109 parameters implicit and using the original short name. See also
6110 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
6111 entities from a monomorphic theory.
6113 Presently, abbreviations are only available 'in' a target locale, but
6114 not inherited by general import expressions. Also note that
6115 'abbreviation' may be used as a type-safe replacement for 'syntax' +
6116 'translations' in common applications. The "no_abbrevs" print mode
6117 prevents folding of abbreviations in term output.
6119 Concrete syntax is attached to specified constants in internal form,
6120 independently of name spaces. The parse tree representation is
6121 slightly different -- use 'notation' instead of raw 'syntax', and
6122 'translations' with explicit "CONST" markup to accommodate this.
6124 * Pure/Isar: unified syntax for new-style specification mechanisms
6125 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
6126 full type inference and dummy patterns ("_"). For example:
6128 definition "K x _ = x"
6130 inductive conj for A B
6131 where "A ==> B ==> conj A B"
6133 * Pure: command 'print_abbrevs' prints all constant abbreviations of
6134 the current context. Print mode "no_abbrevs" prevents inversion of
6135 abbreviations on output.
6137 * Isar/locales: improved parameter handling: use of locales "var" and
6138 "struct" no longer necessary; - parameter renamings are no longer
6139 required to be injective. For example, this allows to define
6140 endomorphisms as locale endom = homom mult mult h.
6142 * Isar/locales: changed the way locales with predicates are defined.
6143 Instead of accumulating the specification, the imported expression is
6144 now an interpretation. INCOMPATIBILITY: different normal form of
6145 locale expressions. In particular, in interpretations of locales with
6146 predicates, goals repesenting already interpreted fragments are not
6147 removed automatically. Use methods `intro_locales' and
6148 `unfold_locales'; see below.
6150 * Isar/locales: new methods `intro_locales' and `unfold_locales'
6151 provide backward reasoning on locales predicates. The methods are
6152 aware of interpretations and discharge corresponding goals.
6153 `intro_locales' is less aggressive then `unfold_locales' and does not
6154 unfold predicates to assumptions.
6156 * Isar/locales: the order in which locale fragments are accumulated
6157 has changed. This enables to override declarations from fragments due
6158 to interpretations -- for example, unwanted simp rules.
6160 * Isar/locales: interpretation in theories and proof contexts has been
6161 extended. One may now specify (and prove) equations, which are
6162 unfolded in interpreted theorems. This is useful for replacing
6163 defined concepts (constants depending on locale parameters) by
6164 concepts already existing in the target context. Example:
6166 interpretation partial_order ["op <= :: [int, int] => bool"]
6167 where "partial_order.less (op <=) (x::int) y = (x < y)"
6169 Typically, the constant `partial_order.less' is created by a
6170 definition specification element in the context of locale
6173 * Method "induct": improved internal context management to support
6174 local fixes and defines on-the-fly. Thus explicit meta-level
6175 connectives !! and ==> are rarely required anymore in inductive goals
6176 (using object-logic connectives for this purpose has been long
6177 obsolete anyway). Common proof patterns are explained in
6178 src/HOL/Induct/Common_Patterns.thy, see also
6179 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
6182 * Method "induct": improved handling of simultaneous goals. Instead of
6183 introducing object-level conjunction, the statement is now split into
6184 several conclusions, while the corresponding symbolic cases are nested
6185 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
6186 see src/HOL/Induct/Common_Patterns.thy, for example.
6188 * Method "induct": mutual induction rules are now specified as a list
6189 of rule sharing the same induction cases. HOL packages usually provide
6190 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
6191 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
6192 mutual induction rules differently, i.e. like this:
6194 (induct rule: foo_bar.inducts)
6195 (induct set: foo bar)
6196 (induct pred: foo bar)
6197 (induct type: foo bar)
6199 The ML function ProjectRule.projections turns old-style rules into the
6202 * Method "coinduct": dual of induction, see
6203 src/HOL/Library/Coinductive_List.thy for various examples.
6205 * Method "cases", "induct", "coinduct": the ``(open)'' option is
6206 considered a legacy feature.
6208 * Attribute "symmetric" produces result with standardized schematic
6209 variables (index 0). Potential INCOMPATIBILITY.
6211 * Simplifier: by default the simplifier trace only shows top level
6212 rewrites now. That is, trace_simp_depth_limit is set to 1 by
6213 default. Thus there is less danger of being flooded by the trace. The
6214 trace indicates where parts have been suppressed.
6216 * Provers/classical: removed obsolete classical version of elim_format
6217 attribute; classical elim/dest rules are now treated uniformly when
6218 manipulating the claset.
6220 * Provers/classical: stricter checks to ensure that supplied intro,
6221 dest and elim rules are well-formed; dest and elim rules must have at
6224 * Provers/classical: attributes dest/elim/intro take an optional
6225 weight argument for the rule (just as the Pure versions). Weights are
6226 ignored by automated tools, but determine the search order of single
6229 * Syntax: input syntax now supports dummy variable binding "%_. b",
6230 where the body does not mention the bound variable. Note that dummy
6231 patterns implicitly depend on their context of bounds, which makes
6232 "{_. _}" match any set comprehension as expected. Potential
6233 INCOMPATIBILITY -- parse translations need to cope with syntactic
6234 constant "_idtdummy" in the binding position.
6236 * Syntax: removed obsolete syntactic constant "_K" and its associated
6237 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
6238 for example "A -> B" => "Pi A (%_. B)".
6240 * Pure: 'class_deps' command visualizes the subclass relation, using
6241 the graph browser tool.
6243 * Pure: 'print_theory' now suppresses certain internal declarations by
6244 default; use '!' option for full details.
6249 * Method "metis" proves goals by applying the Metis general-purpose
6250 resolution prover (see also http://gilith.com/software/metis/).
6251 Examples are in the directory MetisExamples. WARNING: the
6252 Isabelle/HOL-Metis integration does not yet work properly with
6255 * Command 'sledgehammer' invokes external automatic theorem provers as
6256 background processes. It generates calls to the "metis" method if
6257 successful. These can be pasted into the proof. Users do not have to
6258 wait for the automatic provers to return. WARNING: does not really
6259 work with multi-threading.
6261 * New "auto_quickcheck" feature tests outermost goal statements for
6262 potential counter-examples. Controlled by ML references
6263 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
6264 5000 milliseconds). Fails silently if statements is outside of
6265 executable fragment, or any other codgenerator problem occurs.
6267 * New constant "undefined" with axiom "undefined x = undefined".
6269 * Added class "HOL.eq", allowing for code generation with polymorphic
6272 * Some renaming of class constants due to canonical name prefixing in
6273 the new 'class' package:
6275 HOL.abs ~> HOL.abs_class.abs
6276 HOL.divide ~> HOL.divide_class.divide
6277 0 ~> HOL.zero_class.zero
6278 1 ~> HOL.one_class.one
6279 op + ~> HOL.plus_class.plus
6280 op - ~> HOL.minus_class.minus
6281 uminus ~> HOL.minus_class.uminus
6282 op * ~> HOL.times_class.times
6283 op < ~> HOL.ord_class.less
6284 op <= > HOL.ord_class.less_eq
6285 Nat.power ~> Power.power_class.power
6286 Nat.size ~> Nat.size_class.size
6287 Numeral.number_of ~> Numeral.number_class.number_of
6288 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
6289 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
6290 Orderings.min ~> Orderings.ord_class.min
6291 Orderings.max ~> Orderings.ord_class.max
6292 Divides.op div ~> Divides.div_class.div
6293 Divides.op mod ~> Divides.div_class.mod
6294 Divides.op dvd ~> Divides.div_class.dvd
6296 INCOMPATIBILITY. Adaptions may be required in the following cases:
6298 a) User-defined constants using any of the names "plus", "minus",
6299 "times", "less" or "less_eq". The standard syntax translations for
6300 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
6303 b) Variables named "plus", "minus", "times", "less", "less_eq"
6304 INCOMPATIBILITY: use more specific names.
6306 c) Permutative equations (e.g. "a + b = b + a")
6307 Since the change of names also changes the order of terms, permutative
6308 rewrite rules may get applied in a different order. Experience shows
6309 that this is rarely the case (only two adaptions in the whole Isabelle
6310 distribution). INCOMPATIBILITY: rewrite proofs
6312 d) ML code directly refering to constant names
6313 This in general only affects hand-written proof tactics, simprocs and
6314 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
6315 Consider using @{const_name} antiquotation.
6317 * New class "default" with associated constant "default".
6319 * Function "sgn" is now overloaded and available on int, real, complex
6320 (and other numeric types), using class "sgn". Two possible defs of
6321 sgn are given as equational assumptions in the classes sgn_if and
6322 sgn_div_norm; ordered_idom now also inherits from sgn_if.
6325 * Locale "partial_order" now unified with class "order" (cf. theory
6326 Orderings), added parameter "less". INCOMPATIBILITY.
6328 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
6329 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
6330 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
6332 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
6333 changed order of proof goals in instance proofs.
6335 * The transitivity reasoner for partial and linear orders is set up
6336 for classes "order" and "linorder". Instances of the reasoner are available
6337 in all contexts importing or interpreting the corresponding locales.
6338 Method "order" invokes the reasoner separately; the reasoner
6339 is also integrated with the Simplifier as a solver. Diagnostic
6340 command 'print_orders' shows the available instances of the reasoner
6341 in the current context.
6343 * Localized monotonicity predicate in theory "Orderings"; integrated
6344 lemmas max_of_mono and min_of_mono with this predicate.
6347 * Formulation of theorem "dense" changed slightly due to integration
6348 with new class dense_linear_order.
6350 * Uniform lattice theory development in HOL.
6352 constants "meet" and "join" now named "inf" and "sup"
6353 constant "Meet" now named "Inf"
6355 classes "meet_semilorder" and "join_semilorder" now named
6356 "lower_semilattice" and "upper_semilattice"
6357 class "lorder" now named "lattice"
6358 class "comp_lat" now named "complete_lattice"
6360 Instantiation of lattice classes allows explicit definitions
6361 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
6363 INCOMPATIBILITY. Theorem renames:
6365 meet_left_le ~> inf_le1
6366 meet_right_le ~> inf_le2
6367 join_left_le ~> sup_ge1
6368 join_right_le ~> sup_ge2
6369 meet_join_le ~> inf_sup_ord
6372 le_meet ~> le_inf_iff
6373 le_join ~> ge_sup_conv
6374 meet_idempotent ~> inf_idem
6375 join_idempotent ~> sup_idem
6376 meet_comm ~> inf_commute
6377 join_comm ~> sup_commute
6378 meet_leI1 ~> le_infI1
6379 meet_leI2 ~> le_infI2
6380 le_joinI1 ~> le_supI1
6381 le_joinI2 ~> le_supI2
6382 meet_assoc ~> inf_assoc
6383 join_assoc ~> sup_assoc
6384 meet_left_comm ~> inf_left_commute
6385 meet_left_idempotent ~> inf_left_idem
6386 join_left_comm ~> sup_left_commute
6387 join_left_idempotent ~> sup_left_idem
6390 le_def_meet ~> le_iff_inf
6391 le_def_join ~> le_iff_sup
6392 join_absorp2 ~> sup_absorb2
6393 join_absorp1 ~> sup_absorb1
6394 meet_absorp1 ~> inf_absorb1
6395 meet_absorp2 ~> inf_absorb2
6396 meet_join_absorp ~> inf_sup_absorb
6397 join_meet_absorp ~> sup_inf_absorb
6398 distrib_join_le ~> distrib_sup_le
6399 distrib_meet_le ~> distrib_inf_le
6401 add_meet_distrib_left ~> add_inf_distrib_left
6402 add_join_distrib_left ~> add_sup_distrib_left
6403 is_join_neg_meet ~> is_join_neg_inf
6404 is_meet_neg_join ~> is_meet_neg_sup
6405 add_meet_distrib_right ~> add_inf_distrib_right
6406 add_join_distrib_right ~> add_sup_distrib_right
6407 add_meet_join_distribs ~> add_sup_inf_distribs
6408 join_eq_neg_meet ~> sup_eq_neg_inf
6409 meet_eq_neg_join ~> inf_eq_neg_sup
6410 add_eq_meet_join ~> add_eq_inf_sup
6411 meet_0_imp_0 ~> inf_0_imp_0
6412 join_0_imp_0 ~> sup_0_imp_0
6413 meet_0_eq_0 ~> inf_0_eq_0
6414 join_0_eq_0 ~> sup_0_eq_0
6415 neg_meet_eq_join ~> neg_inf_eq_sup
6416 neg_join_eq_meet ~> neg_sup_eq_inf
6417 join_eq_if ~> sup_eq_if
6419 mono_meet ~> mono_inf
6420 mono_join ~> mono_sup
6421 meet_bool_eq ~> inf_bool_eq
6422 join_bool_eq ~> sup_bool_eq
6423 meet_fun_eq ~> inf_fun_eq
6424 join_fun_eq ~> sup_fun_eq
6425 meet_set_eq ~> inf_set_eq
6426 join_set_eq ~> sup_set_eq
6427 meet1_iff ~> inf1_iff
6428 meet2_iff ~> inf2_iff
6437 join1_iff ~> sup1_iff
6438 join2_iff ~> sup2_iff
6448 is_meet_Meet ~> is_meet_Inf
6449 Meet_bool_def ~> Inf_bool_def
6450 Meet_fun_def ~> Inf_fun_def
6451 Meet_greatest ~> Inf_greatest
6452 Meet_lower ~> Inf_lower
6453 Meet_set_def ~> Inf_set_def
6456 Sup_bool_eq ~> Sup_bool_def
6457 Sup_fun_eq ~> Sup_fun_def
6458 Sup_set_eq ~> Sup_set_def
6460 listsp_meetI ~> listsp_infI
6461 listsp_meet_eq ~> listsp_inf_eq
6466 * Added syntactic class "size"; overloaded constant "size" now has
6467 type "'a::size ==> bool"
6469 * Internal reorganisation of `size' of datatypes: size theorems
6470 "foo.size" are no longer subsumed by "foo.simps" (but are still
6471 simplification rules by default!); theorems "prod.size" now named
6474 * Class "div" now inherits from class "times" rather than "type".
6477 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
6478 Linorder etc. have disappeared; operations defined in terms of
6479 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
6481 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
6483 * HOL-Word: New extensive library and type for generic, fixed size
6484 machine words, with arithmetic, bit-wise, shifting and rotating
6485 operations, reflection into int, nat, and bool lists, automation for
6486 linear arithmetic (by automatic reflection into nat or int), including
6487 lemmas on overflow and monotonicity. Instantiated to all appropriate
6488 arithmetic type classes, supporting automatic simplification of
6489 numerals on all operations.
6491 * Library/Boolean_Algebra: locales for abstract boolean algebras.
6493 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
6495 * Code generator library theories:
6496 - Code_Integer represents HOL integers by big integer literals in target
6498 - Code_Char represents HOL characters by character literals in target
6500 - Code_Char_chr like Code_Char, but also offers treatment of character
6501 codes; includes Code_Integer.
6502 - Executable_Set allows to generate code for finite sets using lists.
6503 - Executable_Rat implements rational numbers as triples (sign, enumerator,
6505 - Executable_Real implements a subset of real numbers, namly those
6506 representable by rational numbers.
6507 - Efficient_Nat implements natural numbers by integers, which in general will
6508 result in higher efficency; pattern matching with 0/Suc is eliminated;
6509 includes Code_Integer.
6510 - Code_Index provides an additional datatype index which is mapped to
6511 target-language built-in integers.
6512 - Code_Message provides an additional datatype message_string which is isomorphic to
6513 strings; messages are mapped to target-language strings.
6515 * New package for inductive predicates
6517 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
6520 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
6521 for z_1 :: U_1 and ... and z_n :: U_m
6523 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
6526 with full support for type-inference, rather than
6528 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
6530 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
6531 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
6533 inductive "s z_1 ... z_m"
6535 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
6538 For backward compatibility, there is a wrapper allowing inductive
6539 sets to be defined with the new package via
6542 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
6543 for z_1 :: U_1 and ... and z_n :: U_m
6545 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
6551 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
6552 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
6553 for z_1 :: U_1 and ... and z_n :: U_m
6555 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
6556 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
6559 if the additional syntax "p ..." is required.
6561 Numerous examples can be found in the subdirectories src/HOL/Auth,
6562 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
6566 - Since declaration and definition of inductive sets or predicates
6567 is no longer separated, abbreviations involving the newly
6568 introduced sets or predicates must be specified together with the
6569 introduction rules after the 'where' keyword (see above), rather
6570 than before the actual inductive definition.
6572 - The variables in induction and elimination rules are now
6573 quantified in the order of their occurrence in the introduction
6574 rules, rather than in alphabetical order. Since this may break
6575 some proofs, these proofs either have to be repaired, e.g. by
6576 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
6577 statements of the form
6579 case (rule_i a_i_1 ... a_i_{k_i})
6581 or the old order of quantification has to be restored by explicitly adding
6582 meta-level quantifiers in the introduction rules, i.e.
6584 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
6586 - The format of the elimination rules is now
6588 p z_1 ... z_m x_1 ... x_n ==>
6589 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
6594 (x_1, ..., x_n) : s z_1 ... z_m ==>
6595 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
6598 for sets rather than
6600 x : s z_1 ... z_m ==>
6601 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
6604 This may require terms in goals to be expanded to n-tuples
6605 (e.g. using case_tac or simplification with the split_paired_all
6606 rule) before the above elimination rule is applicable.
6608 - The elimination or case analysis rules for (mutually) inductive
6609 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
6610 list of rules "p_1_..._p_k.elims" is no longer available.
6612 * New package "function"/"fun" for general recursive functions,
6613 supporting mutual and nested recursion, definitions in local contexts,
6614 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
6615 for small examples, and the separate tutorial on the function
6616 package. The old recdef "package" is still available as before, but
6617 users are encouraged to use the new package.
6619 * Method "lexicographic_order" automatically synthesizes termination
6620 relations as lexicographic combinations of size measures.
6622 * Case-expressions allow arbitrary constructor-patterns (including
6623 "_") and take their order into account, like in functional
6624 programming. Internally, this is translated into nested
6625 case-expressions; missing cases are added and mapped to the predefined
6626 constant "undefined". In complicated cases printing may no longer show
6627 the original input but the internal form. Lambda-abstractions allow
6628 the same form of pattern matching: "% pat1 => e1 | ..." is an
6629 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
6632 * IntDef: The constant "int :: nat => int" has been removed; now "int"
6633 is an abbreviation for "of_nat :: nat => int". The simplification
6634 rules for "of_nat" have been changed to work like "int" did
6635 previously. Potential INCOMPATIBILITY:
6636 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
6637 - of_nat_diff and of_nat_mult are no longer default simp rules
6639 * Method "algebra" solves polynomial equations over (semi)rings using
6640 Groebner bases. The (semi)ring structure is defined by locales and the
6641 tool setup depends on that generic context. Installing the method for
6642 a specific type involves instantiating the locale and possibly adding
6643 declarations for computation on the coefficients. The method is
6644 already instantiated for natural numbers and for the axiomatic class
6645 of idoms with numerals. See also the paper by Chaieb and Wenzel at
6646 CALCULEMUS 2007 for the general principles underlying this
6647 architecture of context-aware proof-tools.
6649 * Method "ferrack" implements quantifier elimination over
6650 special-purpose dense linear orders using locales (analogous to
6651 "algebra"). The method is already installed for class
6652 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
6655 * Former constant "List.op @" now named "List.append". Use ML
6656 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
6657 circumvent possible incompatibilities when working on ML level.
6659 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
6661 * New function listsum :: 'a list => 'a for arbitrary monoids.
6662 Special syntax: "SUM x <- xs. f x" (and latex variants)
6664 * New syntax for Haskell-like list comprehension (input only), eg.
6665 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
6667 * The special syntax for function "filter" has changed from [x :
6668 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
6669 comprehension syntax, and for uniformity. INCOMPATIBILITY.
6671 * [a..b] is now defined for arbitrary linear orders. It used to be
6672 defined on nat only, as an abbreviation for [a..<Suc b]
6675 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
6677 * New functions "sorted" and "sort" in src/HOL/List.thy.
6679 * New lemma collection field_simps (an extension of ring_simps) for
6680 manipulating (in)equations involving division. Multiplies with all
6681 denominators that can be proved to be non-zero (in equations) or
6682 positive/negative (in inequations).
6684 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
6685 have been improved and renamed to ring_simps, group_simps and
6686 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
6687 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
6689 * Theory Library/Commutative_Ring: switched from recdef to function
6690 package; constants add, mul, pow now curried. Infix syntax for
6691 algebraic operations.
6693 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
6696 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
6699 * HOL/records: generalised field-update to take a function on the
6700 field rather than the new value: r(|A := x|) is translated to A_update
6701 (K x) r The K-combinator that is internally used is called K_record.
6702 INCOMPATIBILITY: Usage of the plain update functions has to be
6705 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
6706 * x = 0, which are required for a semiring. Richer structures do not
6707 inherit from semiring_0 anymore, because this property is a theorem
6708 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
6709 there is more to prove, but this is mostly trivial.
6711 * Class "recpower" is generalized to arbitrary monoids, not just
6712 commutative semirings. INCOMPATIBILITY: may need to incorporate
6713 commutativity or semiring properties additionally.
6715 * Constant "List.list_all2" in List.thy now uses authentic syntax.
6716 INCOMPATIBILITY: translations containing list_all2 may go wrong,
6717 better use 'abbreviation'.
6719 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
6721 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
6722 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
6723 significant changes for setting up numeral syntax for types:
6724 - New constants Numeral.pred and Numeral.succ instead
6725 of former Numeral.bin_pred and Numeral.bin_succ.
6726 - Use integer operations instead of bin_add, bin_mult and so on.
6727 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
6728 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
6730 See src/HOL/Integ/IntArith.thy for an example setup.
6732 * Command 'normal_form' computes the normal form of a term that may
6733 contain free variables. For example ``normal_form "rev [a, b, c]"''
6734 produces ``[b, c, a]'' (without proof). This command is suitable for
6735 heavy-duty computations because the functions are compiled to ML
6736 first. Correspondingly, a method "normalization" is provided. See
6737 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
6739 * Alternative iff syntax "A <-> B" for equality on bool (with priority
6740 25 like -->); output depends on the "iff" print_mode, the default is
6741 "A = B" (with priority 50).
6743 * Relations less (<) and less_eq (<=) are also available on type bool.
6744 Modified syntax to disallow nesting without explicit parentheses,
6745 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
6748 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
6750 * Relation composition operator "op O" now has precedence 75 and binds
6751 stronger than union and intersection. INCOMPATIBILITY.
6753 * The old set interval syntax "{m..n(}" (and relatives) has been
6754 removed. Use "{m..<n}" (and relatives) instead.
6756 * In the context of the assumption "~(s = t)" the Simplifier rewrites
6757 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
6758 ``declare [[simproc del: neq]]''.
6760 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
6763 * Theorem Cons_eq_map_conv no longer declared as "simp".
6765 * Theorem setsum_mult renamed to setsum_right_distrib.
6767 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
6770 * Reimplemented methods "sat" and "satx", with several improvements:
6771 goals no longer need to be stated as "<prems> ==> False", equivalences
6772 (i.e. "=" on type bool) are handled, variable names of the form
6773 "lit_<n>" are no longer reserved, significant speedup.
6775 * Methods "sat" and "satx" can now replay MiniSat proof traces.
6776 zChaff is still supported as well.
6778 * 'inductive' and 'datatype': provide projections of mutual rules,
6779 bundled as foo_bar.inducts;
6781 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
6784 * Library: moved theory Accessible_Part to main HOL.
6786 * Library: added theory Coinductive_List of potentially infinite lists
6787 as greatest fixed-point.
6789 * Library: added theory AssocList which implements (finite) maps as
6792 * Method "evaluation" solves goals (i.e. a boolean expression)
6793 efficiently by compiling it to ML. The goal is "proved" (via an
6794 oracle) if it evaluates to True.
6796 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
6797 also when invoked by the simplifier. This results in the Simplifier
6798 being more powerful on arithmetic goals. INCOMPATIBILITY.
6799 Configuration option fast_arith_split_limit=0 recovers the old
6802 * Support for hex (0x20) and binary (0b1001) numerals.
6804 * New method: reify eqs (t), where eqs are equations for an
6805 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
6806 parameter, computes a term s::'b and a list xs::'a list and proves the
6807 theorem I xs s = t. This is also known as reification or quoting. The
6808 resulting theorem is applied to the subgoal to substitute t with I xs
6809 s. If t is omitted, the subgoal itself is reified.
6811 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
6812 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
6813 where f is supposed to be a computable function (in the sense of code
6814 generattion). The method uses reify to compute s and xs as above then
6815 applies corr_thm and uses normalization by evaluation to "prove" f s =
6816 r and finally gets the theorem t = r, which is again applied to the
6817 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
6819 * Reflection: Automatic reification now handels binding, an example is
6820 available in src/HOL/ex/ReflectionEx.thy
6822 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
6823 command 'statespace' that is similar to 'record', but introduces an
6824 abstract specification based on the locale infrastructure instead of
6825 HOL types. This leads to extra flexibility in composing state spaces,
6826 in particular multiple inheritance and renaming of components.
6831 * Hyperreal: Functions root and sqrt are now defined on negative real
6832 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
6833 Nonnegativity side conditions have been removed from many lemmas, so
6834 that more subgoals may now be solved by simplification; potential
6837 * Real: new type classes formalize real normed vector spaces and
6838 algebras, using new overloaded constants scaleR :: real => 'a => 'a
6839 and norm :: 'a => real.
6841 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
6842 reals into other types. The overloaded constant Reals :: 'a set is now
6843 defined as range of_real; potential INCOMPATIBILITY.
6845 * Real: proper support for ML code generation, including 'quickcheck'.
6846 Reals are implemented as arbitrary precision rationals.
6848 * Hyperreal: Several constants that previously worked only for the
6849 reals have been generalized, so they now work over arbitrary vector
6850 spaces. Type annotations may need to be added in some cases; potential
6853 Infinitesimal :: ('a::real_normed_vector) star set
6854 HFinite :: ('a::real_normed_vector) star set
6855 HInfinite :: ('a::real_normed_vector) star set
6856 approx :: ('a::real_normed_vector) star => 'a star => bool
6857 monad :: ('a::real_normed_vector) star => 'a star set
6858 galaxy :: ('a::real_normed_vector) star => 'a star set
6859 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
6860 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
6861 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
6862 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
6863 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
6864 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
6865 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
6866 sgn :: 'a::real_normed_vector => 'a
6867 exp :: 'a::{recpower,real_normed_field,banach} => 'a
6869 * Complex: Some complex-specific constants are now abbreviations for
6870 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
6871 hnorm. Other constants have been entirely removed in favor of the
6872 polymorphic versions (INCOMPATIBILITY):
6876 HInfinite <-- CInfinite
6877 Infinitesimal <-- CInfinitesimal
6880 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
6881 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
6882 (ns)deriv <-- (ns)cderiv
6887 * Formalisation of ideals and the quotient construction over rings.
6889 * Order and lattice theory no longer based on records.
6892 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
6893 greatest_closed. INCOMPATIBILITY.
6895 * Method algebra is now set up via an attribute. For examples see
6896 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
6897 of algebraic structures.
6899 * Renamed theory CRing to Ring.
6904 * Substantial, yet incomplete support for nominal datatypes (binding
6905 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
6906 src/HOL/Nominal/Examples. Prospective users should consult
6907 http://isabelle.in.tum.de/nominal/
6912 * ML basics: just one true type int, which coincides with IntInf.int
6915 * ML within Isar: antiquotations allow to embed statically-checked
6916 formal entities in the source, referring to the context available at
6917 compile-time. For example:
6919 ML {* @{sort "{zero,one}"} *}
6920 ML {* @{typ "'a => 'b"} *}
6921 ML {* @{term "%x. x"} *}
6922 ML {* @{prop "x == y"} *}
6923 ML {* @{ctyp "'a => 'b"} *}
6924 ML {* @{cterm "%x. x"} *}
6925 ML {* @{cprop "x == y"} *}
6926 ML {* @{thm asm_rl} *}
6927 ML {* @{thms asm_rl} *}
6928 ML {* @{type_name c} *}
6929 ML {* @{type_syntax c} *}
6930 ML {* @{const_name c} *}
6931 ML {* @{const_syntax c} *}
6934 ML {* @{theory Pure} *}
6935 ML {* @{theory_ref} *}
6936 ML {* @{theory_ref Pure} *}
6939 ML {* @{clasimpset} *}
6941 The same works for sources being ``used'' within an Isar context.
6943 * ML in Isar: improved error reporting; extra verbosity with
6944 ML_Context.trace enabled.
6946 * Pure/General/table.ML: the join operations now works via exceptions
6947 DUP/SAME instead of type option. This is simpler in simple cases, and
6948 admits slightly more efficient complex applications.
6950 * Pure: 'advanced' translation functions (parse_translation etc.) now
6951 use Context.generic instead of just theory.
6953 * Pure: datatype Context.generic joins theory/Proof.context and
6954 provides some facilities for code that works in either kind of
6955 context, notably GenericDataFun for uniform theory and proof data.
6957 * Pure: simplified internal attribute type, which is now always
6958 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
6959 local (Proof.context) attributes have been discontinued, while
6960 minimizing code duplication. Thm.rule_attribute and
6961 Thm.declaration_attribute build canonical attributes; see also structure
6962 Context for further operations on Context.generic, notably
6963 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
6964 declarations and definitions.
6966 * Context data interfaces (Theory/Proof/GenericDataFun): removed
6967 name/print, uninitialized data defaults to ad-hoc copy of empty value,
6968 init only required for impure data. INCOMPATIBILITY: empty really need
6969 to be empty (no dependencies on theory content!)
6971 * Pure/kernel: consts certification ignores sort constraints given in
6972 signature declarations. (This information is not relevant to the
6973 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
6974 potential INCOMPATIBILITY.
6976 * Pure: axiomatic type classes are now purely definitional, with
6977 explicit proofs of class axioms and super class relations performed
6978 internally. See Pure/axclass.ML for the main internal interfaces --
6979 notably AxClass.define_class supercedes AxClass.add_axclass, and
6980 AxClass.axiomatize_class/classrel/arity supersede
6981 Sign.add_classes/classrel/arities.
6983 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
6984 global/local versions on theory vs. Proof.context have been
6985 discontinued; Attrib.syntax and Method.syntax have been adapted
6986 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
6987 attributes, methods, etc.
6989 * Pure: several functions of signature "... -> theory -> theory * ..."
6990 have been reoriented to "... -> theory -> ... * theory" in order to
6991 allow natural usage in combination with the ||>, ||>>, |-> and
6992 fold_map combinators.
6994 * Pure: official theorem names (closed derivations) and additional
6995 comments (tags) are now strictly separate. Name hints -- which are
6996 maintained as tags -- may be attached any time without affecting the
6999 * Pure: primitive rule lift_rule now takes goal cterm instead of an
7000 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
7001 achieve the old behaviour.
7003 * Pure: the "Goal" constant is now called "prop", supporting a
7004 slightly more general idea of ``protecting'' meta-level rule
7007 * Pure: Logic.(un)varify only works in a global context, which is now
7008 enforced instead of silently assumed. INCOMPATIBILITY, may use
7009 Logic.legacy_(un)varify as temporary workaround.
7011 * Pure: structure Name provides scalable operations for generating
7012 internal variable names, notably Name.variants etc. This replaces
7013 some popular functions from term.ML:
7015 Term.variant -> Name.variant
7016 Term.variantlist -> Name.variant_list
7017 Term.invent_names -> Name.invent_list
7019 Note that low-level renaming rarely occurs in new code -- operations
7020 from structure Variable are used instead (see below).
7022 * Pure: structure Variable provides fundamental operations for proper
7023 treatment of fixed/schematic variables in a context. For example,
7024 Variable.import introduces fixes for schematics of given facts and
7025 Variable.export reverses the effect (up to renaming) -- this replaces
7026 various freeze_thaw operations.
7028 * Pure: structure Goal provides simple interfaces for
7029 init/conclude/finish and tactical prove operations (replacing former
7030 Tactic.prove). Goal.prove is the canonical way to prove results
7031 within a given context; Goal.prove_global is a degraded version for
7032 theory level goals, including a global Drule.standard. Note that
7033 OldGoals.prove_goalw_cterm has long been obsolete, since it is
7034 ill-behaved in a local proof context (e.g. with local fixes/assumes or
7035 in a locale context).
7037 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
7038 and type checking (Syntax.check_term etc.), with common combinations
7039 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
7040 which are considered legacy and await removal.
7042 * Pure/Syntax: generic interfaces for type unchecking
7043 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
7044 with common combinations (Syntax.pretty_term, Syntax.string_of_term
7045 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
7046 available for convenience, but refer to the very same operations using
7047 a mere theory instead of a full context.
7049 * Isar: simplified treatment of user-level errors, using exception
7050 ERROR of string uniformly. Function error now merely raises ERROR,
7051 without any side effect on output channels. The Isar toplevel takes
7052 care of proper display of ERROR exceptions. ML code may use plain
7053 handle/can/try; cat_error may be used to concatenate errors like this:
7055 ... handle ERROR msg => cat_error msg "..."
7057 Toplevel ML code (run directly or through the Isar toplevel) may be
7058 embedded into the Isar toplevel with exception display/debug like
7061 Isar.toplevel (fn () => ...)
7063 INCOMPATIBILITY, removed special transform_error facilities, removed
7064 obsolete variants of user-level exceptions (ERROR_MESSAGE,
7065 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
7066 -- use plain ERROR instead.
7068 * Isar: theory setup now has type (theory -> theory), instead of a
7069 list. INCOMPATIBILITY, may use #> to compose setup functions.
7071 * Isar: ML toplevel pretty printer for type Proof.context, subject to
7072 ProofContext.debug/verbose flags.
7074 * Isar: Toplevel.theory_to_proof admits transactions that modify the
7075 theory before entering a proof state. Transactions now always see a
7076 quasi-functional intermediate checkpoint, both in interactive and
7079 * Isar: simplified interfaces for outer syntax. Renamed
7080 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
7081 OuterSyntax.add_parsers -- this functionality is now included in
7082 OuterSyntax.command etc. INCOMPATIBILITY.
7084 * Simplifier: the simpset of a running simplification process now
7085 contains a proof context (cf. Simplifier.the_context), which is the
7086 very context that the initial simpset has been retrieved from (by
7087 simpset_of/local_simpset_of). Consequently, all plug-in components
7088 (solver, looper etc.) may depend on arbitrary proof data.
7090 * Simplifier.inherit_context inherits the proof context (plus the
7091 local bounds) of the current simplification process; any simproc
7092 etc. that calls the Simplifier recursively should do this! Removed
7093 former Simplifier.inherit_bounds, which is already included here --
7094 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
7095 specify an explicit context using Simplifier.context/theory_context.
7097 * Simplifier/Classical Reasoner: more abstract interfaces
7098 change_simpset/claset for modifying the simpset/claset reference of a
7099 theory; raw versions simpset/claset_ref etc. have been discontinued --
7102 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
7108 * settings: the default heap location within ISABELLE_HOME_USER now
7109 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
7110 Isabelle installations.
7112 * isabelle-process: option -S (secure mode) disables some critical
7113 operations, notably runtime compilation and evaluation of ML source
7116 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
7118 * Support for parallel execution, using native multicore support of
7119 Poly/ML 5.1. The theory loader exploits parallelism when processing
7120 independent theories, according to the given theory header
7121 specifications. The maximum number of worker threads is specified via
7122 usedir option -M or the "max-threads" setting in Proof General. A
7123 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
7124 to 6 on a 8-core machine. User-code needs to observe certain
7125 guidelines for thread-safe programming, see appendix A in the Isar
7126 Implementation manual.
7130 New in Isabelle2005 (October 2005)
7131 ----------------------------------
7135 * Theory headers: the new header syntax for Isar theories is
7138 imports <theory1> ... <theoryN>
7139 uses <file1> ... <fileM>
7142 where the 'uses' part is optional. The previous syntax
7144 theory <name> = <theory1> + ... + <theoryN>:
7146 will disappear in the next release. Use isatool fixheaders to convert
7147 existing theory files. Note that there is no change in ancient
7148 non-Isar theories now, but these will disappear soon.
7150 * Theory loader: parent theories can now also be referred to via
7151 relative and absolute paths.
7153 * Command 'find_theorems' searches for a list of criteria instead of a
7154 list of constants. Known criteria are: intro, elim, dest, name:string,
7155 simp:term, and any term. Criteria can be preceded by '-' to select
7156 theorems that do not match. Intro, elim, dest select theorems that
7157 match the current goal, name:s selects theorems whose fully qualified
7158 name contain s, and simp:term selects all simplification rules whose
7159 lhs match term. Any other term is interpreted as pattern and selects
7160 all theorems matching the pattern. Available in ProofGeneral under
7161 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
7163 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
7165 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
7166 matching the current goal as introduction rule and not having "HOL."
7167 in their name (i.e. not being defined in theory HOL).
7169 * Command 'thms_containing' has been discontinued in favour of
7170 'find_theorems'; INCOMPATIBILITY.
7172 * Communication with Proof General is now 8bit clean, which means that
7173 Unicode text in UTF-8 encoding may be used within theory texts (both
7174 formal and informal parts). Cf. option -U of the Isabelle Proof
7175 General interface. Here are some simple examples (cf. src/HOL/ex):
7177 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
7178 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
7180 * Improved efficiency of the Simplifier and, to a lesser degree, the
7181 Classical Reasoner. Typical big applications run around 2 times
7185 *** Document preparation ***
7187 * Commands 'display_drafts' and 'print_drafts' perform simple output
7188 of raw sources. Only those symbols that do not require additional
7189 LaTeX packages (depending on comments in isabellesym.sty) are
7190 displayed properly, everything else is left verbatim. isatool display
7191 and isatool print are used as front ends (these are subject to the
7192 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
7194 * Command tags control specific markup of certain regions of text,
7195 notably folding and hiding. Predefined tags include "theory" (for
7196 theory begin and end), "proof" for proof commands, and "ML" for
7197 commands involving ML code; the additional tags "visible" and
7198 "invisible" are unused by default. Users may give explicit tag
7199 specifications in the text, e.g. ''by %invisible (auto)''. The
7200 interpretation of tags is determined by the LaTeX job during document
7201 preparation: see option -V of isatool usedir, or options -n and -t of
7202 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
7205 Several document versions may be produced at the same time via isatool
7206 usedir (the generated index.html will link all of them). Typical
7207 specifications include ''-V document=theory,proof,ML'' to present
7208 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
7209 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
7210 these parts without any formal replacement text. The Isabelle site
7211 default settings produce ''document'' and ''outline'' versions as
7214 * Several new antiquotations:
7216 @{term_type term} prints a term with its type annotated;
7218 @{typeof term} prints the type of a term;
7220 @{const const} is the same as @{term const}, but checks that the
7221 argument is a known logical constant;
7223 @{term_style style term} and @{thm_style style thm} print a term or
7224 theorem applying a "style" to it
7228 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
7229 definitions, equations, inequations etc., 'concl' printing only the
7230 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
7231 to print the specified premise. TermStyle.add_style provides an ML
7232 interface for introducing further styles. See also the "LaTeX Sugar"
7233 document practical applications. The ML antiquotation prints
7234 type-checked ML expressions verbatim.
7236 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
7237 and 'text' support optional locale specification '(in loc)', which
7238 specifies the default context for interpreting antiquotations. For
7239 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
7241 * Option 'locale=NAME' of antiquotations specifies an alternative
7242 context interpreting the subsequent argument. For example: @{thm
7243 [locale=lattice] inf_assoc}.
7245 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
7248 * Proper output of antiquotations for theory commands involving a
7249 proof context (such as 'locale' or 'theorem (in loc) ...').
7251 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
7252 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
7254 * isatool usedir: new option -C (default true) controls whether option
7255 -D should include a copy of the original document directory; -C false
7256 prevents unwanted effects such as copying of administrative CVS data.
7261 * Considerably improved version of 'constdefs' command. Now performs
7262 automatic type-inference of declared constants; additional support for
7263 local structure declarations (cf. locales and HOL records), see also
7264 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
7265 sequential dependencies of definitions within a single 'constdefs'
7266 section; moreover, the declared name needs to be an identifier. If
7267 all fails, consider to fall back on 'consts' and 'defs' separately.
7269 * Improved indexed syntax and implicit structures. First of all,
7270 indexed syntax provides a notational device for subscripted
7271 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
7272 expressions. Secondly, in a local context with structure
7273 declarations, number indexes \<^sub>n or the empty index (default
7274 number 1) refer to a certain fixed variable implicitly; option
7275 show_structs controls printing of implicit structures. Typical
7276 applications of these concepts involve record types and locales.
7278 * New command 'no_syntax' removes grammar declarations (and
7279 translations) resulting from the given syntax specification, which is
7280 interpreted in the same manner as for the 'syntax' command.
7282 * 'Advanced' translation functions (parse_translation etc.) may depend
7283 on the signature of the theory context being presently used for
7284 parsing/printing, see also isar-ref manual.
7286 * Improved 'oracle' command provides a type-safe interface to turn an
7287 ML expression of type theory -> T -> term into a primitive rule of
7288 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
7289 is already included here); see also FOL/ex/IffExample.thy;
7292 * axclass: name space prefix for class "c" is now "c_class" (was "c"
7293 before); "cI" is no longer bound, use "c.intro" instead.
7294 INCOMPATIBILITY. This change avoids clashes of fact bindings for
7295 axclasses vs. locales.
7297 * Improved internal renaming of symbolic identifiers -- attach primes
7298 instead of base 26 numbers.
7300 * New flag show_question_marks controls printing of leading question
7301 marks in schematic variable names.
7303 * In schematic variable names, *any* symbol following \<^isub> or
7304 \<^isup> is now treated as part of the base name. For example, the
7305 following works without printing of awkward ".0" indexes:
7307 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
7310 * Inner syntax includes (*(*nested*) comments*).
7312 * Pretty printer now supports unbreakable blocks, specified in mixfix
7313 annotations as "(00...)".
7315 * Clear separation of logical types and nonterminals, where the latter
7316 may only occur in 'syntax' specifications or type abbreviations.
7317 Before that distinction was only partially implemented via type class
7318 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
7319 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
7320 exotic syntax specifications may require further adaption
7321 (e.g. Cube/Cube.thy).
7323 * Removed obsolete type class "logic", use the top sort {} instead.
7324 Note that non-logical types should be declared as 'nonterminals'
7325 rather than 'types'. INCOMPATIBILITY for new object-logic
7328 * Attributes 'induct' and 'cases': type or set names may now be
7329 locally fixed variables as well.
7331 * Simplifier: can now control the depth to which conditional rewriting
7332 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
7335 * Simplifier: simplification procedures may now take the current
7336 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
7337 interface), which is very useful for calling the Simplifier
7338 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
7339 is gone -- use prems_of_ss on the simpset instead. Moreover, the
7340 low-level mk_simproc no longer applies Logic.varify internally, to
7341 allow for use in a context of fixed variables.
7343 * thin_tac now works even if the assumption being deleted contains !!
7344 or ==>. More generally, erule now works even if the major premise of
7345 the elimination rule contains !! or ==>.
7347 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
7349 * Reorganized bootstrapping of the Pure theories; CPure is now derived
7350 from Pure, which contains all common declarations already. Both
7351 theories are defined via plain Isabelle/Isar .thy files.
7352 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
7353 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
7354 use isatool fixcpure to adapt your theory and ML sources.
7356 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
7357 selections of theorems in named facts via index ranges.
7359 * 'print_theorems': in theory mode, really print the difference
7360 wrt. the last state (works for interactive theory development only),
7361 in proof mode print all local facts (cf. 'print_facts');
7363 * 'hide': option '(open)' hides only base names.
7365 * More efficient treatment of intermediate checkpoints in interactive
7368 * Code generator is now invoked via code_module (incremental code
7369 generation) and code_library (modular code generation, ML structures
7370 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
7371 must be quoted when used as identifiers.
7373 * New 'value' command for reading, evaluating and printing terms using
7374 the code generator. INCOMPATIBILITY: command keyword 'value' must be
7375 quoted when used as identifier.
7380 * New commands for the interpretation of locale expressions in
7381 theories (1), locales (2) and proof contexts (3). These generate
7382 proof obligations from the expression specification. After the
7383 obligations have been discharged, theorems of the expression are added
7384 to the theory, target locale or proof context. The synopsis of the
7385 commands is a follows:
7387 (1) interpretation expr inst
7388 (2) interpretation target < expr
7389 (3) interpret expr inst
7391 Interpretation in theories and proof contexts require a parameter
7392 instantiation of terms from the current context. This is applied to
7393 specifications and theorems of the interpreted expression.
7394 Interpretation in locales only permits parameter renaming through the
7395 locale expression. Interpretation is smart in that interpretations
7396 that are active already do not occur in proof obligations, neither are
7397 instantiated theorems stored in duplicate. Use 'print_interps' to
7398 inspect active interpretations of a particular locale. For details,
7399 see the Isar Reference manual. Examples can be found in
7400 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
7402 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
7403 'interpret' instead.
7405 * New context element 'constrains' for adding type constraints to
7408 * Context expressions: renaming of parameters with syntax
7411 * Locale declaration: 'includes' disallowed.
7413 * Proper static binding of attribute syntax -- i.e. types / terms /
7414 facts mentioned as arguments are always those of the locale definition
7415 context, independently of the context of later invocations. Moreover,
7416 locale operations (renaming and type / term instantiation) are applied
7417 to attribute arguments as expected.
7419 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
7420 actual attributes; rare situations may require Attrib.attribute to
7421 embed those attributes into Attrib.src that lack concrete syntax.
7422 Attribute implementations need to cooperate properly with the static
7423 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
7424 Attrib.XXX_thm etc. already do the right thing without further
7425 intervention. Only unusual applications -- such as "where" or "of"
7426 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
7427 on the context and the facts involved -- may have to assign parsed
7428 values to argument tokens explicitly.
7430 * Changed parameter management in theorem generation for long goal
7431 statements with 'includes'. INCOMPATIBILITY: produces a different
7432 theorem statement in rare situations.
7434 * Locale inspection command 'print_locale' omits notes elements. Use
7435 'print_locale!' to have them included in the output.
7440 * Provers/hypsubst.ML: improved version of the subst method, for
7441 single-step rewriting: it now works in bound variable contexts. New is
7442 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
7443 rewrite a different subterm than the original subst method, which is
7444 still available as 'simplesubst'.
7446 * Provers/quasi.ML: new transitivity reasoners for transitivity only
7449 * Provers/trancl.ML: new transitivity reasoner for transitive and
7450 reflexive-transitive closure of relations.
7452 * Provers/blast.ML: new reference depth_limit to make blast's depth
7453 limit (previously hard-coded with a value of 20) user-definable.
7455 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
7456 is peformed already. Object-logics merely need to finish their
7457 initial simpset configuration as before. INCOMPATIBILITY.
7462 * Symbolic syntax of Hilbert Choice Operator is now as follows:
7465 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
7467 The symbol \<some> is displayed as the alternative epsilon of LaTeX
7468 and x-symbol; use option '-m epsilon' to get it actually printed.
7469 Moreover, the mathematically important symbolic identifier \<epsilon>
7470 becomes available as variable, constant etc. INCOMPATIBILITY,
7472 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
7473 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
7474 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
7475 support corresponding Isar calculations.
7477 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
7480 * theory SetInterval: changed the syntax for open intervals:
7489 The old syntax is still supported but will disappear in the next
7490 release. For conversion use the following Emacs search and replace
7491 patterns (these are not perfect but work quite well):
7493 {)\([^\.]*\)\.\. -> {\1<\.\.}
7494 \.\.\([^(}]*\)(} -> \.\.<\1}
7496 * Theory Commutative_Ring (in Library): method comm_ring for proving
7497 equalities in commutative rings; method 'algebra' provides a generic
7500 * Theory Finite_Set: changed the syntax for 'setsum', summation over
7501 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
7502 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
7505 Some new syntax forms are available:
7507 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
7508 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
7509 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
7510 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
7512 The latter form "\<Sum>x < k. e" used to be based on a separate
7513 function "Summation", which has been discontinued.
7515 * theory Finite_Set: in structured induction proofs, the insert case
7516 is now 'case (insert x F)' instead of the old counterintuitive 'case
7519 * The 'refute' command has been extended to support a much larger
7520 fragment of HOL, including axiomatic type classes, constdefs and
7521 typedefs, inductive datatypes and recursion.
7523 * New tactics 'sat' and 'satx' to prove propositional tautologies.
7524 Requires zChaff with proof generation to be installed. See
7525 HOL/ex/SAT_Examples.thy for examples.
7527 * Datatype induction via method 'induct' now preserves the name of the
7528 induction variable. For example, when proving P(xs::'a list) by
7529 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
7530 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
7531 in unstructured proof scripts.
7533 * Reworked implementation of records. Improved scalability for
7534 records with many fields, avoiding performance problems for type
7535 inference. Records are no longer composed of nested field types, but
7536 of nested extension types. Therefore the record type only grows linear
7537 in the number of extensions and not in the number of fields. The
7538 top-level (users) view on records is preserved. Potential
7539 INCOMPATIBILITY only in strange cases, where the theory depends on the
7540 old record representation. The type generated for a record is called
7541 <record_name>_ext_type.
7543 Flag record_quick_and_dirty_sensitive can be enabled to skip the
7544 proofs triggered by a record definition or a simproc (if
7545 quick_and_dirty is enabled). Definitions of large records can take
7548 New simproc record_upd_simproc for simplification of multiple record
7549 updates enabled by default. Moreover, trivial updates are also
7550 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
7551 occasionally, since simplification is more powerful by default.
7553 * typedef: proper support for polymorphic sets, which contain extra
7554 type-variables in the term.
7556 * Simplifier: automatically reasons about transitivity chains
7557 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
7558 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
7559 old proofs break occasionally as simplification may now solve more
7560 goals than previously.
7562 * Simplifier: converts x <= y into x = y if assumption y <= x is
7563 present. Works for all partial orders (class "order"), in particular
7564 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
7567 * Simplifier: new simproc for "let x = a in f x". If a is a free or
7568 bound variable or a constant then the let is unfolded. Otherwise
7569 first a is simplified to b, and then f b is simplified to g. If
7570 possible we abstract b from g arriving at "let x = b in h x",
7571 otherwise we unfold the let and arrive at g. The simproc can be
7572 enabled/disabled by the reference use_let_simproc. Potential
7573 INCOMPATIBILITY since simplification is more powerful by default.
7575 * Classical reasoning: the meson method now accepts theorems as arguments.
7577 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
7578 jobs to provide advice on the provability of subgoals.
7580 * Theory OrderedGroup and Ring_and_Field: various additions and
7581 improvements to faciliate calculations involving equalities and
7584 The following theorems have been eliminated or modified
7587 abs_eq now named abs_of_nonneg
7588 abs_of_ge_0 now named abs_of_nonneg
7589 abs_minus_eq now named abs_of_nonpos
7590 imp_abs_id now named abs_of_nonneg
7591 imp_abs_neg_id now named abs_of_nonpos
7592 mult_pos now named mult_pos_pos
7593 mult_pos_le now named mult_nonneg_nonneg
7594 mult_pos_neg_le now named mult_nonneg_nonpos
7595 mult_pos_neg2_le now named mult_nonneg_nonpos2
7596 mult_neg now named mult_neg_neg
7597 mult_neg_le now named mult_nonpos_nonpos
7599 * The following lemmas in Ring_and_Field have been added to the simplifier:
7602 not_square_less_zero
7604 The following lemmas have been deleted from Real/RealPow:
7614 * Theory Parity: added rules for simplifying exponents.
7618 The following theorems have been eliminated or modified
7621 list_all_Nil now named list_all.simps(1)
7622 list_all_Cons now named list_all.simps(2)
7623 list_all_conv now named list_all_iff
7624 set_mem_eq now named mem_iff
7626 * Theories SetsAndFunctions and BigO (see HOL/Library) support
7627 asymptotic "big O" calculations. See the notes in BigO.thy.
7632 * Theory RealDef: better support for embedding natural numbers and
7633 integers in the reals.
7635 The following theorems have been eliminated or modified
7638 exp_ge_add_one_self now requires no hypotheses
7639 real_of_int_add reversed direction of equality (use [symmetric])
7640 real_of_int_minus reversed direction of equality (use [symmetric])
7641 real_of_int_diff reversed direction of equality (use [symmetric])
7642 real_of_int_mult reversed direction of equality (use [symmetric])
7644 * Theory RComplete: expanded support for floor and ceiling functions.
7646 * Theory Ln is new, with properties of the natural logarithm
7648 * Hyperreal: There is a new type constructor "star" for making
7649 nonstandard types. The old type names are now type synonyms:
7653 hcomplex = complex star
7655 * Hyperreal: Many groups of similarly-defined constants have been
7656 replaced by polymorphic versions (INCOMPATIBILITY):
7658 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
7660 starset <-- starsetNat, starsetC
7661 *s* <-- *sNat*, *sc*
7662 starset_n <-- starsetNat_n, starsetC_n
7663 *sn* <-- *sNatn*, *scn*
7664 InternalSets <-- InternalNatSets, InternalCSets
7666 starfun <-- starfun{Nat,Nat2,C,RC,CR}
7667 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
7668 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
7669 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
7670 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
7672 * Hyperreal: Many type-specific theorems have been removed in favor of
7673 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
7675 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
7676 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
7677 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
7678 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
7679 right_minus <-- hypreal_add_minus
7680 left_minus <-- {hypreal,hcomplex}_add_minus_left
7681 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
7682 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
7683 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
7684 mult_1_right <-- hcomplex_mult_one_right
7685 mult_zero_left <-- hcomplex_mult_zero_left
7686 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
7687 right_distrib <-- hypnat_add_mult_distrib2
7688 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
7689 right_inverse <-- hypreal_mult_inverse
7690 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
7691 order_refl <-- {hypreal,hypnat}_le_refl
7692 order_trans <-- {hypreal,hypnat}_le_trans
7693 order_antisym <-- {hypreal,hypnat}_le_anti_sym
7694 order_less_le <-- {hypreal,hypnat}_less_le
7695 linorder_linear <-- {hypreal,hypnat}_le_linear
7696 add_left_mono <-- {hypreal,hypnat}_add_left_mono
7697 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
7698 add_nonneg_nonneg <-- hypreal_le_add_order
7700 * Hyperreal: Separate theorems having to do with type-specific
7701 versions of constants have been merged into theorems that apply to the
7702 new polymorphic constants (INCOMPATIBILITY):
7704 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
7705 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
7706 STAR_Un <-- {STAR,NatStar,STARC}_Un
7707 STAR_Int <-- {STAR,NatStar,STARC}_Int
7708 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
7709 STAR_subset <-- {STAR,NatStar,STARC}_subset
7710 STAR_mem <-- {STAR,NatStar,STARC}_mem
7711 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
7712 STAR_diff <-- {STAR,STARC}_diff
7713 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
7714 STARC_hcomplex_of_complex}_image_subset
7715 starset_n_Un <-- starset{Nat,C}_n_Un
7716 starset_n_Int <-- starset{Nat,C}_n_Int
7717 starset_n_Compl <-- starset{Nat,C}_n_Compl
7718 starset_n_diff <-- starset{Nat,C}_n_diff
7719 InternalSets_Un <-- Internal{Nat,C}Sets_Un
7720 InternalSets_Int <-- Internal{Nat,C}Sets_Int
7721 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
7722 InternalSets_diff <-- Internal{Nat,C}Sets_diff
7723 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
7724 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
7725 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
7726 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
7727 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
7728 starfun <-- starfun{Nat,Nat2,C,RC,CR}
7729 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
7730 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
7731 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
7732 starfun_diff <-- starfun{C,RC,CR}_diff
7733 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
7734 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
7735 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
7736 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
7737 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
7738 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
7739 starfun_Id <-- starfunC_Id
7740 starfun_approx <-- starfun{Nat,CR}_approx
7741 starfun_capprox <-- starfun{C,RC}_capprox
7742 starfun_abs <-- starfunNat_rabs
7743 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
7744 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
7745 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
7746 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
7747 starfun_add_capprox <-- starfun{C,RC}_add_capprox
7748 starfun_add_approx <-- starfunCR_add_approx
7749 starfun_inverse_inverse <-- starfunC_inverse_inverse
7750 starfun_divide <-- starfun{C,CR,RC}_divide
7751 starfun_n <-- starfun{Nat,C}_n
7752 starfun_n_mult <-- starfun{Nat,C}_n_mult
7753 starfun_n_add <-- starfun{Nat,C}_n_add
7754 starfun_n_add_minus <-- starfunNat_n_add_minus
7755 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
7756 starfun_n_minus <-- starfun{Nat,C}_n_minus
7757 starfun_n_eq <-- starfun{Nat,C}_n_eq
7759 star_n_add <-- {hypreal,hypnat,hcomplex}_add
7760 star_n_minus <-- {hypreal,hcomplex}_minus
7761 star_n_diff <-- {hypreal,hcomplex}_diff
7762 star_n_mult <-- {hypreal,hcomplex}_mult
7763 star_n_inverse <-- {hypreal,hcomplex}_inverse
7764 star_n_le <-- {hypreal,hypnat}_le
7765 star_n_less <-- {hypreal,hypnat}_less
7766 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
7767 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
7768 star_n_abs <-- hypreal_hrabs
7769 star_n_divide <-- hcomplex_divide
7771 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
7772 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
7773 star_of_diff <-- hypreal_of_real_diff
7774 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
7775 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
7776 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
7777 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
7778 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
7779 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
7780 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
7781 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
7782 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
7783 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
7784 star_of_number_of <-- {hypreal,hcomplex}_number_of
7785 star_of_number_less <-- number_of_less_hypreal_of_real_iff
7786 star_of_number_le <-- number_of_le_hypreal_of_real_iff
7787 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
7788 star_of_less_number <-- hypreal_of_real_less_number_of_iff
7789 star_of_le_number <-- hypreal_of_real_le_number_of_iff
7790 star_of_power <-- hypreal_of_real_power
7791 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
7793 * Hyperreal: new method "transfer" that implements the transfer
7794 principle of nonstandard analysis. With a subgoal that mentions
7795 nonstandard types like "'a star", the command "apply transfer"
7796 replaces it with an equivalent one that mentions only standard types.
7797 To be successful, all free variables must have standard types; non-
7798 standard variables must have explicit universal quantifiers.
7800 * Hyperreal: A theory of Taylor series.
7805 * Discontinued special version of 'constdefs' (which used to support
7806 continuous functions) in favor of the general Pure one with full
7809 * New simplification procedure for solving continuity conditions; it
7810 is much faster on terms with many nested lambda abstractions (cubic
7811 instead of exponential time).
7813 * New syntax for domain package: selector names are now optional.
7814 Parentheses should be omitted unless argument is lazy, for example:
7816 domain 'a stream = cons "'a" (lazy "'a stream")
7818 * New command 'fixrec' for defining recursive functions with pattern
7819 matching; defining multiple functions with mutual recursion is also
7820 supported. Patterns may include the constants cpair, spair, up, sinl,
7821 sinr, or any data constructor defined by the domain package. The given
7822 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
7823 syntax and examples.
7825 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
7826 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
7827 but the proof obligation additionally includes an admissibility
7828 requirement. The packages generate instances of class cpo or pcpo,
7829 with continuity and strictness theorems for Rep and Abs.
7831 * HOLCF: Many theorems have been renamed according to a more standard naming
7832 scheme (INCOMPATIBILITY):
7834 foo_inject: "foo$x = foo$y ==> x = y"
7835 foo_eq: "(foo$x = foo$y) = (x = y)"
7836 foo_less: "(foo$x << foo$y) = (x << y)"
7837 foo_strict: "foo$UU = UU"
7838 foo_defined: "... ==> foo$x ~= UU"
7839 foo_defined_iff: "(foo$x = UU) = (x = UU)"
7844 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
7845 including the First Isomorphism Theorem (on quotienting by the kernel
7848 * ZF/Simplifier: install second copy of type solver that actually
7849 makes use of TC rules declared to Isar proof contexts (or locales);
7850 the old version is still required for ML proof scripts.
7855 * Converted to Isar theory format; use locales instead of axiomatic
7861 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
7864 * Pure/library.ML no longer defines its own option datatype, but uses
7865 that of the SML basis, which has constructors NONE and SOME instead of
7866 None and Some, as well as exception Option.Option instead of OPTION.
7867 The functions the, if_none, is_some, is_none have been adapted
7868 accordingly, while Option.map replaces apsome.
7870 * Pure/library.ML: the exception LIST has been given up in favour of
7871 the standard exceptions Empty and Subscript, as well as
7872 Library.UnequalLengths. Function like Library.hd and Library.tl are
7873 superceded by the standard hd and tl functions etc.
7875 A number of basic list functions are no longer exported to the ML
7876 toplevel, as they are variants of predefined functions. The following
7877 suggests how one can translate existing code:
7879 rev_append xs ys = List.revAppend (xs, ys)
7880 nth_elem (i, xs) = List.nth (xs, i)
7881 last_elem xs = List.last xs
7882 flat xss = List.concat xss
7883 seq fs = List.app fs
7884 partition P xs = List.partition P xs
7885 mapfilter f xs = List.mapPartial f xs
7887 * Pure/library.ML: several combinators for linear functional
7888 transformations, notably reverse application and composition:
7891 (x, y) |-> f f #-> g
7893 * Pure/library.ML: introduced/changed precedence of infix operators:
7895 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
7897 infix 3 o oo ooo oooo;
7898 infix 4 ~~ upto downto;
7900 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
7903 * Pure/library.ML: natural list combinators fold, fold_rev, and
7904 fold_map support linear functional transformations and nesting. For
7907 fold f [x1, ..., xN] y =
7908 y |> f x1 |> ... |> f xN
7910 (fold o fold) f [xs1, ..., xsN] y =
7911 y |> fold f xs1 |> ... |> fold f xsN
7913 fold f [x1, ..., xN] =
7916 (fold o fold) f [xs1, ..., xsN] =
7917 fold f xs1 #> ... #> fold f xsN
7919 * Pure/library.ML: the following selectors on type 'a option are
7922 the: 'a option -> 'a (*partial*)
7923 these: 'a option -> 'a where 'a = 'b list
7924 the_default: 'a -> 'a option -> 'a
7925 the_list: 'a option -> 'a list
7927 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
7928 basic operations for association lists, following natural argument
7929 order; moreover the explicit equality predicate passed here avoids
7930 potentially expensive polymorphic runtime equality checks.
7931 The old functions may be expressed as follows:
7933 assoc = uncurry (AList.lookup (op =))
7934 assocs = these oo AList.lookup (op =)
7935 overwrite = uncurry (AList.update (op =)) o swap
7937 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
7939 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
7940 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
7942 replacing make_keylist and keyfilter (occassionally used)
7945 make_keylist = AList.make
7946 keyfilter = AList.find (op =)
7948 * eq_fst and eq_snd now take explicit equality parameter, thus
7949 avoiding eqtypes. Naive rewrites:
7951 eq_fst = eq_fst (op =)
7952 eq_snd = eq_snd (op =)
7954 * Removed deprecated apl and apr (rarely used).
7957 apl (n, op) =>>= curry op n
7958 apr (op, m) =>>= fn n => op (n, m)
7960 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
7961 provides a reasonably efficient light-weight implementation of sets as
7964 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
7965 few new operations; existing lookup and update are now curried to
7966 follow natural argument order (for use with fold etc.);
7967 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
7969 * Pure/General: output via the Isabelle channels of
7970 writeln/warning/error etc. is now passed through Output.output, with a
7971 hook for arbitrary transformations depending on the print_mode
7972 (cf. Output.add_mode -- the first active mode that provides a output
7973 function wins). Already formatted output may be embedded into further
7974 text via Output.raw; the result of Pretty.string_of/str_of and derived
7975 functions (string_of_term/cterm/thm etc.) is already marked raw to
7976 accommodate easy composition of diagnostic messages etc. Programmers
7977 rarely need to care about Output.output or Output.raw at all, with
7978 some notable exceptions: Output.output is required when bypassing the
7979 standard channels (writeln etc.), or in token translations to produce
7980 properly formatted results; Output.raw is required when capturing
7981 already output material that will eventually be presented to the user
7982 a second time. For the default print mode, both Output.output and
7983 Output.raw have no effect.
7985 * Pure/General: Output.time_accumulator NAME creates an operator ('a
7986 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
7987 cumulative results are displayed at the end of a batch session.
7989 * Pure/General: File.sysify_path and File.quote_sysify path have been
7990 replaced by File.platform_path and File.shell_path (with appropriate
7991 hooks). This provides a clean interface for unusual systems where the
7992 internal and external process view of file names are different.
7994 * Pure: more efficient orders for basic syntactic entities: added
7995 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
7996 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
7997 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
7998 orders now -- potential INCOMPATIBILITY for code that depends on a
7999 particular order for Symtab.keys, Symtab.dest, etc. (consider using
8000 Library.sort_strings on result).
8002 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
8003 fold_types traverse types/terms from left to right, observing natural
8004 argument order. Supercedes previous foldl_XXX versions, add_frees,
8005 add_vars etc. have been adapted as well: INCOMPATIBILITY.
8007 * Pure: name spaces have been refined, with significant changes of the
8008 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
8009 to extern(_table). The plain name entry path is superceded by a
8010 general 'naming' context, which also includes the 'policy' to produce
8011 a fully qualified name and external accesses of a fully qualified
8012 name; NameSpace.extend is superceded by context dependent
8013 Sign.declare_name. Several theory and proof context operations modify
8014 the naming context. Especially note Theory.restore_naming and
8015 ProofContext.restore_naming to get back to a sane state; note that
8016 Theory.add_path is no longer sufficient to recover from
8017 Theory.absolute_path in particular.
8019 * Pure: new flags short_names (default false) and unique_names
8020 (default true) for controlling output of qualified names. If
8021 short_names is set, names are printed unqualified. If unique_names is
8022 reset, the name prefix is reduced to the minimum required to achieve
8023 the original result when interning again, even if there is an overlap
8024 with earlier declarations.
8026 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
8027 now 'extend', and 'merge' gets an additional Pretty.pp argument
8028 (useful for printing error messages). INCOMPATIBILITY.
8030 * Pure: major reorganization of the theory context. Type Sign.sg and
8031 Theory.theory are now identified, referring to the universal
8032 Context.theory (see Pure/context.ML). Actual signature and theory
8033 content is managed as theory data. The old code and interfaces were
8034 spread over many files and structures; the new arrangement introduces
8035 considerable INCOMPATIBILITY to gain more clarity:
8037 Context -- theory management operations (name, identity, inclusion,
8038 parents, ancestors, merge, etc.), plus generic theory data;
8040 Sign -- logical signature and syntax operations (declaring consts,
8041 types, etc.), plus certify/read for common entities;
8043 Theory -- logical theory operations (stating axioms, definitions,
8044 oracles), plus a copy of logical signature operations (consts,
8045 types, etc.); also a few basic management operations (Theory.copy,
8048 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
8049 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
8050 for convenience -- they merely return the theory.
8052 * Pure: type Type.tsig is superceded by theory in most interfaces.
8054 * Pure: the Isar proof context type is already defined early in Pure
8055 as Context.proof (note that ProofContext.context and Proof.context are
8056 aliases, where the latter is the preferred name). This enables other
8057 Isabelle components to refer to that type even before Isar is present.
8059 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
8060 typeK, constK, axiomK, oracleK), but provide explicit operations for
8061 any of these kinds. For example, Sign.intern typeK is now
8062 Sign.intern_type, Theory.hide_space Sign.typeK is now
8063 Theory.hide_types. Also note that former
8064 Theory.hide_classes/types/consts are now
8065 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
8066 internalize their arguments! INCOMPATIBILITY.
8068 * Pure: get_thm interface (of PureThy and ProofContext) expects
8069 datatype thmref (with constructors Name and NameSelection) instead of
8070 plain string -- INCOMPATIBILITY;
8072 * Pure: cases produced by proof methods specify options, where NONE
8073 means to remove case bindings -- INCOMPATIBILITY in
8076 * Pure: the following operations retrieve axioms or theorems from a
8077 theory node or theory hierarchy, respectively:
8079 Theory.axioms_of: theory -> (string * term) list
8080 Theory.all_axioms_of: theory -> (string * term) list
8081 PureThy.thms_of: theory -> (string * thm) list
8082 PureThy.all_thms_of: theory -> (string * thm) list
8084 * Pure: print_tac now outputs the goal through the trace channel.
8086 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
8087 Reference Toplevel.debug (default false) controls detailed printing
8088 and tracing of low-level exceptions; Toplevel.profiling (default 0)
8089 controls execution profiling -- set to 1 for time and 2 for space
8090 (both increase the runtime).
8092 * Isar session: The initial use of ROOT.ML is now always timed,
8093 i.e. the log will show the actual process times, in contrast to the
8094 elapsed wall-clock time that the outer shell wrapper produces.
8096 * Simplifier: improved handling of bound variables (nameless
8097 representation, avoid allocating new strings). Simprocs that invoke
8098 the Simplifier recursively should use Simplifier.inherit_bounds to
8099 avoid local name clashes. Failure to do so produces warnings
8100 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
8101 for further details.
8103 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
8104 bindings for all theorems stored within a given theory; this may help
8105 in porting non-Isar theories to Isar ones, while keeping ML proof
8106 scripts for the time being.
8108 * ML operator HTML.with_charset specifies the charset begin used for
8109 generated HTML files. For example:
8111 HTML.with_charset "utf-8" use_thy "Hebrew";
8112 HTML.with_charset "utf-8" use_thy "Chinese";
8117 * Allow symlinks to all proper Isabelle executables (Isabelle,
8118 isabelle, isatool etc.).
8120 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
8121 isatool doc, isatool mkdir, display_drafts etc.).
8123 * isatool usedir: option -f allows specification of the ML file to be
8124 used by Isabelle; default is ROOT.ML.
8126 * New isatool version outputs the version identifier of the Isabelle
8127 distribution being used.
8129 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
8130 (containing Boolean satisfiability problems) into Isabelle/HOL
8135 New in Isabelle2004 (April 2004)
8136 --------------------------------
8140 * Provers/order.ML: new efficient reasoner for partial and linear orders.
8141 Replaces linorder.ML.
8143 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
8144 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
8145 (\<a>...\<z>), are now considered normal letters, and can therefore
8146 be used anywhere where an ASCII letter (a...zA...Z) has until
8147 now. COMPATIBILITY: This obviously changes the parsing of some
8148 terms, especially where a symbol has been used as a binder, say
8149 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
8150 as an identifier. Fix it by inserting a space around former
8151 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
8152 existing theory and ML files.
8154 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
8156 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
8157 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
8158 a normal (but invisible) letter. For multiple letter subscripts repeat
8159 \<^isub> like this: x\<^isub>1\<^isub>2.
8161 * Pure: There are now sub-/superscripts that can span more than one
8162 character. Text between \<^bsub> and \<^esub> is set in subscript in
8163 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
8164 superscript. The new control characters are not identifier parts.
8166 * Pure: Control-symbols of the form \<^raw:...> will literally print the
8167 content of "..." to the latex file instead of \isacntrl... . The "..."
8168 may consist of any printable characters excluding the end bracket >.
8170 * Pure: Using new Isar command "finalconsts" (or the ML functions
8171 Theory.add_finals or Theory.add_finals_i) it is now possible to
8172 declare constants "final", which prevents their being given a definition
8173 later. It is useful for constants whose behaviour is fixed axiomatically
8174 rather than definitionally, such as the meta-logic connectives.
8176 * Pure: 'instance' now handles general arities with general sorts
8177 (i.e. intersections of classes),
8179 * Presentation: generated HTML now uses a CSS style sheet to make layout
8180 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
8181 It can be changed to alter the colors/layout of generated pages.
8186 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
8187 cut_tac, subgoal_tac and thin_tac:
8188 - Now understand static (Isar) contexts. As a consequence, users of Isar
8189 locales are no longer forced to write Isar proof scripts.
8190 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
8192 - INCOMPATIBILITY: names of variables to be instantiated may no
8193 longer be enclosed in quotes. Instead, precede variable name with `?'.
8194 This is consistent with the instantiation attribute "where".
8196 * Attributes "where" and "of":
8197 - Now take type variables of instantiated theorem into account when reading
8198 the instantiation string. This fixes a bug that caused instantiated
8199 theorems to have too special types in some circumstances.
8200 - "where" permits explicit instantiations of type variables.
8202 * Calculation commands "moreover" and "also" no longer interfere with
8203 current facts ("this"), admitting arbitrary combinations with "then"
8207 - Goal statements involving the context element "includes" no longer
8208 generate theorems with internal delta predicates (those ending on
8209 "_axioms") in the premise.
8210 Resolve particular premise with <locale>.intro to obtain old form.
8211 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
8212 specification and "includes" elements in goal statement.
8213 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
8214 [intro?] and [elim?] (respectively) by default.
8215 - Experimental command for instantiation of locales in proof contexts:
8216 instantiate <label>[<attrs>]: <loc>
8217 Instantiates locale <loc> and adds all its theorems to the current context
8218 taking into account their attributes. Label and attrs are optional
8219 modifiers, like in theorem declarations. If present, names of
8220 instantiated theorems are qualified with <label>, and the attributes
8221 <attrs> are applied after any attributes these theorems might have already.
8222 If the locale has assumptions, a chained fact of the form
8223 "<loc> t1 ... tn" is expected from which instantiations of the parameters
8224 are derived. The command does not support old-style locales declared
8225 with "locale (open)".
8226 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
8228 * HOL: Tactic emulation methods induct_tac and case_tac understand static
8234 * Proof import: new image HOL4 contains the imported library from
8235 the HOL4 system with about 2500 theorems. It is imported by
8236 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
8237 can be used like any other Isabelle image. See
8238 HOL/Import/HOL/README for more information.
8241 - Much improved handling of linear and partial orders.
8242 Reasoners for linear and partial orders are set up for type classes
8243 "linorder" and "order" respectively, and are added to the default simpset
8244 as solvers. This means that the simplifier can build transitivity chains
8245 to solve goals from the assumptions.
8246 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
8247 of blast or auto after simplification become unnecessary because the goal
8248 is solved by simplification already.
8250 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
8251 all proved in axiomatic type classes for semirings, rings and fields.
8254 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
8255 now formalized using the Ring_and_Field theory mentioned above.
8256 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
8257 than before, because now they are set up once in a generic manner.
8258 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
8259 Look for the general versions in Ring_and_Field (and Power if they concern
8262 * Type "rat" of the rational numbers is now available in HOL-Complex.
8265 - Record types are now by default printed with their type abbreviation
8266 instead of the list of all field types. This can be configured via
8267 the reference "print_record_type_abbr".
8268 - Simproc "record_upd_simproc" for simplification of multiple updates added
8269 (not enabled by default).
8270 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
8271 EX x. x = sel r to True (not enabled by default).
8272 - Tactic "record_split_simp_tac" to split and simplify records added.
8274 * 'specification' command added, allowing for definition by
8275 specification. There is also an 'ax_specification' command that
8276 introduces the new constants axiomatically.
8278 * arith(_tac) is now able to generate counterexamples for reals as well.
8280 * HOL-Algebra: new locale "ring" for non-commutative rings.
8282 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
8283 definitions, thanks to Sava Krsti\'{c} and John Matthews.
8285 * HOL-Matrix: a first theory for matrices in HOL with an application of
8286 matrix theory to linear programming.
8288 * Unions and Intersections:
8289 The latex output syntax of UN and INT has been changed
8290 from "\Union x \in A. B" to "\Union_{x \in A} B"
8291 i.e. the index formulae has become a subscript.
8292 Similarly for "\Union x. B", and for \Inter instead of \Union.
8294 * Unions and Intersections over Intervals:
8295 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
8296 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
8297 like in normal math, and corresponding versions for < and for intersection.
8299 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
8300 lexicographic dictonary ordering has been added as "lexord".
8302 * ML: the legacy theory structures Int and List have been removed. They had
8303 conflicted with ML Basis Library structures having the same names.
8305 * 'refute' command added to search for (finite) countermodels. Only works
8306 for a fragment of HOL. The installation of an external SAT solver is
8307 highly recommended. See "HOL/Refute.thy" for details.
8309 * 'quickcheck' command: Allows to find counterexamples by evaluating
8310 formulae under an assignment of free variables to random values.
8311 In contrast to 'refute', it can deal with inductive datatypes,
8312 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
8318 * Streams now come with concatenation and are part of the HOLCF image
8322 New in Isabelle2003 (May 2003)
8323 ------------------------------
8327 * Provers/simplifier:
8329 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
8330 Assumptions are now subject to complete mutual simplification,
8331 not just from left to right. The simplifier now preserves
8332 the order of assumptions.
8334 Potential INCOMPATIBILITY:
8336 -- simp sometimes diverges where the old version did
8337 not, e.g. invoking simp on the goal
8339 [| P (f x); y = x; f x = f y |] ==> Q
8341 now gives rise to the infinite reduction sequence
8343 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
8345 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
8348 -- Tactics combining classical reasoner and simplification (such as auto)
8349 are also affected by this change, because many of them rely on
8350 simp. They may sometimes diverge as well or yield a different numbers
8351 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
8352 in case of problems. Sometimes subsequent calls to the classical
8353 reasoner will fail because a preceeding call to the simplifier too
8354 eagerly simplified the goal, e.g. deleted redundant premises.
8356 - The simplifier trace now shows the names of the applied rewrite rules
8358 - You can limit the number of recursive invocations of the simplifier
8359 during conditional rewriting (where the simplifie tries to solve the
8360 conditions before applying the rewrite rule):
8361 ML "simp_depth_limit := n"
8362 where n is an integer. Thus you can force termination where previously
8363 the simplifier would diverge.
8365 - Accepts free variables as head terms in congruence rules. Useful in Isar.
8367 - No longer aborts on failed congruence proof. Instead, the
8368 congruence is ignored.
8370 * Pure: New generic framework for extracting programs from constructive
8371 proofs. See HOL/Extraction.thy for an example instantiation, as well
8372 as HOL/Extraction for some case studies.
8374 * Pure: The main goal of the proof state is no longer shown by default, only
8375 the subgoals. This behaviour is controlled by a new flag.
8376 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
8377 (ML: Proof.show_main_goal).
8379 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
8380 rules whose conclusion matches subgoal 1:
8381 PG menu: Isabelle/Isar -> Show me -> matching rules
8382 The rules are ordered by how closely they match the subgoal.
8383 In particular, rules that solve a subgoal outright are displayed first
8384 (or rather last, the way they are printed).
8385 (ML: ProofGeneral.print_intros())
8387 * Pure: New flag trace_unify_fail causes unification to print
8388 diagnostic information (PG: in trace buffer) when it fails. This is
8389 useful for figuring out why single step proofs like rule, erule or
8392 * Pure: Locale specifications now produce predicate definitions
8393 according to the body of text (covering assumptions modulo local
8394 definitions); predicate "loc_axioms" covers newly introduced text,
8395 while "loc" is cumulative wrt. all included locale expressions; the
8396 latter view is presented only on export into the global theory
8397 context; potential INCOMPATIBILITY, use "(open)" option to fall back
8398 on the old view without predicates;
8400 * Pure: predefined locales "var" and "struct" are useful for sharing
8401 parameters (as in CASL, for example); just specify something like
8402 ``var x + var y + struct M'' as import;
8404 * Pure: improved thms_containing: proper indexing of facts instead of
8405 raw theorems; check validity of results wrt. current name space;
8406 include local facts of proof configuration (also covers active
8407 locales), cover fixed variables in index; may use "_" in term
8408 specification; an optional limit for the number of printed facts may
8409 be given (the default is 40);
8411 * Pure: disallow duplicate fact bindings within new-style theory files
8414 * Provers: improved induct method: assumptions introduced by case
8415 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
8416 the goal statement); "foo" still refers to all facts collectively;
8418 * Provers: the function blast.overloaded has been removed: all constants
8419 are regarded as potentially overloaded, which improves robustness in exchange
8420 for slight decrease in efficiency;
8422 * Provers/linorder: New generic prover for transitivity reasoning over
8423 linear orders. Note: this prover is not efficient!
8425 * Isar: preview of problems to finish 'show' now produce an error
8426 rather than just a warning (in interactive mode);
8433 - Produces a counter example if it cannot prove a goal.
8434 Note that the counter example may be spurious if the goal is not a formula
8435 of quantifier-free linear arithmetic.
8436 In ProofGeneral the counter example appears in the trace buffer.
8438 - Knows about div k and mod k where k is a numeral of type nat or int.
8440 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
8441 linear arithmetic fails. This takes account of quantifiers and divisibility.
8442 Presburger arithmetic can also be called explicitly via presburger(_tac).
8444 * simp's arithmetic capabilities have been enhanced a bit: it now
8445 takes ~= in premises into account (by performing a case split);
8447 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
8448 are distributed over a sum of terms;
8450 * New tactic "trans_tac" and method "trans" instantiate
8451 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
8454 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
8455 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
8457 * 'typedef' command has new option "open" to suppress the set
8460 * functions Min and Max on finite sets have been introduced (theory
8463 * attribute [symmetric] now works for relations as well; it turns
8464 (x,y) : R^-1 into (y,x) : R, and vice versa;
8466 * induct over a !!-quantified statement (say !!x1..xn):
8467 each "case" automatically performs "fix x1 .. xn" with exactly those names.
8469 * Map: `empty' is no longer a constant but a syntactic abbreviation for
8470 %x. None. Warning: empty_def now refers to the previously hidden definition
8473 * Algebra: formalization of classical algebra. Intended as base for
8474 any algebraic development in Isabelle. Currently covers group theory
8475 (up to Sylow's theorem) and ring theory (Universal Property of
8476 Univariate Polynomials). Contributions welcome;
8478 * GroupTheory: deleted, since its material has been moved to Algebra;
8480 * Complex: new directory of the complex numbers with numeric constants,
8481 nonstandard complex numbers, and some complex analysis, standard and
8482 nonstandard (Jacques Fleuriot);
8484 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
8486 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
8489 * Real/HahnBanach: updated and adapted to locales;
8491 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
8494 * UNITY: added the Meier-Sanders theory of progress sets;
8496 * MicroJava: bytecode verifier and lightweight bytecode verifier
8497 as abstract algorithms, instantiated to the JVM;
8499 * Bali: Java source language formalization. Type system, operational
8500 semantics, axiomatic semantics. Supported language features:
8501 classes, interfaces, objects,virtual methods, static methods,
8502 static/instance fields, arrays, access modifiers, definite
8503 assignment, exceptions.
8508 * ZF/Constructible: consistency proof for AC (Gdel's constructible
8511 * Main ZF: virtually all theories converted to new-style format;
8516 * Pure: Tactic.prove provides sane interface for internal proofs;
8517 omits the infamous "standard" operation, so this is more appropriate
8518 than prove_goalw_cterm in many situations (e.g. in simprocs);
8520 * Pure: improved error reporting of simprocs;
8522 * Provers: Simplifier.simproc(_i) provides sane interface for setting
8526 *** Document preparation ***
8528 * uses \par instead of \\ for line breaks in theory text. This may
8529 shift some page breaks in large documents. To get the old behaviour
8530 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
8532 * minimized dependencies of isabelle.sty and isabellesym.sty on
8535 * \<euro> now needs package babel/greek instead of marvosym (which
8538 * normal size for \<zero>...\<nine> (uses \mathbf instead of
8543 New in Isabelle2002 (March 2002)
8544 --------------------------------
8546 *** Document preparation ***
8548 * greatly simplified document preparation setup, including more
8549 graceful interpretation of isatool usedir -i/-d/-D options, and more
8550 instructive isatool mkdir; users should basically be able to get
8551 started with "isatool mkdir HOL Test && isatool make"; alternatively,
8552 users may run a separate document processing stage manually like this:
8553 "isatool usedir -D output HOL Test && isatool document Test/output";
8555 * theory dependency graph may now be incorporated into documents;
8556 isatool usedir -g true will produce session_graph.eps/.pdf for use
8557 with \includegraphics of LaTeX;
8559 * proper spacing of consecutive markup elements, especially text
8560 blocks after section headings;
8562 * support bold style (for single symbols only), input syntax is like
8563 this: "\<^bold>\<alpha>" or "\<^bold>A";
8565 * \<bullet> is now output as bold \cdot by default, which looks much
8566 better in printed text;
8568 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
8569 note that these symbols are currently unavailable in Proof General /
8570 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
8572 * isatool latex no longer depends on changed TEXINPUTS, instead
8573 isatool document copies the Isabelle style files to the target
8579 * Pure/Provers: improved proof by cases and induction;
8580 - 'case' command admits impromptu naming of parameters (such as
8582 - 'induct' method divinates rule instantiation from the inductive
8583 claim; no longer requires excessive ?P bindings for proper
8584 instantiation of cases;
8585 - 'induct' method properly enumerates all possibilities of set/type
8586 rules; as a consequence facts may be also passed through *type*
8587 rules without further ado;
8588 - 'induct' method now derives symbolic cases from the *rulified*
8589 rule (before it used to rulify cases stemming from the internal
8590 atomized version); this means that the context of a non-atomic
8591 statement becomes is included in the hypothesis, avoiding the
8592 slightly cumbersome show "PROP ?case" form;
8593 - 'induct' may now use elim-style induction rules without chaining
8594 facts, using ``missing'' premises from the goal state; this allows
8595 rules stemming from inductive sets to be applied in unstructured
8596 scripts, while still benefitting from proper handling of non-atomic
8597 statements; NB: major inductive premises need to be put first, all
8598 the rest of the goal is passed through the induction;
8599 - 'induct' proper support for mutual induction involving non-atomic
8600 rule statements (uses the new concept of simultaneous goals, see
8602 - append all possible rule selections, but only use the first
8603 success (no backtracking);
8604 - removed obsolete "(simplified)" and "(stripped)" options of methods;
8605 - undeclared rule case names default to numbers 1, 2, 3, ...;
8606 - added 'print_induct_rules' (covered by help item in recent Proof
8608 - moved induct/cases attributes to Pure, methods to Provers;
8609 - generic method setup instantiated for FOL and HOL;
8611 * Pure: support multiple simultaneous goal statements, for example
8612 "have a: A and b: B" (same for 'theorem' etc.); being a pure
8613 meta-level mechanism, this acts as if several individual goals had
8614 been stated separately; in particular common proof methods need to be
8615 repeated in order to cover all claims; note that a single elimination
8616 step is *not* sufficient to establish the two conjunctions, so this
8619 assume "A & B" then have A and B .. (*".." fails*)
8621 better use "obtain" in situations as above; alternative refer to
8622 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
8624 * Pure: proper integration with ``locales''; unlike the original
8625 version by Florian Kammller, Isar locales package high-level proof
8626 contexts rather than raw logical ones (e.g. we admit to include
8627 attributes everywhere); operations on locales include merge and
8628 rename; support for implicit arguments (``structures''); simultaneous
8629 type-inference over imports and text; see also HOL/ex/Locales.thy for
8632 * Pure: the following commands have been ``localized'', supporting a
8633 target locale specification "(in name)": 'lemma', 'theorem',
8634 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
8635 stored both within the locale and at the theory level (exported and
8636 qualified by the locale name);
8638 * Pure: theory goals may now be specified in ``long'' form, with
8639 ad-hoc contexts consisting of arbitrary locale elements. for example
8640 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
8641 definitions may be given, too); the result is a meta-level rule with
8642 the context elements being discharged in the obvious way;
8644 * Pure: new proof command 'using' allows to augment currently used
8645 facts after a goal statement ('using' is syntactically analogous to
8646 'apply', but acts on the goal's facts only); this allows chained facts
8647 to be separated into parts given before and after a claim, as in
8648 ``from a and b have C using d and e <proof>'';
8650 * Pure: renamed "antecedent" case to "rule_context";
8652 * Pure: new 'judgment' command records explicit information about the
8653 object-logic embedding (used by several tools internally); no longer
8654 use hard-wired "Trueprop";
8656 * Pure: added 'corollary' command;
8658 * Pure: fixed 'token_translation' command;
8660 * Pure: removed obsolete 'exported' attribute;
8662 * Pure: dummy pattern "_" in is/let is now automatically lifted over
8663 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
8664 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
8666 * Pure: method 'atomize' presents local goal premises as object-level
8667 statements (atomic meta-level propositions); setup controlled via
8668 rewrite rules declarations of 'atomize' attribute; example
8669 application: 'induct' method with proper rule statements in improper
8672 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
8673 now consider the syntactic context of assumptions, giving a better
8674 chance to get type-inference of the arguments right (this is
8675 especially important for locales);
8677 * Pure: "sorry" no longer requires quick_and_dirty in interactive
8680 * Pure/obtain: the formal conclusion "thesis", being marked as
8681 ``internal'', may no longer be reference directly in the text;
8682 potential INCOMPATIBILITY, may need to use "?thesis" in rare
8685 * Pure: generic 'sym' attribute which declares a rule both as pure
8686 'elim?' and for the 'symmetric' operation;
8688 * Pure: marginal comments ``--'' may now occur just anywhere in the
8689 text; the fixed correlation with particular command syntax has been
8692 * Pure: new method 'rules' is particularly well-suited for proof
8693 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
8694 but often produces more compact proof terms with less detours;
8696 * Pure/Provers/classical: simplified integration with pure rule
8697 attributes and methods; the classical "intro?/elim?/dest?"
8698 declarations coincide with the pure ones; the "rule" method no longer
8699 includes classically swapped intros; "intro" and "elim" methods no
8700 longer pick rules from the context; also got rid of ML declarations
8701 AddXIs/AddXEs/AddXDs; all of this has some potential for
8704 * Provers/classical: attribute 'swapped' produces classical inversions
8705 of introduction rules;
8707 * Provers/simplifier: 'simplified' attribute may refer to explicit
8708 rules instead of full simplifier context; 'iff' attribute handles
8711 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
8713 * HOL: 'recdef' now fails on unfinished automated proofs, use
8714 "(permissive)" option to recover old behavior;
8716 * HOL: 'inductive' no longer features separate (collective) attributes
8717 for 'intros' (was found too confusing);
8719 * HOL: properly declared induction rules less_induct and
8725 * HOL: moved over to sane numeral syntax; the new policy is as
8728 - 0 and 1 are polymorphic constants, which are defined on any
8729 numeric type (nat, int, real etc.);
8731 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
8732 binary representation internally;
8734 - type nat has special constructor Suc, and generally prefers Suc 0
8735 over 1::nat and Suc (Suc 0) over 2::nat;
8737 This change may cause significant problems of INCOMPATIBILITY; here
8738 are some hints on converting existing sources:
8740 - due to the new "num" token, "-0" and "-1" etc. are now atomic
8741 entities, so expressions involving "-" (unary or binary minus) need
8742 to be spaced properly;
8744 - existing occurrences of "1" may need to be constraint "1::nat" or
8745 even replaced by Suc 0; similar for old "2";
8747 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
8749 - remove all special provisions on numerals in proofs;
8751 * HOL: simp rules nat_number expand numerals on nat to Suc/0
8752 representation (depends on bin_arith_simps in the default context);
8754 * HOL: symbolic syntax for x^2 (numeral 2);
8756 * HOL: the class of all HOL types is now called "type" rather than
8757 "term"; INCOMPATIBILITY, need to adapt references to this type class
8758 in axclass/classes, instance/arities, and (usually rare) occurrences
8759 in typings (of consts etc.); internally the class is called
8760 "HOL.type", ML programs should refer to HOLogic.typeS;
8762 * HOL/record package improvements:
8763 - new derived operations "fields" to build a partial record section,
8764 "extend" to promote a fixed record to a record scheme, and
8765 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
8766 declared as simp by default;
8767 - shared operations ("more", "fields", etc.) now need to be always
8768 qualified) --- potential INCOMPATIBILITY;
8769 - removed "make_scheme" operations (use "make" with "extend") --
8771 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
8772 - provides cases/induct rules for use with corresponding Isar
8773 methods (for concrete records, record schemes, concrete more
8774 parts, and schematic more parts -- in that order);
8775 - internal definitions directly based on a light-weight abstract
8776 theory of product types over typedef rather than datatype;
8778 * HOL: generic code generator for generating executable ML code from
8779 specifications; specific support for HOL constructs such as inductive
8780 datatypes and sets, as well as recursive functions; can be invoked
8781 via 'generate_code' theory section;
8783 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
8785 * HOL: consolidated and renamed several theories. In particular:
8786 Ord.thy has been absorbed into HOL.thy
8787 String.thy has been absorbed into List.thy
8789 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
8790 (beware of argument permutation!);
8792 * HOL: linorder_less_split superseded by linorder_cases;
8794 * HOL/List: "nodups" renamed to "distinct";
8796 * HOL: added "The" definite description operator; move Hilbert's "Eps"
8797 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
8798 - Ex_def has changed, now need to use some_eq_ex
8800 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
8801 in this (rare) case use:
8803 delSWrapper "split_all_tac"
8804 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
8806 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
8809 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
8810 Isabelle's type classes, ^ on functions and relations has too general
8811 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
8812 necessary to attach explicit type constraints;
8814 * HOL/Relation: the prefix name of the infix "O" has been changed from
8815 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
8816 renamed accordingly (eg "compI" -> "rel_compI").
8818 * HOL: syntax translations now work properly with numerals and records
8821 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
8822 of "lam" -- INCOMPATIBILITY;
8824 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
8825 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
8826 renamed "Product_Type.unit";
8828 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
8830 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
8831 the "cases" method);
8833 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
8836 * HOL/IMP: updated and converted to new-style theory format; several
8837 parts turned into readable document, with proper Isar proof texts and
8838 some explanations (by Gerwin Klein);
8840 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
8842 * HOL-Hyperreal is now a logic image;
8847 * Isar: consts/constdefs supports mixfix syntax for continuous
8850 * Isar: domain package adapted to new-style theory format, e.g. see
8853 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
8854 potential INCOMPATIBILITY; now use plain induct_tac instead of former
8855 lift.induct_tac, always use UU instead of Undef;
8857 * HOLCF/IMP: updated and converted to new-style theory;
8862 * Isar: proper integration of logic-specific tools and packages,
8863 including theory commands '(co)inductive', '(co)datatype',
8864 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
8865 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
8867 * theory Main no longer includes AC; for the Axiom of Choice, base
8868 your theory on Main_ZFC;
8870 * the integer library now covers quotients and remainders, with many
8871 laws relating division to addition, multiplication, etc.;
8873 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
8874 typeless version of the formalism;
8876 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
8879 * ZF/Induct: new directory for examples of inductive definitions,
8880 including theory Multiset for multiset orderings; converted to
8881 new-style theory format;
8883 * ZF: many new theorems about lists, ordinals, etc.;
8888 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
8889 variable proof controls level of detail: 0 = no proofs (only oracle
8890 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
8891 also ref manual for further ML interfaces;
8893 * Pure/axclass: removed obsolete ML interface
8894 goal_subclass/goal_arity;
8896 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
8897 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
8898 separate tokens, so expressions involving minus need to be spaced
8901 * Pure/syntax: support non-oriented infixes, using keyword "infix"
8902 rather than "infixl" or "infixr";
8904 * Pure/syntax: concrete syntax for dummy type variables admits genuine
8905 sort constraint specifications in type inference; e.g. "x::_::foo"
8906 ensures that the type of "x" is of sort "foo" (but not necessarily a
8909 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
8910 control output of nested => (types); the default behavior is
8913 * Pure/syntax: builtin parse translation for "_constify" turns valued
8914 tokens into AST constants;
8916 * Pure/syntax: prefer later declarations of translations and print
8917 translation functions; potential INCOMPATIBILITY: need to reverse
8918 multiple declarations for same syntax element constant;
8920 * Pure/show_hyps reset by default (in accordance to existing Isar
8923 * Provers/classical: renamed addaltern to addafter, addSaltern to
8926 * Provers/clasimp: ``iff'' declarations now handle conditional rules
8929 * system: tested support for MacOS X; should be able to get Isabelle +
8930 Proof General to work in a plain Terminal after installing Poly/ML
8931 (e.g. from the Isabelle distribution area) and GNU bash alone
8932 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
8933 support requires further installations, e.g. from
8934 http://fink.sourceforge.net/);
8936 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
8938 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
8939 of 40 MB), cf. ML_OPTIONS;
8941 * system: Proof General keywords specification is now part of the
8942 Isabelle distribution (see etc/isar-keywords.el);
8944 * system: support for persistent Proof General sessions (refrain from
8945 outdating all loaded theories on startup); user may create writable
8946 logic images like this: ``isabelle -q HOL Test'';
8948 * system: smart selection of Isabelle process versus Isabelle
8949 interface, accommodates case-insensitive file systems (e.g. HFS+); may
8950 run both "isabelle" and "Isabelle" even if file names are badly
8951 damaged (executable inspects the case of the first letter of its own
8952 name); added separate "isabelle-process" and "isabelle-interface";
8954 * system: refrain from any attempt at filtering input streams; no
8955 longer support ``8bit'' encoding of old isabelle font, instead proper
8956 iso-latin characters may now be used; the related isatools
8957 "symbolinput" and "nonascii" have disappeared as well;
8959 * system: removed old "xterm" interface (the print modes "xterm" and
8960 "xterm_color" are still available for direct use in a suitable
8965 New in Isabelle99-2 (February 2001)
8966 -----------------------------------
8968 *** Overview of INCOMPATIBILITIES ***
8970 * HOL: please note that theories in the Library and elsewhere often use the
8971 new-style (Isar) format; to refer to their theorems in an ML script you must
8972 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
8974 * HOL: inductive package no longer splits induction rule aggressively,
8975 but only as far as specified by the introductions given; the old
8976 format may be recovered via ML function complete_split_rule or attribute
8977 'split_rule (complete)';
8979 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
8980 gfp_Tarski to gfp_unfold;
8982 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
8984 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
8985 relation); infix "^^" has been renamed "``"; infix "``" has been
8986 renamed "`"; "univalent" has been renamed "single_valued";
8988 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
8991 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
8993 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
8995 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
8996 consequence, it is no longer monotonic wrt. the local goal context
8997 (which is now passed through the inductive cases);
8999 * Document preparation: renamed standard symbols \<ll> to \<lless> and
9000 \<gg> to \<ggreater>;
9003 *** Document preparation ***
9005 * \isabellestyle{NAME} selects version of Isabelle output (currently
9006 available: are "it" for near math-mode best-style output, "sl" for
9007 slanted text style, and "tt" for plain type-writer; if no
9008 \isabellestyle command is given, output is according to slanted
9011 * support sub/super scripts (for single symbols only), input syntax is
9012 like this: "A\<^sup>*" or "A\<^sup>\<star>";
9014 * some more standard symbols; see Appendix A of the system manual for
9015 the complete list of symbols defined in isabellesym.sty;
9017 * improved isabelle style files; more abstract symbol implementation
9018 (should now use \isamath{...} and \isatext{...} in custom symbol
9021 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
9022 state; Note that presentation of goal states does not conform to
9023 actual human-readable proof documents. Please do not include goal
9024 states into document output unless you really know what you are doing!
9026 * proper indentation of antiquoted output with proportional LaTeX
9029 * no_document ML operator temporarily disables LaTeX document
9032 * isatool unsymbolize tunes sources for plain ASCII communication;
9037 * Pure: Isar now suffers initial goal statements to contain unbound
9038 schematic variables (this does not conform to actual readable proof
9039 documents, due to unpredictable outcome and non-compositional proof
9040 checking); users who know what they are doing may use schematic goals
9041 for Prolog-style synthesis of proven results;
9043 * Pure: assumption method (an implicit finishing) now handles actual
9046 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
9047 initial goal, declare "that" only as Pure intro (only for single
9048 steps); the "that" rule assumption may now be involved in implicit
9049 finishing, thus ".." becomes a feasible for trivial obtains;
9051 * Pure: default proof step now includes 'intro_classes'; thus trivial
9052 instance proofs may be performed by "..";
9054 * Pure: ?thesis / ?this / "..." now work for pure meta-level
9057 * Pure: more robust selection of calculational rules;
9059 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
9060 rule (as well as the assumption rule);
9062 * Pure: 'thm_deps' command visualizes dependencies of theorems and
9063 lemmas, using the graph browser tool;
9065 * Pure: predict failure of "show" in interactive mode;
9067 * Pure: 'thms_containing' now takes actual terms as arguments;
9069 * HOL: improved method 'induct' --- now handles non-atomic goals
9070 (potential INCOMPATIBILITY); tuned error handling;
9072 * HOL: cases and induct rules now provide explicit hints about the
9073 number of facts to be consumed (0 for "type" and 1 for "set" rules);
9074 any remaining facts are inserted into the goal verbatim;
9076 * HOL: local contexts (aka cases) may now contain term bindings as
9077 well; the 'cases' and 'induct' methods new provide a ?case binding for
9078 the result to be shown in each case;
9080 * HOL: added 'recdef_tc' command;
9082 * isatool convert assists in eliminating legacy ML scripts;
9087 * HOL/Library: a collection of generic theories to be used together
9088 with main HOL; the theory loader path already includes this directory
9089 by default; the following existing theories have been moved here:
9090 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
9091 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
9093 * HOL/Unix: "Some aspects of Unix file-system security", a typical
9094 modelling and verification task performed in Isabelle/HOL +
9095 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
9097 * HOL/Algebra: special summation operator SUM no longer exists, it has
9098 been replaced by setsum; infix 'assoc' now has priority 50 (like
9099 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
9100 'domain', this makes the theory consistent with mathematical
9103 * HOL basics: added overloaded operations "inverse" and "divide"
9104 (infix "/"), syntax for generic "abs" operation, generic summation
9107 * HOL/typedef: simplified package, provide more useful rules (see also
9110 * HOL/datatype: induction rule for arbitrarily branching datatypes is
9111 now expressed as a proper nested rule (old-style tactic scripts may
9112 require atomize_strip_tac to cope with non-atomic premises);
9114 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
9115 to "split_conv" (old name still available for compatibility);
9117 * HOL: improved concrete syntax for strings (e.g. allows translation
9118 rules with string literals);
9120 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
9121 and Fleuriot's mechanization of analysis, including the transcendental
9122 functions for the reals;
9124 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
9129 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
9130 "lam" is displayed as TWO lambda-symbols
9132 * CTT: theory Main now available, containing everything (that is, Bool
9138 * Pure: the Simplifier has been implemented properly as a derived rule
9139 outside of the actual kernel (at last!); the overall performance
9140 penalty in practical applications is about 50%, while reliability of
9141 the Isabelle inference kernel has been greatly improved;
9143 * print modes "brackets" and "no_brackets" control output of nested =>
9144 (types) and ==> (props); the default behaviour is "brackets";
9146 * Provers: fast_tac (and friends) now handle actual object-logic rules
9147 as assumptions as well;
9149 * system: support Poly/ML 4.0;
9151 * system: isatool install handles KDE version 1 or 2;
9155 New in Isabelle99-1 (October 2000)
9156 ----------------------------------
9158 *** Overview of INCOMPATIBILITIES ***
9160 * HOL: simplification of natural numbers is much changed; to partly
9161 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
9162 issue the following ML commands:
9164 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
9165 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
9167 * HOL: simplification no longer dives into case-expressions; this is
9168 controlled by "t.weak_case_cong" for each datatype t;
9170 * HOL: nat_less_induct renamed to less_induct;
9172 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
9173 fixsome to patch .thy and .ML sources automatically;
9175 select_equality -> some_equality
9176 select_eq_Ex -> some_eq_ex
9177 selectI2EX -> someI2_ex
9180 select1_equality -> some1_equality
9181 Eps_sym_eq -> some_sym_eq_trivial
9182 Eps_eq -> some_eq_trivial
9184 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
9186 * HOL: removed obsolete theorem binding expand_if (refer to split_if
9189 * HOL: the recursion equations generated by 'recdef' are now called
9190 f.simps instead of f.rules;
9192 * HOL: qed_spec_mp now also handles bounded ALL as well;
9194 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
9195 sometimes be needed;
9197 * HOL: the constant for "f``x" is now "image" rather than "op ``";
9199 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
9201 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
9202 product is now "<*>" instead of "Times"; the lexicographic product is
9203 now "<*lex*>" instead of "**";
9205 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
9206 of main HOL, but was unused); better use HOL's datatype package;
9208 * HOL: removed "symbols" syntax for constant "override" of theory Map;
9209 the old syntax may be recovered as follows:
9212 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
9213 (infixl "\\<oplus>" 100)
9215 * HOL/Real: "rabs" replaced by overloaded "abs" function;
9217 * HOL/ML: even fewer consts are declared as global (see theories Ord,
9218 Lfp, Gfp, WF); this only affects ML packages that refer to const names
9221 * HOL and ZF: syntax for quotienting wrt an equivalence relation
9222 changed from A/r to A//r;
9224 * ZF: new treatment of arithmetic (nat & int) may break some old
9227 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
9228 rulify -> rule_format, elimify -> elim_format, ...);
9230 * Isar/Provers: intro/elim/dest attributes changed; renamed
9231 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
9232 should have to change intro!! to intro? only); replaced "delrule" by
9235 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
9237 * Provers: strengthened force_tac by using new first_best_tac;
9239 * LaTeX document preparation: several changes of isabelle.sty (see
9243 *** Document preparation ***
9245 * formal comments (text blocks etc.) in new-style theories may now
9246 contain antiquotations of thm/prop/term/typ/text to be presented
9247 according to latex print mode; concrete syntax is like this:
9248 @{term[show_types] "f(x) = a + x"};
9250 * isatool mkdir provides easy setup of Isabelle session directories,
9251 including proper document sources;
9253 * generated LaTeX sources are now deleted after successful run
9254 (isatool document -c); may retain a copy somewhere else via -D option
9257 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
9258 style files, achieving self-contained LaTeX sources and simplifying
9261 * old-style theories now produce (crude) LaTeX output as well;
9263 * browser info session directories are now self-contained (may be put
9264 on WWW server seperately); improved graphs of nested sessions; removed
9265 graph for 'all sessions';
9267 * several improvements in isabelle style files; \isabellestyle{it}
9268 produces fake math mode output; \isamarkupheader is now \section by
9269 default; see lib/texinputs/isabelle.sty etc.;
9274 * Isar/Pure: local results and corresponding term bindings are now
9275 subject to Hindley-Milner polymorphism (similar to ML); this
9276 accommodates incremental type-inference very nicely;
9278 * Isar/Pure: new derived language element 'obtain' supports
9279 generalized existence reasoning;
9281 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
9282 support accumulation of results, without applying any rules yet;
9283 useful to collect intermediate results without explicit name
9284 references, and for use with transitivity rules with more than 2
9287 * Isar/Pure: scalable support for case-analysis type proofs: new
9288 'case' language element refers to local contexts symbolically, as
9289 produced by certain proof methods; internally, case names are attached
9290 to theorems as "tags";
9292 * Isar/Pure: theory command 'hide' removes declarations from
9293 class/type/const name spaces;
9295 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
9296 indicate potential overloading;
9298 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
9300 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
9301 "{a,b,c}" instead of {a,b,c};
9303 * Isar/Pure now provides its own version of intro/elim/dest
9304 attributes; useful for building new logics, but beware of confusion
9305 with the version in Provers/classical;
9307 * Isar/Pure: the local context of (non-atomic) goals is provided via
9308 case name 'antecedent';
9310 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
9311 to the current context is now done automatically);
9313 * Isar/Pure: theory command 'method_setup' provides a simple interface
9314 for definining proof methods in ML;
9316 * Isar/Provers: intro/elim/dest attributes changed; renamed
9317 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
9318 most cases, one should have to change intro!! to intro? only);
9319 replaced "delrule" by "rule del";
9321 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
9322 'symmetric' attribute (the latter supercedes [RS sym]);
9324 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
9325 method modifier); 'simp' method: 'only:' modifier removes loopers as
9326 well (including splits);
9328 * Isar/Provers: Simplifier and Classical methods now support all kind
9329 of modifiers used in the past, including 'cong', 'iff', etc.
9331 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
9332 of Simplifier and Classical reasoner);
9334 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
9335 now support named cases; major packages (inductive, datatype, primrec,
9336 recdef) support case names and properly name parameters;
9338 * Isar/HOL: new transitivity rules for substitution in inequalities --
9339 monotonicity conditions are extracted to be proven at end of
9342 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
9345 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
9346 split_if split_if_asm; datatype package provides theorems foo.splits =
9347 foo.split foo.split_asm for each datatype;
9349 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
9350 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
9351 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
9352 use "(cases (simplified))" method in proper proof texts);
9354 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
9356 * Isar: names of theorems etc. may be natural numbers as well;
9358 * Isar: 'pr' command: optional arguments for goals_limit and
9359 ProofContext.prems_limit; no longer prints theory contexts, but only
9362 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
9363 additional print modes to be specified; e.g. "pr(latex)" will print
9364 proof state according to the Isabelle LaTeX style;
9366 * Isar: improved support for emulating tactic scripts, including proof
9367 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
9368 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
9369 (for HOL datatypes);
9371 * Isar: simplified (more robust) goal selection of proof methods: 1st
9372 goal, all goals, or explicit goal specifier (tactic emulation); thus
9373 'proof method scripts' have to be in depth-first order;
9375 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
9377 * Isar: removed 'help' command, which hasn't been too helpful anyway;
9378 should instead use individual commands for printing items
9379 (print_commands, print_methods etc.);
9381 * Isar: added 'nothing' --- the empty list of theorems;
9386 * HOL/MicroJava: formalization of a fragment of Java, together with a
9387 corresponding virtual machine and a specification of its bytecode
9388 verifier and a lightweight bytecode verifier, including proofs of
9389 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
9390 Cornelia Pusch (see also the homepage of project Bali at
9391 http://isabelle.in.tum.de/Bali/);
9393 * HOL/Algebra: new theory of rings and univariate polynomials, by
9396 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
9397 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
9400 * HOL/Lattice: fundamental concepts of lattice theory and order
9401 structures, including duals, properties of bounds versus algebraic
9402 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
9403 Theorem for complete lattices etc.; may also serve as a demonstration
9404 for abstract algebraic reasoning using axiomatic type classes, and
9405 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
9407 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
9410 * HOL/IMPP: extension of IMP with local variables and mutually
9411 recursive procedures, by David von Oheimb;
9413 * HOL/Lambda: converted into new-style theory and document;
9415 * HOL/ex/Multiquote: example of multiple nested quotations and
9416 anti-quotations -- basically a generalized version of de-Bruijn
9417 representation; very useful in avoiding lifting of operations;
9419 * HOL/record: added general record equality rule to simpset; fixed
9420 select-update simplification procedure to handle extended records as
9421 well; admit "r" as field name;
9423 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
9424 other numeric types and also as the identity of groups, rings, etc.;
9426 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
9427 Types nat and int belong to this axclass;
9429 * HOL: greatly improved simplification involving numerals of type nat, int, real:
9430 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
9431 i*j + k + j*#3*i simplifies to #4*(i*j) + k
9432 two terms #m*u and #n*u are replaced by #(m+n)*u
9433 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
9434 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
9435 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
9437 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
9438 powerful prover for predicate logic but knows nothing of clasets; see
9439 ex/mesontest.ML and ex/mesontest2.ML for example applications;
9441 * HOL: new version of "case_tac" subsumes both boolean case split and
9442 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
9443 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
9445 * HOL: simplification no longer dives into case-expressions: only the
9446 selector expression is simplified, but not the remaining arms; to
9447 enable full simplification of case-expressions for datatype t, you may
9448 remove t.weak_case_cong from the simpset, either globally (Delcongs
9449 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
9451 * HOL/recdef: the recursion equations generated by 'recdef' for
9452 function 'f' are now called f.simps instead of f.rules; if all
9453 termination conditions are proved automatically, these simplification
9454 rules are added to the simpset, as in primrec; rules may be named
9455 individually as well, resulting in a separate list of theorems for
9458 * HOL/While is a new theory that provides a while-combinator. It
9459 permits the definition of tail-recursive functions without the
9460 provision of a termination measure. The latter is necessary once the
9461 invariant proof rule for while is applied.
9463 * HOL: new (overloaded) notation for the set of elements below/above
9464 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
9466 * HOL: theorems impI, allI, ballI bound as "strip";
9468 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
9469 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
9470 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
9472 * HOL/Real: "rabs" replaced by overloaded "abs" function;
9474 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
9475 main HOL, but was unused);
9477 * HOL: fewer consts declared as global (e.g. have to refer to
9478 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
9480 * HOL: tuned AST representation of nested pairs, avoiding bogus output
9481 in case of overlap with user translations (e.g. judgements over
9482 tuples); (note that the underlying logical represenation is still
9488 * ZF: simplification automatically cancels common terms in arithmetic
9489 expressions over nat and int;
9491 * ZF: new treatment of nat to minimize type-checking: all operators
9492 coerce their operands to a natural number using the function natify,
9493 making the algebraic laws unconditional;
9495 * ZF: as above, for int: operators coerce their operands to an integer
9496 using the function intify;
9498 * ZF: the integer library now contains many of the usual laws for the
9499 orderings, including $<=, and monotonicity laws for $+ and $*;
9501 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
9504 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
9505 to the simplifier and classical reasoner simultaneously;
9510 * Provers: blast_tac now handles actual object-logic rules as
9511 assumptions; note that auto_tac uses blast_tac internally as well;
9513 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
9514 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
9516 * Provers: delrules now handles destruct rules as well (no longer need
9517 explicit make_elim);
9519 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
9520 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
9521 use instead the strong form,
9522 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
9523 in HOL, FOL and ZF the function cla_make_elim will create such rules
9524 from destruct-rules;
9526 * Provers: Simplifier.easy_setup provides a fast path to basic
9527 Simplifier setup for new object-logics;
9529 * Pure: AST translation rules no longer require constant head on LHS;
9531 * Pure: improved name spaces: ambiguous output is qualified; support
9532 for hiding of names;
9534 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
9535 XSYMBOL_HOME; no longer need to do manual configuration in most
9538 * system: compression of ML heaps images may now be controlled via -c
9539 option of isabelle and isatool usedir (currently only observed by
9542 * system: isatool installfonts may handle X-Symbol fonts as well (very
9543 useful for remote X11);
9545 * system: provide TAGS file for Isabelle sources;
9547 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
9550 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
9551 timing flag supersedes proof_timing and Toplevel.trace;
9553 * ML: new combinators |>> and |>>> for incremental transformations
9554 with secondary results (e.g. certain theory extensions):
9556 * ML: PureThy.add_defs gets additional argument to indicate potential
9557 overloading (usually false);
9559 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
9564 New in Isabelle99 (October 1999)
9565 --------------------------------
9567 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9569 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
9570 are no longer simplified. (This allows the simplifier to unfold recursive
9571 functional programs.) To restore the old behaviour, declare
9573 Delcongs [if_weak_cong];
9575 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
9578 * HOL: the predicate "inj" is now defined by translation to "inj_on";
9580 * HOL/datatype: mutual_induct_tac no longer exists --
9581 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
9583 * HOL/typedef: fixed type inference for representing set; type
9584 arguments now have to occur explicitly on the rhs as type constraints;
9586 * ZF: The con_defs part of an inductive definition may no longer refer
9587 to constants declared in the same theory;
9589 * HOL, ZF: the function mk_cases, generated by the inductive
9590 definition package, has lost an argument. To simplify its result, it
9591 uses the default simpset instead of a supplied list of theorems.
9593 * HOL/List: the constructors of type list are now Nil and Cons;
9595 * Simplifier: the type of the infix ML functions
9596 setSSolver addSSolver setSolver addSolver
9597 is now simpset * solver -> simpset where `solver' is a new abstract type
9598 for packaging solvers. A solver is created via
9599 mk_solver: string -> (thm list -> int -> tactic) -> solver
9600 where the string argument is only a comment.
9605 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
9606 decision procedure for linear arithmetic. Currently it is used for
9607 types `nat', `int', and `real' in HOL (see below); it can, should and
9608 will be instantiated for other types and logics as well.
9610 * The simplifier now accepts rewrite rules with flexible heads, eg
9611 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
9612 They are applied like any rule with a non-pattern lhs, i.e. by first-order
9618 * New Isabelle/Isar subsystem provides an alternative to traditional
9619 tactical theorem proving; together with the ProofGeneral/isar user
9620 interface it offers an interactive environment for developing human
9621 readable proof documents (Isar == Intelligible semi-automated
9622 reasoning); for further information see isatool doc isar-ref,
9623 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
9625 * improved and simplified presentation of theories: better HTML markup
9626 (including colors), graph views in several sizes; isatool usedir now
9627 provides a proper interface for user theories (via -P option); actual
9628 document preparation based on (PDF)LaTeX is available as well (for
9629 new-style theories only); see isatool doc system for more information;
9631 * native support for Proof General, both for classic Isabelle and
9634 * ML function thm_deps visualizes dependencies of theorems and lemmas,
9635 using the graph browser tool;
9637 * Isabelle manuals now also available as PDF;
9639 * theory loader rewritten from scratch (may not be fully
9640 bug-compatible); old loadpath variable has been replaced by show_path,
9641 add_path, del_path, reset_path functions; new operations such as
9642 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
9645 * improved isatool install: option -k creates KDE application icon,
9646 option -p DIR installs standalone binaries;
9648 * added ML_PLATFORM setting (useful for cross-platform installations);
9649 more robust handling of platform specific ML images for SML/NJ;
9651 * the settings environment is now statically scoped, i.e. it is never
9652 created again in sub-processes invoked from isabelle, isatool, or
9655 * path element specification '~~' refers to '$ISABELLE_HOME';
9657 * in locales, the "assumes" and "defines" parts may be omitted if
9660 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
9663 * new print_mode "HTML";
9665 * new flag show_tags controls display of tags of theorems (which are
9666 basically just comments that may be attached by some tools);
9668 * Isamode 2.6 requires patch to accomodate change of Isabelle font
9669 mode and goal output format:
9671 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
9673 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
9675 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
9676 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
9678 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
9680 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
9682 * function bind_thms stores lists of theorems (cf. bind_thm);
9684 * new shorthand tactics ftac, eatac, datac, fatac;
9686 * qed (and friends) now accept "" as result name; in that case the
9687 theorem is not stored, but proper checks and presentation of the
9690 * theorem database now also indexes constants "Trueprop", "all",
9691 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
9696 ** HOL arithmetic **
9698 * There are now decision procedures for linear arithmetic over nat and
9701 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
9702 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
9703 are treated as atomic; subformulae not involving type `nat' or `int'
9704 are ignored; quantified subformulae are ignored unless they are
9705 positive universal or negative existential. The tactic has to be
9706 invoked by hand and can be a little bit slow. In particular, the
9707 running time is exponential in the number of occurrences of `min' and
9708 `max', and `-' on `nat'.
9710 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
9711 (negated) (in)equalities among the premises and the conclusion into
9712 account (i.e. no compound formulae) and does not know about `min' and
9713 `max', and `-' on `nat'. It is fast and is used automatically by the
9716 NB: At the moment, these decision procedures do not cope with mixed
9717 nat/int formulae where the two parts interact, such as `m < n ==>
9720 * HOL/Numeral provides a generic theory of numerals (encoded
9721 efficiently as bit strings); setup for types nat/int/real is in place;
9722 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
9723 int, existing theories and proof scripts may require a few additional
9726 * integer division and remainder can now be performed on constant
9729 * many properties of integer multiplication, division and remainder
9732 * An interface to the Stanford Validity Checker (SVC) is available through the
9733 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
9734 are proved automatically. SVC must be installed separately, and its results
9735 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
9736 invocation of the underlying oracle). For SVC see
9737 http://verify.stanford.edu/SVC
9739 * IsaMakefile: the HOL-Real target now builds an actual image;
9744 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
9745 (in Isabelle/Isar) -- by Gertrud Bauer;
9747 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
9748 analysis for assembly languages with subtypes;
9750 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
9751 -- avoids syntactic ambiguities and treats state, transition, and
9752 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
9753 changed syntax and (many) tactics;
9755 * HOL/inductive: Now also handles more general introduction rules such
9756 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
9757 theorems are now maintained within the theory (maintained via the
9760 * HOL/datatype: Now also handles arbitrarily branching datatypes
9761 (using function types) such as
9763 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
9765 * HOL/record: record_simproc (part of the default simpset) takes care
9766 of selectors applied to updated records; record_split_tac is no longer
9767 part of the default claset; update_defs may now be removed from the
9768 simpset in many cases; COMPATIBILITY: old behavior achieved by
9770 claset_ref () := claset() addSWrapper record_split_wrapper;
9771 Delsimprocs [record_simproc]
9773 * HOL/typedef: fixed type inference for representing set; type
9774 arguments now have to occur explicitly on the rhs as type constraints;
9776 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
9777 names rather than an ML expression;
9779 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
9780 supplied later. Program schemes can be defined, such as
9781 "While B C s = (if B s then While B C (C s) else s)"
9782 where the well-founded relation can be chosen after B and C have been given.
9784 * HOL/List: the constructors of type list are now Nil and Cons;
9785 INCOMPATIBILITY: while [] and infix # syntax is still there, of
9786 course, ML tools referring to List.list.op # etc. have to be adapted;
9788 * HOL_quantifiers flag superseded by "HOL" print mode, which is
9789 disabled by default; run isabelle with option -m HOL to get back to
9790 the original Gordon/HOL-style output;
9792 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
9793 ALL x<=y. P, EX x<y. P, EX x<=y. P;
9795 * HOL basic syntax simplified (more orthogonal): all variants of
9796 All/Ex now support plain / symbolic / HOL notation; plain syntax for
9797 Eps operator is provided as well: "SOME x. P[x]";
9799 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
9801 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
9802 thus available for user theories;
9804 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
9805 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
9808 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
9809 several times and then mp;
9814 * the notation <<...>> is now available as a notation for sequences of
9817 * the simplifier is now installed
9819 * the axiom system has been generalized (thanks to Soren Heilmann)
9821 * the classical reasoner now has a default rule database
9826 * new primrec section allows primitive recursive functions to be given
9827 directly (as in HOL) over datatypes and the natural numbers;
9829 * new tactics induct_tac and exhaust_tac for induction (or case
9830 analysis) over datatypes and the natural numbers;
9832 * the datatype declaration of type T now defines the recursor T_rec;
9834 * simplification automatically does freeness reasoning for datatype
9837 * automatic type-inference, with AddTCs command to insert new
9838 type-checking rules;
9840 * datatype introduction rules are now added as Safe Introduction rules
9843 * the syntax "if P then x else y" is now available in addition to
9847 *** Internal programming interfaces ***
9849 * tuned simplifier trace output; new flag debug_simp;
9851 * structures Vartab / Termtab (instances of TableFun) offer efficient
9852 tables indexed by indexname_ord / term_ord (compatible with aconv);
9854 * AxClass.axclass_tac lost the theory argument;
9856 * tuned current_goals_markers semantics: begin / end goal avoids
9857 printing empty lines;
9859 * removed prs and prs_fn hook, which was broken because it did not
9860 include \n in its semantics, forcing writeln to add one
9861 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
9862 string -> unit if you really want to output text without newline;
9864 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
9865 plain output, interface builders may have to enable 'isabelle_font'
9866 mode to get Isabelle font glyphs as before;
9868 * refined token_translation interface; INCOMPATIBILITY: output length
9869 now of type real instead of int;
9871 * theory loader actions may be traced via new ThyInfo.add_hook
9872 interface (see src/Pure/Thy/thy_info.ML); example application: keep
9873 your own database of information attached to *whole* theories -- as
9874 opposed to intra-theory data slots offered via TheoryDataFun;
9876 * proper handling of dangling sort hypotheses (at last!);
9877 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
9878 extra sort hypotheses that can be witnessed from the type signature;
9879 the force_strip_shyps flag is gone, any remaining shyps are simply
9880 left in the theorem (with a warning issued by strip_shyps_warning);
9884 New in Isabelle98-1 (October 1998)
9885 ----------------------------------
9887 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9889 * several changes of automated proof tools;
9891 * HOL: major changes to the inductive and datatype packages, including
9892 some minor incompatibilities of theory syntax;
9894 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
9897 * HOL: removed duplicate thms in Arith:
9898 less_imp_add_less should be replaced by trans_less_add1
9899 le_imp_add_le should be replaced by trans_le_add1
9901 * HOL: unary minus is now overloaded (new type constraints may be
9904 * HOL and ZF: unary minus for integers is now #- instead of #~. In
9905 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
9906 now taken as an integer constant.
9908 * Pure: ML function 'theory_of' renamed to 'theory';
9914 1. Asm_full_simp_tac is now more aggressive.
9915 1. It will sometimes reorient premises if that increases their power to
9917 2. It does no longer proceed strictly from left to right but may also
9918 rotate premises to achieve further simplification.
9919 For compatibility reasons there is now Asm_lr_simp_tac which is like the
9920 old Asm_full_simp_tac in that it does not rotate premises.
9921 2. The simplifier now knows a little bit about nat-arithmetic.
9923 * Classical reasoner: wrapper mechanism for the classical reasoner now
9924 allows for selected deletion of wrappers, by introduction of names for
9925 wrapper functionals. This implies that addbefore, addSbefore,
9926 addaltern, and addSaltern now take a pair (name, tactic) as argument,
9927 and that adding two tactics with the same name overwrites the first
9928 one (emitting a warning).
9929 type wrapper = (int -> tactic) -> (int -> tactic)
9930 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
9931 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
9932 delWrapper, delSWrapper: claset * string -> claset
9933 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
9935 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
9936 semantics; addbefore now affects only the unsafe part of step_tac
9937 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
9938 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
9941 * Classical reasoner: setwrapper to setWrapper and compwrapper to
9942 compWrapper; added safe wrapper (and access functions for it);
9944 * HOL/split_all_tac is now much faster and fails if there is nothing
9945 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
9946 and the names of the automatically generated variables have changed.
9947 split_all_tac has moved within claset() from unsafe wrappers to safe
9948 wrappers, which means that !!-bound variables are split much more
9949 aggressively, and safe_tac and clarify_tac now split such variables.
9950 If this splitting is not appropriate, use delSWrapper "split_all_tac".
9951 Note: the same holds for record_split_tac, which does the job of
9952 split_all_tac for record fields.
9954 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
9955 permanently to the default simpset using Addsplits just like
9956 Addsimps. They can be removed via Delsplits just like
9957 Delsimps. Lower-case versions are also available.
9959 * HOL/Simplifier: The rule split_if is now part of the default
9960 simpset. This means that the simplifier will eliminate all occurrences
9961 of if-then-else in the conclusion of a goal. To prevent this, you can
9962 either remove split_if completely from the default simpset by
9963 `Delsplits [split_if]' or remove it in a specific call of the
9964 simplifier using `... delsplits [split_if]'. You can also add/delete
9965 other case splitting rules to/from the default simpset: every datatype
9966 generates suitable rules `split_t_case' and `split_t_case_asm' (where
9967 t is the name of the datatype).
9969 * Classical reasoner / Simplifier combination: new force_tac (and
9970 derivatives Force_tac, force) combines rewriting and classical
9971 reasoning (and whatever other tools) similarly to auto_tac, but is
9972 aimed to solve the given subgoal completely.
9977 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
9978 and `goalw': the theory is no longer needed as an explicit argument -
9979 the current theory context is used; assumptions are no longer returned
9980 at the ML-level unless one of them starts with ==> or !!; it is
9981 recommended to convert to these new commands using isatool fixgoal
9982 (backup your sources first!);
9984 * new top-level commands 'thm' and 'thms' for retrieving theorems from
9985 the current theory context, and 'theory' to lookup stored theories;
9987 * new theory section 'locale' for declaring constants, assumptions and
9988 definitions that have local scope;
9990 * new theory section 'nonterminals' for purely syntactic types;
9992 * new theory section 'setup' for generic ML setup functions
9993 (e.g. package initialization);
9995 * the distribution now includes Isabelle icons: see
9996 lib/logo/isabelle-{small,tiny}.xpm;
9998 * isatool install - install binaries with absolute references to
10001 * isatool logo -- create instances of the Isabelle logo (as EPS);
10003 * print mode 'emacs' reserved for Isamode;
10005 * support multiple print (ast) translations per constant name;
10007 * theorems involving oracles are now printed with a suffixed [!];
10012 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
10014 * HOL/inductive package reorganized and improved: now supports mutual
10015 definitions such as
10020 oddI "n : EVEN ==> Suc n : ODD"
10021 evenI "n : ODD ==> Suc n : EVEN"
10023 new theorem list "elims" contains an elimination rule for each of the
10024 recursive sets; inductive definitions now handle disjunctive premises
10025 correctly (also ZF);
10027 INCOMPATIBILITIES: requires Inductive as an ancestor; component
10028 "mutual_induct" no longer exists - the induction rule is always
10029 contained in "induct";
10032 * HOL/datatype package re-implemented and greatly improved: now
10033 supports mutually recursive datatypes such as
10036 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
10037 | SUM ('a aexp) ('a aexp)
10038 | DIFF ('a aexp) ('a aexp)
10041 'a bexp = LESS ('a aexp) ('a aexp)
10042 | AND ('a bexp) ('a bexp)
10043 | OR ('a bexp) ('a bexp)
10045 as well as indirectly recursive datatypes such as
10048 ('a, 'b) term = Var 'a
10049 | App 'b ((('a, 'b) term) list)
10051 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
10052 induction on mutually / indirectly recursive datatypes.
10054 Primrec equations are now stored in theory and can be accessed via
10055 <function_name>.simps.
10059 - Theories using datatypes must now have theory Datatype as an
10061 - The specific <typename>.induct_tac no longer exists - use the
10062 generic induct_tac instead.
10063 - natE has been renamed to nat.exhaust - use exhaust_tac
10064 instead of res_inst_tac ... natE. Note that the variable
10065 names in nat.exhaust differ from the names in natE, this
10066 may cause some "fragile" proofs to fail.
10067 - The theorems split_<typename>_case and split_<typename>_case_asm
10068 have been renamed to <typename>.split and <typename>.split_asm.
10069 - Since default sorts of type variables are now handled correctly,
10070 some datatype definitions may have to be annotated with explicit
10072 - Primrec definitions no longer require function name and type
10073 of recursive argument.
10075 Consider using isatool fixdatatype to adapt your theories and proof
10076 scripts to the new package (backup your sources first!).
10079 * HOL/record package: considerably improved implementation; now
10080 includes concrete syntax for record types, terms, updates; theorems
10081 for surjective pairing and splitting !!-bound record variables; proof
10082 support is as follows:
10084 1) standard conversions (selectors or updates applied to record
10085 constructor terms) are part of the standard simpset;
10087 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
10088 made part of standard simpset and claset via addIffs;
10090 3) a tactic for record field splitting (record_split_tac) is part of
10091 the standard claset (addSWrapper);
10093 To get a better idea about these rules you may retrieve them via
10094 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
10095 the name of your record type.
10097 The split tactic 3) conceptually simplifies by the following rule:
10099 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
10101 Thus any record variable that is bound by meta-all will automatically
10102 blow up into some record constructor term, consequently the
10103 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
10104 solve record problems automatically.
10107 * reorganized the main HOL image: HOL/Integ and String loaded by
10108 default; theory Main includes everything;
10110 * automatic simplification of integer sums and comparisons, using cancellation;
10112 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
10114 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
10116 * many new identities for unions, intersections, set difference, etc.;
10118 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
10119 called split_if, split_split, split_sum_case and split_nat_case (to go
10120 with add/delsplits);
10122 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
10123 (?x::unit) = (); this is made part of the default simpset, which COULD
10124 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
10125 'Delsimprocs [unit_eq_proc];' as last resort); also note that
10126 unit_abs_eta_conv is added in order to counter the effect of
10127 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
10130 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
10133 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
10134 It and 'sym RS equals0D' are now in the default claset, giving automatic
10135 disjointness reasoning but breaking a few old proofs.
10137 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
10138 to 'converse' from 'inverse' (for compatibility with ZF and some
10141 * HOL/recdef can now declare non-recursive functions, with {} supplied as
10142 the well-founded relation;
10144 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
10145 Compl A. The "Compl" syntax remains available as input syntax for this
10148 * HOL/Update: new theory of function updates:
10149 f(a:=b) == %x. if x=a then b else f x
10150 may also be iterated as in f(a:=b,c:=d,...);
10152 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
10155 - new function list_update written xs[i:=v] that updates the i-th
10156 list position. May also be iterated as in xs[i:=a,j:=b,...].
10157 - new function `upt' written [i..j(] which generates the list
10158 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
10159 bound write [i..j], which is a shorthand for [i..j+1(].
10160 - new lexicographic orderings and corresponding wellfoundedness theorems.
10163 - removed 'pred' (predecessor) function;
10164 - generalized some theorems about n-1;
10165 - many new laws about "div" and "mod";
10166 - new laws about greatest common divisors (see theory ex/Primes);
10168 * HOL/Relation: renamed the relational operator r^-1 "converse"
10169 instead of "inverse";
10171 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
10172 of the multiset ordering;
10174 * directory HOL/Real: a construction of the reals using Dedekind cuts
10175 (not included by default);
10177 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
10179 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
10180 programs, i.e. different program variables may have different types.
10182 * calling (stac rew i) now fails if "rew" has no effect on the goal
10183 [previously, this check worked only if the rewrite rule was unconditional]
10184 Now rew can involve either definitions or equalities (either == or =).
10189 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
10190 only the theorems proved on ZF.ML;
10192 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
10193 It and 'sym RS equals0D' are now in the default claset, giving automatic
10194 disjointness reasoning but breaking a few old proofs.
10196 * ZF/Update: new theory of function updates
10197 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
10198 may also be iterated as in f(a:=b,c:=d,...);
10200 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
10202 * calling (stac rew i) now fails if "rew" has no effect on the goal
10203 [previously, this check worked only if the rewrite rule was unconditional]
10204 Now rew can involve either definitions or equalities (either == or =).
10206 * case_tac provided for compatibility with HOL
10207 (like the old excluded_middle_tac, but with subgoals swapped)
10210 *** Internal programming interfaces ***
10212 * Pure: several new basic modules made available for general use, see
10213 also src/Pure/README;
10215 * improved the theory data mechanism to support encapsulation (data
10216 kind name replaced by private Object.kind, acting as authorization
10217 key); new type-safe user interface via functor TheoryDataFun; generic
10218 print_data function becomes basically useless;
10220 * removed global_names compatibility flag -- all theory declarations
10221 are qualified by default;
10223 * module Pure/Syntax now offers quote / antiquote translation
10224 functions (useful for Hoare logic etc. with implicit dependencies);
10225 see HOL/ex/Antiquote for an example use;
10227 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
10230 * new tactical CHANGED_GOAL for checking that a tactic modifies a
10233 * Display.print_goals function moved to Locale.print_goals;
10235 * standard print function for goals supports current_goals_markers
10236 variable for marking begin of proof, end of proof, start of goal; the
10237 default is ("", "", ""); setting current_goals_markers := ("<proof>",
10238 "</proof>", "<goal>") causes SGML like tagged proof state printing,
10243 New in Isabelle98 (January 1998)
10244 --------------------------------
10246 *** Overview of INCOMPATIBILITIES (see below for more details) ***
10248 * changed lexical syntax of terms / types: dots made part of long
10249 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
10251 * simpset (and claset) reference variable replaced by functions
10252 simpset / simpset_ref;
10254 * no longer supports theory aliases (via merge) and non-trivial
10255 implicit merge of thms' signatures;
10257 * most internal names of constants changed due to qualified names;
10259 * changed Pure/Sequence interface (see Pure/seq.ML);
10262 *** General Changes ***
10264 * hierachically structured name spaces (for consts, types, axms, thms
10265 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
10266 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
10267 isatool fixdots ensures space after dots (e.g. "%x. x"); set
10268 long_names for fully qualified output names; NOTE: ML programs
10269 (special tactics, packages etc.) referring to internal names may have
10270 to be adapted to cope with fully qualified names; in case of severe
10271 backward campatibility problems try setting 'global_names' at compile
10272 time to have enrything declared within a flat name space; one may also
10273 fine tune name declarations in theories via the 'global' and 'local'
10276 * reimplemented the implicit simpset and claset using the new anytype
10277 data filed in signatures; references simpset:simpset ref etc. are
10278 replaced by functions simpset:unit->simpset and
10279 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
10280 to patch your ML files accordingly;
10282 * HTML output now includes theory graph data for display with Java
10283 applet or isatool browser; data generated automatically via isatool
10284 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
10286 * defs may now be conditional; improved rewrite_goals_tac to handle
10287 conditional equations;
10289 * defs now admits additional type arguments, using TYPE('a) syntax;
10291 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
10292 creates a new theory node; implicit merge of thms' signatures is
10293 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
10294 transfer:theory->thm->thm in (rare) cases;
10296 * improved handling of draft signatures / theories; draft thms (and
10297 ctyps, cterms) are automatically promoted to real ones;
10299 * slightly changed interfaces for oracles: admit many per theory, named
10300 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
10302 * print_goals: optional output of const types (set show_consts and
10305 * improved output of warnings (###) and errors (***);
10307 * subgoal_tac displays a warning if the new subgoal has type variables;
10309 * removed old README and Makefiles;
10311 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
10313 * removed obsolete init_pps and init_database;
10315 * deleted the obsolete tactical STATE, which was declared by
10316 fun STATE tacfun st = tacfun st st;
10318 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
10319 (which abbreviates $HOME);
10321 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
10322 use isatool fixseq to adapt your ML programs (this works for fully
10323 qualified references to the Sequence structure only!);
10325 * use_thy no longer requires writable current directory; it always
10326 reloads .ML *and* .thy file, if either one is out of date;
10329 *** Classical Reasoner ***
10331 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
10332 tactics that use classical reasoning to simplify a subgoal without
10333 splitting it into several subgoals;
10335 * Safe_tac: like safe_tac but uses the default claset;
10340 * added simplification meta rules:
10341 (asm_)(full_)simplify: simpset -> thm -> thm;
10343 * simplifier.ML no longer part of Pure -- has to be loaded by object
10346 * added prems argument to simplification procedures;
10348 * HOL, FOL, ZF: added infix function `addsplits':
10349 instead of `<simpset> setloop (split_tac <thms>)'
10350 you can simply write `<simpset> addsplits <thms>'
10355 * TYPE('a) syntax for type reflection terms;
10357 * no longer handles consts with name "" -- declare as 'syntax' instead;
10359 * pretty printer: changed order of mixfix annotation preference (again!);
10361 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
10366 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
10367 with `addloop' of the simplifier to faciliate case splitting in premises.
10369 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
10371 * HOL/Auth: new protocol proofs including some for the Internet
10374 * HOL/Map: new theory of `maps' a la VDM;
10376 * HOL/simplifier: simplification procedures nat_cancel_sums for
10377 cancelling out common nat summands from =, <, <= (in)equalities, or
10378 differences; simplification procedures nat_cancel_factor for
10379 cancelling common factor from =, <, <= (in)equalities over natural
10380 sums; nat_cancel contains both kinds of procedures, it is installed by
10381 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
10383 * HOL/simplifier: terms of the form
10384 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
10386 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
10387 and those of the form
10388 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
10390 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
10393 Each datatype `t' now comes with a theorem `split_t_case' of the form
10395 P(t_case f1 ... fn x) =
10396 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
10398 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
10401 and a theorem `split_t_case_asm' of the form
10403 P(t_case f1 ... fn x) =
10404 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
10406 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
10408 which can be added to a simpset via `addsplits'. The existing theorems
10409 expand_list_case and expand_option_case have been renamed to
10410 split_list_case and split_option_case.
10413 - `pred n' is automatically converted to `n-1'.
10414 Users are strongly encouraged not to use `pred' any longer,
10415 because it will disappear altogether at some point.
10416 - Users are strongly encouraged to write "0 < n" rather than
10417 "n ~= 0". Theorems and proof tools have been modified towards this
10421 the function "set_of_list" has been renamed "set" (and its theorems too);
10422 the function "nth" now takes its arguments in the reverse order and
10423 has acquired the infix notation "!" as in "xs!n".
10425 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
10427 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
10428 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
10430 * HOL/record: extensible records with schematic structural subtyping
10431 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
10432 still lacks various theorems and concrete record syntax;
10437 * removed "axioms" and "generated by" sections;
10439 * replaced "ops" section by extended "consts" section, which is capable of
10440 handling the continuous function space "->" directly;
10443 . proves theorems immediately and stores them in the theory,
10444 . creates hierachical name space,
10445 . now uses normal mixfix annotations (instead of cinfix...),
10446 . minor changes to some names and values (for consistency),
10447 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
10448 . separator between mutual domain defs: changed "," to "and",
10449 . improved handling of sort constraints; now they have to
10450 appear on the left-hand side of the equations only;
10452 * fixed LAM <x,y,zs>.b syntax;
10454 * added extended adm_tac to simplifier in HOLCF -- can now discharge
10455 adm (%x. P (t x)), where P is chainfinite and t continuous;
10460 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
10461 with `addloop' of the simplifier to faciliate case splitting in premises.
10463 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
10464 in HOL, they strip ALL and --> from proved theorems;
10468 New in Isabelle94-8 (May 1997)
10469 ------------------------------
10471 *** General Changes ***
10473 * new utilities to build / run / maintain Isabelle etc. (in parts
10474 still somewhat experimental); old Makefiles etc. still functional;
10476 * new 'Isabelle System Manual';
10478 * INSTALL text, together with ./configure and ./build scripts;
10480 * reimplemented type inference for greater efficiency, better error
10481 messages and clean internal interface;
10483 * prlim command for dealing with lots of subgoals (an easier way of
10484 setting goals_limit);
10489 * supports alternative (named) syntax tables (parser and pretty
10490 printer); internal interface is provided by add_modesyntax(_i);
10492 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
10493 be used in conjunction with the Isabelle symbol font; uses the
10494 "symbols" syntax table;
10496 * added token_translation interface (may translate name tokens in
10497 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
10498 the current print_mode); IMPORTANT: user print translation functions
10499 are responsible for marking newly introduced bounds
10500 (Syntax.mark_boundT);
10502 * token translations for modes "xterm" and "xterm_color" that display
10503 names in bold, underline etc. or colors (which requires a color
10506 * infixes may now be declared with names independent of their syntax;
10508 * added typed_print_translation (like print_translation, but may
10509 access type of constant);
10512 *** Classical Reasoner ***
10514 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
10515 some limitations. Blast_tac...
10516 + ignores addss, addbefore, addafter; this restriction is intrinsic
10517 + ignores elimination rules that don't have the correct format
10518 (the conclusion MUST be a formula variable)
10519 + ignores types, which can make HOL proofs fail
10520 + rules must not require higher-order unification, e.g. apply_type in ZF
10521 [message "Function Var's argument not a bound variable" relates to this]
10522 + its proof strategy is more general but can actually be slower
10524 * substitution with equality assumptions no longer permutes other
10527 * minor changes in semantics of addafter (now called addaltern); renamed
10528 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
10529 (and access functions for it);
10531 * improved combination of classical reasoner and simplifier:
10532 + functions for handling clasimpsets
10533 + improvement of addss: now the simplifier is called _after_ the
10535 + safe variant of addss called addSss: uses safe simplifications
10536 _during_ the safe steps. It is more complete as it allows multiple
10537 instantiations of unknowns (e.g. with slow_tac).
10541 * added interface for simplification procedures (functions that
10542 produce *proven* rewrite rules on the fly, depending on current
10545 * ordering on terms as parameter (used for ordered rewriting);
10547 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
10549 * the solver is now split into a safe and an unsafe part.
10550 This should be invisible for the normal user, except that the
10551 functions setsolver and addsolver have been renamed to setSolver and
10552 addSolver; added safe_asm_full_simp_tac;
10557 * a generic induction tactic `induct_tac' which works for all datatypes and
10558 also for type `nat';
10560 * a generic case distinction tactic `exhaust_tac' which works for all
10561 datatypes and also for type `nat';
10563 * each datatype comes with a function `size';
10565 * patterns in case expressions allow tuple patterns as arguments to
10566 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
10568 * primrec now also works with type nat;
10570 * recdef: a new declaration form, allows general recursive functions to be
10571 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
10573 * the constant for negation has been renamed from "not" to "Not" to
10574 harmonize with FOL, ZF, LK, etc.;
10576 * HOL/ex/LFilter theory of a corecursive "filter" functional for
10579 * HOL/Modelcheck demonstrates invocation of model checker oracle;
10581 * HOL/ex/Ring.thy declares cring_simp, which solves equational
10582 problems in commutative rings, using axiomatic type classes for + and *;
10584 * more examples in HOL/MiniML and HOL/Auth;
10586 * more default rewrite rules for quantifiers, union/intersection;
10588 * a new constant `arbitrary == @x.False';
10590 * HOLCF/IOA replaces old HOL/IOA;
10592 * HOLCF changes: derived all rules and arities
10593 + axiomatic type classes instead of classes
10594 + typedef instead of faking type definitions
10595 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
10596 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
10597 + eliminated the types void, one, tr
10598 + use unit lift and bool lift (with translations) instead of one and tr
10599 + eliminated blift from Lift3.thy (use Def instead of blift)
10600 all eliminated rules are derived as theorems --> no visible changes ;
10605 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
10606 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
10607 as ZF_cs addSIs [equalityI];
10611 New in Isabelle94-7 (November 96)
10612 ---------------------------------
10614 * allowing negative levels (as offsets) in prlev and choplev;
10616 * super-linear speedup for large simplifications;
10618 * FOL, ZF and HOL now use miniscoping: rewriting pushes
10619 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
10620 FAIL); can suppress it using the command Delsimps (ex_simps @
10621 all_simps); De Morgan laws are also now included, by default;
10623 * improved printing of ==> : ~:
10625 * new object-logic "Sequents" adds linear logic, while replacing LK
10626 and Modal (thanks to Sara Kalvala);
10628 * HOL/Auth: correctness proofs for authentication protocols;
10630 * HOL: new auto_tac combines rewriting and classical reasoning (many
10631 examples on HOL/Auth);
10633 * HOL: new command AddIffs for declaring theorems of the form P=Q to
10634 the rewriter and classical reasoner simultaneously;
10636 * function uresult no longer returns theorems in "standard" format;
10637 regain previous version by: val uresult = standard o uresult;
10641 New in Isabelle94-6
10642 -------------------
10644 * oracles -- these establish an interface between Isabelle and trusted
10645 external reasoners, which may deliver results as theorems;
10647 * proof objects (in particular record all uses of oracles);
10649 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
10651 * "constdefs" section in theory files;
10653 * "primrec" section (HOL) no longer requires names;
10655 * internal type "tactic" now simply "thm -> thm Sequence.seq";
10659 New in Isabelle94-5
10660 -------------------
10662 * reduced space requirements;
10664 * automatic HTML generation from theories;
10666 * theory files no longer require "..." (quotes) around most types;
10668 * new examples, including two proofs of the Church-Rosser theorem;
10670 * non-curried (1994) version of HOL is no longer distributed;
10674 New in Isabelle94-4
10675 -------------------
10677 * greatly reduced space requirements;
10679 * theory files (.thy) no longer require \...\ escapes at line breaks;
10681 * searchable theorem database (see the section "Retrieving theorems" on
10682 page 8 of the Reference Manual);
10684 * new examples, including Grabczewski's monumental case study of the
10687 * The previous version of HOL renamed to Old_HOL;
10689 * The new version of HOL (previously called CHOL) uses a curried syntax
10690 for functions. Application looks like f a b instead of f(a,b);
10692 * Mutually recursive inductive definitions finally work in HOL;
10694 * In ZF, pattern-matching on tuples is now available in all abstractions and
10695 translates to the operator "split";
10699 New in Isabelle94-3
10700 -------------------
10702 * new infix operator, addss, allowing the classical reasoner to
10703 perform simplification at each step of its search. Example:
10704 fast_tac (cs addss ss)
10706 * a new logic, CHOL, the same as HOL, but with a curried syntax
10707 for functions. Application looks like f a b instead of f(a,b). Also pairs
10708 look like (a,b) instead of <a,b>;
10710 * PLEASE NOTE: CHOL will eventually replace HOL!
10712 * In CHOL, pattern-matching on tuples is now available in all abstractions.
10713 It translates to the operator "split". A new theory of integers is available;
10715 * In ZF, integer numerals now denote two's-complement binary integers.
10716 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
10718 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
10719 of the Axiom of Choice;
10723 New in Isabelle94-2
10724 -------------------
10726 * Significantly faster resolution;
10728 * the different sections in a .thy file can now be mixed and repeated
10731 * Database of theorems for FOL, HOL and ZF. New
10732 commands including qed, qed_goal and bind_thm store theorems in the database.
10734 * Simple database queries: return a named theorem (get_thm) or all theorems of
10735 a given theory (thms_of), or find out what theory a theorem was proved in
10738 * Bugs fixed in the inductive definition and datatype packages;
10740 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
10741 and HOL_dup_cs obsolete;
10743 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
10746 * Simpler definition of function space in ZF;
10748 * new results about cardinal and ordinal arithmetic in ZF;
10750 * 'subtype' facility in HOL for introducing new types as subsets of existing
10753 :mode=isabelle-news:wrap=hard:maxLineLen=72: