1 Isabelle NEWS -- history of user-relevant changes
2 =================================================
4 (Note: Isabelle/jEdit shows a tree-view of this file in Sidekick.)
7 New in Isabelle2015 (May 2015)
8 ------------------------------
12 * Local theory specification commands may have a 'private' or
13 'qualified' modifier to restrict name space accesses to the local scope,
14 as provided by some "context begin ... end" block. For example:
19 private definition ...
22 qualified definition ...
30 * Command 'experiment' opens an anonymous locale context with private
33 * Command 'notepad' requires proper nesting of begin/end and its proof
34 structure in the body: 'oops' is no longer supported here. Minor
35 INCOMPATIBILITY, use 'sorry' instead.
37 * Command 'named_theorems' declares a dynamic fact within the context,
38 together with an attribute to maintain the content incrementally. This
39 supersedes functor Named_Thms in Isabelle/ML, but with a subtle change
40 of semantics due to external visual order vs. internal reverse order.
42 * 'find_theorems': search patterns which are abstractions are
43 schematically expanded before search. Search results match the naive
44 expectation more closely, particularly wrt. abbreviations.
47 * Commands 'method_setup' and 'attribute_setup' now work within a local
50 * Outer syntax commands are managed authentically within the theory
51 context, without implicit global state. Potential for accidental
52 INCOMPATIBILITY, make sure that required theories are really imported.
54 * Historical command-line terminator ";" is no longer accepted (and
55 already used differently in Isar). Minor INCOMPATIBILITY, use "isabelle
56 update_semicolons" to remove obsolete semicolons from old theory
59 * Structural composition of proof methods (meth1; meth2) in Isar
60 corresponds to (tac1 THEN_ALL_NEW tac2) in ML.
62 * The Eisbach proof method language allows to define new proof methods
63 by combining existing ones with their usual syntax. The "match" proof
64 method provides basic fact/term matching in addition to
65 premise/conclusion matching through Subgoal.focus, and binds fact names
66 from matches as well as term patterns within matches. The Isabelle
67 documentation provides an entry "eisbach" for the Eisbach User Manual.
68 Sources and various examples are in ~~/src/HOL/Eisbach/.
71 *** Prover IDE -- Isabelle/Scala/jEdit ***
73 * Improved folding mode "isabelle" based on Isar syntax. Alternatively,
74 the "sidekick" mode may be used for document structure.
76 * Extended bracket matching based on Isar language structure. System
77 option jedit_structure_limit determines maximum number of lines to scan
80 * Support for BibTeX files: context menu, context-sensitive token
81 marker, SideKick parser.
83 * Document antiquotation @{cite} provides formal markup, which is
84 interpreted semi-formally based on .bib files that happen to be open in
85 the editor (hyperlinks, completion etc.).
87 * Less waste of vertical space via negative line spacing (see Global
90 * Improved graphview panel with optional output of PNG or PDF, for
91 display of 'thy_deps', 'class_deps' etc.
93 * The commands 'thy_deps' and 'class_deps' allow optional bounds to
94 restrict the visualized hierarchy.
96 * Improved scheduling for asynchronous print commands (e.g. provers
97 managed by the Sledgehammer panel) wrt. ongoing document processing.
100 *** Document preparation ***
102 * Document markup commands 'chapter', 'section', 'subsection',
103 'subsubsection', 'text', 'txt', 'text_raw' work uniformly in any
104 context, even before the initial 'theory' command. Obsolete proof
105 commands 'sect', 'subsect', 'subsubsect', 'txt_raw' have been
106 discontinued, use 'section', 'subsection', 'subsubsection', 'text_raw'
107 instead. The old 'header' command is still retained for some time, but
108 should be replaced by 'chapter', 'section' etc. (using "isabelle
109 update_header"). Minor INCOMPATIBILITY.
111 * Official support for "tt" style variants, via \isatt{...} or
112 \begin{isabellett}...\end{isabellett}. The somewhat fragile \verb or
113 verbatim environment of LaTeX is no longer used. This allows @{ML} etc.
114 as argument to other macros (such as footnotes).
116 * Document antiquotation @{verbatim} prints ASCII text literally in "tt"
119 * Discontinued obsolete option "document_graph": session_graph.pdf is
120 produced unconditionally for HTML browser_info and PDF-LaTeX document.
122 * Diagnostic commands and document markup commands within a proof do not
123 affect the command tag for output. Thus commands like 'thm' are subject
124 to proof document structure, and no longer "stick out" accidentally.
125 Commands 'text' and 'txt' merely differ in the LaTeX style, not their
126 tags. Potential INCOMPATIBILITY in exotic situations.
128 * System option "pretty_margin" is superseded by "thy_output_margin",
129 which is also accessible via document antiquotation option "margin".
130 Only the margin for document output may be changed, but not the global
131 pretty printing: that is 76 for plain console output, and adapted
132 dynamically in GUI front-ends. Implementations of document
133 antiquotations need to observe the margin explicitly according to
134 Thy_Output.string_of_margin. Minor INCOMPATIBILITY.
136 * Specification of 'document_files' in the session ROOT file is
137 mandatory for document preparation. The legacy mode with implicit
138 copying of the document/ directory is no longer supported. Minor
144 * Proof methods with explicit instantiation ("rule_tac", "subgoal_tac"
145 etc.) allow an optional context of local variables ('for' declaration):
146 these variables become schematic in the instantiated theorem; this
147 behaviour is analogous to 'for' in attributes "where" and "of".
148 Configuration option rule_insts_schematic (default false) controls use
149 of schematic variables outside the context. Minor INCOMPATIBILITY,
150 declare rule_insts_schematic = true temporarily and update to use local
151 variable declarations or dummy patterns instead.
153 * Explicit instantiation via attributes "where", "of", and proof methods
154 "rule_tac" with derivatives like "subgoal_tac" etc. admit dummy patterns
155 ("_") that stand for anonymous local variables.
157 * Generated schematic variables in standard format of exported facts are
158 incremented to avoid material in the proof context. Rare
159 INCOMPATIBILITY, explicit instantiation sometimes needs to refer to
162 * Lexical separation of signed and unsigned numerals: categories "num"
163 and "float" are unsigned. INCOMPATIBILITY: subtle change in precedence
164 of numeral signs, particularly in expressions involving infix syntax
167 * Old inner token category "xnum" has been discontinued. Potential
168 INCOMPATIBILITY for exotic syntax: may use mixfix grammar with "num"
169 token category instead.
174 * New (co)datatype package:
175 - The 'datatype_new' command has been renamed 'datatype'. The old
176 command of that name is now called 'old_datatype' and is provided
177 by "~~/src/HOL/Library/Old_Datatype.thy". See
178 'isabelle doc datatypes' for information on porting.
181 disc_corec ~> corec_disc
182 disc_corec_iff ~> corec_disc_iff
183 disc_exclude ~> distinct_disc
184 disc_exhaust ~> exhaust_disc
185 disc_map_iff ~> map_disc_iff
186 sel_corec ~> corec_sel
187 sel_exhaust ~> exhaust_sel
190 sel_split ~> split_sel
191 sel_split_asm ~> split_sel_asm
192 strong_coinduct ~> coinduct_strong
193 weak_case_cong ~> case_cong_weak
195 - The "no_code" option to "free_constructors", "datatype_new", and
196 "codatatype" has been renamed "plugins del: code".
198 - The rules "set_empty" have been removed. They are easy
199 consequences of other set rules "by auto".
201 - The rule "set_cases" is now registered with the "[cases set]"
202 attribute. This can influence the behavior of the "cases" proof
203 method when more than one case rule is applicable (e.g., an
204 assumption is of the form "w : set ws" and the method "cases w"
205 is invoked). The solution is to specify the case rule explicitly
206 (e.g. "cases w rule: widget.exhaust").
209 BNF_Comp ~> BNF_Composition
210 BNF_FP_Base ~> BNF_Fixpoint_Base
211 BNF_GFP ~> BNF_Greatest_Fixpoint
212 BNF_LFP ~> BNF_Least_Fixpoint
213 BNF_Constructions_on_Wellorders ~> BNF_Wellorder_Constructions
214 Cardinals/Constructions_on_Wellorders ~> Cardinals/Wellorder_Constructions
216 - Lifting and Transfer setup for basic HOL types sum and prod (also
217 option) is now performed by the BNF package. Theories Lifting_Sum,
218 Lifting_Product and Lifting_Option from Main became obsolete and
219 were removed. Changed definitions of the relators rel_prod and
220 rel_sum (using inductive).
221 INCOMPATIBILITY: use rel_prod.simps and rel_sum.simps instead
222 of rel_prod_def and rel_sum_def.
223 Minor INCOMPATIBILITY: (rarely used by name) transfer theorem names
224 changed (e.g. map_prod_transfer ~> prod.map_transfer).
225 - Parametricity theorems for map functions, relators, set functions,
226 constructors, case combinators, discriminators, selectors and
227 (co)recursors are automatically proved and registered as transfer
230 * Old datatype package:
231 - The old 'datatype' command has been renamed 'old_datatype', and
232 'rep_datatype' has been renamed 'old_rep_datatype'. They are
233 provided by "~~/src/HOL/Library/Old_Datatype.thy". See
234 'isabelle doc datatypes' for information on porting.
237 weak_case_cong ~> case_cong_weak
240 ~~/src/HOL/Datatype.thy ~> ~~/src/HOL/Library/Old_Datatype.thy
244 - Fixed soundness bug related to the strict and non-strict subset
248 - CVC4 is now included with Isabelle instead of CVC3 and run by
250 - Z3 is now always enabled by default, now that it is fully open
251 source. The "z3_non_commercial" option is discontinued.
252 - Minimization is now always enabled by default.
255 - Proof reconstruction, both one-liners and Isar, has been
256 dramatically improved.
257 - Improved support for CVC4 and veriT.
259 * Old and new SMT modules:
260 - The old 'smt' method has been renamed 'old_smt' and moved to
261 'src/HOL/Library/Old_SMT.thy'. It is provided for compatibility,
262 until applications have been ported to use the new 'smt' method. For
263 the method to work, an older version of Z3 (e.g. Z3 3.2 or 4.0) must
264 be installed, and the environment variable "OLD_Z3_SOLVER" must
267 - The 'smt2' method has been renamed 'smt'.
269 - New option 'smt_reconstruction_step_timeout' to limit the
270 reconstruction time of Z3 proof steps in the new 'smt' method.
271 - New option 'smt_statistics' to display statistics of the new 'smt'
272 method, especially runtime statistics of Z3 proof reconstruction.
274 * Lifting: command 'lift_definition' allows to execute lifted constants
275 that have as a return type a datatype containing a subtype. This
276 overcomes long-time limitations in the area of code generation and
277 lifting, and avoids tedious workarounds.
279 * Command and antiquotation "value" provide different evaluation slots
280 (again), where the previous strategy (NBE after ML) serves as default.
281 Minor INCOMPATIBILITY.
283 * Add NO_MATCH-simproc, allows to check for syntactic non-equality.
285 * field_simps: Use NO_MATCH-simproc for distribution rules, to avoid
286 non-termination in case of distributing a division. With this change
287 field_simps is in some cases slightly less powerful, if it fails try to
288 add algebra_simps, or use divide_simps. Minor INCOMPATIBILITY.
290 * Separate class no_zero_divisors has been given up in favour of fully
291 algebraic semiring_no_zero_divisors. INCOMPATIBILITY.
293 * Class linordered_semidom really requires no zero divisors.
296 * Classes division_ring, field and linordered_field always demand
297 "inverse 0 = 0". Given up separate classes division_ring_inverse_zero,
298 field_inverse_zero and linordered_field_inverse_zero. INCOMPATIBILITY.
300 * Classes cancel_ab_semigroup_add / cancel_monoid_add specify explicit
301 additive inverse operation. INCOMPATIBILITY.
303 * Complex powers and square roots. The functions "ln" and "powr" are now
304 overloaded for types real and complex, and 0 powr y = 0 by definition.
305 INCOMPATIBILITY: type constraints may be necessary.
307 * The functions "sin" and "cos" are now defined for any type of sort
308 "{real_normed_algebra_1,banach}" type, so in particular on "real" and
309 "complex" uniformly. Minor INCOMPATIBILITY: type constraints may be
312 * New library of properties of the complex transcendental functions sin,
313 cos, tan, exp, Ln, Arctan, Arcsin, Arccos. Ported from HOL Light.
315 * The factorial function, "fact", now has type "nat => 'a" (of a sort
316 that admits numeric types including nat, int, real and complex.
317 INCOMPATIBILITY: an expression such as "fact 3 = 6" may require a type
318 constraint, and the combination "real (fact k)" is likely to be
319 unsatisfactory. If a type conversion is still necessary, then use
320 "of_nat (fact k)" or "real_of_nat (fact k)".
322 * Removed functions "natfloor" and "natceiling", use "nat o floor" and
323 "nat o ceiling" instead. A few of the lemmas have been retained and
324 adapted: in their names "natfloor"/"natceiling" has been replaced by
325 "nat_floor"/"nat_ceiling".
327 * Qualified some duplicated fact names required for boostrapping the
328 type class hierarchy:
329 ab_add_uminus_conv_diff ~> diff_conv_add_uminus
330 field_inverse_zero ~> inverse_zero
331 field_divide_inverse ~> divide_inverse
332 field_inverse ~> left_inverse
333 Minor INCOMPATIBILITY.
335 * Eliminated fact duplicates:
336 mult_less_imp_less_right ~> mult_right_less_imp_less
337 mult_less_imp_less_left ~> mult_left_less_imp_less
338 Minor INCOMPATIBILITY.
340 * Fact consolidation: even_less_0_iff is subsumed by
341 double_add_less_zero_iff_single_add_less_zero (simp by default anyway).
343 * Generalized and consolidated some theorems concerning divsibility:
344 dvd_reduce ~> dvd_add_triv_right_iff
345 dvd_plus_eq_right ~> dvd_add_right_iff
346 dvd_plus_eq_left ~> dvd_add_left_iff
347 Minor INCOMPATIBILITY.
349 * "even" and "odd" are mere abbreviations for "2 dvd _" and "~ 2 dvd _"
350 and part of theory Main.
351 even_def ~> even_iff_mod_2_eq_zero
354 * Lemma name consolidation: divide_Numeral1 ~> divide_numeral_1. Minor
357 * Bootstrap of listsum as special case of abstract product over lists.
359 listsum_def ~> listsum.eq_foldr
362 * Product over lists via constant "listprod".
364 * Theory List: renamed drop_Suc_conv_tl and nth_drop' to
367 * New infrastructure for compiling, running, evaluating and testing
368 generated code in target languages in HOL/Library/Code_Test. See
369 HOL/Codegenerator_Test/Code_Test* for examples.
372 - Introduced "replicate_mset" operation.
373 - Introduced alternative characterizations of the multiset ordering in
374 "Library/Multiset_Order".
375 - Renamed multiset ordering:
378 \<subset># ~> #\<subset>#
379 \<subseteq># ~> #\<subseteq>#
381 - Introduced abbreviations for ill-named multiset operations:
382 <#, \<subset># abbreviate < (strict subset)
383 <=#, \<le>#, \<subseteq># abbreviate <= (subset or equal)
386 in_multiset_of ~> in_multiset_in_set
387 Multiset.fold ~> fold_mset
388 Multiset.filter ~> filter_mset
390 - Removed mcard, is equal to size.
394 elem_multiset_of_set [simp, intro]
395 comp_fun_commute_plus_mset [simp]
396 comp_fun_commute.fold_mset_insert [OF comp_fun_commute_plus_mset, simp]
397 in_mset_fold_plus_iff [iff]
398 set_of_Union_mset [simp]
399 in_Union_mset_iff [iff]
402 * Library/Sum_of_Squares: simplified and improved "sos" method. Always
403 use local CSDP executable, which is much faster than the NEOS server.
404 The "sos_cert" functionality is invoked as "sos" with additional
405 argument. Minor INCOMPATIBILITY.
407 * HOL-Decision_Procs: New counterexample generator quickcheck
408 [approximation] for inequalities of transcendental functions. Uses
409 hardware floating point arithmetic to randomly discover potential
410 counterexamples. Counterexamples are certified with the "approximation"
411 method. See HOL/Decision_Procs/ex/Approximation_Quickcheck_Ex.thy for
414 * HOL-Probability: Reworked measurability prover
415 - applies destructor rules repeatedly
416 - removed application splitting (replaced by destructor rule)
417 - added congruence rules to rewrite measure spaces under the sets
420 * New proof method "rewrite" (in theory ~~/src/HOL/Library/Rewrite) for
421 single-step rewriting with subterm selection based on patterns.
426 * Subtle change of name space policy: undeclared entries are now
427 considered inaccessible, instead of accessible via the fully-qualified
428 internal name. This mainly affects Name_Space.intern (and derivatives),
429 which may produce an unexpected Long_Name.hidden prefix. Note that
430 contemporary applications use the strict Name_Space.check (and
431 derivatives) instead, which is not affected by the change. Potential
432 INCOMPATIBILITY in rare applications of Name_Space.intern.
434 * Subtle change of error semantics of Toplevel.proof_of: regular user
435 ERROR instead of internal Toplevel.UNDEF.
437 * Basic combinators map, fold, fold_map, split_list, apply are available
438 as parameterized antiquotations, e.g. @{map 4} for lists of quadruples.
440 * Renamed "pairself" to "apply2", in accordance to @{apply 2}.
443 * Former combinators NAMED_CRITICAL and CRITICAL for central critical
444 sections have been discontinued, in favour of the more elementary
445 Multithreading.synchronized and its high-level derivative
446 Synchronized.var (which is usually sufficient in applications). Subtle
447 INCOMPATIBILITY: synchronized access needs to be atomic and cannot be
450 * Synchronized.value (ML) is actually synchronized (as in Scala): subtle
451 change of semantics with minimal potential for INCOMPATIBILITY.
453 * The main operations to certify logical entities are Thm.ctyp_of and
454 Thm.cterm_of with a local context; old-style global theory variants are
455 available as Thm.global_ctyp_of and Thm.global_cterm_of.
458 * Elementary operations in module Thm are no longer pervasive.
459 INCOMPATIBILITY, need to use qualified Thm.prop_of, Thm.cterm_of,
462 * Proper context for various elementary tactics: assume_tac,
463 resolve_tac, eresolve_tac, dresolve_tac, forward_tac, match_tac,
464 compose_tac, Splitter.split_tac etc. INCOMPATIBILITY.
466 * Tactical PARALLEL_ALLGOALS is the most common way to refer to
469 * Goal.prove_multi is superseded by the fully general Goal.prove_common,
470 which also allows to specify a fork priority.
472 * Antiquotation @{command_spec "COMMAND"} is superseded by
473 @{command_keyword COMMAND} (usually without quotes and with PIDE
474 markup). Minor INCOMPATIBILITY.
476 * Cartouches within ML sources are turned into values of type
477 Input.source (with formal position information).
482 * The Isabelle tool "update_cartouches" changes theory files to use
483 cartouches instead of old-style {* verbatim *} or `alt_string` tokens.
485 * The Isabelle tool "build" provides new options -X, -k, -x.
487 * Discontinued old-fashioned "codegen" tool. Code generation can always
488 be externally triggered using an appropriate ROOT file plus a
489 corresponding theory. Parametrization is possible using environment
490 variables, or ML snippets in the most extreme cases. Minor
493 * JVM system property "isabelle.threads" determines size of Scala thread
494 pool, like Isabelle system option "threads" for ML.
496 * JVM system property "isabelle.laf" determines the default Swing
497 look-and-feel, via internal class name or symbolic name as in the jEdit
498 menu Global Options / Appearance.
500 * Support for Proof General and Isar TTY loop has been discontinued.
501 Minor INCOMPATIBILITY, use standard PIDE infrastructure instead.
505 New in Isabelle2014 (August 2014)
506 ---------------------------------
510 * Support for official Standard ML within the Isabelle context.
511 Command 'SML_file' reads and evaluates the given Standard ML file.
512 Toplevel bindings are stored within the theory context; the initial
513 environment is restricted to the Standard ML implementation of
514 Poly/ML, without the add-ons of Isabelle/ML. Commands 'SML_import'
515 and 'SML_export' allow to exchange toplevel bindings between the two
516 separate environments. See also ~~/src/Tools/SML/Examples.thy for
519 * Standard tactics and proof methods such as "clarsimp", "auto" and
520 "safe" now preserve equality hypotheses "x = expr" where x is a free
521 variable. Locale assumptions and chained facts containing "x"
522 continue to be useful. The new method "hypsubst_thin" and the
523 configuration option "hypsubst_thin" (within the attribute name space)
524 restore the previous behavior. INCOMPATIBILITY, especially where
525 induction is done after these methods or when the names of free and
526 bound variables clash. As first approximation, old proofs may be
527 repaired by "using [[hypsubst_thin = true]]" in the critical spot.
529 * More static checking of proof methods, which allows the system to
530 form a closure over the concrete syntax. Method arguments should be
531 processed in the original proof context as far as possible, before
532 operating on the goal state. In any case, the standard discipline for
533 subgoal-addressing needs to be observed: no subgoals or a subgoal
534 number that is out of range produces an empty result sequence, not an
535 exception. Potential INCOMPATIBILITY for non-conformant tactical
538 * Lexical syntax (inner and outer) supports text cartouches with
539 arbitrary nesting, and without escapes of quotes etc. The Prover IDE
540 supports input via ` (backquote).
542 * The outer syntax categories "text" (for formal comments and document
543 markup commands) and "altstring" (for literal fact references) allow
544 cartouches as well, in addition to the traditional mix of quotations.
546 * Syntax of document antiquotation @{rail} now uses \<newline> instead
547 of "\\", to avoid the optical illusion of escaped backslash within
548 string token. General renovation of its syntax using text cartouches.
549 Minor INCOMPATIBILITY.
551 * Discontinued legacy_isub_isup, which was a temporary workaround for
552 Isabelle/ML in Isabelle2013-1. The prover process no longer accepts
553 old identifier syntax with \<^isub> or \<^isup>. Potential
556 * Document antiquotation @{url} produces markup for the given URL,
557 which results in an active hyperlink within the text.
559 * Document antiquotation @{file_unchecked} is like @{file}, but does
560 not check existence within the file-system.
562 * Updated and extended manuals: codegen, datatypes, implementation,
563 isar-ref, jedit, system.
566 *** Prover IDE -- Isabelle/Scala/jEdit ***
568 * Improved Document panel: simplified interaction where every single
569 mouse click (re)opens document via desktop environment or as jEdit
572 * Support for Navigator plugin (with toolbar buttons), with connection
575 * Auxiliary files ('ML_file' etc.) are managed by the Prover IDE.
576 Open text buffers take precedence over copies within the file-system.
578 * Improved support for Isabelle/ML, with jEdit mode "isabelle-ml" for
581 * Improved syntactic and semantic completion mechanism, with simple
582 templates, completion language context, name-space completion,
583 file-name completion, spell-checker completion.
585 * Refined GUI popup for completion: more robust key/mouse event
586 handling and propagation to enclosing text area -- avoid loosing
587 keystrokes with slow / remote graphics displays.
589 * Completion popup supports both ENTER and TAB (default) to select an
590 item, depending on Isabelle options.
592 * Refined insertion of completion items wrt. jEdit text: multiple
593 selections, rectangular selections, rectangular selection as "tall
596 * Integrated spell-checker for document text, comments etc. with
597 completion popup and context-menu.
599 * More general "Query" panel supersedes "Find" panel, with GUI access
600 to commands 'find_theorems' and 'find_consts', as well as print
601 operations for the context. Minor incompatibility in keyboard
602 shortcuts etc.: replace action isabelle-find by isabelle-query.
604 * Search field for all output panels ("Output", "Query", "Info" etc.)
605 to highlight text via regular expression.
607 * Option "jedit_print_mode" (see also "Plugin Options / Isabelle /
608 General") allows to specify additional print modes for the prover
609 process, without requiring old-fashioned command-line invocation of
610 "isabelle jedit -m MODE".
612 * More support for remote files (e.g. http) using standard Java
613 networking operations instead of jEdit virtual file-systems.
615 * Empty editors buffers that are no longer required (e.g.\ via theory
616 imports) are automatically removed from the document model.
618 * Improved monitor panel.
620 * Improved Console/Scala plugin: more uniform scala.Console output,
621 more robust treatment of threads and interrupts.
623 * Improved management of dockable windows: clarified keyboard focus
624 and window placement wrt. main editor view; optional menu item to
625 "Detach" a copy where this makes sense.
627 * New Simplifier Trace panel provides an interactive view of the
628 simplification process, enabled by the "simp_trace_new" attribute
634 * Low-level type-class commands 'classes', 'classrel', 'arities' have
635 been discontinued to avoid the danger of non-trivial axiomatization
636 that is not immediately visible. INCOMPATIBILITY, use regular
637 'instance' command with proof. The required OFCLASS(...) theorem
638 might be postulated via 'axiomatization' beforehand, or the proof
639 finished trivially if the underlying class definition is made vacuous
640 (without any assumptions). See also Isabelle/ML operations
641 Axclass.class_axiomatization, Axclass.classrel_axiomatization,
642 Axclass.arity_axiomatization.
644 * Basic constants of Pure use more conventional names and are always
645 qualified. Rare INCOMPATIBILITY, but with potentially serious
646 consequences, notably for tools in Isabelle/ML. The following
647 renaming needs to be applied:
653 dummy_pattern ~> Pure.dummy_pattern
655 Systematic porting works by using the following theory setup on a
656 *previous* Isabelle version to introduce the new name accesses for the
662 |> Sign.const_alias (Binding.qualify true "Pure" @{binding eq}) "=="
663 |> Sign.const_alias (Binding.qualify true "Pure" @{binding imp}) "==>"
664 |> Sign.const_alias (Binding.qualify true "Pure" @{binding all}) "all"
665 |> Sign.restore_naming thy
668 Thus ML antiquotations like @{const_name Pure.eq} may be used already.
669 Later the application is moved to the current Isabelle version, and
670 the auxiliary aliases are deleted.
672 * Attributes "where" and "of" allow an optional context of local
673 variables ('for' declaration): these variables become schematic in the
674 instantiated theorem.
676 * Obsolete attribute "standard" has been discontinued (legacy since
677 Isabelle2012). Potential INCOMPATIBILITY, use explicit 'for' context
678 where instantiations with schematic variables are intended (for
679 declaration commands like 'lemmas' or attributes like "of"). The
680 following temporary definition may help to port old applications:
682 attribute_setup standard =
683 "Scan.succeed (Thm.rule_attribute (K Drule.export_without_context))"
685 * More thorough check of proof context for goal statements and
686 attributed fact expressions (concerning background theory, declared
687 hyps). Potential INCOMPATIBILITY, tools need to observe standard
688 context discipline. See also Assumption.add_assumes and the more
689 primitive Thm.assume_hyps.
691 * Inner syntax token language allows regular quoted strings "..."
692 (only makes sense in practice, if outer syntax is delimited
693 differently, e.g. via cartouches).
695 * Command 'print_term_bindings' supersedes 'print_binds' for clarity,
696 but the latter is retained some time as Proof General legacy.
698 * Code generator preprocessor: explicit control of simp tracing on a
699 per-constant basis. See attribute "code_preproc".
704 * Code generator: enforce case of identifiers only for strict target
705 language requirements. INCOMPATIBILITY.
707 * Code generator: explicit proof contexts in many ML interfaces.
710 * Code generator: minimize exported identifiers by default. Minor
713 * Code generation for SML and OCaml: dropped arcane "no_signatures"
714 option. Minor INCOMPATIBILITY.
716 * "declare [[code abort: ...]]" replaces "code_abort ...".
719 * "declare [[code drop: ...]]" drops all code equations associated
720 with the given constants.
722 * Code generations are provided for make, fields, extend and truncate
723 operations on records.
725 * Command and antiquotation "value" are now hardcoded against nbe and
726 ML. Minor INCOMPATIBILITY.
728 * Renamed command 'enriched_type' to 'functor'. INCOMPATIBILITY.
730 * The symbol "\<newline>" may be used within char or string literals
731 to represent (Char Nibble0 NibbleA), i.e. ASCII newline.
733 * Qualified String.implode and String.explode. INCOMPATIBILITY.
735 * Simplifier: Enhanced solver of preconditions of rewrite rules can
736 now deal with conjunctions. For help with converting proofs, the old
737 behaviour of the simplifier can be restored like this: declare/using
738 [[simp_legacy_precond]]. This configuration option will disappear
739 again in the future. INCOMPATIBILITY.
741 * Simproc "finite_Collect" is no longer enabled by default, due to
742 spurious crashes and other surprises. Potential INCOMPATIBILITY.
744 * Moved new (co)datatype package and its dependencies from session
745 "HOL-BNF" to "HOL". The commands 'bnf', 'wrap_free_constructors',
746 'datatype_new', 'codatatype', 'primcorec', 'primcorecursive' are now
747 part of theory "Main".
750 FunDef.thy ~> Fun_Def.thy (and Fun_Def_Base.thy)
751 Library/Wfrec.thy ~> Wfrec.thy
752 Library/Zorn.thy ~> Zorn.thy
753 Cardinals/Order_Relation.thy ~> Order_Relation.thy
754 Library/Order_Union.thy ~> Cardinals/Order_Union.thy
755 Cardinals/Cardinal_Arithmetic_Base.thy ~> BNF_Cardinal_Arithmetic.thy
756 Cardinals/Cardinal_Order_Relation_Base.thy ~> BNF_Cardinal_Order_Relation.thy
757 Cardinals/Constructions_on_Wellorders_Base.thy ~> BNF_Constructions_on_Wellorders.thy
758 Cardinals/Wellorder_Embedding_Base.thy ~> BNF_Wellorder_Embedding.thy
759 Cardinals/Wellorder_Relation_Base.thy ~> BNF_Wellorder_Relation.thy
760 BNF/Ctr_Sugar.thy ~> Ctr_Sugar.thy
761 BNF/Basic_BNFs.thy ~> Basic_BNFs.thy
762 BNF/BNF_Comp.thy ~> BNF_Comp.thy
763 BNF/BNF_Def.thy ~> BNF_Def.thy
764 BNF/BNF_FP_Base.thy ~> BNF_FP_Base.thy
765 BNF/BNF_GFP.thy ~> BNF_GFP.thy
766 BNF/BNF_LFP.thy ~> BNF_LFP.thy
767 BNF/BNF_Util.thy ~> BNF_Util.thy
768 BNF/Coinduction.thy ~> Coinduction.thy
769 BNF/More_BNFs.thy ~> Library/More_BNFs.thy
770 BNF/Countable_Type.thy ~> Library/Countable_Set_Type.thy
771 BNF/Examples/* ~> BNF_Examples/*
774 Wellorder_Extension.thy (split from Zorn.thy)
775 Library/Cardinal_Notations.thy
776 Library/BNF_Axomatization.thy
777 BNF_Examples/Misc_Primcorec.thy
778 BNF_Examples/Stream_Processor.thy
780 Discontinued theories:
782 BNF/Equiv_Relations_More.thy
786 * New (co)datatype package:
787 - Command 'primcorec' is fully implemented.
788 - Command 'datatype_new' generates size functions ("size_xxx" and
789 "size") as required by 'fun'.
790 - BNFs are integrated with the Lifting tool and new-style
791 (co)datatypes with Transfer.
793 datatype_new_compat ~> datatype_compat
794 primrec_new ~> primrec
795 wrap_free_constructors ~> free_constructors
797 - The generated constants "xxx_case" and "xxx_rec" have been renamed
798 "case_xxx" and "rec_xxx" (e.g., "prod_case" ~> "case_prod").
800 - The constant "xxx_(un)fold" and related theorems are no longer
801 generated. Use "xxx_(co)rec" or define "xxx_(un)fold" manually
804 - No discriminators are generated for nullary constructors by
805 default, eliminating the need for the odd "=:" syntax.
807 - No discriminators or selectors are generated by default by
808 "datatype_new", unless custom names are specified or the new
809 "discs_sels" option is passed.
812 * Old datatype package:
813 - The generated theorems "xxx.cases" and "xxx.recs" have been
814 renamed "xxx.case" and "xxx.rec" (e.g., "sum.cases" ->
815 "sum.case"). INCOMPATIBILITY.
816 - The generated constants "xxx_case", "xxx_rec", and "xxx_size" have
817 been renamed "case_xxx", "rec_xxx", and "size_xxx" (e.g.,
818 "prod_case" ~> "case_prod"). INCOMPATIBILITY.
820 * The types "'a list" and "'a option", their set and map functions,
821 their relators, and their selectors are now produced using the new
822 BNF-based datatype package.
825 Option.set ~> set_option
826 Option.map ~> map_option
827 option_rel ~> rel_option
830 set_def ~> set_rec[abs_def]
831 map_def ~> map_rec[abs_def]
832 Option.map_def ~> map_option_case[abs_def] (with "case_option" instead of "rec_option")
833 option.recs ~> option.rec
834 list_all2_def ~> list_all2_iff
835 set.simps ~> set_simps (or the slightly different "list.set")
836 map.simps ~> list.map
837 hd.simps ~> list.sel(1)
838 tl.simps ~> list.sel(2-3)
839 the.simps ~> option.sel
843 * The following map functions and relators have been renamed:
850 filter_rel ~> rel_filter
851 fset_rel ~> rel_fset (in "src/HOL/Library/FSet.thy")
852 cset_rel ~> rel_cset (in "src/HOL/Library/Countable_Set_Type.thy")
853 vset ~> rel_vset (in "src/HOL/Library/Quotient_Set.thy")
857 * Lifting and Transfer:
858 - a type variable as a raw type is supported
859 - stronger reflexivity prover
860 - rep_eq is always generated by lift_definition
861 - setup for Lifting/Transfer is now automated for BNFs
862 + holds for BNFs that do not contain a dead variable
863 + relator_eq, relator_mono, relator_distr, relator_domain,
864 relator_eq_onp, quot_map, transfer rules for bi_unique, bi_total,
865 right_unique, right_total, left_unique, left_total are proved
867 + definition of a predicator is generated automatically
868 + simplification rules for a predicator definition are proved
869 automatically for datatypes
870 - consolidation of the setup of Lifting/Transfer
871 + property that a relator preservers reflexivity is not needed any
873 Minor INCOMPATIBILITY.
874 + left_total and left_unique rules are now transfer rules
875 (reflexivity_rule attribute not needed anymore)
877 + Domainp does not have to be a separate assumption in
878 relator_domain theorems (=> more natural statement)
880 - registration of code equations is more robust
881 Potential INCOMPATIBILITY.
882 - respectfulness proof obligation is preprocessed to a more readable
884 Potential INCOMPATIBILITY.
885 - eq_onp is always unfolded in respectfulness proof obligation
886 Potential INCOMPATIBILITY.
887 - unregister lifting setup for Code_Numeral.integer and
889 Potential INCOMPATIBILITY.
890 - Lifting.invariant -> eq_onp
893 * New internal SAT solver "cdclite" that produces models and proof
894 traces. This solver replaces the internal SAT solvers "enumerate" and
895 "dpll". Applications that explicitly used one of these two SAT
896 solvers should use "cdclite" instead. In addition, "cdclite" is now
897 the default SAT solver for the "sat" and "satx" proof methods and
898 corresponding tactics; the old default can be restored using "declare
899 [[sat_solver = zchaff_with_proofs]]". Minor INCOMPATIBILITY.
901 * SMT module: A new version of the SMT module, temporarily called
902 "SMT2", uses SMT-LIB 2 and supports recent versions of Z3 (e.g.,
903 4.3). The new proof method is called "smt2". CVC3 and CVC4 are also
904 supported as oracles. Yices is no longer supported, because no version
905 of the solver can handle both SMT-LIB 2 and quantifiers.
907 * Activation of Z3 now works via "z3_non_commercial" system option
908 (without requiring restart), instead of former settings variable
909 "Z3_NON_COMMERCIAL". The option can be edited in Isabelle/jEdit menu
910 Plugin Options / Isabelle / General.
913 - Z3 can now produce Isar proofs.
915 . New SML-based learning algorithms eliminate the dependency on
916 Python and increase performance and reliability.
917 . MaSh and MeSh are now used by default together with the
918 traditional MePo (Meng-Paulson) relevance filter. To disable
919 MaSh, set the "MaSh" system option in Isabelle/jEdit Plugin
920 Options / Isabelle / General to "none".
924 isar_compress ~> compress
929 * Removed solvers remote_cvc3 and remote_z3. Use cvc3 and z3 instead.
932 - Fixed soundness bug whereby mutually recursive datatypes could
933 take infinite values.
934 - Fixed soundness bug with low-level number functions such as
935 "Abs_Integ" and "Rep_Integ".
936 - Removed "std" option.
937 - Renamed "show_datatypes" to "show_types" and "hide_datatypes" to
940 * Metis: Removed legacy proof method 'metisFT'. Use 'metis
941 (full_types)' instead. INCOMPATIBILITY.
943 * Try0: Added 'algebra' and 'meson' to the set of proof methods.
945 * Adjustion of INF and SUP operations:
946 - Elongated constants INFI and SUPR to INFIMUM and SUPREMUM.
947 - Consolidated theorem names containing INFI and SUPR: have INF and
948 SUP instead uniformly.
949 - More aggressive normalization of expressions involving INF and Inf
951 - INF_image and SUP_image do not unfold composition.
952 - Dropped facts INF_comp, SUP_comp.
953 - Default congruence rules strong_INF_cong and strong_SUP_cong, with
954 simplifier implication in premises. Generalize and replace former
959 * SUP and INF generalized to conditionally_complete_lattice.
961 * Swapped orientation of facts image_comp and vimage_comp:
963 image_compose ~> image_comp [symmetric]
964 image_comp ~> image_comp [symmetric]
965 vimage_compose ~> vimage_comp [symmetric]
966 vimage_comp ~> vimage_comp [symmetric]
970 * Theory reorganization: split of Big_Operators.thy into
971 Groups_Big.thy and Lattices_Big.thy.
973 * Consolidated some facts about big group operators:
975 setsum_0' ~> setsum.neutral
976 setsum_0 ~> setsum.neutral_const
977 setsum_addf ~> setsum.distrib
978 setsum_cartesian_product ~> setsum.cartesian_product
979 setsum_cases ~> setsum.If_cases
980 setsum_commute ~> setsum.commute
981 setsum_cong ~> setsum.cong
982 setsum_delta ~> setsum.delta
983 setsum_delta' ~> setsum.delta'
984 setsum_diff1' ~> setsum.remove
985 setsum_empty ~> setsum.empty
986 setsum_infinite ~> setsum.infinite
987 setsum_insert ~> setsum.insert
988 setsum_inter_restrict'' ~> setsum.inter_filter
989 setsum_mono_zero_cong_left ~> setsum.mono_neutral_cong_left
990 setsum_mono_zero_cong_right ~> setsum.mono_neutral_cong_right
991 setsum_mono_zero_left ~> setsum.mono_neutral_left
992 setsum_mono_zero_right ~> setsum.mono_neutral_right
993 setsum_reindex ~> setsum.reindex
994 setsum_reindex_cong ~> setsum.reindex_cong
995 setsum_reindex_nonzero ~> setsum.reindex_nontrivial
996 setsum_restrict_set ~> setsum.inter_restrict
997 setsum_Plus ~> setsum.Plus
998 setsum_setsum_restrict ~> setsum.commute_restrict
999 setsum_Sigma ~> setsum.Sigma
1000 setsum_subset_diff ~> setsum.subset_diff
1001 setsum_Un_disjoint ~> setsum.union_disjoint
1002 setsum_UN_disjoint ~> setsum.UNION_disjoint
1003 setsum_Un_Int ~> setsum.union_inter
1004 setsum_Union_disjoint ~> setsum.Union_disjoint
1005 setsum_UNION_zero ~> setsum.Union_comp
1006 setsum_Un_zero ~> setsum.union_inter_neutral
1007 strong_setprod_cong ~> setprod.strong_cong
1008 strong_setsum_cong ~> setsum.strong_cong
1009 setprod_1' ~> setprod.neutral
1010 setprod_1 ~> setprod.neutral_const
1011 setprod_cartesian_product ~> setprod.cartesian_product
1012 setprod_cong ~> setprod.cong
1013 setprod_delta ~> setprod.delta
1014 setprod_delta' ~> setprod.delta'
1015 setprod_empty ~> setprod.empty
1016 setprod_infinite ~> setprod.infinite
1017 setprod_insert ~> setprod.insert
1018 setprod_mono_one_cong_left ~> setprod.mono_neutral_cong_left
1019 setprod_mono_one_cong_right ~> setprod.mono_neutral_cong_right
1020 setprod_mono_one_left ~> setprod.mono_neutral_left
1021 setprod_mono_one_right ~> setprod.mono_neutral_right
1022 setprod_reindex ~> setprod.reindex
1023 setprod_reindex_cong ~> setprod.reindex_cong
1024 setprod_reindex_nonzero ~> setprod.reindex_nontrivial
1025 setprod_Sigma ~> setprod.Sigma
1026 setprod_subset_diff ~> setprod.subset_diff
1027 setprod_timesf ~> setprod.distrib
1028 setprod_Un2 ~> setprod.union_diff2
1029 setprod_Un_disjoint ~> setprod.union_disjoint
1030 setprod_UN_disjoint ~> setprod.UNION_disjoint
1031 setprod_Un_Int ~> setprod.union_inter
1032 setprod_Union_disjoint ~> setprod.Union_disjoint
1033 setprod_Un_one ~> setprod.union_inter_neutral
1035 Dropped setsum_cong2 (simple variant of setsum.cong).
1036 Dropped setsum_inter_restrict' (simple variant of setsum.inter_restrict)
1037 Dropped setsum_reindex_id, setprod_reindex_id
1038 (simple variants of setsum.reindex [symmetric], setprod.reindex [symmetric]).
1042 * Abolished slightly odd global lattice interpretation for min/max.
1044 Fact consolidations:
1045 min_max.inf_assoc ~> min.assoc
1046 min_max.inf_commute ~> min.commute
1047 min_max.inf_left_commute ~> min.left_commute
1048 min_max.inf_idem ~> min.idem
1049 min_max.inf_left_idem ~> min.left_idem
1050 min_max.inf_right_idem ~> min.right_idem
1051 min_max.sup_assoc ~> max.assoc
1052 min_max.sup_commute ~> max.commute
1053 min_max.sup_left_commute ~> max.left_commute
1054 min_max.sup_idem ~> max.idem
1055 min_max.sup_left_idem ~> max.left_idem
1056 min_max.sup_inf_distrib1 ~> max_min_distrib2
1057 min_max.sup_inf_distrib2 ~> max_min_distrib1
1058 min_max.inf_sup_distrib1 ~> min_max_distrib2
1059 min_max.inf_sup_distrib2 ~> min_max_distrib1
1060 min_max.distrib ~> min_max_distribs
1061 min_max.inf_absorb1 ~> min.absorb1
1062 min_max.inf_absorb2 ~> min.absorb2
1063 min_max.sup_absorb1 ~> max.absorb1
1064 min_max.sup_absorb2 ~> max.absorb2
1065 min_max.le_iff_inf ~> min.absorb_iff1
1066 min_max.le_iff_sup ~> max.absorb_iff2
1067 min_max.inf_le1 ~> min.cobounded1
1068 min_max.inf_le2 ~> min.cobounded2
1069 le_maxI1, min_max.sup_ge1 ~> max.cobounded1
1070 le_maxI2, min_max.sup_ge2 ~> max.cobounded2
1071 min_max.le_infI1 ~> min.coboundedI1
1072 min_max.le_infI2 ~> min.coboundedI2
1073 min_max.le_supI1 ~> max.coboundedI1
1074 min_max.le_supI2 ~> max.coboundedI2
1075 min_max.less_infI1 ~> min.strict_coboundedI1
1076 min_max.less_infI2 ~> min.strict_coboundedI2
1077 min_max.less_supI1 ~> max.strict_coboundedI1
1078 min_max.less_supI2 ~> max.strict_coboundedI2
1079 min_max.inf_mono ~> min.mono
1080 min_max.sup_mono ~> max.mono
1081 min_max.le_infI, min_max.inf_greatest ~> min.boundedI
1082 min_max.le_supI, min_max.sup_least ~> max.boundedI
1083 min_max.le_inf_iff ~> min.bounded_iff
1084 min_max.le_sup_iff ~> max.bounded_iff
1086 For min_max.inf_sup_aci, prefer (one of) min.commute, min.assoc,
1087 min.left_commute, min.left_idem, max.commute, max.assoc,
1088 max.left_commute, max.left_idem directly.
1090 For min_max.inf_sup_ord, prefer (one of) min.cobounded1,
1091 min.cobounded2, max.cobounded1m max.cobounded2 directly.
1093 For min_ac or max_ac, prefer more general collection ac_simps.
1097 * Theorem disambiguation Inf_le_Sup (on finite sets) ~>
1098 Inf_fin_le_Sup_fin. INCOMPATIBILITY.
1100 * Qualified constant names Wellfounded.acc, Wellfounded.accp.
1103 * Fact generalization and consolidation:
1104 neq_one_mod_two, mod_2_not_eq_zero_eq_one_int ~> not_mod_2_eq_0_eq_1
1108 * Purely algebraic definition of even. Fact generalization and
1110 nat_even_iff_2_dvd, int_even_iff_2_dvd ~> even_iff_2_dvd
1111 even_zero_(nat|int) ~> even_zero
1115 * Abolished neg_numeral.
1116 - Canonical representation for minus one is "- 1".
1117 - Canonical representation for other negative numbers is "- (numeral _)".
1118 - When devising rule sets for number calculation, consider the
1119 following canonical cases: 0, 1, numeral _, - 1, - numeral _.
1120 - HOLogic.dest_number also recognizes numerals in non-canonical forms
1121 like "numeral One", "- numeral One", "- 0" and even "- ... - _".
1122 - Syntax for negative numerals is mere input syntax.
1126 * Reduced name variants for rules on associativity and commutativity:
1128 add_assoc ~> add.assoc
1129 add_commute ~> add.commute
1130 add_left_commute ~> add.left_commute
1131 mult_assoc ~> mult.assoc
1132 mult_commute ~> mult.commute
1133 mult_left_commute ~> mult.left_commute
1134 nat_add_assoc ~> add.assoc
1135 nat_add_commute ~> add.commute
1136 nat_add_left_commute ~> add.left_commute
1137 nat_mult_assoc ~> mult.assoc
1138 nat_mult_commute ~> mult.commute
1139 eq_assoc ~> iff_assoc
1140 eq_left_commute ~> iff_left_commute
1144 * Fact collections add_ac and mult_ac are considered old-fashioned.
1145 Prefer ac_simps instead, or specify rules
1146 (add|mult).(assoc|commute|left_commute) individually.
1148 * Elimination of fact duplicates:
1149 equals_zero_I ~> minus_unique
1150 diff_eq_0_iff_eq ~> right_minus_eq
1151 nat_infinite ~> infinite_UNIV_nat
1152 int_infinite ~> infinite_UNIV_int
1156 * Fact name consolidation:
1157 diff_def, diff_minus, ab_diff_minus ~> diff_conv_add_uminus
1158 minus_le_self_iff ~> neg_less_eq_nonneg
1159 le_minus_self_iff ~> less_eq_neg_nonpos
1160 neg_less_nonneg ~> neg_less_pos
1161 less_minus_self_iff ~> less_neg_neg [simp]
1165 * More simplification rules on unary and binary minus:
1166 add_diff_cancel, add_diff_cancel_left, add_le_same_cancel1,
1167 add_le_same_cancel2, add_less_same_cancel1, add_less_same_cancel2,
1168 add_minus_cancel, diff_add_cancel, le_add_same_cancel1,
1169 le_add_same_cancel2, less_add_same_cancel1, less_add_same_cancel2,
1170 minus_add_cancel, uminus_add_conv_diff. These correspondingly have
1171 been taken away from fact collections algebra_simps and field_simps.
1174 To restore proofs, the following patterns are helpful:
1176 a) Arbitrary failing proof not involving "diff_def":
1177 Consider simplification with algebra_simps or field_simps.
1179 b) Lifting rules from addition to subtraction:
1180 Try with "using <rule for addition> of [... "- _" ...]" by simp".
1182 c) Simplification with "diff_def": just drop "diff_def".
1183 Consider simplification with algebra_simps or field_simps;
1184 or the brute way with
1185 "simp add: diff_conv_add_uminus del: add_uminus_conv_diff".
1187 * Introduce bdd_above and bdd_below in theory
1188 Conditionally_Complete_Lattices, use them instead of explicitly
1189 stating boundedness of sets.
1191 * ccpo.admissible quantifies only over non-empty chains to allow more
1192 syntax-directed proof rules; the case of the empty chain shows up as
1193 additional case in fixpoint induction proofs. INCOMPATIBILITY.
1195 * Removed and renamed theorems in Series:
1196 summable_le ~> suminf_le
1197 suminf_le ~> suminf_le_const
1198 series_pos_le ~> setsum_le_suminf
1199 series_pos_less ~> setsum_less_suminf
1200 suminf_ge_zero ~> suminf_nonneg
1201 suminf_gt_zero ~> suminf_pos
1202 suminf_gt_zero_iff ~> suminf_pos_iff
1203 summable_sumr_LIMSEQ_suminf ~> summable_LIMSEQ
1204 suminf_0_le ~> suminf_nonneg [rotate]
1205 pos_summable ~> summableI_nonneg_bounded
1206 ratio_test ~> summable_ratio_test
1208 removed series_zero, replaced by sums_finite
1210 removed auxiliary lemmas:
1212 sumr_offset, sumr_offset2, sumr_offset3, sumr_offset4, sumr_group,
1213 half, le_Suc_ex_iff, lemma_realpow_diff_sumr,
1214 real_setsum_nat_ivl_bounded, summable_le2, ratio_test_lemma2,
1215 sumr_minus_one_realpow_zerom, sumr_one_lb_realpow_zero,
1216 summable_convergent_sumr_iff, sumr_diff_mult_const
1220 * Replace (F)DERIV syntax by has_derivative:
1221 - "(f has_derivative f') (at x within s)" replaces "FDERIV f x : s : f'"
1223 - "(f has_field_derivative f') (at x within s)" replaces "DERIV f x : s : f'"
1225 - "f differentiable at x within s" replaces "_ differentiable _ in _" syntax
1227 - removed constant isDiff
1229 - "DERIV f x : f'" and "FDERIV f x : f'" syntax is only available as
1232 - "DERIV f x : s : f'" and "FDERIV f x : s : f'" syntax removed.
1234 - Renamed FDERIV_... lemmas to has_derivative_...
1236 - renamed deriv (the syntax constant used for "DERIV _ _ :> _") to DERIV
1238 - removed DERIV_intros, has_derivative_eq_intros
1240 - introduced derivative_intros and deriative_eq_intros which
1241 includes now rules for DERIV, has_derivative and
1242 has_vector_derivative.
1245 differentiable_def ~> real_differentiable_def
1246 differentiableE ~> real_differentiableE
1247 fderiv_def ~> has_derivative_at
1248 field_fderiv_def ~> field_has_derivative_at
1249 isDiff_der ~> differentiable_def
1250 deriv_fderiv ~> has_field_derivative_def
1251 deriv_def ~> DERIV_def
1255 * Include more theorems in continuous_intros. Remove the
1256 continuous_on_intros, isCont_intros collections, these facts are now
1257 in continuous_intros.
1259 * Theorems about complex numbers are now stated only using Re and Im,
1260 the Complex constructor is not used anymore. It is possible to use
1261 primcorec to defined the behaviour of a complex-valued function.
1263 Removed theorems about the Complex constructor from the simpset, they
1264 are available as the lemma collection legacy_Complex_simps. This
1267 i_complex_of_real: "ii * complex_of_real r = Complex 0 r".
1269 Instead the reverse direction is supported with
1270 Complex_eq: "Complex a b = a + \<i> * b"
1272 Moved csqrt from Fundamental_Algebra_Theorem to Complex.
1275 Re/Im ~> complex.sel
1276 complex_Re/Im_zero ~> zero_complex.sel
1277 complex_Re/Im_add ~> plus_complex.sel
1278 complex_Re/Im_minus ~> uminus_complex.sel
1279 complex_Re/Im_diff ~> minus_complex.sel
1280 complex_Re/Im_one ~> one_complex.sel
1281 complex_Re/Im_mult ~> times_complex.sel
1282 complex_Re/Im_inverse ~> inverse_complex.sel
1283 complex_Re/Im_scaleR ~> scaleR_complex.sel
1284 complex_Re/Im_i ~> ii.sel
1285 complex_Re/Im_cnj ~> cnj.sel
1286 Re/Im_cis ~> cis.sel
1288 complex_divide_def ~> divide_complex_def
1289 complex_norm_def ~> norm_complex_def
1290 cmod_def ~> norm_complex_de
1304 * Theory Lubs moved HOL image to HOL-Library. It is replaced by
1305 Conditionally_Complete_Lattices. INCOMPATIBILITY.
1307 * HOL-Library: new theory src/HOL/Library/Tree.thy.
1309 * HOL-Library: removed theory src/HOL/Library/Kleene_Algebra.thy; it
1310 is subsumed by session Kleene_Algebra in AFP.
1312 * HOL-Library / theory RBT: various constants and facts are hidden;
1313 lifting setup is unregistered. INCOMPATIBILITY.
1315 * HOL-Cardinals: new theory src/HOL/Cardinals/Ordinal_Arithmetic.thy.
1317 * HOL-Word: bit representations prefer type bool over type bit.
1321 - Abandoned fact collection "word_arith_alts", which is a duplicate
1322 of "word_arith_wis".
1323 - Dropped first (duplicated) element in fact collections
1324 "sint_word_ariths", "word_arith_alts", "uint_word_ariths",
1325 "uint_word_arith_bintrs".
1327 * HOL-Number_Theory:
1328 - consolidated the proofs of the binomial theorem
1329 - the function fib is again of type nat => nat and not overloaded
1330 - no more references to Old_Number_Theory in the HOL libraries
1335 * HOL-Multivariate_Analysis:
1336 - Type class ordered_real_vector for ordered vector spaces.
1337 - New theory Complex_Basic_Analysis defining complex derivatives,
1338 holomorphic functions, etc., ported from HOL Light's canal.ml.
1339 - Changed order of ordered_euclidean_space to be compatible with
1340 pointwise ordering on products. Therefore instance of
1341 conditionally_complete_lattice and ordered_real_vector.
1342 INCOMPATIBILITY: use box instead of greaterThanLessThan or
1343 explicit set-comprehensions with eucl_less for other (half-)open
1345 - removed dependencies on type class ordered_euclidean_space with
1346 introduction of "cbox" on euclidean_space
1349 mem_interval ~> mem_box
1350 interval_eq_empty ~> box_eq_empty
1351 interval_ne_empty ~> box_ne_empty
1352 interval_sing(1) ~> cbox_sing
1353 interval_sing(2) ~> box_sing
1354 subset_interval_imp ~> subset_box_imp
1355 subset_interval ~> subset_box
1356 open_interval ~> open_box
1357 closed_interval ~> closed_cbox
1358 interior_closed_interval ~> interior_cbox
1359 bounded_closed_interval ~> bounded_cbox
1360 compact_interval ~> compact_cbox
1361 bounded_subset_closed_interval_symmetric ~> bounded_subset_cbox_symmetric
1362 bounded_subset_closed_interval ~> bounded_subset_cbox
1363 mem_interval_componentwiseI ~> mem_box_componentwiseI
1364 convex_box ~> convex_prod
1365 rel_interior_real_interval ~> rel_interior_real_box
1366 convex_interval ~> convex_box
1367 convex_hull_eq_real_interval ~> convex_hull_eq_real_cbox
1368 frechet_derivative_within_closed_interval ~> frechet_derivative_within_cbox
1369 content_closed_interval' ~> content_cbox'
1370 elementary_subset_interval ~> elementary_subset_box
1371 diameter_closed_interval ~> diameter_cbox
1372 frontier_closed_interval ~> frontier_cbox
1373 frontier_open_interval ~> frontier_box
1374 bounded_subset_open_interval_symmetric ~> bounded_subset_box_symmetric
1375 closure_open_interval ~> closure_box
1376 open_closed_interval_convex ~> open_cbox_convex
1377 open_interval_midpoint ~> box_midpoint
1378 content_image_affinity_interval ~> content_image_affinity_cbox
1379 is_interval_interval ~> is_interval_cbox + is_interval_box + is_interval_closed_interval
1380 bounded_interval ~> bounded_closed_interval + bounded_boxes
1382 - respective theorems for intervals over the reals:
1383 content_closed_interval + content_cbox
1384 has_integral + has_integral_real
1385 fine_division_exists + fine_division_exists_real
1386 has_integral_null + has_integral_null_real
1387 tagged_division_union_interval + tagged_division_union_interval_real
1388 has_integral_const + has_integral_const_real
1389 integral_const + integral_const_real
1390 has_integral_bound + has_integral_bound_real
1391 integrable_continuous + integrable_continuous_real
1392 integrable_subinterval + integrable_subinterval_real
1393 has_integral_reflect_lemma + has_integral_reflect_lemma_real
1394 integrable_reflect + integrable_reflect_real
1395 integral_reflect + integral_reflect_real
1396 image_affinity_interval + image_affinity_cbox
1397 image_smult_interval + image_smult_cbox
1398 integrable_const + integrable_const_ivl
1399 integrable_on_subinterval + integrable_on_subcbox
1402 derivative_linear ~> has_derivative_bounded_linear
1403 derivative_is_linear ~> has_derivative_linear
1404 bounded_linear_imp_linear ~> bounded_linear.linear
1407 - Renamed positive_integral to nn_integral:
1409 . Renamed all lemmas "*positive_integral*" to *nn_integral*"
1410 positive_integral_positive ~> nn_integral_nonneg
1412 . Renamed abbreviation integral\<^sup>P to integral\<^sup>N.
1414 - replaced the Lebesgue integral on real numbers by the more general
1415 Bochner integral for functions into a real-normed vector space.
1417 integral_zero ~> integral_zero / integrable_zero
1418 integral_minus ~> integral_minus / integrable_minus
1419 integral_add ~> integral_add / integrable_add
1420 integral_diff ~> integral_diff / integrable_diff
1421 integral_setsum ~> integral_setsum / integrable_setsum
1422 integral_multc ~> integral_mult_left / integrable_mult_left
1423 integral_cmult ~> integral_mult_right / integrable_mult_right
1424 integral_triangle_inequality~> integral_norm_bound
1425 integrable_nonneg ~> integrableI_nonneg
1426 integral_positive ~> integral_nonneg_AE
1427 integrable_abs_iff ~> integrable_abs_cancel
1428 positive_integral_lim_INF ~> nn_integral_liminf
1429 lebesgue_real_affine ~> lborel_real_affine
1430 borel_integral_has_integral ~> has_integral_lebesgue_integral
1431 integral_indicator ~>
1432 integral_real_indicator / integrable_real_indicator
1433 positive_integral_fst ~> nn_integral_fst'
1434 positive_integral_fst_measurable ~> nn_integral_fst
1435 positive_integral_snd_measurable ~> nn_integral_snd
1437 integrable_fst_measurable ~>
1438 integral_fst / integrable_fst / AE_integrable_fst
1440 integrable_snd_measurable ~>
1441 integral_snd / integrable_snd / AE_integrable_snd
1443 integral_monotone_convergence ~>
1444 integral_monotone_convergence / integrable_monotone_convergence
1446 integral_monotone_convergence_at_top ~>
1447 integral_monotone_convergence_at_top /
1448 integrable_monotone_convergence_at_top
1450 has_integral_iff_positive_integral_lebesgue ~>
1451 has_integral_iff_has_bochner_integral_lebesgue_nonneg
1453 lebesgue_integral_has_integral ~>
1454 has_integral_integrable_lebesgue_nonneg
1456 positive_integral_lebesgue_has_integral ~>
1457 integral_has_integral_lebesgue_nonneg /
1458 integrable_has_integral_lebesgue_nonneg
1460 lebesgue_integral_real_affine ~>
1461 nn_integral_real_affine
1463 has_integral_iff_positive_integral_lborel ~>
1464 integral_has_integral_nonneg / integrable_has_integral_nonneg
1466 The following theorems where removed:
1468 lebesgue_integral_nonneg
1469 lebesgue_integral_uminus
1470 lebesgue_integral_cmult
1471 lebesgue_integral_multc
1472 lebesgue_integral_cmult_nonneg
1473 integral_cmul_indicator
1476 - Formalized properties about exponentially, Erlang, and normal
1477 distributed random variables.
1479 * HOL-Decision_Procs: Separate command 'approximate' for approximative
1480 computation in src/HOL/Decision_Procs/Approximation. Minor
1486 * The signature and semantics of Document.Snapshot.cumulate_markup /
1487 select_markup have been clarified. Markup is now traversed in the
1488 order of reports given by the prover: later markup is usually more
1489 specific and may override results accumulated so far. The elements
1490 guard is mandatory and checked precisely. Subtle INCOMPATIBILITY.
1492 * Substantial reworking of internal PIDE protocol communication
1493 channels. INCOMPATIBILITY.
1498 * Subtle change of semantics of Thm.eq_thm: theory stamps are not
1499 compared (according to Thm.thm_ord), but assumed to be covered by the
1500 current background theory. Thus equivalent data produced in different
1501 branches of the theory graph usually coincides (e.g. relevant for
1502 theory merge). Note that the softer Thm.eq_thm_prop is often more
1503 appropriate than Thm.eq_thm.
1505 * Proper context for basic Simplifier operations: rewrite_rule,
1506 rewrite_goals_rule, rewrite_goals_tac etc. INCOMPATIBILITY, need to
1507 pass runtime Proof.context (and ensure that the simplified entity
1508 actually belongs to it).
1510 * Proper context discipline for read_instantiate and instantiate_tac:
1511 variables that are meant to become schematic need to be given as
1512 fixed, and are generalized by the explicit context of local variables.
1513 This corresponds to Isar attributes "where" and "of" with 'for'
1514 declaration. INCOMPATIBILITY, also due to potential change of indices
1515 of schematic variables.
1517 * Moved ML_Compiler.exn_trace and other operations on exceptions to
1518 structure Runtime. Minor INCOMPATIBILITY.
1520 * Discontinued old Toplevel.debug in favour of system option
1521 "ML_exception_trace", which may be also declared within the context
1522 via "declare [[ML_exception_trace = true]]". Minor INCOMPATIBILITY.
1524 * Renamed configuration option "ML_trace" to "ML_source_trace". Minor
1527 * Configuration option "ML_print_depth" controls the pretty-printing
1528 depth of the ML compiler within the context. The old print_depth in
1529 ML is still available as default_print_depth, but rarely used. Minor
1532 * Toplevel function "use" refers to raw ML bootstrap environment,
1533 without Isar context nor antiquotations. Potential INCOMPATIBILITY.
1534 Note that 'ML_file' is the canonical command to load ML files into the
1537 * Simplified programming interface to define ML antiquotations, see
1538 structure ML_Antiquotation. Minor INCOMPATIBILITY.
1540 * ML antiquotation @{here} refers to its source position, which is
1541 occasionally useful for experimentation and diagnostic purposes.
1543 * ML antiquotation @{path} produces a Path.T value, similarly to
1544 Path.explode, but with compile-time check against the file-system and
1545 some PIDE markup. Note that unlike theory source, ML does not have a
1546 well-defined master directory, so an absolute symbolic path
1547 specification is usually required, e.g. "~~/src/HOL".
1549 * ML antiquotation @{print} inlines a function to print an arbitrary
1550 ML value, which is occasionally useful for diagnostic or demonstration
1556 * Proof General with its traditional helper scripts is now an optional
1557 Isabelle component, e.g. see ProofGeneral-4.2-2 from the Isabelle
1558 component repository http://isabelle.in.tum.de/components/. Note that
1559 the "system" manual provides general explanations about add-on
1560 components, especially those that are not bundled with the release.
1562 * The raw Isabelle process executable has been renamed from
1563 "isabelle-process" to "isabelle_process", which conforms to common
1564 shell naming conventions, and allows to define a shell function within
1565 the Isabelle environment to avoid dynamic path lookup. Rare
1566 incompatibility for old tools that do not use the ISABELLE_PROCESS
1569 * Former "isabelle tty" has been superseded by "isabelle console",
1570 with implicit build like "isabelle jedit", and without the mostly
1571 obsolete Isar TTY loop.
1573 * Simplified "isabelle display" tool. Settings variables DVI_VIEWER
1574 and PDF_VIEWER now refer to the actual programs, not shell
1575 command-lines. Discontinued option -c: invocation may be asynchronous
1576 via desktop environment, without any special precautions. Potential
1577 INCOMPATIBILITY with ambitious private settings.
1579 * Removed obsolete "isabelle unsymbolize". Note that the usual format
1580 for email communication is the Unicode rendering of Isabelle symbols,
1581 as produced by Isabelle/jEdit, for example.
1583 * Removed obsolete tool "wwwfind". Similar functionality may be
1584 integrated into Isabelle/jEdit eventually.
1586 * Improved 'display_drafts' concerning desktop integration and
1587 repeated invocation in PIDE front-end: re-use single file
1588 $ISABELLE_HOME_USER/tmp/drafts.pdf and corresponding views.
1590 * Session ROOT specifications require explicit 'document_files' for
1591 robust dependencies on LaTeX sources. Only these explicitly given
1592 files are copied to the document output directory, before document
1593 processing is started.
1595 * Windows: support for regular TeX installation (e.g. MiKTeX) instead
1596 of TeX Live from Cygwin.
1600 New in Isabelle2013-2 (December 2013)
1601 -------------------------------------
1603 *** Prover IDE -- Isabelle/Scala/jEdit ***
1605 * More robust editing of running commands with internal forks,
1606 e.g. non-terminating 'by' steps.
1608 * More relaxed Sledgehammer panel: avoid repeated application of query
1609 after edits surrounding the command location.
1611 * More status information about commands that are interrupted
1612 accidentally (via physical event or Poly/ML runtime system signal,
1613 e.g. out-of-memory).
1618 * More robust termination of external processes managed by
1619 Isabelle/ML: support cancellation of tasks within the range of
1620 milliseconds, as required for PIDE document editing with automatically
1621 tried tools (e.g. Sledgehammer).
1623 * Reactivated Isabelle/Scala kill command for external processes on
1624 Mac OS X, which was accidentally broken in Isabelle2013-1 due to a
1625 workaround for some Debian/Ubuntu Linux versions from 2013.
1629 New in Isabelle2013-1 (November 2013)
1630 -------------------------------------
1634 * Discontinued obsolete 'uses' within theory header. Note that
1635 commands like 'ML_file' work without separate declaration of file
1636 dependencies. Minor INCOMPATIBILITY.
1638 * Discontinued redundant 'use' command, which was superseded by
1639 'ML_file' in Isabelle2013. Minor INCOMPATIBILITY.
1641 * Simplified subscripts within identifiers, using plain \<^sub>
1642 instead of the second copy \<^isub> and \<^isup>. Superscripts are
1643 only for literal tokens within notation; explicit mixfix annotations
1644 for consts or fixed variables may be used as fall-back for unusual
1645 names. Obsolete \<twosuperior> has been expanded to \<^sup>2 in
1646 Isabelle/HOL. INCOMPATIBILITY, use "isabelle update_sub_sup" to
1647 standardize symbols as a starting point for further manual cleanup.
1648 The ML reference variable "legacy_isub_isup" may be set as temporary
1649 workaround, to make the prover accept a subset of the old identifier
1652 * Document antiquotations: term style "isub" has been renamed to
1653 "sub". Minor INCOMPATIBILITY.
1655 * Uniform management of "quick_and_dirty" as system option (see also
1656 "isabelle options"), configuration option within the context (see also
1657 Config.get in Isabelle/ML), and attribute in Isabelle/Isar. Minor
1658 INCOMPATIBILITY, need to use more official Isabelle means to access
1659 quick_and_dirty, instead of historical poking into mutable reference.
1661 * Renamed command 'print_configs' to 'print_options'. Minor
1664 * Proper diagnostic command 'print_state'. Old 'pr' (with its
1665 implicit change of some global references) is retained for now as
1666 control command, e.g. for ProofGeneral 3.7.x.
1668 * Discontinued 'print_drafts' command with its old-fashioned PS output
1669 and Unix command-line print spooling. Minor INCOMPATIBILITY: use
1670 'display_drafts' instead and print via the regular document viewer.
1672 * Updated and extended "isar-ref" and "implementation" manual,
1673 eliminated old "ref" manual.
1676 *** Prover IDE -- Isabelle/Scala/jEdit ***
1678 * New manual "jedit" for Isabelle/jEdit, see isabelle doc or
1679 Documentation panel.
1681 * Dockable window "Documentation" provides access to Isabelle
1684 * Dockable window "Find" provides query operations for formal entities
1685 (GUI front-end to 'find_theorems' command).
1687 * Dockable window "Sledgehammer" manages asynchronous / parallel
1688 sledgehammer runs over existing document sources, independently of
1689 normal editing and checking process.
1691 * Dockable window "Timing" provides an overview of relevant command
1692 timing information, depending on option jedit_timing_threshold. The
1693 same timing information is shown in the extended tooltip of the
1694 command keyword, when hovering the mouse over it while the CONTROL or
1695 COMMAND modifier is pressed.
1697 * Improved dockable window "Theories": Continuous checking of proof
1698 document (visible and required parts) may be controlled explicitly,
1699 using check box or shortcut "C+e ENTER". Individual theory nodes may
1700 be marked explicitly as required and checked in full, using check box
1701 or shortcut "C+e SPACE".
1703 * Improved completion mechanism, which is now managed by the
1704 Isabelle/jEdit plugin instead of SideKick. Refined table of Isabelle
1705 symbol abbreviations (see $ISABELLE_HOME/etc/symbols).
1707 * Standard jEdit keyboard shortcut C+b complete-word is remapped to
1708 isabelle.complete for explicit completion in Isabelle sources.
1709 INCOMPATIBILITY wrt. jEdit defaults, may have to invent new shortcuts
1710 to resolve conflict.
1712 * Improved support of various "minor modes" for Isabelle NEWS,
1713 options, session ROOT etc., with completion and SideKick tree view.
1715 * Strictly monotonic document update, without premature cancellation of
1716 running transactions that are still needed: avoid reset/restart of
1717 such command executions while editing.
1719 * Support for asynchronous print functions, as overlay to existing
1722 * Support for automatic tools in HOL, which try to prove or disprove
1723 toplevel theorem statements.
1725 * Action isabelle.reset-font-size resets main text area font size
1726 according to Isabelle/Scala plugin option "jedit_font_reset_size" (see
1727 also "Plugin Options / Isabelle / General"). It can be bound to some
1728 keyboard shortcut by the user (e.g. C+0 and/or C+NUMPAD0).
1730 * File specifications in jEdit (e.g. file browser) may refer to
1731 $ISABELLE_HOME and $ISABELLE_HOME_USER on all platforms. Discontinued
1732 obsolete $ISABELLE_HOME_WINDOWS variable.
1734 * Improved support for Linux look-and-feel "GTK+", see also "Utilities
1735 / Global Options / Appearance".
1737 * Improved support of native Mac OS X functionality via "MacOSX"
1738 plugin, which is now enabled by default.
1743 * Commands 'interpretation' and 'sublocale' are now target-sensitive.
1744 In particular, 'interpretation' allows for non-persistent
1745 interpretation within "context ... begin ... end" blocks offering a
1746 light-weight alternative to 'sublocale'. See "isar-ref" manual for
1749 * Improved locales diagnostic command 'print_dependencies'.
1751 * Discontinued obsolete 'axioms' command, which has been marked as
1752 legacy since Isabelle2009-2. INCOMPATIBILITY, use 'axiomatization'
1753 instead, while observing its uniform scope for polymorphism.
1755 * Discontinued empty name bindings in 'axiomatization'.
1758 * System option "proofs" has been discontinued. Instead the global
1759 state of Proofterm.proofs is persistently compiled into logic images
1760 as required, notably HOL-Proofs. Users no longer need to change
1761 Proofterm.proofs dynamically. Minor INCOMPATIBILITY.
1763 * Syntax translation functions (print_translation etc.) always depend
1764 on Proof.context. Discontinued former "(advanced)" option -- this is
1765 now the default. Minor INCOMPATIBILITY.
1767 * Former global reference trace_unify_fail is now available as
1768 configuration option "unify_trace_failure" (global context only).
1770 * SELECT_GOAL now retains the syntactic context of the overall goal
1771 state (schematic variables etc.). Potential INCOMPATIBILITY in rare
1777 * Stronger precedence of syntax for big intersection and union on
1778 sets, in accordance with corresponding lattice operations.
1781 * Notation "{p:A. P}" now allows tuple patterns as well.
1783 * Nested case expressions are now translated in a separate check phase
1784 rather than during parsing. The data for case combinators is separated
1785 from the datatype package. The declaration attribute
1786 "case_translation" can be used to register new case combinators:
1788 declare [[case_translation case_combinator constructor1 ... constructorN]]
1791 - 'code_printing' unifies 'code_const' / 'code_type' / 'code_class' /
1793 - 'code_identifier' declares name hints for arbitrary identifiers in
1794 generated code, subsuming 'code_modulename'.
1796 See the isar-ref manual for syntax diagrams, and the HOL theories for
1799 * Attibute 'code': 'code' now declares concrete and abstract code
1800 equations uniformly. Use explicit 'code equation' and 'code abstract'
1801 to distinguish both when desired.
1803 * Discontinued theories Code_Integer and Efficient_Nat by a more
1804 fine-grain stack of theories Code_Target_Int, Code_Binary_Nat,
1805 Code_Target_Nat and Code_Target_Numeral. See the tutorial on code
1806 generation for details. INCOMPATIBILITY.
1808 * Numeric types are mapped by default to target language numerals:
1809 natural (replaces former code_numeral) and integer (replaces former
1810 code_int). Conversions are available as integer_of_natural /
1811 natural_of_integer / integer_of_nat / nat_of_integer (in HOL) and
1812 Code_Numeral.integer_of_natural / Code_Numeral.natural_of_integer (in
1813 ML). INCOMPATIBILITY.
1815 * Function package: For mutually recursive functions f and g, separate
1816 cases rules f.cases and g.cases are generated instead of unusable
1817 f_g.cases which exposed internal sum types. Potential INCOMPATIBILITY,
1818 in the case that the unusable rule was used nevertheless.
1820 * Function package: For each function f, new rules f.elims are
1821 generated, which eliminate equalities of the form "f x = t".
1823 * New command 'fun_cases' derives ad-hoc elimination rules for
1824 function equations as simplified instances of f.elims, analogous to
1825 inductive_cases. See ~~/src/HOL/ex/Fundefs.thy for some examples.
1828 - parametrized correspondence relations are now supported:
1829 + parametricity theorems for the raw term can be specified in
1830 the command lift_definition, which allow us to generate stronger
1832 + setup_lifting generates stronger transfer rules if parametric
1833 correspondence relation can be generated
1834 + various new properties of the relator must be specified to support
1836 + parametricity theorem for the Quotient relation can be specified
1837 - setup_lifting generates domain rules for the Transfer package
1838 - stronger reflexivity prover of respectfulness theorems for type
1840 - ===> and --> are now local. The symbols can be introduced
1841 by interpreting the locale lifting_syntax (typically in an
1843 - Lifting/Transfer relevant parts of Library/Quotient_* are now in
1844 Main. Potential INCOMPATIBILITY
1845 - new commands for restoring and deleting Lifting/Transfer context:
1846 lifting_forget, lifting_update
1847 - the command print_quotmaps was renamed to print_quot_maps.
1851 - better support for domains in Transfer: replace Domainp T
1852 by the actual invariant in a transferred goal
1853 - transfer rules can have as assumptions other transfer rules
1854 - Experimental support for transferring from the raw level to the
1855 abstract level: Transfer.transferred attribute
1856 - Attribute version of the transfer method: untransferred attribute
1858 * Reification and reflection:
1859 - Reification is now directly available in HOL-Main in structure
1861 - Reflection now handles multiple lists with variables also.
1862 - The whole reflection stack has been decomposed into conversions.
1865 * Revised devices for recursive definitions over finite sets:
1866 - Only one fundamental fold combinator on finite set remains:
1867 Finite_Set.fold :: ('a => 'b => 'b) => 'b => 'a set => 'b
1868 This is now identity on infinite sets.
1869 - Locales ("mini packages") for fundamental definitions with
1870 Finite_Set.fold: folding, folding_idem.
1871 - Locales comm_monoid_set, semilattice_order_set and
1872 semilattice_neutr_order_set for big operators on sets.
1873 See theory Big_Operators for canonical examples.
1874 Note that foundational constants comm_monoid_set.F and
1875 semilattice_set.F correspond to former combinators fold_image
1876 and fold1 respectively. These are now gone. You may use
1877 those foundational constants as substitutes, but it is
1878 preferable to interpret the above locales accordingly.
1879 - Dropped class ab_semigroup_idem_mult (special case of lattice,
1880 no longer needed in connection with Finite_Set.fold etc.)
1882 card.union_inter ~> card_Un_Int [symmetric]
1883 card.union_disjoint ~> card_Un_disjoint
1886 * Locale hierarchy for abstract orderings and (semi)lattices.
1888 * Complete_Partial_Order.admissible is defined outside the type class
1889 ccpo, but with mandatory prefix ccpo. Admissibility theorems lose the
1890 class predicate assumption or sort constraint when possible.
1893 * Introduce type class "conditionally_complete_lattice": Like a
1894 complete lattice but does not assume the existence of the top and
1895 bottom elements. Allows to generalize some lemmas about reals and
1896 extended reals. Removed SupInf and replaced it by the instantiation
1897 of conditionally_complete_lattice for real. Renamed lemmas about
1898 conditionally-complete lattice from Sup_... to cSup_... and from
1899 Inf_... to cInf_... to avoid hidding of similar complete lattice
1902 * Introduce type class linear_continuum as combination of
1903 conditionally-complete lattices and inner dense linorders which have
1904 more than one element. INCOMPATIBILITY.
1906 * Introduced type classes order_top and order_bot. The old classes top
1907 and bot only contain the syntax without assumptions. INCOMPATIBILITY:
1908 Rename bot -> order_bot, top -> order_top
1910 * Introduce type classes "no_top" and "no_bot" for orderings without
1911 top and bottom elements.
1913 * Split dense_linorder into inner_dense_order and no_top, no_bot.
1915 * Complex_Main: Unify and move various concepts from
1916 HOL-Multivariate_Analysis to HOL-Complex_Main.
1918 - Introduce type class (lin)order_topology and
1919 linear_continuum_topology. Allows to generalize theorems about
1920 limits and order. Instances are reals and extended reals.
1922 - continuous and continuos_on from Multivariate_Analysis:
1923 "continuous" is the continuity of a function at a filter. "isCont"
1924 is now an abbrevitation: "isCont x f == continuous (at _) f".
1926 Generalized continuity lemmas from isCont to continuous on an
1929 - compact from Multivariate_Analysis. Use Bolzano's lemma to prove
1930 compactness of closed intervals on reals. Continuous functions
1931 attain infimum and supremum on compact sets. The inverse of a
1932 continuous function is continuous, when the function is continuous
1935 - connected from Multivariate_Analysis. Use it to prove the
1936 intermediate value theorem. Show connectedness of intervals on
1937 linear_continuum_topology).
1939 - first_countable_topology from Multivariate_Analysis. Is used to
1940 show equivalence of properties on the neighbourhood filter of x and
1941 on all sequences converging to x.
1943 - FDERIV: Definition of has_derivative moved to Deriv.thy. Moved
1944 theorems from Library/FDERIV.thy to Deriv.thy and base the
1945 definition of DERIV on FDERIV. Add variants of DERIV and FDERIV
1946 which are restricted to sets, i.e. to represent derivatives from
1949 - Removed the within-filter. It is replaced by the principal filter:
1951 F within X = inf F (principal X)
1953 - Introduce "at x within U" as a single constant, "at x" is now an
1954 abbreviation for "at x within UNIV"
1956 - Introduce named theorem collections tendsto_intros,
1957 continuous_intros, continuous_on_intros and FDERIV_intros. Theorems
1958 in tendsto_intros (or FDERIV_intros) are also available as
1959 tendsto_eq_intros (or FDERIV_eq_intros) where the right-hand side
1960 is replaced by a congruence rule. This allows to apply them as
1961 intro rules and then proving equivalence by the simplifier.
1963 - Restructured theories in HOL-Complex_Main:
1965 + Moved RealDef and RComplete into Real
1967 + Introduced Topological_Spaces and moved theorems about
1968 topological spaces, filters, limits and continuity to it
1970 + Renamed RealVector to Real_Vector_Spaces
1972 + Split Lim, SEQ, Series into Topological_Spaces,
1973 Real_Vector_Spaces, and Limits
1975 + Moved Ln and Log to Transcendental
1977 + Moved theorems about continuity from Deriv to Topological_Spaces
1979 - Remove various auxiliary lemmas.
1984 - Added option "spy".
1985 - Reduce incidence of "too high arity" errors.
1989 isar_shrink ~> isar_compress
1991 - Added options "isar_try0", "spy".
1992 - Better support for "isar_proofs".
1993 - MaSh has been fined-tuned and now runs as a local server.
1995 * Improved support for ad hoc overloading of constants (see also
1996 isar-ref manual and ~~/src/HOL/ex/Adhoc_Overloading_Examples.thy).
1998 * Library/Polynomial.thy:
1999 - Use lifting for primitive definitions.
2000 - Explicit conversions from and to lists of coefficients, used for
2002 - Replaced recursion operator poly_rec by fold_coeffs.
2003 - Prefer pre-existing gcd operation for gcd.
2005 poly_eq_iff ~> poly_eq_poly_eq_iff
2006 poly_ext ~> poly_eqI
2007 expand_poly_eq ~> poly_eq_iff
2010 * New Library/Simps_Case_Conv.thy: Provides commands simps_of_case and
2011 case_of_simps to convert function definitions between a list of
2012 equations with patterns on the lhs and a single equation with case
2013 expressions on the rhs. See also Ex/Simps_Case_Conv_Examples.thy.
2015 * New Library/FSet.thy: type of finite sets defined as a subtype of
2016 sets defined by Lifting/Transfer.
2018 * Discontinued theory src/HOL/Library/Eval_Witness. INCOMPATIBILITY.
2020 * Consolidation of library theories on product orders:
2022 Product_Lattice ~> Product_Order -- pointwise order on products
2023 Product_ord ~> Product_Lexorder -- lexicographic order on products
2027 * Imperative-HOL: The MREC combinator is considered legacy and no
2028 longer included by default. INCOMPATIBILITY, use partial_function
2029 instead, or import theory Legacy_Mrec as a fallback.
2031 * HOL-Algebra: Discontinued theories ~~/src/HOL/Algebra/abstract and
2032 ~~/src/HOL/Algebra/poly. Existing theories should be based on
2033 ~~/src/HOL/Library/Polynomial instead. The latter provides
2034 integration with HOL's type classes for rings. INCOMPATIBILITY.
2037 - Various improvements to BNF-based (co)datatype package, including
2038 new commands "primrec_new", "primcorec", and
2039 "datatype_new_compat", as well as documentation. See
2040 "datatypes.pdf" for details.
2041 - New "coinduction" method to avoid some boilerplate (compared to
2044 data ~> datatype_new
2045 codata ~> codatatype
2047 - Renamed many generated theorems, including
2049 map_comp' ~> map_comp
2059 * Spec_Check is a Quickcheck tool for Isabelle/ML. The ML function
2060 "check_property" allows to check specifications of the form "ALL x y
2061 z. prop x y z". See also ~~/src/Tools/Spec_Check/ with its
2062 Examples.thy in particular.
2064 * Improved printing of exception trace in Poly/ML 5.5.1, with regular
2065 tracing output in the command transaction context instead of physical
2066 stdout. See also Toplevel.debug, Toplevel.debugging and
2067 ML_Compiler.exn_trace.
2069 * ML type "theory" is now immutable, without any special treatment of
2070 drafts or linear updates (which could lead to "stale theory" errors in
2071 the past). Discontinued obsolete operations like Theory.copy,
2072 Theory.checkpoint, and the auxiliary type theory_ref. Minor
2075 * More uniform naming of goal functions for skipped proofs:
2077 Skip_Proof.prove ~> Goal.prove_sorry
2078 Skip_Proof.prove_global ~> Goal.prove_sorry_global
2080 Minor INCOMPATIBILITY.
2082 * Simplifier tactics and tools use proper Proof.context instead of
2083 historic type simpset. Old-style declarations like addsimps,
2084 addsimprocs etc. operate directly on Proof.context. Raw type simpset
2085 retains its use as snapshot of the main Simplifier context, using
2086 simpset_of and put_simpset on Proof.context. INCOMPATIBILITY -- port
2087 old tools by making them depend on (ctxt : Proof.context) instead of
2088 (ss : simpset), then turn (simpset_of ctxt) into ctxt.
2090 * Modifiers for classical wrappers (e.g. addWrapper, delWrapper)
2091 operate on Proof.context instead of claset, for uniformity with addIs,
2092 addEs, addDs etc. Note that claset_of and put_claset allow to manage
2093 clasets separately from the context.
2095 * Discontinued obsolete ML antiquotations @{claset} and @{simpset}.
2096 INCOMPATIBILITY, use @{context} instead.
2098 * Antiquotation @{theory_context A} is similar to @{theory A}, but
2099 presents the result as initial Proof.context.
2104 * Discontinued obsolete isabelle usedir, mkdir, make -- superseded by
2105 "isabelle build" in Isabelle2013. INCOMPATIBILITY.
2107 * Discontinued obsolete isabelle-process options -f and -u (former
2108 administrative aliases of option -e). Minor INCOMPATIBILITY.
2110 * Discontinued obsolete isabelle print tool, and PRINT_COMMAND
2113 * Discontinued ISABELLE_DOC_FORMAT settings variable and historic
2114 document formats: dvi.gz, ps, ps.gz -- the default document format is
2117 * Isabelle settings variable ISABELLE_BUILD_JAVA_OPTIONS allows to
2118 specify global resources of the JVM process run by isabelle build.
2120 * Toplevel executable $ISABELLE_HOME/bin/isabelle_scala_script allows
2121 to run Isabelle/Scala source files as standalone programs.
2123 * Improved "isabelle keywords" tool (for old-style ProofGeneral
2124 keyword tables): use Isabelle/Scala operations, which inspect outer
2125 syntax without requiring to build sessions first.
2127 * Sessions may be organized via 'chapter' specifications in the ROOT
2128 file, which determines a two-level hierarchy of browser info. The old
2129 tree-like organization via implicit sub-session relation (with its
2130 tendency towards erratic fluctuation of URLs) has been discontinued.
2131 The default chapter is called "Unsorted". Potential INCOMPATIBILITY
2132 for HTML presentation of theories.
2136 New in Isabelle2013 (February 2013)
2137 -----------------------------------
2141 * Theorem status about oracles and unfinished/failed future proofs is
2142 no longer printed by default, since it is incompatible with
2143 incremental / parallel checking of the persistent document model. ML
2144 function Thm.peek_status may be used to inspect a snapshot of the
2145 ongoing evaluation process. Note that in batch mode --- notably
2146 isabelle build --- the system ensures that future proofs of all
2147 accessible theorems in the theory context are finished (as before).
2149 * Configuration option show_markup controls direct inlining of markup
2150 into the printed representation of formal entities --- notably type
2151 and sort constraints. This enables Prover IDE users to retrieve that
2152 information via tooltips in the output window, for example.
2154 * Command 'ML_file' evaluates ML text from a file directly within the
2155 theory, without any predeclaration via 'uses' in the theory header.
2157 * Old command 'use' command and corresponding keyword 'uses' in the
2158 theory header are legacy features and will be discontinued soon.
2159 Tools that load their additional source files may imitate the
2160 'ML_file' implementation, such that the system can take care of
2161 dependencies properly.
2163 * Discontinued obsolete method fastsimp / tactic fast_simp_tac, which
2164 is called fastforce / fast_force_tac already since Isabelle2011-1.
2166 * Updated and extended "isar-ref" and "implementation" manual, reduced
2167 remaining material in old "ref" manual.
2169 * Improved support for auxiliary contexts that indicate block structure
2170 for specifications. Nesting of "context fixes ... context assumes ..."
2171 and "class ... context ...".
2173 * Attribute "consumes" allows a negative value as well, which is
2174 interpreted relatively to the total number of premises of the rule in
2175 the target context. This form of declaration is stable when exported
2176 from a nested 'context' with additional assumptions. It is the
2177 preferred form for definitional packages, notably cases/rules produced
2178 in HOL/inductive and HOL/function.
2180 * More informative error messages for Isar proof commands involving
2181 lazy enumerations (method applications etc.).
2183 * Refined 'help' command to retrieve outer syntax commands according
2184 to name patterns (with clickable results).
2187 *** Prover IDE -- Isabelle/Scala/jEdit ***
2189 * Parallel terminal proofs ('by') are enabled by default, likewise
2190 proofs that are built into packages like 'datatype', 'function'. This
2191 allows to "run ahead" checking the theory specifications on the
2192 surface, while the prover is still crunching on internal
2193 justifications. Unfinished / cancelled proofs are restarted as
2194 required to complete full proof checking eventually.
2196 * Improved output panel with tooltips, hyperlinks etc. based on the
2197 same Rich_Text_Area as regular Isabelle/jEdit buffers. Activation of
2198 tooltips leads to some window that supports the same recursively,
2199 which can lead to stacks of tooltips as the semantic document content
2200 is explored. ESCAPE closes the whole stack, individual windows may be
2201 closed separately, or detached to become independent jEdit dockables.
2203 * Improved support for commands that produce graph output: the text
2204 message contains a clickable area to open a new instance of the graph
2207 * More robust incremental parsing of outer syntax (partial comments,
2208 malformed symbols). Changing the balance of open/close quotes and
2209 comment delimiters works more conveniently with unfinished situations
2210 that frequently occur in user interaction.
2212 * More efficient painting and improved reactivity when editing large
2213 files. More scalable management of formal document content.
2215 * Smarter handling of tracing messages: prover process pauses after
2216 certain number of messages per command transaction, with some user
2217 dialog to stop or continue. This avoids swamping the front-end with
2218 potentially infinite message streams.
2220 * More plugin options and preferences, based on Isabelle/Scala. The
2221 jEdit plugin option panel provides access to some Isabelle/Scala
2222 options, including tuning parameters for editor reactivity and color
2225 * Dockable window "Symbols" provides some editing support for Isabelle
2228 * Dockable window "Monitor" shows ML runtime statistics. Note that
2229 continuous display of the chart slows down the system.
2231 * Improved editing support for control styles: subscript, superscript,
2232 bold, reset of style -- operating on single symbols or text
2233 selections. Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT.
2235 * Actions isabelle.increase-font-size and isabelle.decrease-font-size
2236 adjust the main text area font size, and its derivatives for output,
2237 tooltips etc. Cf. keyboard shortcuts C-PLUS and C-MINUS, which often
2238 need to be adapted to local keyboard layouts.
2240 * More reactive completion popup by default: use \t (TAB) instead of
2241 \n (NEWLINE) to minimize intrusion into regular flow of editing. See
2242 also "Plugin Options / SideKick / General / Code Completion Options".
2244 * Implicit check and build dialog of the specified logic session
2245 image. For example, HOL, HOLCF, HOL-Nominal can be produced on
2246 demand, without bundling big platform-dependent heap images in the
2247 Isabelle distribution.
2249 * Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates
2250 from Oracle provide better multi-platform experience. This version is
2251 now bundled exclusively with Isabelle.
2256 * Code generation for Haskell: restrict unqualified imports from
2257 Haskell Prelude to a small set of fundamental operations.
2259 * Command 'export_code': relative file names are interpreted
2260 relatively to master directory of current theory rather than the
2261 rather arbitrary current working directory. INCOMPATIBILITY.
2263 * Discontinued obsolete attribute "COMP". Potential INCOMPATIBILITY,
2264 use regular rule composition via "OF" / "THEN", or explicit proof
2265 structure instead. Note that Isabelle/ML provides a variety of
2266 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied
2267 with some care where this is really required.
2269 * Command 'typ' supports an additional variant with explicit sort
2270 constraint, to infer and check the most general type conforming to a
2271 given sort. Example (in HOL):
2273 typ "_ * _ * bool * unit" :: finite
2275 * Command 'locale_deps' visualizes all locales and their relations as
2283 - Added MaSh relevance filter based on machine-learning; see the
2284 Sledgehammer manual for details.
2285 - Polished Isar proofs generated with "isar_proofs" option.
2286 - Rationalized type encodings ("type_enc" option).
2287 - Renamed "kill_provers" subcommand to "kill_all".
2289 isar_proof ~> isar_proofs
2290 isar_shrink_factor ~> isar_shrink
2291 max_relevant ~> max_facts
2292 relevance_thresholds ~> fact_thresholds
2294 * Quickcheck: added an optimisation for equality premises. It is
2295 switched on by default, and can be switched off by setting the
2296 configuration quickcheck_optimise_equality to false.
2298 * Quotient: only one quotient can be defined by quotient_type
2302 - generation of an abstraction function equation in lift_definition
2303 - quot_del attribute
2304 - renamed no_abs_code -> no_code (INCOMPATIBILITY.)
2306 * Simproc "finite_Collect" rewrites set comprehensions into pointfree
2309 * Preprocessing of the code generator rewrites set comprehensions into
2310 pointfree expressions.
2312 * The SMT solver Z3 has now by default a restricted set of directly
2313 supported features. For the full set of features (div/mod, nonlinear
2314 arithmetic, datatypes/records) with potential proof reconstruction
2315 failures, enable the configuration option "z3_with_extensions". Minor
2318 * Simplified 'typedef' specifications: historical options for implicit
2319 set definition and alternative name have been discontinued. The
2320 former behavior of "typedef (open) t = A" is now the default, but
2321 written just "typedef t = A". INCOMPATIBILITY, need to adapt theories
2324 * Removed constant "chars"; prefer "Enum.enum" on type "char"
2325 directly. INCOMPATIBILITY.
2327 * Moved operation product, sublists and n_lists from theory Enum to
2328 List. INCOMPATIBILITY.
2330 * Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY.
2332 * Class "comm_monoid_diff" formalises properties of bounded
2333 subtraction, with natural numbers and multisets as typical instances.
2335 * Added combinator "Option.these" with type "'a option set => 'a set".
2337 * Theory "Transitive_Closure": renamed lemmas
2339 reflcl_tranclp -> reflclp_tranclp
2340 rtranclp_reflcl -> rtranclp_reflclp
2344 * Theory "Rings": renamed lemmas (in class semiring)
2346 left_distrib ~> distrib_right
2347 right_distrib ~> distrib_left
2351 * Generalized the definition of limits:
2353 - Introduced the predicate filterlim (LIM x F. f x :> G) which
2354 expresses that when the input values x converge to F then the
2355 output f x converges to G.
2357 - Added filters for convergence to positive (at_top) and negative
2360 - Moved infinity in the norm (at_infinity) from
2361 Multivariate_Analysis to Complex_Main.
2363 - Removed real_tendsto_inf, it is superseded by "LIM x F. f x :>
2368 * Theory "Library/Option_ord" provides instantiation of option type to
2369 lattice type classes.
2371 * Theory "Library/Multiset": renamed
2373 constant fold_mset ~> Multiset.fold
2374 fact fold_mset_commute ~> fold_mset_comm
2378 * Renamed theory Library/List_Prefix to Library/Sublist, with related
2381 - Renamed constants (and related lemmas)
2384 strict_prefix ~> prefix
2386 - Replaced constant "postfix" by "suffixeq" with swapped argument
2387 order (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped
2388 old infix syntax "xs >>= ys"; use "suffixeq ys xs" instead.
2389 Renamed lemmas accordingly.
2391 - Added constant "list_hembeq" for homeomorphic embedding on
2392 lists. Added abbreviation "sublisteq" for special case
2393 "list_hembeq (op =)".
2395 - Theory Library/Sublist no longer provides "order" and "bot" type
2396 class instances for the prefix order (merely corresponding locale
2397 interpretations). The type class instances are now in theory
2398 Library/Prefix_Order.
2400 - The sublist relation of theory Library/Sublist_Order is now based
2401 on "Sublist.sublisteq". Renamed lemmas accordingly:
2403 le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff
2404 le_list_append_mono ~> Sublist.list_hembeq_append_mono
2405 le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2
2406 le_list_Cons_EX ~> Sublist.list_hembeq_ConsD
2407 le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2'
2408 le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq
2409 le_list_drop_Cons ~> Sublist.sublisteq_Cons'
2410 le_list_drop_many ~> Sublist.sublisteq_drop_many
2411 le_list_filter_left ~> Sublist.sublisteq_filter_left
2412 le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many
2413 le_list_rev_take_iff ~> Sublist.sublisteq_append
2414 le_list_same_length ~> Sublist.sublisteq_same_length
2415 le_list_take_many_iff ~> Sublist.sublisteq_append'
2416 less_eq_list.drop ~> less_eq_list_drop
2417 less_eq_list.induct ~> less_eq_list_induct
2418 not_le_list_length ~> Sublist.not_sublisteq_length
2422 * New theory Library/Countable_Set.
2424 * Theory Library/Debug and Library/Parallel provide debugging and
2425 parallel execution for code generated towards Isabelle/ML.
2427 * Theory Library/FuncSet: Extended support for Pi and extensional and
2428 introduce the extensional dependent function space "PiE". Replaced
2429 extensional_funcset by an abbreviation, and renamed lemmas from
2430 extensional_funcset to PiE as follows:
2432 extensional_empty ~> PiE_empty
2433 extensional_funcset_empty_domain ~> PiE_empty_domain
2434 extensional_funcset_empty_range ~> PiE_empty_range
2435 extensional_funcset_arb ~> PiE_arb
2436 extensional_funcset_mem ~> PiE_mem
2437 extensional_funcset_extend_domainI ~> PiE_fun_upd
2438 extensional_funcset_restrict_domain ~> fun_upd_in_PiE
2439 extensional_funcset_extend_domain_eq ~> PiE_insert_eq
2440 card_extensional_funcset ~> card_PiE
2441 finite_extensional_funcset ~> finite_PiE
2445 * Theory Library/FinFun: theory of almost everywhere constant
2446 functions (supersedes the AFP entry "Code Generation for Functions as
2449 * Theory Library/Phantom: generic phantom type to make a type
2450 parameter appear in a constant's type. This alternative to adding
2451 TYPE('a) as another parameter avoids unnecessary closures in generated
2454 * Theory Library/RBT_Impl: efficient construction of red-black trees
2455 from sorted associative lists. Merging two trees with rbt_union may
2456 return a structurally different tree than before. Potential
2459 * Theory Library/IArray: immutable arrays with code generation.
2461 * Theory Library/Finite_Lattice: theory of finite lattices.
2463 * HOL/Multivariate_Analysis: replaced
2465 "basis :: 'a::euclidean_space => nat => real"
2466 "\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space"
2468 on euclidean spaces by using the inner product "_ \<bullet> _" with
2469 vectors from the Basis set: "\<Chi>\<Chi> i. f i" is superseded by
2470 "SUM i : Basis. f i * r i".
2472 With this change the following constants are also changed or removed:
2474 DIM('a) :: nat ~> card (Basis :: 'a set) (is an abbreviation)
2475 a $$ i ~> inner a i (where i : Basis)
2477 \<pi>, \<pi>' removed
2479 Theorems about these constants where removed.
2483 component_le_norm ~> Basis_le_norm
2484 euclidean_eq ~> euclidean_eq_iff
2485 differential_zero_maxmin_component ~> differential_zero_maxmin_cart
2486 euclidean_simps ~> inner_simps
2487 independent_basis ~> independent_Basis
2488 span_basis ~> span_Basis
2489 in_span_basis ~> in_span_Basis
2490 norm_bound_component_le ~> norm_boound_Basis_le
2491 norm_bound_component_lt ~> norm_boound_Basis_lt
2492 component_le_infnorm ~> Basis_le_infnorm
2498 - Added simproc "measurable" to automatically prove measurability.
2500 - Added induction rules for sigma sets with disjoint union
2501 (sigma_sets_induct_disjoint) and for Borel-measurable functions
2502 (borel_measurable_induct).
2504 - Added the Daniell-Kolmogorov theorem (the existence the limit of a
2507 * HOL/Cardinals: Theories of ordinals and cardinals (supersedes the
2508 AFP entry "Ordinals_and_Cardinals").
2510 * HOL/BNF: New (co)datatype package based on bounded natural functors
2511 with support for mixed, nested recursion and interesting non-free
2514 * HOL/Finite_Set and Relation: added new set and relation operations
2515 expressed by Finite_Set.fold.
2517 * New theory HOL/Library/RBT_Set: implementation of sets by red-black
2518 trees for the code generator.
2520 * HOL/Library/RBT and HOL/Library/Mapping have been converted to
2522 possible INCOMPATIBILITY.
2524 * HOL/Set: renamed Set.project -> Set.filter
2528 *** Document preparation ***
2530 * Dropped legacy antiquotations "term_style" and "thm_style", since
2531 styles may be given as arguments to "term" and "thm" already.
2532 Discontinued legacy styles "prem1" .. "prem19".
2534 * Default LaTeX rendering for \<euro> is now based on eurosym package,
2535 instead of slightly exotic babel/greek.
2537 * Document variant NAME may use different LaTeX entry point
2538 document/root_NAME.tex if that file exists, instead of the common
2541 * Simplified custom document/build script, instead of old-style
2542 document/IsaMakefile. Minor INCOMPATIBILITY.
2547 * The default limit for maximum number of worker threads is now 8,
2548 instead of 4, in correspondence to capabilities of contemporary
2549 hardware and Poly/ML runtime system.
2551 * Type Seq.results and related operations support embedded error
2552 messages within lazy enumerations, and thus allow to provide
2553 informative errors in the absence of any usable results.
2555 * Renamed Position.str_of to Position.here to emphasize that this is a
2556 formal device to inline positions into message text, but not
2557 necessarily printing visible text.
2562 * Advanced support for Isabelle sessions and build management, see
2563 "system" manual for the chapter of that name, especially the "isabelle
2564 build" tool and its examples. The "isabelle mkroot" tool prepares
2565 session root directories for use with "isabelle build", similar to
2566 former "isabelle mkdir" for "isabelle usedir". Note that this affects
2567 document preparation as well. INCOMPATIBILITY, isabelle usedir /
2568 mkdir / make are rendered obsolete.
2570 * Discontinued obsolete Isabelle/build script, it is superseded by the
2571 regular isabelle build tool. For example:
2573 isabelle build -s -b HOL
2575 * Discontinued obsolete "isabelle makeall".
2577 * Discontinued obsolete IsaMakefile and ROOT.ML files from the
2578 Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that
2579 provides some traditional targets that invoke "isabelle build". Note
2580 that this is inefficient! Applications of Isabelle/HOL involving
2581 "isabelle make" should be upgraded to use "isabelle build" directly.
2583 * The "isabelle options" tool prints Isabelle system options, as
2584 required for "isabelle build", for example.
2586 * The "isabelle logo" tool produces EPS and PDF format simultaneously.
2587 Minor INCOMPATIBILITY in command-line options.
2589 * The "isabelle install" tool has now a simpler command-line. Minor
2592 * The "isabelle components" tool helps to resolve add-on components
2593 that are not bundled, or referenced from a bare-bones repository
2594 version of Isabelle.
2596 * Settings variable ISABELLE_PLATFORM_FAMILY refers to the general
2597 platform family: "linux", "macos", "windows".
2599 * The ML system is configured as regular component, and no longer
2600 picked up from some surrounding directory. Potential INCOMPATIBILITY
2601 for home-made settings.
2603 * Improved ML runtime statistics (heap, threads, future tasks etc.).
2605 * Discontinued support for Poly/ML 5.2.1, which was the last version
2606 without exception positions and advanced ML compiler/toplevel
2609 * Discontinued special treatment of Proof General -- no longer guess
2610 PROOFGENERAL_HOME based on accidental file-system layout. Minor
2611 INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS
2612 settings manually, or use a Proof General version that has been
2613 bundled as Isabelle component.
2617 New in Isabelle2012 (May 2012)
2618 ------------------------------
2622 * Prover IDE (PIDE) improvements:
2624 - more robust Sledgehammer integration (as before the sledgehammer
2625 command-line needs to be typed into the source buffer)
2626 - markup for bound variables
2627 - markup for types of term variables (displayed as tooltips)
2628 - support for user-defined Isar commands within the running session
2629 - improved support for Unicode outside original 16bit range
2630 e.g. glyph for \<A> (thanks to jEdit 4.5.1)
2632 * Forward declaration of outer syntax keywords within the theory
2633 header -- minor INCOMPATIBILITY for user-defined commands. Allow new
2634 commands to be used in the same theory where defined.
2636 * Auxiliary contexts indicate block structure for specifications with
2637 additional parameters and assumptions. Such unnamed contexts may be
2638 nested within other targets, like 'theory', 'locale', 'class',
2639 'instantiation' etc. Results from the local context are generalized
2640 accordingly and applied to the enclosing target context. Example:
2644 assumes xy: "x = y" and yz: "y = z"
2647 lemma my_trans: "x = z" using xy yz by simp
2653 The most basic application is to factor-out context elements of
2654 several fixes/assumes/shows theorem statements, e.g. see
2655 ~~/src/HOL/Isar_Examples/Group_Context.thy
2657 Any other local theory specification element works within the "context
2658 ... begin ... end" block as well.
2660 * Bundled declarations associate attributed fact expressions with a
2661 given name in the context. These may be later included in other
2662 contexts. This allows to manage context extensions casually, without
2663 the logical dependencies of locales and locale interpretation. See
2664 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.
2666 * Commands 'lemmas' and 'theorems' allow local variables using 'for'
2667 declaration, and results are standardized before being stored. Thus
2668 old-style "standard" after instantiation or composition of facts
2669 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of
2670 indices of schematic variables.
2672 * Rule attributes in local theory declarations (e.g. locale or class)
2673 are now statically evaluated: the resulting theorem is stored instead
2674 of the original expression. INCOMPATIBILITY in rare situations, where
2675 the historic accident of dynamic re-evaluation in interpretations
2678 * New tutorial "Programming and Proving in Isabelle/HOL"
2679 ("prog-prove"). It completely supersedes "A Tutorial Introduction to
2680 Structured Isar Proofs" ("isar-overview"), which has been removed. It
2681 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order
2682 Logic" as the recommended beginners tutorial, but does not cover all
2683 of the material of that old tutorial.
2685 * Updated and extended reference manuals: "isar-ref",
2686 "implementation", "system"; reduced remaining material in old "ref"
2692 * Command 'definition' no longer exports the foundational "raw_def"
2693 into the user context. Minor INCOMPATIBILITY, may use the regular
2694 "def" result with attribute "abs_def" to imitate the old version.
2696 * Attribute "abs_def" turns an equation of the form "f x y == t" into
2697 "f == %x y. t", which ensures that "simp" or "unfold" steps always
2698 expand it. This also works for object-logic equality. (Formerly
2699 undocumented feature.)
2701 * Sort constraints are now propagated in simultaneous statements, just
2702 like type constraints. INCOMPATIBILITY in rare situations, where
2703 distinct sorts used to be assigned accidentally. For example:
2705 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"
2707 lemma "P (x::'a)" and "Q (y::'a::bar)"
2708 -- "now uniform 'a::bar instead of default sort for first occurrence (!)"
2710 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more
2711 tolerant against multiple unifiers, as long as the final result is
2712 unique. (As before, rules are composed in canonical right-to-left
2713 order to accommodate newly introduced premises.)
2715 * Renamed some inner syntax categories:
2721 Minor INCOMPATIBILITY. Note that in practice "num_const" or
2722 "num_position" etc. are mainly used instead (which also include
2723 position information via constraints).
2725 * Simplified configuration options for syntax ambiguity: see
2726 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
2727 manual. Minor INCOMPATIBILITY.
2729 * Discontinued configuration option "syntax_positions": atomic terms
2730 in parse trees are always annotated by position constraints.
2732 * Old code generator for SML and its commands 'code_module',
2733 'code_library', 'consts_code', 'types_code' have been discontinued.
2734 Use commands of the generic code generator instead. INCOMPATIBILITY.
2736 * Redundant attribute "code_inline" has been discontinued. Use
2737 "code_unfold" instead. INCOMPATIBILITY.
2739 * Dropped attribute "code_unfold_post" in favor of the its dual
2740 "code_abbrev", which yields a common pattern in definitions like
2742 definition [code_abbrev]: "f = t"
2746 * Obsolete 'types' command has been discontinued. Use 'type_synonym'
2747 instead. INCOMPATIBILITY.
2749 * Discontinued old "prems" fact, which used to refer to the accidental
2750 collection of foundational premises in the context (already marked as
2751 legacy since Isabelle2011).
2756 * Type 'a set is now a proper type constructor (just as before
2757 Isabelle2008). Definitions mem_def and Collect_def have disappeared.
2758 Non-trivial INCOMPATIBILITY. For developments keeping predicates and
2759 sets separate, it is often sufficient to rephrase some set S that has
2760 been accidentally used as predicates by "%x. x : S", and some
2761 predicate P that has been accidentally used as set by "{x. P x}".
2762 Corresponding proofs in a first step should be pruned from any
2763 tinkering with former theorems mem_def and Collect_def as far as
2766 For developments which deliberately mix predicates and sets, a
2767 planning step is necessary to determine what should become a predicate
2768 and what a set. It can be helpful to carry out that step in
2769 Isabelle2011-1 before jumping right into the current release.
2771 * Code generation by default implements sets as container type rather
2772 than predicates. INCOMPATIBILITY.
2774 * New type synonym 'a rel = ('a * 'a) set
2776 * The representation of numerals has changed. Datatype "num"
2777 represents strictly positive binary numerals, along with functions
2778 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent
2779 positive and negated numeric literals, respectively. See also
2780 definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some
2781 user theories may require adaptations as follows:
2783 - Theorems with number_ring or number_semiring constraints: These
2784 classes are gone; use comm_ring_1 or comm_semiring_1 instead.
2786 - Theories defining numeric types: Remove number, number_semiring,
2787 and number_ring instances. Defer all theorems about numerals until
2788 after classes one and semigroup_add have been instantiated.
2790 - Numeral-only simp rules: Replace each rule having a "number_of v"
2791 pattern with two copies, one for numeral and one for neg_numeral.
2793 - Theorems about subclasses of semiring_1 or ring_1: These classes
2794 automatically support numerals now, so more simp rules and
2795 simprocs may now apply within the proof.
2797 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:
2798 Redefine using other integer operations.
2800 * Transfer: New package intended to generalize the existing
2801 "descending" method and related theorem attributes from the Quotient
2802 package. (Not all functionality is implemented yet, but future
2803 development will focus on Transfer as an eventual replacement for the
2804 corresponding parts of the Quotient package.)
2806 - transfer_rule attribute: Maintains a collection of transfer rules,
2807 which relate constants at two different types. Transfer rules may
2808 relate different type instances of the same polymorphic constant,
2809 or they may relate an operation on a raw type to a corresponding
2810 operation on an abstract type (quotient or subtype). For example:
2812 ((A ===> B) ===> list_all2 A ===> list_all2 B) map map
2813 (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int
2815 - transfer method: Replaces a subgoal on abstract types with an
2816 equivalent subgoal on the corresponding raw types. Constants are
2817 replaced with corresponding ones according to the transfer rules.
2818 Goals are generalized over all free variables by default; this is
2819 necessary for variables whose types change, but can be overridden
2820 for specific variables with e.g. "transfer fixing: x y z". The
2821 variant transfer' method allows replacing a subgoal with one that
2822 is logically stronger (rather than equivalent).
2824 - relator_eq attribute: Collects identity laws for relators of
2825 various type constructors, e.g. "list_all2 (op =) = (op =)". The
2826 transfer method uses these lemmas to infer transfer rules for
2827 non-polymorphic constants on the fly.
2829 - transfer_prover method: Assists with proving a transfer rule for a
2830 new constant, provided the constant is defined in terms of other
2831 constants that already have transfer rules. It should be applied
2832 after unfolding the constant definitions.
2834 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer
2835 from type nat to type int.
2837 * Lifting: New package intended to generalize the quotient_definition
2838 facility of the Quotient package; designed to work with Transfer.
2840 - lift_definition command: Defines operations on an abstract type in
2841 terms of a corresponding operation on a representation
2842 type. Example syntax:
2844 lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"
2847 Users must discharge a respectfulness proof obligation when each
2848 constant is defined. (For a type copy, i.e. a typedef with UNIV,
2849 the proof is discharged automatically.) The obligation is
2850 presented in a user-friendly, readable form; a respectfulness
2851 theorem in the standard format and a transfer rule are generated
2854 - Integration with code_abstype: For typedefs (e.g. subtypes
2855 corresponding to a datatype invariant, such as dlist),
2856 lift_definition generates a code certificate theorem and sets up
2857 code generation for each constant.
2859 - setup_lifting command: Sets up the Lifting package to work with a
2860 user-defined type. The user must provide either a quotient theorem
2861 or a type_definition theorem. The package configures transfer
2862 rules for equality and quantifiers on the type, and sets up the
2863 lift_definition command to work with the type.
2865 - Usage examples: See Quotient_Examples/Lift_DList.thy,
2866 Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,
2867 Word/Word.thy and Library/Float.thy.
2871 - The 'quotient_type' command now supports a 'morphisms' option with
2872 rep and abs functions, similar to typedef.
2874 - 'quotient_type' sets up new types to work with the Lifting and
2875 Transfer packages, as with 'setup_lifting'.
2877 - The 'quotient_definition' command now requires the user to prove a
2878 respectfulness property at the point where the constant is
2879 defined, similar to lift_definition; INCOMPATIBILITY.
2881 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems
2882 accordingly, INCOMPATIBILITY.
2884 * New diagnostic command 'find_unused_assms' to find potentially
2885 superfluous assumptions in theorems using Quickcheck.
2889 - Quickcheck returns variable assignments as counterexamples, which
2890 allows to reveal the underspecification of functions under test.
2891 For example, refuting "hd xs = x", it presents the variable
2892 assignment xs = [] and x = a1 as a counterexample, assuming that
2893 any property is false whenever "hd []" occurs in it.
2895 These counterexample are marked as potentially spurious, as
2896 Quickcheck also returns "xs = []" as a counterexample to the
2897 obvious theorem "hd xs = hd xs".
2899 After finding a potentially spurious counterexample, Quickcheck
2900 continues searching for genuine ones.
2902 By default, Quickcheck shows potentially spurious and genuine
2903 counterexamples. The option "genuine_only" sets quickcheck to only
2904 show genuine counterexamples.
2906 - The command 'quickcheck_generator' creates random and exhaustive
2907 value generators for a given type and operations.
2909 It generates values by using the operations as if they were
2910 constructors of that type.
2912 - Support for multisets.
2914 - Added "use_subtype" options.
2916 - Added "quickcheck_locale" configuration to specify how to process
2917 conjectures in a locale context.
2919 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option
2920 and affecting 'rat' and 'real'.
2923 - Integrated more tightly with SPASS, as described in the ITP 2012
2924 paper "More SPASS with Isabelle".
2925 - Made it try "smt" as a fallback if "metis" fails or times out.
2926 - Added support for the following provers: Alt-Ergo (via Why3 and
2927 TFF1), iProver, iProver-Eq.
2928 - Sped up the minimizer.
2929 - Added "lam_trans", "uncurry_aliases", and "minimize" options.
2930 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
2931 - Renamed "sound" option to "strict".
2933 * Metis: Added possibility to specify lambda translations scheme as a
2934 parenthesized argument (e.g., "by (metis (lifting) ...)").
2936 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".
2938 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.
2940 * New "case_product" attribute to generate a case rule doing multiple
2941 case distinctions at the same time. E.g.
2943 list.exhaust [case_product nat.exhaust]
2945 produces a rule which can be used to perform case distinction on both
2948 * New "eventually_elim" method as a generalized variant of the
2949 eventually_elim* rules. Supports structured proofs.
2951 * Typedef with implicit set definition is considered legacy. Use
2952 "typedef (open)" form instead, which will eventually become the
2955 * Record: code generation can be switched off manually with
2957 declare [[record_coden = false]] -- "default true"
2959 * Datatype: type parameters allow explicit sort constraints.
2961 * Concrete syntax for case expressions includes constraints for source
2962 positions, and thus produces Prover IDE markup for its bindings.
2963 INCOMPATIBILITY for old-style syntax translations that augment the
2964 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
2967 * Clarified attribute "mono_set": pure declaration without modifying
2968 the result of the fact expression.
2970 * More default pred/set conversions on a couple of relation operations
2971 and predicates. Added powers of predicate relations. Consolidation
2972 of some relation theorems:
2974 converse_def ~> converse_unfold
2975 rel_comp_def ~> relcomp_unfold
2976 symp_def ~> (modified, use symp_def and sym_def instead)
2977 transp_def ~> transp_trans
2978 Domain_def ~> Domain_unfold
2979 Range_def ~> Domain_converse [symmetric]
2981 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.
2983 See theory "Relation" for examples for making use of pred/set
2984 conversions by means of attributes "to_set" and "to_pred".
2988 * Renamed facts about the power operation on relations, i.e., relpow
2989 to match the constant's name:
2991 rel_pow_1 ~> relpow_1
2992 rel_pow_0_I ~> relpow_0_I
2993 rel_pow_Suc_I ~> relpow_Suc_I
2994 rel_pow_Suc_I2 ~> relpow_Suc_I2
2995 rel_pow_0_E ~> relpow_0_E
2996 rel_pow_Suc_E ~> relpow_Suc_E
2997 rel_pow_E ~> relpow_E
2998 rel_pow_Suc_D2 ~> relpow_Suc_D2
2999 rel_pow_Suc_E2 ~> relpow_Suc_E2
3000 rel_pow_Suc_D2' ~> relpow_Suc_D2'
3001 rel_pow_E2 ~> relpow_E2
3002 rel_pow_add ~> relpow_add
3003 rel_pow_commute ~> relpow
3004 rel_pow_empty ~> relpow_empty:
3005 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
3006 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
3007 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
3008 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
3009 rel_pow_fun_conv ~> relpow_fun_conv
3010 rel_pow_finite_bounded1 ~> relpow_finite_bounded1
3011 rel_pow_finite_bounded ~> relpow_finite_bounded
3012 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
3013 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
3014 single_valued_rel_pow ~> single_valued_relpow
3018 * Theory Relation: Consolidated constant name for relation composition
3019 and corresponding theorem names:
3021 - Renamed constant rel_comp to relcomp.
3023 - Dropped abbreviation pred_comp. Use relcompp instead.
3027 rel_compI ~> relcompI
3028 rel_compEpair ~> relcompEpair
3029 rel_compE ~> relcompE
3030 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq
3031 rel_comp_empty1 ~> relcomp_empty1
3032 rel_comp_mono ~> relcomp_mono
3033 rel_comp_subset_Sigma ~> relcomp_subset_Sigma
3034 rel_comp_distrib ~> relcomp_distrib
3035 rel_comp_distrib2 ~> relcomp_distrib2
3036 rel_comp_UNION_distrib ~> relcomp_UNION_distrib
3037 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2
3038 single_valued_rel_comp ~> single_valued_relcomp
3039 rel_comp_def ~> relcomp_unfold
3040 converse_rel_comp ~> converse_relcomp
3041 pred_compI ~> relcomppI
3042 pred_compE ~> relcomppE
3043 pred_comp_bot1 ~> relcompp_bot1
3044 pred_comp_bot2 ~> relcompp_bot2
3045 transp_pred_comp_less_eq ~> transp_relcompp_less_eq
3046 pred_comp_mono ~> relcompp_mono
3047 pred_comp_distrib ~> relcompp_distrib
3048 pred_comp_distrib2 ~> relcompp_distrib2
3049 converse_pred_comp ~> converse_relcompp
3051 finite_rel_comp ~> finite_relcomp
3053 set_rel_comp ~> set_relcomp
3057 * Theory Divides: Discontinued redundant theorems about div and mod.
3058 INCOMPATIBILITY, use the corresponding generic theorems instead.
3060 DIVISION_BY_ZERO ~> div_by_0, mod_by_0
3061 zdiv_self ~> div_self
3062 zmod_self ~> mod_self
3065 zdiv_zmod_equality ~> div_mod_equality2
3066 zdiv_zmod_equality2 ~> div_mod_equality
3067 zmod_zdiv_trivial ~> mod_div_trivial
3068 zdiv_zminus_zminus ~> div_minus_minus
3069 zmod_zminus_zminus ~> mod_minus_minus
3070 zdiv_zminus2 ~> div_minus_right
3071 zmod_zminus2 ~> mod_minus_right
3072 zdiv_minus1_right ~> div_minus1_right
3073 zmod_minus1_right ~> mod_minus1_right
3074 zdvd_mult_div_cancel ~> dvd_mult_div_cancel
3075 zmod_zmult1_eq ~> mod_mult_right_eq
3076 zpower_zmod ~> power_mod
3077 zdvd_zmod ~> dvd_mod
3078 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd
3079 mod_mult_distrib ~> mult_mod_left
3080 mod_mult_distrib2 ~> mult_mod_right
3082 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use
3083 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.
3085 * Finite_Set.fold now qualified. INCOMPATIBILITY.
3087 * Consolidated theorem names concerning fold combinators:
3089 inf_INFI_fold_inf ~> inf_INF_fold_inf
3090 sup_SUPR_fold_sup ~> sup_SUP_fold_sup
3091 INFI_fold_inf ~> INF_fold_inf
3092 SUPR_fold_sup ~> SUP_fold_sup
3093 union_set ~> union_set_fold
3094 minus_set ~> minus_set_fold
3095 INFI_set_fold ~> INF_set_fold
3096 SUPR_set_fold ~> SUP_set_fold
3097 INF_code ~> INF_set_foldr
3098 SUP_code ~> SUP_set_foldr
3099 foldr.simps ~> foldr.simps (in point-free formulation)
3100 foldr_fold_rev ~> foldr_conv_fold
3101 foldl_fold ~> foldl_conv_fold
3102 foldr_foldr ~> foldr_conv_foldl
3103 foldl_foldr ~> foldl_conv_foldr
3104 fold_set_remdups ~> fold_set_fold_remdups
3105 fold_set ~> fold_set_fold
3106 fold1_set ~> fold1_set_fold
3110 * Dropped rarely useful theorems concerning fold combinators:
3111 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
3112 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
3113 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
3114 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
3115 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,
3116 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.
3117 INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0"
3118 and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be
3119 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by
3120 unfolding "foldr_conv_fold" and "foldl_conv_fold".
3122 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,
3123 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,
3124 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,
3125 INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding
3126 lemmas over fold rather than foldr, or make use of lemmas
3127 fold_conv_foldr and fold_rev.
3129 * Congruence rules Option.map_cong and Option.bind_cong for recursion
3130 through option types.
3132 * "Transitive_Closure.ntrancl": bounded transitive closure on
3135 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.
3137 * Theory Int: Discontinued many legacy theorems specific to type int.
3138 INCOMPATIBILITY, use the corresponding generic theorems instead.
3140 zminus_zminus ~> minus_minus
3141 zminus_0 ~> minus_zero
3142 zminus_zadd_distrib ~> minus_add_distrib
3143 zadd_commute ~> add_commute
3144 zadd_assoc ~> add_assoc
3145 zadd_left_commute ~> add_left_commute
3148 zadd_0 ~> add_0_left
3149 zadd_0_right ~> add_0_right
3150 zadd_zminus_inverse2 ~> left_minus
3151 zmult_zminus ~> mult_minus_left
3152 zmult_commute ~> mult_commute
3153 zmult_assoc ~> mult_assoc
3154 zadd_zmult_distrib ~> left_distrib
3155 zadd_zmult_distrib2 ~> right_distrib
3156 zdiff_zmult_distrib ~> left_diff_distrib
3157 zdiff_zmult_distrib2 ~> right_diff_distrib
3158 zmult_1 ~> mult_1_left
3159 zmult_1_right ~> mult_1_right
3160 zle_refl ~> order_refl
3161 zle_trans ~> order_trans
3162 zle_antisym ~> order_antisym
3163 zle_linear ~> linorder_linear
3164 zless_linear ~> linorder_less_linear
3165 zadd_left_mono ~> add_left_mono
3166 zadd_strict_right_mono ~> add_strict_right_mono
3167 zadd_zless_mono ~> add_less_le_mono
3168 int_0_less_1 ~> zero_less_one
3169 int_0_neq_1 ~> zero_neq_one
3171 zpower_zadd_distrib ~> power_add
3172 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
3173 zero_le_zpower_abs ~> zero_le_power_abs
3175 * Theory Deriv: Renamed
3177 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
3179 * Theory Library/Multiset: Improved code generation of multisets.
3181 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets
3182 are expressed via type classes again. The special syntax
3183 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant
3184 setsum_set, which is now subsumed by Big_Operators.setsum.
3187 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
3188 use theory HOL/Library/Nat_Bijection instead.
3190 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black
3191 trees is now inside a type class context. Names of affected
3192 operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for
3193 theories working directly with raw red-black trees, adapt the names as
3197 bulkload -> rbt_bulkload
3198 del_from_left -> rbt_del_from_left
3199 del_from_right -> rbt_del_from_right
3201 delete -> rbt_delete
3203 insert -> rbt_insert
3204 insertw -> rbt_insert_with
3205 insert_with_key -> rbt_insert_with_key
3206 map_entry -> rbt_map_entry
3207 lookup -> rbt_lookup
3208 sorted -> rbt_sorted
3209 tree_greater -> rbt_greater
3210 tree_less -> rbt_less
3211 tree_less_symbol -> rbt_less_symbol
3213 union_with -> rbt_union_with
3214 union_with_key -> rbt_union_with_key
3217 balance_left_sorted -> balance_left_rbt_sorted
3218 balance_left_tree_greater -> balance_left_rbt_greater
3219 balance_left_tree_less -> balance_left_rbt_less
3220 balance_right_sorted -> balance_right_rbt_sorted
3221 balance_right_tree_greater -> balance_right_rbt_greater
3222 balance_right_tree_less -> balance_right_rbt_less
3223 balance_sorted -> balance_rbt_sorted
3224 balance_tree_greater -> balance_rbt_greater
3225 balance_tree_less -> balance_rbt_less
3226 bulkload_is_rbt -> rbt_bulkload_is_rbt
3227 combine_sorted -> combine_rbt_sorted
3228 combine_tree_greater -> combine_rbt_greater
3229 combine_tree_less -> combine_rbt_less
3230 delete_in_tree -> rbt_delete_in_tree
3231 delete_is_rbt -> rbt_delete_is_rbt
3232 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater
3233 del_from_left_tree_less -> rbt_del_from_left_rbt_less
3234 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater
3235 del_from_right_tree_less -> rbt_del_from_right_rbt_less
3236 del_in_tree -> rbt_del_in_tree
3237 del_inv1_inv2 -> rbt_del_inv1_inv2
3238 del_sorted -> rbt_del_rbt_sorted
3239 del_tree_greater -> rbt_del_rbt_greater
3240 del_tree_less -> rbt_del_rbt_less
3241 dom_lookup_Branch -> dom_rbt_lookup_Branch
3242 entries_lookup -> entries_rbt_lookup
3243 finite_dom_lookup -> finite_dom_rbt_lookup
3244 insert_sorted -> rbt_insert_rbt_sorted
3245 insertw_is_rbt -> rbt_insertw_is_rbt
3246 insertwk_is_rbt -> rbt_insertwk_is_rbt
3247 insertwk_sorted -> rbt_insertwk_rbt_sorted
3248 insertw_sorted -> rbt_insertw_rbt_sorted
3249 ins_sorted -> ins_rbt_sorted
3250 ins_tree_greater -> ins_rbt_greater
3251 ins_tree_less -> ins_rbt_less
3252 is_rbt_sorted -> is_rbt_rbt_sorted
3253 lookup_balance -> rbt_lookup_balance
3254 lookup_bulkload -> rbt_lookup_rbt_bulkload
3255 lookup_delete -> rbt_lookup_rbt_delete
3256 lookup_Empty -> rbt_lookup_Empty
3257 lookup_from_in_tree -> rbt_lookup_from_in_tree
3258 lookup_in_tree -> rbt_lookup_in_tree
3259 lookup_ins -> rbt_lookup_ins
3260 lookup_insert -> rbt_lookup_rbt_insert
3261 lookup_insertw -> rbt_lookup_rbt_insertw
3262 lookup_insertwk -> rbt_lookup_rbt_insertwk
3263 lookup_keys -> rbt_lookup_keys
3264 lookup_map -> rbt_lookup_map
3265 lookup_map_entry -> rbt_lookup_rbt_map_entry
3266 lookup_tree_greater -> rbt_lookup_rbt_greater
3267 lookup_tree_less -> rbt_lookup_rbt_less
3268 lookup_union -> rbt_lookup_rbt_union
3269 map_entry_color_of -> rbt_map_entry_color_of
3270 map_entry_inv1 -> rbt_map_entry_inv1
3271 map_entry_inv2 -> rbt_map_entry_inv2
3272 map_entry_is_rbt -> rbt_map_entry_is_rbt
3273 map_entry_sorted -> rbt_map_entry_rbt_sorted
3274 map_entry_tree_greater -> rbt_map_entry_rbt_greater
3275 map_entry_tree_less -> rbt_map_entry_rbt_less
3276 map_tree_greater -> map_rbt_greater
3277 map_tree_less -> map_rbt_less
3278 map_sorted -> map_rbt_sorted
3279 paint_sorted -> paint_rbt_sorted
3280 paint_lookup -> paint_rbt_lookup
3281 paint_tree_greater -> paint_rbt_greater
3282 paint_tree_less -> paint_rbt_less
3283 sorted_entries -> rbt_sorted_entries
3284 tree_greater_eq_trans -> rbt_greater_eq_trans
3285 tree_greater_nit -> rbt_greater_nit
3286 tree_greater_prop -> rbt_greater_prop
3287 tree_greater_simps -> rbt_greater_simps
3288 tree_greater_trans -> rbt_greater_trans
3289 tree_less_eq_trans -> rbt_less_eq_trans
3290 tree_less_nit -> rbt_less_nit
3291 tree_less_prop -> rbt_less_prop
3292 tree_less_simps -> rbt_less_simps
3293 tree_less_trans -> rbt_less_trans
3294 tree_ord_props -> rbt_ord_props
3295 union_Branch -> rbt_union_Branch
3296 union_is_rbt -> rbt_union_is_rbt
3297 unionw_is_rbt -> rbt_unionw_is_rbt
3298 unionwk_is_rbt -> rbt_unionwk_is_rbt
3299 unionwk_sorted -> rbt_unionwk_rbt_sorted
3301 * Theory HOL/Library/Float: Floating point numbers are now defined as
3302 a subset of the real numbers. All operations are defined using the
3303 lifing-framework and proofs use the transfer method. INCOMPATIBILITY.
3310 round_down -> float_round_down
3311 round_up -> float_round_up
3315 ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod
3318 abs_float_def -> Float.compute_float_abs
3319 bitlen_ge0 -> bitlen_nonneg
3320 bitlen.simps -> Float.compute_bitlen
3321 float_components -> Float_mantissa_exponent
3322 float_divl.simps -> Float.compute_float_divl
3323 float_divr.simps -> Float.compute_float_divr
3324 float_eq_odd -> mult_powr_eq_mult_powr_iff
3325 float_power -> real_of_float_power
3326 lapprox_posrat_def -> Float.compute_lapprox_posrat
3327 lapprox_rat.simps -> Float.compute_lapprox_rat
3328 le_float_def' -> Float.compute_float_le
3329 le_float_def -> less_eq_float.rep_eq
3330 less_float_def' -> Float.compute_float_less
3331 less_float_def -> less_float.rep_eq
3332 normfloat_def -> Float.compute_normfloat
3333 normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0
3334 normfloat -> normfloat_def
3335 normfloat_unique -> use normfloat_def
3336 number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral
3337 one_float_def -> Float.compute_float_one
3338 plus_float_def -> Float.compute_float_plus
3339 rapprox_posrat_def -> Float.compute_rapprox_posrat
3340 rapprox_rat.simps -> Float.compute_rapprox_rat
3341 real_of_float_0 -> zero_float.rep_eq
3342 real_of_float_1 -> one_float.rep_eq
3343 real_of_float_abs -> abs_float.rep_eq
3344 real_of_float_add -> plus_float.rep_eq
3345 real_of_float_minus -> uminus_float.rep_eq
3346 real_of_float_mult -> times_float.rep_eq
3347 real_of_float_simp -> Float.rep_eq
3348 real_of_float_sub -> minus_float.rep_eq
3349 round_down.simps -> Float.compute_float_round_down
3350 round_up.simps -> Float.compute_float_round_up
3351 times_float_def -> Float.compute_float_times
3352 uminus_float_def -> Float.compute_float_uminus
3353 zero_float_def -> Float.compute_float_zero
3355 Lemmas not necessary anymore, use the transfer method:
3356 bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,
3357 float_divr, float_le_simp, float_less1_mantissa_bound,
3358 float_less_simp, float_less_zero, float_le_zero,
3359 float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,
3360 floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,
3361 lapprox_rat_bottom, normalized_float, rapprox_posrat,
3362 rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,
3363 real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,
3364 round_up, zero_le_float, zero_less_float
3366 * New theory HOL/Library/DAList provides an abstract type for
3367 association lists with distinct keys.
3369 * Session HOL/IMP: Added new theory of abstract interpretation of
3372 * Session HOL-Import: Re-implementation from scratch is faster,
3373 simpler, and more scalable. Requires a proof bundle, which is
3374 available as an external component. Discontinued old (and mostly
3375 dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY.
3377 * Session HOL-Word: Discontinued many redundant theorems specific to
3378 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
3381 word_sub_alt ~> word_sub_wi
3382 word_add_alt ~> word_add_def
3383 word_mult_alt ~> word_mult_def
3384 word_minus_alt ~> word_minus_def
3385 word_0_alt ~> word_0_wi
3386 word_1_alt ~> word_1_wi
3387 word_add_0 ~> add_0_left
3388 word_add_0_right ~> add_0_right
3389 word_mult_1 ~> mult_1_left
3390 word_mult_1_right ~> mult_1_right
3391 word_add_commute ~> add_commute
3392 word_add_assoc ~> add_assoc
3393 word_add_left_commute ~> add_left_commute
3394 word_mult_commute ~> mult_commute
3395 word_mult_assoc ~> mult_assoc
3396 word_mult_left_commute ~> mult_left_commute
3397 word_left_distrib ~> left_distrib
3398 word_right_distrib ~> right_distrib
3399 word_left_minus ~> left_minus
3400 word_diff_0_right ~> diff_0_right
3401 word_diff_self ~> diff_self
3402 word_sub_def ~> diff_minus
3403 word_diff_minus ~> diff_minus
3404 word_add_ac ~> add_ac
3405 word_mult_ac ~> mult_ac
3406 word_plus_ac0 ~> add_0_left add_0_right add_ac
3407 word_times_ac1 ~> mult_1_left mult_1_right mult_ac
3408 word_order_trans ~> order_trans
3409 word_order_refl ~> order_refl
3410 word_order_antisym ~> order_antisym
3411 word_order_linear ~> linorder_linear
3412 lenw1_zero_neq_one ~> zero_neq_one
3413 word_number_of_eq ~> number_of_eq
3414 word_of_int_add_hom ~> wi_hom_add
3415 word_of_int_sub_hom ~> wi_hom_sub
3416 word_of_int_mult_hom ~> wi_hom_mult
3417 word_of_int_minus_hom ~> wi_hom_neg
3418 word_of_int_succ_hom ~> wi_hom_succ
3419 word_of_int_pred_hom ~> wi_hom_pred
3420 word_of_int_0_hom ~> word_0_wi
3421 word_of_int_1_hom ~> word_1_wi
3423 * Session HOL-Word: New proof method "word_bitwise" for splitting
3424 machine word equalities and inequalities into logical circuits,
3425 defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction,
3426 multiplication, shifting by constants, bitwise operators and numeric
3427 constants. Requires fixed-length word types, not 'a word. Solves
3428 many standard word identities outright and converts more into first
3429 order problems amenable to blast or similar. See also examples in
3430 HOL/Word/Examples/WordExamples.thy.
3432 * Session HOL-Probability: Introduced the type "'a measure" to
3433 represent measures, this replaces the records 'a algebra and 'a
3434 measure_space. The locales based on subset_class now have two
3435 locale-parameters the space \<Omega> and the set of measurable sets M.
3436 The product of probability spaces uses now the same constant as the
3437 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)
3438 measure". Most constants are defined now outside of locales and gain
3439 an additional parameter, like null_sets, almost_eventually or \<mu>'.
3440 Measure space constructions for distributions and densities now got
3441 their own constants distr and density. Instead of using locales to
3442 describe measure spaces with a finite space, the measure count_space
3443 and point_measure is introduced. INCOMPATIBILITY.
3447 finite_measure.\<mu>' -> measure
3448 product_algebra_generator -> prod_algebra
3449 product_prob_space.emb -> prod_emb
3450 product_prob_space.infprod_algebra -> PiM
3453 completeable_measure_space
3454 finite_measure_space
3456 finite_product_finite_prob_space
3457 finite_product_sigma_algebra
3458 finite_sigma_algebra
3460 pair_finite_prob_space
3461 pair_finite_sigma_algebra
3464 product_sigma_algebra
3468 distribution -> use distr measure, or distributed predicate
3470 joint_distribution -> use distr measure, or distributed predicate
3471 pair_measure_generator
3472 product_prob_space.infprod_algebra -> use PiM
3475 Replacement theorems:
3476 finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite
3477 finite_measure.empty_measure -> measure_empty
3478 finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq
3479 finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq
3480 finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably
3481 finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure
3482 finite_measure.finite_measure -> finite_measure.emeasure_finite
3483 finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton
3484 finite_measure.positive_measure' -> measure_nonneg
3485 finite_measure.real_measure -> finite_measure.emeasure_real
3486 finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb
3487 finite_product_sigma_algebra.in_P -> sets_PiM_I_finite
3488 finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty
3489 information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed
3490 information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple
3491 information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple
3492 information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple
3493 information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple
3494 information_space.entropy_commute -> information_space.entropy_commute_simple
3495 information_space.entropy_eq -> information_space.entropy_simple_distributed
3496 information_space.entropy_generic_eq -> information_space.entropy_simple_distributed
3497 information_space.entropy_positive -> information_space.entropy_nonneg_simple
3498 information_space.entropy_uniform_max -> information_space.entropy_uniform
3499 information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq
3500 information_space.KL_eq_0 -> information_space.KL_same_eq_0
3501 information_space.KL_ge_0 -> information_space.KL_nonneg
3502 information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed
3503 information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple
3504 Int_stable_cuboids -> Int_stable_atLeastAtMost
3505 Int_stable_product_algebra_generator -> positive_integral
3506 measure_preserving -> equality "distr M N f = N" "f : measurable M N"
3507 measure_space.additive -> emeasure_additive
3508 measure_space.AE_iff_null_set -> AE_iff_null
3509 measure_space.almost_everywhere_def -> eventually_ae_filter
3510 measure_space.almost_everywhere_vimage -> AE_distrD
3511 measure_space.continuity_from_above -> INF_emeasure_decseq
3512 measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq
3513 measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq
3514 measure_space.continuity_from_below -> SUP_emeasure_incseq
3515 measure_space_density -> emeasure_density
3516 measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density
3517 measure_space.integrable_vimage -> integrable_distr
3518 measure_space.integral_translated_density -> integral_density
3519 measure_space.integral_vimage -> integral_distr
3520 measure_space.measure_additive -> plus_emeasure
3521 measure_space.measure_compl -> emeasure_compl
3522 measure_space.measure_countable_increasing -> emeasure_countable_increasing
3523 measure_space.measure_countably_subadditive -> emeasure_subadditive_countably
3524 measure_space.measure_decseq -> decseq_emeasure
3525 measure_space.measure_Diff -> emeasure_Diff
3526 measure_space.measure_Diff_null_set -> emeasure_Diff_null_set
3527 measure_space.measure_eq_0 -> emeasure_eq_0
3528 measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite
3529 measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton
3530 measure_space.measure_incseq -> incseq_emeasure
3531 measure_space.measure_insert -> emeasure_insert
3532 measure_space.measure_mono -> emeasure_mono
3533 measure_space.measure_not_negative -> emeasure_not_MInf
3534 measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq
3535 measure_space.measure_setsum -> setsum_emeasure
3536 measure_space.measure_setsum_split -> setsum_emeasure_cover
3537 measure_space.measure_space_vimage -> emeasure_distr
3538 measure_space.measure_subadditive_finite -> emeasure_subadditive_finite
3539 measure_space.measure_subadditive -> subadditive
3540 measure_space.measure_top -> emeasure_space
3541 measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0
3542 measure_space.measure_Un_null_set -> emeasure_Un_null_set
3543 measure_space.positive_integral_translated_density -> positive_integral_density
3544 measure_space.positive_integral_vimage -> positive_integral_distr
3545 measure_space.real_continuity_from_above -> Lim_measure_decseq
3546 measure_space.real_continuity_from_below -> Lim_measure_incseq
3547 measure_space.real_measure_countably_subadditive -> measure_subadditive_countably
3548 measure_space.real_measure_Diff -> measure_Diff
3549 measure_space.real_measure_finite_Union -> measure_finite_Union
3550 measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton
3551 measure_space.real_measure_subadditive -> measure_subadditive
3552 measure_space.real_measure_Union -> measure_Union
3553 measure_space.real_measure_UNION -> measure_UNION
3554 measure_space.simple_function_vimage -> simple_function_comp
3555 measure_space.simple_integral_vimage -> simple_integral_distr
3556 measure_space.simple_integral_vimage -> simple_integral_distr
3557 measure_unique_Int_stable -> measure_eqI_generator_eq
3558 measure_unique_Int_stable_vimage -> measure_eqI_generator_eq
3559 pair_sigma_algebra.measurable_cut_fst -> sets_Pair1
3560 pair_sigma_algebra.measurable_cut_snd -> sets_Pair2
3561 pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1
3562 pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2
3563 pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff
3564 pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap
3565 pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'
3566 pair_sigma_algebra.sets_swap -> sets_pair_swap
3567 pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1
3568 pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2
3569 pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap
3570 pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2
3571 pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt
3572 pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times
3573 prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM
3574 prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq
3575 prob_space.measure_space_1 -> prob_space.emeasure_space_1
3576 prob_space.prob_space_vimage -> prob_space_distr
3577 prob_space.random_variable_restrict -> measurable_restrict
3578 prob_space_unique_Int_stable -> measure_eqI_prob_space
3579 product_algebraE -> prod_algebraE_all
3580 product_algebra_generator_der -> prod_algebra_eq_finite
3581 product_algebra_generator_into_space -> prod_algebra_sets_into_space
3582 product_algebraI -> sets_PiM_I_finite
3583 product_measure_exists -> product_sigma_finite.sigma_finite
3584 product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator
3585 product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb
3586 product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty
3587 product_prob_space.measurable_component -> measurable_component_singleton
3588 product_prob_space.measurable_emb -> measurable_prod_emb
3589 product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single
3590 product_prob_space.measurable_singleton_infprod -> measurable_component_singleton
3591 product_prob_space.measure_emb -> emeasure_prod_emb
3592 product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict
3593 product_sigma_algebra.product_algebra_into_space -> space_closed
3594 product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge
3595 product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton
3596 product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge
3597 sequence_space.measure_infprod -> sequence_space.measure_PiM_countable
3598 sets_product_algebra -> sets_PiM
3599 sigma_algebra.measurable_sigma -> measurable_measure_of
3600 sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint
3601 sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr
3602 sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq
3603 space_product_algebra -> space_PiM
3605 * Session HOL-TPTP: support to parse and import TPTP problems (all
3606 languages) into Isabelle/HOL.
3611 * New "case_product" attribute (see HOL).
3616 * Greater support for structured proofs involving induction or case
3619 * Much greater use of mathematical symbols.
3621 * Removal of many ML theorem bindings. INCOMPATIBILITY.
3626 * Antiquotation @{keyword "name"} produces a parser for outer syntax
3627 from a minor keyword introduced via theory header declaration.
3629 * Antiquotation @{command_spec "name"} produces the
3630 Outer_Syntax.command_spec from a major keyword introduced via theory
3631 header declaration; it can be passed to Outer_Syntax.command etc.
3633 * Local_Theory.define no longer hard-wires default theorem name
3634 "foo_def", but retains the binding as given. If that is Binding.empty
3635 / Attrib.empty_binding, the result is not registered as user-level
3636 fact. The Local_Theory.define_internal variant allows to specify a
3637 non-empty name (used for the foundation in the background theory),
3638 while omitting the fact binding in the user-context. Potential
3639 INCOMPATIBILITY for derived definitional packages: need to specify
3640 naming policy for primitive definitions more explicitly.
3642 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
3643 conformance with similar operations in structure Term and Logic.
3645 * Antiquotation @{attributes [...]} embeds attribute source
3646 representation into the ML text, which is particularly useful with
3647 declarations like Local_Theory.note.
3649 * Structure Proof_Context follows standard naming scheme. Old
3650 ProofContext has been discontinued. INCOMPATIBILITY.
3652 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
3653 change of semantics: update is applied to auxiliary local theory
3656 * Modernized some old-style infix operations:
3658 addeqcongs ~> Simplifier.add_eqcong
3659 deleqcongs ~> Simplifier.del_eqcong
3660 addcongs ~> Simplifier.add_cong
3661 delcongs ~> Simplifier.del_cong
3662 setmksimps ~> Simplifier.set_mksimps
3663 setmkcong ~> Simplifier.set_mkcong
3664 setmksym ~> Simplifier.set_mksym
3665 setmkeqTrue ~> Simplifier.set_mkeqTrue
3666 settermless ~> Simplifier.set_termless
3667 setsubgoaler ~> Simplifier.set_subgoaler
3668 addsplits ~> Splitter.add_split
3669 delsplits ~> Splitter.del_split
3674 * USER_HOME settings variable points to cross-platform user home
3675 directory, which coincides with HOME on POSIX systems only. Likewise,
3676 the Isabelle path specification "~" now expands to $USER_HOME, instead
3677 of former $HOME. A different default for USER_HOME may be set
3678 explicitly in shell environment, before Isabelle settings are
3679 evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where
3680 the generic user home was intended.
3682 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
3683 notation, which is useful for the jEdit file browser, for example.
3685 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
3690 New in Isabelle2011-1 (October 2011)
3691 ------------------------------------
3695 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
3696 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
3698 - Management of multiple theory files directly from the editor
3699 buffer store -- bypassing the file-system (no requirement to save
3700 files for checking).
3702 - Markup of formal entities within the text buffer, with semantic
3703 highlighting, tooltips and hyperlinks to jump to defining source
3706 - Improved text rendering, with sub/superscripts in the source
3707 buffer (including support for copy/paste wrt. output panel, HTML
3708 theory output and other non-Isabelle text boxes).
3710 - Refined scheduling of proof checking and printing of results,
3711 based on interactive editor view. (Note: jEdit folding and
3712 narrowing allows to restrict buffer perspectives explicitly.)
3714 - Reduced CPU performance requirements, usable on machines with few
3717 - Reduced memory requirements due to pruning of unused document
3718 versions (garbage collection).
3720 See also ~~/src/Tools/jEdit/README.html for further information,
3721 including some remaining limitations.
3723 * Theory loader: source files are exclusively located via the master
3724 directory of each theory node (where the .thy file itself resides).
3725 The global load path (such as src/HOL/Library) has been discontinued.
3726 Note that the path element ~~ may be used to reference theories in the
3727 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
3730 * Theory loader: source files are identified by content via SHA1
3731 digests. Discontinued former path/modtime identification and optional
3732 ISABELLE_FILE_IDENT plugin scripts.
3734 * Parallelization of nested Isar proofs is subject to
3735 Goal.parallel_proofs_threshold (default 100). See also isabelle
3738 * Name space: former unsynchronized references are now proper
3739 configuration options, with more conventional names:
3741 long_names ~> names_long
3742 short_names ~> names_short
3743 unique_names ~> names_unique
3745 Minor INCOMPATIBILITY, need to declare options in context like this:
3747 declare [[names_unique = false]]
3749 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note
3750 that the result needs to be unique, which means fact specifications
3751 may have to be refined after enriching a proof context.
3753 * Attribute "case_names" has been refined: the assumptions in each case
3754 can be named now by following the case name with [name1 name2 ...].
3756 * Isabelle/Isar reference manual has been updated and extended:
3757 - "Synopsis" provides a catalog of main Isar language concepts.
3758 - Formal references in syntax diagrams, via @{rail} antiquotation.
3759 - Updated material from classic "ref" manual, notably about
3760 "Classical Reasoner".
3765 * Class bot and top require underlying partial order rather than
3766 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.
3768 * Class complete_lattice: generalized a couple of lemmas from sets;
3769 generalized theorems INF_cong and SUP_cong. New type classes for
3770 complete boolean algebras and complete linear orders. Lemmas
3771 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
3772 class complete_linorder.
3774 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
3775 Sup_fun_def, Inf_apply, Sup_apply.
3777 Removed redundant lemmas (the right hand side gives hints how to
3778 replace them for (metis ...), or (simp only: ...) proofs):
3780 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
3781 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
3782 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
3783 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
3784 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
3785 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
3786 Inter_def ~> INF_def, image_def
3787 Union_def ~> SUP_def, image_def
3788 INT_eq ~> INF_def, and image_def
3789 UN_eq ~> SUP_def, and image_def
3790 INF_subset ~> INF_superset_mono [OF _ order_refl]
3792 More consistent and comprehensive names:
3794 INTER_eq_Inter_image ~> INF_def
3795 UNION_eq_Union_image ~> SUP_def
3798 INF_leI ~> INF_lower
3799 INF_leI2 ~> INF_lower2
3800 le_INFI ~> INF_greatest
3801 le_SUPI ~> SUP_upper
3802 le_SUPI2 ~> SUP_upper2
3803 SUP_leI ~> SUP_least
3804 INFI_bool_eq ~> INF_bool_eq
3805 SUPR_bool_eq ~> SUP_bool_eq
3806 INFI_apply ~> INF_apply
3807 SUPR_apply ~> SUP_apply
3808 INTER_def ~> INTER_eq
3809 UNION_def ~> UNION_eq
3813 * Renamed theory Complete_Lattice to Complete_Lattices.
3816 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
3817 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
3818 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
3819 Sup_insert are now declared as [simp]. INCOMPATIBILITY.
3821 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
3822 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
3823 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor
3826 * Added syntactic classes "inf" and "sup" for the respective
3827 constants. INCOMPATIBILITY: Changes in the argument order of the
3828 (mostly internal) locale predicates for some derived classes.
3830 * Theorem collections ball_simps and bex_simps do not contain theorems
3831 referring to UNION any longer; these have been moved to collection
3832 UN_ball_bex_simps. INCOMPATIBILITY.
3834 * Theory Archimedean_Field: floor now is defined as parameter of a
3835 separate type class floor_ceiling.
3837 * Theory Finite_Set: more coherent development of fold_set locales:
3839 locale fun_left_comm ~> locale comp_fun_commute
3840 locale fun_left_comm_idem ~> locale comp_fun_idem
3842 Both use point-free characterization; interpretation proofs may need
3843 adjustment. INCOMPATIBILITY.
3845 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
3846 accordance with standard mathematical terminology. INCOMPATIBILITY.
3848 * Theory Complex_Main: The locale interpretations for the
3849 bounded_linear and bounded_bilinear locales have been removed, in
3850 order to reduce the number of duplicate lemmas. Users must use the
3851 original names for distributivity theorems, potential INCOMPATIBILITY.
3853 divide.add ~> add_divide_distrib
3854 divide.diff ~> diff_divide_distrib
3855 divide.setsum ~> setsum_divide_distrib
3856 mult.add_right ~> right_distrib
3857 mult.diff_right ~> right_diff_distrib
3858 mult_right.setsum ~> setsum_right_distrib
3859 mult_left.diff ~> left_diff_distrib
3861 * Theory Complex_Main: Several redundant theorems have been removed or
3862 replaced by more general versions. INCOMPATIBILITY.
3864 real_diff_def ~> minus_real_def
3865 real_divide_def ~> divide_real_def
3866 real_less_def ~> less_le
3867 real_abs_def ~> abs_real_def
3868 real_sgn_def ~> sgn_real_def
3869 real_mult_commute ~> mult_commute
3870 real_mult_assoc ~> mult_assoc
3871 real_mult_1 ~> mult_1_left
3872 real_add_mult_distrib ~> left_distrib
3873 real_zero_not_eq_one ~> zero_neq_one
3874 real_mult_inverse_left ~> left_inverse
3875 INVERSE_ZERO ~> inverse_zero
3876 real_le_refl ~> order_refl
3877 real_le_antisym ~> order_antisym
3878 real_le_trans ~> order_trans
3879 real_le_linear ~> linear
3880 real_le_eq_diff ~> le_iff_diff_le_0
3881 real_add_left_mono ~> add_left_mono
3882 real_mult_order ~> mult_pos_pos
3883 real_mult_less_mono2 ~> mult_strict_left_mono
3884 real_of_int_real_of_nat ~> real_of_int_of_nat_eq
3885 real_0_le_divide_iff ~> zero_le_divide_iff
3886 realpow_two_disj ~> power2_eq_iff
3887 real_squared_diff_one_factored ~> square_diff_one_factored
3888 realpow_two_diff ~> square_diff_square_factored
3889 reals_complete2 ~> complete_real
3890 real_sum_squared_expand ~> power2_sum
3891 exp_ln_eq ~> ln_unique
3893 expi_zero ~> exp_zero
3894 lemma_DERIV_subst ~> DERIV_cong
3895 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
3896 LIMSEQ_const ~> tendsto_const
3897 LIMSEQ_norm ~> tendsto_norm
3898 LIMSEQ_add ~> tendsto_add
3899 LIMSEQ_minus ~> tendsto_minus
3900 LIMSEQ_minus_cancel ~> tendsto_minus_cancel
3901 LIMSEQ_diff ~> tendsto_diff
3902 bounded_linear.LIMSEQ ~> bounded_linear.tendsto
3903 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
3904 LIMSEQ_mult ~> tendsto_mult
3905 LIMSEQ_inverse ~> tendsto_inverse
3906 LIMSEQ_divide ~> tendsto_divide
3907 LIMSEQ_pow ~> tendsto_power
3908 LIMSEQ_setsum ~> tendsto_setsum
3909 LIMSEQ_setprod ~> tendsto_setprod
3910 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
3911 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
3912 LIMSEQ_imp_rabs ~> tendsto_rabs
3913 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
3914 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
3915 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
3916 LIMSEQ_Complex ~> tendsto_Complex
3917 LIM_ident ~> tendsto_ident_at
3918 LIM_const ~> tendsto_const
3919 LIM_add ~> tendsto_add
3920 LIM_add_zero ~> tendsto_add_zero
3921 LIM_minus ~> tendsto_minus
3922 LIM_diff ~> tendsto_diff
3923 LIM_norm ~> tendsto_norm
3924 LIM_norm_zero ~> tendsto_norm_zero
3925 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
3926 LIM_norm_zero_iff ~> tendsto_norm_zero_iff
3927 LIM_rabs ~> tendsto_rabs
3928 LIM_rabs_zero ~> tendsto_rabs_zero
3929 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
3930 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
3931 LIM_compose ~> tendsto_compose
3932 LIM_mult ~> tendsto_mult
3933 LIM_scaleR ~> tendsto_scaleR
3934 LIM_of_real ~> tendsto_of_real
3935 LIM_power ~> tendsto_power
3936 LIM_inverse ~> tendsto_inverse
3937 LIM_sgn ~> tendsto_sgn
3938 isCont_LIM_compose ~> isCont_tendsto_compose
3939 bounded_linear.LIM ~> bounded_linear.tendsto
3940 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
3941 bounded_bilinear.LIM ~> bounded_bilinear.tendsto
3942 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
3943 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
3944 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
3945 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
3947 * Theory Complex_Main: The definition of infinite series was
3948 generalized. Now it is defined on the type class {topological_space,
3949 comm_monoid_add}. Hence it is useable also for extended real numbers.
3951 * Theory Complex_Main: The complex exponential function "expi" is now
3952 a type-constrained abbreviation for "exp :: complex => complex"; thus
3953 several polymorphic lemmas about "exp" are now applicable to "expi".
3957 - Theory Library/Code_Char_ord provides native ordering of
3958 characters in the target language.
3960 - Commands code_module and code_library are legacy, use export_code
3963 - Method "evaluation" is legacy, use method "eval" instead.
3965 - Legacy evaluator "SML" is deactivated by default. May be
3966 reactivated by the following theory command:
3968 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
3970 * Declare ext [intro] by default. Rare INCOMPATIBILITY.
3972 * New proof method "induction" that gives induction hypotheses the
3973 name "IH", thus distinguishing them from further hypotheses that come
3974 from rule induction. The latter are still called "hyps". Method
3975 "induction" is a thin wrapper around "induct" and follows the same
3978 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
3979 still available as a legacy feature for some time.
3982 - Added "need" and "total_consts" options.
3983 - Reintroduced "show_skolems" option by popular demand.
3984 - Renamed attribute: nitpick_def ~> nitpick_unfold.
3988 - Use quasi-sound (and efficient) translations by default.
3989 - Added support for the following provers: E-ToFoF, LEO-II,
3990 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
3991 - Automatically preplay and minimize proofs before showing them if
3992 this can be done within reasonable time.
3993 - sledgehammer available_provers ~> sledgehammer supported_provers.
3995 - Added "preplay_timeout", "slicing", "type_enc", "sound",
3996 "max_mono_iters", and "max_new_mono_instances" options.
3997 - Removed "explicit_apply" and "full_types" options as well as "Full
3998 Types" Proof General menu item. INCOMPATIBILITY.
4001 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
4002 - Obsoleted "metisFT" -- use "metis (full_types)" instead.
4006 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
4007 "elim:" options. INCOMPATIBILITY.
4008 - Introduced 'try' that not only runs 'try_methods' but also
4009 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
4012 - Added "eval" option to evaluate terms for the found counterexample
4013 (currently only supported by the default (exhaustive) tester).
4014 - Added post-processing of terms to obtain readable counterexamples
4015 (currently only supported by the default (exhaustive) tester).
4016 - New counterexample generator quickcheck[narrowing] enables
4017 narrowing-based testing. Requires the Glasgow Haskell compiler
4018 with its installation location defined in the Isabelle settings
4019 environment as ISABELLE_GHC.
4020 - Removed quickcheck tester "SML" based on the SML code generator
4021 (formly in HOL/Library).
4023 * Function package: discontinued option "tailrec". INCOMPATIBILITY,
4024 use 'partial_function' instead.
4026 * Theory Library/Extended_Reals replaces now the positive extended
4027 reals found in probability theory. This file is extended by
4028 Multivariate_Analysis/Extended_Real_Limits.
4030 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,
4031 from where it must be imported explicitly if it is really required.
4034 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
4035 been moved here. INCOMPATIBILITY.
4037 * Theory Library/Saturated provides type of numbers with saturated
4040 * Theory Library/Product_Lattice defines a pointwise ordering for the
4041 product type 'a * 'b, and provides instance proofs for various order
4042 and lattice type classes.
4044 * Theory Library/Countable now provides the "countable_datatype" proof
4045 method for proving "countable" class instances for datatypes.
4047 * Theory Library/Cset_Monad allows do notation for computable sets
4048 (cset) via the generic monad ad-hoc overloading facility.
4050 * Library: Theories of common data structures are split into theories
4051 for implementation, an invariant-ensuring type, and connection to an
4052 abstract type. INCOMPATIBILITY.
4054 - RBT is split into RBT and RBT_Mapping.
4055 - AssocList is split and renamed into AList and AList_Mapping.
4056 - DList is split into DList_Impl, DList, and DList_Cset.
4057 - Cset is split into Cset and List_Cset.
4059 * Theory Library/Nat_Infinity has been renamed to
4060 Library/Extended_Nat, with name changes of the following types and
4063 type inat ~> type enat
4065 Infty ~> infinity (overloaded)
4069 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
4070 been renamed accordingly. INCOMPATIBILITY.
4072 * Session Multivariate_Analysis: The euclidean_space type class now
4073 fixes a constant "Basis :: 'a set" consisting of the standard
4074 orthonormal basis for the type. Users now have the option of
4075 quantifying over this set instead of using the "basis" function, e.g.
4076 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
4078 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
4079 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
4080 "Cart_nth" and "Cart_lambda" have been respectively renamed to
4081 "vec_nth" and "vec_lambda"; theorems mentioning those names have
4082 changed to match. Definition theorems for overloaded constants now use
4083 the standard "foo_vec_def" naming scheme. A few other theorems have
4084 been renamed as follows (INCOMPATIBILITY):
4086 Cart_eq ~> vec_eq_iff
4087 dist_nth_le_cart ~> dist_vec_nth_le
4088 tendsto_vector ~> vec_tendstoI
4089 Cauchy_vector ~> vec_CauchyI
4091 * Session Multivariate_Analysis: Several duplicate theorems have been
4092 removed, and other theorems have been renamed or replaced with more
4093 general versions. INCOMPATIBILITY.
4095 finite_choice ~> finite_set_choice
4096 eventually_conjI ~> eventually_conj
4097 eventually_and ~> eventually_conj_iff
4098 eventually_false ~> eventually_False
4099 setsum_norm ~> norm_setsum
4100 Lim_sequentially ~> LIMSEQ_def
4101 Lim_ident_at ~> LIM_ident
4102 Lim_const ~> tendsto_const
4103 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
4104 Lim_neg ~> tendsto_minus
4105 Lim_add ~> tendsto_add
4106 Lim_sub ~> tendsto_diff
4107 Lim_mul ~> tendsto_scaleR
4108 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
4109 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
4110 Lim_linear ~> bounded_linear.tendsto
4111 Lim_component ~> tendsto_euclidean_component
4112 Lim_component_cart ~> tendsto_vec_nth
4113 Lim_inner ~> tendsto_inner [OF tendsto_const]
4114 dot_lsum ~> inner_setsum_left
4115 dot_rsum ~> inner_setsum_right
4116 continuous_cmul ~> continuous_scaleR [OF continuous_const]
4117 continuous_neg ~> continuous_minus
4118 continuous_sub ~> continuous_diff
4119 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
4120 continuous_mul ~> continuous_scaleR
4121 continuous_inv ~> continuous_inverse
4122 continuous_at_within_inv ~> continuous_at_within_inverse
4123 continuous_at_inv ~> continuous_at_inverse
4124 continuous_at_norm ~> continuous_norm [OF continuous_at_id]
4125 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
4126 continuous_at_component ~> continuous_component [OF continuous_at_id]
4127 continuous_on_neg ~> continuous_on_minus
4128 continuous_on_sub ~> continuous_on_diff
4129 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
4130 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
4131 continuous_on_mul ~> continuous_on_scaleR
4132 continuous_on_mul_real ~> continuous_on_mult
4133 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
4134 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
4135 continuous_on_inverse ~> continuous_on_inv
4136 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
4137 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
4138 subset_interior ~> interior_mono
4139 subset_closure ~> closure_mono
4140 closure_univ ~> closure_UNIV
4141 real_arch_lt ~> reals_Archimedean2
4142 real_arch ~> reals_Archimedean3
4143 real_abs_norm ~> abs_norm_cancel
4144 real_abs_sub_norm ~> norm_triangle_ineq3
4145 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
4147 * Session HOL-Probability:
4148 - Caratheodory's extension lemma is now proved for ring_of_sets.
4149 - Infinite products of probability measures are now available.
4150 - Sigma closure is independent, if the generator is independent
4151 - Use extended reals instead of positive extended
4152 reals. INCOMPATIBILITY.
4154 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
4156 expand_fun_below ~> fun_below_iff
4157 below_fun_ext ~> fun_belowI
4158 expand_cfun_eq ~> cfun_eq_iff
4159 ext_cfun ~> cfun_eqI
4160 expand_cfun_below ~> cfun_below_iff
4161 below_cfun_ext ~> cfun_belowI
4162 monofun_fun_fun ~> fun_belowD
4163 monofun_fun_arg ~> monofunE
4164 monofun_lub_fun ~> adm_monofun [THEN admD]
4165 cont_lub_fun ~> adm_cont [THEN admD]
4166 cont2cont_Rep_CFun ~> cont2cont_APP
4167 cont_Rep_CFun_app ~> cont_APP_app
4168 cont_Rep_CFun_app_app ~> cont_APP_app_app
4169 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
4170 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
4171 contlub_cfun ~> lub_APP [symmetric]
4172 contlub_LAM ~> lub_LAM [symmetric]
4175 lift_distinct1 ~> lift.distinct(1)
4176 lift_distinct2 ~> lift.distinct(2)
4177 Def_not_UU ~> lift.distinct(2)
4178 Def_inject ~> lift.inject
4179 below_UU_iff ~> below_bottom_iff
4180 eq_UU_iff ~> eq_bottom_iff
4183 *** Document preparation ***
4185 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
4186 isar-ref manual, both for description and actual application of the
4189 * Antiquotation @{value} evaluates the given term and presents its
4192 * Antiquotations: term style "isub" provides ad-hoc conversion of
4193 variables x1, y23 into subscripted form x\<^isub>1,
4194 y\<^isub>2\<^isub>3.
4196 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
4197 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
4199 * Localized \isabellestyle switch can be used within blocks or groups
4202 \isabellestyle{it} %preferred default
4203 {\isabellestylett @{text "typewriter stuff"}}
4205 * Discontinued special treatment of hard tabulators. Implicit
4206 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual
4212 * The inner syntax of sort/type/term/prop supports inlined YXML
4213 representations within quoted string tokens. By encoding logical
4214 entities via Term_XML (in ML or Scala) concrete syntax can be
4215 bypassed, which is particularly useful for producing bits of text
4216 under external program control.
4218 * Antiquotations for ML and document preparation are managed as theory
4219 data, which requires explicit setup.
4221 * Isabelle_Process.is_active allows tools to check if the official
4222 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
4223 (better known as Proof General).
4225 * Structure Proof_Context follows standard naming scheme. Old
4226 ProofContext is still available for some time as legacy alias.
4228 * Structure Timing provides various operations for timing; supersedes
4229 former start_timing/end_timing etc.
4231 * Path.print is the official way to show file-system paths to users
4232 (including quotes etc.).
4234 * Inner syntax: identifiers in parse trees of generic categories
4235 "logic", "aprop", "idt" etc. carry position information (disguised as
4236 type constraints). Occasional INCOMPATIBILITY with non-compliant
4237 translations that choke on unexpected type constraints. Positions can
4238 be stripped in ML translations via Syntax.strip_positions /
4239 Syntax.strip_positions_ast, or via the syntax constant
4240 "_strip_positions" within parse trees. As last resort, positions can
4241 be disabled via the configuration option Syntax.positions, which is
4242 called "syntax_positions" in Isar attribute syntax.
4244 * Discontinued special status of various ML structures that contribute
4245 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
4246 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
4247 refer directly to Ast.Constant, Lexicon.is_identifier,
4248 Syntax_Trans.mk_binder_tr etc.
4250 * Typed print translation: discontinued show_sorts argument, which is
4251 already available via context of "advanced" translation.
4253 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
4254 goal states; body tactic needs to address all subgoals uniformly.
4256 * Slightly more special eq_list/eq_set, with shortcut involving
4257 pointer equality (assumes that eq relation is reflexive).
4259 * Classical tactics use proper Proof.context instead of historic types
4260 claset/clasimpset. Old-style declarations like addIs, addEs, addDs
4261 operate directly on Proof.context. Raw type claset retains its use as
4262 snapshot of the classical context, which can be recovered via
4263 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.
4264 INCOMPATIBILITY, classical tactics and derived proof methods require
4265 proper Proof.context.
4270 * Discontinued support for Poly/ML 5.2, which was the last version
4271 without proper multithreading and TimeLimit implementation.
4273 * Discontinued old lib/scripts/polyml-platform, which has been
4274 obsolete since Isabelle2009-2.
4276 * Various optional external tools are referenced more robustly and
4277 uniformly by explicit Isabelle settings as follows:
4279 ISABELLE_CSDP (formerly CSDP_EXE)
4280 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)
4281 ISABELLE_OCAML (formerly EXEC_OCAML)
4282 ISABELLE_SWIPL (formerly EXEC_SWIPL)
4283 ISABELLE_YAP (formerly EXEC_YAP)
4285 Note that automated detection from the file-system or search path has
4286 been discontinued. INCOMPATIBILITY.
4288 * Scala layer provides JVM method invocation service for static
4289 methods of type (String)String, see Invoke_Scala.method in ML. For
4292 Invoke_Scala.method "java.lang.System.getProperty" "java.home"
4294 Together with YXML.string_of_body/parse_body and XML.Encode/Decode
4295 this allows to pass structured values between ML and Scala.
4297 * The IsabelleText fonts includes some further glyphs to support the
4298 Prover IDE. Potential INCOMPATIBILITY: users who happen to have
4299 installed a local copy (which is normally *not* required) need to
4300 delete or update it from ~~/lib/fonts/.
4304 New in Isabelle2011 (January 2011)
4305 ----------------------------------
4309 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
4310 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
4311 useful tooltips and hyperlinks produced from its static analysis. The
4312 bundled component provides an executable Isabelle tool that can be run
4315 Isabelle2011/bin/isabelle jedit
4317 * Significantly improved Isabelle/Isar implementation manual.
4319 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
4320 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
4321 while the default heap location within that directory lacks that extra
4322 suffix. This isolates multiple Isabelle installations from each
4323 other, avoiding problems with old settings in new versions.
4324 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
4326 * Source files are always encoded as UTF-8, instead of old-fashioned
4327 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
4328 the following package declarations:
4330 \usepackage[utf8]{inputenc}
4331 \usepackage{textcomp}
4333 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
4334 a Unicode character is treated as a single symbol, not a sequence of
4335 non-ASCII bytes as before. Since Isabelle/ML string literals may
4336 contain symbols without further backslash escapes, Unicode can now be
4337 used here as well. Recall that Symbol.explode in ML provides a
4338 consistent view on symbols, while raw explode (or String.explode)
4339 merely give a byte-oriented representation.
4341 * Theory loader: source files are primarily located via the master
4342 directory of each theory node (where the .thy file itself resides).
4343 The global load path is still partially available as legacy feature.
4344 Minor INCOMPATIBILITY due to subtle change in file lookup: use
4345 explicit paths, relatively to the theory.
4347 * Special treatment of ML file names has been discontinued.
4348 Historically, optional extensions .ML or .sml were added on demand --
4349 at the cost of clarity of file dependencies. Recall that Isabelle/ML
4350 files exclusively use the .ML extension. Minor INCOMPATIBILITY.
4352 * Various options that affect pretty printing etc. are now properly
4353 handled within the context via configuration options, instead of
4354 unsynchronized references or print modes. There are both ML Config.T
4355 entities and Isar declaration attributes to access these.
4357 ML (Config.T) Isar (attribute)
4359 eta_contract eta_contract
4360 show_brackets show_brackets
4361 show_sorts show_sorts
4362 show_types show_types
4363 show_question_marks show_question_marks
4364 show_consts show_consts
4365 show_abbrevs show_abbrevs
4367 Syntax.ast_trace syntax_ast_trace
4368 Syntax.ast_stat syntax_ast_stat
4369 Syntax.ambiguity_level syntax_ambiguity_level
4371 Goal_Display.goals_limit goals_limit
4372 Goal_Display.show_main_goal show_main_goal
4374 Method.rule_trace rule_trace
4376 Thy_Output.display thy_output_display
4377 Thy_Output.quotes thy_output_quotes
4378 Thy_Output.indent thy_output_indent
4379 Thy_Output.source thy_output_source
4380 Thy_Output.break thy_output_break
4382 Note that corresponding "..._default" references in ML may only be
4383 changed globally at the ROOT session setup, but *not* within a theory.
4384 The option "show_abbrevs" supersedes the former print mode
4385 "no_abbrevs" with inverted meaning.
4387 * More systematic naming of some configuration options.
4390 trace_simp ~> simp_trace
4391 debug_simp ~> simp_debug
4393 * Support for real valued configuration options, using simplistic
4394 floating-point notation that coincides with the inner syntax for
4397 * Support for real valued preferences (with approximative PGIP type):
4398 front-ends need to accept "pgint" values in float notation.
4401 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
4404 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
4409 * Command 'type_synonym' (with single argument) replaces somewhat
4410 outdated 'types', which is still available as legacy feature for some
4413 * Command 'nonterminal' (with 'and' separated list of arguments)
4414 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
4416 * Command 'notepad' replaces former 'example_proof' for
4417 experimentation in Isar without any result. INCOMPATIBILITY.
4419 * Locale interpretation commands 'interpret' and 'sublocale' accept
4420 lists of equations to map definitions in a locale to appropriate
4421 entities in the context of the interpretation. The 'interpretation'
4422 command already provided this functionality.
4424 * Diagnostic command 'print_dependencies' prints the locale instances
4425 that would be activated if the specified expression was interpreted in
4426 the current context. Variant "print_dependencies!" assumes a context
4427 without interpretations.
4429 * Diagnostic command 'print_interps' prints interpretations in proofs
4430 in addition to interpretations in theories.
4432 * Discontinued obsolete 'global' and 'local' commands to manipulate
4433 the theory name space. Rare INCOMPATIBILITY. The ML functions
4434 Sign.root_path and Sign.local_path may be applied directly where this
4435 feature is still required for historical reasons.
4437 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
4438 'definition' instead.
4440 * The "prems" fact, which refers to the accidental collection of
4441 foundational premises in the context, is now explicitly marked as
4442 legacy feature and will be discontinued soon. Consider using "assms"
4443 of the head statement or reference facts by explicit names.
4445 * Document antiquotations @{class} and @{type} print classes and type
4448 * Document antiquotation @{file} checks file/directory entries within
4449 the local file system.
4454 * Coercive subtyping: functions can be declared as coercions and type
4455 inference will add them as necessary upon input of a term. Theory
4456 Complex_Main declares real :: nat => real and real :: int => real as
4457 coercions. A coercion function f is declared like this:
4459 declare [[coercion f]]
4461 To lift coercions through type constructors (e.g. from nat => real to
4462 nat list => real list), map functions can be declared, e.g.
4464 declare [[coercion_map map]]
4466 Currently coercion inference is activated only in theories including
4467 real numbers, i.e. descendants of Complex_Main. This is controlled by
4468 the configuration option "coercion_enabled", e.g. it can be enabled in
4469 other theories like this:
4471 declare [[coercion_enabled]]
4473 * Command 'partial_function' provides basic support for recursive
4474 function definitions over complete partial orders. Concrete instances
4475 are provided for i) the option type, ii) tail recursion on arbitrary
4476 types, and iii) the heap monad of Imperative_HOL. See
4477 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
4480 * Function package: f.psimps rules are no longer implicitly declared
4481 as [simp]. INCOMPATIBILITY.
4483 * Datatype package: theorems generated for executable equality (class
4484 "eq") carry proper names and are treated as default code equations.
4486 * Inductive package: now offers command 'inductive_simps' to
4487 automatically derive instantiated and simplified equations for
4488 inductive predicates, similar to 'inductive_cases'.
4490 * Command 'enriched_type' allows to register properties of the
4491 functorial structure of types.
4493 * Improved infrastructure for term evaluation using code generator
4494 techniques, in particular static evaluation conversions.
4496 * Code generator: Scala (2.8 or higher) has been added to the target
4499 * Code generator: globbing constant expressions "*" and "Theory.*"
4500 have been replaced by the more idiomatic "_" and "Theory._".
4503 * Code generator: export_code without explicit file declaration prints
4504 to standard output. INCOMPATIBILITY.
4506 * Code generator: do not print function definitions for case
4507 combinators any longer.
4509 * Code generator: simplification with rules determined with
4510 src/Tools/Code/code_simp.ML and method "code_simp".
4512 * Code generator for records: more idiomatic representation of record
4513 types. Warning: records are not covered by ancient SML code
4514 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
4515 rep_datatype declaration helps to succeed then:
4519 rep_datatype foo_ext ...
4521 * Records: logical foundation type for records does not carry a
4522 '_type' suffix any longer (obsolete due to authentic syntax).
4525 * Quickcheck now by default uses exhaustive testing instead of random
4526 testing. Random testing can be invoked by "quickcheck [random]",
4527 exhaustive testing by "quickcheck [exhaustive]".
4529 * Quickcheck instantiates polymorphic types with small finite
4530 datatypes by default. This enables a simple execution mechanism to
4531 handle quantifiers and function equality over the finite datatypes.
4533 * Quickcheck random generator has been renamed from "code" to
4534 "random". INCOMPATIBILITY.
4536 * Quickcheck now has a configurable time limit which is set to 30
4537 seconds by default. This can be changed by adding [timeout = n] to the
4538 quickcheck command. The time limit for Auto Quickcheck is still set
4541 * Quickcheck in locales considers interpretations of that locale for
4542 counter example search.
4545 - Added "smt" and "remote_smt" provers based on the "smt" proof
4546 method. See the Sledgehammer manual for details ("isabelle doc
4549 sledgehammer atp_info ~> sledgehammer running_provers
4550 sledgehammer atp_kill ~> sledgehammer kill_provers
4551 sledgehammer available_atps ~> sledgehammer available_provers
4554 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
4555 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
4556 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
4557 (and "ms" and "min" are no longer supported)
4562 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
4563 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
4565 - Added support for partial quotient types.
4566 - Added local versions of the "Nitpick.register_xxx" functions.
4567 - Added "whack" option.
4568 - Allow registration of quotient types as codatatypes.
4569 - Improved "merge_type_vars" option to merge more types.
4570 - Removed unsound "fast_descrs" option.
4571 - Added custom symmetry breaking for datatypes, making it possible to reach
4572 higher cardinalities.
4573 - Prevent the expansion of too large definitions.
4575 * Proof methods "metis" and "meson" now have configuration options
4576 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
4577 to diagnose these tools. E.g.
4579 using [[metis_trace = true]]
4581 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
4582 manually as command 'solve_direct'.
4584 * The default SMT solver Z3 must be enabled explicitly (due to
4585 licensing issues) by setting the environment variable
4586 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
4587 commercial applications, the SMT solver CVC3 is provided as fall-back;
4588 changing the SMT solver is done via the configuration option
4591 * Remote SMT solvers need to be referred to by the "remote_" prefix,
4592 i.e. "remote_cvc3" and "remote_z3".
4594 * Added basic SMT support for datatypes, records, and typedefs using
4595 the oracle mode (no proofs). Direct support of pairs has been dropped
4596 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
4597 support for a similar behavior). Minor INCOMPATIBILITY.
4599 * Changed SMT configuration options:
4601 z3_proofs ~> smt_oracle (with inverted meaning)
4602 z3_trace_assms ~> smt_trace_used_facts
4615 * Boogie output files (.b2i files) need to be declared in the theory
4618 * Simplification procedure "list_to_set_comprehension" rewrites list
4619 comprehensions applied to List.set to set comprehensions. Occasional
4620 INCOMPATIBILITY, may be deactivated like this:
4622 declare [[simproc del: list_to_set_comprehension]]
4624 * Removed old version of primrec package. INCOMPATIBILITY.
4626 * Removed simplifier congruence rule of "prod_case", as has for long
4627 been the case with "split". INCOMPATIBILITY.
4629 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
4631 * Removed [split_format ... and ... and ...] version of
4632 [split_format]. Potential INCOMPATIBILITY.
4634 * Predicate "sorted" now defined inductively, with nice induction
4635 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
4637 * Constant "contents" renamed to "the_elem", to free the generic name
4638 contents for other uses. INCOMPATIBILITY.
4640 * Renamed class eq and constant eq (for code generation) to class
4641 equal and constant equal, plus renaming of related facts and various
4642 tuning. INCOMPATIBILITY.
4644 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
4646 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
4649 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
4650 avoid confusion with finite sets. INCOMPATIBILITY.
4652 * Abandoned locales equiv, congruent and congruent2 for equivalence
4653 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
4656 * Some previously unqualified names have been qualified:
4663 Trueprop ~> HOL.Trueprop
4668 op --> ~> HOL.implies
4680 Pair ~> Product_Type.Pair
4681 fst ~> Product_Type.fst
4682 snd ~> Product_Type.snd
4683 curry ~> Product_Type.curry
4685 Collect ~> Set.Collect
4689 * More canonical naming convention for some fundamental definitions:
4691 bot_bool_eq ~> bot_bool_def
4692 top_bool_eq ~> top_bool_def
4693 inf_bool_eq ~> inf_bool_def
4694 sup_bool_eq ~> sup_bool_def
4695 bot_fun_eq ~> bot_fun_def
4696 top_fun_eq ~> top_fun_def
4697 inf_fun_eq ~> inf_fun_def
4698 sup_fun_eq ~> sup_fun_def
4702 * More stylized fact names:
4704 expand_fun_eq ~> fun_eq_iff
4705 expand_set_eq ~> set_eq_iff
4707 nat_number ~> eval_nat_numeral
4711 * Refactoring of code-generation specific operations in theory List:
4717 mem_iff ~> member_def
4718 null_empty ~> null_def
4720 INCOMPATIBILITY. Note that these were not supposed to be used
4721 regularly unless for striking reasons; their main purpose was code
4724 Various operations from the Haskell prelude are used for generating
4727 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
4728 "surj f" is now an abbreviation of "range f = UNIV". The theorems
4729 bij_def and surj_def are unchanged. INCOMPATIBILITY.
4731 * Abolished some non-alphabetic type names: "prod" and "sum" replace
4732 "*" and "+" respectively. INCOMPATIBILITY.
4734 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
4735 "Sum_Type.Plus" instead.
4737 * Constant "split" has been merged with constant "prod_case"; names of
4738 ML functions, facts etc. involving split have been retained so far,
4739 though. INCOMPATIBILITY.
4741 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
4742 instead. INCOMPATIBILITY.
4744 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
4747 * Former theory Library/Enum is now part of the HOL-Main image.
4748 INCOMPATIBILITY: all constants of the Enum theory now have to be
4749 referred to by its qualified name.
4752 nlists ~> Enum.nlists
4753 product ~> Enum.product
4755 * Theory Library/Monad_Syntax provides do-syntax for monad types.
4756 Syntax in Library/State_Monad has been changed to avoid ambiguities.
4759 * Theory Library/SetsAndFunctions has been split into
4760 Library/Function_Algebras and Library/Set_Algebras; canonical names
4761 for instance definitions for functions; various improvements.
4764 * Theory Library/Multiset provides stable quicksort implementation of
4767 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
4770 * Session Multivariate_Analysis: introduced a type class for euclidean
4771 space. Most theorems are now stated in terms of euclidean spaces
4772 instead of finite cartesian products.
4775 real ^ 'n ~> 'a::real_vector
4776 ~> 'a::euclidean_space
4777 ~> 'a::ordered_euclidean_space
4778 (depends on your needs)
4782 \<chi> x. _ ~> \<chi>\<chi> x. _
4785 Also note that the indices are now natural numbers and not from some
4786 finite type. Finite cartesian products of euclidean spaces, products
4787 of euclidean spaces the real and complex numbers are instantiated to
4788 be euclidean_spaces. INCOMPATIBILITY.
4790 * Session Probability: introduced pextreal as positive extended real
4791 numbers. Use pextreal as value for measures. Introduce the
4792 Radon-Nikodym derivative, product spaces and Fubini's theorem for
4793 arbitrary sigma finite measures. Introduces Lebesgue measure based on
4794 the integral in Multivariate Analysis. INCOMPATIBILITY.
4796 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
4799 * Session SPARK (with image HOL-SPARK) provides commands to load and
4800 prove verification conditions generated by the SPARK Ada program
4801 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
4806 * Theorems for additive ring operations (locale abelian_monoid and
4807 descendants) are generated by interpretation from their multiplicative
4808 counterparts. Names (in particular theorem names) have the mandatory
4809 qualifier 'add'. Previous theorem names are redeclared for
4812 * Structure "int_ring" is now an abbreviation (previously a
4813 definition). This fits more natural with advanced interpretations.
4818 * The domain package now runs in definitional mode by default: The
4819 former command 'new_domain' is now called 'domain'. To use the domain
4820 package in its original axiomatic mode, use 'domain (unsafe)'.
4823 * The new class "domain" is now the default sort. Class "predomain"
4824 is an unpointed version of "domain". Theories can be updated by
4825 replacing sort annotations as shown below. INCOMPATIBILITY.
4827 'a::type ~> 'a::countable
4828 'a::cpo ~> 'a::predomain
4829 'a::pcpo ~> 'a::domain
4831 * The old type class "rep" has been superseded by class "domain".
4832 Accordingly, users of the definitional package must remove any
4833 "default_sort rep" declarations. INCOMPATIBILITY.
4835 * The domain package (definitional mode) now supports unpointed
4836 predomain argument types, as long as they are marked 'lazy'. (Strict
4837 arguments must be in class "domain".) For example, the following
4838 domain definition now works:
4840 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
4842 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
4843 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
4844 'a option, and 'a list. Additionally, it configures fixrec and the
4845 domain package to work with these types. For example:
4847 fixrec isInl :: "('a + 'b) u -> tr"
4848 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
4850 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
4852 * The "(permissive)" option of fixrec has been replaced with a
4853 per-equation "(unchecked)" option. See
4854 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
4856 * The "bifinite" class no longer fixes a constant "approx"; the class
4857 now just asserts that such a function exists. INCOMPATIBILITY.
4859 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
4860 defines an embedding of type 'a defl into udom by default; instances
4861 of "bifinite" and "domain" classes are available in
4862 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
4864 * The syntax "REP('a)" has been replaced with "DEFL('a)".
4866 * The predicate "directed" has been removed. INCOMPATIBILITY.
4868 * The type class "finite_po" has been removed. INCOMPATIBILITY.
4870 * The function "cprod_map" has been renamed to "prod_map".
4873 * The monadic bind operator on each powerdomain has new binder syntax
4874 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
4875 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
4877 * The infix syntax for binary union on each powerdomain has changed
4878 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
4879 syntax. INCOMPATIBILITY.
4881 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
4882 still supported as an input translation.
4884 * Renamed some theorems (the original names are also still available).
4886 expand_fun_below ~> fun_below_iff
4887 below_fun_ext ~> fun_belowI
4888 expand_cfun_eq ~> cfun_eq_iff
4889 ext_cfun ~> cfun_eqI
4890 expand_cfun_below ~> cfun_below_iff
4891 below_cfun_ext ~> cfun_belowI
4892 cont2cont_Rep_CFun ~> cont2cont_APP
4894 * The Abs and Rep functions for various types have changed names.
4895 Related theorem names have also changed to match. INCOMPATIBILITY.
4897 Rep_CFun ~> Rep_cfun
4898 Abs_CFun ~> Abs_cfun
4899 Rep_Sprod ~> Rep_sprod
4900 Abs_Sprod ~> Abs_sprod
4901 Rep_Ssum ~> Rep_ssum
4902 Abs_Ssum ~> Abs_ssum
4904 * Lemmas with names of the form *_defined_iff or *_strict_iff have
4905 been renamed to *_bottom_iff. INCOMPATIBILITY.
4907 * Various changes to bisimulation/coinduction with domain package:
4909 - Definitions of "bisim" constants no longer mention definedness.
4910 - With mutual recursion, "bisim" predicate is now curried.
4911 - With mutual recursion, each type gets a separate coind theorem.
4912 - Variable names in bisim_def and coinduct rules have changed.
4916 * Case combinators generated by the domain package for type "foo" are
4917 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
4919 * Several theorems have been renamed to more accurately reflect the
4920 names of constants and types involved. INCOMPATIBILITY.
4922 thelub_const ~> lub_const
4923 lub_const ~> is_lub_const
4925 is_lub_lub ~> is_lubD2
4927 unique_lub ~> is_lub_unique
4928 is_ub_lub ~> is_lub_rangeD1
4929 lub_bin_chain ~> is_lub_bin_chain
4930 lub_fun ~> is_lub_fun
4931 thelub_fun ~> lub_fun
4932 thelub_cfun ~> lub_cfun
4933 thelub_Pair ~> lub_Pair
4934 lub_cprod ~> is_lub_prod
4935 thelub_cprod ~> lub_prod
4936 minimal_cprod ~> minimal_prod
4937 inst_cprod_pcpo ~> inst_prod_pcpo
4939 compact_UU ~> compact_bottom
4940 deflation_UU ~> deflation_bottom
4941 finite_deflation_UU ~> finite_deflation_bottom
4943 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
4945 sq_ord_less_eq_trans ~> below_eq_trans
4946 sq_ord_eq_less_trans ~> eq_below_trans
4947 refl_less ~> below_refl
4948 trans_less ~> below_trans
4949 antisym_less ~> below_antisym
4950 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
4951 box_less ~> box_below
4952 rev_trans_less ~> rev_below_trans
4953 not_less2not_eq ~> not_below2not_eq
4954 less_UU_iff ~> below_UU_iff
4955 flat_less_iff ~> flat_below_iff
4956 adm_less ~> adm_below
4957 adm_not_less ~> adm_not_below
4958 adm_compact_not_less ~> adm_compact_not_below
4959 less_fun_def ~> below_fun_def
4960 expand_fun_less ~> fun_below_iff
4961 less_fun_ext ~> fun_belowI
4962 less_discr_def ~> below_discr_def
4963 discr_less_eq ~> discr_below_eq
4964 less_unit_def ~> below_unit_def
4965 less_cprod_def ~> below_prod_def
4966 prod_lessI ~> prod_belowI
4967 Pair_less_iff ~> Pair_below_iff
4968 fst_less_iff ~> fst_below_iff
4969 snd_less_iff ~> snd_below_iff
4970 expand_cfun_less ~> cfun_below_iff
4971 less_cfun_ext ~> cfun_belowI
4972 injection_less ~> injection_below
4973 less_up_def ~> below_up_def
4974 not_Iup_less ~> not_Iup_below
4975 Iup_less ~> Iup_below
4977 Def_inject_less_eq ~> Def_below_Def
4978 Def_less_is_eq ~> Def_below_iff
4979 spair_less_iff ~> spair_below_iff
4980 less_sprod ~> below_sprod
4981 spair_less ~> spair_below
4982 sfst_less_iff ~> sfst_below_iff
4983 ssnd_less_iff ~> ssnd_below_iff
4984 fix_least_less ~> fix_least_below
4985 dist_less_one ~> dist_below_one
4986 less_ONE ~> below_ONE
4987 ONE_less_iff ~> ONE_below_iff
4988 less_sinlD ~> below_sinlD
4989 less_sinrD ~> below_sinrD
4994 * All constant names are now qualified internally and use proper
4995 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
5000 * Antiquotation @{assert} inlines a function bool -> unit that raises
5001 Fail if the argument is false. Due to inlining the source position of
5002 failed assertions is included in the error output.
5004 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
5005 text is in practice always evaluated with a stable theory checkpoint.
5006 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
5008 * Antiquotation @{theory A} refers to theory A from the ancestry of
5009 the current context, not any accidental theory loader state as before.
5010 Potential INCOMPATIBILITY, subtle change in semantics.
5012 * Syntax.pretty_priority (default 0) configures the required priority
5013 of pretty-printed output and thus affects insertion of parentheses.
5015 * Syntax.default_root (default "any") configures the inner syntax
5016 category (nonterminal symbol) for parsing of terms.
5018 * Former exception Library.UnequalLengths now coincides with
5019 ListPair.UnequalLengths.
5021 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
5022 main functionality is provided by structure Simplifier.
5024 * Renamed raw "explode" function to "raw_explode" to emphasize its
5025 meaning. Note that internally to Isabelle, Symbol.explode is used in
5026 almost all situations.
5028 * Discontinued obsolete function sys_error and exception SYS_ERROR.
5029 See implementation manual for further details on exceptions in
5032 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
5035 * Renamed structure PureThy to Pure_Thy and moved most of its
5036 operations to structure Global_Theory, to emphasize that this is
5037 rarely-used global-only stuff.
5039 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
5040 instead (or tracing for high-volume output).
5042 * Configuration option show_question_marks only affects regular pretty
5043 printing of types and terms, not raw Term.string_of_vname.
5045 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
5046 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
5047 @{thms} for most purposes.
5049 * ML structure Unsynchronized is never opened, not even in Isar
5050 interaction mode as before. Old Unsynchronized.set etc. have been
5051 discontinued -- use plain := instead. This should be *rare* anyway,
5052 since modern tools always work via official context data, notably
5053 configuration options.
5055 * Parallel and asynchronous execution requires special care concerning
5056 interrupts. Structure Exn provides some convenience functions that
5057 avoid working directly with raw Interrupt. User code must not absorb
5058 interrupts -- intermediate handling (for cleanup etc.) needs to be
5059 followed by re-raising of the original exception. Another common
5060 source of mistakes are "handle _" patterns, which make the meaning of
5061 the program subject to physical effects of the environment.
5065 New in Isabelle2009-2 (June 2010)
5066 ---------------------------------
5070 * Authentic syntax for *all* logical entities (type classes, type
5071 constructors, term constants): provides simple and robust
5072 correspondence between formal entities and concrete syntax. Within
5073 the parse tree / AST representations, "constants" are decorated by
5074 their category (class, type, const) and spelled out explicitly with
5075 their full internal name.
5077 Substantial INCOMPATIBILITY concerning low-level syntax declarations
5078 and translations (translation rules and translation functions in ML).
5079 Some hints on upgrading:
5081 - Many existing uses of 'syntax' and 'translations' can be replaced
5082 by more modern 'type_notation', 'notation' and 'abbreviation',
5083 which are independent of this issue.
5085 - 'translations' require markup within the AST; the term syntax
5086 provides the following special forms:
5088 CONST c -- produces syntax version of constant c from context
5089 XCONST c -- literally c, checked as constant from context
5090 c -- literally c, if declared by 'syntax'
5092 Plain identifiers are treated as AST variables -- occasionally the
5093 system indicates accidental variables via the error "rhs contains
5096 Type classes and type constructors are marked according to their
5097 concrete syntax. Some old translations rules need to be written
5098 for the "type" category, using type constructor application
5099 instead of pseudo-term application of the default category
5102 - 'parse_translation' etc. in ML may use the following
5105 @{class_syntax c} -- type class c within parse tree / AST
5106 @{term_syntax c} -- type constructor c within parse tree / AST
5107 @{const_syntax c} -- ML version of "CONST c" above
5108 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
5110 - Literal types within 'typed_print_translations', i.e. those *not*
5111 represented as pseudo-terms are represented verbatim. Use @{class
5112 c} or @{type_name c} here instead of the above syntax
5115 Note that old non-authentic syntax was based on unqualified base
5116 names, so all of the above "constant" names would coincide. Recall
5117 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
5118 diagnose syntax problems.
5120 * Type constructors admit general mixfix syntax, not just infix.
5122 * Concrete syntax may be attached to local entities without a proof
5123 body, too. This works via regular mixfix annotations for 'fix',
5124 'def', 'obtain' etc. or via the explicit 'write' command, which is
5125 similar to the 'notation' command in theory specifications.
5127 * Discontinued unnamed infix syntax (legacy feature for many years) --
5128 need to specify constant name and syntax separately. Internal ML
5129 datatype constructors have been renamed from InfixName to Infix etc.
5130 Minor INCOMPATIBILITY.
5132 * Schematic theorem statements need to be explicitly markup as such,
5133 via commands 'schematic_lemma', 'schematic_theorem',
5134 'schematic_corollary'. Thus the relevance of the proof is made
5135 syntactically clear, which impacts performance in a parallel or
5136 asynchronous interactive environment. Minor INCOMPATIBILITY.
5138 * Use of cumulative prems via "!" in some proof methods has been
5139 discontinued (old legacy feature).
5141 * References 'trace_simp' and 'debug_simp' have been replaced by
5142 configuration options stored in the context. Enabling tracing (the
5143 case of debugging is similar) in proofs works via
5145 using [[trace_simp = true]]
5147 Tracing is then active for all invocations of the simplifier in
5148 subsequent goal refinement steps. Tracing may also still be enabled or
5149 disabled via the ProofGeneral settings menu.
5151 * Separate commands 'hide_class', 'hide_type', 'hide_const',
5152 'hide_fact' replace the former 'hide' KIND command. Minor
5155 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
5156 more efficient than combinations with -q1 or -q2.
5161 * Proofterms record type-class reasoning explicitly, using the
5162 "unconstrain" operation internally. This eliminates all sort
5163 constraints from a theorem and proof, introducing explicit
5164 OFCLASS-premises. On the proof term level, this operation is
5165 automatically applied at theorem boundaries, such that closed proofs
5166 are always free of sort constraints. INCOMPATIBILITY for tools that
5167 inspect proof terms.
5169 * Local theory specifications may depend on extra type variables that
5170 are not present in the result type -- arguments TYPE('a) :: 'a itself
5171 are added internally. For example:
5173 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
5175 * Predicates of locales introduced by classes carry a mandatory
5176 "class" prefix. INCOMPATIBILITY.
5178 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
5180 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
5183 * Command 'code_reflect' allows to incorporate generated ML code into
5184 runtime environment; replaces immature code_datatype antiquotation.
5187 * Code generator: simple concept for abstract datatypes obeying
5190 * Code generator: details of internal data cache have no impact on the
5191 user space functionality any longer.
5193 * Methods "unfold_locales" and "intro_locales" ignore non-locale
5194 subgoals. This is more appropriate for interpretations with 'where'.
5197 * Command 'example_proof' opens an empty proof body. This allows to
5198 experiment with Isar, without producing any persistent result.
5200 * Commands 'type_notation' and 'no_type_notation' declare type syntax
5201 within a local theory context, with explicit checking of the
5202 constructors involved (in contrast to the raw 'syntax' versions).
5204 * Commands 'types' and 'typedecl' now work within a local theory
5205 context -- without introducing dependencies on parameters or
5206 assumptions, which is not possible in Isabelle/Pure.
5208 * Command 'defaultsort' has been renamed to 'default_sort', it works
5209 within a local theory context. Minor INCOMPATIBILITY.
5214 * Command 'typedef' now works within a local theory context -- without
5215 introducing dependencies on parameters or assumptions, which is not
5216 possible in Isabelle/Pure/HOL. Note that the logical environment may
5217 contain multiple interpretations of local typedefs (with different
5218 non-emptiness proofs), even in a global theory context.
5220 * New package for quotient types. Commands 'quotient_type' and
5221 'quotient_definition' may be used for defining types and constants by
5222 quotient constructions. An example is the type of integers created by
5223 quotienting pairs of natural numbers:
5226 intrel :: "(nat * nat) => (nat * nat) => bool"
5228 "intrel (x, y) (u, v) = (x + v = u + y)"
5230 quotient_type int = "nat * nat" / intrel
5231 by (auto simp add: equivp_def expand_fun_eq)
5234 "0::int" is "(0::nat, 0::nat)"
5236 The method "lifting" can be used to lift of theorems from the
5237 underlying "raw" type to the quotient type. The example
5238 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
5239 construction and provides a reasoning infrastructure for finite sets.
5241 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
5242 clash with new theory Quotient in Main HOL.
5244 * Moved the SMT binding into the main HOL session, eliminating
5245 separate HOL-SMT session.
5247 * List membership infix mem operation is only an input abbreviation.
5250 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
5251 for future developements; former Library/Word.thy is still present in
5252 the AFP entry RSAPPS.
5254 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
5255 longer shadowed. INCOMPATIBILITY.
5257 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
5260 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
5263 * Dropped normalizing_semiring etc; use the facts in semiring classes
5264 instead. INCOMPATIBILITY.
5266 * Dropped several real-specific versions of lemmas about floor and
5267 ceiling; use the generic lemmas from theory "Archimedean_Field"
5268 instead. INCOMPATIBILITY.
5270 floor_number_of_eq ~> floor_number_of
5271 le_floor_eq_number_of ~> number_of_le_floor
5272 le_floor_eq_zero ~> zero_le_floor
5273 le_floor_eq_one ~> one_le_floor
5274 floor_less_eq_number_of ~> floor_less_number_of
5275 floor_less_eq_zero ~> floor_less_zero
5276 floor_less_eq_one ~> floor_less_one
5277 less_floor_eq_number_of ~> number_of_less_floor
5278 less_floor_eq_zero ~> zero_less_floor
5279 less_floor_eq_one ~> one_less_floor
5280 floor_le_eq_number_of ~> floor_le_number_of
5281 floor_le_eq_zero ~> floor_le_zero
5282 floor_le_eq_one ~> floor_le_one
5283 floor_subtract_number_of ~> floor_diff_number_of
5284 floor_subtract_one ~> floor_diff_one
5285 ceiling_number_of_eq ~> ceiling_number_of
5286 ceiling_le_eq_number_of ~> ceiling_le_number_of
5287 ceiling_le_zero_eq ~> ceiling_le_zero
5288 ceiling_le_eq_one ~> ceiling_le_one
5289 less_ceiling_eq_number_of ~> number_of_less_ceiling
5290 less_ceiling_eq_zero ~> zero_less_ceiling
5291 less_ceiling_eq_one ~> one_less_ceiling
5292 ceiling_less_eq_number_of ~> ceiling_less_number_of
5293 ceiling_less_eq_zero ~> ceiling_less_zero
5294 ceiling_less_eq_one ~> ceiling_less_one
5295 le_ceiling_eq_number_of ~> number_of_le_ceiling
5296 le_ceiling_eq_zero ~> zero_le_ceiling
5297 le_ceiling_eq_one ~> one_le_ceiling
5298 ceiling_subtract_number_of ~> ceiling_diff_number_of
5299 ceiling_subtract_one ~> ceiling_diff_one
5301 * Theory "Finite_Set": various folding_XXX locales facilitate the
5302 application of the various fold combinators on finite sets.
5304 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
5305 provides abstract red-black tree type which is backed by "RBT_Impl" as
5306 implementation. INCOMPATIBILITY.
5308 * Theory Library/Coinductive_List has been removed -- superseded by
5309 AFP/thys/Coinductive.
5311 * Theory PReal, including the type "preal" and related operations, has
5312 been removed. INCOMPATIBILITY.
5314 * Real: new development using Cauchy Sequences.
5316 * Split off theory "Big_Operators" containing setsum, setprod,
5317 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
5319 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
5320 "Int" etc. INCOMPATIBILITY.
5322 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
5324 * New set of rules "ac_simps" provides combined assoc / commute
5325 rewrites for all interpretations of the appropriate generic locales.
5327 * Renamed theory "OrderedGroup" to "Groups" and split theory
5328 "Ring_and_Field" into theories "Rings" and "Fields"; for more
5329 appropriate and more consistent names suitable for name prefixes
5330 within the HOL theories. INCOMPATIBILITY.
5332 * Some generic constants have been put to appropriate theories:
5333 - less_eq, less: Orderings
5334 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
5335 - inverse, divide: Rings
5338 * More consistent naming of type classes involving orderings (and
5341 lower_semilattice ~> semilattice_inf
5342 upper_semilattice ~> semilattice_sup
5344 dense_linear_order ~> dense_linorder
5346 pordered_ab_group_add ~> ordered_ab_group_add
5347 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
5348 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
5349 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
5350 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
5351 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
5352 pordered_cancel_semiring ~> ordered_cancel_semiring
5353 pordered_comm_monoid_add ~> ordered_comm_monoid_add
5354 pordered_comm_ring ~> ordered_comm_ring
5355 pordered_comm_semiring ~> ordered_comm_semiring
5356 pordered_ring ~> ordered_ring
5357 pordered_ring_abs ~> ordered_ring_abs
5358 pordered_semiring ~> ordered_semiring
5360 ordered_ab_group_add ~> linordered_ab_group_add
5361 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
5362 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
5363 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
5364 ordered_field ~> linordered_field
5365 ordered_field_no_lb ~> linordered_field_no_lb
5366 ordered_field_no_ub ~> linordered_field_no_ub
5367 ordered_field_dense_linear_order ~> dense_linordered_field
5368 ordered_idom ~> linordered_idom
5369 ordered_ring ~> linordered_ring
5370 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
5371 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
5372 ordered_ring_strict ~> linordered_ring_strict
5373 ordered_semidom ~> linordered_semidom
5374 ordered_semiring ~> linordered_semiring
5375 ordered_semiring_1 ~> linordered_semiring_1
5376 ordered_semiring_1_strict ~> linordered_semiring_1_strict
5377 ordered_semiring_strict ~> linordered_semiring_strict
5379 The following slightly odd type classes have been moved to a
5380 separate theory Library/Lattice_Algebras:
5382 lordered_ab_group_add ~> lattice_ab_group_add
5383 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
5384 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
5385 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
5386 lordered_ring ~> lattice_ring
5390 * Refined field classes:
5391 - classes division_ring_inverse_zero, field_inverse_zero,
5392 linordered_field_inverse_zero include rule inverse 0 = 0 --
5393 subsumes former division_by_zero class;
5394 - numerous lemmas have been ported from field to division_ring.
5397 * Refined algebra theorem collections:
5398 - dropped theorem group group_simps, use algebra_simps instead;
5399 - dropped theorem group ring_simps, use field_simps instead;
5400 - proper theorem collection field_simps subsumes former theorem
5401 groups field_eq_simps and field_simps;
5402 - dropped lemma eq_minus_self_iff which is a duplicate for
5406 * Theory Finite_Set and List: some lemmas have been generalized from
5409 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
5410 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
5411 inter_Inter_fold_inter ~> inf_Inf_fold_inf
5412 union_Union_fold_union ~> sup_Sup_fold_sup
5413 Inter_fold_inter ~> Inf_fold_inf
5414 Union_fold_union ~> Sup_fold_sup
5415 inter_INTER_fold_inter ~> inf_INFI_fold_inf
5416 union_UNION_fold_union ~> sup_SUPR_fold_sup
5417 INTER_fold_inter ~> INFI_fold_inf
5418 UNION_fold_union ~> SUPR_fold_sup
5420 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
5421 replaced by the more convenient lemmas Inf_empty and Sup_empty.
5422 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
5423 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
5424 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
5425 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
5427 * Reorganized theory Multiset: swapped notation of pointwise and
5430 - pointwise ordering is instance of class order with standard syntax
5432 - multiset ordering has syntax <=# and <#; partial order properties
5433 are provided by means of interpretation with prefix
5435 - less duplication, less historical organization of sections,
5436 conversion from associations lists to multisets, rudimentary code
5438 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
5443 multiset_eq_conv_count_eq ~> multiset_ext_iff
5444 multi_count_ext ~> multiset_ext
5445 diff_union_inverse2 ~> diff_union_cancelR
5449 * Theory Permutation: replaced local "remove" by List.remove1.
5451 * Code generation: ML and OCaml code is decorated with signatures.
5453 * Theory List: added transpose.
5455 * Library/Nat_Bijection.thy is a collection of bijective functions
5456 between nat and other types, which supersedes the older libraries
5457 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
5460 Nat_Int_Bij.nat2_to_nat ~> prod_encode
5461 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
5462 Nat_Int_Bij.int_to_nat_bij ~> int_encode
5463 Nat_Int_Bij.nat_to_int_bij ~> int_decode
5464 Countable.pair_encode ~> prod_encode
5465 NatIso.prod2nat ~> prod_encode
5466 NatIso.nat2prod ~> prod_decode
5467 NatIso.sum2nat ~> sum_encode
5468 NatIso.nat2sum ~> sum_decode
5469 NatIso.list2nat ~> list_encode
5470 NatIso.nat2list ~> list_decode
5471 NatIso.set2nat ~> set_encode
5472 NatIso.nat2set ~> set_decode
5475 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
5476 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
5477 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
5478 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
5479 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
5480 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
5481 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
5482 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
5483 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
5484 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
5485 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
5486 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
5487 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
5490 - Renamed ATP commands:
5491 atp_info ~> sledgehammer running_atps
5492 atp_kill ~> sledgehammer kill_atps
5493 atp_messages ~> sledgehammer messages
5494 atp_minimize ~> sledgehammer minimize
5495 print_atps ~> sledgehammer available_atps
5497 - Added user's manual ("isabelle doc sledgehammer").
5498 - Added option syntax and "sledgehammer_params" to customize
5499 Sledgehammer's behavior. See the manual for details.
5500 - Modified the Isar proof reconstruction code so that it produces
5501 direct proofs rather than proofs by contradiction. (This feature
5502 is still experimental.)
5503 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
5505 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
5508 - Added and implemented "binary_ints" and "bits" options.
5509 - Added "std" option and implemented support for nonstandard models.
5510 - Added and implemented "finitize" option to improve the precision
5511 of infinite datatypes based on a monotonicity analysis.
5512 - Added support for quotient types.
5513 - Added support for "specification" and "ax_specification"
5515 - Added support for local definitions (for "function" and
5516 "termination" proofs).
5517 - Added support for term postprocessors.
5518 - Optimized "Multiset.multiset" and "FinFun.finfun".
5519 - Improved efficiency of "destroy_constrs" optimization.
5520 - Fixed soundness bugs related to "destroy_constrs" optimization and
5522 - Fixed soundness bug related to higher-order constructors.
5523 - Fixed soundness bug when "full_descrs" is enabled.
5524 - Improved precision of set constructs.
5525 - Added "atoms" option.
5526 - Added cache to speed up repeated Kodkod invocations on the same
5528 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
5529 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
5530 "SAT4J_Light". INCOMPATIBILITY.
5531 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
5532 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
5533 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
5535 * Method "induct" now takes instantiations of the form t, where t is not
5536 a variable, as a shorthand for "x == t", where x is a fresh variable.
5537 If this is not intended, t has to be enclosed in parentheses.
5538 By default, the equalities generated by definitional instantiations
5539 are pre-simplified, which may cause parameters of inductive cases
5540 to disappear, or may even delete some of the inductive cases.
5541 Use "induct (no_simp)" instead of "induct" to restore the old
5542 behaviour. The (no_simp) option is also understood by the "cases"
5543 and "nominal_induct" methods, which now perform pre-simplification, too.
5549 * Variable names in lemmas generated by the domain package have
5550 changed; the naming scheme is now consistent with the HOL datatype
5551 package. Some proof scripts may be affected, INCOMPATIBILITY.
5553 * The domain package no longer defines the function "foo_copy" for
5554 recursive domain "foo". The reach lemma is now stated directly in
5555 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
5556 be reformulated in terms of "foo_take", INCOMPATIBILITY.
5558 * Most definedness lemmas generated by the domain package (previously
5559 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
5560 like "foo$x = UU <-> x = UU", which works better as a simp rule.
5561 Proofs that used definedness lemmas as intro rules may break,
5562 potential INCOMPATIBILITY.
5564 * Induction and casedist rules generated by the domain package now
5565 declare proper case_names (one called "bottom", and one named for each
5566 constructor). INCOMPATIBILITY.
5568 * For mutually-recursive domains, separate "reach" and "take_lemma"
5569 rules are generated for each domain, INCOMPATIBILITY.
5571 foo_bar.reach ~> foo.reach bar.reach
5572 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
5574 * Some lemmas generated by the domain package have been renamed for
5575 consistency with the datatype package, INCOMPATIBILITY.
5577 foo.ind ~> foo.induct
5578 foo.finite_ind ~> foo.finite_induct
5579 foo.coind ~> foo.coinduct
5580 foo.casedist ~> foo.exhaust
5581 foo.exhaust ~> foo.nchotomy
5583 * For consistency with other definition packages, the fixrec package
5584 now generates qualified theorem names, INCOMPATIBILITY.
5586 foo_simps ~> foo.simps
5587 foo_unfold ~> foo.unfold
5588 foo_induct ~> foo.induct
5590 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
5591 method and internal fixrec proofs now use the default simpset instead.
5594 * The "contlub" predicate has been removed. Proof scripts should use
5595 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
5597 * The "admw" predicate has been removed, INCOMPATIBILITY.
5599 * The constants cpair, cfst, and csnd have been removed in favor of
5600 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
5605 * Antiquotations for basic formal entities:
5607 @{class NAME} -- type class
5608 @{class_syntax NAME} -- syntax representation of the above
5610 @{type_name NAME} -- logical type
5611 @{type_abbrev NAME} -- type abbreviation
5612 @{nonterminal NAME} -- type of concrete syntactic category
5613 @{type_syntax NAME} -- syntax representation of any of the above
5615 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
5616 @{const_abbrev NAME} -- abbreviated constant
5617 @{const_syntax NAME} -- syntax representation of any of the above
5619 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
5620 syntax constant (cf. 'syntax' command).
5622 * Antiquotation @{make_string} inlines a function to print arbitrary
5623 values similar to the ML toplevel. The result is compiler dependent
5624 and may fall back on "?" in certain situations.
5626 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
5627 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
5628 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
5629 not work with the asynchronous Isar document model.
5631 * Configuration options now admit dynamic default values, depending on
5632 the context or even global references.
5634 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
5635 uses an efficient external library if available (for Poly/ML).
5637 * Renamed some important ML structures, while keeping the old names
5638 for some time as aliases within the structure Legacy:
5640 OuterKeyword ~> Keyword
5643 OuterSyntax ~> Outer_Syntax
5644 PrintMode ~> Print_Mode
5645 SpecParse ~> Parse_Spec
5648 ThyOutput ~> Thy_Output
5649 TypeInfer ~> Type_Infer
5651 Note that "open Legacy" simplifies porting of sources, but forgetting
5652 to remove it again will complicate porting again in the future.
5654 * Most operations that refer to a global context are named
5655 accordingly, e.g. Simplifier.global_context or
5656 ProofContext.init_global. There are some situations where a global
5657 context actually works, but under normal circumstances one needs to
5658 pass the proper local context through the code!
5660 * Discontinued old TheoryDataFun with its copy/init operation -- data
5661 needs to be pure. Functor Theory_Data_PP retains the traditional
5662 Pretty.pp argument to merge, which is absent in the standard
5663 Theory_Data version.
5665 * Sorts.certify_sort and derived "cert" operations for types and terms
5666 no longer minimize sorts. Thus certification at the boundary of the
5667 inference kernel becomes invariant under addition of class relations,
5668 which is an important monotonicity principle. Sorts are now minimized
5669 in the syntax layer only, at the boundary between the end-user and the
5670 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
5671 explicitly in rare situations.
5673 * Renamed old-style Drule.standard to Drule.export_without_context, to
5674 emphasize that this is in no way a standard operation.
5677 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
5678 usual for resolution. Rare INCOMPATIBILITY.
5680 * Renamed varify/unvarify operations to varify_global/unvarify_global
5681 to emphasize that these only work in a global situation (which is
5684 * Curried take and drop in library.ML; negative length is interpreted
5685 as infinity (as in chop). Subtle INCOMPATIBILITY.
5687 * Proof terms: type substitutions on proof constants now use canonical
5688 order of type variables. INCOMPATIBILITY for tools working with proof
5691 * Raw axioms/defs may no longer carry sort constraints, and raw defs
5692 may no longer carry premises. User-level specifications are
5693 transformed accordingly by Thm.add_axiom/add_def.
5698 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
5699 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
5700 proof terms are enabled unconditionally in the new HOL-Proofs image.
5702 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
5703 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
5706 * Old lib/scripts/polyml-platform is superseded by the
5707 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
5708 variant, even on a 64 bit machine. The following example setting
5709 prefers 64 bit if available:
5711 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
5713 * The preliminary Isabelle/jEdit application demonstrates the emerging
5714 Isabelle/Scala layer for advanced prover interaction and integration.
5715 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
5718 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
5719 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
5720 similar to the default assignment of the document preparation system
5721 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
5722 provides some operations for direct access to the font without asking
5723 the user for manual installation.
5727 New in Isabelle2009-1 (December 2009)
5728 -------------------------------------
5732 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
5733 one backslash should be used, even in ML sources.
5738 * Locale interpretation propagates mixins along the locale hierarchy.
5739 The currently only available mixins are the equations used to map
5740 local definitions to terms of the target domain of an interpretation.
5742 * Reactivated diagnostic command 'print_interps'. Use "print_interps
5743 loc" to print all interpretations of locale "loc" in the theory.
5744 Interpretations in proofs are not shown.
5746 * Thoroughly revised locales tutorial. New section on conditional
5749 * On instantiation of classes, remaining undefined class parameters
5750 are formally declared. INCOMPATIBILITY.
5753 *** Document preparation ***
5755 * New generalized style concept for printing terms: @{foo (style) ...}
5756 instead of @{foo_style style ...} (old form is still retained for
5757 backward compatibility). Styles can be also applied for
5758 antiquotations prop, term_type and typeof.
5763 * New proof method "smt" for a combination of first-order logic with
5764 equality, linear and nonlinear (natural/integer/real) arithmetic, and
5765 fixed-size bitvectors; there is also basic support for higher-order
5766 features (esp. lambda abstractions). It is an incomplete decision
5767 procedure based on external SMT solvers using the oracle mechanism;
5768 for the SMT solver Z3, this method is proof-producing. Certificates
5769 are provided to avoid calling the external solvers solely for
5770 re-checking proofs. Due to a remote SMT service there is no need for
5771 installing SMT solvers locally. See src/HOL/SMT.
5773 * New commands to load and prove verification conditions generated by
5774 the Boogie program verifier or derived systems (e.g. the Verifying C
5775 Compiler (VCC) or Spec#). See src/HOL/Boogie.
5777 * New counterexample generator tool 'nitpick' based on the Kodkod
5778 relational model finder. See src/HOL/Tools/Nitpick and
5779 src/HOL/Nitpick_Examples.
5781 * New commands 'code_pred' and 'values' to invoke the predicate
5782 compiler and to enumerate values of inductive predicates.
5784 * A tabled implementation of the reflexive transitive closure.
5786 * New implementation of quickcheck uses generic code generator;
5787 default generators are provided for all suitable HOL types, records
5788 and datatypes. Old quickcheck can be re-activated importing theory
5789 Library/SML_Quickcheck.
5791 * New testing tool Mirabelle for automated proof tools. Applies
5792 several tools and tactics like sledgehammer, metis, or quickcheck, to
5793 every proof step in a theory. To be used in batch mode via the
5794 "mirabelle" utility.
5796 * New proof method "sos" (sum of squares) for nonlinear real
5797 arithmetic (originally due to John Harison). It requires theory
5798 Library/Sum_Of_Squares. It is not a complete decision procedure but
5799 works well in practice on quantifier-free real arithmetic with +, -,
5800 *, ^, =, <= and <, i.e. boolean combinations of equalities and
5801 inequalities between polynomials. It makes use of external
5802 semidefinite programming solvers. Method "sos" generates a
5803 certificate that can be pasted into the proof thus avoiding the need
5804 to call an external tool every time the proof is checked. See
5805 src/HOL/Library/Sum_Of_Squares.
5807 * New method "linarith" invokes existing linear arithmetic decision
5810 * New command 'atp_minimal' reduces result produced by Sledgehammer.
5812 * New Sledgehammer option "Full Types" in Proof General settings menu.
5813 Causes full type information to be output to the ATPs. This slows
5814 ATPs down considerably but eliminates a source of unsound "proofs"
5817 * New method "metisFT": A version of metis that uses full type
5818 information in order to avoid failures of proof reconstruction.
5820 * New evaluator "approximate" approximates an real valued term using
5821 the same method as the approximation method.
5823 * Method "approximate" now supports arithmetic expressions as
5824 boundaries of intervals and implements interval splitting and Taylor
5827 * ML antiquotation @{code_datatype} inserts definition of a datatype
5828 generated by the code generator; e.g. see src/HOL/Predicate.thy.
5830 * New theory SupInf of the supremum and infimum operators for sets of
5833 * New theory Probability, which contains a development of measure
5834 theory, eventually leading to Lebesgue integration and probability.
5836 * Extended Multivariate Analysis to include derivation and Brouwer's
5839 * Reorganization of number theory, INCOMPATIBILITY:
5840 - new number theory development for nat and int, in theories Divides
5841 and GCD as well as in new session Number_Theory
5842 - some constants and facts now suffixed with _nat and _int
5844 - former session NumberTheory now named Old_Number_Theory, including
5845 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
5846 - moved theory Pocklington from src/HOL/Library to
5847 src/HOL/Old_Number_Theory
5849 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
5850 lcm of finite and infinite sets. It is shown that they form a complete
5853 * Class semiring_div requires superclass no_zero_divisors and proof of
5854 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
5855 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
5856 generalized to class semiring_div, subsuming former theorems
5857 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
5858 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
5861 * Refinements to lattice classes and sets:
5862 - less default intro/elim rules in locale variant, more default
5863 intro/elim rules in class variant: more uniformity
5864 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
5866 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
5868 - renamed ACI to inf_sup_aci
5869 - new class "boolean_algebra"
5870 - class "complete_lattice" moved to separate theory
5871 "Complete_Lattice"; corresponding constants (and abbreviations)
5872 renamed and with authentic syntax:
5873 Set.Inf ~> Complete_Lattice.Inf
5874 Set.Sup ~> Complete_Lattice.Sup
5875 Set.INFI ~> Complete_Lattice.INFI
5876 Set.SUPR ~> Complete_Lattice.SUPR
5877 Set.Inter ~> Complete_Lattice.Inter
5878 Set.Union ~> Complete_Lattice.Union
5879 Set.INTER ~> Complete_Lattice.INTER
5880 Set.UNION ~> Complete_Lattice.UNION
5881 - authentic syntax for
5884 - mere abbreviations:
5887 Set.inter (for inf, formerly Set.Int)
5888 Set.union (for sup, formerly Set.Un)
5889 Complete_Lattice.Inter (for Inf)
5890 Complete_Lattice.Union (for Sup)
5891 Complete_Lattice.INTER (for INFI)
5892 Complete_Lattice.UNION (for SUPR)
5893 - object-logic definitions as far as appropriate
5895 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
5896 Un_subset_iff are explicitly deleted as default simp rules; then also
5897 their lattice counterparts le_inf_iff and le_sup_iff have to be
5898 deleted to achieve the desired effect.
5900 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
5901 rules by default any longer; the same applies to min_max.inf_absorb1
5902 etc. INCOMPATIBILITY.
5904 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
5905 pred_set_conv by default. INCOMPATIBILITY.
5907 * Power operations on relations and functions are now one dedicated
5908 constant "compow" with infix syntax "^^". Power operation on
5909 multiplicative monoids retains syntax "^" and is now defined generic
5910 in class power. INCOMPATIBILITY.
5912 * Relation composition "R O S" now has a more standard argument order:
5913 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
5914 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
5915 break, since the O_assoc rule was not rewritten like this. Fix using
5916 O_assoc[symmetric]. The same applies to the curried version "R OO S".
5918 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
5919 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
5922 * Most rules produced by inductive and datatype package have mandatory
5923 prefixes. INCOMPATIBILITY.
5925 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
5926 the attribute of the same name. Each of the theorems in the list
5927 DERIV_intros assumes composition with an additional function and
5928 matches a variable to the derivative, which has to be solved by the
5929 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
5930 of most elementary terms. Former Maclauren.DERIV_tac and
5931 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
5934 * Code generator attributes follow the usual underscore convention:
5935 code_unfold replaces code unfold
5936 code_post replaces code post
5941 sizechange -> size_change
5942 induct_scheme -> induction_schema
5945 * Discontinued abbreviation "arbitrary" of constant "undefined".
5946 INCOMPATIBILITY, use "undefined" directly.
5949 Suc_eq_add_numeral_1 -> Suc_eq_plus1
5950 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
5951 Suc_plus1 -> Suc_eq_plus1
5952 *anti_sym -> *antisym*
5953 vector_less_eq_def -> vector_le_def
5956 * Added theorem List.map_map as [simp]. Removed List.map_compose.
5959 * Removed predicate "M hassize n" (<--> card M = n & finite M).
5965 * Theory Representable defines a class "rep" of domains that are
5966 representable (via an ep-pair) in the universal domain type "udom".
5967 Instances are provided for all type constructors defined in HOLCF.
5969 * The 'new_domain' command is a purely definitional version of the
5970 domain package, for representable domains. Syntax is identical to the
5971 old domain package. The 'new_domain' package also supports indirect
5972 recursion using previously-defined type constructors. See
5973 src/HOLCF/ex/New_Domain.thy for examples.
5975 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
5976 on the left-hand side of an equation, and then performs
5977 simplification. Rewriting is done using rules declared with the
5978 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
5979 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
5981 * The pattern-match compiler in 'fixrec' can now handle constructors
5982 with HOL function types. Pattern-match combinators for the Pair
5983 constructor are pre-configured.
5985 * The 'fixrec' package now produces better fixed-point induction rules
5986 for mutually-recursive definitions: Induction rules have conclusions
5987 of the form "P foo bar" instead of "P <foo, bar>".
5989 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
5990 been renamed to "below". The name "below" now replaces "less" in many
5991 theorem names. (Legacy theorem names using "less" are still supported
5994 * The 'fixrec' package now supports "bottom patterns". Bottom
5995 patterns can be used to generate strictness rules, or to make
5996 functions more strict (much like the bang-patterns supported by the
5997 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
6003 * Support for Poly/ML 5.3.0, with improved reporting of compiler
6004 errors and run-time exceptions, including detailed source positions.
6006 * Structure Name_Space (formerly NameSpace) now manages uniquely
6007 identified entries, with some additional information such as source
6008 position, logical grouping etc.
6010 * Theory and context data is now introduced by the simplified and
6011 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
6012 to be pure, but the old TheoryDataFun for mutable data (with explicit
6013 copy operation) is still available for some time.
6015 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
6016 provides a high-level programming interface to synchronized state
6017 variables with atomic update. This works via pure function
6018 application within a critical section -- its runtime should be as
6019 short as possible; beware of deadlocks if critical code is nested,
6020 either directly or indirectly via other synchronized variables!
6022 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
6023 wraps raw ML references, explicitly indicating their non-thread-safe
6024 behaviour. The Isar toplevel keeps this structure open, to
6025 accommodate Proof General as well as quick and dirty interactive
6026 experiments with references.
6028 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
6029 parallel tactical reasoning.
6031 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
6032 are similar to SUBPROOF, but are slightly more flexible: only the
6033 specified parts of the subgoal are imported into the context, and the
6034 body tactic may introduce new subgoals and schematic variables.
6036 * Old tactical METAHYPS, which does not observe the proof context, has
6037 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
6038 or Subgoal.FOCUS etc.
6040 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
6041 functors have their own ML name space there is no point to mark them
6042 separately.) Minor INCOMPATIBILITY.
6044 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
6046 * Renamed several structures FooBar to Foo_Bar. Occasional,
6049 * Operations of structure Skip_Proof no longer require quick_and_dirty
6050 mode, which avoids critical setmp.
6052 * Eliminated old Attrib.add_attributes, Method.add_methods and related
6053 combinators for "args". INCOMPATIBILITY, need to use simplified
6054 Attrib/Method.setup introduced in Isabelle2009.
6056 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
6057 back on global_simpset_of, global_claset_of, global_clasimpset_of as
6058 last resort. INCOMPATIBILITY.
6060 * Display.pretty_thm now requires a proper context (cf. former
6061 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
6062 or even Display.pretty_thm_without_context as last resort.
6065 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
6066 Syntax.pretty_typ/term directly, preferably with proper context
6067 instead of global theory.
6072 * Further fine tuning of parallel proof checking, scales up to 8 cores
6073 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
6076 * Support for additional "Isabelle components" via etc/components, see
6077 also the system manual.
6079 * The isabelle makeall tool now operates on all components with
6080 IsaMakefile, not just hardwired "logics".
6082 * Removed "compress" option from isabelle-process and isabelle usedir;
6083 this is always enabled.
6085 * Discontinued support for Poly/ML 4.x versions.
6087 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
6088 on a given logic image. This requires the lighttpd webserver and is
6089 currently supported on Linux only.
6093 New in Isabelle2009 (April 2009)
6094 --------------------------------
6098 * Simplified main Isabelle executables, with less surprises on
6099 case-insensitive file-systems (such as Mac OS).
6101 - The main Isabelle tool wrapper is now called "isabelle" instead of
6104 - The former "isabelle" alias for "isabelle-process" has been
6105 removed (should rarely occur to regular users).
6107 - The former "isabelle-interface" and its alias "Isabelle" have been
6108 removed (interfaces are now regular Isabelle tools).
6110 Within scripts and make files, the Isabelle environment variables
6111 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
6112 respectively. (The latter are still available as legacy feature.)
6114 The old isabelle-interface wrapper could react in confusing ways if
6115 the interface was uninstalled or changed otherwise. Individual
6116 interface tool configuration is now more explicit, see also the
6117 Isabelle system manual. In particular, Proof General is now available
6118 via "isabelle emacs".
6120 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
6121 purge installed copies of Isabelle executables and re-run "isabelle
6122 install -p ...", or use symlinks.
6124 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
6125 old ~/isabelle, which was slightly non-standard and apt to cause
6126 surprises on case-insensitive file-systems (such as Mac OS).
6128 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
6129 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
6130 care is required when using older releases of Isabelle. Note that
6131 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
6132 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
6134 * Proofs of fully specified statements are run in parallel on
6135 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
6136 a regular 4-core machine, if the initial heap space is made reasonably
6137 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
6139 * The main reference manuals ("isar-ref", "implementation", and
6140 "system") have been updated and extended. Formally checked references
6141 as hyperlinks are now available uniformly.
6146 * Complete re-implementation of locales. INCOMPATIBILITY in several
6147 respects. The most important changes are listed below. See the
6148 Tutorial on Locales ("locales" manual) for details.
6150 - In locale expressions, instantiation replaces renaming. Parameters
6151 must be declared in a for clause. To aid compatibility with previous
6152 parameter inheritance, in locale declarations, parameters that are not
6153 'touched' (instantiation position "_" or omitted) are implicitly added
6154 with their syntax at the beginning of the for clause.
6156 - Syntax from abbreviations and definitions in locales is available in
6157 locale expressions and context elements. The latter is particularly
6158 useful in locale declarations.
6160 - More flexible mechanisms to qualify names generated by locale
6161 expressions. Qualifiers (prefixes) may be specified in locale
6162 expressions, and can be marked as mandatory (syntax: "name!:") or
6163 optional (syntax "name?:"). The default depends for plain "name:"
6164 depends on the situation where a locale expression is used: in
6165 commands 'locale' and 'sublocale' prefixes are optional, in
6166 'interpretation' and 'interpret' prefixes are mandatory. The old
6167 implicit qualifiers derived from the parameter names of a locale are
6168 no longer generated.
6170 - Command "sublocale l < e" replaces "interpretation l < e". The
6171 instantiation clause in "interpretation" and "interpret" (square
6172 brackets) is no longer available. Use locale expressions.
6174 - When converting proof scripts, mandatory qualifiers in
6175 'interpretation' and 'interpret' should be retained by default, even
6176 if this is an INCOMPATIBILITY compared to former behavior. In the
6177 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
6178 in locale expressions range over a single locale instance only.
6180 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
6181 In existing theorem specifications replace the includes element by the
6182 respective context elements of the included locale, omitting those
6183 that are already present in the theorem specification. Multiple
6184 assume elements of a locale should be replaced by a single one
6185 involving the locale predicate. In the proof body, declarations (most
6186 notably theorems) may be regained by interpreting the respective
6187 locales in the proof context as required (command "interpret").
6189 If using "includes" in replacement of a target solely because the
6190 parameter types in the theorem are not as general as in the target,
6191 consider declaring a new locale with additional type constraints on
6192 the parameters (context element "constrains").
6194 - Discontinued "locale (open)". INCOMPATIBILITY.
6196 - Locale interpretation commands no longer attempt to simplify goal.
6197 INCOMPATIBILITY: in rare situations the generated goal differs. Use
6198 methods intro_locales and unfold_locales to clarify.
6200 - Locale interpretation commands no longer accept interpretation
6201 attributes. INCOMPATIBILITY.
6203 * Class declaration: so-called "base sort" must not be given in import
6204 list any longer, but is inferred from the specification. Particularly
6211 class foo = type + ...
6213 * Class target: global versions of theorems stemming do not carry a
6214 parameter prefix any longer. INCOMPATIBILITY.
6216 * Class 'instance' command no longer accepts attached definitions.
6217 INCOMPATIBILITY, use proper 'instantiation' target instead.
6219 * Recovered hiding of consts, which was accidentally broken in
6220 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
6221 makes c inaccessible; consider using ``hide (open) const c'' instead.
6223 * Slightly more coherent Pure syntax, with updated documentation in
6224 isar-ref manual. Removed locales meta_term_syntax and
6225 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
6226 INCOMPATIBILITY in rare situations. Note that &&& should not be used
6227 directly in regular applications.
6229 * There is a new syntactic category "float_const" for signed decimal
6230 fractions (e.g. 123.45 or -123.45).
6232 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
6233 interface with 'setup' command instead.
6235 * Command 'local_setup' is similar to 'setup', but operates on a local
6238 * The 'axiomatization' command now only works within a global theory
6239 context. INCOMPATIBILITY.
6241 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
6242 hypotheses. Sorts required in the course of reasoning need to be
6243 covered by the constraints in the initial statement, completed by the
6244 type instance information of the background theory. Non-trivial sort
6245 hypotheses, which rarely occur in practice, may be specified via
6246 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
6248 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
6250 The result contains an implicit sort hypotheses as before --
6251 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
6254 * Generalized Isar history, with support for linear undo, direct state
6257 * Changed defaults for unify configuration options:
6259 unify_trace_bound = 50 (formerly 25)
6260 unify_search_bound = 60 (formerly 30)
6262 * Different bookkeeping for code equations (INCOMPATIBILITY):
6264 a) On theory merge, the last set of code equations for a particular
6265 constant is taken (in accordance with the policy applied by other
6266 parts of the code generator framework).
6268 b) Code equations stemming from explicit declarations (e.g. code
6269 attribute) gain priority over default code equations stemming
6270 from definition, primrec, fun etc.
6272 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
6274 * Unified theorem tables for both code generators. Thus [code
6275 func] has disappeared and only [code] remains. INCOMPATIBILITY.
6277 * Command 'find_consts' searches for constants based on type and name
6280 find_consts "_ => bool"
6282 By default, matching is against subtypes, but it may be restricted to
6283 the whole type. Searching by name is possible. Multiple queries are
6284 conjunctive and queries may be negated by prefixing them with a
6287 find_consts strict: "_ => bool" name: "Int" -"int => int"
6289 * New 'find_theorems' criterion "solves" matches theorems that
6290 directly solve the current goal (modulo higher-order unification).
6292 * Auto solve feature for main theorem statements: whenever a new goal
6293 is stated, "find_theorems solves" is called; any theorems that could
6294 solve the lemma directly are listed as part of the goal state.
6295 Cf. associated options in Proof General Isabelle settings menu,
6296 enabled by default, with reasonable timeout for pathological cases of
6297 higher-order unification.
6300 *** Document preparation ***
6302 * Antiquotation @{lemma} now imitates a regular terminal proof,
6303 demanding keyword 'by' and supporting the full method expression
6304 syntax just like the Isar command 'by'.
6309 * Integrated main parts of former image HOL-Complex with HOL. Entry
6310 points Main and Complex_Main remain as before.
6312 * Logic image HOL-Plain provides a minimal HOL with the most important
6313 tools available (inductive, datatype, primrec, ...). This facilitates
6314 experimentation and tool development. Note that user applications
6315 (and library theories) should never refer to anything below theory
6318 * Logic image HOL-Main stops at theory Main, and thus facilitates
6319 experimentation due to shorter build times.
6321 * Logic image HOL-NSA contains theories of nonstandard analysis which
6322 were previously part of former HOL-Complex. Entry point Hyperreal
6323 remains valid, but theories formerly using Complex_Main should now use
6324 new entry point Hypercomplex.
6326 * Generic ATP manager for Sledgehammer, based on ML threads instead of
6327 Posix processes. Avoids potentially expensive forking of the ML
6328 process. New thread-based implementation also works on non-Unix
6329 platforms (Cygwin). Provers are no longer hardwired, but defined
6330 within the theory via plain ML wrapper functions. Basic Sledgehammer
6331 commands are covered in the isar-ref manual.
6333 * Wrapper scripts for remote SystemOnTPTP service allows to use
6334 sledgehammer without local ATP installation (Vampire etc.). Other
6335 provers may be included via suitable ML wrappers, see also
6336 src/HOL/ATP_Linkup.thy.
6338 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
6341 * The metis method no longer fails because the theorem is too trivial
6342 (contains the empty clause).
6344 * The metis method now fails in the usual manner, rather than raising
6345 an exception, if it determines that it cannot prove the theorem.
6347 * Method "coherent" implements a prover for coherent logic (see also
6348 src/Tools/coherent.ML).
6350 * Constants "undefined" and "default" replace "arbitrary". Usually
6351 "undefined" is the right choice to replace "arbitrary", though
6352 logically there is no difference. INCOMPATIBILITY.
6354 * Command "value" now integrates different evaluation mechanisms. The
6355 result of the first successful evaluation mechanism is printed. In
6356 square brackets a particular named evaluation mechanisms may be
6357 specified (currently, [SML], [code] or [nbe]). See further
6358 src/HOL/ex/Eval_Examples.thy.
6360 * Normalization by evaluation now allows non-leftlinear equations.
6361 Declare with attribute [code nbe].
6363 * Methods "case_tac" and "induct_tac" now refer to the very same rules
6364 as the structured Isar versions "cases" and "induct", cf. the
6365 corresponding "cases" and "induct" attributes. Mutual induction rules
6366 are now presented as a list of individual projections
6367 (e.g. foo_bar.inducts for types foo and bar); the old format with
6368 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
6369 rare situations a different rule is selected --- notably nested tuple
6370 elimination instead of former prod.exhaust: use explicit (case_tac t
6371 rule: prod.exhaust) here.
6373 * Attributes "cases", "induct", "coinduct" support "del" option.
6375 * Removed fact "case_split_thm", which duplicates "case_split".
6377 * The option datatype has been moved to a new theory Option. Renamed
6378 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
6380 * New predicate "strict_mono" classifies strict functions on partial
6381 orders. With strict functions on linear orders, reasoning about
6382 (in)equalities is facilitated by theorems "strict_mono_eq",
6383 "strict_mono_less_eq" and "strict_mono_less".
6385 * Some set operations are now proper qualified constants with
6386 authentic syntax. INCOMPATIBILITY:
6397 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
6400 * Auxiliary class "itself" has disappeared -- classes without any
6401 parameter are treated as expected by the 'class' command.
6403 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
6405 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
6406 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
6408 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
6409 method "approximation". It proves formulas on real values by using
6410 interval arithmetic. In the formulas are also the transcendental
6411 functions sin, cos, tan, atan, ln, exp and the constant pi are
6412 allowed. For examples see
6413 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
6415 * Theory "Reflection" now resides in HOL/Library.
6417 * Entry point to Word library now simply named "Word".
6420 * Made source layout more coherent with logical distribution
6423 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
6424 src/HOL/Library/Code_Message.thy ~> src/HOL/
6425 src/HOL/Library/GCD.thy ~> src/HOL/
6426 src/HOL/Library/Order_Relation.thy ~> src/HOL/
6427 src/HOL/Library/Parity.thy ~> src/HOL/
6428 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
6429 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
6430 src/HOL/Real/Lubs.thy ~> src/HOL/
6431 src/HOL/Real/PReal.thy ~> src/HOL/
6432 src/HOL/Real/Rational.thy ~> src/HOL/
6433 src/HOL/Real/RComplete.thy ~> src/HOL/
6434 src/HOL/Real/RealDef.thy ~> src/HOL/
6435 src/HOL/Real/RealPow.thy ~> src/HOL/
6436 src/HOL/Real/Real.thy ~> src/HOL/
6437 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
6438 src/HOL/Complex/Complex.thy ~> src/HOL/
6439 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
6440 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
6441 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
6442 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
6443 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
6444 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
6445 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
6446 src/HOL/Hyperreal/Log.thy ~> src/HOL/
6447 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
6448 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
6449 src/HOL/Hyperreal/Series.thy ~> src/HOL/
6450 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
6451 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
6452 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
6453 src/HOL/Real/Float ~> src/HOL/Library/
6454 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
6455 src/HOL/Real/RealVector.thy ~> src/HOL/
6457 src/HOL/arith_data.ML ~> src/HOL/Tools
6458 src/HOL/hologic.ML ~> src/HOL/Tools
6459 src/HOL/simpdata.ML ~> src/HOL/Tools
6460 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
6461 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
6462 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
6463 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
6464 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
6465 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
6466 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
6468 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
6469 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
6470 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
6471 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
6472 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
6473 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
6475 * If methods "eval" and "evaluation" encounter a structured proof
6476 state with !!/==>, only the conclusion is evaluated to True (if
6477 possible), avoiding strange error messages.
6479 * Method "sizechange" automates termination proofs using (a
6480 modification of) the size-change principle. Requires SAT solver. See
6481 src/HOL/ex/Termination.thy for examples.
6483 * Simplifier: simproc for let expressions now unfolds if bound
6484 variable occurs at most once in let expression body. INCOMPATIBILITY.
6486 * Method "arith": Linear arithmetic now ignores all inequalities when
6487 fast_arith_neq_limit is exceeded, instead of giving up entirely.
6489 * New attribute "arith" for facts that should always be used
6490 automatically by arithmetic. It is intended to be used locally in
6493 assumes [arith]: "x > 0"
6495 Global usage is discouraged because of possible performance impact.
6497 * New classes "top" and "bot" with corresponding operations "top" and
6498 "bot" in theory Orderings; instantiation of class "complete_lattice"
6499 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
6501 * Changed definition lemma "less_fun_def" in order to provide an
6502 instance for preorders on functions; use lemma "less_le" instead.
6505 * Theory Orderings: class "wellorder" moved here, with explicit
6506 induction rule "less_induct" as assumption. For instantiation of
6507 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
6510 * Theory Orderings: added class "preorder" as superclass of "order".
6511 INCOMPATIBILITY: Instantiation proofs for order, linorder
6512 etc. slightly changed. Some theorems named order_class.* now named
6515 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
6518 * Theory Finite_Set: added a new fold combinator of type
6520 ('a => 'b => 'b) => 'b => 'a set => 'b
6522 Occasionally this is more convenient than the old fold combinator
6523 which is now defined in terms of the new one and renamed to
6526 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
6527 and "ring_simps" have been replaced by "algebra_simps" (which can be
6528 extended with further lemmas!). At the moment both still exist but
6529 the former will disappear at some point.
6531 * Theory Power: Lemma power_Suc is now declared as a simp rule in
6532 class recpower. Type-specific simp rules for various recpower types
6533 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
6535 rat_power_0 -> power_0
6536 rat_power_Suc -> power_Suc
6537 realpow_0 -> power_0
6538 realpow_Suc -> power_Suc
6539 complexpow_0 -> power_0
6540 complexpow_Suc -> power_Suc
6541 power_poly_0 -> power_0
6542 power_poly_Suc -> power_Suc
6544 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
6545 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
6546 dvd has been generalized to class comm_semiring_1. Likewise a bunch
6547 of lemmas from Divides has been generalized from nat to class
6548 semiring_div. INCOMPATIBILITY. This involves the following theorem
6549 renames resulting from duplicate elimination:
6551 dvd_def_mod ~> dvd_eq_mod_eq_0
6552 zero_dvd_iff ~> dvd_0_left_iff
6553 dvd_0 ~> dvd_0_right
6554 DIVISION_BY_ZERO_DIV ~> div_by_0
6555 DIVISION_BY_ZERO_MOD ~> mod_by_0
6556 mult_div ~> div_mult_self2_is_id
6557 mult_mod ~> mod_mult_self2_is_0
6559 * Theory IntDiv: removed many lemmas that are instances of class-based
6560 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
6561 rename old lemmas as follows:
6563 dvd_diff -> nat_dvd_diff
6564 dvd_zminus_iff -> dvd_minus_iff
6565 mod_add1_eq -> mod_add_eq
6566 mod_mult1_eq -> mod_mult_right_eq
6567 mod_mult1_eq' -> mod_mult_left_eq
6568 mod_mult_distrib_mod -> mod_mult_eq
6569 nat_mod_add_left_eq -> mod_add_left_eq
6570 nat_mod_add_right_eq -> mod_add_right_eq
6571 nat_mod_div_trivial -> mod_div_trivial
6572 nat_mod_mod_trivial -> mod_mod_trivial
6573 zdiv_zadd_self1 -> div_add_self1
6574 zdiv_zadd_self2 -> div_add_self2
6575 zdiv_zmult_self1 -> div_mult_self2_is_id
6576 zdiv_zmult_self2 -> div_mult_self1_is_id
6577 zdvd_triv_left -> dvd_triv_left
6578 zdvd_triv_right -> dvd_triv_right
6579 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
6580 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
6581 zmod_zadd_left_eq -> mod_add_left_eq
6582 zmod_zadd_right_eq -> mod_add_right_eq
6583 zmod_zadd_self1 -> mod_add_self1
6584 zmod_zadd_self2 -> mod_add_self2
6585 zmod_zadd1_eq -> mod_add_eq
6586 zmod_zdiff1_eq -> mod_diff_eq
6587 zmod_zdvd_zmod -> mod_mod_cancel
6588 zmod_zmod_cancel -> mod_mod_cancel
6589 zmod_zmult_self1 -> mod_mult_self2_is_0
6590 zmod_zmult_self2 -> mod_mult_self1_is_0
6593 zdvd_abs1 -> abs_dvd_iff
6594 zdvd_abs2 -> dvd_abs_iff
6595 zdvd_refl -> dvd_refl
6596 zdvd_trans -> dvd_trans
6597 zdvd_zadd -> dvd_add
6598 zdvd_zdiff -> dvd_diff
6599 zdvd_zminus_iff -> dvd_minus_iff
6600 zdvd_zminus2_iff -> minus_dvd_iff
6601 zdvd_zmultD -> dvd_mult_right
6602 zdvd_zmultD2 -> dvd_mult_left
6603 zdvd_zmult_mono -> mult_dvd_mono
6604 zdvd_0_right -> dvd_0_right
6605 zdvd_0_left -> dvd_0_left_iff
6606 zdvd_1_left -> one_dvd
6607 zminus_dvd_iff -> minus_dvd_iff
6609 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
6611 * The real numbers offer decimal input syntax: 12.34 is translated
6612 into 1234/10^2. This translation is not reversed upon output.
6614 * Theory Library/Polynomial defines an abstract type 'a poly of
6615 univariate polynomials with coefficients of type 'a. In addition to
6616 the standard ring operations, it also supports div and mod. Code
6617 generation is also supported, using list-style constructors.
6619 * Theory Library/Inner_Product defines a class of real_inner for real
6620 inner product spaces, with an overloaded operation inner :: 'a => 'a
6621 => real. Class real_inner is a subclass of real_normed_vector from
6624 * Theory Library/Product_Vector provides instances for the product
6625 type 'a * 'b of several classes from RealVector and Inner_Product.
6626 Definitions of addition, subtraction, scalar multiplication, norms,
6627 and inner products are included.
6629 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
6630 addition to the field operations, numerals and case syntax are also
6633 * Theory Library/Diagonalize provides constructive version of Cantor's
6634 first diagonalization argument.
6636 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
6637 zlcm (for int); carried together from various gcd/lcm developements in
6638 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
6639 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
6640 may recover tupled syntax as follows:
6642 hide (open) const gcd
6643 abbreviation gcd where
6644 "gcd == (%(a, b). GCD.gcd a b)"
6646 GCD.gcd ("gcd '(_, _')")
6648 The same works for lcm, zgcd, zlcm.
6650 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
6651 instantiations for algebraic structures. Removed some duplicate
6652 theorems. Changes in simp rules. INCOMPATIBILITY.
6654 * ML antiquotation @{code} takes a constant as argument and generates
6655 corresponding code in background and inserts name of the corresponding
6656 resulting ML value/function/datatype constructor binding in place.
6657 All occurrences of @{code} with a single ML block are generated
6658 simultaneously. Provides a generic and safe interface for
6659 instrumentalizing code generation. See
6660 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
6661 In future you ought to refrain from ad-hoc compiling generated SML
6662 code on the ML toplevel. Note that (for technical reasons) @{code}
6663 cannot refer to constants for which user-defined serializations are
6664 set. Refer to the corresponding ML counterpart directly in that
6667 * Command 'rep_datatype': instead of theorem names the command now
6668 takes a list of terms denoting the constructors of the type to be
6669 represented as datatype. The characteristic theorems have to be
6670 proven. INCOMPATIBILITY. Also observe that the following theorems
6671 have disappeared in favour of existing ones:
6673 unit_induct ~> unit.induct
6674 prod_induct ~> prod.induct
6675 sum_induct ~> sum.induct
6676 Suc_Suc_eq ~> nat.inject
6677 Suc_not_Zero Zero_not_Suc ~> nat.distinct
6682 * New locales for orders and lattices where the equivalence relation
6683 is not restricted to equality. INCOMPATIBILITY: all order and lattice
6684 locales use a record structure with field eq for the equivalence.
6686 * New theory of factorial domains.
6688 * Units_l_inv and Units_r_inv are now simp rules by default.
6689 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
6690 and/or r_inv will now also require deletion of these lemmas.
6692 * Renamed the following theorems, INCOMPATIBILITY:
6694 UpperD ~> Upper_memD
6695 LowerD ~> Lower_memD
6696 least_carrier ~> least_closed
6697 greatest_carrier ~> greatest_closed
6698 greatest_Lower_above ~> greatest_Lower_below
6699 one_zero ~> carrier_one_zero
6700 one_not_zero ~> carrier_one_not_zero (collision with assumption)
6705 * Nominal datatypes can now contain type-variables.
6707 * Commands 'nominal_inductive' and 'equivariance' work with local
6710 * Nominal primrec can now works with local theory targets and its
6711 specification syntax now conforms to the general format as seen in
6714 * Method "perm_simp" honours the standard simplifier attributes
6715 (no_asm), (no_asm_use) etc.
6717 * The new predicate #* is defined like freshness, except that on the
6718 left hand side can be a set or list of atoms.
6720 * Experimental command 'nominal_inductive2' derives strong induction
6721 principles for inductive definitions. In contrast to
6722 'nominal_inductive', which can only deal with a fixed number of
6723 binders, it can deal with arbitrary expressions standing for sets of
6724 atoms to be avoided. The only inductive definition we have at the
6725 moment that needs this generalisation is the typing rule for Lets in
6728 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
6729 -----------------------------------------------------------------
6730 Gamma |- Let x be t1 in t2 : T2
6732 In this rule one wants to avoid all the binders that are introduced by
6733 "close Gamma T1". We are looking for other examples where this
6734 feature might be useful. Please let us know.
6739 * Reimplemented the simplification procedure for proving continuity
6740 subgoals. The new simproc is extensible; users can declare additional
6741 continuity introduction rules with the attribute [cont2cont].
6743 * The continuity simproc now uses a different introduction rule for
6744 solving continuity subgoals on terms with lambda abstractions. In
6745 some rare cases the new simproc may fail to solve subgoals that the
6746 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
6747 Potential INCOMPATIBILITY.
6749 * Command 'fixrec': specification syntax now conforms to the general
6750 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
6751 examples. INCOMPATIBILITY.
6756 * Proof of Zorn's Lemma for partial orders.
6761 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
6762 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
6763 depends on multithreading, so timouts will not work before Poly/ML
6766 * High-level support for concurrent ML programming, see
6767 src/Pure/Cuncurrent. The data-oriented model of "future values" is
6768 particularly convenient to organize independent functional
6769 computations. The concept of "synchronized variables" provides a
6770 higher-order interface for components with shared state, avoiding the
6771 delicate details of mutexes and condition variables. (Requires
6772 Poly/ML 5.2.1 or later.)
6774 * ML bindings produced via Isar commands are stored within the Isar
6775 context (theory or proof). Consequently, commands like 'use' and 'ML'
6776 become thread-safe and work with undo as expected (concerning
6777 top-level bindings, not side-effects on global references).
6778 INCOMPATIBILITY, need to provide proper Isar context when invoking the
6779 compiler at runtime; really global bindings need to be given outside a
6780 theory. (Requires Poly/ML 5.2 or later.)
6782 * Command 'ML_prf' is analogous to 'ML' but works within a proof
6783 context. Top-level ML bindings are stored within the proof context in
6784 a purely sequential fashion, disregarding the nested proof structure.
6785 ML bindings introduced by 'ML_prf' are discarded at the end of the
6786 proof. (Requires Poly/ML 5.2 or later.)
6788 * Simplified ML attribute and method setup, cf. functions Attrib.setup
6789 and Method.setup, as well as Isar commands 'attribute_setup' and
6790 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
6791 existing code accordingly, or use plain 'setup' together with old
6794 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
6795 to 'a -> thm, while results are always tagged with an authentic oracle
6796 name. The Isar command 'oracle' is now polymorphic, no argument type
6797 is specified. INCOMPATIBILITY, need to simplify existing oracle code
6798 accordingly. Note that extra performance may be gained by producing
6799 the cterm carefully, avoiding slow Thm.cterm_of.
6801 * Simplified interface for defining document antiquotations via
6802 ThyOutput.antiquotation, ThyOutput.output, and optionally
6803 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
6804 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
6807 * More systematic treatment of long names, abstract name bindings, and
6808 name space operations. Basic operations on qualified names have been
6809 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
6810 Long_Name.append. Old type bstring has been mostly replaced by
6811 abstract type binding (see structure Binding), which supports precise
6812 qualification by packages and local theory targets, as well as proper
6813 tracking of source positions. INCOMPATIBILITY, need to wrap old
6814 bstring values into Binding.name, or better pass through abstract
6815 bindings everywhere. See further src/Pure/General/long_name.ML,
6816 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
6818 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
6819 LocalTheory.note etc.) now refer to the *full* internal name, not the
6820 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
6822 * Disposed old type and term read functions (Sign.read_def_typ,
6823 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
6824 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
6825 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
6826 Syntax.read_term_global etc.; see also OldGoals.read_term as last
6827 resort for legacy applications.
6829 * Disposed old declarations, tactics, tactic combinators that refer to
6830 the simpset or claset of an implicit theory (such as Addsimps,
6831 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
6832 embedded ML text, or local_simpset_of with a proper context passed as
6833 explicit runtime argument.
6835 * Rules and tactics that read instantiations (read_instantiate,
6836 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
6837 context, which is required for parsing and type-checking. Moreover,
6838 the variables are specified as plain indexnames, not string encodings
6839 thereof. INCOMPATIBILITY.
6841 * Generic Toplevel.add_hook interface allows to analyze the result of
6842 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
6843 for theorem dependency output of transactions resulting in a new
6846 * ML antiquotations: block-structured compilation context indicated by
6847 \<lbrace> ... \<rbrace>; additional antiquotation forms:
6849 @{binding name} - basic name binding
6850 @{let ?pat = term} - term abbreviation (HO matching)
6851 @{note name = fact} - fact abbreviation
6852 @{thm fact} - singleton fact (with attributes)
6853 @{thms fact} - general fact (with attributes)
6854 @{lemma prop by method} - singleton goal
6855 @{lemma prop by meth1 meth2} - singleton goal
6856 @{lemma prop1 ... propN by method} - general goal
6857 @{lemma prop1 ... propN by meth1 meth2} - general goal
6858 @{lemma (open) ...} - open derivation
6863 * The Isabelle "emacs" tool provides a specific interface to invoke
6864 Proof General / Emacs, with more explicit failure if that is not
6865 installed (the old isabelle-interface script silently falls back on
6866 isabelle-process). The PROOFGENERAL_HOME setting determines the
6867 installation location of the Proof General distribution.
6869 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
6870 the Isabelle process into a JVM/Scala application. See
6871 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
6872 process wrapper has been discontinued.)
6874 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
6876 * Various status messages (with exact source position information) are
6877 emitted, if proper markup print mode is enabled. This allows
6878 user-interface components to provide detailed feedback on internal
6883 New in Isabelle2008 (June 2008)
6884 -------------------------------
6888 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
6889 and updated, with formally checked references as hyperlinks.
6891 * Theory loader: use_thy (and similar operations) no longer set the
6892 implicit ML context, which was occasionally hard to predict and in
6893 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
6894 provides a proper context already.
6896 * Theory loader: old-style ML proof scripts being *attached* to a thy
6897 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
6898 'use' within a theory file will do the job.
6900 * Name space merge now observes canonical order, i.e. the second space
6901 is inserted into the first one, while existing entries in the first
6902 space take precedence. INCOMPATIBILITY in rare situations, may try to
6903 swap theory imports.
6905 * Syntax: symbol \<chi> is now considered a letter. Potential
6906 INCOMPATIBILITY in identifier syntax etc.
6908 * Outer syntax: string tokens no longer admit escaped white space,
6909 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
6910 white space without escapes.
6912 * Outer syntax: string tokens may contain arbitrary character codes
6913 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
6919 * Context-dependent token translations. Default setup reverts locally
6920 fixed variables, and adds hilite markup for undeclared frees.
6922 * Unused theorems can be found using the new command 'unused_thms'.
6923 There are three ways of invoking it:
6926 Only finds unused theorems in the current theory.
6928 (2) unused_thms thy_1 ... thy_n -
6929 Finds unused theorems in the current theory and all of its ancestors,
6930 excluding the theories thy_1 ... thy_n and all of their ancestors.
6932 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
6933 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
6934 their ancestors, excluding the theories thy_1 ... thy_n and all of
6937 In order to increase the readability of the list produced by
6938 unused_thms, theorems that have been created by a particular instance
6939 of a theory command such as 'inductive' or 'function' are considered
6940 to belong to the same "group", meaning that if at least one theorem in
6941 this group is used, the other theorems in the same group are no longer
6942 reported as unused. Moreover, if all theorems in the group are
6943 unused, only one theorem in the group is displayed.
6945 Note that proof objects have to be switched on in order for
6946 unused_thms to work properly (i.e. !proofs must be >= 1, which is
6947 usually the case when using Proof General with the default settings).
6949 * Authentic naming of facts disallows ad-hoc overwriting of previous
6950 theorems within the same name space. INCOMPATIBILITY, need to remove
6951 duplicate fact bindings, or even accidental fact duplications. Note
6952 that tools may maintain dynamically scoped facts systematically, using
6953 PureThy.add_thms_dynamic.
6955 * Command 'hide' now allows to hide from "fact" name space as well.
6957 * Eliminated destructive theorem database, simpset, claset, and
6958 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
6959 update of theories within ML code.
6961 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
6962 INCOMPATIBILITY, object-logics depending on former Pure require
6963 additional setup PureThy.old_appl_syntax_setup; object-logics
6964 depending on former CPure need to refer to Pure.
6966 * Commands 'use' and 'ML' are now purely functional, operating on
6967 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
6968 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
6971 * Command 'setup': discontinued implicit version with ML reference.
6973 * Instantiation target allows for simultaneous specification of class
6974 instance operations together with an instantiation proof.
6975 Type-checking phase allows to refer to class operations uniformly.
6976 See src/HOL/Complex/Complex.thy for an Isar example and
6977 src/HOL/Library/Eval.thy for an ML example.
6979 * Indexing of literal facts: be more serious about including only
6980 facts from the visible specification/proof context, but not the
6981 background context (locale etc.). Affects `prop` notation and method
6982 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
6985 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
6986 "(open)" option, which used to expose internal bound variables to the
6989 * Isar statements: removed obsolete case "rule_context".
6990 INCOMPATIBILITY, better use explicit fixes/assumes.
6992 * Locale proofs: default proof step now includes 'unfold_locales';
6993 hence 'proof' without argument may be used to unfold locale
6997 *** Document preparation ***
6999 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
7000 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
7001 obsolete thumbpdf setup (contemporary PDF viewers do this on the
7002 spot); renamed link color from "darkblue" to "linkcolor" (default
7003 value unchanged, can be redefined via \definecolor); no longer sets
7004 "a4paper" option (unnecessary or even intrusive).
7006 * Antiquotation @{lemma A method} proves proposition A by the given
7007 method (either a method name or a method name plus (optional) method
7008 arguments in parentheses) and prints A just like @{prop A}.
7013 * New primrec package. Specification syntax conforms in style to
7014 definition/function/.... No separate induction rule is provided. The
7015 "primrec" command distinguishes old-style and new-style specifications
7016 by syntax. The former primrec package is now named OldPrimrecPackage.
7017 When adjusting theories, beware: constants stemming from new-style
7018 primrec specifications have authentic syntax.
7020 * Metis prover is now an order of magnitude faster, and also works
7021 with multithreading.
7023 * Metis: the maximum number of clauses that can be produced from a
7024 theorem is now given by the attribute max_clauses. Theorems that
7025 exceed this number are ignored, with a warning printed.
7027 * Sledgehammer no longer produces structured proofs by default. To
7028 enable, declare [[sledgehammer_full = true]]. Attributes
7029 reconstruction_modulus, reconstruction_sorts renamed
7030 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
7032 * Method "induct_scheme" derives user-specified induction rules
7033 from well-founded induction and completeness of patterns. This factors
7034 out some operations that are done internally by the function package
7035 and makes them available separately. See
7036 src/HOL/ex/Induction_Scheme.thy for examples.
7038 * More flexible generation of measure functions for termination
7039 proofs: Measure functions can be declared by proving a rule of the
7040 form "is_measure f" and giving it the [measure_function] attribute.
7041 The "is_measure" predicate is logically meaningless (always true), and
7042 just guides the heuristic. To find suitable measure functions, the
7043 termination prover sets up the goal "is_measure ?f" of the appropriate
7044 type and generates all solutions by Prolog-style backward proof using
7047 This setup also deals with rules like
7049 "is_measure f ==> is_measure (list_size f)"
7051 which accommodates nested datatypes that recurse through lists.
7052 Similar rules are predeclared for products and option types.
7054 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
7058 - Definitions of overloaded constants on sets have to be replaced by
7059 definitions on => and bool.
7061 - Some definitions of overloaded operators on sets can now be proved
7062 using the definitions of the operators on => and bool. Therefore,
7063 the following theorems have been renamed:
7065 subset_def -> subset_eq
7066 psubset_def -> psubset_eq
7067 set_diff_def -> set_diff_eq
7068 Compl_def -> Compl_eq
7069 Sup_set_def -> Sup_set_eq
7070 Inf_set_def -> Inf_set_eq
7071 sup_set_def -> sup_set_eq
7072 inf_set_def -> inf_set_eq
7074 - Due to the incompleteness of the HO unification algorithm, some
7075 rules such as subst may require manual instantiation, if some of
7076 the unknowns in the rule is a set.
7078 - Higher order unification and forward proofs:
7081 have "P (S::'a set)" <...>
7082 then have "EX S. P S" ..
7084 no longer works (due to the incompleteness of the HO unification
7085 algorithm) and must be replaced by the pattern
7092 - Calculational reasoning with subst (or similar rules):
7095 have "P (S::'a set)" <...>
7096 also have "S = T" <...>
7097 finally have "P T" .
7099 no longer works (for similar reasons as the previous example) and
7100 must be replaced by something like
7102 have "P (S::'a set)" <...>
7103 moreover have "S = T" <...>
7104 ultimately have "P T" by simp
7106 - Tactics or packages written in ML code:
7107 Code performing pattern matching on types via
7109 Type ("set", [T]) => ...
7111 must be rewritten. Moreover, functions like strip_type or
7112 binder_types no longer return the right value when applied to a
7115 T1 => ... => Tn => U => bool
7119 T1 => ... => Tn => U set
7121 * Merged theories Wellfounded_Recursion, Accessible_Part and
7122 Wellfounded_Relations to theory Wellfounded.
7124 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
7126 * Class finite no longer treats UNIV as class parameter. Use class
7127 enum from theory Library/Enum instead to achieve a similar effect.
7130 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
7131 and "Cons". INCOMPATIBILITY.
7133 * HOL (and FOL): renamed variables in rules imp_elim and swap.
7134 Potential INCOMPATIBILITY.
7136 * Theory Product_Type: duplicated lemmas split_Pair_apply and
7137 injective_fst_snd removed, use split_eta and prod_eqI instead.
7138 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
7140 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
7141 the same name in theory Orderings:
7151 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
7152 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
7153 and different variable names.
7155 * Library/Option_ord.thy: Canonical order on option type.
7157 * Library/RBT.thy: Red-black trees, an efficient implementation of
7160 * Library/Countable.thy: Type class for countable types.
7162 * Theory Int: The representation of numerals has changed. The infix
7163 operator BIT and the bit datatype with constructors B0 and B1 have
7164 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
7165 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
7166 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
7169 * Theory Nat: definition of <= and < on natural numbers no longer
7170 depend on well-founded relations. INCOMPATIBILITY. Definitions
7171 le_def and less_def have disappeared. Consider lemmas not_less
7172 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
7174 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
7175 (whose purpose mainly is for various fold_set functionals) have been
7176 abandoned in favor of the existing algebraic classes
7177 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
7178 lower_semilattice (resp. upper_semilattice) and linorder.
7181 * Theory Transitive_Closure: induct and cases rules now declare proper
7182 case_names ("base" and "step"). INCOMPATIBILITY.
7184 * Theorem Inductive.lfp_ordinal_induct generalized to complete
7185 lattices. The form set-specific version is available as
7186 Inductive.lfp_ordinal_induct_set.
7188 * Renamed theorems "power.simps" to "power_int.simps".
7191 * Class semiring_div provides basic abstract properties of semirings
7192 with division and modulo operations. Subsumes former class dvd_mod.
7194 * Merged theories IntDef, Numeral and IntArith into unified theory
7195 Int. INCOMPATIBILITY.
7197 * Theory Library/Code_Index: type "index" now represents natural
7198 numbers rather than integers. INCOMPATIBILITY.
7200 * New class "uminus" with operation "uminus" (split of from class
7201 "minus" which now only has operation "minus", binary).
7204 * Constants "card", "internal_split", "option_map" now with authentic
7205 syntax. INCOMPATIBILITY.
7207 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
7208 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
7209 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
7210 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
7211 Sup_set_def, le_def, less_def, option_map_def now with object
7212 equality. INCOMPATIBILITY.
7214 * Records. Removed K_record, and replaced it by pure lambda term
7215 %x. c. The simplifier setup is now more robust against eta expansion.
7216 INCOMPATIBILITY: in cases explicitly referring to K_record.
7218 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
7220 * Library/ListVector: new theory of arithmetic vector operations.
7222 * Library/Order_Relation: new theory of various orderings as sets of
7223 pairs. Defines preorders, partial orders, linear orders and
7224 well-orders on sets and on types.
7229 * Renamed some theories to allow to loading both ZF and HOL in the
7232 Datatype -> Datatype_ZF
7233 Inductive -> Inductive_ZF
7240 INCOMPATIBILITY: ZF theories that import individual theories below
7241 Main might need to be adapted. Regular theory Main is still
7242 available, as trivial extension of Main_ZF.
7247 * ML within Isar: antiquotation @{const name} or @{const
7248 name(typargs)} produces statically-checked Const term.
7250 * Functor NamedThmsFun: data is available to the user as dynamic fact
7251 (of the same name). Removed obsolete print command.
7253 * Removed obsolete "use_legacy_bindings" function.
7255 * The ``print mode'' is now a thread-local value derived from a global
7256 template (the former print_mode reference), thus access becomes
7257 non-critical. The global print_mode reference is for session
7258 management only; user-code should use print_mode_value,
7259 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
7261 * Functions system/system_out provide a robust way to invoke external
7262 shell commands, with propagation of interrupts (requires Poly/ML
7263 5.2.1). Do not use OS.Process.system etc. from the basis library!
7268 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
7269 in accordance with Proof General 3.7, which prefers GNU emacs.
7271 * isatool tty runs Isabelle process with plain tty interaction;
7272 optional line editor may be specified via ISABELLE_LINE_EDITOR
7273 setting, the default settings attempt to locate "ledit" and "rlwrap".
7275 * isatool browser now works with Cygwin as well, using general
7276 "javapath" function defined in Isabelle process environment.
7278 * YXML notation provides a simple and efficient alternative to
7279 standard XML transfer syntax. See src/Pure/General/yxml.ML and
7280 isatool yxml as described in the Isabelle system manual.
7282 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
7283 provides general wrapper for managing an Isabelle process in a robust
7284 fashion, with ``cooked'' output from stdin/stderr.
7286 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
7287 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
7289 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
7290 way of changing the user's settings is via
7291 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
7294 * Multithreading.max_threads := 0 refers to the number of actual CPU
7295 cores of the underlying machine, which is a good starting point for
7296 optimal performance tuning. The corresponding usedir option -M allows
7297 "max" as an alias for "0". WARNING: does not work on certain versions
7298 of Mac OS (with Poly/ML 5.1).
7300 * isabelle-process: non-ML sessions are run with "nice", to reduce the
7301 adverse effect of Isabelle flooding interactive front-ends (notably
7302 ProofGeneral / XEmacs).
7306 New in Isabelle2007 (November 2007)
7307 -----------------------------------
7311 * More uniform information about legacy features, notably a
7312 warning/error of "Legacy feature: ...", depending on the state of the
7313 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
7314 legacy features will disappear eventually.
7316 * Theory syntax: the header format ``theory A = B + C:'' has been
7317 discontinued in favour of ``theory A imports B C begin''. Use isatool
7318 fixheaders to convert existing theory files. INCOMPATIBILITY.
7320 * Theory syntax: the old non-Isar theory file format has been
7321 discontinued altogether. Note that ML proof scripts may still be used
7322 with Isar theories; migration is usually quite simple with the ML
7323 function use_legacy_bindings. INCOMPATIBILITY.
7325 * Theory syntax: some popular names (e.g. 'class', 'declaration',
7326 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
7329 * Theory loader: be more serious about observing the static theory
7330 header specifications (including optional directories), but not the
7331 accidental file locations of previously successful loads. The strict
7332 update policy of former update_thy is now already performed by
7333 use_thy, so the former has been removed; use_thys updates several
7334 theories simultaneously, just as 'imports' within a theory header
7335 specification, but without merging the results. Potential
7336 INCOMPATIBILITY: may need to refine theory headers and commands
7337 ROOT.ML which depend on load order.
7339 * Theory loader: optional support for content-based file
7340 identification, instead of the traditional scheme of full physical
7341 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
7342 (cf. the system manual). The new scheme allows to work with
7343 non-finished theories in persistent session images, such that source
7344 files may be moved later on without requiring reloads.
7346 * Theory loader: old-style ML proof scripts being *attached* to a thy
7347 file (with the same base name as the theory) are considered a legacy
7348 feature, which will disappear eventually. Even now, the theory loader
7349 no longer maintains dependencies on such files.
7351 * Syntax: the scope for resolving ambiguities via type-inference is
7352 now limited to individual terms, instead of whole simultaneous
7353 specifications as before. This greatly reduces the complexity of the
7354 syntax module and improves flexibility by separating parsing and
7355 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
7356 'fixes' etc.) are required in rare situations.
7358 * Syntax: constants introduced by new-style packages ('definition',
7359 'abbreviation' etc.) are passed through the syntax module in
7360 ``authentic mode''. This means that associated mixfix annotations
7361 really stick to such constants, independently of potential name space
7362 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
7363 trees are represented slightly differently, may need to adapt syntax
7364 translations accordingly. Use CONST marker in 'translations' and
7365 @{const_syntax} antiquotation in 'parse_translation' etc.
7367 * Legacy goal package: reduced interface to the bare minimum required
7368 to keep existing proof scripts running. Most other user-level
7369 functions are now part of the OldGoals structure, which is *not* open
7370 by default (consider isatool expandshort before open OldGoals).
7371 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
7372 these tend to cause confusion about the actual goal (!) context being
7373 used here, which is not necessarily the same as the_context().
7375 * Command 'find_theorems': supports "*" wild-card in "name:"
7376 criterion; "with_dups" option. Certain ProofGeneral versions might
7377 support a specific search form (see ProofGeneral/CHANGES).
7379 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
7380 by default, which means that "prems" (and also "fixed variables") are
7381 suppressed from proof state output. Note that the ProofGeneral
7382 settings mechanism allows to change and save options persistently, but
7383 older versions of Isabelle will fail to start up if a negative prems
7386 * Local theory targets may be specified by non-nested blocks of
7387 ``context/locale/class ... begin'' followed by ``end''. The body may
7388 contain definitions, theorems etc., including any derived mechanism
7389 that has been implemented on top of these primitives. This concept
7390 generalizes the existing ``theorem (in ...)'' towards more versatility
7393 * Proof General interface: proper undo of final 'end' command;
7394 discontinued Isabelle/classic mode (ML proof scripts).
7397 *** Document preparation ***
7399 * Added antiquotation @{theory name} which prints the given name,
7400 after checking that it refers to a valid ancestor theory in the
7403 * Added antiquotations @{ML_type text} and @{ML_struct text} which
7404 check the given source text as ML type/structure, printing verbatim.
7406 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
7407 "c args == rhs" given in the current context. (Any number of
7408 arguments may be given on the LHS.)
7413 * The 'class' package offers a combination of axclass and locale to
7414 achieve Haskell-like type classes in Isabelle. Definitions and
7415 theorems within a class context produce both relative results (with
7416 implicit parameters according to the locale context), and polymorphic
7417 constants with qualified polymorphism (according to the class
7418 context). Within the body context of a 'class' target, a separate
7419 syntax layer ("user space type system") takes care of converting
7420 between global polymorphic consts and internal locale representation.
7421 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
7422 "isatool doc classes" provides a tutorial.
7424 * Generic code generator framework allows to generate executable
7425 code for ML and Haskell (including Isabelle classes). A short usage
7428 internal compilation:
7429 export_code <list of constants (term syntax)> in SML
7430 writing SML code to a file:
7431 export_code <list of constants (term syntax)> in SML <filename>
7432 writing OCaml code to a file:
7433 export_code <list of constants (term syntax)> in OCaml <filename>
7434 writing Haskell code to a bunch of files:
7435 export_code <list of constants (term syntax)> in Haskell <filename>
7437 evaluating closed propositions to True/False using code generation:
7440 Reasonable default setup of framework in HOL.
7442 Theorem attributs for selecting and transforming function equations theorems:
7444 [code fun]: select a theorem as function equation for a specific constant
7445 [code fun del]: deselect a theorem as function equation for a specific constant
7446 [code inline]: select an equation theorem for unfolding (inlining) in place
7447 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
7449 User-defined serializations (target in {SML, OCaml, Haskell}):
7451 code_const <and-list of constants (term syntax)>
7452 {(target) <and-list of const target syntax>}+
7454 code_type <and-list of type constructors>
7455 {(target) <and-list of type target syntax>}+
7457 code_instance <and-list of instances>
7459 where instance ::= <type constructor> :: <class>
7461 code_class <and_list of classes>
7462 {(target) <and-list of class target syntax>}+
7463 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
7465 code_instance and code_class only are effective to target Haskell.
7467 For example usage see src/HOL/ex/Codegenerator.thy and
7468 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
7469 generation from Isabelle/HOL theories is available via "isatool doc
7472 * Code generator: consts in 'consts_code' Isar commands are now
7473 referred to by usual term syntax (including optional type
7476 * Command 'no_translations' removes translation rules from theory
7479 * Overloaded definitions are now actually checked for acyclic
7480 dependencies. The overloading scheme is slightly more general than
7481 that of Haskell98, although Isabelle does not demand an exact
7482 correspondence to type class and instance declarations.
7483 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
7484 exotic versions of overloading -- at the discretion of the user!
7486 Polymorphic constants are represented via type arguments, i.e. the
7487 instantiation that matches an instance against the most general
7488 declaration given in the signature. For example, with the declaration
7489 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
7490 as c(nat). Overloading is essentially simultaneous structural
7491 recursion over such type arguments. Incomplete specification patterns
7492 impose global constraints on all occurrences, e.g. c('a * 'a) on the
7493 LHS means that more general c('a * 'b) will be disallowed on any RHS.
7494 Command 'print_theory' outputs the normalized system of recursive
7495 equations, see section "definitions".
7497 * Configuration options are maintained within the theory or proof
7498 context (with name and type bool/int/string), providing a very simple
7499 interface to a poor-man's version of general context data. Tools may
7500 declare options in ML (e.g. using Attrib.config_int) and then refer to
7501 these values using Config.get etc. Users may change options via an
7502 associated attribute of the same name. This form of context
7503 declaration works particularly well with commands 'declare' or
7504 'using', for example ``declare [[foo = 42]]''. Thus it has become
7505 very easy to avoid global references, which would not observe Isar
7506 toplevel undo/redo and fail to work with multithreading.
7508 Various global ML references of Pure and HOL have been turned into
7509 configuration options:
7511 Unify.search_bound unify_search_bound
7512 Unify.trace_bound unify_trace_bound
7513 Unify.trace_simp unify_trace_simp
7514 Unify.trace_types unify_trace_types
7515 Simplifier.simp_depth_limit simp_depth_limit
7516 Blast.depth_limit blast_depth_limit
7517 DatatypeProp.dtK datatype_distinctness_limit
7518 fast_arith_neq_limit fast_arith_neq_limit
7519 fast_arith_split_limit fast_arith_split_limit
7521 * Named collections of theorems may be easily installed as context
7522 data using the functor NamedThmsFun (see also
7523 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
7524 attributes; there is also a toplevel print command. This facility is
7525 just a common case of general context data, which is the preferred way
7526 for anything more complex than just a list of facts in canonical
7529 * Isar: command 'declaration' augments a local theory by generic
7530 declaration functions written in ML. This enables arbitrary content
7531 being added to the context, depending on a morphism that tells the
7532 difference of the original declaration context wrt. the application
7533 context encountered later on.
7535 * Isar: proper interfaces for simplification procedures. Command
7536 'simproc_setup' declares named simprocs (with match patterns, and body
7537 text in ML). Attribute "simproc" adds/deletes simprocs in the current
7538 context. ML antiquotation @{simproc name} retrieves named simprocs.
7540 * Isar: an extra pair of brackets around attribute declarations
7541 abbreviates a theorem reference involving an internal dummy fact,
7542 which will be ignored later --- only the effect of the attribute on
7543 the background context will persist. This form of in-place
7544 declarations is particularly useful with commands like 'declare' and
7545 'using', for example ``have A using [[simproc a]] by simp''.
7547 * Isar: method "assumption" (and implicit closing of subproofs) now
7548 takes simple non-atomic goal assumptions into account: after applying
7549 an assumption as a rule the resulting subgoals are solved by atomic
7550 assumption steps. This is particularly useful to finish 'obtain'
7551 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
7552 without referring to the original premise "!!x. P x ==> thesis" in the
7553 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
7556 * Isar: implicit use of prems from the Isar proof context is
7557 considered a legacy feature. Common applications like ``have A .''
7558 may be replaced by ``have A by fact'' or ``note `A`''. In general,
7559 referencing facts explicitly here improves readability and
7560 maintainability of proof texts.
7562 * Isar: improper proof element 'guess' is like 'obtain', but derives
7563 the obtained context from the course of reasoning! For example:
7565 assume "EX x y. A x & B y" -- "any previous fact"
7566 then guess x and y by clarify
7568 This technique is potentially adventurous, depending on the facts and
7569 proof tools being involved here.
7571 * Isar: known facts from the proof context may be specified as literal
7572 propositions, using ASCII back-quote syntax. This works wherever
7573 named facts used to be allowed so far, in proof commands, proof
7574 methods, attributes etc. Literal facts are retrieved from the context
7575 according to unification of type and term parameters. For example,
7576 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
7577 theorems in the current context, then these are valid literal facts:
7578 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
7580 There is also a proof method "fact" which does the same composition
7581 for explicit goal states, e.g. the following proof texts coincide with
7582 certain special cases of literal facts:
7584 have "A" by fact == note `A`
7585 have "A ==> B" by fact == note `A ==> B`
7586 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
7587 have "P a ==> Q a" by fact == note `P a ==> Q a`
7589 * Isar: ":" (colon) is no longer a symbolic identifier character in
7590 outer syntax. Thus symbolic identifiers may be used without
7591 additional white space in declarations like this: ``assume *: A''.
7593 * Isar: 'print_facts' prints all local facts of the current context,
7594 both named and unnamed ones.
7596 * Isar: 'def' now admits simultaneous definitions, e.g.:
7598 def x == "t" and y == "u"
7600 * Isar: added command 'unfolding', which is structurally similar to
7601 'using', but affects both the goal state and facts by unfolding given
7602 rewrite rules. Thus many occurrences of the 'unfold' method or
7603 'unfolded' attribute may be replaced by first-class proof text.
7605 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
7606 and command 'unfolding' now all support object-level equalities
7607 (potentially conditional). The underlying notion of rewrite rule is
7608 analogous to the 'rule_format' attribute, but *not* that of the
7609 Simplifier (which is usually more generous).
7611 * Isar: the new attribute [rotated n] (default n = 1) rotates the
7612 premises of a theorem by n. Useful in conjunction with drule.
7614 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
7615 method expression within a sandbox consisting of the first N
7616 sub-goals, which need to exist. For example, ``simp_all [3]''
7617 simplifies the first three sub-goals, while (rule foo, simp_all)[]
7618 simplifies all new goals that emerge from applying rule foo to the
7619 originally first one.
7621 * Isar: schematic goals are no longer restricted to higher-order
7622 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
7625 * Isar: the conclusion of a long theorem statement is now either
7626 'shows' (a simultaneous conjunction, as before), or 'obtains'
7627 (essentially a disjunction of cases with local parameters and
7628 assumptions). The latter allows to express general elimination rules
7629 adequately; in this notation common elimination rules look like this:
7631 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
7633 obtains x where "P x"
7635 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
7639 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
7645 The subsequent classical rules even refer to the formal "thesis"
7648 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
7651 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
7652 obtains "thesis ==> something"
7654 The actual proof of an 'obtains' statement is analogous to that of the
7655 Isar proof element 'obtain', only that there may be several cases.
7656 Optional case names may be specified in parentheses; these will be
7657 available both in the present proof and as annotations in the
7658 resulting rule, for later use with the 'cases' method (cf. attribute
7661 * Isar: the assumptions of a long theorem statement are available as
7662 "assms" fact in the proof context. This is more appropriate than the
7663 (historical) "prems", which refers to all assumptions of the current
7664 context, including those from the target locale, proof body etc.
7666 * Isar: 'print_statement' prints theorems from the current theory or
7667 proof context in long statement form, according to the syntax of a
7670 * Isar: 'obtain' takes an optional case name for the local context
7671 introduction rule (default "that").
7673 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
7674 explicit (is "_ ==> ?foo") in the rare cases where this still happens
7677 * Pure: syntax "CONST name" produces a fully internalized constant
7678 according to the current context. This is particularly useful for
7679 syntax translations that should refer to internal constant
7680 representations independently of name spaces.
7682 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
7683 instead of "FOO ". This allows multiple binder declarations to coexist
7684 in the same context. INCOMPATIBILITY.
7686 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
7687 primitive that also works in a locale context (both for constants and
7688 fixed variables). Type declaration and internal syntactic representation
7689 of given constants retrieved from the context. Likewise, the
7690 'no_notation' command allows to remove given syntax annotations from the
7693 * Isar/locales: new derived specification elements 'axiomatization',
7694 'definition', 'abbreviation', which support type-inference, admit
7695 object-level specifications (equality, equivalence). See also the
7696 isar-ref manual. Examples:
7699 eq (infix "===" 50) where
7700 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
7702 definition "f x y = x + y + 1"
7703 definition g where "g x = f x x"
7706 neq (infix "=!=" 50) where
7707 "x =!= y == ~ (x === y)"
7709 These specifications may be also used in a locale context. Then the
7710 constants being introduced depend on certain fixed parameters, and the
7711 constant name is qualified by the locale base name. An internal
7712 abbreviation takes care for convenient input and output, making the
7713 parameters implicit and using the original short name. See also
7714 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
7715 entities from a monomorphic theory.
7717 Presently, abbreviations are only available 'in' a target locale, but
7718 not inherited by general import expressions. Also note that
7719 'abbreviation' may be used as a type-safe replacement for 'syntax' +
7720 'translations' in common applications. The "no_abbrevs" print mode
7721 prevents folding of abbreviations in term output.
7723 Concrete syntax is attached to specified constants in internal form,
7724 independently of name spaces. The parse tree representation is
7725 slightly different -- use 'notation' instead of raw 'syntax', and
7726 'translations' with explicit "CONST" markup to accommodate this.
7728 * Pure/Isar: unified syntax for new-style specification mechanisms
7729 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
7730 full type inference and dummy patterns ("_"). For example:
7732 definition "K x _ = x"
7734 inductive conj for A B
7735 where "A ==> B ==> conj A B"
7737 * Pure: command 'print_abbrevs' prints all constant abbreviations of
7738 the current context. Print mode "no_abbrevs" prevents inversion of
7739 abbreviations on output.
7741 * Isar/locales: improved parameter handling: use of locales "var" and
7742 "struct" no longer necessary; - parameter renamings are no longer
7743 required to be injective. For example, this allows to define
7744 endomorphisms as locale endom = homom mult mult h.
7746 * Isar/locales: changed the way locales with predicates are defined.
7747 Instead of accumulating the specification, the imported expression is
7748 now an interpretation. INCOMPATIBILITY: different normal form of
7749 locale expressions. In particular, in interpretations of locales with
7750 predicates, goals repesenting already interpreted fragments are not
7751 removed automatically. Use methods `intro_locales' and
7752 `unfold_locales'; see below.
7754 * Isar/locales: new methods `intro_locales' and `unfold_locales'
7755 provide backward reasoning on locales predicates. The methods are
7756 aware of interpretations and discharge corresponding goals.
7757 `intro_locales' is less aggressive then `unfold_locales' and does not
7758 unfold predicates to assumptions.
7760 * Isar/locales: the order in which locale fragments are accumulated
7761 has changed. This enables to override declarations from fragments due
7762 to interpretations -- for example, unwanted simp rules.
7764 * Isar/locales: interpretation in theories and proof contexts has been
7765 extended. One may now specify (and prove) equations, which are
7766 unfolded in interpreted theorems. This is useful for replacing
7767 defined concepts (constants depending on locale parameters) by
7768 concepts already existing in the target context. Example:
7770 interpretation partial_order ["op <= :: [int, int] => bool"]
7771 where "partial_order.less (op <=) (x::int) y = (x < y)"
7773 Typically, the constant `partial_order.less' is created by a
7774 definition specification element in the context of locale
7777 * Method "induct": improved internal context management to support
7778 local fixes and defines on-the-fly. Thus explicit meta-level
7779 connectives !! and ==> are rarely required anymore in inductive goals
7780 (using object-logic connectives for this purpose has been long
7781 obsolete anyway). Common proof patterns are explained in
7782 src/HOL/Induct/Common_Patterns.thy, see also
7783 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
7786 * Method "induct": improved handling of simultaneous goals. Instead of
7787 introducing object-level conjunction, the statement is now split into
7788 several conclusions, while the corresponding symbolic cases are nested
7789 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
7790 see src/HOL/Induct/Common_Patterns.thy, for example.
7792 * Method "induct": mutual induction rules are now specified as a list
7793 of rule sharing the same induction cases. HOL packages usually provide
7794 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
7795 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
7796 mutual induction rules differently, i.e. like this:
7798 (induct rule: foo_bar.inducts)
7799 (induct set: foo bar)
7800 (induct pred: foo bar)
7801 (induct type: foo bar)
7803 The ML function ProjectRule.projections turns old-style rules into the
7806 * Method "coinduct": dual of induction, see
7807 src/HOL/Library/Coinductive_List.thy for various examples.
7809 * Method "cases", "induct", "coinduct": the ``(open)'' option is
7810 considered a legacy feature.
7812 * Attribute "symmetric" produces result with standardized schematic
7813 variables (index 0). Potential INCOMPATIBILITY.
7815 * Simplifier: by default the simplifier trace only shows top level
7816 rewrites now. That is, trace_simp_depth_limit is set to 1 by
7817 default. Thus there is less danger of being flooded by the trace. The
7818 trace indicates where parts have been suppressed.
7820 * Provers/classical: removed obsolete classical version of elim_format
7821 attribute; classical elim/dest rules are now treated uniformly when
7822 manipulating the claset.
7824 * Provers/classical: stricter checks to ensure that supplied intro,
7825 dest and elim rules are well-formed; dest and elim rules must have at
7828 * Provers/classical: attributes dest/elim/intro take an optional
7829 weight argument for the rule (just as the Pure versions). Weights are
7830 ignored by automated tools, but determine the search order of single
7833 * Syntax: input syntax now supports dummy variable binding "%_. b",
7834 where the body does not mention the bound variable. Note that dummy
7835 patterns implicitly depend on their context of bounds, which makes
7836 "{_. _}" match any set comprehension as expected. Potential
7837 INCOMPATIBILITY -- parse translations need to cope with syntactic
7838 constant "_idtdummy" in the binding position.
7840 * Syntax: removed obsolete syntactic constant "_K" and its associated
7841 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
7842 for example "A -> B" => "Pi A (%_. B)".
7844 * Pure: 'class_deps' command visualizes the subclass relation, using
7845 the graph browser tool.
7847 * Pure: 'print_theory' now suppresses certain internal declarations by
7848 default; use '!' option for full details.
7853 * Method "metis" proves goals by applying the Metis general-purpose
7854 resolution prover (see also http://gilith.com/software/metis/).
7855 Examples are in the directory MetisExamples. WARNING: the
7856 Isabelle/HOL-Metis integration does not yet work properly with
7859 * Command 'sledgehammer' invokes external automatic theorem provers as
7860 background processes. It generates calls to the "metis" method if
7861 successful. These can be pasted into the proof. Users do not have to
7862 wait for the automatic provers to return. WARNING: does not really
7863 work with multi-threading.
7865 * New "auto_quickcheck" feature tests outermost goal statements for
7866 potential counter-examples. Controlled by ML references
7867 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
7868 5000 milliseconds). Fails silently if statements is outside of
7869 executable fragment, or any other codgenerator problem occurs.
7871 * New constant "undefined" with axiom "undefined x = undefined".
7873 * Added class "HOL.eq", allowing for code generation with polymorphic
7876 * Some renaming of class constants due to canonical name prefixing in
7877 the new 'class' package:
7879 HOL.abs ~> HOL.abs_class.abs
7880 HOL.divide ~> HOL.divide_class.divide
7881 0 ~> HOL.zero_class.zero
7882 1 ~> HOL.one_class.one
7883 op + ~> HOL.plus_class.plus
7884 op - ~> HOL.minus_class.minus
7885 uminus ~> HOL.minus_class.uminus
7886 op * ~> HOL.times_class.times
7887 op < ~> HOL.ord_class.less
7888 op <= > HOL.ord_class.less_eq
7889 Nat.power ~> Power.power_class.power
7890 Nat.size ~> Nat.size_class.size
7891 Numeral.number_of ~> Numeral.number_class.number_of
7892 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
7893 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
7894 Orderings.min ~> Orderings.ord_class.min
7895 Orderings.max ~> Orderings.ord_class.max
7896 Divides.op div ~> Divides.div_class.div
7897 Divides.op mod ~> Divides.div_class.mod
7898 Divides.op dvd ~> Divides.div_class.dvd
7900 INCOMPATIBILITY. Adaptions may be required in the following cases:
7902 a) User-defined constants using any of the names "plus", "minus",
7903 "times", "less" or "less_eq". The standard syntax translations for
7904 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
7907 b) Variables named "plus", "minus", "times", "less", "less_eq"
7908 INCOMPATIBILITY: use more specific names.
7910 c) Permutative equations (e.g. "a + b = b + a")
7911 Since the change of names also changes the order of terms, permutative
7912 rewrite rules may get applied in a different order. Experience shows
7913 that this is rarely the case (only two adaptions in the whole Isabelle
7914 distribution). INCOMPATIBILITY: rewrite proofs
7916 d) ML code directly refering to constant names
7917 This in general only affects hand-written proof tactics, simprocs and
7918 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
7919 Consider using @{const_name} antiquotation.
7921 * New class "default" with associated constant "default".
7923 * Function "sgn" is now overloaded and available on int, real, complex
7924 (and other numeric types), using class "sgn". Two possible defs of
7925 sgn are given as equational assumptions in the classes sgn_if and
7926 sgn_div_norm; ordered_idom now also inherits from sgn_if.
7929 * Locale "partial_order" now unified with class "order" (cf. theory
7930 Orderings), added parameter "less". INCOMPATIBILITY.
7932 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
7933 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
7934 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
7936 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
7937 changed order of proof goals in instance proofs.
7939 * The transitivity reasoner for partial and linear orders is set up
7940 for classes "order" and "linorder". Instances of the reasoner are available
7941 in all contexts importing or interpreting the corresponding locales.
7942 Method "order" invokes the reasoner separately; the reasoner
7943 is also integrated with the Simplifier as a solver. Diagnostic
7944 command 'print_orders' shows the available instances of the reasoner
7945 in the current context.
7947 * Localized monotonicity predicate in theory "Orderings"; integrated
7948 lemmas max_of_mono and min_of_mono with this predicate.
7951 * Formulation of theorem "dense" changed slightly due to integration
7952 with new class dense_linear_order.
7954 * Uniform lattice theory development in HOL.
7956 constants "meet" and "join" now named "inf" and "sup"
7957 constant "Meet" now named "Inf"
7959 classes "meet_semilorder" and "join_semilorder" now named
7960 "lower_semilattice" and "upper_semilattice"
7961 class "lorder" now named "lattice"
7962 class "comp_lat" now named "complete_lattice"
7964 Instantiation of lattice classes allows explicit definitions
7965 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
7967 INCOMPATIBILITY. Theorem renames:
7969 meet_left_le ~> inf_le1
7970 meet_right_le ~> inf_le2
7971 join_left_le ~> sup_ge1
7972 join_right_le ~> sup_ge2
7973 meet_join_le ~> inf_sup_ord
7976 le_meet ~> le_inf_iff
7977 le_join ~> ge_sup_conv
7978 meet_idempotent ~> inf_idem
7979 join_idempotent ~> sup_idem
7980 meet_comm ~> inf_commute
7981 join_comm ~> sup_commute
7982 meet_leI1 ~> le_infI1
7983 meet_leI2 ~> le_infI2
7984 le_joinI1 ~> le_supI1
7985 le_joinI2 ~> le_supI2
7986 meet_assoc ~> inf_assoc
7987 join_assoc ~> sup_assoc
7988 meet_left_comm ~> inf_left_commute
7989 meet_left_idempotent ~> inf_left_idem
7990 join_left_comm ~> sup_left_commute
7991 join_left_idempotent ~> sup_left_idem
7994 le_def_meet ~> le_iff_inf
7995 le_def_join ~> le_iff_sup
7996 join_absorp2 ~> sup_absorb2
7997 join_absorp1 ~> sup_absorb1
7998 meet_absorp1 ~> inf_absorb1
7999 meet_absorp2 ~> inf_absorb2
8000 meet_join_absorp ~> inf_sup_absorb
8001 join_meet_absorp ~> sup_inf_absorb
8002 distrib_join_le ~> distrib_sup_le
8003 distrib_meet_le ~> distrib_inf_le
8005 add_meet_distrib_left ~> add_inf_distrib_left
8006 add_join_distrib_left ~> add_sup_distrib_left
8007 is_join_neg_meet ~> is_join_neg_inf
8008 is_meet_neg_join ~> is_meet_neg_sup
8009 add_meet_distrib_right ~> add_inf_distrib_right
8010 add_join_distrib_right ~> add_sup_distrib_right
8011 add_meet_join_distribs ~> add_sup_inf_distribs
8012 join_eq_neg_meet ~> sup_eq_neg_inf
8013 meet_eq_neg_join ~> inf_eq_neg_sup
8014 add_eq_meet_join ~> add_eq_inf_sup
8015 meet_0_imp_0 ~> inf_0_imp_0
8016 join_0_imp_0 ~> sup_0_imp_0
8017 meet_0_eq_0 ~> inf_0_eq_0
8018 join_0_eq_0 ~> sup_0_eq_0
8019 neg_meet_eq_join ~> neg_inf_eq_sup
8020 neg_join_eq_meet ~> neg_sup_eq_inf
8021 join_eq_if ~> sup_eq_if
8023 mono_meet ~> mono_inf
8024 mono_join ~> mono_sup
8025 meet_bool_eq ~> inf_bool_eq
8026 join_bool_eq ~> sup_bool_eq
8027 meet_fun_eq ~> inf_fun_eq
8028 join_fun_eq ~> sup_fun_eq
8029 meet_set_eq ~> inf_set_eq
8030 join_set_eq ~> sup_set_eq
8031 meet1_iff ~> inf1_iff
8032 meet2_iff ~> inf2_iff
8041 join1_iff ~> sup1_iff
8042 join2_iff ~> sup2_iff
8052 is_meet_Meet ~> is_meet_Inf
8053 Meet_bool_def ~> Inf_bool_def
8054 Meet_fun_def ~> Inf_fun_def
8055 Meet_greatest ~> Inf_greatest
8056 Meet_lower ~> Inf_lower
8057 Meet_set_def ~> Inf_set_def
8060 Sup_bool_eq ~> Sup_bool_def
8061 Sup_fun_eq ~> Sup_fun_def
8062 Sup_set_eq ~> Sup_set_def
8064 listsp_meetI ~> listsp_infI
8065 listsp_meet_eq ~> listsp_inf_eq
8070 * Added syntactic class "size"; overloaded constant "size" now has
8071 type "'a::size ==> bool"
8073 * Internal reorganisation of `size' of datatypes: size theorems
8074 "foo.size" are no longer subsumed by "foo.simps" (but are still
8075 simplification rules by default!); theorems "prod.size" now named
8078 * Class "div" now inherits from class "times" rather than "type".
8081 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
8082 Linorder etc. have disappeared; operations defined in terms of
8083 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
8085 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
8087 * HOL-Word: New extensive library and type for generic, fixed size
8088 machine words, with arithmetic, bit-wise, shifting and rotating
8089 operations, reflection into int, nat, and bool lists, automation for
8090 linear arithmetic (by automatic reflection into nat or int), including
8091 lemmas on overflow and monotonicity. Instantiated to all appropriate
8092 arithmetic type classes, supporting automatic simplification of
8093 numerals on all operations.
8095 * Library/Boolean_Algebra: locales for abstract boolean algebras.
8097 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
8099 * Code generator library theories:
8100 - Code_Integer represents HOL integers by big integer literals in target
8102 - Code_Char represents HOL characters by character literals in target
8104 - Code_Char_chr like Code_Char, but also offers treatment of character
8105 codes; includes Code_Integer.
8106 - Executable_Set allows to generate code for finite sets using lists.
8107 - Executable_Rat implements rational numbers as triples (sign, enumerator,
8109 - Executable_Real implements a subset of real numbers, namly those
8110 representable by rational numbers.
8111 - Efficient_Nat implements natural numbers by integers, which in general will
8112 result in higher efficency; pattern matching with 0/Suc is eliminated;
8113 includes Code_Integer.
8114 - Code_Index provides an additional datatype index which is mapped to
8115 target-language built-in integers.
8116 - Code_Message provides an additional datatype message_string which is isomorphic to
8117 strings; messages are mapped to target-language strings.
8119 * New package for inductive predicates
8121 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
8124 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
8125 for z_1 :: U_1 and ... and z_n :: U_m
8127 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
8130 with full support for type-inference, rather than
8132 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
8134 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
8135 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
8137 inductive "s z_1 ... z_m"
8139 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
8142 For backward compatibility, there is a wrapper allowing inductive
8143 sets to be defined with the new package via
8146 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
8147 for z_1 :: U_1 and ... and z_n :: U_m
8149 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
8155 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
8156 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
8157 for z_1 :: U_1 and ... and z_n :: U_m
8159 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
8160 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
8163 if the additional syntax "p ..." is required.
8165 Numerous examples can be found in the subdirectories src/HOL/Auth,
8166 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
8170 - Since declaration and definition of inductive sets or predicates
8171 is no longer separated, abbreviations involving the newly
8172 introduced sets or predicates must be specified together with the
8173 introduction rules after the 'where' keyword (see above), rather
8174 than before the actual inductive definition.
8176 - The variables in induction and elimination rules are now
8177 quantified in the order of their occurrence in the introduction
8178 rules, rather than in alphabetical order. Since this may break
8179 some proofs, these proofs either have to be repaired, e.g. by
8180 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
8181 statements of the form
8183 case (rule_i a_i_1 ... a_i_{k_i})
8185 or the old order of quantification has to be restored by explicitly adding
8186 meta-level quantifiers in the introduction rules, i.e.
8188 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
8190 - The format of the elimination rules is now
8192 p z_1 ... z_m x_1 ... x_n ==>
8193 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
8198 (x_1, ..., x_n) : s z_1 ... z_m ==>
8199 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
8202 for sets rather than
8204 x : s z_1 ... z_m ==>
8205 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
8208 This may require terms in goals to be expanded to n-tuples
8209 (e.g. using case_tac or simplification with the split_paired_all
8210 rule) before the above elimination rule is applicable.
8212 - The elimination or case analysis rules for (mutually) inductive
8213 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
8214 list of rules "p_1_..._p_k.elims" is no longer available.
8216 * New package "function"/"fun" for general recursive functions,
8217 supporting mutual and nested recursion, definitions in local contexts,
8218 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
8219 for small examples, and the separate tutorial on the function
8220 package. The old recdef "package" is still available as before, but
8221 users are encouraged to use the new package.
8223 * Method "lexicographic_order" automatically synthesizes termination
8224 relations as lexicographic combinations of size measures.
8226 * Case-expressions allow arbitrary constructor-patterns (including
8227 "_") and take their order into account, like in functional
8228 programming. Internally, this is translated into nested
8229 case-expressions; missing cases are added and mapped to the predefined
8230 constant "undefined". In complicated cases printing may no longer show
8231 the original input but the internal form. Lambda-abstractions allow
8232 the same form of pattern matching: "% pat1 => e1 | ..." is an
8233 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
8236 * IntDef: The constant "int :: nat => int" has been removed; now "int"
8237 is an abbreviation for "of_nat :: nat => int". The simplification
8238 rules for "of_nat" have been changed to work like "int" did
8239 previously. Potential INCOMPATIBILITY:
8240 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
8241 - of_nat_diff and of_nat_mult are no longer default simp rules
8243 * Method "algebra" solves polynomial equations over (semi)rings using
8244 Groebner bases. The (semi)ring structure is defined by locales and the
8245 tool setup depends on that generic context. Installing the method for
8246 a specific type involves instantiating the locale and possibly adding
8247 declarations for computation on the coefficients. The method is
8248 already instantiated for natural numbers and for the axiomatic class
8249 of idoms with numerals. See also the paper by Chaieb and Wenzel at
8250 CALCULEMUS 2007 for the general principles underlying this
8251 architecture of context-aware proof-tools.
8253 * Method "ferrack" implements quantifier elimination over
8254 special-purpose dense linear orders using locales (analogous to
8255 "algebra"). The method is already installed for class
8256 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
8259 * Former constant "List.op @" now named "List.append". Use ML
8260 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
8261 circumvent possible incompatibilities when working on ML level.
8263 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
8265 * New function listsum :: 'a list => 'a for arbitrary monoids.
8266 Special syntax: "SUM x <- xs. f x" (and latex variants)
8268 * New syntax for Haskell-like list comprehension (input only), eg.
8269 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
8271 * The special syntax for function "filter" has changed from [x :
8272 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
8273 comprehension syntax, and for uniformity. INCOMPATIBILITY.
8275 * [a..b] is now defined for arbitrary linear orders. It used to be
8276 defined on nat only, as an abbreviation for [a..<Suc b]
8279 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
8281 * New functions "sorted" and "sort" in src/HOL/List.thy.
8283 * New lemma collection field_simps (an extension of ring_simps) for
8284 manipulating (in)equations involving division. Multiplies with all
8285 denominators that can be proved to be non-zero (in equations) or
8286 positive/negative (in inequations).
8288 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
8289 have been improved and renamed to ring_simps, group_simps and
8290 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
8291 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
8293 * Theory Library/Commutative_Ring: switched from recdef to function
8294 package; constants add, mul, pow now curried. Infix syntax for
8295 algebraic operations.
8297 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
8300 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
8303 * HOL/records: generalised field-update to take a function on the
8304 field rather than the new value: r(|A := x|) is translated to A_update
8305 (K x) r The K-combinator that is internally used is called K_record.
8306 INCOMPATIBILITY: Usage of the plain update functions has to be
8309 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
8310 * x = 0, which are required for a semiring. Richer structures do not
8311 inherit from semiring_0 anymore, because this property is a theorem
8312 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
8313 there is more to prove, but this is mostly trivial.
8315 * Class "recpower" is generalized to arbitrary monoids, not just
8316 commutative semirings. INCOMPATIBILITY: may need to incorporate
8317 commutativity or semiring properties additionally.
8319 * Constant "List.list_all2" in List.thy now uses authentic syntax.
8320 INCOMPATIBILITY: translations containing list_all2 may go wrong,
8321 better use 'abbreviation'.
8323 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
8325 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
8326 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
8327 significant changes for setting up numeral syntax for types:
8328 - New constants Numeral.pred and Numeral.succ instead
8329 of former Numeral.bin_pred and Numeral.bin_succ.
8330 - Use integer operations instead of bin_add, bin_mult and so on.
8331 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
8332 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
8334 See src/HOL/Integ/IntArith.thy for an example setup.
8336 * Command 'normal_form' computes the normal form of a term that may
8337 contain free variables. For example ``normal_form "rev [a, b, c]"''
8338 produces ``[b, c, a]'' (without proof). This command is suitable for
8339 heavy-duty computations because the functions are compiled to ML
8340 first. Correspondingly, a method "normalization" is provided. See
8341 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
8343 * Alternative iff syntax "A <-> B" for equality on bool (with priority
8344 25 like -->); output depends on the "iff" print_mode, the default is
8345 "A = B" (with priority 50).
8347 * Relations less (<) and less_eq (<=) are also available on type bool.
8348 Modified syntax to disallow nesting without explicit parentheses,
8349 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
8352 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
8354 * Relation composition operator "op O" now has precedence 75 and binds
8355 stronger than union and intersection. INCOMPATIBILITY.
8357 * The old set interval syntax "{m..n(}" (and relatives) has been
8358 removed. Use "{m..<n}" (and relatives) instead.
8360 * In the context of the assumption "~(s = t)" the Simplifier rewrites
8361 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
8362 ``declare [[simproc del: neq]]''.
8364 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
8367 * Theorem Cons_eq_map_conv no longer declared as "simp".
8369 * Theorem setsum_mult renamed to setsum_right_distrib.
8371 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
8374 * Reimplemented methods "sat" and "satx", with several improvements:
8375 goals no longer need to be stated as "<prems> ==> False", equivalences
8376 (i.e. "=" on type bool) are handled, variable names of the form
8377 "lit_<n>" are no longer reserved, significant speedup.
8379 * Methods "sat" and "satx" can now replay MiniSat proof traces.
8380 zChaff is still supported as well.
8382 * 'inductive' and 'datatype': provide projections of mutual rules,
8383 bundled as foo_bar.inducts;
8385 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
8388 * Library: moved theory Accessible_Part to main HOL.
8390 * Library: added theory Coinductive_List of potentially infinite lists
8391 as greatest fixed-point.
8393 * Library: added theory AssocList which implements (finite) maps as
8396 * Method "evaluation" solves goals (i.e. a boolean expression)
8397 efficiently by compiling it to ML. The goal is "proved" (via an
8398 oracle) if it evaluates to True.
8400 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
8401 also when invoked by the simplifier. This results in the Simplifier
8402 being more powerful on arithmetic goals. INCOMPATIBILITY.
8403 Configuration option fast_arith_split_limit=0 recovers the old
8406 * Support for hex (0x20) and binary (0b1001) numerals.
8408 * New method: reify eqs (t), where eqs are equations for an
8409 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
8410 parameter, computes a term s::'b and a list xs::'a list and proves the
8411 theorem I xs s = t. This is also known as reification or quoting. The
8412 resulting theorem is applied to the subgoal to substitute t with I xs
8413 s. If t is omitted, the subgoal itself is reified.
8415 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
8416 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
8417 where f is supposed to be a computable function (in the sense of code
8418 generattion). The method uses reify to compute s and xs as above then
8419 applies corr_thm and uses normalization by evaluation to "prove" f s =
8420 r and finally gets the theorem t = r, which is again applied to the
8421 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
8423 * Reflection: Automatic reification now handels binding, an example is
8424 available in src/HOL/ex/ReflectionEx.thy
8426 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
8427 command 'statespace' that is similar to 'record', but introduces an
8428 abstract specification based on the locale infrastructure instead of
8429 HOL types. This leads to extra flexibility in composing state spaces,
8430 in particular multiple inheritance and renaming of components.
8435 * Hyperreal: Functions root and sqrt are now defined on negative real
8436 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
8437 Nonnegativity side conditions have been removed from many lemmas, so
8438 that more subgoals may now be solved by simplification; potential
8441 * Real: new type classes formalize real normed vector spaces and
8442 algebras, using new overloaded constants scaleR :: real => 'a => 'a
8443 and norm :: 'a => real.
8445 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
8446 reals into other types. The overloaded constant Reals :: 'a set is now
8447 defined as range of_real; potential INCOMPATIBILITY.
8449 * Real: proper support for ML code generation, including 'quickcheck'.
8450 Reals are implemented as arbitrary precision rationals.
8452 * Hyperreal: Several constants that previously worked only for the
8453 reals have been generalized, so they now work over arbitrary vector
8454 spaces. Type annotations may need to be added in some cases; potential
8457 Infinitesimal :: ('a::real_normed_vector) star set
8458 HFinite :: ('a::real_normed_vector) star set
8459 HInfinite :: ('a::real_normed_vector) star set
8460 approx :: ('a::real_normed_vector) star => 'a star => bool
8461 monad :: ('a::real_normed_vector) star => 'a star set
8462 galaxy :: ('a::real_normed_vector) star => 'a star set
8463 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
8464 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
8465 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
8466 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
8467 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
8468 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
8469 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
8470 sgn :: 'a::real_normed_vector => 'a
8471 exp :: 'a::{recpower,real_normed_field,banach} => 'a
8473 * Complex: Some complex-specific constants are now abbreviations for
8474 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
8475 hnorm. Other constants have been entirely removed in favor of the
8476 polymorphic versions (INCOMPATIBILITY):
8480 HInfinite <-- CInfinite
8481 Infinitesimal <-- CInfinitesimal
8484 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
8485 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
8486 (ns)deriv <-- (ns)cderiv
8491 * Formalisation of ideals and the quotient construction over rings.
8493 * Order and lattice theory no longer based on records.
8496 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
8497 greatest_closed. INCOMPATIBILITY.
8499 * Method algebra is now set up via an attribute. For examples see
8500 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
8501 of algebraic structures.
8503 * Renamed theory CRing to Ring.
8508 * Substantial, yet incomplete support for nominal datatypes (binding
8509 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
8510 src/HOL/Nominal/Examples. Prospective users should consult
8511 http://isabelle.in.tum.de/nominal/
8516 * ML basics: just one true type int, which coincides with IntInf.int
8519 * ML within Isar: antiquotations allow to embed statically-checked
8520 formal entities in the source, referring to the context available at
8521 compile-time. For example:
8523 ML {* @{sort "{zero,one}"} *}
8524 ML {* @{typ "'a => 'b"} *}
8525 ML {* @{term "%x. x"} *}
8526 ML {* @{prop "x == y"} *}
8527 ML {* @{ctyp "'a => 'b"} *}
8528 ML {* @{cterm "%x. x"} *}
8529 ML {* @{cprop "x == y"} *}
8530 ML {* @{thm asm_rl} *}
8531 ML {* @{thms asm_rl} *}
8532 ML {* @{type_name c} *}
8533 ML {* @{type_syntax c} *}
8534 ML {* @{const_name c} *}
8535 ML {* @{const_syntax c} *}
8538 ML {* @{theory Pure} *}
8539 ML {* @{theory_ref} *}
8540 ML {* @{theory_ref Pure} *}
8543 ML {* @{clasimpset} *}
8545 The same works for sources being ``used'' within an Isar context.
8547 * ML in Isar: improved error reporting; extra verbosity with
8548 ML_Context.trace enabled.
8550 * Pure/General/table.ML: the join operations now works via exceptions
8551 DUP/SAME instead of type option. This is simpler in simple cases, and
8552 admits slightly more efficient complex applications.
8554 * Pure: 'advanced' translation functions (parse_translation etc.) now
8555 use Context.generic instead of just theory.
8557 * Pure: datatype Context.generic joins theory/Proof.context and
8558 provides some facilities for code that works in either kind of
8559 context, notably GenericDataFun for uniform theory and proof data.
8561 * Pure: simplified internal attribute type, which is now always
8562 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
8563 local (Proof.context) attributes have been discontinued, while
8564 minimizing code duplication. Thm.rule_attribute and
8565 Thm.declaration_attribute build canonical attributes; see also structure
8566 Context for further operations on Context.generic, notably
8567 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
8568 declarations and definitions.
8570 * Context data interfaces (Theory/Proof/GenericDataFun): removed
8571 name/print, uninitialized data defaults to ad-hoc copy of empty value,
8572 init only required for impure data. INCOMPATIBILITY: empty really need
8573 to be empty (no dependencies on theory content!)
8575 * Pure/kernel: consts certification ignores sort constraints given in
8576 signature declarations. (This information is not relevant to the
8577 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
8578 potential INCOMPATIBILITY.
8580 * Pure: axiomatic type classes are now purely definitional, with
8581 explicit proofs of class axioms and super class relations performed
8582 internally. See Pure/axclass.ML for the main internal interfaces --
8583 notably AxClass.define_class supercedes AxClass.add_axclass, and
8584 AxClass.axiomatize_class/classrel/arity supersede
8585 Sign.add_classes/classrel/arities.
8587 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
8588 global/local versions on theory vs. Proof.context have been
8589 discontinued; Attrib.syntax and Method.syntax have been adapted
8590 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
8591 attributes, methods, etc.
8593 * Pure: several functions of signature "... -> theory -> theory * ..."
8594 have been reoriented to "... -> theory -> ... * theory" in order to
8595 allow natural usage in combination with the ||>, ||>>, |-> and
8596 fold_map combinators.
8598 * Pure: official theorem names (closed derivations) and additional
8599 comments (tags) are now strictly separate. Name hints -- which are
8600 maintained as tags -- may be attached any time without affecting the
8603 * Pure: primitive rule lift_rule now takes goal cterm instead of an
8604 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
8605 achieve the old behaviour.
8607 * Pure: the "Goal" constant is now called "prop", supporting a
8608 slightly more general idea of ``protecting'' meta-level rule
8611 * Pure: Logic.(un)varify only works in a global context, which is now
8612 enforced instead of silently assumed. INCOMPATIBILITY, may use
8613 Logic.legacy_(un)varify as temporary workaround.
8615 * Pure: structure Name provides scalable operations for generating
8616 internal variable names, notably Name.variants etc. This replaces
8617 some popular functions from term.ML:
8619 Term.variant -> Name.variant
8620 Term.variantlist -> Name.variant_list
8621 Term.invent_names -> Name.invent_list
8623 Note that low-level renaming rarely occurs in new code -- operations
8624 from structure Variable are used instead (see below).
8626 * Pure: structure Variable provides fundamental operations for proper
8627 treatment of fixed/schematic variables in a context. For example,
8628 Variable.import introduces fixes for schematics of given facts and
8629 Variable.export reverses the effect (up to renaming) -- this replaces
8630 various freeze_thaw operations.
8632 * Pure: structure Goal provides simple interfaces for
8633 init/conclude/finish and tactical prove operations (replacing former
8634 Tactic.prove). Goal.prove is the canonical way to prove results
8635 within a given context; Goal.prove_global is a degraded version for
8636 theory level goals, including a global Drule.standard. Note that
8637 OldGoals.prove_goalw_cterm has long been obsolete, since it is
8638 ill-behaved in a local proof context (e.g. with local fixes/assumes or
8639 in a locale context).
8641 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
8642 and type checking (Syntax.check_term etc.), with common combinations
8643 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
8644 which are considered legacy and await removal.
8646 * Pure/Syntax: generic interfaces for type unchecking
8647 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
8648 with common combinations (Syntax.pretty_term, Syntax.string_of_term
8649 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
8650 available for convenience, but refer to the very same operations using
8651 a mere theory instead of a full context.
8653 * Isar: simplified treatment of user-level errors, using exception
8654 ERROR of string uniformly. Function error now merely raises ERROR,
8655 without any side effect on output channels. The Isar toplevel takes
8656 care of proper display of ERROR exceptions. ML code may use plain
8657 handle/can/try; cat_error may be used to concatenate errors like this:
8659 ... handle ERROR msg => cat_error msg "..."
8661 Toplevel ML code (run directly or through the Isar toplevel) may be
8662 embedded into the Isar toplevel with exception display/debug like
8665 Isar.toplevel (fn () => ...)
8667 INCOMPATIBILITY, removed special transform_error facilities, removed
8668 obsolete variants of user-level exceptions (ERROR_MESSAGE,
8669 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
8670 -- use plain ERROR instead.
8672 * Isar: theory setup now has type (theory -> theory), instead of a
8673 list. INCOMPATIBILITY, may use #> to compose setup functions.
8675 * Isar: ML toplevel pretty printer for type Proof.context, subject to
8676 ProofContext.debug/verbose flags.
8678 * Isar: Toplevel.theory_to_proof admits transactions that modify the
8679 theory before entering a proof state. Transactions now always see a
8680 quasi-functional intermediate checkpoint, both in interactive and
8683 * Isar: simplified interfaces for outer syntax. Renamed
8684 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
8685 OuterSyntax.add_parsers -- this functionality is now included in
8686 OuterSyntax.command etc. INCOMPATIBILITY.
8688 * Simplifier: the simpset of a running simplification process now
8689 contains a proof context (cf. Simplifier.the_context), which is the
8690 very context that the initial simpset has been retrieved from (by
8691 simpset_of/local_simpset_of). Consequently, all plug-in components
8692 (solver, looper etc.) may depend on arbitrary proof data.
8694 * Simplifier.inherit_context inherits the proof context (plus the
8695 local bounds) of the current simplification process; any simproc
8696 etc. that calls the Simplifier recursively should do this! Removed
8697 former Simplifier.inherit_bounds, which is already included here --
8698 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
8699 specify an explicit context using Simplifier.context/theory_context.
8701 * Simplifier/Classical Reasoner: more abstract interfaces
8702 change_simpset/claset for modifying the simpset/claset reference of a
8703 theory; raw versions simpset/claset_ref etc. have been discontinued --
8706 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
8712 * settings: the default heap location within ISABELLE_HOME_USER now
8713 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
8714 Isabelle installations.
8716 * isabelle-process: option -S (secure mode) disables some critical
8717 operations, notably runtime compilation and evaluation of ML source
8720 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
8722 * Support for parallel execution, using native multicore support of
8723 Poly/ML 5.1. The theory loader exploits parallelism when processing
8724 independent theories, according to the given theory header
8725 specifications. The maximum number of worker threads is specified via
8726 usedir option -M or the "max-threads" setting in Proof General. A
8727 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
8728 to 6 on a 8-core machine. User-code needs to observe certain
8729 guidelines for thread-safe programming, see appendix A in the Isar
8730 Implementation manual.
8734 New in Isabelle2005 (October 2005)
8735 ----------------------------------
8739 * Theory headers: the new header syntax for Isar theories is
8742 imports <theory1> ... <theoryN>
8743 uses <file1> ... <fileM>
8746 where the 'uses' part is optional. The previous syntax
8748 theory <name> = <theory1> + ... + <theoryN>:
8750 will disappear in the next release. Use isatool fixheaders to convert
8751 existing theory files. Note that there is no change in ancient
8752 non-Isar theories now, but these will disappear soon.
8754 * Theory loader: parent theories can now also be referred to via
8755 relative and absolute paths.
8757 * Command 'find_theorems' searches for a list of criteria instead of a
8758 list of constants. Known criteria are: intro, elim, dest, name:string,
8759 simp:term, and any term. Criteria can be preceded by '-' to select
8760 theorems that do not match. Intro, elim, dest select theorems that
8761 match the current goal, name:s selects theorems whose fully qualified
8762 name contain s, and simp:term selects all simplification rules whose
8763 lhs match term. Any other term is interpreted as pattern and selects
8764 all theorems matching the pattern. Available in ProofGeneral under
8765 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
8767 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
8769 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
8770 matching the current goal as introduction rule and not having "HOL."
8771 in their name (i.e. not being defined in theory HOL).
8773 * Command 'thms_containing' has been discontinued in favour of
8774 'find_theorems'; INCOMPATIBILITY.
8776 * Communication with Proof General is now 8bit clean, which means that
8777 Unicode text in UTF-8 encoding may be used within theory texts (both
8778 formal and informal parts). Cf. option -U of the Isabelle Proof
8779 General interface. Here are some simple examples (cf. src/HOL/ex):
8781 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
8782 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
8784 * Improved efficiency of the Simplifier and, to a lesser degree, the
8785 Classical Reasoner. Typical big applications run around 2 times
8789 *** Document preparation ***
8791 * Commands 'display_drafts' and 'print_drafts' perform simple output
8792 of raw sources. Only those symbols that do not require additional
8793 LaTeX packages (depending on comments in isabellesym.sty) are
8794 displayed properly, everything else is left verbatim. isatool display
8795 and isatool print are used as front ends (these are subject to the
8796 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
8798 * Command tags control specific markup of certain regions of text,
8799 notably folding and hiding. Predefined tags include "theory" (for
8800 theory begin and end), "proof" for proof commands, and "ML" for
8801 commands involving ML code; the additional tags "visible" and
8802 "invisible" are unused by default. Users may give explicit tag
8803 specifications in the text, e.g. ''by %invisible (auto)''. The
8804 interpretation of tags is determined by the LaTeX job during document
8805 preparation: see option -V of isatool usedir, or options -n and -t of
8806 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
8809 Several document versions may be produced at the same time via isatool
8810 usedir (the generated index.html will link all of them). Typical
8811 specifications include ''-V document=theory,proof,ML'' to present
8812 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
8813 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
8814 these parts without any formal replacement text. The Isabelle site
8815 default settings produce ''document'' and ''outline'' versions as
8818 * Several new antiquotations:
8820 @{term_type term} prints a term with its type annotated;
8822 @{typeof term} prints the type of a term;
8824 @{const const} is the same as @{term const}, but checks that the
8825 argument is a known logical constant;
8827 @{term_style style term} and @{thm_style style thm} print a term or
8828 theorem applying a "style" to it
8832 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
8833 definitions, equations, inequations etc., 'concl' printing only the
8834 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
8835 to print the specified premise. TermStyle.add_style provides an ML
8836 interface for introducing further styles. See also the "LaTeX Sugar"
8837 document practical applications. The ML antiquotation prints
8838 type-checked ML expressions verbatim.
8840 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
8841 and 'text' support optional locale specification '(in loc)', which
8842 specifies the default context for interpreting antiquotations. For
8843 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
8845 * Option 'locale=NAME' of antiquotations specifies an alternative
8846 context interpreting the subsequent argument. For example: @{thm
8847 [locale=lattice] inf_assoc}.
8849 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
8852 * Proper output of antiquotations for theory commands involving a
8853 proof context (such as 'locale' or 'theorem (in loc) ...').
8855 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
8856 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
8858 * isatool usedir: new option -C (default true) controls whether option
8859 -D should include a copy of the original document directory; -C false
8860 prevents unwanted effects such as copying of administrative CVS data.
8865 * Considerably improved version of 'constdefs' command. Now performs
8866 automatic type-inference of declared constants; additional support for
8867 local structure declarations (cf. locales and HOL records), see also
8868 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
8869 sequential dependencies of definitions within a single 'constdefs'
8870 section; moreover, the declared name needs to be an identifier. If
8871 all fails, consider to fall back on 'consts' and 'defs' separately.
8873 * Improved indexed syntax and implicit structures. First of all,
8874 indexed syntax provides a notational device for subscripted
8875 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
8876 expressions. Secondly, in a local context with structure
8877 declarations, number indexes \<^sub>n or the empty index (default
8878 number 1) refer to a certain fixed variable implicitly; option
8879 show_structs controls printing of implicit structures. Typical
8880 applications of these concepts involve record types and locales.
8882 * New command 'no_syntax' removes grammar declarations (and
8883 translations) resulting from the given syntax specification, which is
8884 interpreted in the same manner as for the 'syntax' command.
8886 * 'Advanced' translation functions (parse_translation etc.) may depend
8887 on the signature of the theory context being presently used for
8888 parsing/printing, see also isar-ref manual.
8890 * Improved 'oracle' command provides a type-safe interface to turn an
8891 ML expression of type theory -> T -> term into a primitive rule of
8892 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
8893 is already included here); see also FOL/ex/IffExample.thy;
8896 * axclass: name space prefix for class "c" is now "c_class" (was "c"
8897 before); "cI" is no longer bound, use "c.intro" instead.
8898 INCOMPATIBILITY. This change avoids clashes of fact bindings for
8899 axclasses vs. locales.
8901 * Improved internal renaming of symbolic identifiers -- attach primes
8902 instead of base 26 numbers.
8904 * New flag show_question_marks controls printing of leading question
8905 marks in schematic variable names.
8907 * In schematic variable names, *any* symbol following \<^isub> or
8908 \<^isup> is now treated as part of the base name. For example, the
8909 following works without printing of awkward ".0" indexes:
8911 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
8914 * Inner syntax includes (*(*nested*) comments*).
8916 * Pretty printer now supports unbreakable blocks, specified in mixfix
8917 annotations as "(00...)".
8919 * Clear separation of logical types and nonterminals, where the latter
8920 may only occur in 'syntax' specifications or type abbreviations.
8921 Before that distinction was only partially implemented via type class
8922 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
8923 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
8924 exotic syntax specifications may require further adaption
8925 (e.g. Cube/Cube.thy).
8927 * Removed obsolete type class "logic", use the top sort {} instead.
8928 Note that non-logical types should be declared as 'nonterminals'
8929 rather than 'types'. INCOMPATIBILITY for new object-logic
8932 * Attributes 'induct' and 'cases': type or set names may now be
8933 locally fixed variables as well.
8935 * Simplifier: can now control the depth to which conditional rewriting
8936 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
8939 * Simplifier: simplification procedures may now take the current
8940 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
8941 interface), which is very useful for calling the Simplifier
8942 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
8943 is gone -- use prems_of_ss on the simpset instead. Moreover, the
8944 low-level mk_simproc no longer applies Logic.varify internally, to
8945 allow for use in a context of fixed variables.
8947 * thin_tac now works even if the assumption being deleted contains !!
8948 or ==>. More generally, erule now works even if the major premise of
8949 the elimination rule contains !! or ==>.
8951 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
8953 * Reorganized bootstrapping of the Pure theories; CPure is now derived
8954 from Pure, which contains all common declarations already. Both
8955 theories are defined via plain Isabelle/Isar .thy files.
8956 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
8957 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
8958 use isatool fixcpure to adapt your theory and ML sources.
8960 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
8961 selections of theorems in named facts via index ranges.
8963 * 'print_theorems': in theory mode, really print the difference
8964 wrt. the last state (works for interactive theory development only),
8965 in proof mode print all local facts (cf. 'print_facts');
8967 * 'hide': option '(open)' hides only base names.
8969 * More efficient treatment of intermediate checkpoints in interactive
8972 * Code generator is now invoked via code_module (incremental code
8973 generation) and code_library (modular code generation, ML structures
8974 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
8975 must be quoted when used as identifiers.
8977 * New 'value' command for reading, evaluating and printing terms using
8978 the code generator. INCOMPATIBILITY: command keyword 'value' must be
8979 quoted when used as identifier.
8984 * New commands for the interpretation of locale expressions in
8985 theories (1), locales (2) and proof contexts (3). These generate
8986 proof obligations from the expression specification. After the
8987 obligations have been discharged, theorems of the expression are added
8988 to the theory, target locale or proof context. The synopsis of the
8989 commands is a follows:
8991 (1) interpretation expr inst
8992 (2) interpretation target < expr
8993 (3) interpret expr inst
8995 Interpretation in theories and proof contexts require a parameter
8996 instantiation of terms from the current context. This is applied to
8997 specifications and theorems of the interpreted expression.
8998 Interpretation in locales only permits parameter renaming through the
8999 locale expression. Interpretation is smart in that interpretations
9000 that are active already do not occur in proof obligations, neither are
9001 instantiated theorems stored in duplicate. Use 'print_interps' to
9002 inspect active interpretations of a particular locale. For details,
9003 see the Isar Reference manual. Examples can be found in
9004 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
9006 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
9007 'interpret' instead.
9009 * New context element 'constrains' for adding type constraints to
9012 * Context expressions: renaming of parameters with syntax
9015 * Locale declaration: 'includes' disallowed.
9017 * Proper static binding of attribute syntax -- i.e. types / terms /
9018 facts mentioned as arguments are always those of the locale definition
9019 context, independently of the context of later invocations. Moreover,
9020 locale operations (renaming and type / term instantiation) are applied
9021 to attribute arguments as expected.
9023 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
9024 actual attributes; rare situations may require Attrib.attribute to
9025 embed those attributes into Attrib.src that lack concrete syntax.
9026 Attribute implementations need to cooperate properly with the static
9027 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
9028 Attrib.XXX_thm etc. already do the right thing without further
9029 intervention. Only unusual applications -- such as "where" or "of"
9030 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
9031 on the context and the facts involved -- may have to assign parsed
9032 values to argument tokens explicitly.
9034 * Changed parameter management in theorem generation for long goal
9035 statements with 'includes'. INCOMPATIBILITY: produces a different
9036 theorem statement in rare situations.
9038 * Locale inspection command 'print_locale' omits notes elements. Use
9039 'print_locale!' to have them included in the output.
9044 * Provers/hypsubst.ML: improved version of the subst method, for
9045 single-step rewriting: it now works in bound variable contexts. New is
9046 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
9047 rewrite a different subterm than the original subst method, which is
9048 still available as 'simplesubst'.
9050 * Provers/quasi.ML: new transitivity reasoners for transitivity only
9053 * Provers/trancl.ML: new transitivity reasoner for transitive and
9054 reflexive-transitive closure of relations.
9056 * Provers/blast.ML: new reference depth_limit to make blast's depth
9057 limit (previously hard-coded with a value of 20) user-definable.
9059 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
9060 is peformed already. Object-logics merely need to finish their
9061 initial simpset configuration as before. INCOMPATIBILITY.
9066 * Symbolic syntax of Hilbert Choice Operator is now as follows:
9069 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
9071 The symbol \<some> is displayed as the alternative epsilon of LaTeX
9072 and x-symbol; use option '-m epsilon' to get it actually printed.
9073 Moreover, the mathematically important symbolic identifier \<epsilon>
9074 becomes available as variable, constant etc. INCOMPATIBILITY,
9076 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
9077 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
9078 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
9079 support corresponding Isar calculations.
9081 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
9084 * theory SetInterval: changed the syntax for open intervals:
9093 The old syntax is still supported but will disappear in the next
9094 release. For conversion use the following Emacs search and replace
9095 patterns (these are not perfect but work quite well):
9097 {)\([^\.]*\)\.\. -> {\1<\.\.}
9098 \.\.\([^(}]*\)(} -> \.\.<\1}
9100 * Theory Commutative_Ring (in Library): method comm_ring for proving
9101 equalities in commutative rings; method 'algebra' provides a generic
9104 * Theory Finite_Set: changed the syntax for 'setsum', summation over
9105 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
9106 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
9109 Some new syntax forms are available:
9111 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
9112 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
9113 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
9114 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
9116 The latter form "\<Sum>x < k. e" used to be based on a separate
9117 function "Summation", which has been discontinued.
9119 * theory Finite_Set: in structured induction proofs, the insert case
9120 is now 'case (insert x F)' instead of the old counterintuitive 'case
9123 * The 'refute' command has been extended to support a much larger
9124 fragment of HOL, including axiomatic type classes, constdefs and
9125 typedefs, inductive datatypes and recursion.
9127 * New tactics 'sat' and 'satx' to prove propositional tautologies.
9128 Requires zChaff with proof generation to be installed. See
9129 HOL/ex/SAT_Examples.thy for examples.
9131 * Datatype induction via method 'induct' now preserves the name of the
9132 induction variable. For example, when proving P(xs::'a list) by
9133 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
9134 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
9135 in unstructured proof scripts.
9137 * Reworked implementation of records. Improved scalability for
9138 records with many fields, avoiding performance problems for type
9139 inference. Records are no longer composed of nested field types, but
9140 of nested extension types. Therefore the record type only grows linear
9141 in the number of extensions and not in the number of fields. The
9142 top-level (users) view on records is preserved. Potential
9143 INCOMPATIBILITY only in strange cases, where the theory depends on the
9144 old record representation. The type generated for a record is called
9145 <record_name>_ext_type.
9147 Flag record_quick_and_dirty_sensitive can be enabled to skip the
9148 proofs triggered by a record definition or a simproc (if
9149 quick_and_dirty is enabled). Definitions of large records can take
9152 New simproc record_upd_simproc for simplification of multiple record
9153 updates enabled by default. Moreover, trivial updates are also
9154 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
9155 occasionally, since simplification is more powerful by default.
9157 * typedef: proper support for polymorphic sets, which contain extra
9158 type-variables in the term.
9160 * Simplifier: automatically reasons about transitivity chains
9161 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
9162 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
9163 old proofs break occasionally as simplification may now solve more
9164 goals than previously.
9166 * Simplifier: converts x <= y into x = y if assumption y <= x is
9167 present. Works for all partial orders (class "order"), in particular
9168 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
9171 * Simplifier: new simproc for "let x = a in f x". If a is a free or
9172 bound variable or a constant then the let is unfolded. Otherwise
9173 first a is simplified to b, and then f b is simplified to g. If
9174 possible we abstract b from g arriving at "let x = b in h x",
9175 otherwise we unfold the let and arrive at g. The simproc can be
9176 enabled/disabled by the reference use_let_simproc. Potential
9177 INCOMPATIBILITY since simplification is more powerful by default.
9179 * Classical reasoning: the meson method now accepts theorems as arguments.
9181 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
9182 jobs to provide advice on the provability of subgoals.
9184 * Theory OrderedGroup and Ring_and_Field: various additions and
9185 improvements to faciliate calculations involving equalities and
9188 The following theorems have been eliminated or modified
9191 abs_eq now named abs_of_nonneg
9192 abs_of_ge_0 now named abs_of_nonneg
9193 abs_minus_eq now named abs_of_nonpos
9194 imp_abs_id now named abs_of_nonneg
9195 imp_abs_neg_id now named abs_of_nonpos
9196 mult_pos now named mult_pos_pos
9197 mult_pos_le now named mult_nonneg_nonneg
9198 mult_pos_neg_le now named mult_nonneg_nonpos
9199 mult_pos_neg2_le now named mult_nonneg_nonpos2
9200 mult_neg now named mult_neg_neg
9201 mult_neg_le now named mult_nonpos_nonpos
9203 * The following lemmas in Ring_and_Field have been added to the simplifier:
9206 not_square_less_zero
9208 The following lemmas have been deleted from Real/RealPow:
9218 * Theory Parity: added rules for simplifying exponents.
9222 The following theorems have been eliminated or modified
9225 list_all_Nil now named list_all.simps(1)
9226 list_all_Cons now named list_all.simps(2)
9227 list_all_conv now named list_all_iff
9228 set_mem_eq now named mem_iff
9230 * Theories SetsAndFunctions and BigO (see HOL/Library) support
9231 asymptotic "big O" calculations. See the notes in BigO.thy.
9236 * Theory RealDef: better support for embedding natural numbers and
9237 integers in the reals.
9239 The following theorems have been eliminated or modified
9242 exp_ge_add_one_self now requires no hypotheses
9243 real_of_int_add reversed direction of equality (use [symmetric])
9244 real_of_int_minus reversed direction of equality (use [symmetric])
9245 real_of_int_diff reversed direction of equality (use [symmetric])
9246 real_of_int_mult reversed direction of equality (use [symmetric])
9248 * Theory RComplete: expanded support for floor and ceiling functions.
9250 * Theory Ln is new, with properties of the natural logarithm
9252 * Hyperreal: There is a new type constructor "star" for making
9253 nonstandard types. The old type names are now type synonyms:
9257 hcomplex = complex star
9259 * Hyperreal: Many groups of similarly-defined constants have been
9260 replaced by polymorphic versions (INCOMPATIBILITY):
9262 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
9264 starset <-- starsetNat, starsetC
9265 *s* <-- *sNat*, *sc*
9266 starset_n <-- starsetNat_n, starsetC_n
9267 *sn* <-- *sNatn*, *scn*
9268 InternalSets <-- InternalNatSets, InternalCSets
9270 starfun <-- starfun{Nat,Nat2,C,RC,CR}
9271 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
9272 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
9273 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
9274 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
9276 * Hyperreal: Many type-specific theorems have been removed in favor of
9277 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
9279 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
9280 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
9281 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
9282 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
9283 right_minus <-- hypreal_add_minus
9284 left_minus <-- {hypreal,hcomplex}_add_minus_left
9285 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
9286 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
9287 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
9288 mult_1_right <-- hcomplex_mult_one_right
9289 mult_zero_left <-- hcomplex_mult_zero_left
9290 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
9291 right_distrib <-- hypnat_add_mult_distrib2
9292 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
9293 right_inverse <-- hypreal_mult_inverse
9294 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
9295 order_refl <-- {hypreal,hypnat}_le_refl
9296 order_trans <-- {hypreal,hypnat}_le_trans
9297 order_antisym <-- {hypreal,hypnat}_le_anti_sym
9298 order_less_le <-- {hypreal,hypnat}_less_le
9299 linorder_linear <-- {hypreal,hypnat}_le_linear
9300 add_left_mono <-- {hypreal,hypnat}_add_left_mono
9301 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
9302 add_nonneg_nonneg <-- hypreal_le_add_order
9304 * Hyperreal: Separate theorems having to do with type-specific
9305 versions of constants have been merged into theorems that apply to the
9306 new polymorphic constants (INCOMPATIBILITY):
9308 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
9309 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
9310 STAR_Un <-- {STAR,NatStar,STARC}_Un
9311 STAR_Int <-- {STAR,NatStar,STARC}_Int
9312 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
9313 STAR_subset <-- {STAR,NatStar,STARC}_subset
9314 STAR_mem <-- {STAR,NatStar,STARC}_mem
9315 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
9316 STAR_diff <-- {STAR,STARC}_diff
9317 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
9318 STARC_hcomplex_of_complex}_image_subset
9319 starset_n_Un <-- starset{Nat,C}_n_Un
9320 starset_n_Int <-- starset{Nat,C}_n_Int
9321 starset_n_Compl <-- starset{Nat,C}_n_Compl
9322 starset_n_diff <-- starset{Nat,C}_n_diff
9323 InternalSets_Un <-- Internal{Nat,C}Sets_Un
9324 InternalSets_Int <-- Internal{Nat,C}Sets_Int
9325 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
9326 InternalSets_diff <-- Internal{Nat,C}Sets_diff
9327 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
9328 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
9329 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
9330 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
9331 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
9332 starfun <-- starfun{Nat,Nat2,C,RC,CR}
9333 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
9334 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
9335 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
9336 starfun_diff <-- starfun{C,RC,CR}_diff
9337 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
9338 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
9339 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
9340 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
9341 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
9342 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
9343 starfun_Id <-- starfunC_Id
9344 starfun_approx <-- starfun{Nat,CR}_approx
9345 starfun_capprox <-- starfun{C,RC}_capprox
9346 starfun_abs <-- starfunNat_rabs
9347 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
9348 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
9349 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
9350 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
9351 starfun_add_capprox <-- starfun{C,RC}_add_capprox
9352 starfun_add_approx <-- starfunCR_add_approx
9353 starfun_inverse_inverse <-- starfunC_inverse_inverse
9354 starfun_divide <-- starfun{C,CR,RC}_divide
9355 starfun_n <-- starfun{Nat,C}_n
9356 starfun_n_mult <-- starfun{Nat,C}_n_mult
9357 starfun_n_add <-- starfun{Nat,C}_n_add
9358 starfun_n_add_minus <-- starfunNat_n_add_minus
9359 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
9360 starfun_n_minus <-- starfun{Nat,C}_n_minus
9361 starfun_n_eq <-- starfun{Nat,C}_n_eq
9363 star_n_add <-- {hypreal,hypnat,hcomplex}_add
9364 star_n_minus <-- {hypreal,hcomplex}_minus
9365 star_n_diff <-- {hypreal,hcomplex}_diff
9366 star_n_mult <-- {hypreal,hcomplex}_mult
9367 star_n_inverse <-- {hypreal,hcomplex}_inverse
9368 star_n_le <-- {hypreal,hypnat}_le
9369 star_n_less <-- {hypreal,hypnat}_less
9370 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
9371 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
9372 star_n_abs <-- hypreal_hrabs
9373 star_n_divide <-- hcomplex_divide
9375 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
9376 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
9377 star_of_diff <-- hypreal_of_real_diff
9378 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
9379 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
9380 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
9381 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
9382 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
9383 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
9384 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
9385 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
9386 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
9387 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
9388 star_of_number_of <-- {hypreal,hcomplex}_number_of
9389 star_of_number_less <-- number_of_less_hypreal_of_real_iff
9390 star_of_number_le <-- number_of_le_hypreal_of_real_iff
9391 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
9392 star_of_less_number <-- hypreal_of_real_less_number_of_iff
9393 star_of_le_number <-- hypreal_of_real_le_number_of_iff
9394 star_of_power <-- hypreal_of_real_power
9395 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
9397 * Hyperreal: new method "transfer" that implements the transfer
9398 principle of nonstandard analysis. With a subgoal that mentions
9399 nonstandard types like "'a star", the command "apply transfer"
9400 replaces it with an equivalent one that mentions only standard types.
9401 To be successful, all free variables must have standard types; non-
9402 standard variables must have explicit universal quantifiers.
9404 * Hyperreal: A theory of Taylor series.
9409 * Discontinued special version of 'constdefs' (which used to support
9410 continuous functions) in favor of the general Pure one with full
9413 * New simplification procedure for solving continuity conditions; it
9414 is much faster on terms with many nested lambda abstractions (cubic
9415 instead of exponential time).
9417 * New syntax for domain package: selector names are now optional.
9418 Parentheses should be omitted unless argument is lazy, for example:
9420 domain 'a stream = cons "'a" (lazy "'a stream")
9422 * New command 'fixrec' for defining recursive functions with pattern
9423 matching; defining multiple functions with mutual recursion is also
9424 supported. Patterns may include the constants cpair, spair, up, sinl,
9425 sinr, or any data constructor defined by the domain package. The given
9426 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
9427 syntax and examples.
9429 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
9430 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
9431 but the proof obligation additionally includes an admissibility
9432 requirement. The packages generate instances of class cpo or pcpo,
9433 with continuity and strictness theorems for Rep and Abs.
9435 * HOLCF: Many theorems have been renamed according to a more standard naming
9436 scheme (INCOMPATIBILITY):
9438 foo_inject: "foo$x = foo$y ==> x = y"
9439 foo_eq: "(foo$x = foo$y) = (x = y)"
9440 foo_less: "(foo$x << foo$y) = (x << y)"
9441 foo_strict: "foo$UU = UU"
9442 foo_defined: "... ==> foo$x ~= UU"
9443 foo_defined_iff: "(foo$x = UU) = (x = UU)"
9448 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
9449 including the First Isomorphism Theorem (on quotienting by the kernel
9452 * ZF/Simplifier: install second copy of type solver that actually
9453 makes use of TC rules declared to Isar proof contexts (or locales);
9454 the old version is still required for ML proof scripts.
9459 * Converted to Isar theory format; use locales instead of axiomatic
9465 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
9468 * Pure/library.ML no longer defines its own option datatype, but uses
9469 that of the SML basis, which has constructors NONE and SOME instead of
9470 None and Some, as well as exception Option.Option instead of OPTION.
9471 The functions the, if_none, is_some, is_none have been adapted
9472 accordingly, while Option.map replaces apsome.
9474 * Pure/library.ML: the exception LIST has been given up in favour of
9475 the standard exceptions Empty and Subscript, as well as
9476 Library.UnequalLengths. Function like Library.hd and Library.tl are
9477 superceded by the standard hd and tl functions etc.
9479 A number of basic list functions are no longer exported to the ML
9480 toplevel, as they are variants of predefined functions. The following
9481 suggests how one can translate existing code:
9483 rev_append xs ys = List.revAppend (xs, ys)
9484 nth_elem (i, xs) = List.nth (xs, i)
9485 last_elem xs = List.last xs
9486 flat xss = List.concat xss
9487 seq fs = List.app fs
9488 partition P xs = List.partition P xs
9489 mapfilter f xs = List.mapPartial f xs
9491 * Pure/library.ML: several combinators for linear functional
9492 transformations, notably reverse application and composition:
9495 (x, y) |-> f f #-> g
9497 * Pure/library.ML: introduced/changed precedence of infix operators:
9499 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
9501 infix 3 o oo ooo oooo;
9502 infix 4 ~~ upto downto;
9504 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
9507 * Pure/library.ML: natural list combinators fold, fold_rev, and
9508 fold_map support linear functional transformations and nesting. For
9511 fold f [x1, ..., xN] y =
9512 y |> f x1 |> ... |> f xN
9514 (fold o fold) f [xs1, ..., xsN] y =
9515 y |> fold f xs1 |> ... |> fold f xsN
9517 fold f [x1, ..., xN] =
9520 (fold o fold) f [xs1, ..., xsN] =
9521 fold f xs1 #> ... #> fold f xsN
9523 * Pure/library.ML: the following selectors on type 'a option are
9526 the: 'a option -> 'a (*partial*)
9527 these: 'a option -> 'a where 'a = 'b list
9528 the_default: 'a -> 'a option -> 'a
9529 the_list: 'a option -> 'a list
9531 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
9532 basic operations for association lists, following natural argument
9533 order; moreover the explicit equality predicate passed here avoids
9534 potentially expensive polymorphic runtime equality checks.
9535 The old functions may be expressed as follows:
9537 assoc = uncurry (AList.lookup (op =))
9538 assocs = these oo AList.lookup (op =)
9539 overwrite = uncurry (AList.update (op =)) o swap
9541 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
9543 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
9544 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
9546 replacing make_keylist and keyfilter (occassionally used)
9549 make_keylist = AList.make
9550 keyfilter = AList.find (op =)
9552 * eq_fst and eq_snd now take explicit equality parameter, thus
9553 avoiding eqtypes. Naive rewrites:
9555 eq_fst = eq_fst (op =)
9556 eq_snd = eq_snd (op =)
9558 * Removed deprecated apl and apr (rarely used).
9561 apl (n, op) =>>= curry op n
9562 apr (op, m) =>>= fn n => op (n, m)
9564 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
9565 provides a reasonably efficient light-weight implementation of sets as
9568 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
9569 few new operations; existing lookup and update are now curried to
9570 follow natural argument order (for use with fold etc.);
9571 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
9573 * Pure/General: output via the Isabelle channels of
9574 writeln/warning/error etc. is now passed through Output.output, with a
9575 hook for arbitrary transformations depending on the print_mode
9576 (cf. Output.add_mode -- the first active mode that provides a output
9577 function wins). Already formatted output may be embedded into further
9578 text via Output.raw; the result of Pretty.string_of/str_of and derived
9579 functions (string_of_term/cterm/thm etc.) is already marked raw to
9580 accommodate easy composition of diagnostic messages etc. Programmers
9581 rarely need to care about Output.output or Output.raw at all, with
9582 some notable exceptions: Output.output is required when bypassing the
9583 standard channels (writeln etc.), or in token translations to produce
9584 properly formatted results; Output.raw is required when capturing
9585 already output material that will eventually be presented to the user
9586 a second time. For the default print mode, both Output.output and
9587 Output.raw have no effect.
9589 * Pure/General: Output.time_accumulator NAME creates an operator ('a
9590 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
9591 cumulative results are displayed at the end of a batch session.
9593 * Pure/General: File.sysify_path and File.quote_sysify path have been
9594 replaced by File.platform_path and File.shell_path (with appropriate
9595 hooks). This provides a clean interface for unusual systems where the
9596 internal and external process view of file names are different.
9598 * Pure: more efficient orders for basic syntactic entities: added
9599 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
9600 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
9601 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
9602 orders now -- potential INCOMPATIBILITY for code that depends on a
9603 particular order for Symtab.keys, Symtab.dest, etc. (consider using
9604 Library.sort_strings on result).
9606 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
9607 fold_types traverse types/terms from left to right, observing natural
9608 argument order. Supercedes previous foldl_XXX versions, add_frees,
9609 add_vars etc. have been adapted as well: INCOMPATIBILITY.
9611 * Pure: name spaces have been refined, with significant changes of the
9612 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
9613 to extern(_table). The plain name entry path is superceded by a
9614 general 'naming' context, which also includes the 'policy' to produce
9615 a fully qualified name and external accesses of a fully qualified
9616 name; NameSpace.extend is superceded by context dependent
9617 Sign.declare_name. Several theory and proof context operations modify
9618 the naming context. Especially note Theory.restore_naming and
9619 ProofContext.restore_naming to get back to a sane state; note that
9620 Theory.add_path is no longer sufficient to recover from
9621 Theory.absolute_path in particular.
9623 * Pure: new flags short_names (default false) and unique_names
9624 (default true) for controlling output of qualified names. If
9625 short_names is set, names are printed unqualified. If unique_names is
9626 reset, the name prefix is reduced to the minimum required to achieve
9627 the original result when interning again, even if there is an overlap
9628 with earlier declarations.
9630 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
9631 now 'extend', and 'merge' gets an additional Pretty.pp argument
9632 (useful for printing error messages). INCOMPATIBILITY.
9634 * Pure: major reorganization of the theory context. Type Sign.sg and
9635 Theory.theory are now identified, referring to the universal
9636 Context.theory (see Pure/context.ML). Actual signature and theory
9637 content is managed as theory data. The old code and interfaces were
9638 spread over many files and structures; the new arrangement introduces
9639 considerable INCOMPATIBILITY to gain more clarity:
9641 Context -- theory management operations (name, identity, inclusion,
9642 parents, ancestors, merge, etc.), plus generic theory data;
9644 Sign -- logical signature and syntax operations (declaring consts,
9645 types, etc.), plus certify/read for common entities;
9647 Theory -- logical theory operations (stating axioms, definitions,
9648 oracles), plus a copy of logical signature operations (consts,
9649 types, etc.); also a few basic management operations (Theory.copy,
9652 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
9653 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
9654 for convenience -- they merely return the theory.
9656 * Pure: type Type.tsig is superceded by theory in most interfaces.
9658 * Pure: the Isar proof context type is already defined early in Pure
9659 as Context.proof (note that ProofContext.context and Proof.context are
9660 aliases, where the latter is the preferred name). This enables other
9661 Isabelle components to refer to that type even before Isar is present.
9663 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
9664 typeK, constK, axiomK, oracleK), but provide explicit operations for
9665 any of these kinds. For example, Sign.intern typeK is now
9666 Sign.intern_type, Theory.hide_space Sign.typeK is now
9667 Theory.hide_types. Also note that former
9668 Theory.hide_classes/types/consts are now
9669 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
9670 internalize their arguments! INCOMPATIBILITY.
9672 * Pure: get_thm interface (of PureThy and ProofContext) expects
9673 datatype thmref (with constructors Name and NameSelection) instead of
9674 plain string -- INCOMPATIBILITY;
9676 * Pure: cases produced by proof methods specify options, where NONE
9677 means to remove case bindings -- INCOMPATIBILITY in
9680 * Pure: the following operations retrieve axioms or theorems from a
9681 theory node or theory hierarchy, respectively:
9683 Theory.axioms_of: theory -> (string * term) list
9684 Theory.all_axioms_of: theory -> (string * term) list
9685 PureThy.thms_of: theory -> (string * thm) list
9686 PureThy.all_thms_of: theory -> (string * thm) list
9688 * Pure: print_tac now outputs the goal through the trace channel.
9690 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
9691 Reference Toplevel.debug (default false) controls detailed printing
9692 and tracing of low-level exceptions; Toplevel.profiling (default 0)
9693 controls execution profiling -- set to 1 for time and 2 for space
9694 (both increase the runtime).
9696 * Isar session: The initial use of ROOT.ML is now always timed,
9697 i.e. the log will show the actual process times, in contrast to the
9698 elapsed wall-clock time that the outer shell wrapper produces.
9700 * Simplifier: improved handling of bound variables (nameless
9701 representation, avoid allocating new strings). Simprocs that invoke
9702 the Simplifier recursively should use Simplifier.inherit_bounds to
9703 avoid local name clashes. Failure to do so produces warnings
9704 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
9705 for further details.
9707 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
9708 bindings for all theorems stored within a given theory; this may help
9709 in porting non-Isar theories to Isar ones, while keeping ML proof
9710 scripts for the time being.
9712 * ML operator HTML.with_charset specifies the charset begin used for
9713 generated HTML files. For example:
9715 HTML.with_charset "utf-8" use_thy "Hebrew";
9716 HTML.with_charset "utf-8" use_thy "Chinese";
9721 * Allow symlinks to all proper Isabelle executables (Isabelle,
9722 isabelle, isatool etc.).
9724 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
9725 isatool doc, isatool mkdir, display_drafts etc.).
9727 * isatool usedir: option -f allows specification of the ML file to be
9728 used by Isabelle; default is ROOT.ML.
9730 * New isatool version outputs the version identifier of the Isabelle
9731 distribution being used.
9733 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
9734 (containing Boolean satisfiability problems) into Isabelle/HOL
9739 New in Isabelle2004 (April 2004)
9740 --------------------------------
9744 * Provers/order.ML: new efficient reasoner for partial and linear orders.
9745 Replaces linorder.ML.
9747 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
9748 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
9749 (\<a>...\<z>), are now considered normal letters, and can therefore
9750 be used anywhere where an ASCII letter (a...zA...Z) has until
9751 now. COMPATIBILITY: This obviously changes the parsing of some
9752 terms, especially where a symbol has been used as a binder, say
9753 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
9754 as an identifier. Fix it by inserting a space around former
9755 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
9756 existing theory and ML files.
9758 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
9760 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
9761 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
9762 a normal (but invisible) letter. For multiple letter subscripts repeat
9763 \<^isub> like this: x\<^isub>1\<^isub>2.
9765 * Pure: There are now sub-/superscripts that can span more than one
9766 character. Text between \<^bsub> and \<^esub> is set in subscript in
9767 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
9768 superscript. The new control characters are not identifier parts.
9770 * Pure: Control-symbols of the form \<^raw:...> will literally print the
9771 content of "..." to the latex file instead of \isacntrl... . The "..."
9772 may consist of any printable characters excluding the end bracket >.
9774 * Pure: Using new Isar command "finalconsts" (or the ML functions
9775 Theory.add_finals or Theory.add_finals_i) it is now possible to
9776 declare constants "final", which prevents their being given a definition
9777 later. It is useful for constants whose behaviour is fixed axiomatically
9778 rather than definitionally, such as the meta-logic connectives.
9780 * Pure: 'instance' now handles general arities with general sorts
9781 (i.e. intersections of classes),
9783 * Presentation: generated HTML now uses a CSS style sheet to make layout
9784 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
9785 It can be changed to alter the colors/layout of generated pages.
9790 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
9791 cut_tac, subgoal_tac and thin_tac:
9792 - Now understand static (Isar) contexts. As a consequence, users of Isar
9793 locales are no longer forced to write Isar proof scripts.
9794 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
9796 - INCOMPATIBILITY: names of variables to be instantiated may no
9797 longer be enclosed in quotes. Instead, precede variable name with `?'.
9798 This is consistent with the instantiation attribute "where".
9800 * Attributes "where" and "of":
9801 - Now take type variables of instantiated theorem into account when reading
9802 the instantiation string. This fixes a bug that caused instantiated
9803 theorems to have too special types in some circumstances.
9804 - "where" permits explicit instantiations of type variables.
9806 * Calculation commands "moreover" and "also" no longer interfere with
9807 current facts ("this"), admitting arbitrary combinations with "then"
9811 - Goal statements involving the context element "includes" no longer
9812 generate theorems with internal delta predicates (those ending on
9813 "_axioms") in the premise.
9814 Resolve particular premise with <locale>.intro to obtain old form.
9815 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
9816 specification and "includes" elements in goal statement.
9817 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
9818 [intro?] and [elim?] (respectively) by default.
9819 - Experimental command for instantiation of locales in proof contexts:
9820 instantiate <label>[<attrs>]: <loc>
9821 Instantiates locale <loc> and adds all its theorems to the current context
9822 taking into account their attributes. Label and attrs are optional
9823 modifiers, like in theorem declarations. If present, names of
9824 instantiated theorems are qualified with <label>, and the attributes
9825 <attrs> are applied after any attributes these theorems might have already.
9826 If the locale has assumptions, a chained fact of the form
9827 "<loc> t1 ... tn" is expected from which instantiations of the parameters
9828 are derived. The command does not support old-style locales declared
9829 with "locale (open)".
9830 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
9832 * HOL: Tactic emulation methods induct_tac and case_tac understand static
9838 * Proof import: new image HOL4 contains the imported library from
9839 the HOL4 system with about 2500 theorems. It is imported by
9840 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
9841 can be used like any other Isabelle image. See
9842 HOL/Import/HOL/README for more information.
9845 - Much improved handling of linear and partial orders.
9846 Reasoners for linear and partial orders are set up for type classes
9847 "linorder" and "order" respectively, and are added to the default simpset
9848 as solvers. This means that the simplifier can build transitivity chains
9849 to solve goals from the assumptions.
9850 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
9851 of blast or auto after simplification become unnecessary because the goal
9852 is solved by simplification already.
9854 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
9855 all proved in axiomatic type classes for semirings, rings and fields.
9858 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
9859 now formalized using the Ring_and_Field theory mentioned above.
9860 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
9861 than before, because now they are set up once in a generic manner.
9862 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
9863 Look for the general versions in Ring_and_Field (and Power if they concern
9866 * Type "rat" of the rational numbers is now available in HOL-Complex.
9869 - Record types are now by default printed with their type abbreviation
9870 instead of the list of all field types. This can be configured via
9871 the reference "print_record_type_abbr".
9872 - Simproc "record_upd_simproc" for simplification of multiple updates added
9873 (not enabled by default).
9874 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
9875 EX x. x = sel r to True (not enabled by default).
9876 - Tactic "record_split_simp_tac" to split and simplify records added.
9878 * 'specification' command added, allowing for definition by
9879 specification. There is also an 'ax_specification' command that
9880 introduces the new constants axiomatically.
9882 * arith(_tac) is now able to generate counterexamples for reals as well.
9884 * HOL-Algebra: new locale "ring" for non-commutative rings.
9886 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
9887 definitions, thanks to Sava Krsti\'{c} and John Matthews.
9889 * HOL-Matrix: a first theory for matrices in HOL with an application of
9890 matrix theory to linear programming.
9892 * Unions and Intersections:
9893 The latex output syntax of UN and INT has been changed
9894 from "\Union x \in A. B" to "\Union_{x \in A} B"
9895 i.e. the index formulae has become a subscript.
9896 Similarly for "\Union x. B", and for \Inter instead of \Union.
9898 * Unions and Intersections over Intervals:
9899 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
9900 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
9901 like in normal math, and corresponding versions for < and for intersection.
9903 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
9904 lexicographic dictonary ordering has been added as "lexord".
9906 * ML: the legacy theory structures Int and List have been removed. They had
9907 conflicted with ML Basis Library structures having the same names.
9909 * 'refute' command added to search for (finite) countermodels. Only works
9910 for a fragment of HOL. The installation of an external SAT solver is
9911 highly recommended. See "HOL/Refute.thy" for details.
9913 * 'quickcheck' command: Allows to find counterexamples by evaluating
9914 formulae under an assignment of free variables to random values.
9915 In contrast to 'refute', it can deal with inductive datatypes,
9916 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
9922 * Streams now come with concatenation and are part of the HOLCF image
9926 New in Isabelle2003 (May 2003)
9927 ------------------------------
9931 * Provers/simplifier:
9933 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
9934 Assumptions are now subject to complete mutual simplification,
9935 not just from left to right. The simplifier now preserves
9936 the order of assumptions.
9938 Potential INCOMPATIBILITY:
9940 -- simp sometimes diverges where the old version did
9941 not, e.g. invoking simp on the goal
9943 [| P (f x); y = x; f x = f y |] ==> Q
9945 now gives rise to the infinite reduction sequence
9947 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
9949 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
9952 -- Tactics combining classical reasoner and simplification (such as auto)
9953 are also affected by this change, because many of them rely on
9954 simp. They may sometimes diverge as well or yield a different numbers
9955 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
9956 in case of problems. Sometimes subsequent calls to the classical
9957 reasoner will fail because a preceeding call to the simplifier too
9958 eagerly simplified the goal, e.g. deleted redundant premises.
9960 - The simplifier trace now shows the names of the applied rewrite rules
9962 - You can limit the number of recursive invocations of the simplifier
9963 during conditional rewriting (where the simplifie tries to solve the
9964 conditions before applying the rewrite rule):
9965 ML "simp_depth_limit := n"
9966 where n is an integer. Thus you can force termination where previously
9967 the simplifier would diverge.
9969 - Accepts free variables as head terms in congruence rules. Useful in Isar.
9971 - No longer aborts on failed congruence proof. Instead, the
9972 congruence is ignored.
9974 * Pure: New generic framework for extracting programs from constructive
9975 proofs. See HOL/Extraction.thy for an example instantiation, as well
9976 as HOL/Extraction for some case studies.
9978 * Pure: The main goal of the proof state is no longer shown by default, only
9979 the subgoals. This behaviour is controlled by a new flag.
9980 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
9981 (ML: Proof.show_main_goal).
9983 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
9984 rules whose conclusion matches subgoal 1:
9985 PG menu: Isabelle/Isar -> Show me -> matching rules
9986 The rules are ordered by how closely they match the subgoal.
9987 In particular, rules that solve a subgoal outright are displayed first
9988 (or rather last, the way they are printed).
9989 (ML: ProofGeneral.print_intros())
9991 * Pure: New flag trace_unify_fail causes unification to print
9992 diagnostic information (PG: in trace buffer) when it fails. This is
9993 useful for figuring out why single step proofs like rule, erule or
9996 * Pure: Locale specifications now produce predicate definitions
9997 according to the body of text (covering assumptions modulo local
9998 definitions); predicate "loc_axioms" covers newly introduced text,
9999 while "loc" is cumulative wrt. all included locale expressions; the
10000 latter view is presented only on export into the global theory
10001 context; potential INCOMPATIBILITY, use "(open)" option to fall back
10002 on the old view without predicates;
10004 * Pure: predefined locales "var" and "struct" are useful for sharing
10005 parameters (as in CASL, for example); just specify something like
10006 ``var x + var y + struct M'' as import;
10008 * Pure: improved thms_containing: proper indexing of facts instead of
10009 raw theorems; check validity of results wrt. current name space;
10010 include local facts of proof configuration (also covers active
10011 locales), cover fixed variables in index; may use "_" in term
10012 specification; an optional limit for the number of printed facts may
10013 be given (the default is 40);
10015 * Pure: disallow duplicate fact bindings within new-style theory files
10018 * Provers: improved induct method: assumptions introduced by case
10019 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
10020 the goal statement); "foo" still refers to all facts collectively;
10022 * Provers: the function blast.overloaded has been removed: all constants
10023 are regarded as potentially overloaded, which improves robustness in exchange
10024 for slight decrease in efficiency;
10026 * Provers/linorder: New generic prover for transitivity reasoning over
10027 linear orders. Note: this prover is not efficient!
10029 * Isar: preview of problems to finish 'show' now produce an error
10030 rather than just a warning (in interactive mode);
10037 - Produces a counter example if it cannot prove a goal.
10038 Note that the counter example may be spurious if the goal is not a formula
10039 of quantifier-free linear arithmetic.
10040 In ProofGeneral the counter example appears in the trace buffer.
10042 - Knows about div k and mod k where k is a numeral of type nat or int.
10044 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
10045 linear arithmetic fails. This takes account of quantifiers and divisibility.
10046 Presburger arithmetic can also be called explicitly via presburger(_tac).
10048 * simp's arithmetic capabilities have been enhanced a bit: it now
10049 takes ~= in premises into account (by performing a case split);
10051 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
10052 are distributed over a sum of terms;
10054 * New tactic "trans_tac" and method "trans" instantiate
10055 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
10056 "<=", "<" and "=").
10058 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
10059 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
10061 * 'typedef' command has new option "open" to suppress the set
10064 * functions Min and Max on finite sets have been introduced (theory
10067 * attribute [symmetric] now works for relations as well; it turns
10068 (x,y) : R^-1 into (y,x) : R, and vice versa;
10070 * induct over a !!-quantified statement (say !!x1..xn):
10071 each "case" automatically performs "fix x1 .. xn" with exactly those names.
10073 * Map: `empty' is no longer a constant but a syntactic abbreviation for
10074 %x. None. Warning: empty_def now refers to the previously hidden definition
10077 * Algebra: formalization of classical algebra. Intended as base for
10078 any algebraic development in Isabelle. Currently covers group theory
10079 (up to Sylow's theorem) and ring theory (Universal Property of
10080 Univariate Polynomials). Contributions welcome;
10082 * GroupTheory: deleted, since its material has been moved to Algebra;
10084 * Complex: new directory of the complex numbers with numeric constants,
10085 nonstandard complex numbers, and some complex analysis, standard and
10086 nonstandard (Jacques Fleuriot);
10088 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
10090 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
10093 * Real/HahnBanach: updated and adapted to locales;
10095 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
10098 * UNITY: added the Meier-Sanders theory of progress sets;
10100 * MicroJava: bytecode verifier and lightweight bytecode verifier
10101 as abstract algorithms, instantiated to the JVM;
10103 * Bali: Java source language formalization. Type system, operational
10104 semantics, axiomatic semantics. Supported language features:
10105 classes, interfaces, objects,virtual methods, static methods,
10106 static/instance fields, arrays, access modifiers, definite
10107 assignment, exceptions.
10112 * ZF/Constructible: consistency proof for AC (Gdel's constructible
10115 * Main ZF: virtually all theories converted to new-style format;
10120 * Pure: Tactic.prove provides sane interface for internal proofs;
10121 omits the infamous "standard" operation, so this is more appropriate
10122 than prove_goalw_cterm in many situations (e.g. in simprocs);
10124 * Pure: improved error reporting of simprocs;
10126 * Provers: Simplifier.simproc(_i) provides sane interface for setting
10130 *** Document preparation ***
10132 * uses \par instead of \\ for line breaks in theory text. This may
10133 shift some page breaks in large documents. To get the old behaviour
10134 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
10136 * minimized dependencies of isabelle.sty and isabellesym.sty on
10139 * \<euro> now needs package babel/greek instead of marvosym (which
10142 * normal size for \<zero>...\<nine> (uses \mathbf instead of
10147 New in Isabelle2002 (March 2002)
10148 --------------------------------
10150 *** Document preparation ***
10152 * greatly simplified document preparation setup, including more
10153 graceful interpretation of isatool usedir -i/-d/-D options, and more
10154 instructive isatool mkdir; users should basically be able to get
10155 started with "isatool mkdir HOL Test && isatool make"; alternatively,
10156 users may run a separate document processing stage manually like this:
10157 "isatool usedir -D output HOL Test && isatool document Test/output";
10159 * theory dependency graph may now be incorporated into documents;
10160 isatool usedir -g true will produce session_graph.eps/.pdf for use
10161 with \includegraphics of LaTeX;
10163 * proper spacing of consecutive markup elements, especially text
10164 blocks after section headings;
10166 * support bold style (for single symbols only), input syntax is like
10167 this: "\<^bold>\<alpha>" or "\<^bold>A";
10169 * \<bullet> is now output as bold \cdot by default, which looks much
10170 better in printed text;
10172 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
10173 note that these symbols are currently unavailable in Proof General /
10174 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
10176 * isatool latex no longer depends on changed TEXINPUTS, instead
10177 isatool document copies the Isabelle style files to the target
10183 * Pure/Provers: improved proof by cases and induction;
10184 - 'case' command admits impromptu naming of parameters (such as
10186 - 'induct' method divinates rule instantiation from the inductive
10187 claim; no longer requires excessive ?P bindings for proper
10188 instantiation of cases;
10189 - 'induct' method properly enumerates all possibilities of set/type
10190 rules; as a consequence facts may be also passed through *type*
10191 rules without further ado;
10192 - 'induct' method now derives symbolic cases from the *rulified*
10193 rule (before it used to rulify cases stemming from the internal
10194 atomized version); this means that the context of a non-atomic
10195 statement becomes is included in the hypothesis, avoiding the
10196 slightly cumbersome show "PROP ?case" form;
10197 - 'induct' may now use elim-style induction rules without chaining
10198 facts, using ``missing'' premises from the goal state; this allows
10199 rules stemming from inductive sets to be applied in unstructured
10200 scripts, while still benefitting from proper handling of non-atomic
10201 statements; NB: major inductive premises need to be put first, all
10202 the rest of the goal is passed through the induction;
10203 - 'induct' proper support for mutual induction involving non-atomic
10204 rule statements (uses the new concept of simultaneous goals, see
10206 - append all possible rule selections, but only use the first
10207 success (no backtracking);
10208 - removed obsolete "(simplified)" and "(stripped)" options of methods;
10209 - undeclared rule case names default to numbers 1, 2, 3, ...;
10210 - added 'print_induct_rules' (covered by help item in recent Proof
10212 - moved induct/cases attributes to Pure, methods to Provers;
10213 - generic method setup instantiated for FOL and HOL;
10215 * Pure: support multiple simultaneous goal statements, for example
10216 "have a: A and b: B" (same for 'theorem' etc.); being a pure
10217 meta-level mechanism, this acts as if several individual goals had
10218 been stated separately; in particular common proof methods need to be
10219 repeated in order to cover all claims; note that a single elimination
10220 step is *not* sufficient to establish the two conjunctions, so this
10223 assume "A & B" then have A and B .. (*".." fails*)
10225 better use "obtain" in situations as above; alternative refer to
10226 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
10228 * Pure: proper integration with ``locales''; unlike the original
10229 version by Florian Kammller, Isar locales package high-level proof
10230 contexts rather than raw logical ones (e.g. we admit to include
10231 attributes everywhere); operations on locales include merge and
10232 rename; support for implicit arguments (``structures''); simultaneous
10233 type-inference over imports and text; see also HOL/ex/Locales.thy for
10236 * Pure: the following commands have been ``localized'', supporting a
10237 target locale specification "(in name)": 'lemma', 'theorem',
10238 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
10239 stored both within the locale and at the theory level (exported and
10240 qualified by the locale name);
10242 * Pure: theory goals may now be specified in ``long'' form, with
10243 ad-hoc contexts consisting of arbitrary locale elements. for example
10244 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
10245 definitions may be given, too); the result is a meta-level rule with
10246 the context elements being discharged in the obvious way;
10248 * Pure: new proof command 'using' allows to augment currently used
10249 facts after a goal statement ('using' is syntactically analogous to
10250 'apply', but acts on the goal's facts only); this allows chained facts
10251 to be separated into parts given before and after a claim, as in
10252 ``from a and b have C using d and e <proof>'';
10254 * Pure: renamed "antecedent" case to "rule_context";
10256 * Pure: new 'judgment' command records explicit information about the
10257 object-logic embedding (used by several tools internally); no longer
10258 use hard-wired "Trueprop";
10260 * Pure: added 'corollary' command;
10262 * Pure: fixed 'token_translation' command;
10264 * Pure: removed obsolete 'exported' attribute;
10266 * Pure: dummy pattern "_" in is/let is now automatically lifted over
10267 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
10268 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
10270 * Pure: method 'atomize' presents local goal premises as object-level
10271 statements (atomic meta-level propositions); setup controlled via
10272 rewrite rules declarations of 'atomize' attribute; example
10273 application: 'induct' method with proper rule statements in improper
10276 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
10277 now consider the syntactic context of assumptions, giving a better
10278 chance to get type-inference of the arguments right (this is
10279 especially important for locales);
10281 * Pure: "sorry" no longer requires quick_and_dirty in interactive
10284 * Pure/obtain: the formal conclusion "thesis", being marked as
10285 ``internal'', may no longer be reference directly in the text;
10286 potential INCOMPATIBILITY, may need to use "?thesis" in rare
10289 * Pure: generic 'sym' attribute which declares a rule both as pure
10290 'elim?' and for the 'symmetric' operation;
10292 * Pure: marginal comments ``--'' may now occur just anywhere in the
10293 text; the fixed correlation with particular command syntax has been
10296 * Pure: new method 'rules' is particularly well-suited for proof
10297 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
10298 but often produces more compact proof terms with less detours;
10300 * Pure/Provers/classical: simplified integration with pure rule
10301 attributes and methods; the classical "intro?/elim?/dest?"
10302 declarations coincide with the pure ones; the "rule" method no longer
10303 includes classically swapped intros; "intro" and "elim" methods no
10304 longer pick rules from the context; also got rid of ML declarations
10305 AddXIs/AddXEs/AddXDs; all of this has some potential for
10308 * Provers/classical: attribute 'swapped' produces classical inversions
10309 of introduction rules;
10311 * Provers/simplifier: 'simplified' attribute may refer to explicit
10312 rules instead of full simplifier context; 'iff' attribute handles
10315 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
10317 * HOL: 'recdef' now fails on unfinished automated proofs, use
10318 "(permissive)" option to recover old behavior;
10320 * HOL: 'inductive' no longer features separate (collective) attributes
10321 for 'intros' (was found too confusing);
10323 * HOL: properly declared induction rules less_induct and
10329 * HOL: moved over to sane numeral syntax; the new policy is as
10332 - 0 and 1 are polymorphic constants, which are defined on any
10333 numeric type (nat, int, real etc.);
10335 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
10336 binary representation internally;
10338 - type nat has special constructor Suc, and generally prefers Suc 0
10339 over 1::nat and Suc (Suc 0) over 2::nat;
10341 This change may cause significant problems of INCOMPATIBILITY; here
10342 are some hints on converting existing sources:
10344 - due to the new "num" token, "-0" and "-1" etc. are now atomic
10345 entities, so expressions involving "-" (unary or binary minus) need
10346 to be spaced properly;
10348 - existing occurrences of "1" may need to be constraint "1::nat" or
10349 even replaced by Suc 0; similar for old "2";
10351 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
10353 - remove all special provisions on numerals in proofs;
10355 * HOL: simp rules nat_number expand numerals on nat to Suc/0
10356 representation (depends on bin_arith_simps in the default context);
10358 * HOL: symbolic syntax for x^2 (numeral 2);
10360 * HOL: the class of all HOL types is now called "type" rather than
10361 "term"; INCOMPATIBILITY, need to adapt references to this type class
10362 in axclass/classes, instance/arities, and (usually rare) occurrences
10363 in typings (of consts etc.); internally the class is called
10364 "HOL.type", ML programs should refer to HOLogic.typeS;
10366 * HOL/record package improvements:
10367 - new derived operations "fields" to build a partial record section,
10368 "extend" to promote a fixed record to a record scheme, and
10369 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
10370 declared as simp by default;
10371 - shared operations ("more", "fields", etc.) now need to be always
10372 qualified) --- potential INCOMPATIBILITY;
10373 - removed "make_scheme" operations (use "make" with "extend") --
10375 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
10376 - provides cases/induct rules for use with corresponding Isar
10377 methods (for concrete records, record schemes, concrete more
10378 parts, and schematic more parts -- in that order);
10379 - internal definitions directly based on a light-weight abstract
10380 theory of product types over typedef rather than datatype;
10382 * HOL: generic code generator for generating executable ML code from
10383 specifications; specific support for HOL constructs such as inductive
10384 datatypes and sets, as well as recursive functions; can be invoked
10385 via 'generate_code' theory section;
10387 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
10389 * HOL: consolidated and renamed several theories. In particular:
10390 Ord.thy has been absorbed into HOL.thy
10391 String.thy has been absorbed into List.thy
10393 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
10394 (beware of argument permutation!);
10396 * HOL: linorder_less_split superseded by linorder_cases;
10398 * HOL/List: "nodups" renamed to "distinct";
10400 * HOL: added "The" definite description operator; move Hilbert's "Eps"
10401 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
10402 - Ex_def has changed, now need to use some_eq_ex
10404 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
10405 in this (rare) case use:
10407 delSWrapper "split_all_tac"
10408 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
10410 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
10413 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
10414 Isabelle's type classes, ^ on functions and relations has too general
10415 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
10416 necessary to attach explicit type constraints;
10418 * HOL/Relation: the prefix name of the infix "O" has been changed from
10419 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
10420 renamed accordingly (eg "compI" -> "rel_compI").
10422 * HOL: syntax translations now work properly with numerals and records
10425 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
10426 of "lam" -- INCOMPATIBILITY;
10428 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
10429 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
10430 renamed "Product_Type.unit";
10432 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
10434 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
10435 the "cases" method);
10437 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
10440 * HOL/IMP: updated and converted to new-style theory format; several
10441 parts turned into readable document, with proper Isar proof texts and
10442 some explanations (by Gerwin Klein);
10444 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
10446 * HOL-Hyperreal is now a logic image;
10451 * Isar: consts/constdefs supports mixfix syntax for continuous
10454 * Isar: domain package adapted to new-style theory format, e.g. see
10457 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
10458 potential INCOMPATIBILITY; now use plain induct_tac instead of former
10459 lift.induct_tac, always use UU instead of Undef;
10461 * HOLCF/IMP: updated and converted to new-style theory;
10466 * Isar: proper integration of logic-specific tools and packages,
10467 including theory commands '(co)inductive', '(co)datatype',
10468 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
10469 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
10471 * theory Main no longer includes AC; for the Axiom of Choice, base
10472 your theory on Main_ZFC;
10474 * the integer library now covers quotients and remainders, with many
10475 laws relating division to addition, multiplication, etc.;
10477 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
10478 typeless version of the formalism;
10480 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
10483 * ZF/Induct: new directory for examples of inductive definitions,
10484 including theory Multiset for multiset orderings; converted to
10485 new-style theory format;
10487 * ZF: many new theorems about lists, ordinals, etc.;
10492 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
10493 variable proof controls level of detail: 0 = no proofs (only oracle
10494 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
10495 also ref manual for further ML interfaces;
10497 * Pure/axclass: removed obsolete ML interface
10498 goal_subclass/goal_arity;
10500 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
10501 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
10502 separate tokens, so expressions involving minus need to be spaced
10505 * Pure/syntax: support non-oriented infixes, using keyword "infix"
10506 rather than "infixl" or "infixr";
10508 * Pure/syntax: concrete syntax for dummy type variables admits genuine
10509 sort constraint specifications in type inference; e.g. "x::_::foo"
10510 ensures that the type of "x" is of sort "foo" (but not necessarily a
10513 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
10514 control output of nested => (types); the default behavior is
10517 * Pure/syntax: builtin parse translation for "_constify" turns valued
10518 tokens into AST constants;
10520 * Pure/syntax: prefer later declarations of translations and print
10521 translation functions; potential INCOMPATIBILITY: need to reverse
10522 multiple declarations for same syntax element constant;
10524 * Pure/show_hyps reset by default (in accordance to existing Isar
10527 * Provers/classical: renamed addaltern to addafter, addSaltern to
10530 * Provers/clasimp: ``iff'' declarations now handle conditional rules
10533 * system: tested support for MacOS X; should be able to get Isabelle +
10534 Proof General to work in a plain Terminal after installing Poly/ML
10535 (e.g. from the Isabelle distribution area) and GNU bash alone
10536 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
10537 support requires further installations, e.g. from
10538 http://fink.sourceforge.net/);
10540 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
10542 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
10543 of 40 MB), cf. ML_OPTIONS;
10545 * system: Proof General keywords specification is now part of the
10546 Isabelle distribution (see etc/isar-keywords.el);
10548 * system: support for persistent Proof General sessions (refrain from
10549 outdating all loaded theories on startup); user may create writable
10550 logic images like this: ``isabelle -q HOL Test'';
10552 * system: smart selection of Isabelle process versus Isabelle
10553 interface, accommodates case-insensitive file systems (e.g. HFS+); may
10554 run both "isabelle" and "Isabelle" even if file names are badly
10555 damaged (executable inspects the case of the first letter of its own
10556 name); added separate "isabelle-process" and "isabelle-interface";
10558 * system: refrain from any attempt at filtering input streams; no
10559 longer support ``8bit'' encoding of old isabelle font, instead proper
10560 iso-latin characters may now be used; the related isatools
10561 "symbolinput" and "nonascii" have disappeared as well;
10563 * system: removed old "xterm" interface (the print modes "xterm" and
10564 "xterm_color" are still available for direct use in a suitable
10569 New in Isabelle99-2 (February 2001)
10570 -----------------------------------
10572 *** Overview of INCOMPATIBILITIES ***
10574 * HOL: please note that theories in the Library and elsewhere often use the
10575 new-style (Isar) format; to refer to their theorems in an ML script you must
10576 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
10578 * HOL: inductive package no longer splits induction rule aggressively,
10579 but only as far as specified by the introductions given; the old
10580 format may be recovered via ML function complete_split_rule or attribute
10581 'split_rule (complete)';
10583 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
10584 gfp_Tarski to gfp_unfold;
10586 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
10588 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
10589 relation); infix "^^" has been renamed "``"; infix "``" has been
10590 renamed "`"; "univalent" has been renamed "single_valued";
10592 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
10595 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
10597 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
10599 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
10600 consequence, it is no longer monotonic wrt. the local goal context
10601 (which is now passed through the inductive cases);
10603 * Document preparation: renamed standard symbols \<ll> to \<lless> and
10604 \<gg> to \<ggreater>;
10607 *** Document preparation ***
10609 * \isabellestyle{NAME} selects version of Isabelle output (currently
10610 available: are "it" for near math-mode best-style output, "sl" for
10611 slanted text style, and "tt" for plain type-writer; if no
10612 \isabellestyle command is given, output is according to slanted
10615 * support sub/super scripts (for single symbols only), input syntax is
10616 like this: "A\<^sup>*" or "A\<^sup>\<star>";
10618 * some more standard symbols; see Appendix A of the system manual for
10619 the complete list of symbols defined in isabellesym.sty;
10621 * improved isabelle style files; more abstract symbol implementation
10622 (should now use \isamath{...} and \isatext{...} in custom symbol
10625 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
10626 state; Note that presentation of goal states does not conform to
10627 actual human-readable proof documents. Please do not include goal
10628 states into document output unless you really know what you are doing!
10630 * proper indentation of antiquoted output with proportional LaTeX
10633 * no_document ML operator temporarily disables LaTeX document
10636 * isatool unsymbolize tunes sources for plain ASCII communication;
10641 * Pure: Isar now suffers initial goal statements to contain unbound
10642 schematic variables (this does not conform to actual readable proof
10643 documents, due to unpredictable outcome and non-compositional proof
10644 checking); users who know what they are doing may use schematic goals
10645 for Prolog-style synthesis of proven results;
10647 * Pure: assumption method (an implicit finishing) now handles actual
10650 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
10651 initial goal, declare "that" only as Pure intro (only for single
10652 steps); the "that" rule assumption may now be involved in implicit
10653 finishing, thus ".." becomes a feasible for trivial obtains;
10655 * Pure: default proof step now includes 'intro_classes'; thus trivial
10656 instance proofs may be performed by "..";
10658 * Pure: ?thesis / ?this / "..." now work for pure meta-level
10659 statements as well;
10661 * Pure: more robust selection of calculational rules;
10663 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
10664 rule (as well as the assumption rule);
10666 * Pure: 'thm_deps' command visualizes dependencies of theorems and
10667 lemmas, using the graph browser tool;
10669 * Pure: predict failure of "show" in interactive mode;
10671 * Pure: 'thms_containing' now takes actual terms as arguments;
10673 * HOL: improved method 'induct' --- now handles non-atomic goals
10674 (potential INCOMPATIBILITY); tuned error handling;
10676 * HOL: cases and induct rules now provide explicit hints about the
10677 number of facts to be consumed (0 for "type" and 1 for "set" rules);
10678 any remaining facts are inserted into the goal verbatim;
10680 * HOL: local contexts (aka cases) may now contain term bindings as
10681 well; the 'cases' and 'induct' methods new provide a ?case binding for
10682 the result to be shown in each case;
10684 * HOL: added 'recdef_tc' command;
10686 * isatool convert assists in eliminating legacy ML scripts;
10691 * HOL/Library: a collection of generic theories to be used together
10692 with main HOL; the theory loader path already includes this directory
10693 by default; the following existing theories have been moved here:
10694 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
10695 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
10697 * HOL/Unix: "Some aspects of Unix file-system security", a typical
10698 modelling and verification task performed in Isabelle/HOL +
10699 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
10701 * HOL/Algebra: special summation operator SUM no longer exists, it has
10702 been replaced by setsum; infix 'assoc' now has priority 50 (like
10703 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
10704 'domain', this makes the theory consistent with mathematical
10707 * HOL basics: added overloaded operations "inverse" and "divide"
10708 (infix "/"), syntax for generic "abs" operation, generic summation
10711 * HOL/typedef: simplified package, provide more useful rules (see also
10714 * HOL/datatype: induction rule for arbitrarily branching datatypes is
10715 now expressed as a proper nested rule (old-style tactic scripts may
10716 require atomize_strip_tac to cope with non-atomic premises);
10718 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
10719 to "split_conv" (old name still available for compatibility);
10721 * HOL: improved concrete syntax for strings (e.g. allows translation
10722 rules with string literals);
10724 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
10725 and Fleuriot's mechanization of analysis, including the transcendental
10726 functions for the reals;
10728 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
10733 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
10734 "lam" is displayed as TWO lambda-symbols
10736 * CTT: theory Main now available, containing everything (that is, Bool
10742 * Pure: the Simplifier has been implemented properly as a derived rule
10743 outside of the actual kernel (at last!); the overall performance
10744 penalty in practical applications is about 50%, while reliability of
10745 the Isabelle inference kernel has been greatly improved;
10747 * print modes "brackets" and "no_brackets" control output of nested =>
10748 (types) and ==> (props); the default behaviour is "brackets";
10750 * Provers: fast_tac (and friends) now handle actual object-logic rules
10751 as assumptions as well;
10753 * system: support Poly/ML 4.0;
10755 * system: isatool install handles KDE version 1 or 2;
10759 New in Isabelle99-1 (October 2000)
10760 ----------------------------------
10762 *** Overview of INCOMPATIBILITIES ***
10764 * HOL: simplification of natural numbers is much changed; to partly
10765 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
10766 issue the following ML commands:
10768 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
10769 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
10771 * HOL: simplification no longer dives into case-expressions; this is
10772 controlled by "t.weak_case_cong" for each datatype t;
10774 * HOL: nat_less_induct renamed to less_induct;
10776 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
10777 fixsome to patch .thy and .ML sources automatically;
10779 select_equality -> some_equality
10780 select_eq_Ex -> some_eq_ex
10781 selectI2EX -> someI2_ex
10784 select1_equality -> some1_equality
10785 Eps_sym_eq -> some_sym_eq_trivial
10786 Eps_eq -> some_eq_trivial
10788 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
10790 * HOL: removed obsolete theorem binding expand_if (refer to split_if
10793 * HOL: the recursion equations generated by 'recdef' are now called
10794 f.simps instead of f.rules;
10796 * HOL: qed_spec_mp now also handles bounded ALL as well;
10798 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
10799 sometimes be needed;
10801 * HOL: the constant for "f``x" is now "image" rather than "op ``";
10803 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
10805 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
10806 product is now "<*>" instead of "Times"; the lexicographic product is
10807 now "<*lex*>" instead of "**";
10809 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
10810 of main HOL, but was unused); better use HOL's datatype package;
10812 * HOL: removed "symbols" syntax for constant "override" of theory Map;
10813 the old syntax may be recovered as follows:
10816 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
10817 (infixl "\\<oplus>" 100)
10819 * HOL/Real: "rabs" replaced by overloaded "abs" function;
10821 * HOL/ML: even fewer consts are declared as global (see theories Ord,
10822 Lfp, Gfp, WF); this only affects ML packages that refer to const names
10825 * HOL and ZF: syntax for quotienting wrt an equivalence relation
10826 changed from A/r to A//r;
10828 * ZF: new treatment of arithmetic (nat & int) may break some old
10831 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
10832 rulify -> rule_format, elimify -> elim_format, ...);
10834 * Isar/Provers: intro/elim/dest attributes changed; renamed
10835 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
10836 should have to change intro!! to intro? only); replaced "delrule" by
10839 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
10841 * Provers: strengthened force_tac by using new first_best_tac;
10843 * LaTeX document preparation: several changes of isabelle.sty (see
10847 *** Document preparation ***
10849 * formal comments (text blocks etc.) in new-style theories may now
10850 contain antiquotations of thm/prop/term/typ/text to be presented
10851 according to latex print mode; concrete syntax is like this:
10852 @{term[show_types] "f(x) = a + x"};
10854 * isatool mkdir provides easy setup of Isabelle session directories,
10855 including proper document sources;
10857 * generated LaTeX sources are now deleted after successful run
10858 (isatool document -c); may retain a copy somewhere else via -D option
10861 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
10862 style files, achieving self-contained LaTeX sources and simplifying
10865 * old-style theories now produce (crude) LaTeX output as well;
10867 * browser info session directories are now self-contained (may be put
10868 on WWW server seperately); improved graphs of nested sessions; removed
10869 graph for 'all sessions';
10871 * several improvements in isabelle style files; \isabellestyle{it}
10872 produces fake math mode output; \isamarkupheader is now \section by
10873 default; see lib/texinputs/isabelle.sty etc.;
10878 * Isar/Pure: local results and corresponding term bindings are now
10879 subject to Hindley-Milner polymorphism (similar to ML); this
10880 accommodates incremental type-inference very nicely;
10882 * Isar/Pure: new derived language element 'obtain' supports
10883 generalized existence reasoning;
10885 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
10886 support accumulation of results, without applying any rules yet;
10887 useful to collect intermediate results without explicit name
10888 references, and for use with transitivity rules with more than 2
10891 * Isar/Pure: scalable support for case-analysis type proofs: new
10892 'case' language element refers to local contexts symbolically, as
10893 produced by certain proof methods; internally, case names are attached
10894 to theorems as "tags";
10896 * Isar/Pure: theory command 'hide' removes declarations from
10897 class/type/const name spaces;
10899 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
10900 indicate potential overloading;
10902 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
10904 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
10905 "{a,b,c}" instead of {a,b,c};
10907 * Isar/Pure now provides its own version of intro/elim/dest
10908 attributes; useful for building new logics, but beware of confusion
10909 with the version in Provers/classical;
10911 * Isar/Pure: the local context of (non-atomic) goals is provided via
10912 case name 'antecedent';
10914 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
10915 to the current context is now done automatically);
10917 * Isar/Pure: theory command 'method_setup' provides a simple interface
10918 for definining proof methods in ML;
10920 * Isar/Provers: intro/elim/dest attributes changed; renamed
10921 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
10922 most cases, one should have to change intro!! to intro? only);
10923 replaced "delrule" by "rule del";
10925 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
10926 'symmetric' attribute (the latter supercedes [RS sym]);
10928 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
10929 method modifier); 'simp' method: 'only:' modifier removes loopers as
10930 well (including splits);
10932 * Isar/Provers: Simplifier and Classical methods now support all kind
10933 of modifiers used in the past, including 'cong', 'iff', etc.
10935 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
10936 of Simplifier and Classical reasoner);
10938 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
10939 now support named cases; major packages (inductive, datatype, primrec,
10940 recdef) support case names and properly name parameters;
10942 * Isar/HOL: new transitivity rules for substitution in inequalities --
10943 monotonicity conditions are extracted to be proven at end of
10946 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
10949 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
10950 split_if split_if_asm; datatype package provides theorems foo.splits =
10951 foo.split foo.split_asm for each datatype;
10953 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
10954 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
10955 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
10956 use "(cases (simplified))" method in proper proof texts);
10958 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
10960 * Isar: names of theorems etc. may be natural numbers as well;
10962 * Isar: 'pr' command: optional arguments for goals_limit and
10963 ProofContext.prems_limit; no longer prints theory contexts, but only
10966 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
10967 additional print modes to be specified; e.g. "pr(latex)" will print
10968 proof state according to the Isabelle LaTeX style;
10970 * Isar: improved support for emulating tactic scripts, including proof
10971 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
10972 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
10973 (for HOL datatypes);
10975 * Isar: simplified (more robust) goal selection of proof methods: 1st
10976 goal, all goals, or explicit goal specifier (tactic emulation); thus
10977 'proof method scripts' have to be in depth-first order;
10979 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
10981 * Isar: removed 'help' command, which hasn't been too helpful anyway;
10982 should instead use individual commands for printing items
10983 (print_commands, print_methods etc.);
10985 * Isar: added 'nothing' --- the empty list of theorems;
10990 * HOL/MicroJava: formalization of a fragment of Java, together with a
10991 corresponding virtual machine and a specification of its bytecode
10992 verifier and a lightweight bytecode verifier, including proofs of
10993 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
10994 Cornelia Pusch (see also the homepage of project Bali at
10995 http://isabelle.in.tum.de/Bali/);
10997 * HOL/Algebra: new theory of rings and univariate polynomials, by
11000 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
11001 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
11004 * HOL/Lattice: fundamental concepts of lattice theory and order
11005 structures, including duals, properties of bounds versus algebraic
11006 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
11007 Theorem for complete lattices etc.; may also serve as a demonstration
11008 for abstract algebraic reasoning using axiomatic type classes, and
11009 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
11011 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
11014 * HOL/IMPP: extension of IMP with local variables and mutually
11015 recursive procedures, by David von Oheimb;
11017 * HOL/Lambda: converted into new-style theory and document;
11019 * HOL/ex/Multiquote: example of multiple nested quotations and
11020 anti-quotations -- basically a generalized version of de-Bruijn
11021 representation; very useful in avoiding lifting of operations;
11023 * HOL/record: added general record equality rule to simpset; fixed
11024 select-update simplification procedure to handle extended records as
11025 well; admit "r" as field name;
11027 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
11028 other numeric types and also as the identity of groups, rings, etc.;
11030 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
11031 Types nat and int belong to this axclass;
11033 * HOL: greatly improved simplification involving numerals of type nat, int, real:
11034 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
11035 i*j + k + j*#3*i simplifies to #4*(i*j) + k
11036 two terms #m*u and #n*u are replaced by #(m+n)*u
11037 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
11038 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
11039 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
11041 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
11042 powerful prover for predicate logic but knows nothing of clasets; see
11043 ex/mesontest.ML and ex/mesontest2.ML for example applications;
11045 * HOL: new version of "case_tac" subsumes both boolean case split and
11046 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
11047 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
11049 * HOL: simplification no longer dives into case-expressions: only the
11050 selector expression is simplified, but not the remaining arms; to
11051 enable full simplification of case-expressions for datatype t, you may
11052 remove t.weak_case_cong from the simpset, either globally (Delcongs
11053 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
11055 * HOL/recdef: the recursion equations generated by 'recdef' for
11056 function 'f' are now called f.simps instead of f.rules; if all
11057 termination conditions are proved automatically, these simplification
11058 rules are added to the simpset, as in primrec; rules may be named
11059 individually as well, resulting in a separate list of theorems for
11062 * HOL/While is a new theory that provides a while-combinator. It
11063 permits the definition of tail-recursive functions without the
11064 provision of a termination measure. The latter is necessary once the
11065 invariant proof rule for while is applied.
11067 * HOL: new (overloaded) notation for the set of elements below/above
11068 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
11070 * HOL: theorems impI, allI, ballI bound as "strip";
11072 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
11073 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
11074 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
11076 * HOL/Real: "rabs" replaced by overloaded "abs" function;
11078 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
11079 main HOL, but was unused);
11081 * HOL: fewer consts declared as global (e.g. have to refer to
11082 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
11084 * HOL: tuned AST representation of nested pairs, avoiding bogus output
11085 in case of overlap with user translations (e.g. judgements over
11086 tuples); (note that the underlying logical represenation is still
11092 * ZF: simplification automatically cancels common terms in arithmetic
11093 expressions over nat and int;
11095 * ZF: new treatment of nat to minimize type-checking: all operators
11096 coerce their operands to a natural number using the function natify,
11097 making the algebraic laws unconditional;
11099 * ZF: as above, for int: operators coerce their operands to an integer
11100 using the function intify;
11102 * ZF: the integer library now contains many of the usual laws for the
11103 orderings, including $<=, and monotonicity laws for $+ and $*;
11105 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
11108 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
11109 to the simplifier and classical reasoner simultaneously;
11114 * Provers: blast_tac now handles actual object-logic rules as
11115 assumptions; note that auto_tac uses blast_tac internally as well;
11117 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
11118 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
11120 * Provers: delrules now handles destruct rules as well (no longer need
11121 explicit make_elim);
11123 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
11124 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
11125 use instead the strong form,
11126 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
11127 in HOL, FOL and ZF the function cla_make_elim will create such rules
11128 from destruct-rules;
11130 * Provers: Simplifier.easy_setup provides a fast path to basic
11131 Simplifier setup for new object-logics;
11133 * Pure: AST translation rules no longer require constant head on LHS;
11135 * Pure: improved name spaces: ambiguous output is qualified; support
11136 for hiding of names;
11138 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
11139 XSYMBOL_HOME; no longer need to do manual configuration in most
11142 * system: compression of ML heaps images may now be controlled via -c
11143 option of isabelle and isatool usedir (currently only observed by
11146 * system: isatool installfonts may handle X-Symbol fonts as well (very
11147 useful for remote X11);
11149 * system: provide TAGS file for Isabelle sources;
11151 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
11154 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
11155 timing flag supersedes proof_timing and Toplevel.trace;
11157 * ML: new combinators |>> and |>>> for incremental transformations
11158 with secondary results (e.g. certain theory extensions):
11160 * ML: PureThy.add_defs gets additional argument to indicate potential
11161 overloading (usually false);
11163 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
11168 New in Isabelle99 (October 1999)
11169 --------------------------------
11171 *** Overview of INCOMPATIBILITIES (see below for more details) ***
11173 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
11174 are no longer simplified. (This allows the simplifier to unfold recursive
11175 functional programs.) To restore the old behaviour, declare
11177 Delcongs [if_weak_cong];
11179 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
11182 * HOL: the predicate "inj" is now defined by translation to "inj_on";
11184 * HOL/datatype: mutual_induct_tac no longer exists --
11185 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
11187 * HOL/typedef: fixed type inference for representing set; type
11188 arguments now have to occur explicitly on the rhs as type constraints;
11190 * ZF: The con_defs part of an inductive definition may no longer refer
11191 to constants declared in the same theory;
11193 * HOL, ZF: the function mk_cases, generated by the inductive
11194 definition package, has lost an argument. To simplify its result, it
11195 uses the default simpset instead of a supplied list of theorems.
11197 * HOL/List: the constructors of type list are now Nil and Cons;
11199 * Simplifier: the type of the infix ML functions
11200 setSSolver addSSolver setSolver addSolver
11201 is now simpset * solver -> simpset where `solver' is a new abstract type
11202 for packaging solvers. A solver is created via
11203 mk_solver: string -> (thm list -> int -> tactic) -> solver
11204 where the string argument is only a comment.
11207 *** Proof tools ***
11209 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
11210 decision procedure for linear arithmetic. Currently it is used for
11211 types `nat', `int', and `real' in HOL (see below); it can, should and
11212 will be instantiated for other types and logics as well.
11214 * The simplifier now accepts rewrite rules with flexible heads, eg
11215 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
11216 They are applied like any rule with a non-pattern lhs, i.e. by first-order
11222 * New Isabelle/Isar subsystem provides an alternative to traditional
11223 tactical theorem proving; together with the ProofGeneral/isar user
11224 interface it offers an interactive environment for developing human
11225 readable proof documents (Isar == Intelligible semi-automated
11226 reasoning); for further information see isatool doc isar-ref,
11227 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
11229 * improved and simplified presentation of theories: better HTML markup
11230 (including colors), graph views in several sizes; isatool usedir now
11231 provides a proper interface for user theories (via -P option); actual
11232 document preparation based on (PDF)LaTeX is available as well (for
11233 new-style theories only); see isatool doc system for more information;
11235 * native support for Proof General, both for classic Isabelle and
11238 * ML function thm_deps visualizes dependencies of theorems and lemmas,
11239 using the graph browser tool;
11241 * Isabelle manuals now also available as PDF;
11243 * theory loader rewritten from scratch (may not be fully
11244 bug-compatible); old loadpath variable has been replaced by show_path,
11245 add_path, del_path, reset_path functions; new operations such as
11246 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
11249 * improved isatool install: option -k creates KDE application icon,
11250 option -p DIR installs standalone binaries;
11252 * added ML_PLATFORM setting (useful for cross-platform installations);
11253 more robust handling of platform specific ML images for SML/NJ;
11255 * the settings environment is now statically scoped, i.e. it is never
11256 created again in sub-processes invoked from isabelle, isatool, or
11259 * path element specification '~~' refers to '$ISABELLE_HOME';
11261 * in locales, the "assumes" and "defines" parts may be omitted if
11264 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
11267 * new print_mode "HTML";
11269 * new flag show_tags controls display of tags of theorems (which are
11270 basically just comments that may be attached by some tools);
11272 * Isamode 2.6 requires patch to accomodate change of Isabelle font
11273 mode and goal output format:
11275 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
11277 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
11279 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
11280 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
11282 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
11284 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
11286 * function bind_thms stores lists of theorems (cf. bind_thm);
11288 * new shorthand tactics ftac, eatac, datac, fatac;
11290 * qed (and friends) now accept "" as result name; in that case the
11291 theorem is not stored, but proper checks and presentation of the
11292 result still apply;
11294 * theorem database now also indexes constants "Trueprop", "all",
11295 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
11300 ** HOL arithmetic **
11302 * There are now decision procedures for linear arithmetic over nat and
11305 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
11306 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
11307 are treated as atomic; subformulae not involving type `nat' or `int'
11308 are ignored; quantified subformulae are ignored unless they are
11309 positive universal or negative existential. The tactic has to be
11310 invoked by hand and can be a little bit slow. In particular, the
11311 running time is exponential in the number of occurrences of `min' and
11312 `max', and `-' on `nat'.
11314 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
11315 (negated) (in)equalities among the premises and the conclusion into
11316 account (i.e. no compound formulae) and does not know about `min' and
11317 `max', and `-' on `nat'. It is fast and is used automatically by the
11320 NB: At the moment, these decision procedures do not cope with mixed
11321 nat/int formulae where the two parts interact, such as `m < n ==>
11324 * HOL/Numeral provides a generic theory of numerals (encoded
11325 efficiently as bit strings); setup for types nat/int/real is in place;
11326 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
11327 int, existing theories and proof scripts may require a few additional
11330 * integer division and remainder can now be performed on constant
11333 * many properties of integer multiplication, division and remainder
11336 * An interface to the Stanford Validity Checker (SVC) is available through the
11337 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
11338 are proved automatically. SVC must be installed separately, and its results
11339 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
11340 invocation of the underlying oracle). For SVC see
11341 http://verify.stanford.edu/SVC
11343 * IsaMakefile: the HOL-Real target now builds an actual image;
11348 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
11349 (in Isabelle/Isar) -- by Gertrud Bauer;
11351 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
11352 analysis for assembly languages with subtypes;
11354 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
11355 -- avoids syntactic ambiguities and treats state, transition, and
11356 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
11357 changed syntax and (many) tactics;
11359 * HOL/inductive: Now also handles more general introduction rules such
11360 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
11361 theorems are now maintained within the theory (maintained via the
11364 * HOL/datatype: Now also handles arbitrarily branching datatypes
11365 (using function types) such as
11367 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
11369 * HOL/record: record_simproc (part of the default simpset) takes care
11370 of selectors applied to updated records; record_split_tac is no longer
11371 part of the default claset; update_defs may now be removed from the
11372 simpset in many cases; COMPATIBILITY: old behavior achieved by
11374 claset_ref () := claset() addSWrapper record_split_wrapper;
11375 Delsimprocs [record_simproc]
11377 * HOL/typedef: fixed type inference for representing set; type
11378 arguments now have to occur explicitly on the rhs as type constraints;
11380 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
11381 names rather than an ML expression;
11383 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
11384 supplied later. Program schemes can be defined, such as
11385 "While B C s = (if B s then While B C (C s) else s)"
11386 where the well-founded relation can be chosen after B and C have been given.
11388 * HOL/List: the constructors of type list are now Nil and Cons;
11389 INCOMPATIBILITY: while [] and infix # syntax is still there, of
11390 course, ML tools referring to List.list.op # etc. have to be adapted;
11392 * HOL_quantifiers flag superseded by "HOL" print mode, which is
11393 disabled by default; run isabelle with option -m HOL to get back to
11394 the original Gordon/HOL-style output;
11396 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
11397 ALL x<=y. P, EX x<y. P, EX x<=y. P;
11399 * HOL basic syntax simplified (more orthogonal): all variants of
11400 All/Ex now support plain / symbolic / HOL notation; plain syntax for
11401 Eps operator is provided as well: "SOME x. P[x]";
11403 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
11405 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
11406 thus available for user theories;
11408 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
11409 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
11412 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
11413 several times and then mp;
11418 * the notation <<...>> is now available as a notation for sequences of
11421 * the simplifier is now installed
11423 * the axiom system has been generalized (thanks to Soren Heilmann)
11425 * the classical reasoner now has a default rule database
11430 * new primrec section allows primitive recursive functions to be given
11431 directly (as in HOL) over datatypes and the natural numbers;
11433 * new tactics induct_tac and exhaust_tac for induction (or case
11434 analysis) over datatypes and the natural numbers;
11436 * the datatype declaration of type T now defines the recursor T_rec;
11438 * simplification automatically does freeness reasoning for datatype
11441 * automatic type-inference, with AddTCs command to insert new
11442 type-checking rules;
11444 * datatype introduction rules are now added as Safe Introduction rules
11447 * the syntax "if P then x else y" is now available in addition to
11451 *** Internal programming interfaces ***
11453 * tuned simplifier trace output; new flag debug_simp;
11455 * structures Vartab / Termtab (instances of TableFun) offer efficient
11456 tables indexed by indexname_ord / term_ord (compatible with aconv);
11458 * AxClass.axclass_tac lost the theory argument;
11460 * tuned current_goals_markers semantics: begin / end goal avoids
11461 printing empty lines;
11463 * removed prs and prs_fn hook, which was broken because it did not
11464 include \n in its semantics, forcing writeln to add one
11465 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
11466 string -> unit if you really want to output text without newline;
11468 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
11469 plain output, interface builders may have to enable 'isabelle_font'
11470 mode to get Isabelle font glyphs as before;
11472 * refined token_translation interface; INCOMPATIBILITY: output length
11473 now of type real instead of int;
11475 * theory loader actions may be traced via new ThyInfo.add_hook
11476 interface (see src/Pure/Thy/thy_info.ML); example application: keep
11477 your own database of information attached to *whole* theories -- as
11478 opposed to intra-theory data slots offered via TheoryDataFun;
11480 * proper handling of dangling sort hypotheses (at last!);
11481 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
11482 extra sort hypotheses that can be witnessed from the type signature;
11483 the force_strip_shyps flag is gone, any remaining shyps are simply
11484 left in the theorem (with a warning issued by strip_shyps_warning);
11488 New in Isabelle98-1 (October 1998)
11489 ----------------------------------
11491 *** Overview of INCOMPATIBILITIES (see below for more details) ***
11493 * several changes of automated proof tools;
11495 * HOL: major changes to the inductive and datatype packages, including
11496 some minor incompatibilities of theory syntax;
11498 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
11501 * HOL: removed duplicate thms in Arith:
11502 less_imp_add_less should be replaced by trans_less_add1
11503 le_imp_add_le should be replaced by trans_le_add1
11505 * HOL: unary minus is now overloaded (new type constraints may be
11508 * HOL and ZF: unary minus for integers is now #- instead of #~. In
11509 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
11510 now taken as an integer constant.
11512 * Pure: ML function 'theory_of' renamed to 'theory';
11515 *** Proof tools ***
11518 1. Asm_full_simp_tac is now more aggressive.
11519 1. It will sometimes reorient premises if that increases their power to
11521 2. It does no longer proceed strictly from left to right but may also
11522 rotate premises to achieve further simplification.
11523 For compatibility reasons there is now Asm_lr_simp_tac which is like the
11524 old Asm_full_simp_tac in that it does not rotate premises.
11525 2. The simplifier now knows a little bit about nat-arithmetic.
11527 * Classical reasoner: wrapper mechanism for the classical reasoner now
11528 allows for selected deletion of wrappers, by introduction of names for
11529 wrapper functionals. This implies that addbefore, addSbefore,
11530 addaltern, and addSaltern now take a pair (name, tactic) as argument,
11531 and that adding two tactics with the same name overwrites the first
11532 one (emitting a warning).
11533 type wrapper = (int -> tactic) -> (int -> tactic)
11534 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
11535 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
11536 delWrapper, delSWrapper: claset * string -> claset
11537 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
11539 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
11540 semantics; addbefore now affects only the unsafe part of step_tac
11541 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
11542 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
11545 * Classical reasoner: setwrapper to setWrapper and compwrapper to
11546 compWrapper; added safe wrapper (and access functions for it);
11548 * HOL/split_all_tac is now much faster and fails if there is nothing
11549 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
11550 and the names of the automatically generated variables have changed.
11551 split_all_tac has moved within claset() from unsafe wrappers to safe
11552 wrappers, which means that !!-bound variables are split much more
11553 aggressively, and safe_tac and clarify_tac now split such variables.
11554 If this splitting is not appropriate, use delSWrapper "split_all_tac".
11555 Note: the same holds for record_split_tac, which does the job of
11556 split_all_tac for record fields.
11558 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
11559 permanently to the default simpset using Addsplits just like
11560 Addsimps. They can be removed via Delsplits just like
11561 Delsimps. Lower-case versions are also available.
11563 * HOL/Simplifier: The rule split_if is now part of the default
11564 simpset. This means that the simplifier will eliminate all occurrences
11565 of if-then-else in the conclusion of a goal. To prevent this, you can
11566 either remove split_if completely from the default simpset by
11567 `Delsplits [split_if]' or remove it in a specific call of the
11568 simplifier using `... delsplits [split_if]'. You can also add/delete
11569 other case splitting rules to/from the default simpset: every datatype
11570 generates suitable rules `split_t_case' and `split_t_case_asm' (where
11571 t is the name of the datatype).
11573 * Classical reasoner / Simplifier combination: new force_tac (and
11574 derivatives Force_tac, force) combines rewriting and classical
11575 reasoning (and whatever other tools) similarly to auto_tac, but is
11576 aimed to solve the given subgoal completely.
11581 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
11582 and `goalw': the theory is no longer needed as an explicit argument -
11583 the current theory context is used; assumptions are no longer returned
11584 at the ML-level unless one of them starts with ==> or !!; it is
11585 recommended to convert to these new commands using isatool fixgoal
11586 (backup your sources first!);
11588 * new top-level commands 'thm' and 'thms' for retrieving theorems from
11589 the current theory context, and 'theory' to lookup stored theories;
11591 * new theory section 'locale' for declaring constants, assumptions and
11592 definitions that have local scope;
11594 * new theory section 'nonterminals' for purely syntactic types;
11596 * new theory section 'setup' for generic ML setup functions
11597 (e.g. package initialization);
11599 * the distribution now includes Isabelle icons: see
11600 lib/logo/isabelle-{small,tiny}.xpm;
11602 * isatool install - install binaries with absolute references to
11605 * isatool logo -- create instances of the Isabelle logo (as EPS);
11607 * print mode 'emacs' reserved for Isamode;
11609 * support multiple print (ast) translations per constant name;
11611 * theorems involving oracles are now printed with a suffixed [!];
11616 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
11618 * HOL/inductive package reorganized and improved: now supports mutual
11619 definitions such as
11624 oddI "n : EVEN ==> Suc n : ODD"
11625 evenI "n : ODD ==> Suc n : EVEN"
11627 new theorem list "elims" contains an elimination rule for each of the
11628 recursive sets; inductive definitions now handle disjunctive premises
11629 correctly (also ZF);
11631 INCOMPATIBILITIES: requires Inductive as an ancestor; component
11632 "mutual_induct" no longer exists - the induction rule is always
11633 contained in "induct";
11636 * HOL/datatype package re-implemented and greatly improved: now
11637 supports mutually recursive datatypes such as
11640 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
11641 | SUM ('a aexp) ('a aexp)
11642 | DIFF ('a aexp) ('a aexp)
11645 'a bexp = LESS ('a aexp) ('a aexp)
11646 | AND ('a bexp) ('a bexp)
11647 | OR ('a bexp) ('a bexp)
11649 as well as indirectly recursive datatypes such as
11652 ('a, 'b) term = Var 'a
11653 | App 'b ((('a, 'b) term) list)
11655 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
11656 induction on mutually / indirectly recursive datatypes.
11658 Primrec equations are now stored in theory and can be accessed via
11659 <function_name>.simps.
11663 - Theories using datatypes must now have theory Datatype as an
11665 - The specific <typename>.induct_tac no longer exists - use the
11666 generic induct_tac instead.
11667 - natE has been renamed to nat.exhaust - use exhaust_tac
11668 instead of res_inst_tac ... natE. Note that the variable
11669 names in nat.exhaust differ from the names in natE, this
11670 may cause some "fragile" proofs to fail.
11671 - The theorems split_<typename>_case and split_<typename>_case_asm
11672 have been renamed to <typename>.split and <typename>.split_asm.
11673 - Since default sorts of type variables are now handled correctly,
11674 some datatype definitions may have to be annotated with explicit
11676 - Primrec definitions no longer require function name and type
11677 of recursive argument.
11679 Consider using isatool fixdatatype to adapt your theories and proof
11680 scripts to the new package (backup your sources first!).
11683 * HOL/record package: considerably improved implementation; now
11684 includes concrete syntax for record types, terms, updates; theorems
11685 for surjective pairing and splitting !!-bound record variables; proof
11686 support is as follows:
11688 1) standard conversions (selectors or updates applied to record
11689 constructor terms) are part of the standard simpset;
11691 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
11692 made part of standard simpset and claset via addIffs;
11694 3) a tactic for record field splitting (record_split_tac) is part of
11695 the standard claset (addSWrapper);
11697 To get a better idea about these rules you may retrieve them via
11698 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
11699 the name of your record type.
11701 The split tactic 3) conceptually simplifies by the following rule:
11703 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
11705 Thus any record variable that is bound by meta-all will automatically
11706 blow up into some record constructor term, consequently the
11707 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
11708 solve record problems automatically.
11711 * reorganized the main HOL image: HOL/Integ and String loaded by
11712 default; theory Main includes everything;
11714 * automatic simplification of integer sums and comparisons, using cancellation;
11716 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
11718 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
11720 * many new identities for unions, intersections, set difference, etc.;
11722 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
11723 called split_if, split_split, split_sum_case and split_nat_case (to go
11724 with add/delsplits);
11726 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
11727 (?x::unit) = (); this is made part of the default simpset, which COULD
11728 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
11729 'Delsimprocs [unit_eq_proc];' as last resort); also note that
11730 unit_abs_eta_conv is added in order to counter the effect of
11731 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
11734 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
11737 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
11738 It and 'sym RS equals0D' are now in the default claset, giving automatic
11739 disjointness reasoning but breaking a few old proofs.
11741 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
11742 to 'converse' from 'inverse' (for compatibility with ZF and some
11745 * HOL/recdef can now declare non-recursive functions, with {} supplied as
11746 the well-founded relation;
11748 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
11749 Compl A. The "Compl" syntax remains available as input syntax for this
11752 * HOL/Update: new theory of function updates:
11753 f(a:=b) == %x. if x=a then b else f x
11754 may also be iterated as in f(a:=b,c:=d,...);
11756 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
11759 - new function list_update written xs[i:=v] that updates the i-th
11760 list position. May also be iterated as in xs[i:=a,j:=b,...].
11761 - new function `upt' written [i..j(] which generates the list
11762 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
11763 bound write [i..j], which is a shorthand for [i..j+1(].
11764 - new lexicographic orderings and corresponding wellfoundedness theorems.
11767 - removed 'pred' (predecessor) function;
11768 - generalized some theorems about n-1;
11769 - many new laws about "div" and "mod";
11770 - new laws about greatest common divisors (see theory ex/Primes);
11772 * HOL/Relation: renamed the relational operator r^-1 "converse"
11773 instead of "inverse";
11775 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
11776 of the multiset ordering;
11778 * directory HOL/Real: a construction of the reals using Dedekind cuts
11779 (not included by default);
11781 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
11783 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
11784 programs, i.e. different program variables may have different types.
11786 * calling (stac rew i) now fails if "rew" has no effect on the goal
11787 [previously, this check worked only if the rewrite rule was unconditional]
11788 Now rew can involve either definitions or equalities (either == or =).
11793 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
11794 only the theorems proved on ZF.ML;
11796 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
11797 It and 'sym RS equals0D' are now in the default claset, giving automatic
11798 disjointness reasoning but breaking a few old proofs.
11800 * ZF/Update: new theory of function updates
11801 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
11802 may also be iterated as in f(a:=b,c:=d,...);
11804 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
11806 * calling (stac rew i) now fails if "rew" has no effect on the goal
11807 [previously, this check worked only if the rewrite rule was unconditional]
11808 Now rew can involve either definitions or equalities (either == or =).
11810 * case_tac provided for compatibility with HOL
11811 (like the old excluded_middle_tac, but with subgoals swapped)
11814 *** Internal programming interfaces ***
11816 * Pure: several new basic modules made available for general use, see
11817 also src/Pure/README;
11819 * improved the theory data mechanism to support encapsulation (data
11820 kind name replaced by private Object.kind, acting as authorization
11821 key); new type-safe user interface via functor TheoryDataFun; generic
11822 print_data function becomes basically useless;
11824 * removed global_names compatibility flag -- all theory declarations
11825 are qualified by default;
11827 * module Pure/Syntax now offers quote / antiquote translation
11828 functions (useful for Hoare logic etc. with implicit dependencies);
11829 see HOL/ex/Antiquote for an example use;
11831 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
11834 * new tactical CHANGED_GOAL for checking that a tactic modifies a
11837 * Display.print_goals function moved to Locale.print_goals;
11839 * standard print function for goals supports current_goals_markers
11840 variable for marking begin of proof, end of proof, start of goal; the
11841 default is ("", "", ""); setting current_goals_markers := ("<proof>",
11842 "</proof>", "<goal>") causes SGML like tagged proof state printing,
11847 New in Isabelle98 (January 1998)
11848 --------------------------------
11850 *** Overview of INCOMPATIBILITIES (see below for more details) ***
11852 * changed lexical syntax of terms / types: dots made part of long
11853 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
11855 * simpset (and claset) reference variable replaced by functions
11856 simpset / simpset_ref;
11858 * no longer supports theory aliases (via merge) and non-trivial
11859 implicit merge of thms' signatures;
11861 * most internal names of constants changed due to qualified names;
11863 * changed Pure/Sequence interface (see Pure/seq.ML);
11866 *** General Changes ***
11868 * hierachically structured name spaces (for consts, types, axms, thms
11869 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
11870 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
11871 isatool fixdots ensures space after dots (e.g. "%x. x"); set
11872 long_names for fully qualified output names; NOTE: ML programs
11873 (special tactics, packages etc.) referring to internal names may have
11874 to be adapted to cope with fully qualified names; in case of severe
11875 backward campatibility problems try setting 'global_names' at compile
11876 time to have enrything declared within a flat name space; one may also
11877 fine tune name declarations in theories via the 'global' and 'local'
11880 * reimplemented the implicit simpset and claset using the new anytype
11881 data filed in signatures; references simpset:simpset ref etc. are
11882 replaced by functions simpset:unit->simpset and
11883 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
11884 to patch your ML files accordingly;
11886 * HTML output now includes theory graph data for display with Java
11887 applet or isatool browser; data generated automatically via isatool
11888 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
11890 * defs may now be conditional; improved rewrite_goals_tac to handle
11891 conditional equations;
11893 * defs now admits additional type arguments, using TYPE('a) syntax;
11895 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
11896 creates a new theory node; implicit merge of thms' signatures is
11897 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
11898 transfer:theory->thm->thm in (rare) cases;
11900 * improved handling of draft signatures / theories; draft thms (and
11901 ctyps, cterms) are automatically promoted to real ones;
11903 * slightly changed interfaces for oracles: admit many per theory, named
11904 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
11906 * print_goals: optional output of const types (set show_consts and
11909 * improved output of warnings (###) and errors (***);
11911 * subgoal_tac displays a warning if the new subgoal has type variables;
11913 * removed old README and Makefiles;
11915 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
11917 * removed obsolete init_pps and init_database;
11919 * deleted the obsolete tactical STATE, which was declared by
11920 fun STATE tacfun st = tacfun st st;
11922 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
11923 (which abbreviates $HOME);
11925 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
11926 use isatool fixseq to adapt your ML programs (this works for fully
11927 qualified references to the Sequence structure only!);
11929 * use_thy no longer requires writable current directory; it always
11930 reloads .ML *and* .thy file, if either one is out of date;
11933 *** Classical Reasoner ***
11935 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
11936 tactics that use classical reasoning to simplify a subgoal without
11937 splitting it into several subgoals;
11939 * Safe_tac: like safe_tac but uses the default claset;
11944 * added simplification meta rules:
11945 (asm_)(full_)simplify: simpset -> thm -> thm;
11947 * simplifier.ML no longer part of Pure -- has to be loaded by object
11950 * added prems argument to simplification procedures;
11952 * HOL, FOL, ZF: added infix function `addsplits':
11953 instead of `<simpset> setloop (split_tac <thms>)'
11954 you can simply write `<simpset> addsplits <thms>'
11959 * TYPE('a) syntax for type reflection terms;
11961 * no longer handles consts with name "" -- declare as 'syntax' instead;
11963 * pretty printer: changed order of mixfix annotation preference (again!);
11965 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
11970 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
11971 with `addloop' of the simplifier to faciliate case splitting in premises.
11973 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
11975 * HOL/Auth: new protocol proofs including some for the Internet
11978 * HOL/Map: new theory of `maps' a la VDM;
11980 * HOL/simplifier: simplification procedures nat_cancel_sums for
11981 cancelling out common nat summands from =, <, <= (in)equalities, or
11982 differences; simplification procedures nat_cancel_factor for
11983 cancelling common factor from =, <, <= (in)equalities over natural
11984 sums; nat_cancel contains both kinds of procedures, it is installed by
11985 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
11987 * HOL/simplifier: terms of the form
11988 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
11990 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
11991 and those of the form
11992 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
11994 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
11997 Each datatype `t' now comes with a theorem `split_t_case' of the form
11999 P(t_case f1 ... fn x) =
12000 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
12002 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
12005 and a theorem `split_t_case_asm' of the form
12007 P(t_case f1 ... fn x) =
12008 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
12010 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
12012 which can be added to a simpset via `addsplits'. The existing theorems
12013 expand_list_case and expand_option_case have been renamed to
12014 split_list_case and split_option_case.
12017 - `pred n' is automatically converted to `n-1'.
12018 Users are strongly encouraged not to use `pred' any longer,
12019 because it will disappear altogether at some point.
12020 - Users are strongly encouraged to write "0 < n" rather than
12021 "n ~= 0". Theorems and proof tools have been modified towards this
12025 the function "set_of_list" has been renamed "set" (and its theorems too);
12026 the function "nth" now takes its arguments in the reverse order and
12027 has acquired the infix notation "!" as in "xs!n".
12029 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
12031 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
12032 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
12034 * HOL/record: extensible records with schematic structural subtyping
12035 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
12036 still lacks various theorems and concrete record syntax;
12041 * removed "axioms" and "generated by" sections;
12043 * replaced "ops" section by extended "consts" section, which is capable of
12044 handling the continuous function space "->" directly;
12047 . proves theorems immediately and stores them in the theory,
12048 . creates hierachical name space,
12049 . now uses normal mixfix annotations (instead of cinfix...),
12050 . minor changes to some names and values (for consistency),
12051 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
12052 . separator between mutual domain defs: changed "," to "and",
12053 . improved handling of sort constraints; now they have to
12054 appear on the left-hand side of the equations only;
12056 * fixed LAM <x,y,zs>.b syntax;
12058 * added extended adm_tac to simplifier in HOLCF -- can now discharge
12059 adm (%x. P (t x)), where P is chainfinite and t continuous;
12064 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
12065 with `addloop' of the simplifier to faciliate case splitting in premises.
12067 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
12068 in HOL, they strip ALL and --> from proved theorems;
12072 New in Isabelle94-8 (May 1997)
12073 ------------------------------
12075 *** General Changes ***
12077 * new utilities to build / run / maintain Isabelle etc. (in parts
12078 still somewhat experimental); old Makefiles etc. still functional;
12080 * new 'Isabelle System Manual';
12082 * INSTALL text, together with ./configure and ./build scripts;
12084 * reimplemented type inference for greater efficiency, better error
12085 messages and clean internal interface;
12087 * prlim command for dealing with lots of subgoals (an easier way of
12088 setting goals_limit);
12093 * supports alternative (named) syntax tables (parser and pretty
12094 printer); internal interface is provided by add_modesyntax(_i);
12096 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
12097 be used in conjunction with the Isabelle symbol font; uses the
12098 "symbols" syntax table;
12100 * added token_translation interface (may translate name tokens in
12101 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
12102 the current print_mode); IMPORTANT: user print translation functions
12103 are responsible for marking newly introduced bounds
12104 (Syntax.mark_boundT);
12106 * token translations for modes "xterm" and "xterm_color" that display
12107 names in bold, underline etc. or colors (which requires a color
12110 * infixes may now be declared with names independent of their syntax;
12112 * added typed_print_translation (like print_translation, but may
12113 access type of constant);
12116 *** Classical Reasoner ***
12118 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
12119 some limitations. Blast_tac...
12120 + ignores addss, addbefore, addafter; this restriction is intrinsic
12121 + ignores elimination rules that don't have the correct format
12122 (the conclusion MUST be a formula variable)
12123 + ignores types, which can make HOL proofs fail
12124 + rules must not require higher-order unification, e.g. apply_type in ZF
12125 [message "Function Var's argument not a bound variable" relates to this]
12126 + its proof strategy is more general but can actually be slower
12128 * substitution with equality assumptions no longer permutes other
12131 * minor changes in semantics of addafter (now called addaltern); renamed
12132 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
12133 (and access functions for it);
12135 * improved combination of classical reasoner and simplifier:
12136 + functions for handling clasimpsets
12137 + improvement of addss: now the simplifier is called _after_ the
12139 + safe variant of addss called addSss: uses safe simplifications
12140 _during_ the safe steps. It is more complete as it allows multiple
12141 instantiations of unknowns (e.g. with slow_tac).
12145 * added interface for simplification procedures (functions that
12146 produce *proven* rewrite rules on the fly, depending on current
12149 * ordering on terms as parameter (used for ordered rewriting);
12151 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
12153 * the solver is now split into a safe and an unsafe part.
12154 This should be invisible for the normal user, except that the
12155 functions setsolver and addsolver have been renamed to setSolver and
12156 addSolver; added safe_asm_full_simp_tac;
12161 * a generic induction tactic `induct_tac' which works for all datatypes and
12162 also for type `nat';
12164 * a generic case distinction tactic `exhaust_tac' which works for all
12165 datatypes and also for type `nat';
12167 * each datatype comes with a function `size';
12169 * patterns in case expressions allow tuple patterns as arguments to
12170 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
12172 * primrec now also works with type nat;
12174 * recdef: a new declaration form, allows general recursive functions to be
12175 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
12177 * the constant for negation has been renamed from "not" to "Not" to
12178 harmonize with FOL, ZF, LK, etc.;
12180 * HOL/ex/LFilter theory of a corecursive "filter" functional for
12183 * HOL/Modelcheck demonstrates invocation of model checker oracle;
12185 * HOL/ex/Ring.thy declares cring_simp, which solves equational
12186 problems in commutative rings, using axiomatic type classes for + and *;
12188 * more examples in HOL/MiniML and HOL/Auth;
12190 * more default rewrite rules for quantifiers, union/intersection;
12192 * a new constant `arbitrary == @x.False';
12194 * HOLCF/IOA replaces old HOL/IOA;
12196 * HOLCF changes: derived all rules and arities
12197 + axiomatic type classes instead of classes
12198 + typedef instead of faking type definitions
12199 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
12200 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
12201 + eliminated the types void, one, tr
12202 + use unit lift and bool lift (with translations) instead of one and tr
12203 + eliminated blift from Lift3.thy (use Def instead of blift)
12204 all eliminated rules are derived as theorems --> no visible changes ;
12209 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
12210 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
12211 as ZF_cs addSIs [equalityI];
12215 New in Isabelle94-7 (November 96)
12216 ---------------------------------
12218 * allowing negative levels (as offsets) in prlev and choplev;
12220 * super-linear speedup for large simplifications;
12222 * FOL, ZF and HOL now use miniscoping: rewriting pushes
12223 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
12224 FAIL); can suppress it using the command Delsimps (ex_simps @
12225 all_simps); De Morgan laws are also now included, by default;
12227 * improved printing of ==> : ~:
12229 * new object-logic "Sequents" adds linear logic, while replacing LK
12230 and Modal (thanks to Sara Kalvala);
12232 * HOL/Auth: correctness proofs for authentication protocols;
12234 * HOL: new auto_tac combines rewriting and classical reasoning (many
12235 examples on HOL/Auth);
12237 * HOL: new command AddIffs for declaring theorems of the form P=Q to
12238 the rewriter and classical reasoner simultaneously;
12240 * function uresult no longer returns theorems in "standard" format;
12241 regain previous version by: val uresult = standard o uresult;
12245 New in Isabelle94-6
12246 -------------------
12248 * oracles -- these establish an interface between Isabelle and trusted
12249 external reasoners, which may deliver results as theorems;
12251 * proof objects (in particular record all uses of oracles);
12253 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
12255 * "constdefs" section in theory files;
12257 * "primrec" section (HOL) no longer requires names;
12259 * internal type "tactic" now simply "thm -> thm Sequence.seq";
12263 New in Isabelle94-5
12264 -------------------
12266 * reduced space requirements;
12268 * automatic HTML generation from theories;
12270 * theory files no longer require "..." (quotes) around most types;
12272 * new examples, including two proofs of the Church-Rosser theorem;
12274 * non-curried (1994) version of HOL is no longer distributed;
12278 New in Isabelle94-4
12279 -------------------
12281 * greatly reduced space requirements;
12283 * theory files (.thy) no longer require \...\ escapes at line breaks;
12285 * searchable theorem database (see the section "Retrieving theorems" on
12286 page 8 of the Reference Manual);
12288 * new examples, including Grabczewski's monumental case study of the
12291 * The previous version of HOL renamed to Old_HOL;
12293 * The new version of HOL (previously called CHOL) uses a curried syntax
12294 for functions. Application looks like f a b instead of f(a,b);
12296 * Mutually recursive inductive definitions finally work in HOL;
12298 * In ZF, pattern-matching on tuples is now available in all abstractions and
12299 translates to the operator "split";
12303 New in Isabelle94-3
12304 -------------------
12306 * new infix operator, addss, allowing the classical reasoner to
12307 perform simplification at each step of its search. Example:
12308 fast_tac (cs addss ss)
12310 * a new logic, CHOL, the same as HOL, but with a curried syntax
12311 for functions. Application looks like f a b instead of f(a,b). Also pairs
12312 look like (a,b) instead of <a,b>;
12314 * PLEASE NOTE: CHOL will eventually replace HOL!
12316 * In CHOL, pattern-matching on tuples is now available in all abstractions.
12317 It translates to the operator "split". A new theory of integers is available;
12319 * In ZF, integer numerals now denote two's-complement binary integers.
12320 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
12322 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
12323 of the Axiom of Choice;
12327 New in Isabelle94-2
12328 -------------------
12330 * Significantly faster resolution;
12332 * the different sections in a .thy file can now be mixed and repeated
12335 * Database of theorems for FOL, HOL and ZF. New
12336 commands including qed, qed_goal and bind_thm store theorems in the database.
12338 * Simple database queries: return a named theorem (get_thm) or all theorems of
12339 a given theory (thms_of), or find out what theory a theorem was proved in
12342 * Bugs fixed in the inductive definition and datatype packages;
12344 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
12345 and HOL_dup_cs obsolete;
12347 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
12350 * Simpler definition of function space in ZF;
12352 * new results about cardinal and ordinal arithmetic in ZF;
12354 * 'subtype' facility in HOL for introducing new types as subsets of existing
12357 :mode=isabelle-news:wrap=hard:maxLineLen=72: