NEWS
author wenzelm
Thu Nov 08 15:49:56 2018 +0100 (7 months ago)
changeset 69266 7cc2d66a92a6
parent 69230 07fc77bf5eb6
child 69268 c1a27fce2076
permissions -rw-r--r--
proper ML expressions, without trailing semicolons;
     1 Isabelle NEWS -- history of user-relevant changes
     2 =================================================
     3 
     4 (Note: Isabelle/jEdit shows a tree-view of the NEWS file in Sidekick.)
     5 
     6 
     7 New in this Isabelle version
     8 ----------------------------
     9 
    10 *** General ***
    11 
    12 * Old-style inner comments (* ... *) within the term language are no
    13 longer supported (legacy feature in Isabelle2018).
    14 
    15 * Infix operators that begin or end with a "*" can now be paranthesized
    16 without additional spaces, eg "(*)" instead of "( * )".
    17 
    18 * ML setup commands (e.g. 'setup', 'method_setup', 'parse_translation')
    19 need to provide a closed expression -- without trailing semicolon. Minor
    20 INCOMPATIBILITY.
    21 
    22 
    23 *** Isabelle/jEdit Prover IDE ***
    24 
    25 * Improved sub-pixel font rendering (especially on Linux), thanks to
    26 OpenJDK 11.
    27 
    28 
    29 *** Isar ***
    30 
    31 * More robust treatment of structural errors: begin/end blocks take
    32 precedence over goal/proof.
    33 
    34 * Implicit cases goal1, goal2, goal3, etc. have been discontinued
    35 (legacy feature since Isabelle2016).
    36 
    37 
    38 *** HOL ***
    39 
    40 * Simplified syntax setup for big operators under image. In rare
    41 situations, type conversions are not inserted implicitly any longer
    42 and need to be given explicitly. Auxiliary abbreviations INFIMUM,
    43 SUPREMUM, UNION, INTER should now rarely occur in output and are just
    44 retained as migration auxiliary. INCOMPATIBILITY.
    45 
    46 * Theory List: the precedence of the list_update operator has changed:
    47 "f a [n := x]" now needs to be written "(f a)[n := x]".
    48 
    49 * Theory "HOL-Library.Multiset": the <Union># operator now has the same
    50 precedence as any other prefix function symbol.
    51 
    52 * Facts sum_mset.commute and prod_mset.commute renamed to sum_mset.swap
    53 and prod_mset.swap, similarly to sum.swap and prod.swap.
    54 INCOMPATIBILITY.
    55 
    56 * Strong congruence rules (with =simp=> in the premises) for constant f
    57 are now uniformly called f_cong_strong. 
    58 
    59 * Sledgehammer: The URL for SystemOnTPTP, which is used by remote
    60 provers, has been updated.
    61 
    62 * SMT: reconstruction is now possible using the SMT solver veriT.
    63 
    64 * Session HOL-SPARK: .prv files are no longer written to the
    65 file-system, but exported to the session database. Results may be
    66 retrieved with the "isabelle export" command-line tool like this:
    67 
    68   isabelle export -x "*:**.prv" HOL-SPARK-Examples
    69 
    70 
    71 *** ML ***
    72 
    73 * Original PolyML.pointerEq is retained as a convenience for tools that
    74 don't use Isabelle/ML (where this is called "pointer_eq").
    75 
    76 * ML evaluation (notably via commands 'ML' and 'ML_file') is subject to
    77 option ML_environment to select a named environment, such as "Isabelle"
    78 for Isabelle/ML, or "SML" for official Standard ML. It is also possible
    79 to move toplevel bindings between environments, using a notation with
    80 ">" as separator. For example:
    81 
    82   declare [[ML_environment = "Isabelle>SML"]]
    83   ML \<open>val println = writeln\<close>
    84 
    85   declare [[ML_environment = "SML"]]
    86   ML \<open>println "test"\<close>
    87 
    88   declare [[ML_environment = "Isabelle"]]
    89   ML \<open>println\<close>  \<comment> \<open>not present\<close>
    90 
    91 The Isabelle/ML function ML_Env.setup defines new ML environments. This
    92 is useful to incorporate big SML projects in an isolated name space, and
    93 potentially with variations on ML syntax (existing ML_Env.SML_operations
    94 observes the official standard).
    95 
    96 * GHC.read_source reads Haskell source text with antiquotations (only
    97 the control-cartouche form). The default "cartouche" antiquotation
    98 evaluates an ML expression of type string and inlines the result as
    99 Haskell string literal. This allows to refer to Isabelle items robustly,
   100 e.g. via Isabelle/ML antiquotations or library operations. For example:
   101 
   102 ML_command \<open>
   103   GHC.read_source \<^context> \<open>
   104     allConst, impConst, eqConst :: String
   105     allConst = \<open>\<^const_name>\<open>Pure.all\<close>\<close>
   106     impConst = \<open>\<^const_name>\<open>Pure.imp\<close>\<close>
   107     eqConst = \<open>\<^const_name>\<open>Pure.eq\<close>\<close>
   108   \<close>
   109   |> writeln
   110 \<close>
   111 
   112 
   113 *** System ***
   114 
   115 * Session directory $ISABELLE_HOME/src/Tools/Haskell provides some
   116 source modules for Isabelle tools implemented in Haskell, notably for
   117 Isabelle/PIDE.
   118 
   119 * Isabelle server command "use_theories" supports "nodes_status_delay"
   120 for continuous output of node status information. The time interval is
   121 specified in seconds; a negative value means it is disabled (default).
   122 
   123 * Isabelle Server command "use_theories" terminates more robustly in the
   124 presence of structurally broken sources: full consolidation of theories
   125 is no longer required.
   126 
   127 * Support for OCaml via command-line tools "isabelle ocaml_setup",
   128 "isabelle ocaml", "isabelle ocamlc", "isabelle ocaml_opam". Existing
   129 settings variables ISABELLE_OCAML and ISABELLE_OCAMLC are maintained
   130 dynamically according the state of ISABELLE_OPAM_ROOT and
   131 ISABELLE_OCAML_VERSION.
   132 
   133 * Support for Glasgow Haskell Compiler via command-line tools "isabelle
   134 ghc_setup", "isabelle ghci", "isabelle ghc", "isabelle ghc_stack".
   135 Existing settings variable ISABELLE_GHC is maintained dynamically
   136 according to the state of ISABELLE_STACK_ROOT and
   137 ISABELLE_STACK_RESOLVER.
   138 
   139 * Update to Java 11: the latest long-term support version of OpenJDK.
   140 
   141 
   142 
   143 New in Isabelle2018 (August 2018)
   144 ---------------------------------
   145 
   146 *** General ***
   147 
   148 * Session-qualified theory names are mandatory: it is no longer possible
   149 to refer to unqualified theories from the parent session.
   150 INCOMPATIBILITY for old developments that have not been updated to
   151 Isabelle2017 yet (using the "isabelle imports" tool).
   152 
   153 * Only the most fundamental theory names are global, usually the entry
   154 points to major logic sessions: Pure, Main, Complex_Main, HOLCF, IFOL,
   155 FOL, ZF, ZFC etc. INCOMPATIBILITY, need to use qualified names for
   156 formerly global "HOL-Probability.Probability" and "HOL-SPARK.SPARK".
   157 
   158 * Global facts need to be closed: no free variables and no hypotheses.
   159 Rare INCOMPATIBILITY.
   160 
   161 * Facts stemming from locale interpretation are subject to lazy
   162 evaluation for improved performance. Rare INCOMPATIBILITY: errors
   163 stemming from interpretation morphisms might be deferred and thus
   164 difficult to locate; enable system option "strict_facts" temporarily to
   165 avoid this.
   166 
   167 * Marginal comments need to be written exclusively in the new-style form
   168 "\<comment> \<open>text\<close>", old ASCII variants like "-- {* ... *}" are no longer
   169 supported. INCOMPATIBILITY, use the command-line tool "isabelle
   170 update_comments" to update existing theory files.
   171 
   172 * Old-style inner comments (* ... *) within the term language are legacy
   173 and will be discontinued soon: use formal comments "\<comment> \<open>...\<close>" or "\<^cancel>\<open>...\<close>"
   174 instead.
   175 
   176 * The "op <infix-op>" syntax for infix operators has been replaced by
   177 "(<infix-op>)". If <infix-op> begins or ends with a "*", there needs to
   178 be a space between the "*" and the corresponding parenthesis.
   179 INCOMPATIBILITY, use the command-line tool "isabelle update_op" to
   180 convert theory and ML files to the new syntax. Because it is based on
   181 regular expression matching, the result may need a bit of manual
   182 postprocessing. Invoking "isabelle update_op" converts all files in the
   183 current directory (recursively). In case you want to exclude conversion
   184 of ML files (because the tool frequently also converts ML's "op"
   185 syntax), use option "-m".
   186 
   187 * Theory header 'abbrevs' specifications need to be separated by 'and'.
   188 INCOMPATIBILITY.
   189 
   190 * Command 'external_file' declares the formal dependency on the given
   191 file name, such that the Isabelle build process knows about it, but
   192 without specific Prover IDE management.
   193 
   194 * Session ROOT entries no longer allow specification of 'files'. Rare
   195 INCOMPATIBILITY, use command 'external_file' within a proper theory
   196 context.
   197 
   198 * Session root directories may be specified multiple times: each
   199 accessible ROOT file is processed only once. This facilitates
   200 specification of $ISABELLE_HOME_USER/ROOTS or command-line options like
   201 -d or -D for "isabelle build" and "isabelle jedit". Example:
   202 
   203   isabelle build -D '~~/src/ZF'
   204 
   205 * The command 'display_drafts' has been discontinued. INCOMPATIBILITY,
   206 use action "isabelle.draft" (or "print") in Isabelle/jEdit instead.
   207 
   208 * In HTML output, the Isabelle symbol "\<hyphen>" is rendered as explicit
   209 Unicode hyphen U+2010, to avoid unclear meaning of the old "soft hyphen"
   210 U+00AD. Rare INCOMPATIBILITY, e.g. copy-paste of historic Isabelle HTML
   211 output.
   212 
   213 
   214 *** Isabelle/jEdit Prover IDE ***
   215 
   216 * The command-line tool "isabelle jedit" provides more flexible options
   217 for session management:
   218 
   219   - option -R builds an auxiliary logic image with all theories from
   220     other sessions that are not already present in its parent
   221 
   222   - option -S is like -R, with a focus on the selected session and its
   223     descendants (this reduces startup time for big projects like AFP)
   224 
   225   - option -A specifies an alternative ancestor session for options -R
   226     and -S
   227 
   228   - option -i includes additional sessions into the name-space of
   229     theories
   230 
   231   Examples:
   232     isabelle jedit -R HOL-Number_Theory
   233     isabelle jedit -R HOL-Number_Theory -A HOL
   234     isabelle jedit -d '$AFP' -S Formal_SSA -A HOL
   235     isabelle jedit -d '$AFP' -S Formal_SSA -A HOL-Analysis
   236     isabelle jedit -d '$AFP' -S Formal_SSA -A HOL-Analysis -i CryptHOL
   237 
   238 * PIDE markup for session ROOT files: allows to complete session names,
   239 follow links to theories and document files etc.
   240 
   241 * Completion supports theory header imports, using theory base name.
   242 E.g. "Prob" may be completed to "HOL-Probability.Probability".
   243 
   244 * Named control symbols (without special Unicode rendering) are shown as
   245 bold-italic keyword. This is particularly useful for the short form of
   246 antiquotations with control symbol: \<^name>\<open>argument\<close>. The action
   247 "isabelle.antiquoted_cartouche" turns an antiquotation with 0 or 1
   248 arguments into this format.
   249 
   250 * Completion provides templates for named symbols with arguments,
   251 e.g. "\<comment> \<open>ARGUMENT\<close>" or "\<^emph>\<open>ARGUMENT\<close>".
   252 
   253 * Slightly more parallel checking, notably for high priority print
   254 functions (e.g. State output).
   255 
   256 * The view title is set dynamically, according to the Isabelle
   257 distribution and the logic session name. The user can override this via
   258 set-view-title (stored persistently in $JEDIT_SETTINGS/perspective.xml).
   259 
   260 * System options "spell_checker_include" and "spell_checker_exclude"
   261 supersede former "spell_checker_elements" to determine regions of text
   262 that are subject to spell-checking. Minor INCOMPATIBILITY.
   263 
   264 * Action "isabelle.preview" is able to present more file formats,
   265 notably bibtex database files and ML files.
   266 
   267 * Action "isabelle.draft" is similar to "isabelle.preview", but shows a
   268 plain-text document draft. Both are available via the menu "Plugins /
   269 Isabelle".
   270 
   271 * When loading text files, the Isabelle symbols encoding UTF-8-Isabelle
   272 is only used if there is no conflict with existing Unicode sequences in
   273 the file. Otherwise, the fallback encoding is plain UTF-8 and Isabelle
   274 symbols remain in literal \<symbol> form. This avoids accidental loss of
   275 Unicode content when saving the file.
   276 
   277 * Bibtex database files (.bib) are semantically checked.
   278 
   279 * Update to jedit-5.5.0, the latest release.
   280 
   281 
   282 *** Isabelle/VSCode Prover IDE ***
   283 
   284 * HTML preview of theories and other file-formats similar to
   285 Isabelle/jEdit.
   286 
   287 * Command-line tool "isabelle vscode_server" accepts the same options
   288 -A, -R, -S, -i for session selection as "isabelle jedit". This is
   289 relevant for isabelle.args configuration settings in VSCode. The former
   290 option -A (explore all known session files) has been discontinued: it is
   291 enabled by default, unless option -S is used to focus on a particular
   292 spot in the session structure. INCOMPATIBILITY.
   293 
   294 
   295 *** Document preparation ***
   296 
   297 * Formal comments work uniformly in outer syntax, inner syntax (term
   298 language), Isabelle/ML and some other embedded languages of Isabelle.
   299 See also "Document comments" in the isar-ref manual. The following forms
   300 are supported:
   301 
   302   - marginal text comment: \<comment> \<open>\<dots>\<close>
   303   - canceled source: \<^cancel>\<open>\<dots>\<close>
   304   - raw LaTeX: \<^latex>\<open>\<dots>\<close>
   305 
   306 * Outside of the inner theory body, the default presentation context is
   307 theory Pure. Thus elementary antiquotations may be used in markup
   308 commands (e.g. 'chapter', 'section', 'text') and formal comments.
   309 
   310 * System option "document_tags" specifies alternative command tags. This
   311 is occasionally useful to control the global visibility of commands via
   312 session options (e.g. in ROOT).
   313 
   314 * Document markup commands ('section', 'text' etc.) are implicitly
   315 tagged as "document" and visible by default. This avoids the application
   316 of option "document_tags" to these commands.
   317 
   318 * Isabelle names are mangled into LaTeX macro names to allow the full
   319 identifier syntax with underscore, prime, digits. This is relevant for
   320 antiquotations in control symbol notation, e.g. \<^const_name> becomes
   321 \isactrlconstUNDERSCOREname.
   322 
   323 * Document preparation with skip_proofs option now preserves the content
   324 more accurately: only terminal proof steps ('by' etc.) are skipped.
   325 
   326 * Document antiquotation @{theory name} requires the long
   327 session-qualified theory name: this is what users reading the text
   328 normally need to import.
   329 
   330 * Document antiquotation @{session name} checks and prints the given
   331 session name verbatim.
   332 
   333 * Document antiquotation @{cite} now checks the given Bibtex entries
   334 against the Bibtex database files -- only in batch-mode session builds.
   335 
   336 * Command-line tool "isabelle document" has been re-implemented in
   337 Isabelle/Scala, with simplified arguments and explicit errors from the
   338 latex and bibtex process. Minor INCOMPATIBILITY.
   339 
   340 * Session ROOT entry: empty 'document_files' means there is no document
   341 for this session. There is no need to specify options [document = false]
   342 anymore.
   343 
   344 
   345 *** Isar ***
   346 
   347 * Command 'interpret' no longer exposes resulting theorems as literal
   348 facts, notably for the \<open>prop\<close> notation or the "fact" proof method. This
   349 improves modularity of proofs and scalability of locale interpretation.
   350 Rare INCOMPATIBILITY, need to refer to explicitly named facts instead
   351 (e.g. use 'find_theorems' or 'try' to figure this out).
   352 
   353 * The old 'def' command has been discontinued (legacy since
   354 Isbelle2016-1). INCOMPATIBILITY, use 'define' instead -- usually with
   355 object-logic equality or equivalence.
   356 
   357 
   358 *** Pure ***
   359 
   360 * The inner syntax category "sort" now includes notation "_" for the
   361 dummy sort: it is effectively ignored in type-inference.
   362 
   363 * Rewrites clauses (keyword 'rewrites') were moved into the locale
   364 expression syntax, where they are part of locale instances. In
   365 interpretation commands rewrites clauses now need to occur before 'for'
   366 and 'defines'. Rare INCOMPATIBILITY; definitions immediately subject to
   367 rewriting may need to be pulled up into the surrounding theory.
   368 
   369 * For 'rewrites' clauses, if activating a locale instance fails, fall
   370 back to reading the clause first. This helps avoid qualification of
   371 locale instances where the qualifier's sole purpose is avoiding
   372 duplicate constant declarations.
   373 
   374 * Proof method "simp" now supports a new modifier "flip:" followed by a
   375 list of theorems. Each of these theorems is removed from the simpset
   376 (without warning if it is not there) and the symmetric version of the
   377 theorem (i.e. lhs and rhs exchanged) is added to the simpset. For "auto"
   378 and friends the modifier is "simp flip:".
   379 
   380 
   381 *** HOL ***
   382 
   383 * Sledgehammer: bundled version of "vampire" (for non-commercial users)
   384 helps to avoid fragility of "remote_vampire" service.
   385 
   386 * Clarified relationship of characters, strings and code generation:
   387 
   388   - Type "char" is now a proper datatype of 8-bit values.
   389 
   390   - Conversions "nat_of_char" and "char_of_nat" are gone; use more
   391     general conversions "of_char" and "char_of" with suitable type
   392     constraints instead.
   393 
   394   - The zero character is just written "CHR 0x00", not "0" any longer.
   395 
   396   - Type "String.literal" (for code generation) is now isomorphic to
   397     lists of 7-bit (ASCII) values; concrete values can be written as
   398     "STR ''...''" for sequences of printable characters and "STR 0x..."
   399     for one single ASCII code point given as hexadecimal numeral.
   400 
   401   - Type "String.literal" supports concatenation "... + ..." for all
   402     standard target languages.
   403 
   404   - Theory HOL-Library.Code_Char is gone; study the explanations
   405     concerning "String.literal" in the tutorial on code generation to
   406     get an idea how target-language string literals can be converted to
   407     HOL string values and vice versa.
   408 
   409   - Session Imperative-HOL: operation "raise" directly takes a value of
   410     type "String.literal" as argument, not type "string".
   411 
   412 INCOMPATIBILITY.
   413 
   414 * Code generation: Code generation takes an explicit option
   415 "case_insensitive" to accomodate case-insensitive file systems.
   416 
   417 * Abstract bit operations as part of Main: push_bit, take_bit, drop_bit.
   418 
   419 * New, more general, axiomatization of complete_distrib_lattice. The
   420 former axioms:
   421 
   422   "sup x (Inf X) = Inf (sup x ` X)" and "inf x (Sup X) = Sup (inf x ` X)"
   423 
   424 are replaced by:
   425 
   426   "Inf (Sup ` A) <= Sup (Inf ` {f ` A | f . (! Y \<in> A . f Y \<in> Y)})"
   427 
   428 The instantiations of sets and functions as complete_distrib_lattice are
   429 moved to Hilbert_Choice.thy because their proofs need the Hilbert choice
   430 operator. The dual of this property is also proved in theory
   431 HOL.Hilbert_Choice.
   432 
   433 * New syntax for the minimum/maximum of a function over a finite set:
   434 MIN x\<in>A. B and even MIN x. B (only useful for finite types), also MAX.
   435 
   436 * Clarifed theorem names:
   437 
   438   Min.antimono ~> Min.subset_imp
   439   Max.antimono ~> Max.subset_imp
   440 
   441 Minor INCOMPATIBILITY.
   442 
   443 * SMT module:
   444 
   445   - The 'smt_oracle' option is now necessary when using the 'smt' method
   446     with a solver other than Z3. INCOMPATIBILITY.
   447 
   448   - The encoding to first-order logic is now more complete in the
   449     presence of higher-order quantifiers. An 'smt_explicit_application'
   450     option has been added to control this. INCOMPATIBILITY.
   451 
   452 * Facts sum.commute(_restrict) and prod.commute(_restrict) renamed to
   453 sum.swap(_restrict) and prod.swap(_restrict), to avoid name clashes on
   454 interpretation of abstract locales. INCOMPATIBILITY.
   455 
   456 * Predicate coprime is now a real definition, not a mere abbreviation.
   457 INCOMPATIBILITY.
   458 
   459 * Predicate pairwise_coprime abolished, use "pairwise coprime" instead.
   460 INCOMPATIBILITY.
   461 
   462 * The relator rel_filter on filters has been strengthened to its
   463 canonical categorical definition with better properties.
   464 INCOMPATIBILITY.
   465 
   466 * Generalized linear algebra involving linear, span, dependent, dim
   467 from type class real_vector to locales module and vector_space.
   468 Renamed:
   469 
   470   span_inc ~> span_superset
   471   span_superset ~> span_base
   472   span_eq ~> span_eq_iff
   473 
   474 INCOMPATIBILITY.
   475 
   476 * Class linordered_semiring_1 covers zero_less_one also, ruling out
   477 pathologic instances. Minor INCOMPATIBILITY.
   478 
   479 * Theory HOL.List: functions "sorted_wrt" and "sorted" now compare every
   480 element in a list to all following elements, not just the next one.
   481 
   482 * Theory HOL.List syntax:
   483 
   484   - filter-syntax "[x <- xs. P]" is no longer output syntax, but only
   485     input syntax
   486 
   487   - list comprehension syntax now supports tuple patterns in "pat <- xs"
   488 
   489 * Theory Map: "empty" must now be qualified as "Map.empty".
   490 
   491 * Removed nat-int transfer machinery. Rare INCOMPATIBILITY.
   492 
   493 * Fact mod_mult_self4 (on nat) renamed to Suc_mod_mult_self3, to avoid
   494 clash with fact mod_mult_self4 (on more generic semirings).
   495 INCOMPATIBILITY.
   496 
   497 * Eliminated some theorem aliasses:
   498   even_times_iff ~> even_mult_iff
   499   mod_2_not_eq_zero_eq_one_nat ~> not_mod_2_eq_0_eq_1
   500   even_of_nat ~> even_int_iff
   501 
   502 INCOMPATIBILITY.
   503 
   504 * Eliminated some theorem duplicate variations:
   505 
   506   - dvd_eq_mod_eq_0_numeral can be replaced by dvd_eq_mod_eq_0
   507   - mod_Suc_eq_Suc_mod can be replaced by mod_Suc
   508   - mod_Suc_eq_Suc_mod [symmetrict] can be replaced by mod_simps
   509   - mod_eq_0_iff can be replaced by mod_eq_0_iff_dvd and dvd_def
   510   - the witness of mod_eqD can be given directly as "_ div _"
   511 
   512 INCOMPATIBILITY.
   513 
   514 * Classical setup: Assumption "m mod d = 0" (for m d :: nat) is no
   515 longer aggresively destroyed to "\<exists>q. m = d * q". INCOMPATIBILITY, adding
   516 "elim!: dvd" to classical proof methods in most situations restores
   517 broken proofs.
   518 
   519 * Theory HOL-Library.Conditional_Parametricity provides command
   520 'parametric_constant' for proving parametricity of non-recursive
   521 definitions. For constants that are not fully parametric the command
   522 will infer conditions on relations (e.g., bi_unique, bi_total, or type
   523 class conditions such as "respects 0") sufficient for parametricity. See
   524 theory HOL-ex.Conditional_Parametricity_Examples for some examples.
   525 
   526 * Theory HOL-Library.Code_Lazy provides a new preprocessor for the code
   527 generator to generate code for algebraic types with lazy evaluation
   528 semantics even in call-by-value target languages. See the theories
   529 HOL-ex.Code_Lazy_Demo and HOL-Codegenerator_Test.Code_Lazy_Test for some
   530 examples.
   531 
   532 * Theory HOL-Library.Landau_Symbols has been moved here from AFP.
   533 
   534 * Theory HOL-Library.Old_Datatype no longer provides the legacy command
   535 'old_datatype'. INCOMPATIBILITY.
   536 
   537 * Theory HOL-Computational_Algebra.Polynomial_Factorial does not provide
   538 instances of rat, real, complex as factorial rings etc. Import
   539 HOL-Computational_Algebra.Field_as_Ring explicitly in case of need.
   540 INCOMPATIBILITY.
   541 
   542 * Session HOL-Algebra: renamed (^) to [^] to avoid conflict with new
   543 infix/prefix notation.
   544 
   545 * Session HOL-Algebra: revamped with much new material. The set of
   546 isomorphisms between two groups is now denoted iso rather than iso_set.
   547 INCOMPATIBILITY.
   548 
   549 * Session HOL-Analysis: the Arg function now respects the same interval
   550 as Ln, namely (-pi,pi]; the old Arg function has been renamed Arg2pi.
   551 INCOMPATIBILITY.
   552 
   553 * Session HOL-Analysis: the functions zorder, zer_poly, porder and
   554 pol_poly have been redefined. All related lemmas have been reworked.
   555 INCOMPATIBILITY.
   556 
   557 * Session HOL-Analysis: infinite products, Moebius functions, the
   558 Riemann mapping theorem, the Vitali covering theorem,
   559 change-of-variables results for integration and measures.
   560 
   561 * Session HOL-Real_Asymp: proof method "real_asymp" proves asymptotics
   562 or real-valued functions (limits, "Big-O", etc.) automatically.
   563 See also ~~/src/HOL/Real_Asymp/Manual for some documentation.
   564 
   565 * Session HOL-Types_To_Sets: more tool support (unoverload_type combines
   566 internalize_sorts and unoverload) and larger experimental application
   567 (type based linear algebra transferred to linear algebra on subspaces).
   568 
   569 
   570 *** ML ***
   571 
   572 * Operation Export.export emits theory exports (arbitrary blobs), which
   573 are stored persistently in the session build database.
   574 
   575 * Command 'ML_export' exports ML toplevel bindings to the global
   576 bootstrap environment of the ML process. This allows ML evaluation
   577 without a formal theory context, e.g. in command-line tools like
   578 "isabelle process".
   579 
   580 
   581 *** System ***
   582 
   583 * Mac OS X 10.10 Yosemite is now the baseline version; Mavericks is no
   584 longer supported.
   585 
   586 * Linux and Windows/Cygwin is for x86_64 only, old 32bit platform
   587 support has been discontinued.
   588 
   589 * Java runtime is for x86_64 only. Corresponding Isabelle settings have
   590 been renamed to ISABELLE_TOOL_JAVA_OPTIONS and JEDIT_JAVA_OPTIONS,
   591 instead of former 32/64 variants. INCOMPATIBILITY.
   592 
   593 * Old settings ISABELLE_PLATFORM and ISABELLE_WINDOWS_PLATFORM should be
   594 phased out due to unclear preference of 32bit vs. 64bit architecture.
   595 Explicit GNU bash expressions are now preferred, for example (with
   596 quotes):
   597 
   598   #Posix executables (Unix or Cygwin), with preference for 64bit
   599   "${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM32}"
   600 
   601   #native Windows or Unix executables, with preference for 64bit
   602   "${ISABELLE_WINDOWS_PLATFORM64:-${ISABELLE_WINDOWS_PLATFORM32:-${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM32}}}"
   603 
   604   #native Windows (32bit) or Unix executables (preference for 64bit)
   605   "${ISABELLE_WINDOWS_PLATFORM32:-${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM32}}"
   606 
   607 * Command-line tool "isabelle build" supports new options:
   608   - option -B NAME: include session NAME and all descendants
   609   - option -S: only observe changes of sources, not heap images
   610   - option -f: forces a fresh build
   611 
   612 * Command-line tool "isabelle build" options -c -x -B refer to
   613 descendants wrt. the session parent or import graph. Subtle
   614 INCOMPATIBILITY: options -c -x used to refer to the session parent graph
   615 only.
   616 
   617 * Command-line tool "isabelle build" takes "condition" options with the
   618 corresponding environment values into account, when determining the
   619 up-to-date status of a session.
   620 
   621 * The command-line tool "dump" dumps information from the cumulative
   622 PIDE session database: many sessions may be loaded into a given logic
   623 image, results from all loaded theories are written to the output
   624 directory.
   625 
   626 * Command-line tool "isabelle imports -I" also reports actual session
   627 imports. This helps to minimize the session dependency graph.
   628 
   629 * The command-line tool "export" and 'export_files' in session ROOT
   630 entries retrieve theory exports from the session build database.
   631 
   632 * The command-line tools "isabelle server" and "isabelle client" provide
   633 access to the Isabelle Server: it supports responsive session management
   634 and concurrent use of theories, based on Isabelle/PIDE infrastructure.
   635 See also the "system" manual.
   636 
   637 * The command-line tool "isabelle update_comments" normalizes formal
   638 comments in outer syntax as follows: \<comment> \<open>text\<close> (whith a single space to
   639 approximate the appearance in document output). This is more specific
   640 than former "isabelle update_cartouches -c": the latter tool option has
   641 been discontinued.
   642 
   643 * The command-line tool "isabelle mkroot" now always produces a document
   644 outline: its options have been adapted accordingly. INCOMPATIBILITY.
   645 
   646 * The command-line tool "isabelle mkroot -I" initializes a Mercurial
   647 repository for the generated session files.
   648 
   649 * Settings ISABELLE_HEAPS + ISABELLE_BROWSER_INFO (or
   650 ISABELLE_HEAPS_SYSTEM + ISABELLE_BROWSER_INFO_SYSTEM in "system build
   651 mode") determine the directory locations of the main build artefacts --
   652 instead of hard-wired directories in ISABELLE_HOME_USER (or
   653 ISABELLE_HOME).
   654 
   655 * Settings ISABELLE_PATH and ISABELLE_OUTPUT have been discontinued:
   656 heap images and session databases are always stored in
   657 $ISABELLE_HEAPS/$ML_IDENTIFIER (command-line default) or
   658 $ISABELLE_HEAPS_SYSTEM/$ML_IDENTIFIER (main Isabelle application or
   659 "isabelle jedit -s" or "isabelle build -s").
   660 
   661 * ISABELLE_LATEX and ISABELLE_PDFLATEX now include platform-specific
   662 options for improved error reporting. Potential INCOMPATIBILITY with
   663 unusual LaTeX installations, may have to adapt these settings.
   664 
   665 * Update to Poly/ML 5.7.1 with slightly improved performance and PIDE
   666 markup for identifier bindings. It now uses The GNU Multiple Precision
   667 Arithmetic Library (libgmp) on all platforms, notably Mac OS X with
   668 32/64 bit.
   669 
   670 
   671 
   672 New in Isabelle2017 (October 2017)
   673 ----------------------------------
   674 
   675 *** General ***
   676 
   677 * Experimental support for Visual Studio Code (VSCode) as alternative
   678 Isabelle/PIDE front-end, see also
   679 https://marketplace.visualstudio.com/items?itemName=makarius.Isabelle2017
   680 
   681 VSCode is a new type of application that continues the concepts of
   682 "programmer's editor" and "integrated development environment" towards
   683 fully semantic editing and debugging -- in a relatively light-weight
   684 manner. Thus it fits nicely on top of the Isabelle/PIDE infrastructure.
   685 Technically, VSCode is based on the Electron application framework
   686 (Node.js + Chromium browser + V8), which is implemented in JavaScript
   687 and TypeScript, while Isabelle/VSCode mainly consists of Isabelle/Scala
   688 modules around a Language Server implementation.
   689 
   690 * Theory names are qualified by the session name that they belong to.
   691 This affects imports, but not the theory name space prefix (which is
   692 just the theory base name as before).
   693 
   694 In order to import theories from other sessions, the ROOT file format
   695 provides a new 'sessions' keyword. In contrast, a theory that is
   696 imported in the old-fashioned manner via an explicit file-system path
   697 belongs to the current session, and might cause theory name conflicts
   698 later on. Theories that are imported from other sessions are excluded
   699 from the current session document. The command-line tool "isabelle
   700 imports" helps to update theory imports.
   701 
   702 * The main theory entry points for some non-HOL sessions have changed,
   703 to avoid confusion with the global name "Main" of the session HOL. This
   704 leads to the follow renamings:
   705 
   706   CTT/Main.thy    ~>  CTT/CTT.thy
   707   ZF/Main.thy     ~>  ZF/ZF.thy
   708   ZF/Main_ZF.thy  ~>  ZF/ZF.thy
   709   ZF/Main_ZFC.thy ~>  ZF/ZFC.thy
   710   ZF/ZF.thy       ~>  ZF/ZF_Base.thy
   711 
   712 INCOMPATIBILITY.
   713 
   714 * Commands 'alias' and 'type_alias' introduce aliases for constants and
   715 type constructors, respectively. This allows adhoc changes to name-space
   716 accesses within global or local theory contexts, e.g. within a 'bundle'.
   717 
   718 * Document antiquotations @{prf} and @{full_prf} output proof terms
   719 (again) in the same way as commands 'prf' and 'full_prf'.
   720 
   721 * Computations generated by the code generator can be embedded directly
   722 into ML, alongside with @{code} antiquotations, using the following
   723 antiquotations:
   724 
   725   @{computation ... terms: ... datatypes: ...} :
   726     ((term -> term) -> 'ml option -> 'a) -> Proof.context -> term -> 'a
   727   @{computation_conv ... terms: ... datatypes: ...} :
   728     (Proof.context -> 'ml -> conv) -> Proof.context -> conv
   729   @{computation_check terms: ... datatypes: ...} : Proof.context -> conv
   730 
   731 See src/HOL/ex/Computations.thy,
   732 src/HOL/Decision_Procs/Commutative_Ring.thy and
   733 src/HOL/Decision_Procs/Reflective_Field.thy for examples and the
   734 tutorial on code generation.
   735 
   736 
   737 *** Prover IDE -- Isabelle/Scala/jEdit ***
   738 
   739 * Session-qualified theory imports allow the Prover IDE to process
   740 arbitrary theory hierarchies independently of the underlying logic
   741 session image (e.g. option "isabelle jedit -l"), but the directory
   742 structure needs to be known in advance (e.g. option "isabelle jedit -d"
   743 or a line in the file $ISABELLE_HOME_USER/ROOTS).
   744 
   745 * The PIDE document model maintains file content independently of the
   746 status of jEdit editor buffers. Reloading jEdit buffers no longer causes
   747 changes of formal document content. Theory dependencies are always
   748 resolved internally, without the need for corresponding editor buffers.
   749 The system option "jedit_auto_load" has been discontinued: it is
   750 effectively always enabled.
   751 
   752 * The Theories dockable provides a "Purge" button, in order to restrict
   753 the document model to theories that are required for open editor
   754 buffers.
   755 
   756 * The Theories dockable indicates the overall status of checking of each
   757 entry. When all forked tasks of a theory are finished, the border is
   758 painted with thick lines; remaining errors in this situation are
   759 represented by a different border color.
   760 
   761 * Automatic indentation is more careful to avoid redundant spaces in
   762 intermediate situations. Keywords are indented after input (via typed
   763 characters or completion); see also option "jedit_indent_input".
   764 
   765 * Action "isabelle.preview" opens an HTML preview of the current theory
   766 document in the default web browser.
   767 
   768 * Command-line invocation "isabelle jedit -R -l LOGIC" opens the ROOT
   769 entry of the specified logic session in the editor, while its parent is
   770 used for formal checking.
   771 
   772 * The main Isabelle/jEdit plugin may be restarted manually (using the
   773 jEdit Plugin Manager), as long as the "Isabelle Base" plugin remains
   774 enabled at all times.
   775 
   776 * Update to current jedit-5.4.0.
   777 
   778 
   779 *** Pure ***
   780 
   781 * Deleting the last code equations for a particular function using
   782 [code del] results in function with no equations (runtime abort) rather
   783 than an unimplemented function (generation time abort). Use explicit
   784 [[code drop:]] to enforce the latter. Minor INCOMPATIBILITY.
   785 
   786 * Proper concept of code declarations in code.ML:
   787   - Regular code declarations act only on the global theory level, being
   788     ignored with warnings if syntactically malformed.
   789   - Explicitly global code declarations yield errors if syntactically
   790     malformed.
   791   - Default code declarations are silently ignored if syntactically
   792     malformed.
   793 Minor INCOMPATIBILITY.
   794 
   795 * Clarified and standardized internal data bookkeeping of code
   796 declarations: history of serials allows to track potentially
   797 non-monotonous declarations appropriately. Minor INCOMPATIBILITY.
   798 
   799 
   800 *** HOL ***
   801 
   802 * The Nunchaku model finder is now part of "Main".
   803 
   804 * SMT module:
   805   - A new option, 'smt_nat_as_int', has been added to translate 'nat' to
   806     'int' and benefit from the SMT solver's theory reasoning. It is
   807     disabled by default.
   808   - The legacy module "src/HOL/Library/Old_SMT.thy" has been removed.
   809   - Several small issues have been rectified in the 'smt' command.
   810 
   811 * (Co)datatype package: The 'size_gen_o_map' lemma is no longer
   812 generated for datatypes with type class annotations. As a result, the
   813 tactic that derives it no longer fails on nested datatypes. Slight
   814 INCOMPATIBILITY.
   815 
   816 * Command and antiquotation "value" with modified default strategy:
   817 terms without free variables are always evaluated using plain evaluation
   818 only, with no fallback on normalization by evaluation. Minor
   819 INCOMPATIBILITY.
   820 
   821 * Theories "GCD" and "Binomial" are already included in "Main" (instead
   822 of "Complex_Main").
   823 
   824 * Constant "surj" is a full input/output abbreviation (again).
   825 Minor INCOMPATIBILITY.
   826 
   827 * Dropped aliasses RangeP, DomainP for Rangep, Domainp respectively.
   828 INCOMPATIBILITY.
   829 
   830 * Renamed ii to imaginary_unit in order to free up ii as a variable
   831 name. The syntax \<i> remains available. INCOMPATIBILITY.
   832 
   833 * Dropped abbreviations transP, antisymP, single_valuedP; use constants
   834 transp, antisymp, single_valuedp instead. INCOMPATIBILITY.
   835 
   836 * Constant "subseq" in Topological_Spaces has been removed -- it is
   837 subsumed by "strict_mono". Some basic lemmas specific to "subseq" have
   838 been renamed accordingly, e.g. "subseq_o" -> "strict_mono_o" etc.
   839 
   840 * Theory List: "sublist" renamed to "nths" in analogy with "nth", and
   841 "sublisteq" renamed to "subseq". Minor INCOMPATIBILITY.
   842 
   843 * Theory List: new generic function "sorted_wrt".
   844 
   845 * Named theorems mod_simps covers various congruence rules concerning
   846 mod, replacing former zmod_simps. INCOMPATIBILITY.
   847 
   848 * Swapped orientation of congruence rules mod_add_left_eq,
   849 mod_add_right_eq, mod_add_eq, mod_mult_left_eq, mod_mult_right_eq,
   850 mod_mult_eq, mod_minus_eq, mod_diff_left_eq, mod_diff_right_eq,
   851 mod_diff_eq. INCOMPATIBILITY.
   852 
   853 * Generalized some facts:
   854     measure_induct_rule
   855     measure_induct
   856     zminus_zmod ~> mod_minus_eq
   857     zdiff_zmod_left ~> mod_diff_left_eq
   858     zdiff_zmod_right ~> mod_diff_right_eq
   859     zmod_eq_dvd_iff ~> mod_eq_dvd_iff
   860 INCOMPATIBILITY.
   861 
   862 * Algebraic type class hierarchy of euclidean (semi)rings in HOL:
   863 euclidean_(semi)ring, euclidean_(semi)ring_cancel,
   864 unique_euclidean_(semi)ring; instantiation requires provision of a
   865 euclidean size.
   866 
   867 * Theory "HOL-Number_Theory.Euclidean_Algorithm" has been reworked:
   868   - Euclidean induction is available as rule eucl_induct.
   869   - Constants Euclidean_Algorithm.gcd, Euclidean_Algorithm.lcm,
   870     Euclidean_Algorithm.Gcd and Euclidean_Algorithm.Lcm allow
   871     easy instantiation of euclidean (semi)rings as GCD (semi)rings.
   872   - Coefficients obtained by extended euclidean algorithm are
   873     available as "bezout_coefficients".
   874 INCOMPATIBILITY.
   875 
   876 * Theory "Number_Theory.Totient" introduces basic notions about Euler's
   877 totient function previously hidden as solitary example in theory
   878 Residues. Definition changed so that "totient 1 = 1" in agreement with
   879 the literature. Minor INCOMPATIBILITY.
   880 
   881 * New styles in theory "HOL-Library.LaTeXsugar":
   882   - "dummy_pats" for printing equations with "_" on the lhs;
   883   - "eta_expand" for printing eta-expanded terms.
   884 
   885 * Theory "HOL-Library.Permutations": theorem bij_swap_ompose_bij has
   886 been renamed to bij_swap_compose_bij. INCOMPATIBILITY.
   887 
   888 * New theory "HOL-Library.Going_To_Filter" providing the "f going_to F"
   889 filter for describing points x such that f(x) is in the filter F.
   890 
   891 * Theory "HOL-Library.Formal_Power_Series": constants X/E/L/F have been
   892 renamed to fps_X/fps_exp/fps_ln/fps_hypergeo to avoid polluting the name
   893 space. INCOMPATIBILITY.
   894 
   895 * Theory "HOL-Library.FinFun" has been moved to AFP (again).
   896 INCOMPATIBILITY.
   897 
   898 * Theory "HOL-Library.FuncSet": some old and rarely used ASCII
   899 replacement syntax has been removed. INCOMPATIBILITY, standard syntax
   900 with symbols should be used instead. The subsequent commands help to
   901 reproduce the old forms, e.g. to simplify porting old theories:
   902 
   903 syntax (ASCII)
   904   "_PiE" :: "pttrn \<Rightarrow> 'a set \<Rightarrow> 'b set \<Rightarrow> ('a \<Rightarrow> 'b) set"  ("(3PIE _:_./ _)" 10)
   905   "_Pi"  :: "pttrn \<Rightarrow> 'a set \<Rightarrow> 'b set \<Rightarrow> ('a \<Rightarrow> 'b) set"  ("(3PI _:_./ _)" 10)
   906   "_lam" :: "pttrn \<Rightarrow> 'a set \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> ('a \<Rightarrow> 'b)"  ("(3%_:_./ _)" [0,0,3] 3)
   907 
   908 * Theory "HOL-Library.Multiset": the simprocs on subsets operators of
   909 multisets have been renamed:
   910 
   911   msetless_cancel_numerals ~> msetsubset_cancel
   912   msetle_cancel_numerals ~> msetsubset_eq_cancel
   913 
   914 INCOMPATIBILITY.
   915 
   916 * Theory "HOL-Library.Pattern_Aliases" provides input and output syntax
   917 for pattern aliases as known from Haskell, Scala and ML.
   918 
   919 * Theory "HOL-Library.Uprod" formalizes the type of unordered pairs.
   920 
   921 * Session HOL-Analysis: more material involving arcs, paths, covering
   922 spaces, innessential maps, retracts, infinite products, simplicial
   923 complexes. Baire Category theorem. Major results include the Jordan
   924 Curve Theorem and the Great Picard Theorem.
   925 
   926 * Session HOL-Algebra has been extended by additional lattice theory:
   927 the Knaster-Tarski fixed point theorem and Galois Connections.
   928 
   929 * Sessions HOL-Computational_Algebra and HOL-Number_Theory: new notions
   930 of squarefreeness, n-th powers, and prime powers.
   931 
   932 * Session "HOL-Computional_Algebra" covers many previously scattered
   933 theories, notably Euclidean_Algorithm, Factorial_Ring,
   934 Formal_Power_Series, Fraction_Field, Fundamental_Theorem_Algebra,
   935 Normalized_Fraction, Polynomial_FPS, Polynomial, Primes. Minor
   936 INCOMPATIBILITY.
   937 
   938 
   939 *** System ***
   940 
   941 * Isabelle/Scala: the SQL module supports access to relational
   942 databases, either as plain file (SQLite) or full-scale server
   943 (PostgreSQL via local port or remote ssh connection).
   944 
   945 * Results of "isabelle build" are recorded as SQLite database (i.e.
   946 "Application File Format" in the sense of
   947 https://www.sqlite.org/appfileformat.html). This allows systematic
   948 access via operations from module Sessions.Store in Isabelle/Scala.
   949 
   950 * System option "parallel_proofs" is 1 by default (instead of more
   951 aggressive 2). This requires less heap space and avoids burning parallel
   952 CPU cycles, while full subproof parallelization is enabled for repeated
   953 builds (according to parallel_subproofs_threshold).
   954 
   955 * System option "record_proofs" allows to change the global
   956 Proofterm.proofs variable for a session. Regular values are are 0, 1, 2;
   957 a negative value means the current state in the ML heap image remains
   958 unchanged.
   959 
   960 * Isabelle settings variable ISABELLE_SCALA_BUILD_OPTIONS has been
   961 renamed to ISABELLE_SCALAC_OPTIONS. Rare INCOMPATIBILITY.
   962 
   963 * Isabelle settings variables ISABELLE_WINDOWS_PLATFORM,
   964 ISABELLE_WINDOWS_PLATFORM32, ISABELLE_WINDOWS_PLATFORM64 indicate the
   965 native Windows platform (independently of the Cygwin installation). This
   966 is analogous to ISABELLE_PLATFORM, ISABELLE_PLATFORM32,
   967 ISABELLE_PLATFORM64.
   968 
   969 * Command-line tool "isabelle build_docker" builds a Docker image from
   970 the Isabelle application bundle for Linux. See also
   971 https://hub.docker.com/r/makarius/isabelle
   972 
   973 * Command-line tool "isabelle vscode_server" provides a Language Server
   974 Protocol implementation, e.g. for the Visual Studio Code editor. It
   975 serves as example for alternative PIDE front-ends.
   976 
   977 * Command-line tool "isabelle imports" helps to maintain theory imports
   978 wrt. session structure. Examples for the main Isabelle distribution:
   979 
   980   isabelle imports -I -a
   981   isabelle imports -U -a
   982   isabelle imports -U -i -a
   983   isabelle imports -M -a -d '~~/src/Benchmarks'
   984 
   985 
   986 
   987 New in Isabelle2016-1 (December 2016)
   988 -------------------------------------
   989 
   990 *** General ***
   991 
   992 * Splitter in proof methods "simp", "auto" and friends:
   993   - The syntax "split add" has been discontinued, use plain "split",
   994     INCOMPATIBILITY.
   995   - For situations with many conditional or case expressions, there is
   996     an alternative splitting strategy that can be much faster. It is
   997     selected by writing "split!" instead of "split". It applies safe
   998     introduction and elimination rules after each split rule. As a
   999     result the subgoal may be split into several subgoals.
  1000 
  1001 * Command 'bundle' provides a local theory target to define a bundle
  1002 from the body of specification commands (such as 'declare',
  1003 'declaration', 'notation', 'lemmas', 'lemma'). For example:
  1004 
  1005 bundle foo
  1006 begin
  1007   declare a [simp]
  1008   declare b [intro]
  1009 end
  1010 
  1011 * Command 'unbundle' is like 'include', but works within a local theory
  1012 context. Unlike "context includes ... begin", the effect of 'unbundle'
  1013 on the target context persists, until different declarations are given.
  1014 
  1015 * Simplified outer syntax: uniform category "name" includes long
  1016 identifiers. Former "xname" / "nameref" / "name reference" has been
  1017 discontinued.
  1018 
  1019 * Embedded content (e.g. the inner syntax of types, terms, props) may be
  1020 delimited uniformly via cartouches. This works better than old-fashioned
  1021 quotes when sub-languages are nested.
  1022 
  1023 * Mixfix annotations support general block properties, with syntax
  1024 "(\<open>x=a y=b z \<dots>\<close>". Notable property names are "indent", "consistent",
  1025 "unbreakable", "markup". The existing notation "(DIGITS" is equivalent
  1026 to "(\<open>indent=DIGITS\<close>". The former notation "(00" for unbreakable blocks
  1027 is superseded by "(\<open>unbreabable\<close>" --- rare INCOMPATIBILITY.
  1028 
  1029 * Proof method "blast" is more robust wrt. corner cases of Pure
  1030 statements without object-logic judgment.
  1031 
  1032 * Commands 'prf' and 'full_prf' are somewhat more informative (again):
  1033 proof terms are reconstructed and cleaned from administrative thm nodes.
  1034 
  1035 * Code generator: config option "code_timing" triggers measurements of
  1036 different phases of code generation. See src/HOL/ex/Code_Timing.thy for
  1037 examples.
  1038 
  1039 * Code generator: implicits in Scala (stemming from type class
  1040 instances) are generated into companion object of corresponding type
  1041 class, to resolve some situations where ambiguities may occur.
  1042 
  1043 * Solve direct: option "solve_direct_strict_warnings" gives explicit
  1044 warnings for lemma statements with trivial proofs.
  1045 
  1046 
  1047 *** Prover IDE -- Isabelle/Scala/jEdit ***
  1048 
  1049 * More aggressive flushing of machine-generated input, according to
  1050 system option editor_generated_input_delay (in addition to existing
  1051 editor_input_delay for regular user edits). This may affect overall PIDE
  1052 reactivity and CPU usage.
  1053 
  1054 * Syntactic indentation according to Isabelle outer syntax. Action
  1055 "indent-lines" (shortcut C+i) indents the current line according to
  1056 command keywords and some command substructure. Action
  1057 "isabelle.newline" (shortcut ENTER) indents the old and the new line
  1058 according to command keywords only; see also option
  1059 "jedit_indent_newline".
  1060 
  1061 * Semantic indentation for unstructured proof scripts ('apply' etc.) via
  1062 number of subgoals. This requires information of ongoing document
  1063 processing and may thus lag behind, when the user is editing too
  1064 quickly; see also option "jedit_script_indent" and
  1065 "jedit_script_indent_limit".
  1066 
  1067 * Refined folding mode "isabelle" based on Isar syntax: 'next' and 'qed'
  1068 are treated as delimiters for fold structure; 'begin' and 'end'
  1069 structure of theory specifications is treated as well.
  1070 
  1071 * Command 'proof' provides information about proof outline with cases,
  1072 e.g. for proof methods "cases", "induct", "goal_cases".
  1073 
  1074 * Completion templates for commands involving "begin ... end" blocks,
  1075 e.g. 'context', 'notepad'.
  1076 
  1077 * Sidekick parser "isabelle-context" shows nesting of context blocks
  1078 according to 'begin' and 'end' structure.
  1079 
  1080 * Highlighting of entity def/ref positions wrt. cursor.
  1081 
  1082 * Action "isabelle.select-entity" (shortcut CS+ENTER) selects all
  1083 occurrences of the formal entity at the caret position. This facilitates
  1084 systematic renaming.
  1085 
  1086 * PIDE document markup works across multiple Isar commands, e.g. the
  1087 results established at the end of a proof are properly identified in the
  1088 theorem statement.
  1089 
  1090 * Cartouche abbreviations work both for " and ` to accomodate typical
  1091 situations where old ASCII notation may be updated.
  1092 
  1093 * Dockable window "Symbols" also provides access to 'abbrevs' from the
  1094 outer syntax of the current theory buffer. This provides clickable
  1095 syntax templates, including entries with empty abbrevs name (which are
  1096 inaccessible via keyboard completion).
  1097 
  1098 * IDE support for the Isabelle/Pure bootstrap process, with the
  1099 following independent stages:
  1100 
  1101   src/Pure/ROOT0.ML
  1102   src/Pure/ROOT.ML
  1103   src/Pure/Pure.thy
  1104   src/Pure/ML_Bootstrap.thy
  1105 
  1106 The ML ROOT files act like quasi-theories in the context of theory
  1107 ML_Bootstrap: this allows continuous checking of all loaded ML files.
  1108 The theory files are presented with a modified header to import Pure
  1109 from the running Isabelle instance. Results from changed versions of
  1110 each stage are *not* propagated to the next stage, and isolated from the
  1111 actual Isabelle/Pure that runs the IDE itself. The sequential
  1112 dependencies of the above files are only observed for batch build.
  1113 
  1114 * Isabelle/ML and Standard ML files are presented in Sidekick with the
  1115 tree structure of section headings: this special comment format is
  1116 described in "implementation" chapter 0, e.g. (*** section ***).
  1117 
  1118 * Additional abbreviations for syntactic completion may be specified
  1119 within the theory header as 'abbrevs'. The theory syntax for 'keywords'
  1120 has been simplified accordingly: optional abbrevs need to go into the
  1121 new 'abbrevs' section.
  1122 
  1123 * Global abbreviations via $ISABELLE_HOME/etc/abbrevs and
  1124 $ISABELLE_HOME_USER/etc/abbrevs are no longer supported. Minor
  1125 INCOMPATIBILITY, use 'abbrevs' within theory header instead.
  1126 
  1127 * Action "isabelle.keymap-merge" asks the user to resolve pending
  1128 Isabelle keymap changes that are in conflict with the current jEdit
  1129 keymap; non-conflicting changes are always applied implicitly. This
  1130 action is automatically invoked on Isabelle/jEdit startup and thus
  1131 increases chances that users see new keyboard shortcuts when re-using
  1132 old keymaps.
  1133 
  1134 * ML and document antiquotations for file-systems paths are more uniform
  1135 and diverse:
  1136 
  1137   @{path NAME}   -- no file-system check
  1138   @{file NAME}   -- check for plain file
  1139   @{dir NAME}    -- check for directory
  1140 
  1141 Minor INCOMPATIBILITY, former uses of @{file} and @{file_unchecked} may
  1142 have to be changed.
  1143 
  1144 
  1145 *** Document preparation ***
  1146 
  1147 * New symbol \<circle>, e.g. for temporal operator.
  1148 
  1149 * New document and ML antiquotation @{locale} for locales, similar to
  1150 existing antiquotation @{class}.
  1151 
  1152 * Mixfix annotations support delimiters like \<^control>\<open>cartouche\<close> --
  1153 this allows special forms of document output.
  1154 
  1155 * Raw LaTeX output now works via \<^latex>\<open>...\<close> instead of raw control
  1156 symbol \<^raw:...>. INCOMPATIBILITY, notably for LaTeXsugar.thy and its
  1157 derivatives.
  1158 
  1159 * \<^raw:...> symbols are no longer supported.
  1160 
  1161 * Old 'header' command is no longer supported (legacy since
  1162 Isabelle2015).
  1163 
  1164 
  1165 *** Isar ***
  1166 
  1167 * Many specification elements support structured statements with 'if' /
  1168 'for' eigen-context, e.g. 'axiomatization', 'abbreviation',
  1169 'definition', 'inductive', 'function'.
  1170 
  1171 * Toplevel theorem statements support eigen-context notation with 'if' /
  1172 'for' (in postfix), which corresponds to 'assumes' / 'fixes' in the
  1173 traditional long statement form (in prefix). Local premises are called
  1174 "that" or "assms", respectively. Empty premises are *not* bound in the
  1175 context: INCOMPATIBILITY.
  1176 
  1177 * Command 'define' introduces a local (non-polymorphic) definition, with
  1178 optional abstraction over local parameters. The syntax resembles
  1179 'definition' and 'obtain'. It fits better into the Isar language than
  1180 old 'def', which is now a legacy feature.
  1181 
  1182 * Command 'obtain' supports structured statements with 'if' / 'for'
  1183 context.
  1184 
  1185 * Command '\<proof>' is an alias for 'sorry', with different
  1186 typesetting. E.g. to produce proof holes in examples and documentation.
  1187 
  1188 * The defining position of a literal fact \<open>prop\<close> is maintained more
  1189 carefully, and made accessible as hyperlink in the Prover IDE.
  1190 
  1191 * Commands 'finally' and 'ultimately' used to expose the result as
  1192 literal fact: this accidental behaviour has been discontinued. Rare
  1193 INCOMPATIBILITY, use more explicit means to refer to facts in Isar.
  1194 
  1195 * Command 'axiomatization' has become more restrictive to correspond
  1196 better to internal axioms as singleton facts with mandatory name. Minor
  1197 INCOMPATIBILITY.
  1198 
  1199 * Proof methods may refer to the main facts via the dynamic fact
  1200 "method_facts". This is particularly useful for Eisbach method
  1201 definitions.
  1202 
  1203 * Proof method "use" allows to modify the main facts of a given method
  1204 expression, e.g.
  1205 
  1206   (use facts in simp)
  1207   (use facts in \<open>simp add: ...\<close>)
  1208 
  1209 * The old proof method "default" has been removed (legacy since
  1210 Isabelle2016). INCOMPATIBILITY, use "standard" instead.
  1211 
  1212 
  1213 *** Pure ***
  1214 
  1215 * Pure provides basic versions of proof methods "simp" and "simp_all"
  1216 that only know about meta-equality (==). Potential INCOMPATIBILITY in
  1217 theory imports that merge Pure with e.g. Main of Isabelle/HOL: the order
  1218 is relevant to avoid confusion of Pure.simp vs. HOL.simp.
  1219 
  1220 * The command 'unfolding' and proof method "unfold" include a second
  1221 stage where given equations are passed through the attribute "abs_def"
  1222 before rewriting. This ensures that definitions are fully expanded,
  1223 regardless of the actual parameters that are provided. Rare
  1224 INCOMPATIBILITY in some corner cases: use proof method (simp only:)
  1225 instead, or declare [[unfold_abs_def = false]] in the proof context.
  1226 
  1227 * Type-inference improves sorts of newly introduced type variables for
  1228 the object-logic, using its base sort (i.e. HOL.type for Isabelle/HOL).
  1229 Thus terms like "f x" or "\<And>x. P x" without any further syntactic context
  1230 produce x::'a::type in HOL instead of x::'a::{} in Pure. Rare
  1231 INCOMPATIBILITY, need to provide explicit type constraints for Pure
  1232 types where this is really intended.
  1233 
  1234 
  1235 *** HOL ***
  1236 
  1237 * New proof method "argo" using the built-in Argo solver based on SMT
  1238 technology. The method can be used to prove goals of quantifier-free
  1239 propositional logic, goals based on a combination of quantifier-free
  1240 propositional logic with equality, and goals based on a combination of
  1241 quantifier-free propositional logic with linear real arithmetic
  1242 including min/max/abs. See HOL/ex/Argo_Examples.thy for examples.
  1243 
  1244 * The new "nunchaku" command integrates the Nunchaku model finder. The
  1245 tool is experimental. See ~~/src/HOL/Nunchaku/Nunchaku.thy for details.
  1246 
  1247 * Metis: The problem encoding has changed very slightly. This might
  1248 break existing proofs. INCOMPATIBILITY.
  1249 
  1250 * Sledgehammer:
  1251   - The MaSh relevance filter is now faster than before.
  1252   - Produce syntactically correct Vampire 4.0 problem files.
  1253 
  1254 * (Co)datatype package:
  1255   - New commands for defining corecursive functions and reasoning about
  1256     them in "~~/src/HOL/Library/BNF_Corec.thy": 'corec', 'corecursive',
  1257     'friend_of_corec', and 'corecursion_upto'; and 'corec_unique' proof
  1258     method. See 'isabelle doc corec'.
  1259   - The predicator :: ('a \<Rightarrow> bool) \<Rightarrow> 'a F \<Rightarrow> bool is now a first-class
  1260     citizen in bounded natural functors.
  1261   - 'primrec' now allows nested calls through the predicator in addition
  1262     to the map function.
  1263   - 'bnf' automatically discharges reflexive proof obligations.
  1264   - 'bnf' outputs a slightly modified proof obligation expressing rel in
  1265        terms of map and set
  1266        (not giving a specification for rel makes this one reflexive).
  1267   - 'bnf' outputs a new proof obligation expressing pred in terms of set
  1268        (not giving a specification for pred makes this one reflexive).
  1269     INCOMPATIBILITY: manual 'bnf' declarations may need adjustment.
  1270   - Renamed lemmas:
  1271       rel_prod_apply ~> rel_prod_inject
  1272       pred_prod_apply ~> pred_prod_inject
  1273     INCOMPATIBILITY.
  1274   - The "size" plugin has been made compatible again with locales.
  1275   - The theorems about "rel" and "set" may have a slightly different (but
  1276     equivalent) form.
  1277     INCOMPATIBILITY.
  1278 
  1279 * The 'coinductive' command produces a proper coinduction rule for
  1280 mutual coinductive predicates. This new rule replaces the old rule,
  1281 which exposed details of the internal fixpoint construction and was
  1282 hard to use. INCOMPATIBILITY.
  1283 
  1284 * New abbreviations for negated existence (but not bounded existence):
  1285 
  1286   \<nexists>x. P x \<equiv> \<not> (\<exists>x. P x)
  1287   \<nexists>!x. P x \<equiv> \<not> (\<exists>!x. P x)
  1288 
  1289 * The print mode "HOL" for ASCII syntax of binders "!", "?", "?!", "@"
  1290 has been removed for output. It is retained for input only, until it is
  1291 eliminated altogether.
  1292 
  1293 * The unique existence quantifier no longer provides 'binder' syntax,
  1294 but uses syntax translations (as for bounded unique existence). Thus
  1295 iterated quantification \<exists>!x y. P x y with its slightly confusing
  1296 sequential meaning \<exists>!x. \<exists>!y. P x y is no longer possible. Instead,
  1297 pattern abstraction admits simultaneous unique existence \<exists>!(x, y). P x y
  1298 (analogous to existing notation \<exists>!(x, y)\<in>A. P x y). Potential
  1299 INCOMPATIBILITY in rare situations.
  1300 
  1301 * Conventional syntax "%(). t" for unit abstractions. Slight syntactic
  1302 INCOMPATIBILITY.
  1303 
  1304 * Renamed constants and corresponding theorems:
  1305 
  1306     setsum ~> sum
  1307     setprod ~> prod
  1308     listsum ~> sum_list
  1309     listprod ~> prod_list
  1310 
  1311 INCOMPATIBILITY.
  1312 
  1313 * Sligthly more standardized theorem names:
  1314     sgn_times ~> sgn_mult
  1315     sgn_mult' ~> Real_Vector_Spaces.sgn_mult
  1316     divide_zero_left ~> div_0
  1317     zero_mod_left ~> mod_0
  1318     divide_zero ~> div_by_0
  1319     divide_1 ~> div_by_1
  1320     nonzero_mult_divide_cancel_left ~> nonzero_mult_div_cancel_left
  1321     div_mult_self1_is_id ~> nonzero_mult_div_cancel_left
  1322     nonzero_mult_divide_cancel_right ~> nonzero_mult_div_cancel_right
  1323     div_mult_self2_is_id ~> nonzero_mult_div_cancel_right
  1324     is_unit_divide_mult_cancel_left ~> is_unit_div_mult_cancel_left
  1325     is_unit_divide_mult_cancel_right ~> is_unit_div_mult_cancel_right
  1326     mod_div_equality ~> div_mult_mod_eq
  1327     mod_div_equality2 ~> mult_div_mod_eq
  1328     mod_div_equality3 ~> mod_div_mult_eq
  1329     mod_div_equality4 ~> mod_mult_div_eq
  1330     minus_div_eq_mod ~> minus_div_mult_eq_mod
  1331     minus_div_eq_mod2 ~> minus_mult_div_eq_mod
  1332     minus_mod_eq_div ~> minus_mod_eq_div_mult
  1333     minus_mod_eq_div2 ~> minus_mod_eq_mult_div
  1334     div_mod_equality' ~> minus_mod_eq_div_mult [symmetric]
  1335     mod_div_equality' ~> minus_div_mult_eq_mod [symmetric]
  1336     zmod_zdiv_equality ~> mult_div_mod_eq [symmetric]
  1337     zmod_zdiv_equality' ~> minus_div_mult_eq_mod [symmetric]
  1338     Divides.mult_div_cancel ~> minus_mod_eq_mult_div [symmetric]
  1339     mult_div_cancel ~> minus_mod_eq_mult_div [symmetric]
  1340     zmult_div_cancel ~> minus_mod_eq_mult_div [symmetric]
  1341     div_1 ~> div_by_Suc_0
  1342     mod_1 ~> mod_by_Suc_0
  1343 INCOMPATIBILITY.
  1344 
  1345 * New type class "idom_abs_sgn" specifies algebraic properties
  1346 of sign and absolute value functions.  Type class "sgn_if" has
  1347 disappeared.  Slight INCOMPATIBILITY.
  1348 
  1349 * Dedicated syntax LENGTH('a) for length of types.
  1350 
  1351 * Characters (type char) are modelled as finite algebraic type
  1352 corresponding to {0..255}.
  1353 
  1354   - Logical representation:
  1355     * 0 is instantiated to the ASCII zero character.
  1356     * All other characters are represented as "Char n"
  1357       with n being a raw numeral expression less than 256.
  1358     * Expressions of the form "Char n" with n greater than 255
  1359       are non-canonical.
  1360   - Printing and parsing:
  1361     * Printable characters are printed and parsed as "CHR ''\<dots>''"
  1362       (as before).
  1363     * The ASCII zero character is printed and parsed as "0".
  1364     * All other canonical characters are printed as "CHR 0xXX"
  1365       with XX being the hexadecimal character code.  "CHR n"
  1366       is parsable for every numeral expression n.
  1367     * Non-canonical characters have no special syntax and are
  1368       printed as their logical representation.
  1369   - Explicit conversions from and to the natural numbers are
  1370     provided as char_of_nat, nat_of_char (as before).
  1371   - The auxiliary nibble type has been discontinued.
  1372 
  1373 INCOMPATIBILITY.
  1374 
  1375 * Type class "div" with operation "mod" renamed to type class "modulo"
  1376 with operation "modulo", analogously to type class "divide". This
  1377 eliminates the need to qualify any of those names in the presence of
  1378 infix "mod" syntax. INCOMPATIBILITY.
  1379 
  1380 * Statements and proofs of Knaster-Tarski fixpoint combinators lfp/gfp
  1381 have been clarified. The fixpoint properties are lfp_fixpoint, its
  1382 symmetric lfp_unfold (as before), and the duals for gfp. Auxiliary items
  1383 for the proof (lfp_lemma2 etc.) are no longer exported, but can be
  1384 easily recovered by composition with eq_refl. Minor INCOMPATIBILITY.
  1385 
  1386 * Constant "surj" is a mere input abbreviation, to avoid hiding an
  1387 equation in term output. Minor INCOMPATIBILITY.
  1388 
  1389 * Command 'code_reflect' accepts empty constructor lists for datatypes,
  1390 which renders those abstract effectively.
  1391 
  1392 * Command 'export_code' checks given constants for abstraction
  1393 violations: a small guarantee that given constants specify a safe
  1394 interface for the generated code.
  1395 
  1396 * Code generation for Scala: ambiguous implicts in class diagrams are
  1397 spelt out explicitly.
  1398 
  1399 * Static evaluators (Code_Evaluation.static_* in Isabelle/ML) rely on
  1400 explicitly provided auxiliary definitions for required type class
  1401 dictionaries rather than half-working magic. INCOMPATIBILITY, see the
  1402 tutorial on code generation for details.
  1403 
  1404 * Theory Set_Interval: substantial new theorems on indexed sums and
  1405 products.
  1406 
  1407 * Locale bijection establishes convenient default simp rules such as
  1408 "inv f (f a) = a" for total bijections.
  1409 
  1410 * Abstract locales semigroup, abel_semigroup, semilattice,
  1411 semilattice_neutr, ordering, ordering_top, semilattice_order,
  1412 semilattice_neutr_order, comm_monoid_set, semilattice_set,
  1413 semilattice_neutr_set, semilattice_order_set,
  1414 semilattice_order_neutr_set monoid_list, comm_monoid_list,
  1415 comm_monoid_list_set, comm_monoid_mset, comm_monoid_fun use boldified
  1416 syntax uniformly that does not clash with corresponding global syntax.
  1417 INCOMPATIBILITY.
  1418 
  1419 * Former locale lifting_syntax is now a bundle, which is easier to
  1420 include in a local context or theorem statement, e.g. "context includes
  1421 lifting_syntax begin ... end". Minor INCOMPATIBILITY.
  1422 
  1423 * Some old / obsolete theorems have been renamed / removed, potential
  1424 INCOMPATIBILITY.
  1425 
  1426   nat_less_cases  --  removed, use linorder_cases instead
  1427   inv_image_comp  --  removed, use image_inv_f_f instead
  1428   image_surj_f_inv_f  ~>  image_f_inv_f
  1429 
  1430 * Some theorems about groups and orders have been generalised from
  1431   groups to semi-groups that are also monoids:
  1432     le_add_same_cancel1
  1433     le_add_same_cancel2
  1434     less_add_same_cancel1
  1435     less_add_same_cancel2
  1436     add_le_same_cancel1
  1437     add_le_same_cancel2
  1438     add_less_same_cancel1
  1439     add_less_same_cancel2
  1440 
  1441 * Some simplifications theorems about rings have been removed, since
  1442   superseeded by a more general version:
  1443     less_add_cancel_left_greater_zero ~> less_add_same_cancel1
  1444     less_add_cancel_right_greater_zero ~> less_add_same_cancel2
  1445     less_eq_add_cancel_left_greater_eq_zero ~> le_add_same_cancel1
  1446     less_eq_add_cancel_right_greater_eq_zero ~> le_add_same_cancel2
  1447     less_eq_add_cancel_left_less_eq_zero ~> add_le_same_cancel1
  1448     less_eq_add_cancel_right_less_eq_zero ~> add_le_same_cancel2
  1449     less_add_cancel_left_less_zero ~> add_less_same_cancel1
  1450     less_add_cancel_right_less_zero ~> add_less_same_cancel2
  1451 INCOMPATIBILITY.
  1452 
  1453 * Renamed split_if -> if_split and split_if_asm -> if_split_asm to
  1454 resemble the f.split naming convention, INCOMPATIBILITY.
  1455 
  1456 * Added class topological_monoid.
  1457 
  1458 * The following theorems have been renamed:
  1459 
  1460   setsum_left_distrib ~> sum_distrib_right
  1461   setsum_right_distrib ~> sum_distrib_left
  1462 
  1463 INCOMPATIBILITY.
  1464 
  1465 * Compound constants INFIMUM and SUPREMUM are mere abbreviations now.
  1466 INCOMPATIBILITY.
  1467 
  1468 * "Gcd (f ` A)" and "Lcm (f ` A)" are printed with optional
  1469 comprehension-like syntax analogously to "Inf (f ` A)" and "Sup (f `
  1470 A)".
  1471 
  1472 * Class semiring_Lcd merged into semiring_Gcd. INCOMPATIBILITY.
  1473 
  1474 * The type class ordered_comm_monoid_add is now called
  1475 ordered_cancel_comm_monoid_add. A new type class ordered_comm_monoid_add
  1476 is introduced as the combination of ordered_ab_semigroup_add +
  1477 comm_monoid_add. INCOMPATIBILITY.
  1478 
  1479 * Introduced the type classes canonically_ordered_comm_monoid_add and
  1480 dioid.
  1481 
  1482 * Introduced the type class ordered_ab_semigroup_monoid_add_imp_le. When
  1483 instantiating linordered_semiring_strict and ordered_ab_group_add, an
  1484 explicit instantiation of ordered_ab_semigroup_monoid_add_imp_le might
  1485 be required. INCOMPATIBILITY.
  1486 
  1487 * Dropped various legacy fact bindings, whose replacements are often
  1488 of a more general type also:
  1489   lcm_left_commute_nat ~> lcm.left_commute
  1490   lcm_left_commute_int ~> lcm.left_commute
  1491   gcd_left_commute_nat ~> gcd.left_commute
  1492   gcd_left_commute_int ~> gcd.left_commute
  1493   gcd_greatest_iff_nat ~> gcd_greatest_iff
  1494   gcd_greatest_iff_int ~> gcd_greatest_iff
  1495   coprime_dvd_mult_nat ~> coprime_dvd_mult
  1496   coprime_dvd_mult_int ~> coprime_dvd_mult
  1497   zpower_numeral_even ~> power_numeral_even
  1498   gcd_mult_cancel_nat ~> gcd_mult_cancel
  1499   gcd_mult_cancel_int ~> gcd_mult_cancel
  1500   div_gcd_coprime_nat ~> div_gcd_coprime
  1501   div_gcd_coprime_int ~> div_gcd_coprime
  1502   zpower_numeral_odd ~> power_numeral_odd
  1503   zero_less_int_conv ~> of_nat_0_less_iff
  1504   gcd_greatest_nat ~> gcd_greatest
  1505   gcd_greatest_int ~> gcd_greatest
  1506   coprime_mult_nat ~> coprime_mult
  1507   coprime_mult_int ~> coprime_mult
  1508   lcm_commute_nat ~> lcm.commute
  1509   lcm_commute_int ~> lcm.commute
  1510   int_less_0_conv ~> of_nat_less_0_iff
  1511   gcd_commute_nat ~> gcd.commute
  1512   gcd_commute_int ~> gcd.commute
  1513   Gcd_insert_nat ~> Gcd_insert
  1514   Gcd_insert_int ~> Gcd_insert
  1515   of_int_int_eq ~> of_int_of_nat_eq
  1516   lcm_least_nat ~> lcm_least
  1517   lcm_least_int ~> lcm_least
  1518   lcm_assoc_nat ~> lcm.assoc
  1519   lcm_assoc_int ~> lcm.assoc
  1520   int_le_0_conv ~> of_nat_le_0_iff
  1521   int_eq_0_conv ~> of_nat_eq_0_iff
  1522   Gcd_empty_nat ~> Gcd_empty
  1523   Gcd_empty_int ~> Gcd_empty
  1524   gcd_assoc_nat ~> gcd.assoc
  1525   gcd_assoc_int ~> gcd.assoc
  1526   zero_zle_int ~> of_nat_0_le_iff
  1527   lcm_dvd2_nat ~> dvd_lcm2
  1528   lcm_dvd2_int ~> dvd_lcm2
  1529   lcm_dvd1_nat ~> dvd_lcm1
  1530   lcm_dvd1_int ~> dvd_lcm1
  1531   gcd_zero_nat ~> gcd_eq_0_iff
  1532   gcd_zero_int ~> gcd_eq_0_iff
  1533   gcd_dvd2_nat ~> gcd_dvd2
  1534   gcd_dvd2_int ~> gcd_dvd2
  1535   gcd_dvd1_nat ~> gcd_dvd1
  1536   gcd_dvd1_int ~> gcd_dvd1
  1537   int_numeral ~> of_nat_numeral
  1538   lcm_ac_nat ~> ac_simps
  1539   lcm_ac_int ~> ac_simps
  1540   gcd_ac_nat ~> ac_simps
  1541   gcd_ac_int ~> ac_simps
  1542   abs_int_eq ~> abs_of_nat
  1543   zless_int ~> of_nat_less_iff
  1544   zdiff_int ~> of_nat_diff
  1545   zadd_int ~> of_nat_add
  1546   int_mult ~> of_nat_mult
  1547   int_Suc ~> of_nat_Suc
  1548   inj_int ~> inj_of_nat
  1549   int_1 ~> of_nat_1
  1550   int_0 ~> of_nat_0
  1551   Lcm_empty_nat ~> Lcm_empty
  1552   Lcm_empty_int ~> Lcm_empty
  1553   Lcm_insert_nat ~> Lcm_insert
  1554   Lcm_insert_int ~> Lcm_insert
  1555   comp_fun_idem_gcd_nat ~> comp_fun_idem_gcd
  1556   comp_fun_idem_gcd_int ~> comp_fun_idem_gcd
  1557   comp_fun_idem_lcm_nat ~> comp_fun_idem_lcm
  1558   comp_fun_idem_lcm_int ~> comp_fun_idem_lcm
  1559   Lcm_eq_0 ~> Lcm_eq_0_I
  1560   Lcm0_iff ~> Lcm_0_iff
  1561   Lcm_dvd_int ~> Lcm_least
  1562   divides_mult_nat ~> divides_mult
  1563   divides_mult_int ~> divides_mult
  1564   lcm_0_nat ~> lcm_0_right
  1565   lcm_0_int ~> lcm_0_right
  1566   lcm_0_left_nat ~> lcm_0_left
  1567   lcm_0_left_int ~> lcm_0_left
  1568   dvd_gcd_D1_nat ~> dvd_gcdD1
  1569   dvd_gcd_D1_int ~> dvd_gcdD1
  1570   dvd_gcd_D2_nat ~> dvd_gcdD2
  1571   dvd_gcd_D2_int ~> dvd_gcdD2
  1572   coprime_dvd_mult_iff_nat ~> coprime_dvd_mult_iff
  1573   coprime_dvd_mult_iff_int ~> coprime_dvd_mult_iff
  1574   realpow_minus_mult ~> power_minus_mult
  1575   realpow_Suc_le_self ~> power_Suc_le_self
  1576   dvd_Gcd, dvd_Gcd_nat, dvd_Gcd_int removed in favour of Gcd_greatest
  1577 INCOMPATIBILITY.
  1578 
  1579 * Renamed HOL/Quotient_Examples/FSet.thy to
  1580 HOL/Quotient_Examples/Quotient_FSet.thy INCOMPATIBILITY.
  1581 
  1582 * Session HOL-Library: theory FinFun bundles "finfun_syntax" and
  1583 "no_finfun_syntax" allow to control optional syntax in local contexts;
  1584 this supersedes former theory FinFun_Syntax. INCOMPATIBILITY, e.g. use
  1585 "unbundle finfun_syntax" to imitate import of
  1586 "~~/src/HOL/Library/FinFun_Syntax".
  1587 
  1588 * Session HOL-Library: theory Multiset_Permutations (executably) defines
  1589 the set of permutations of a given set or multiset, i.e. the set of all
  1590 lists that contain every element of the carrier (multi-)set exactly
  1591 once.
  1592 
  1593 * Session HOL-Library: multiset membership is now expressed using
  1594 set_mset rather than count.
  1595 
  1596   - Expressions "count M a > 0" and similar simplify to membership
  1597     by default.
  1598 
  1599   - Converting between "count M a = 0" and non-membership happens using
  1600     equations count_eq_zero_iff and not_in_iff.
  1601 
  1602   - Rules count_inI and in_countE obtain facts of the form
  1603     "count M a = n" from membership.
  1604 
  1605   - Rules count_in_diffI and in_diff_countE obtain facts of the form
  1606     "count M a = n + count N a" from membership on difference sets.
  1607 
  1608 INCOMPATIBILITY.
  1609 
  1610 * Session HOL-Library: theory LaTeXsugar uses new-style "dummy_pats" for
  1611 displaying equations in functional programming style --- variables
  1612 present on the left-hand but not on the righ-hand side are replaced by
  1613 underscores.
  1614 
  1615 * Session HOL-Library: theory Combinator_PER provides combinator to
  1616 build partial equivalence relations from a predicate and an equivalence
  1617 relation.
  1618 
  1619 * Session HOL-Library: theory Perm provides basic facts about almost
  1620 everywhere fix bijections.
  1621 
  1622 * Session HOL-Library: theory Normalized_Fraction allows viewing an
  1623 element of a field of fractions as a normalized fraction (i.e. a pair of
  1624 numerator and denominator such that the two are coprime and the
  1625 denominator is normalized wrt. unit factors).
  1626 
  1627 * Session HOL-NSA has been renamed to HOL-Nonstandard_Analysis.
  1628 
  1629 * Session HOL-Multivariate_Analysis has been renamed to HOL-Analysis.
  1630 
  1631 * Session HOL-Analysis: measure theory has been moved here from
  1632 HOL-Probability. When importing HOL-Analysis some theorems need
  1633 additional name spaces prefixes due to name clashes. INCOMPATIBILITY.
  1634 
  1635 * Session HOL-Analysis: more complex analysis including Cauchy's
  1636 inequality, Liouville theorem, open mapping theorem, maximum modulus
  1637 principle, Residue theorem, Schwarz Lemma.
  1638 
  1639 * Session HOL-Analysis: Theory of polyhedra: faces, extreme points,
  1640 polytopes, and the Krein–Milman Minkowski theorem.
  1641 
  1642 * Session HOL-Analysis: Numerous results ported from the HOL Light
  1643 libraries: homeomorphisms, continuous function extensions, invariance of
  1644 domain.
  1645 
  1646 * Session HOL-Probability: the type of emeasure and nn_integral was
  1647 changed from ereal to ennreal, INCOMPATIBILITY.
  1648 
  1649   emeasure :: 'a measure \<Rightarrow> 'a set \<Rightarrow> ennreal
  1650   nn_integral :: 'a measure \<Rightarrow> ('a \<Rightarrow> ennreal) \<Rightarrow> ennreal
  1651 
  1652 * Session HOL-Probability: Code generation and QuickCheck for
  1653 Probability Mass Functions.
  1654 
  1655 * Session HOL-Probability: theory Random_Permutations contains some
  1656 theory about choosing a permutation of a set uniformly at random and
  1657 folding over a list in random order.
  1658 
  1659 * Session HOL-Probability: theory SPMF formalises discrete
  1660 subprobability distributions.
  1661 
  1662 * Session HOL-Library: the names of multiset theorems have been
  1663 normalised to distinguish which ordering the theorems are about
  1664 
  1665     mset_less_eqI ~> mset_subset_eqI
  1666     mset_less_insertD ~> mset_subset_insertD
  1667     mset_less_eq_count ~> mset_subset_eq_count
  1668     mset_less_diff_self ~> mset_subset_diff_self
  1669     mset_le_exists_conv ~> mset_subset_eq_exists_conv
  1670     mset_le_mono_add_right_cancel ~> mset_subset_eq_mono_add_right_cancel
  1671     mset_le_mono_add_left_cancel ~> mset_subset_eq_mono_add_left_cancel
  1672     mset_le_mono_add ~> mset_subset_eq_mono_add
  1673     mset_le_add_left ~> mset_subset_eq_add_left
  1674     mset_le_add_right ~> mset_subset_eq_add_right
  1675     mset_le_single ~> mset_subset_eq_single
  1676     mset_le_multiset_union_diff_commute ~> mset_subset_eq_multiset_union_diff_commute
  1677     diff_le_self ~> diff_subset_eq_self
  1678     mset_leD ~> mset_subset_eqD
  1679     mset_lessD ~> mset_subsetD
  1680     mset_le_insertD ~> mset_subset_eq_insertD
  1681     mset_less_of_empty ~> mset_subset_of_empty
  1682     mset_less_size ~> mset_subset_size
  1683     wf_less_mset_rel ~> wf_subset_mset_rel
  1684     count_le_replicate_mset_le ~> count_le_replicate_mset_subset_eq
  1685     mset_remdups_le ~> mset_remdups_subset_eq
  1686     ms_lesseq_impl ~> subset_eq_mset_impl
  1687 
  1688 Some functions have been renamed:
  1689     ms_lesseq_impl -> subset_eq_mset_impl
  1690 
  1691 * HOL-Library: multisets are now ordered with the multiset ordering
  1692     #\<subseteq># ~> \<le>
  1693     #\<subset># ~> <
  1694     le_multiset ~> less_eq_multiset
  1695     less_multiset ~> le_multiset
  1696 INCOMPATIBILITY.
  1697 
  1698 * Session HOL-Library: the prefix multiset_order has been discontinued:
  1699 the theorems can be directly accessed. As a consequence, the lemmas
  1700 "order_multiset" and "linorder_multiset" have been discontinued, and the
  1701 interpretations "multiset_linorder" and "multiset_wellorder" have been
  1702 replaced by instantiations. INCOMPATIBILITY.
  1703 
  1704 * Session HOL-Library: some theorems about the multiset ordering have
  1705 been renamed:
  1706 
  1707     le_multiset_def ~> less_eq_multiset_def
  1708     less_multiset_def ~> le_multiset_def
  1709     less_eq_imp_le_multiset ~> subset_eq_imp_le_multiset
  1710     mult_less_not_refl ~> mset_le_not_refl
  1711     mult_less_trans ~> mset_le_trans
  1712     mult_less_not_sym ~> mset_le_not_sym
  1713     mult_less_asym ~> mset_le_asym
  1714     mult_less_irrefl ~> mset_le_irrefl
  1715     union_less_mono2{,1,2} ~> union_le_mono2{,1,2}
  1716 
  1717     le_multiset\<^sub>H\<^sub>O ~> less_eq_multiset\<^sub>H\<^sub>O
  1718     le_multiset_total ~> less_eq_multiset_total
  1719     less_multiset_right_total ~> subset_eq_imp_le_multiset
  1720     le_multiset_empty_left ~> less_eq_multiset_empty_left
  1721     le_multiset_empty_right ~> less_eq_multiset_empty_right
  1722     less_multiset_empty_right ~> le_multiset_empty_left
  1723     less_multiset_empty_left ~> le_multiset_empty_right
  1724     union_less_diff_plus ~> union_le_diff_plus
  1725     ex_gt_count_imp_less_multiset ~> ex_gt_count_imp_le_multiset
  1726     less_multiset_plus_left_nonempty ~> le_multiset_plus_left_nonempty
  1727     le_multiset_plus_right_nonempty ~> le_multiset_plus_right_nonempty
  1728 INCOMPATIBILITY.
  1729 
  1730 * Session HOL-Library: the lemma mset_map has now the attribute [simp].
  1731 INCOMPATIBILITY.
  1732 
  1733 * Session HOL-Library: some theorems about multisets have been removed.
  1734 INCOMPATIBILITY, use the following replacements:
  1735 
  1736     le_multiset_plus_plus_left_iff ~> add_less_cancel_right
  1737     less_multiset_plus_plus_left_iff ~> add_less_cancel_right
  1738     le_multiset_plus_plus_right_iff ~> add_less_cancel_left
  1739     less_multiset_plus_plus_right_iff ~> add_less_cancel_left
  1740     add_eq_self_empty_iff ~> add_cancel_left_right
  1741     mset_subset_add_bothsides ~> subset_mset.add_less_cancel_right
  1742     mset_less_add_bothsides ~> subset_mset.add_less_cancel_right
  1743     mset_le_add_bothsides ~> subset_mset.add_less_cancel_right
  1744     empty_inter ~> subset_mset.inf_bot_left
  1745     inter_empty ~> subset_mset.inf_bot_right
  1746     empty_sup ~> subset_mset.sup_bot_left
  1747     sup_empty ~> subset_mset.sup_bot_right
  1748     bdd_below_multiset ~> subset_mset.bdd_above_bot
  1749     subset_eq_empty ~> subset_mset.le_zero_eq
  1750     le_empty ~> subset_mset.le_zero_eq
  1751     mset_subset_empty_nonempty ~> subset_mset.zero_less_iff_neq_zero
  1752     mset_less_empty_nonempty ~> subset_mset.zero_less_iff_neq_zero
  1753 
  1754 * Session HOL-Library: some typeclass constraints about multisets have
  1755 been reduced from ordered or linordered to preorder. Multisets have the
  1756 additional typeclasses order_bot, no_top,
  1757 ordered_ab_semigroup_add_imp_le, ordered_cancel_comm_monoid_add,
  1758 linordered_cancel_ab_semigroup_add, and
  1759 ordered_ab_semigroup_monoid_add_imp_le. INCOMPATIBILITY.
  1760 
  1761 * Session HOL-Library: there are some new simplification rules about
  1762 multisets, the multiset ordering, and the subset ordering on multisets.
  1763 INCOMPATIBILITY.
  1764 
  1765 * Session HOL-Library: the subset ordering on multisets has now the
  1766 interpretations ordered_ab_semigroup_monoid_add_imp_le and
  1767 bounded_lattice_bot. INCOMPATIBILITY.
  1768 
  1769 * Session HOL-Library, theory Multiset: single has been removed in favor
  1770 of add_mset that roughly corresponds to Set.insert. Some theorems have
  1771 removed or changed:
  1772 
  1773   single_not_empty ~> add_mset_not_empty or empty_not_add_mset
  1774   fold_mset_insert ~> fold_mset_add_mset
  1775   image_mset_insert ~> image_mset_add_mset
  1776   union_single_eq_diff
  1777   multi_self_add_other_not_self
  1778   diff_single_eq_union
  1779 INCOMPATIBILITY.
  1780 
  1781 * Session HOL-Library, theory Multiset: some theorems have been changed
  1782 to use add_mset instead of single:
  1783 
  1784   mset_add
  1785   multi_self_add_other_not_self
  1786   diff_single_eq_union
  1787   union_single_eq_diff
  1788   union_single_eq_member
  1789   add_eq_conv_diff
  1790   insert_noteq_member
  1791   add_eq_conv_ex
  1792   multi_member_split
  1793   multiset_add_sub_el_shuffle
  1794   mset_subset_eq_insertD
  1795   mset_subset_insertD
  1796   insert_subset_eq_iff
  1797   insert_union_subset_iff
  1798   multi_psub_of_add_self
  1799   inter_add_left1
  1800   inter_add_left2
  1801   inter_add_right1
  1802   inter_add_right2
  1803   sup_union_left1
  1804   sup_union_left2
  1805   sup_union_right1
  1806   sup_union_right2
  1807   size_eq_Suc_imp_eq_union
  1808   multi_nonempty_split
  1809   mset_insort
  1810   mset_update
  1811   mult1I
  1812   less_add
  1813   mset_zip_take_Cons_drop_twice
  1814   rel_mset_Zero
  1815   msed_map_invL
  1816   msed_map_invR
  1817   msed_rel_invL
  1818   msed_rel_invR
  1819   le_multiset_right_total
  1820   multiset_induct
  1821   multiset_induct2_size
  1822   multiset_induct2
  1823 INCOMPATIBILITY.
  1824 
  1825 * Session HOL-Library, theory Multiset: the definitions of some
  1826 constants have changed to use add_mset instead of adding a single
  1827 element:
  1828 
  1829   image_mset
  1830   mset
  1831   replicate_mset
  1832   mult1
  1833   pred_mset
  1834   rel_mset'
  1835   mset_insort
  1836 
  1837 INCOMPATIBILITY.
  1838 
  1839 * Session HOL-Library, theory Multiset: due to the above changes, the
  1840 attributes of some multiset theorems have been changed:
  1841 
  1842   insert_DiffM  [] ~> [simp]
  1843   insert_DiffM2 [simp] ~> []
  1844   diff_add_mset_swap [simp]
  1845   fold_mset_add_mset [simp]
  1846   diff_diff_add [simp] (for multisets only)
  1847   diff_cancel [simp] ~> []
  1848   count_single [simp] ~> []
  1849   set_mset_single [simp] ~> []
  1850   size_multiset_single [simp] ~> []
  1851   size_single [simp] ~> []
  1852   image_mset_single [simp] ~> []
  1853   mset_subset_eq_mono_add_right_cancel [simp] ~> []
  1854   mset_subset_eq_mono_add_left_cancel [simp] ~> []
  1855   fold_mset_single [simp] ~> []
  1856   subset_eq_empty [simp] ~> []
  1857   empty_sup [simp] ~> []
  1858   sup_empty [simp] ~> []
  1859   inter_empty [simp] ~> []
  1860   empty_inter [simp] ~> []
  1861 INCOMPATIBILITY.
  1862 
  1863 * Session HOL-Library, theory Multiset: the order of the variables in
  1864 the second cases of multiset_induct, multiset_induct2_size,
  1865 multiset_induct2 has been changed (e.g. Add A a ~> Add a A).
  1866 INCOMPATIBILITY.
  1867 
  1868 * Session HOL-Library, theory Multiset: there is now a simplification
  1869 procedure on multisets. It mimics the behavior of the procedure on
  1870 natural numbers. INCOMPATIBILITY.
  1871 
  1872 * Session HOL-Library, theory Multiset: renamed sums and products of
  1873 multisets:
  1874 
  1875   msetsum ~> sum_mset
  1876   msetprod ~> prod_mset
  1877 
  1878 * Session HOL-Library, theory Multiset: the notation for intersection
  1879 and union of multisets have been changed:
  1880 
  1881   #\<inter> ~> \<inter>#
  1882   #\<union> ~> \<union>#
  1883 
  1884 INCOMPATIBILITY.
  1885 
  1886 * Session HOL-Library, theory Multiset: the lemma
  1887 one_step_implies_mult_aux on multisets has been removed, use
  1888 one_step_implies_mult instead. INCOMPATIBILITY.
  1889 
  1890 * Session HOL-Library: theory Complete_Partial_Order2 provides reasoning
  1891 support for monotonicity and continuity in chain-complete partial orders
  1892 and about admissibility conditions for fixpoint inductions.
  1893 
  1894 * Session HOL-Library: theory Library/Polynomial contains also
  1895 derivation of polynomials (formerly in Library/Poly_Deriv) but not
  1896 gcd/lcm on polynomials over fields. This has been moved to a separate
  1897 theory Library/Polynomial_GCD_euclidean.thy, to pave way for a possible
  1898 future different type class instantiation for polynomials over factorial
  1899 rings. INCOMPATIBILITY.
  1900 
  1901 * Session HOL-Library: theory Sublist provides function "prefixes" with
  1902 the following renaming
  1903 
  1904   prefixeq -> prefix
  1905   prefix -> strict_prefix
  1906   suffixeq -> suffix
  1907   suffix -> strict_suffix
  1908 
  1909 Added theory of longest common prefixes.
  1910 
  1911 * Session HOL-Number_Theory: algebraic foundation for primes:
  1912 Generalisation of predicate "prime" and introduction of predicates
  1913 "prime_elem", "irreducible", a "prime_factorization" function, and the
  1914 "factorial_ring" typeclass with instance proofs for nat, int, poly. Some
  1915 theorems now have different names, most notably "prime_def" is now
  1916 "prime_nat_iff". INCOMPATIBILITY.
  1917 
  1918 * Session Old_Number_Theory has been removed, after porting remaining
  1919 theories.
  1920 
  1921 * Session HOL-Types_To_Sets provides an experimental extension of
  1922 Higher-Order Logic to allow translation of types to sets.
  1923 
  1924 
  1925 *** ML ***
  1926 
  1927 * Integer.gcd and Integer.lcm use efficient operations from the Poly/ML
  1928 library (notably for big integers). Subtle change of semantics:
  1929 Integer.gcd and Integer.lcm both normalize the sign, results are never
  1930 negative. This coincides with the definitions in HOL/GCD.thy.
  1931 INCOMPATIBILITY.
  1932 
  1933 * Structure Rat for rational numbers is now an integral part of
  1934 Isabelle/ML, with special notation @int/nat or @int for numerals (an
  1935 abbreviation for antiquotation @{Pure.rat argument}) and ML pretty
  1936 printing. Standard operations on type Rat.rat are provided via ad-hoc
  1937 overloading of + - * / < <= > >= ~ abs. INCOMPATIBILITY, need to
  1938 use + instead of +/ etc. Moreover, exception Rat.DIVZERO has been
  1939 superseded by General.Div.
  1940 
  1941 * ML antiquotation @{path} is superseded by @{file}, which ensures that
  1942 the argument is a plain file. Minor INCOMPATIBILITY.
  1943 
  1944 * Antiquotation @{make_string} is available during Pure bootstrap --
  1945 with approximative output quality.
  1946 
  1947 * Low-level ML system structures (like PolyML and RunCall) are no longer
  1948 exposed to Isabelle/ML user-space. Potential INCOMPATIBILITY.
  1949 
  1950 * The ML function "ML" provides easy access to run-time compilation.
  1951 This is particularly useful for conditional compilation, without
  1952 requiring separate files.
  1953 
  1954 * Option ML_exception_debugger controls detailed exception trace via the
  1955 Poly/ML debugger. Relevant ML modules need to be compiled beforehand
  1956 with ML_file_debug, or with ML_file and option ML_debugger enabled. Note
  1957 debugger information requires consirable time and space: main
  1958 Isabelle/HOL with full debugger support may need ML_system_64.
  1959 
  1960 * Local_Theory.restore has been renamed to Local_Theory.reset to
  1961 emphasize its disruptive impact on the cumulative context, notably the
  1962 scope of 'private' or 'qualified' names. Note that Local_Theory.reset is
  1963 only appropriate when targets are managed, e.g. starting from a global
  1964 theory and returning to it. Regular definitional packages should use
  1965 balanced blocks of Local_Theory.open_target versus
  1966 Local_Theory.close_target instead. Rare INCOMPATIBILITY.
  1967 
  1968 * Structure TimeLimit (originally from the SML/NJ library) has been
  1969 replaced by structure Timeout, with slightly different signature.
  1970 INCOMPATIBILITY.
  1971 
  1972 * Discontinued cd and pwd operations, which are not well-defined in a
  1973 multi-threaded environment. Note that files are usually located
  1974 relatively to the master directory of a theory (see also
  1975 File.full_path). Potential INCOMPATIBILITY.
  1976 
  1977 * Binding.empty_atts supersedes Thm.empty_binding and
  1978 Attrib.empty_binding. Minor INCOMPATIBILITY.
  1979 
  1980 
  1981 *** System ***
  1982 
  1983 * SML/NJ and old versions of Poly/ML are no longer supported.
  1984 
  1985 * Poly/ML heaps now follow the hierarchy of sessions, and thus require
  1986 much less disk space.
  1987 
  1988 * The Isabelle ML process is now managed directly by Isabelle/Scala, and
  1989 shell scripts merely provide optional command-line access. In
  1990 particular:
  1991 
  1992   . Scala module ML_Process to connect to the raw ML process,
  1993     with interaction via stdin/stdout/stderr or in batch mode;
  1994   . command-line tool "isabelle console" as interactive wrapper;
  1995   . command-line tool "isabelle process" as batch mode wrapper.
  1996 
  1997 * The executable "isabelle_process" has been discontinued. Tools and
  1998 prover front-ends should use ML_Process or Isabelle_Process in
  1999 Isabelle/Scala. INCOMPATIBILITY.
  2000 
  2001 * New command-line tool "isabelle process" supports ML evaluation of
  2002 literal expressions (option -e) or files (option -f) in the context of a
  2003 given heap image. Errors lead to premature exit of the ML process with
  2004 return code 1.
  2005 
  2006 * The command-line tool "isabelle build" supports option -N for cyclic
  2007 shuffling of NUMA CPU nodes. This may help performance tuning on Linux
  2008 servers with separate CPU/memory modules.
  2009 
  2010 * System option "threads" (for the size of the Isabelle/ML thread farm)
  2011 is also passed to the underlying ML runtime system as --gcthreads,
  2012 unless there is already a default provided via ML_OPTIONS settings.
  2013 
  2014 * System option "checkpoint" helps to fine-tune the global heap space
  2015 management of isabelle build. This is relevant for big sessions that may
  2016 exhaust the small 32-bit address space of the ML process (which is used
  2017 by default).
  2018 
  2019 * System option "profiling" specifies the mode for global ML profiling
  2020 in "isabelle build". Possible values are "time", "allocations". The
  2021 command-line tool "isabelle profiling_report" helps to digest the
  2022 resulting log files.
  2023 
  2024 * System option "ML_process_policy" specifies an optional command prefix
  2025 for the underlying ML process, e.g. to control CPU affinity on
  2026 multiprocessor systems. The "isabelle jedit" tool allows to override the
  2027 implicit default via option -p.
  2028 
  2029 * Command-line tool "isabelle console" provides option -r to help to
  2030 bootstrapping Isabelle/Pure interactively.
  2031 
  2032 * Command-line tool "isabelle yxml" has been discontinued.
  2033 INCOMPATIBILITY, use operations from the modules "XML" and "YXML" in
  2034 Isabelle/ML or Isabelle/Scala.
  2035 
  2036 * Many Isabelle tools that require a Java runtime system refer to the
  2037 settings ISABELLE_TOOL_JAVA_OPTIONS32 / ISABELLE_TOOL_JAVA_OPTIONS64,
  2038 depending on the underlying platform. The settings for "isabelle build"
  2039 ISABELLE_BUILD_JAVA_OPTIONS32 / ISABELLE_BUILD_JAVA_OPTIONS64 have been
  2040 discontinued. Potential INCOMPATIBILITY.
  2041 
  2042 * The Isabelle system environment always ensures that the main
  2043 executables are found within the shell search $PATH: "isabelle" and
  2044 "isabelle_scala_script".
  2045 
  2046 * Isabelle tools may consist of .scala files: the Scala compiler is
  2047 invoked on the spot. The source needs to define some object that extends
  2048 Isabelle_Tool.Body.
  2049 
  2050 * File.bash_string, File.bash_path etc. represent Isabelle/ML and
  2051 Isabelle/Scala strings authentically within GNU bash. This is useful to
  2052 produce robust shell scripts under program control, without worrying
  2053 about spaces or special characters. Note that user output works via
  2054 Path.print (ML) or Path.toString (Scala). INCOMPATIBILITY, the old (and
  2055 less versatile) operations File.shell_quote, File.shell_path etc. have
  2056 been discontinued.
  2057 
  2058 * The isabelle_java executable allows to run a Java process within the
  2059 name space of Java and Scala components that are bundled with Isabelle,
  2060 but without the Isabelle settings environment.
  2061 
  2062 * Isabelle/Scala: the SSH module supports ssh and sftp connections, for
  2063 remote command-execution and file-system access. This resembles
  2064 operations from module File and Isabelle_System to some extent. Note
  2065 that Path specifications need to be resolved remotely via
  2066 ssh.remote_path instead of File.standard_path: the implicit process
  2067 environment is different, Isabelle settings are not available remotely.
  2068 
  2069 * Isabelle/Scala: the Mercurial module supports repositories via the
  2070 regular hg command-line interface. The repositroy clone and working
  2071 directory may reside on a local or remote file-system (via ssh
  2072 connection).
  2073 
  2074 
  2075 
  2076 New in Isabelle2016 (February 2016)
  2077 -----------------------------------
  2078 
  2079 *** General ***
  2080 
  2081 * Eisbach is now based on Pure instead of HOL. Objects-logics may import
  2082 either the theory ~~/src/HOL/Eisbach/Eisbach (for HOL etc.) or
  2083 ~~/src/HOL/Eisbach/Eisbach_Old_Appl_Syntax (for FOL, ZF etc.). Note that
  2084 the HOL-Eisbach session located in ~~/src/HOL/Eisbach/ contains further
  2085 examples that do require HOL.
  2086 
  2087 * Better resource usage on all platforms (Linux, Windows, Mac OS X) for
  2088 both Isabelle/ML and Isabelle/Scala.  Slightly reduced heap space usage.
  2089 
  2090 * Former "xsymbols" syntax with Isabelle symbols is used by default,
  2091 without any special print mode. Important ASCII replacement syntax
  2092 remains available under print mode "ASCII", but less important syntax
  2093 has been removed (see below).
  2094 
  2095 * Support for more arrow symbols, with rendering in LaTeX and Isabelle
  2096 fonts: \<Lleftarrow> \<Rrightarrow> \<longlongleftarrow> \<longlongrightarrow> \<longlonglongleftarrow> \<longlonglongrightarrow>.
  2097 
  2098 * Special notation \<struct> for the first implicit 'structure' in the
  2099 context has been discontinued. Rare INCOMPATIBILITY, use explicit
  2100 structure name instead, notably in indexed notation with block-subscript
  2101 (e.g. \<odot>\<^bsub>A\<^esub>).
  2102 
  2103 * The glyph for \<diamond> in the IsabelleText font now corresponds better to its
  2104 counterpart \<box> as quantifier-like symbol. A small diamond is available as
  2105 \<diamondop>; the old symbol \<struct> loses this rendering and any special
  2106 meaning.
  2107 
  2108 * Syntax for formal comments "-- text" now also supports the symbolic
  2109 form "\<comment> text". Command-line tool "isabelle update_cartouches -c" helps
  2110 to update old sources.
  2111 
  2112 * Toplevel theorem statements have been simplified as follows:
  2113 
  2114   theorems             ~>  lemmas
  2115   schematic_lemma      ~>  schematic_goal
  2116   schematic_theorem    ~>  schematic_goal
  2117   schematic_corollary  ~>  schematic_goal
  2118 
  2119 Command-line tool "isabelle update_theorems" updates theory sources
  2120 accordingly.
  2121 
  2122 * Toplevel theorem statement 'proposition' is another alias for
  2123 'theorem'.
  2124 
  2125 * The old 'defs' command has been removed (legacy since Isabelle2014).
  2126 INCOMPATIBILITY, use regular 'definition' instead. Overloaded and/or
  2127 deferred definitions require a surrounding 'overloading' block.
  2128 
  2129 
  2130 *** Prover IDE -- Isabelle/Scala/jEdit ***
  2131 
  2132 * IDE support for the source-level debugger of Poly/ML, to work with
  2133 Isabelle/ML and official Standard ML. Option "ML_debugger" and commands
  2134 'ML_file_debug', 'ML_file_no_debug', 'SML_file_debug',
  2135 'SML_file_no_debug' control compilation of sources with or without
  2136 debugging information. The Debugger panel allows to set breakpoints (via
  2137 context menu), step through stopped threads, evaluate local ML
  2138 expressions etc. At least one Debugger view needs to be active to have
  2139 any effect on the running ML program.
  2140 
  2141 * The State panel manages explicit proof state output, with dynamic
  2142 auto-update according to cursor movement. Alternatively, the jEdit
  2143 action "isabelle.update-state" (shortcut S+ENTER) triggers manual
  2144 update.
  2145 
  2146 * The Output panel no longer shows proof state output by default, to
  2147 avoid GUI overcrowding. INCOMPATIBILITY, use the State panel instead or
  2148 enable option "editor_output_state".
  2149 
  2150 * The text overview column (status of errors, warnings etc.) is updated
  2151 asynchronously, leading to much better editor reactivity. Moreover, the
  2152 full document node content is taken into account. The width of the
  2153 column is scaled according to the main text area font, for improved
  2154 visibility.
  2155 
  2156 * The main text area no longer changes its color hue in outdated
  2157 situations. The text overview column takes over the role to indicate
  2158 unfinished edits in the PIDE pipeline. This avoids flashing text display
  2159 due to ad-hoc updates by auxiliary GUI components, such as the State
  2160 panel.
  2161 
  2162 * Slightly improved scheduling for urgent print tasks (e.g. command
  2163 state output, interactive queries) wrt. long-running background tasks.
  2164 
  2165 * Completion of symbols via prefix of \<name> or \<^name> or \name is
  2166 always possible, independently of the language context. It is never
  2167 implicit: a popup will show up unconditionally.
  2168 
  2169 * Additional abbreviations for syntactic completion may be specified in
  2170 $ISABELLE_HOME/etc/abbrevs and $ISABELLE_HOME_USER/etc/abbrevs, with
  2171 support for simple templates using ASCII 007 (bell) as placeholder.
  2172 
  2173 * Symbols \<oplus>, \<Oplus>, \<otimes>, \<Otimes>, \<odot>, \<Odot>, \<ominus>, \<oslash> no longer provide abbreviations for
  2174 completion like "+o", "*o", ".o" etc. -- due to conflicts with other
  2175 ASCII syntax. INCOMPATIBILITY, use plain backslash-completion or define
  2176 suitable abbreviations in $ISABELLE_HOME_USER/etc/abbrevs.
  2177 
  2178 * Action "isabelle-emph" (with keyboard shortcut C+e LEFT) controls
  2179 emphasized text style; the effect is visible in document output, not in
  2180 the editor.
  2181 
  2182 * Action "isabelle-reset" now uses keyboard shortcut C+e BACK_SPACE,
  2183 instead of former C+e LEFT.
  2184 
  2185 * The command-line tool "isabelle jedit" and the isabelle.Main
  2186 application wrapper treat the default $USER_HOME/Scratch.thy more
  2187 uniformly, and allow the dummy file argument ":" to open an empty buffer
  2188 instead.
  2189 
  2190 * New command-line tool "isabelle jedit_client" allows to connect to an
  2191 already running Isabelle/jEdit process. This achieves the effect of
  2192 single-instance applications seen on common GUI desktops.
  2193 
  2194 * The default look-and-feel for Linux is the traditional "Metal", which
  2195 works better with GUI scaling for very high-resolution displays (e.g.
  2196 4K). Moreover, it is generally more robust than "Nimbus".
  2197 
  2198 * Update to jedit-5.3.0, with improved GUI scaling and support of
  2199 high-resolution displays (e.g. 4K).
  2200 
  2201 * The main Isabelle executable is managed as single-instance Desktop
  2202 application uniformly on all platforms: Linux, Windows, Mac OS X.
  2203 
  2204 
  2205 *** Document preparation ***
  2206 
  2207 * Commands 'paragraph' and 'subparagraph' provide additional section
  2208 headings. Thus there are 6 levels of standard headings, as in HTML.
  2209 
  2210 * Command 'text_raw' has been clarified: input text is processed as in
  2211 'text' (with antiquotations and control symbols). The key difference is
  2212 the lack of the surrounding isabelle markup environment in output.
  2213 
  2214 * Text is structured in paragraphs and nested lists, using notation that
  2215 is similar to Markdown. The control symbols for list items are as
  2216 follows:
  2217 
  2218   \<^item>  itemize
  2219   \<^enum>  enumerate
  2220   \<^descr>  description
  2221 
  2222 * There is a new short form for antiquotations with a single argument
  2223 that is a cartouche: \<^name>\<open>...\<close> is equivalent to @{name \<open>...\<close>} and
  2224 \<open>...\<close> without control symbol is equivalent to @{cartouche \<open>...\<close>}.
  2225 \<^name> without following cartouche is equivalent to @{name}. The
  2226 standard Isabelle fonts provide glyphs to render important control
  2227 symbols, e.g. "\<^verbatim>", "\<^emph>", "\<^bold>".
  2228 
  2229 * Antiquotations @{noindent}, @{smallskip}, @{medskip}, @{bigskip} with
  2230 corresponding control symbols \<^noindent>, \<^smallskip>, \<^medskip>, \<^bigskip> specify spacing formally, using
  2231 standard LaTeX macros of the same names.
  2232 
  2233 * Antiquotation @{cartouche} in Isabelle/Pure is the same as @{text}.
  2234 Consequently, \<open>...\<close> without any decoration prints literal quasi-formal
  2235 text. Command-line tool "isabelle update_cartouches -t" helps to update
  2236 old sources, by approximative patching of the content of string and
  2237 cartouche tokens seen in theory sources.
  2238 
  2239 * The @{text} antiquotation now ignores the antiquotation option
  2240 "source". The given text content is output unconditionally, without any
  2241 surrounding quotes etc. Subtle INCOMPATIBILITY, put quotes into the
  2242 argument where they are really intended, e.g. @{text \<open>"foo"\<close>}. Initial
  2243 or terminal spaces are ignored.
  2244 
  2245 * Antiquotations @{emph} and @{bold} output LaTeX source recursively,
  2246 adding appropriate text style markup. These may be used in the short
  2247 form \<^emph>\<open>...\<close> and \<^bold>\<open>...\<close>.
  2248 
  2249 * Document antiquotation @{footnote} outputs LaTeX source recursively,
  2250 marked as \footnote{}. This may be used in the short form \<^footnote>\<open>...\<close>.
  2251 
  2252 * Antiquotation @{verbatim [display]} supports option "indent".
  2253 
  2254 * Antiquotation @{theory_text} prints uninterpreted theory source text
  2255 (Isar outer syntax with command keywords etc.). This may be used in the
  2256 short form \<^theory_text>\<open>...\<close>. @{theory_text [display]} supports option "indent".
  2257 
  2258 * Antiquotation @{doc ENTRY} provides a reference to the given
  2259 documentation, with a hyperlink in the Prover IDE.
  2260 
  2261 * Antiquotations @{command}, @{method}, @{attribute} print checked
  2262 entities of the Isar language.
  2263 
  2264 * HTML presentation uses the standard IsabelleText font and Unicode
  2265 rendering of Isabelle symbols like Isabelle/Scala/jEdit.  The former
  2266 print mode "HTML" loses its special meaning.
  2267 
  2268 
  2269 *** Isar ***
  2270 
  2271 * Local goals ('have', 'show', 'hence', 'thus') allow structured rule
  2272 statements like fixes/assumes/shows in theorem specifications, but the
  2273 notation is postfix with keywords 'if' (or 'when') and 'for'. For
  2274 example:
  2275 
  2276   have result: "C x y"
  2277     if "A x" and "B y"
  2278     for x :: 'a and y :: 'a
  2279     <proof>
  2280 
  2281 The local assumptions are bound to the name "that". The result is
  2282 exported from context of the statement as usual. The above roughly
  2283 corresponds to a raw proof block like this:
  2284 
  2285   {
  2286     fix x :: 'a and y :: 'a
  2287     assume that: "A x" "B y"
  2288     have "C x y" <proof>
  2289   }
  2290   note result = this
  2291 
  2292 The keyword 'when' may be used instead of 'if', to indicate 'presume'
  2293 instead of 'assume' above.
  2294 
  2295 * Assumptions ('assume', 'presume') allow structured rule statements
  2296 using 'if' and 'for', similar to 'have' etc. above. For example:
  2297 
  2298   assume result: "C x y"
  2299     if "A x" and "B y"
  2300     for x :: 'a and y :: 'a
  2301 
  2302 This assumes "\<And>x y::'a. A x \<Longrightarrow> B y \<Longrightarrow> C x y" and produces a general
  2303 result as usual: "A ?x \<Longrightarrow> B ?y \<Longrightarrow> C ?x ?y".
  2304 
  2305 Vacuous quantification in assumptions is omitted, i.e. a for-context
  2306 only effects propositions according to actual use of variables. For
  2307 example:
  2308 
  2309   assume "A x" and "B y" for x and y
  2310 
  2311 is equivalent to:
  2312 
  2313   assume "\<And>x. A x" and "\<And>y. B y"
  2314 
  2315 * The meaning of 'show' with Pure rule statements has changed: premises
  2316 are treated in the sense of 'assume', instead of 'presume'. This means,
  2317 a goal like "\<And>x. A x \<Longrightarrow> B x \<Longrightarrow> C x" can be solved completely as
  2318 follows:
  2319 
  2320   show "\<And>x. A x \<Longrightarrow> B x \<Longrightarrow> C x"
  2321 
  2322 or:
  2323 
  2324   show "C x" if "A x" "B x" for x
  2325 
  2326 Rare INCOMPATIBILITY, the old behaviour may be recovered as follows:
  2327 
  2328   show "C x" when "A x" "B x" for x
  2329 
  2330 * New command 'consider' states rules for generalized elimination and
  2331 case splitting. This is like a toplevel statement "theorem obtains" used
  2332 within a proof body; or like a multi-branch 'obtain' without activation
  2333 of the local context elements yet.
  2334 
  2335 * Proof method "cases" allows to specify the rule as first entry of
  2336 chained facts.  This is particularly useful with 'consider':
  2337 
  2338   consider (a) A | (b) B | (c) C <proof>
  2339   then have something
  2340   proof cases
  2341     case a
  2342     then show ?thesis <proof>
  2343   next
  2344     case b
  2345     then show ?thesis <proof>
  2346   next
  2347     case c
  2348     then show ?thesis <proof>
  2349   qed
  2350 
  2351 * Command 'case' allows fact name and attribute specification like this:
  2352 
  2353   case a: (c xs)
  2354   case a [attributes]: (c xs)
  2355 
  2356 Facts that are introduced by invoking the case context are uniformly
  2357 qualified by "a"; the same name is used for the cumulative fact. The old
  2358 form "case (c xs) [attributes]" is no longer supported. Rare
  2359 INCOMPATIBILITY, need to adapt uses of case facts in exotic situations,
  2360 and always put attributes in front.
  2361 
  2362 * The standard proof method of commands 'proof' and '..' is now called
  2363 "standard" to make semantically clear what it is; the old name "default"
  2364 is still available as legacy for some time. Documentation now explains
  2365 '..' more accurately as "by standard" instead of "by rule".
  2366 
  2367 * Nesting of Isar goal structure has been clarified: the context after
  2368 the initial backwards refinement is retained for the whole proof, within
  2369 all its context sections (as indicated via 'next'). This is e.g.
  2370 relevant for 'using', 'including', 'supply':
  2371 
  2372   have "A \<and> A" if a: A for A
  2373     supply [simp] = a
  2374   proof
  2375     show A by simp
  2376   next
  2377     show A by simp
  2378   qed
  2379 
  2380 * Command 'obtain' binds term abbreviations (via 'is' patterns) in the
  2381 proof body as well, abstracted over relevant parameters.
  2382 
  2383 * Improved type-inference for theorem statement 'obtains': separate
  2384 parameter scope for of each clause.
  2385 
  2386 * Term abbreviations via 'is' patterns also work for schematic
  2387 statements: result is abstracted over unknowns.
  2388 
  2389 * Command 'subgoal' allows to impose some structure on backward
  2390 refinements, to avoid proof scripts degenerating into long of 'apply'
  2391 sequences. Further explanations and examples are given in the isar-ref
  2392 manual.
  2393 
  2394 * Command 'supply' supports fact definitions during goal refinement
  2395 ('apply' scripts).
  2396 
  2397 * Proof method "goal_cases" turns the current subgoals into cases within
  2398 the context; the conclusion is bound to variable ?case in each case. For
  2399 example:
  2400 
  2401 lemma "\<And>x. A x \<Longrightarrow> B x \<Longrightarrow> C x"
  2402   and "\<And>y z. U y \<Longrightarrow> V z \<Longrightarrow> W y z"
  2403 proof goal_cases
  2404   case (1 x)
  2405   then show ?case using \<open>A x\<close> \<open>B x\<close> sorry
  2406 next
  2407   case (2 y z)
  2408   then show ?case using \<open>U y\<close> \<open>V z\<close> sorry
  2409 qed
  2410 
  2411 lemma "\<And>x. A x \<Longrightarrow> B x \<Longrightarrow> C x"
  2412   and "\<And>y z. U y \<Longrightarrow> V z \<Longrightarrow> W y z"
  2413 proof goal_cases
  2414   case prems: 1
  2415   then show ?case using prems sorry
  2416 next
  2417   case prems: 2
  2418   then show ?case using prems sorry
  2419 qed
  2420 
  2421 * The undocumented feature of implicit cases goal1, goal2, goal3, etc.
  2422 is marked as legacy, and will be removed eventually. The proof method
  2423 "goals" achieves a similar effect within regular Isar; often it can be
  2424 done more adequately by other means (e.g. 'consider').
  2425 
  2426 * The vacuous fact "TERM x" may be established "by fact" or as `TERM x`
  2427 as well, not just "by this" or "." as before.
  2428 
  2429 * Method "sleep" succeeds after a real-time delay (in seconds). This is
  2430 occasionally useful for demonstration and testing purposes.
  2431 
  2432 
  2433 *** Pure ***
  2434 
  2435 * Qualifiers in locale expressions default to mandatory ('!') regardless
  2436 of the command. Previously, for 'locale' and 'sublocale' the default was
  2437 optional ('?'). The old synatx '!' has been discontinued.
  2438 INCOMPATIBILITY, remove '!' and add '?' as required.
  2439 
  2440 * Keyword 'rewrites' identifies rewrite morphisms in interpretation
  2441 commands. Previously, the keyword was 'where'. INCOMPATIBILITY.
  2442 
  2443 * More gentle suppression of syntax along locale morphisms while
  2444 printing terms. Previously 'abbreviation' and 'notation' declarations
  2445 would be suppressed for morphisms except term identity. Now
  2446 'abbreviation' is also kept for morphims that only change the involved
  2447 parameters, and only 'notation' is suppressed. This can be of great help
  2448 when working with complex locale hierarchies, because proof states are
  2449 displayed much more succinctly. It also means that only notation needs
  2450 to be redeclared if desired, as illustrated by this example:
  2451 
  2452   locale struct = fixes composition :: "'a => 'a => 'a" (infixl "\<cdot>" 65)
  2453   begin
  2454     definition derived (infixl "\<odot>" 65) where ...
  2455   end
  2456 
  2457   locale morphism =
  2458     left: struct composition + right: struct composition'
  2459     for composition (infix "\<cdot>" 65) and composition' (infix "\<cdot>''" 65)
  2460   begin
  2461     notation right.derived ("\<odot>''")
  2462   end
  2463 
  2464 * Command 'global_interpretation' issues interpretations into global
  2465 theories, with optional rewrite definitions following keyword 'defines'.
  2466 
  2467 * Command 'sublocale' accepts optional rewrite definitions after keyword
  2468 'defines'.
  2469 
  2470 * Command 'permanent_interpretation' has been discontinued. Use
  2471 'global_interpretation' or 'sublocale' instead. INCOMPATIBILITY.
  2472 
  2473 * Command 'print_definitions' prints dependencies of definitional
  2474 specifications. This functionality used to be part of 'print_theory'.
  2475 
  2476 * Configuration option rule_insts_schematic has been discontinued
  2477 (intermediate legacy feature in Isabelle2015). INCOMPATIBILITY.
  2478 
  2479 * Abbreviations in type classes now carry proper sort constraint. Rare
  2480 INCOMPATIBILITY in situations where the previous misbehaviour has been
  2481 exploited.
  2482 
  2483 * Refinement of user-space type system in type classes: pseudo-local
  2484 operations behave more similar to abbreviations. Potential
  2485 INCOMPATIBILITY in exotic situations.
  2486 
  2487 
  2488 *** HOL ***
  2489 
  2490 * The 'typedef' command has been upgraded from a partially checked
  2491 "axiomatization", to a full definitional specification that takes the
  2492 global collection of overloaded constant / type definitions into
  2493 account. Type definitions with open dependencies on overloaded
  2494 definitions need to be specified as "typedef (overloaded)". This
  2495 provides extra robustness in theory construction. Rare INCOMPATIBILITY.
  2496 
  2497 * Qualification of various formal entities in the libraries is done more
  2498 uniformly via "context begin qualified definition ... end" instead of
  2499 old-style "hide_const (open) ...". Consequently, both the defined
  2500 constant and its defining fact become qualified, e.g. Option.is_none and
  2501 Option.is_none_def. Occasional INCOMPATIBILITY in applications.
  2502 
  2503 * Some old and rarely used ASCII replacement syntax has been removed.
  2504 INCOMPATIBILITY, standard syntax with symbols should be used instead.
  2505 The subsequent commands help to reproduce the old forms, e.g. to
  2506 simplify porting old theories:
  2507 
  2508   notation iff  (infixr "<->" 25)
  2509 
  2510   notation Times  (infixr "<*>" 80)
  2511 
  2512   type_notation Map.map  (infixr "~=>" 0)
  2513   notation Map.map_comp  (infixl "o'_m" 55)
  2514 
  2515   type_notation FinFun.finfun ("(_ =>f /_)" [22, 21] 21)
  2516 
  2517   notation FuncSet.funcset  (infixr "->" 60)
  2518   notation FuncSet.extensional_funcset  (infixr "->\<^sub>E" 60)
  2519 
  2520   notation Omega_Words_Fun.conc (infixr "conc" 65)
  2521 
  2522   notation Preorder.equiv ("op ~~")
  2523     and Preorder.equiv ("(_/ ~~ _)" [51, 51] 50)
  2524 
  2525   notation (in topological_space) tendsto (infixr "--->" 55)
  2526   notation (in topological_space) LIMSEQ ("((_)/ ----> (_))" [60, 60] 60)
  2527   notation LIM ("((_)/ -- (_)/ --> (_))" [60, 0, 60] 60)
  2528 
  2529   notation NSA.approx (infixl "@=" 50)
  2530   notation NSLIMSEQ ("((_)/ ----NS> (_))" [60, 60] 60)
  2531   notation NSLIM ("((_)/ -- (_)/ --NS> (_))" [60, 0, 60] 60)
  2532 
  2533 * The alternative notation "\<Colon>" for type and sort constraints has been
  2534 removed: in LaTeX document output it looks the same as "::".
  2535 INCOMPATIBILITY, use plain "::" instead.
  2536 
  2537 * Commands 'inductive' and 'inductive_set' work better when names for
  2538 intro rules are omitted: the "cases" and "induct" rules no longer
  2539 declare empty case_names, but no case_names at all. This allows to use
  2540 numbered cases in proofs, without requiring method "goal_cases".
  2541 
  2542 * Inductive definitions ('inductive', 'coinductive', etc.) expose
  2543 low-level facts of the internal construction only if the option
  2544 "inductive_internals" is enabled. This refers to the internal predicate
  2545 definition and its monotonicity result. Rare INCOMPATIBILITY.
  2546 
  2547 * Recursive function definitions ('fun', 'function', 'partial_function')
  2548 expose low-level facts of the internal construction only if the option
  2549 "function_internals" is enabled. Its internal inductive definition is
  2550 also subject to "inductive_internals". Rare INCOMPATIBILITY.
  2551 
  2552 * BNF datatypes ('datatype', 'codatatype', etc.) expose low-level facts
  2553 of the internal construction only if the option "bnf_internals" is
  2554 enabled. This supersedes the former option "bnf_note_all". Rare
  2555 INCOMPATIBILITY.
  2556 
  2557 * Combinator to represent case distinction on products is named
  2558 "case_prod", uniformly, discontinuing any input aliasses. Very popular
  2559 theorem aliasses have been retained.
  2560 
  2561 Consolidated facts:
  2562   PairE ~> prod.exhaust
  2563   Pair_eq ~> prod.inject
  2564   pair_collapse ~> prod.collapse
  2565   Pair_fst_snd_eq ~> prod_eq_iff
  2566   split_twice ~> prod.case_distrib
  2567   split_weak_cong ~> prod.case_cong_weak
  2568   split_split ~> prod.split
  2569   split_split_asm ~> prod.split_asm
  2570   splitI ~> case_prodI
  2571   splitD ~> case_prodD
  2572   splitI2 ~> case_prodI2
  2573   splitI2' ~> case_prodI2'
  2574   splitE ~> case_prodE
  2575   splitE' ~> case_prodE'
  2576   split_pair ~> case_prod_Pair
  2577   split_eta ~> case_prod_eta
  2578   split_comp ~> case_prod_comp
  2579   mem_splitI ~> mem_case_prodI
  2580   mem_splitI2 ~> mem_case_prodI2
  2581   mem_splitE ~> mem_case_prodE
  2582   The_split ~> The_case_prod
  2583   cond_split_eta ~> cond_case_prod_eta
  2584   Collect_split_in_rel_leE ~> Collect_case_prod_in_rel_leE
  2585   Collect_split_in_rel_leI ~> Collect_case_prod_in_rel_leI
  2586   in_rel_Collect_split_eq ~> in_rel_Collect_case_prod_eq
  2587   Collect_split_Grp_eqD ~> Collect_case_prod_Grp_eqD
  2588   Collect_split_Grp_inD ~> Collect_case_prod_Grp_in
  2589   Domain_Collect_split ~> Domain_Collect_case_prod
  2590   Image_Collect_split ~> Image_Collect_case_prod
  2591   Range_Collect_split ~> Range_Collect_case_prod
  2592   Eps_split ~> Eps_case_prod
  2593   Eps_split_eq ~> Eps_case_prod_eq
  2594   split_rsp ~> case_prod_rsp
  2595   curry_split ~> curry_case_prod
  2596   split_curry ~> case_prod_curry
  2597 
  2598 Changes in structure HOLogic:
  2599   split_const ~> case_prod_const
  2600   mk_split ~> mk_case_prod
  2601   mk_psplits ~> mk_ptupleabs
  2602   strip_psplits ~> strip_ptupleabs
  2603 
  2604 INCOMPATIBILITY.
  2605 
  2606 * The coercions to type 'real' have been reorganised. The function
  2607 'real' is no longer overloaded, but has type 'nat => real' and
  2608 abbreviates of_nat for that type. Also 'real_of_int :: int => real'
  2609 abbreviates of_int for that type. Other overloaded instances of 'real'
  2610 have been replaced by 'real_of_ereal' and 'real_of_float'.
  2611 
  2612 Consolidated facts (among others):
  2613   real_of_nat_le_iff -> of_nat_le_iff
  2614   real_of_nat_numeral of_nat_numeral
  2615   real_of_int_zero of_int_0
  2616   real_of_nat_zero of_nat_0
  2617   real_of_one of_int_1
  2618   real_of_int_add of_int_add
  2619   real_of_nat_add of_nat_add
  2620   real_of_int_diff of_int_diff
  2621   real_of_nat_diff of_nat_diff
  2622   floor_subtract floor_diff_of_int
  2623   real_of_int_inject of_int_eq_iff
  2624   real_of_int_gt_zero_cancel_iff of_int_0_less_iff
  2625   real_of_int_ge_zero_cancel_iff of_int_0_le_iff
  2626   real_of_nat_ge_zero of_nat_0_le_iff
  2627   real_of_int_ceiling_ge le_of_int_ceiling
  2628   ceiling_less_eq ceiling_less_iff
  2629   ceiling_le_eq ceiling_le_iff
  2630   less_floor_eq less_floor_iff
  2631   floor_less_eq floor_less_iff
  2632   floor_divide_eq_div floor_divide_of_int_eq
  2633   real_of_int_zero_cancel of_nat_eq_0_iff
  2634   ceiling_real_of_int ceiling_of_int
  2635 
  2636 INCOMPATIBILITY.
  2637 
  2638 * Theory Map: lemma map_of_is_SomeD was a clone of map_of_SomeD and has
  2639 been removed. INCOMPATIBILITY.
  2640 
  2641 * Quickcheck setup for finite sets.
  2642 
  2643 * Discontinued simp_legacy_precond. Potential INCOMPATIBILITY.
  2644 
  2645 * Sledgehammer:
  2646   - The MaSh relevance filter has been sped up.
  2647   - Proof reconstruction has been improved, to minimize the incidence of
  2648     cases where Sledgehammer gives a proof that does not work.
  2649   - Auto Sledgehammer now minimizes and preplays the results.
  2650   - Handle Vampire 4.0 proof output without raising exception.
  2651   - Eliminated "MASH" environment variable. Use the "MaSh" option in
  2652     Isabelle/jEdit instead. INCOMPATIBILITY.
  2653   - Eliminated obsolete "blocking" option and related subcommands.
  2654 
  2655 * Nitpick:
  2656   - Fixed soundness bug in translation of "finite" predicate.
  2657   - Fixed soundness bug in "destroy_constrs" optimization.
  2658   - Fixed soundness bug in translation of "rat" type.
  2659   - Removed "check_potential" and "check_genuine" options.
  2660   - Eliminated obsolete "blocking" option.
  2661 
  2662 * (Co)datatype package:
  2663   - New commands "lift_bnf" and "copy_bnf" for lifting (copying) a BNF
  2664     structure on the raw type to an abstract type defined using typedef.
  2665   - Always generate "case_transfer" theorem.
  2666   - For mutual types, generate slightly stronger "rel_induct",
  2667     "rel_coinduct", and "coinduct" theorems. INCOMPATIBILITY.
  2668   - Allow discriminators and selectors with the same name as the type
  2669     being defined.
  2670   - Avoid various internal name clashes (e.g., 'datatype f = f').
  2671 
  2672 * Transfer: new methods for interactive debugging of 'transfer' and
  2673 'transfer_prover': 'transfer_start', 'transfer_step', 'transfer_end',
  2674 'transfer_prover_start' and 'transfer_prover_end'.
  2675 
  2676 * New diagnostic command print_record for displaying record definitions.
  2677 
  2678 * Division on integers is bootstrapped directly from division on
  2679 naturals and uses generic numeral algorithm for computations. Slight
  2680 INCOMPATIBILITY, simproc numeral_divmod replaces and generalizes former
  2681 simprocs binary_int_div and binary_int_mod
  2682 
  2683 * Tightened specification of class semiring_no_zero_divisors. Minor
  2684 INCOMPATIBILITY.
  2685 
  2686 * Class algebraic_semidom introduces common algebraic notions of
  2687 integral (semi)domains, particularly units. Although logically subsumed
  2688 by fields, is is not a super class of these in order not to burden
  2689 fields with notions that are trivial there.
  2690 
  2691 * Class normalization_semidom specifies canonical representants for
  2692 equivalence classes of associated elements in an integral (semi)domain.
  2693 This formalizes associated elements as well.
  2694 
  2695 * Abstract specification of gcd/lcm operations in classes semiring_gcd,
  2696 semiring_Gcd, semiring_Lcd. Minor INCOMPATIBILITY: facts gcd_nat.commute
  2697 and gcd_int.commute are subsumed by gcd.commute, as well as
  2698 gcd_nat.assoc and gcd_int.assoc by gcd.assoc.
  2699 
  2700 * Former constants Fields.divide (_ / _) and Divides.div (_ div _) are
  2701 logically unified to Rings.divide in syntactic type class Rings.divide,
  2702 with infix syntax (_ div _). Infix syntax (_ / _) for field division is
  2703 added later as abbreviation in class Fields.inverse. INCOMPATIBILITY,
  2704 instantiations must refer to Rings.divide rather than the former
  2705 separate constants, hence infix syntax (_ / _) is usually not available
  2706 during instantiation.
  2707 
  2708 * New cancellation simprocs for boolean algebras to cancel complementary
  2709 terms for sup and inf. For example, "sup x (sup y (- x))" simplifies to
  2710 "top". INCOMPATIBILITY.
  2711 
  2712 * Class uniform_space introduces uniform spaces btw topological spaces
  2713 and metric spaces. Minor INCOMPATIBILITY: open_<type>_def needs to be
  2714 introduced in the form of an uniformity. Some constants are more general
  2715 now, it may be necessary to add type class constraints.
  2716 
  2717   open_real_def \<leadsto> open_dist
  2718   open_complex_def \<leadsto> open_dist
  2719 
  2720 * Library/Monad_Syntax: notation uses symbols \<bind> and \<then>. INCOMPATIBILITY.
  2721 
  2722 * Library/Multiset:
  2723   - Renamed multiset inclusion operators:
  2724       < ~> <#
  2725       > ~> >#
  2726       <= ~> <=#
  2727       >= ~> >=#
  2728       \<le> ~> \<le>#
  2729       \<ge> ~> \<ge>#
  2730     INCOMPATIBILITY.
  2731   - Added multiset inclusion operator syntax:
  2732       \<subset>#
  2733       \<subseteq>#
  2734       \<supset>#
  2735       \<supseteq>#
  2736   - "'a multiset" is no longer an instance of the "order",
  2737     "ordered_ab_semigroup_add_imp_le", "ordered_cancel_comm_monoid_diff",
  2738     "semilattice_inf", and "semilattice_sup" type classes. The theorems
  2739     previously provided by these type classes (directly or indirectly)
  2740     are now available through the "subset_mset" interpretation
  2741     (e.g. add_mono ~> subset_mset.add_mono).
  2742     INCOMPATIBILITY.
  2743   - Renamed conversions:
  2744       multiset_of ~> mset
  2745       multiset_of_set ~> mset_set
  2746       set_of ~> set_mset
  2747     INCOMPATIBILITY
  2748   - Renamed lemmas:
  2749       mset_le_def ~> subseteq_mset_def
  2750       mset_less_def ~> subset_mset_def
  2751       less_eq_multiset.rep_eq ~> subseteq_mset_def
  2752     INCOMPATIBILITY
  2753   - Removed lemmas generated by lift_definition:
  2754     less_eq_multiset.abs_eq, less_eq_multiset.rsp,
  2755     less_eq_multiset.transfer, less_eq_multiset_def
  2756     INCOMPATIBILITY
  2757 
  2758 * Library/Omega_Words_Fun: Infinite words modeled as functions nat \<Rightarrow> 'a.
  2759 
  2760 * Library/Bourbaki_Witt_Fixpoint: Added formalisation of the
  2761 Bourbaki-Witt fixpoint theorem for increasing functions in
  2762 chain-complete partial orders.
  2763 
  2764 * Library/Old_Recdef: discontinued obsolete 'defer_recdef' command.
  2765 Minor INCOMPATIBILITY, use 'function' instead.
  2766 
  2767 * Library/Periodic_Fun: a locale that provides convenient lemmas for
  2768 periodic functions.
  2769 
  2770 * Library/Formal_Power_Series: proper definition of division (with
  2771 remainder) for formal power series; instances for Euclidean Ring and
  2772 GCD.
  2773 
  2774 * HOL-Imperative_HOL: obsolete theory Legacy_Mrec has been removed.
  2775 
  2776 * HOL-Statespace: command 'statespace' uses mandatory qualifier for
  2777 import of parent, as for general 'locale' expressions. INCOMPATIBILITY,
  2778 remove '!' and add '?' as required.
  2779 
  2780 * HOL-Decision_Procs: The "approximation" method works with "powr"
  2781 (exponentiation on real numbers) again.
  2782 
  2783 * HOL-Multivariate_Analysis: theory Cauchy_Integral_Thm with Contour
  2784 integrals (= complex path integrals), Cauchy's integral theorem, winding
  2785 numbers and Cauchy's integral formula, Liouville theorem, Fundamental
  2786 Theorem of Algebra. Ported from HOL Light.
  2787 
  2788 * HOL-Multivariate_Analysis: topological concepts such as connected
  2789 components, homotopic paths and the inside or outside of a set.
  2790 
  2791 * HOL-Multivariate_Analysis: radius of convergence of power series and
  2792 various summability tests; Harmonic numbers and the Euler–Mascheroni
  2793 constant; the Generalised Binomial Theorem; the complex and real
  2794 Gamma/log-Gamma/Digamma/ Polygamma functions and their most important
  2795 properties.
  2796 
  2797 * HOL-Probability: The central limit theorem based on Levy's uniqueness
  2798 and continuity theorems, weak convergence, and characterisitc functions.
  2799 
  2800 * HOL-Data_Structures: new and growing session of standard data
  2801 structures.
  2802 
  2803 
  2804 *** ML ***
  2805 
  2806 * The following combinators for low-level profiling of the ML runtime
  2807 system are available:
  2808 
  2809   profile_time          (*CPU time*)
  2810   profile_time_thread   (*CPU time on this thread*)
  2811   profile_allocations   (*overall heap allocations*)
  2812 
  2813 * Antiquotation @{undefined} or \<^undefined> inlines (raise Match).
  2814 
  2815 * Antiquotation @{method NAME} inlines the (checked) name of the given
  2816 Isar proof method.
  2817 
  2818 * Pretty printing of Poly/ML compiler output in Isabelle has been
  2819 improved: proper treatment of break offsets and blocks with consistent
  2820 breaks.
  2821 
  2822 * The auxiliary module Pure/display.ML has been eliminated. Its
  2823 elementary thm print operations are now in Pure/more_thm.ML and thus
  2824 called Thm.pretty_thm, Thm.string_of_thm etc. INCOMPATIBILITY.
  2825 
  2826 * Simproc programming interfaces have been simplified:
  2827 Simplifier.make_simproc and Simplifier.define_simproc supersede various
  2828 forms of Simplifier.mk_simproc, Simplifier.simproc_global etc. Note that
  2829 term patterns for the left-hand sides are specified with implicitly
  2830 fixed variables, like top-level theorem statements. INCOMPATIBILITY.
  2831 
  2832 * Instantiation rules have been re-organized as follows:
  2833 
  2834   Thm.instantiate  (*low-level instantiation with named arguments*)
  2835   Thm.instantiate' (*version with positional arguments*)
  2836 
  2837   Drule.infer_instantiate  (*instantiation with type inference*)
  2838   Drule.infer_instantiate'  (*version with positional arguments*)
  2839 
  2840 The LHS only requires variable specifications, instead of full terms.
  2841 Old cterm_instantiate is superseded by infer_instantiate.
  2842 INCOMPATIBILITY, need to re-adjust some ML names and types accordingly.
  2843 
  2844 * Old tactic shorthands atac, rtac, etac, dtac, ftac have been
  2845 discontinued. INCOMPATIBILITY, use regular assume_tac, resolve_tac etc.
  2846 instead (with proper context).
  2847 
  2848 * Thm.instantiate (and derivatives) no longer require the LHS of the
  2849 instantiation to be certified: plain variables are given directly.
  2850 
  2851 * Subgoal.SUBPROOF and Subgoal.FOCUS combinators use anonymous
  2852 quasi-bound variables (like the Simplifier), instead of accidentally
  2853 named local fixes. This has the potential to improve stability of proof
  2854 tools, but can also cause INCOMPATIBILITY for tools that don't observe
  2855 the proof context discipline.
  2856 
  2857 * Isar proof methods are based on a slightly more general type
  2858 context_tactic, which allows to change the proof context dynamically
  2859 (e.g. to update cases) and indicate explicit Seq.Error results. Former
  2860 METHOD_CASES is superseded by CONTEXT_METHOD; further combinators are
  2861 provided in src/Pure/Isar/method.ML for convenience. INCOMPATIBILITY.
  2862 
  2863 
  2864 *** System ***
  2865 
  2866 * Command-line tool "isabelle console" enables print mode "ASCII".
  2867 
  2868 * Command-line tool "isabelle update_then" expands old Isar command
  2869 conflations:
  2870 
  2871     hence  ~>  then have
  2872     thus   ~>  then show
  2873 
  2874 This syntax is more orthogonal and improves readability and
  2875 maintainability of proofs.
  2876 
  2877 * Global session timeout is multiplied by timeout_scale factor. This
  2878 allows to adjust large-scale tests (e.g. AFP) to overall hardware
  2879 performance.
  2880 
  2881 * Property values in etc/symbols may contain spaces, if written with the
  2882 replacement character "␣" (Unicode point 0x2324). For example:
  2883 
  2884     \<star>  code: 0x0022c6  group: operator  font: Deja␣Vu␣Sans␣Mono
  2885 
  2886 * Java runtime environment for x86_64-windows allows to use larger heap
  2887 space.
  2888 
  2889 * Java runtime options are determined separately for 32bit vs. 64bit
  2890 platforms as follows.
  2891 
  2892   - Isabelle desktop application: platform-specific files that are
  2893     associated with the main app bundle
  2894 
  2895   - isabelle jedit: settings
  2896     JEDIT_JAVA_SYSTEM_OPTIONS
  2897     JEDIT_JAVA_OPTIONS32 vs. JEDIT_JAVA_OPTIONS64
  2898 
  2899   - isabelle build: settings
  2900     ISABELLE_BUILD_JAVA_OPTIONS32 vs. ISABELLE_BUILD_JAVA_OPTIONS64
  2901 
  2902 * Bash shell function "jvmpath" has been renamed to "platform_path": it
  2903 is relevant both for Poly/ML and JVM processes.
  2904 
  2905 * Poly/ML default platform architecture may be changed from 32bit to
  2906 64bit via system option ML_system_64. A system restart (and rebuild) is
  2907 required after change.
  2908 
  2909 * Poly/ML 5.6 runs natively on x86-windows and x86_64-windows, which
  2910 both allow larger heap space than former x86-cygwin.
  2911 
  2912 * Heap images are 10-15% smaller due to less wasteful persistent theory
  2913 content (using ML type theory_id instead of theory);
  2914 
  2915 
  2916 
  2917 New in Isabelle2015 (May 2015)
  2918 ------------------------------
  2919 
  2920 *** General ***
  2921 
  2922 * Local theory specification commands may have a 'private' or
  2923 'qualified' modifier to restrict name space accesses to the local scope,
  2924 as provided by some "context begin ... end" block. For example:
  2925 
  2926   context
  2927   begin
  2928 
  2929   private definition ...
  2930   private lemma ...
  2931 
  2932   qualified definition ...
  2933   qualified lemma ...
  2934 
  2935   lemma ...
  2936   theorem ...
  2937 
  2938   end
  2939 
  2940 * Command 'experiment' opens an anonymous locale context with private
  2941 naming policy.
  2942 
  2943 * Command 'notepad' requires proper nesting of begin/end and its proof
  2944 structure in the body: 'oops' is no longer supported here. Minor
  2945 INCOMPATIBILITY, use 'sorry' instead.
  2946 
  2947 * Command 'named_theorems' declares a dynamic fact within the context,
  2948 together with an attribute to maintain the content incrementally. This
  2949 supersedes functor Named_Thms in Isabelle/ML, but with a subtle change
  2950 of semantics due to external visual order vs. internal reverse order.
  2951 
  2952 * 'find_theorems': search patterns which are abstractions are
  2953 schematically expanded before search. Search results match the naive
  2954 expectation more closely, particularly wrt. abbreviations.
  2955 INCOMPATIBILITY.
  2956 
  2957 * Commands 'method_setup' and 'attribute_setup' now work within a local
  2958 theory context.
  2959 
  2960 * Outer syntax commands are managed authentically within the theory
  2961 context, without implicit global state. Potential for accidental
  2962 INCOMPATIBILITY, make sure that required theories are really imported.
  2963 
  2964 * Historical command-line terminator ";" is no longer accepted (and
  2965 already used differently in Isar). Minor INCOMPATIBILITY, use "isabelle
  2966 update_semicolons" to remove obsolete semicolons from old theory
  2967 sources.
  2968 
  2969 * Structural composition of proof methods (meth1; meth2) in Isar
  2970 corresponds to (tac1 THEN_ALL_NEW tac2) in ML.
  2971 
  2972 * The Eisbach proof method language allows to define new proof methods
  2973 by combining existing ones with their usual syntax. The "match" proof
  2974 method provides basic fact/term matching in addition to
  2975 premise/conclusion matching through Subgoal.focus, and binds fact names
  2976 from matches as well as term patterns within matches. The Isabelle
  2977 documentation provides an entry "eisbach" for the Eisbach User Manual.
  2978 Sources and various examples are in ~~/src/HOL/Eisbach/.
  2979 
  2980 
  2981 *** Prover IDE -- Isabelle/Scala/jEdit ***
  2982 
  2983 * Improved folding mode "isabelle" based on Isar syntax. Alternatively,
  2984 the "sidekick" mode may be used for document structure.
  2985 
  2986 * Extended bracket matching based on Isar language structure. System
  2987 option jedit_structure_limit determines maximum number of lines to scan
  2988 in the buffer.
  2989 
  2990 * Support for BibTeX files: context menu, context-sensitive token
  2991 marker, SideKick parser.
  2992 
  2993 * Document antiquotation @{cite} provides formal markup, which is
  2994 interpreted semi-formally based on .bib files that happen to be open in
  2995 the editor (hyperlinks, completion etc.).
  2996 
  2997 * Less waste of vertical space via negative line spacing (see Global
  2998 Options / Text Area).
  2999 
  3000 * Improved graphview panel with optional output of PNG or PDF, for
  3001 display of 'thy_deps', 'class_deps' etc.
  3002 
  3003 * The commands 'thy_deps' and 'class_deps' allow optional bounds to
  3004 restrict the visualized hierarchy.
  3005 
  3006 * Improved scheduling for asynchronous print commands (e.g. provers
  3007 managed by the Sledgehammer panel) wrt. ongoing document processing.
  3008 
  3009 
  3010 *** Document preparation ***
  3011 
  3012 * Document markup commands 'chapter', 'section', 'subsection',
  3013 'subsubsection', 'text', 'txt', 'text_raw' work uniformly in any
  3014 context, even before the initial 'theory' command. Obsolete proof
  3015 commands 'sect', 'subsect', 'subsubsect', 'txt_raw' have been
  3016 discontinued, use 'section', 'subsection', 'subsubsection', 'text_raw'
  3017 instead. The old 'header' command is still retained for some time, but
  3018 should be replaced by 'chapter', 'section' etc. (using "isabelle
  3019 update_header"). Minor INCOMPATIBILITY.
  3020 
  3021 * Official support for "tt" style variants, via \isatt{...} or
  3022 \begin{isabellett}...\end{isabellett}. The somewhat fragile \verb or
  3023 verbatim environment of LaTeX is no longer used. This allows @{ML} etc.
  3024 as argument to other macros (such as footnotes).
  3025 
  3026 * Document antiquotation @{verbatim} prints ASCII text literally in "tt"
  3027 style.
  3028 
  3029 * Discontinued obsolete option "document_graph": session_graph.pdf is
  3030 produced unconditionally for HTML browser_info and PDF-LaTeX document.
  3031 
  3032 * Diagnostic commands and document markup commands within a proof do not
  3033 affect the command tag for output. Thus commands like 'thm' are subject
  3034 to proof document structure, and no longer "stick out" accidentally.
  3035 Commands 'text' and 'txt' merely differ in the LaTeX style, not their
  3036 tags. Potential INCOMPATIBILITY in exotic situations.
  3037 
  3038 * System option "pretty_margin" is superseded by "thy_output_margin",
  3039 which is also accessible via document antiquotation option "margin".
  3040 Only the margin for document output may be changed, but not the global
  3041 pretty printing: that is 76 for plain console output, and adapted
  3042 dynamically in GUI front-ends. Implementations of document
  3043 antiquotations need to observe the margin explicitly according to
  3044 Thy_Output.string_of_margin. Minor INCOMPATIBILITY.
  3045 
  3046 * Specification of 'document_files' in the session ROOT file is
  3047 mandatory for document preparation. The legacy mode with implicit
  3048 copying of the document/ directory is no longer supported. Minor
  3049 INCOMPATIBILITY.
  3050 
  3051 
  3052 *** Pure ***
  3053 
  3054 * Proof methods with explicit instantiation ("rule_tac", "subgoal_tac"
  3055 etc.) allow an optional context of local variables ('for' declaration):
  3056 these variables become schematic in the instantiated theorem; this
  3057 behaviour is analogous to 'for' in attributes "where" and "of".
  3058 Configuration option rule_insts_schematic (default false) controls use
  3059 of schematic variables outside the context. Minor INCOMPATIBILITY,
  3060 declare rule_insts_schematic = true temporarily and update to use local
  3061 variable declarations or dummy patterns instead.
  3062 
  3063 * Explicit instantiation via attributes "where", "of", and proof methods
  3064 "rule_tac" with derivatives like "subgoal_tac" etc. admit dummy patterns
  3065 ("_") that stand for anonymous local variables.
  3066 
  3067 * Generated schematic variables in standard format of exported facts are
  3068 incremented to avoid material in the proof context. Rare
  3069 INCOMPATIBILITY, explicit instantiation sometimes needs to refer to
  3070 different index.
  3071 
  3072 * Lexical separation of signed and unsigned numerals: categories "num"
  3073 and "float" are unsigned. INCOMPATIBILITY: subtle change in precedence
  3074 of numeral signs, particularly in expressions involving infix syntax
  3075 like "(- 1) ^ n".
  3076 
  3077 * Old inner token category "xnum" has been discontinued.  Potential
  3078 INCOMPATIBILITY for exotic syntax: may use mixfix grammar with "num"
  3079 token category instead.
  3080 
  3081 
  3082 *** HOL ***
  3083 
  3084 * New (co)datatype package:
  3085   - The 'datatype_new' command has been renamed 'datatype'. The old
  3086     command of that name is now called 'old_datatype' and is provided
  3087     by "~~/src/HOL/Library/Old_Datatype.thy". See
  3088     'isabelle doc datatypes' for information on porting.
  3089     INCOMPATIBILITY.
  3090   - Renamed theorems:
  3091       disc_corec ~> corec_disc
  3092       disc_corec_iff ~> corec_disc_iff
  3093       disc_exclude ~> distinct_disc
  3094       disc_exhaust ~> exhaust_disc
  3095       disc_map_iff ~> map_disc_iff
  3096       sel_corec ~> corec_sel
  3097       sel_exhaust ~> exhaust_sel
  3098       sel_map ~> map_sel
  3099       sel_set ~> set_sel
  3100       sel_split ~> split_sel
  3101       sel_split_asm ~> split_sel_asm
  3102       strong_coinduct ~> coinduct_strong
  3103       weak_case_cong ~> case_cong_weak
  3104     INCOMPATIBILITY.
  3105   - The "no_code" option to "free_constructors", "datatype_new", and
  3106     "codatatype" has been renamed "plugins del: code".
  3107     INCOMPATIBILITY.
  3108   - The rules "set_empty" have been removed. They are easy
  3109     consequences of other set rules "by auto".
  3110     INCOMPATIBILITY.
  3111   - The rule "set_cases" is now registered with the "[cases set]"
  3112     attribute. This can influence the behavior of the "cases" proof
  3113     method when more than one case rule is applicable (e.g., an
  3114     assumption is of the form "w : set ws" and the method "cases w"
  3115     is invoked). The solution is to specify the case rule explicitly
  3116     (e.g. "cases w rule: widget.exhaust").
  3117     INCOMPATIBILITY.
  3118   - Renamed theories:
  3119       BNF_Comp ~> BNF_Composition
  3120       BNF_FP_Base ~> BNF_Fixpoint_Base
  3121       BNF_GFP ~> BNF_Greatest_Fixpoint
  3122       BNF_LFP ~> BNF_Least_Fixpoint
  3123       BNF_Constructions_on_Wellorders ~> BNF_Wellorder_Constructions
  3124       Cardinals/Constructions_on_Wellorders ~> Cardinals/Wellorder_Constructions
  3125     INCOMPATIBILITY.
  3126   - Lifting and Transfer setup for basic HOL types sum and prod (also
  3127     option) is now performed by the BNF package. Theories Lifting_Sum,
  3128     Lifting_Product and Lifting_Option from Main became obsolete and
  3129     were removed. Changed definitions of the relators rel_prod and
  3130     rel_sum (using inductive).
  3131     INCOMPATIBILITY: use rel_prod.simps and rel_sum.simps instead
  3132     of rel_prod_def and rel_sum_def.
  3133     Minor INCOMPATIBILITY: (rarely used by name) transfer theorem names
  3134     changed (e.g. map_prod_transfer ~> prod.map_transfer).
  3135   - Parametricity theorems for map functions, relators, set functions,
  3136     constructors, case combinators, discriminators, selectors and
  3137     (co)recursors are automatically proved and registered as transfer
  3138     rules.
  3139 
  3140 * Old datatype package:
  3141   - The old 'datatype' command has been renamed 'old_datatype', and
  3142     'rep_datatype' has been renamed 'old_rep_datatype'. They are
  3143     provided by "~~/src/HOL/Library/Old_Datatype.thy". See
  3144     'isabelle doc datatypes' for information on porting.
  3145     INCOMPATIBILITY.
  3146   - Renamed theorems:
  3147       weak_case_cong ~> case_cong_weak
  3148     INCOMPATIBILITY.
  3149   - Renamed theory:
  3150       ~~/src/HOL/Datatype.thy ~> ~~/src/HOL/Library/Old_Datatype.thy
  3151     INCOMPATIBILITY.
  3152 
  3153 * Nitpick:
  3154   - Fixed soundness bug related to the strict and non-strict subset
  3155     operations.
  3156 
  3157 * Sledgehammer:
  3158   - CVC4 is now included with Isabelle instead of CVC3 and run by
  3159     default.
  3160   - Z3 is now always enabled by default, now that it is fully open
  3161     source. The "z3_non_commercial" option is discontinued.
  3162   - Minimization is now always enabled by default.
  3163     Removed sub-command:
  3164       min
  3165   - Proof reconstruction, both one-liners and Isar, has been
  3166     dramatically improved.
  3167   - Improved support for CVC4 and veriT.
  3168 
  3169 * Old and new SMT modules:
  3170   - The old 'smt' method has been renamed 'old_smt' and moved to
  3171     'src/HOL/Library/Old_SMT.thy'. It is provided for compatibility,
  3172     until applications have been ported to use the new 'smt' method. For
  3173     the method to work, an older version of Z3 (e.g. Z3 3.2 or 4.0) must
  3174     be installed, and the environment variable "OLD_Z3_SOLVER" must
  3175     point to it.
  3176     INCOMPATIBILITY.
  3177   - The 'smt2' method has been renamed 'smt'.
  3178     INCOMPATIBILITY.
  3179   - New option 'smt_reconstruction_step_timeout' to limit the
  3180     reconstruction time of Z3 proof steps in the new 'smt' method.
  3181   - New option 'smt_statistics' to display statistics of the new 'smt'
  3182     method, especially runtime statistics of Z3 proof reconstruction.
  3183 
  3184 * Lifting: command 'lift_definition' allows to execute lifted constants
  3185 that have as a return type a datatype containing a subtype. This
  3186 overcomes long-time limitations in the area of code generation and
  3187 lifting, and avoids tedious workarounds.
  3188 
  3189 * Command and antiquotation "value" provide different evaluation slots
  3190 (again), where the previous strategy (NBE after ML) serves as default.
  3191 Minor INCOMPATIBILITY.
  3192 
  3193 * Add NO_MATCH-simproc, allows to check for syntactic non-equality.
  3194 
  3195 * field_simps: Use NO_MATCH-simproc for distribution rules, to avoid
  3196 non-termination in case of distributing a division. With this change
  3197 field_simps is in some cases slightly less powerful, if it fails try to
  3198 add algebra_simps, or use divide_simps. Minor INCOMPATIBILITY.
  3199 
  3200 * Separate class no_zero_divisors has been given up in favour of fully
  3201 algebraic semiring_no_zero_divisors. INCOMPATIBILITY.
  3202 
  3203 * Class linordered_semidom really requires no zero divisors.
  3204 INCOMPATIBILITY.
  3205 
  3206 * Classes division_ring, field and linordered_field always demand
  3207 "inverse 0 = 0". Given up separate classes division_ring_inverse_zero,
  3208 field_inverse_zero and linordered_field_inverse_zero. INCOMPATIBILITY.
  3209 
  3210 * Classes cancel_ab_semigroup_add / cancel_monoid_add specify explicit
  3211 additive inverse operation. INCOMPATIBILITY.
  3212 
  3213 * Complex powers and square roots. The functions "ln" and "powr" are now
  3214 overloaded for types real and complex, and 0 powr y = 0 by definition.
  3215 INCOMPATIBILITY: type constraints may be necessary.
  3216 
  3217 * The functions "sin" and "cos" are now defined for any type of sort
  3218 "{real_normed_algebra_1,banach}" type, so in particular on "real" and
  3219 "complex" uniformly. Minor INCOMPATIBILITY: type constraints may be
  3220 needed.
  3221 
  3222 * New library of properties of the complex transcendental functions sin,
  3223 cos, tan, exp, Ln, Arctan, Arcsin, Arccos. Ported from HOL Light.
  3224 
  3225 * The factorial function, "fact", now has type "nat => 'a" (of a sort
  3226 that admits numeric types including nat, int, real and complex.
  3227 INCOMPATIBILITY: an expression such as "fact 3 = 6" may require a type
  3228 constraint, and the combination "real (fact k)" is likely to be
  3229 unsatisfactory. If a type conversion is still necessary, then use
  3230 "of_nat (fact k)" or "real_of_nat (fact k)".
  3231 
  3232 * Removed functions "natfloor" and "natceiling", use "nat o floor" and
  3233 "nat o ceiling" instead. A few of the lemmas have been retained and
  3234 adapted: in their names "natfloor"/"natceiling" has been replaced by
  3235 "nat_floor"/"nat_ceiling".
  3236 
  3237 * Qualified some duplicated fact names required for boostrapping the
  3238 type class hierarchy:
  3239   ab_add_uminus_conv_diff ~> diff_conv_add_uminus
  3240   field_inverse_zero ~> inverse_zero
  3241   field_divide_inverse ~> divide_inverse
  3242   field_inverse ~> left_inverse
  3243 Minor INCOMPATIBILITY.
  3244 
  3245 * Eliminated fact duplicates:
  3246   mult_less_imp_less_right ~> mult_right_less_imp_less
  3247   mult_less_imp_less_left ~> mult_left_less_imp_less
  3248 Minor INCOMPATIBILITY.
  3249 
  3250 * Fact consolidation: even_less_0_iff is subsumed by
  3251 double_add_less_zero_iff_single_add_less_zero (simp by default anyway).
  3252 
  3253 * Generalized and consolidated some theorems concerning divsibility:
  3254   dvd_reduce ~> dvd_add_triv_right_iff
  3255   dvd_plus_eq_right ~> dvd_add_right_iff
  3256   dvd_plus_eq_left ~> dvd_add_left_iff
  3257 Minor INCOMPATIBILITY.
  3258 
  3259 * "even" and "odd" are mere abbreviations for "2 dvd _" and "~ 2 dvd _"
  3260 and part of theory Main.
  3261   even_def ~> even_iff_mod_2_eq_zero
  3262 INCOMPATIBILITY.
  3263 
  3264 * Lemma name consolidation: divide_Numeral1 ~> divide_numeral_1. Minor
  3265 INCOMPATIBILITY.
  3266 
  3267 * Bootstrap of listsum as special case of abstract product over lists.
  3268 Fact rename:
  3269     listsum_def ~> listsum.eq_foldr
  3270 INCOMPATIBILITY.
  3271 
  3272 * Product over lists via constant "listprod".
  3273 
  3274 * Theory List: renamed drop_Suc_conv_tl and nth_drop' to
  3275 Cons_nth_drop_Suc.
  3276 
  3277 * New infrastructure for compiling, running, evaluating and testing
  3278 generated code in target languages in HOL/Library/Code_Test. See
  3279 HOL/Codegenerator_Test/Code_Test* for examples.
  3280 
  3281 * Library/Multiset:
  3282   - Introduced "replicate_mset" operation.
  3283   - Introduced alternative characterizations of the multiset ordering in
  3284     "Library/Multiset_Order".
  3285   - Renamed multiset ordering:
  3286       <# ~> #<#
  3287       <=# ~> #<=#
  3288       \<subset># ~> #\<subset>#
  3289       \<subseteq># ~> #\<subseteq>#
  3290     INCOMPATIBILITY.
  3291   - Introduced abbreviations for ill-named multiset operations:
  3292       <#, \<subset># abbreviate < (strict subset)
  3293       <=#, \<le>#, \<subseteq># abbreviate <= (subset or equal)
  3294     INCOMPATIBILITY.
  3295   - Renamed
  3296       in_multiset_of ~> in_multiset_in_set
  3297       Multiset.fold ~> fold_mset
  3298       Multiset.filter ~> filter_mset
  3299     INCOMPATIBILITY.
  3300   - Removed mcard, is equal to size.
  3301   - Added attributes:
  3302       image_mset.id [simp]
  3303       image_mset_id [simp]
  3304       elem_multiset_of_set [simp, intro]
  3305       comp_fun_commute_plus_mset [simp]
  3306       comp_fun_commute.fold_mset_insert [OF comp_fun_commute_plus_mset, simp]
  3307       in_mset_fold_plus_iff [iff]
  3308       set_of_Union_mset [simp]
  3309       in_Union_mset_iff [iff]
  3310     INCOMPATIBILITY.
  3311 
  3312 * Library/Sum_of_Squares: simplified and improved "sos" method. Always
  3313 use local CSDP executable, which is much faster than the NEOS server.
  3314 The "sos_cert" functionality is invoked as "sos" with additional
  3315 argument. Minor INCOMPATIBILITY.
  3316 
  3317 * HOL-Decision_Procs: New counterexample generator quickcheck
  3318 [approximation] for inequalities of transcendental functions. Uses
  3319 hardware floating point arithmetic to randomly discover potential
  3320 counterexamples. Counterexamples are certified with the "approximation"
  3321 method. See HOL/Decision_Procs/ex/Approximation_Quickcheck_Ex.thy for
  3322 examples.
  3323 
  3324 * HOL-Probability: Reworked measurability prover
  3325   - applies destructor rules repeatedly
  3326   - removed application splitting (replaced by destructor rule)
  3327   - added congruence rules to rewrite measure spaces under the sets
  3328     projection
  3329 
  3330 * New proof method "rewrite" (in theory ~~/src/HOL/Library/Rewrite) for
  3331 single-step rewriting with subterm selection based on patterns.
  3332 
  3333 
  3334 *** ML ***
  3335 
  3336 * Subtle change of name space policy: undeclared entries are now
  3337 considered inaccessible, instead of accessible via the fully-qualified
  3338 internal name. This mainly affects Name_Space.intern (and derivatives),
  3339 which may produce an unexpected Long_Name.hidden prefix. Note that
  3340 contemporary applications use the strict Name_Space.check (and
  3341 derivatives) instead, which is not affected by the change. Potential
  3342 INCOMPATIBILITY in rare applications of Name_Space.intern.
  3343 
  3344 * Subtle change of error semantics of Toplevel.proof_of: regular user
  3345 ERROR instead of internal Toplevel.UNDEF.
  3346 
  3347 * Basic combinators map, fold, fold_map, split_list, apply are available
  3348 as parameterized antiquotations, e.g. @{map 4} for lists of quadruples.
  3349 
  3350 * Renamed "pairself" to "apply2", in accordance to @{apply 2}.
  3351 INCOMPATIBILITY.
  3352 
  3353 * Former combinators NAMED_CRITICAL and CRITICAL for central critical
  3354 sections have been discontinued, in favour of the more elementary
  3355 Multithreading.synchronized and its high-level derivative
  3356 Synchronized.var (which is usually sufficient in applications). Subtle
  3357 INCOMPATIBILITY: synchronized access needs to be atomic and cannot be
  3358 nested.
  3359 
  3360 * Synchronized.value (ML) is actually synchronized (as in Scala): subtle
  3361 change of semantics with minimal potential for INCOMPATIBILITY.
  3362 
  3363 * The main operations to certify logical entities are Thm.ctyp_of and
  3364 Thm.cterm_of with a local context; old-style global theory variants are
  3365 available as Thm.global_ctyp_of and Thm.global_cterm_of.
  3366 INCOMPATIBILITY.
  3367 
  3368 * Elementary operations in module Thm are no longer pervasive.
  3369 INCOMPATIBILITY, need to use qualified Thm.prop_of, Thm.cterm_of,
  3370 Thm.term_of etc.
  3371 
  3372 * Proper context for various elementary tactics: assume_tac,
  3373 resolve_tac, eresolve_tac, dresolve_tac, forward_tac, match_tac,
  3374 compose_tac, Splitter.split_tac etc. INCOMPATIBILITY.
  3375 
  3376 * Tactical PARALLEL_ALLGOALS is the most common way to refer to
  3377 PARALLEL_GOALS.
  3378 
  3379 * Goal.prove_multi is superseded by the fully general Goal.prove_common,
  3380 which also allows to specify a fork priority.
  3381 
  3382 * Antiquotation @{command_spec "COMMAND"} is superseded by
  3383 @{command_keyword COMMAND} (usually without quotes and with PIDE
  3384 markup). Minor INCOMPATIBILITY.
  3385 
  3386 * Cartouches within ML sources are turned into values of type
  3387 Input.source (with formal position information).
  3388 
  3389 
  3390 *** System ***
  3391 
  3392 * The Isabelle tool "update_cartouches" changes theory files to use
  3393 cartouches instead of old-style {* verbatim *} or `alt_string` tokens.
  3394 
  3395 * The Isabelle tool "build" provides new options -X, -k, -x.
  3396 
  3397 * Discontinued old-fashioned "codegen" tool. Code generation can always
  3398 be externally triggered using an appropriate ROOT file plus a
  3399 corresponding theory. Parametrization is possible using environment
  3400 variables, or ML snippets in the most extreme cases. Minor
  3401 INCOMPATIBILITY.
  3402 
  3403 * JVM system property "isabelle.threads" determines size of Scala thread
  3404 pool, like Isabelle system option "threads" for ML.
  3405 
  3406 * JVM system property "isabelle.laf" determines the default Swing
  3407 look-and-feel, via internal class name or symbolic name as in the jEdit
  3408 menu Global Options / Appearance.
  3409 
  3410 * Support for Proof General and Isar TTY loop has been discontinued.
  3411 Minor INCOMPATIBILITY, use standard PIDE infrastructure instead.
  3412 
  3413 
  3414 
  3415 New in Isabelle2014 (August 2014)
  3416 ---------------------------------
  3417 
  3418 *** General ***
  3419 
  3420 * Support for official Standard ML within the Isabelle context.
  3421 Command 'SML_file' reads and evaluates the given Standard ML file.
  3422 Toplevel bindings are stored within the theory context; the initial
  3423 environment is restricted to the Standard ML implementation of
  3424 Poly/ML, without the add-ons of Isabelle/ML.  Commands 'SML_import'
  3425 and 'SML_export' allow to exchange toplevel bindings between the two
  3426 separate environments.  See also ~~/src/Tools/SML/Examples.thy for
  3427 some examples.
  3428 
  3429 * Standard tactics and proof methods such as "clarsimp", "auto" and
  3430 "safe" now preserve equality hypotheses "x = expr" where x is a free
  3431 variable.  Locale assumptions and chained facts containing "x"
  3432 continue to be useful.  The new method "hypsubst_thin" and the
  3433 configuration option "hypsubst_thin" (within the attribute name space)
  3434 restore the previous behavior.  INCOMPATIBILITY, especially where
  3435 induction is done after these methods or when the names of free and
  3436 bound variables clash.  As first approximation, old proofs may be
  3437 repaired by "using [[hypsubst_thin = true]]" in the critical spot.
  3438 
  3439 * More static checking of proof methods, which allows the system to
  3440 form a closure over the concrete syntax.  Method arguments should be
  3441 processed in the original proof context as far as possible, before
  3442 operating on the goal state.  In any case, the standard discipline for
  3443 subgoal-addressing needs to be observed: no subgoals or a subgoal
  3444 number that is out of range produces an empty result sequence, not an
  3445 exception.  Potential INCOMPATIBILITY for non-conformant tactical
  3446 proof tools.
  3447 
  3448 * Lexical syntax (inner and outer) supports text cartouches with
  3449 arbitrary nesting, and without escapes of quotes etc.  The Prover IDE
  3450 supports input via ` (backquote).
  3451 
  3452 * The outer syntax categories "text" (for formal comments and document
  3453 markup commands) and "altstring" (for literal fact references) allow
  3454 cartouches as well, in addition to the traditional mix of quotations.
  3455 
  3456 * Syntax of document antiquotation @{rail} now uses \<newline> instead
  3457 of "\\", to avoid the optical illusion of escaped backslash within
  3458 string token.  General renovation of its syntax using text cartouches.
  3459 Minor INCOMPATIBILITY.
  3460 
  3461 * Discontinued legacy_isub_isup, which was a temporary workaround for
  3462 Isabelle/ML in Isabelle2013-1.  The prover process no longer accepts
  3463 old identifier syntax with \<^isub> or \<^isup>.  Potential
  3464 INCOMPATIBILITY.
  3465 
  3466 * Document antiquotation @{url} produces markup for the given URL,
  3467 which results in an active hyperlink within the text.
  3468 
  3469 * Document antiquotation @{file_unchecked} is like @{file}, but does
  3470 not check existence within the file-system.
  3471 
  3472 * Updated and extended manuals: codegen, datatypes, implementation,
  3473 isar-ref, jedit, system.
  3474 
  3475 
  3476 *** Prover IDE -- Isabelle/Scala/jEdit ***
  3477 
  3478 * Improved Document panel: simplified interaction where every single
  3479 mouse click (re)opens document via desktop environment or as jEdit
  3480 buffer.
  3481 
  3482 * Support for Navigator plugin (with toolbar buttons), with connection
  3483 to PIDE hyperlinks.
  3484 
  3485 * Auxiliary files ('ML_file' etc.) are managed by the Prover IDE.
  3486 Open text buffers take precedence over copies within the file-system.
  3487 
  3488 * Improved support for Isabelle/ML, with jEdit mode "isabelle-ml" for
  3489 auxiliary ML files.
  3490 
  3491 * Improved syntactic and semantic completion mechanism, with simple
  3492 templates, completion language context, name-space completion,
  3493 file-name completion, spell-checker completion.
  3494 
  3495 * Refined GUI popup for completion: more robust key/mouse event
  3496 handling and propagation to enclosing text area -- avoid loosing
  3497 keystrokes with slow / remote graphics displays.
  3498 
  3499 * Completion popup supports both ENTER and TAB (default) to select an
  3500 item, depending on Isabelle options.
  3501 
  3502 * Refined insertion of completion items wrt. jEdit text: multiple
  3503 selections, rectangular selections, rectangular selection as "tall
  3504 caret".
  3505 
  3506 * Integrated spell-checker for document text, comments etc. with
  3507 completion popup and context-menu.
  3508 
  3509 * More general "Query" panel supersedes "Find" panel, with GUI access
  3510 to commands 'find_theorems' and 'find_consts', as well as print
  3511 operations for the context.  Minor incompatibility in keyboard
  3512 shortcuts etc.: replace action isabelle-find by isabelle-query.
  3513 
  3514 * Search field for all output panels ("Output", "Query", "Info" etc.)
  3515 to highlight text via regular expression.
  3516 
  3517 * Option "jedit_print_mode" (see also "Plugin Options / Isabelle /
  3518 General") allows to specify additional print modes for the prover
  3519 process, without requiring old-fashioned command-line invocation of
  3520 "isabelle jedit -m MODE".
  3521 
  3522 * More support for remote files (e.g. http) using standard Java
  3523 networking operations instead of jEdit virtual file-systems.
  3524 
  3525 * Empty editors buffers that are no longer required (e.g.\ via theory
  3526 imports) are automatically removed from the document model.
  3527 
  3528 * Improved monitor panel.
  3529 
  3530 * Improved Console/Scala plugin: more uniform scala.Console output,
  3531 more robust treatment of threads and interrupts.
  3532 
  3533 * Improved management of dockable windows: clarified keyboard focus
  3534 and window placement wrt. main editor view; optional menu item to
  3535 "Detach" a copy where this makes sense.
  3536 
  3537 * New Simplifier Trace panel provides an interactive view of the
  3538 simplification process, enabled by the "simp_trace_new" attribute
  3539 within the context.
  3540 
  3541 
  3542 *** Pure ***
  3543 
  3544 * Low-level type-class commands 'classes', 'classrel', 'arities' have
  3545 been discontinued to avoid the danger of non-trivial axiomatization
  3546 that is not immediately visible.  INCOMPATIBILITY, use regular
  3547 'instance' command with proof.  The required OFCLASS(...) theorem
  3548 might be postulated via 'axiomatization' beforehand, or the proof
  3549 finished trivially if the underlying class definition is made vacuous
  3550 (without any assumptions).  See also Isabelle/ML operations
  3551 Axclass.class_axiomatization, Axclass.classrel_axiomatization,
  3552 Axclass.arity_axiomatization.
  3553 
  3554 * Basic constants of Pure use more conventional names and are always
  3555 qualified.  Rare INCOMPATIBILITY, but with potentially serious
  3556 consequences, notably for tools in Isabelle/ML.  The following
  3557 renaming needs to be applied:
  3558 
  3559   ==             ~>  Pure.eq
  3560   ==>            ~>  Pure.imp
  3561   all            ~>  Pure.all
  3562   TYPE           ~>  Pure.type
  3563   dummy_pattern  ~>  Pure.dummy_pattern
  3564 
  3565 Systematic porting works by using the following theory setup on a
  3566 *previous* Isabelle version to introduce the new name accesses for the
  3567 old constants:
  3568 
  3569 setup {*
  3570   fn thy => thy
  3571     |> Sign.root_path
  3572     |> Sign.const_alias (Binding.qualify true "Pure" @{binding eq}) "=="
  3573     |> Sign.const_alias (Binding.qualify true "Pure" @{binding imp}) "==>"
  3574     |> Sign.const_alias (Binding.qualify true "Pure" @{binding all}) "all"
  3575     |> Sign.restore_naming thy
  3576 *}
  3577 
  3578 Thus ML antiquotations like @{const_name Pure.eq} may be used already.
  3579 Later the application is moved to the current Isabelle version, and
  3580 the auxiliary aliases are deleted.
  3581 
  3582 * Attributes "where" and "of" allow an optional context of local
  3583 variables ('for' declaration): these variables become schematic in the
  3584 instantiated theorem.
  3585 
  3586 * Obsolete attribute "standard" has been discontinued (legacy since
  3587 Isabelle2012).  Potential INCOMPATIBILITY, use explicit 'for' context
  3588 where instantiations with schematic variables are intended (for
  3589 declaration commands like 'lemmas' or attributes like "of").  The
  3590 following temporary definition may help to port old applications:
  3591 
  3592   attribute_setup standard =
  3593     "Scan.succeed (Thm.rule_attribute (K Drule.export_without_context))"
  3594 
  3595 * More thorough check of proof context for goal statements and
  3596 attributed fact expressions (concerning background theory, declared
  3597 hyps).  Potential INCOMPATIBILITY, tools need to observe standard
  3598 context discipline.  See also Assumption.add_assumes and the more
  3599 primitive Thm.assume_hyps.
  3600 
  3601 * Inner syntax token language allows regular quoted strings "..."
  3602 (only makes sense in practice, if outer syntax is delimited
  3603 differently, e.g. via cartouches).
  3604 
  3605 * Command 'print_term_bindings' supersedes 'print_binds' for clarity,
  3606 but the latter is retained some time as Proof General legacy.
  3607 
  3608 * Code generator preprocessor: explicit control of simp tracing on a
  3609 per-constant basis.  See attribute "code_preproc".
  3610 
  3611 
  3612 *** HOL ***
  3613 
  3614 * Code generator: enforce case of identifiers only for strict target
  3615 language requirements.  INCOMPATIBILITY.
  3616 
  3617 * Code generator: explicit proof contexts in many ML interfaces.
  3618 INCOMPATIBILITY.
  3619 
  3620 * Code generator: minimize exported identifiers by default.  Minor
  3621 INCOMPATIBILITY.
  3622 
  3623 * Code generation for SML and OCaml: dropped arcane "no_signatures"
  3624 option.  Minor INCOMPATIBILITY.
  3625 
  3626 * "declare [[code abort: ...]]" replaces "code_abort ...".
  3627 INCOMPATIBILITY.
  3628 
  3629 * "declare [[code drop: ...]]" drops all code equations associated
  3630 with the given constants.
  3631 
  3632 * Code generations are provided for make, fields, extend and truncate
  3633 operations on records.
  3634 
  3635 * Command and antiquotation "value" are now hardcoded against nbe and
  3636 ML.  Minor INCOMPATIBILITY.
  3637 
  3638 * Renamed command 'enriched_type' to 'functor'. INCOMPATIBILITY.
  3639 
  3640 * The symbol "\<newline>" may be used within char or string literals
  3641 to represent (Char Nibble0 NibbleA), i.e. ASCII newline.
  3642 
  3643 * Qualified String.implode and String.explode.  INCOMPATIBILITY.
  3644 
  3645 * Simplifier: Enhanced solver of preconditions of rewrite rules can
  3646 now deal with conjunctions.  For help with converting proofs, the old
  3647 behaviour of the simplifier can be restored like this: declare/using
  3648 [[simp_legacy_precond]].  This configuration option will disappear
  3649 again in the future.  INCOMPATIBILITY.
  3650 
  3651 * Simproc "finite_Collect" is no longer enabled by default, due to
  3652 spurious crashes and other surprises.  Potential INCOMPATIBILITY.
  3653 
  3654 * Moved new (co)datatype package and its dependencies from session
  3655   "HOL-BNF" to "HOL".  The commands 'bnf', 'wrap_free_constructors',
  3656   'datatype_new', 'codatatype', 'primcorec', 'primcorecursive' are now
  3657   part of theory "Main".
  3658 
  3659   Theory renamings:
  3660     FunDef.thy ~> Fun_Def.thy (and Fun_Def_Base.thy)
  3661     Library/Wfrec.thy ~> Wfrec.thy
  3662     Library/Zorn.thy ~> Zorn.thy
  3663     Cardinals/Order_Relation.thy ~> Order_Relation.thy
  3664     Library/Order_Union.thy ~> Cardinals/Order_Union.thy
  3665     Cardinals/Cardinal_Arithmetic_Base.thy ~> BNF_Cardinal_Arithmetic.thy
  3666     Cardinals/Cardinal_Order_Relation_Base.thy ~> BNF_Cardinal_Order_Relation.thy
  3667     Cardinals/Constructions_on_Wellorders_Base.thy ~> BNF_Constructions_on_Wellorders.thy
  3668     Cardinals/Wellorder_Embedding_Base.thy ~> BNF_Wellorder_Embedding.thy
  3669     Cardinals/Wellorder_Relation_Base.thy ~> BNF_Wellorder_Relation.thy
  3670     BNF/Ctr_Sugar.thy ~> Ctr_Sugar.thy
  3671     BNF/Basic_BNFs.thy ~> Basic_BNFs.thy
  3672     BNF/BNF_Comp.thy ~> BNF_Comp.thy
  3673     BNF/BNF_Def.thy ~> BNF_Def.thy
  3674     BNF/BNF_FP_Base.thy ~> BNF_FP_Base.thy
  3675     BNF/BNF_GFP.thy ~> BNF_GFP.thy
  3676     BNF/BNF_LFP.thy ~> BNF_LFP.thy
  3677     BNF/BNF_Util.thy ~> BNF_Util.thy
  3678     BNF/Coinduction.thy ~> Coinduction.thy
  3679     BNF/More_BNFs.thy ~> Library/More_BNFs.thy
  3680     BNF/Countable_Type.thy ~> Library/Countable_Set_Type.thy
  3681     BNF/Examples/* ~> BNF_Examples/*
  3682 
  3683   New theories:
  3684     Wellorder_Extension.thy (split from Zorn.thy)
  3685     Library/Cardinal_Notations.thy
  3686     Library/BNF_Axomatization.thy
  3687     BNF_Examples/Misc_Primcorec.thy
  3688     BNF_Examples/Stream_Processor.thy
  3689 
  3690   Discontinued theories:
  3691     BNF/BNF.thy
  3692     BNF/Equiv_Relations_More.thy
  3693 
  3694 INCOMPATIBILITY.
  3695 
  3696 * New (co)datatype package:
  3697   - Command 'primcorec' is fully implemented.
  3698   - Command 'datatype_new' generates size functions ("size_xxx" and
  3699     "size") as required by 'fun'.
  3700   - BNFs are integrated with the Lifting tool and new-style
  3701     (co)datatypes with Transfer.
  3702   - Renamed commands:
  3703       datatype_new_compat ~> datatype_compat
  3704       primrec_new ~> primrec
  3705       wrap_free_constructors ~> free_constructors
  3706     INCOMPATIBILITY.
  3707   - The generated constants "xxx_case" and "xxx_rec" have been renamed
  3708     "case_xxx" and "rec_xxx" (e.g., "prod_case" ~> "case_prod").
  3709     INCOMPATIBILITY.
  3710   - The constant "xxx_(un)fold" and related theorems are no longer
  3711     generated.  Use "xxx_(co)rec" or define "xxx_(un)fold" manually
  3712     using "prim(co)rec".
  3713     INCOMPATIBILITY.
  3714   - No discriminators are generated for nullary constructors by
  3715     default, eliminating the need for the odd "=:" syntax.
  3716     INCOMPATIBILITY.
  3717   - No discriminators or selectors are generated by default by
  3718     "datatype_new", unless custom names are specified or the new
  3719     "discs_sels" option is passed.
  3720     INCOMPATIBILITY.
  3721 
  3722 * Old datatype package:
  3723   - The generated theorems "xxx.cases" and "xxx.recs" have been
  3724     renamed "xxx.case" and "xxx.rec" (e.g., "sum.cases" ->
  3725     "sum.case").  INCOMPATIBILITY.
  3726   - The generated constants "xxx_case", "xxx_rec", and "xxx_size" have
  3727     been renamed "case_xxx", "rec_xxx", and "size_xxx" (e.g.,
  3728     "prod_case" ~> "case_prod").  INCOMPATIBILITY.
  3729 
  3730 * The types "'a list" and "'a option", their set and map functions,
  3731   their relators, and their selectors are now produced using the new
  3732   BNF-based datatype package.
  3733 
  3734   Renamed constants:
  3735     Option.set ~> set_option
  3736     Option.map ~> map_option
  3737     option_rel ~> rel_option
  3738 
  3739   Renamed theorems:
  3740     set_def ~> set_rec[abs_def]
  3741     map_def ~> map_rec[abs_def]
  3742     Option.map_def ~> map_option_case[abs_def] (with "case_option" instead of "rec_option")
  3743     option.recs ~> option.rec
  3744     list_all2_def ~> list_all2_iff
  3745     set.simps ~> set_simps (or the slightly different "list.set")
  3746     map.simps ~> list.map
  3747     hd.simps ~> list.sel(1)
  3748     tl.simps ~> list.sel(2-3)
  3749     the.simps ~> option.sel
  3750 
  3751 INCOMPATIBILITY.
  3752 
  3753 * The following map functions and relators have been renamed:
  3754     sum_map ~> map_sum
  3755     map_pair ~> map_prod
  3756     prod_rel ~> rel_prod
  3757     sum_rel ~> rel_sum
  3758     fun_rel ~> rel_fun
  3759     set_rel ~> rel_set
  3760     filter_rel ~> rel_filter
  3761     fset_rel ~> rel_fset (in "src/HOL/Library/FSet.thy")
  3762     cset_rel ~> rel_cset (in "src/HOL/Library/Countable_Set_Type.thy")
  3763     vset ~> rel_vset (in "src/HOL/Library/Quotient_Set.thy")
  3764 
  3765 INCOMPATIBILITY.
  3766 
  3767 * Lifting and Transfer:
  3768   - a type variable as a raw type is supported
  3769   - stronger reflexivity prover
  3770   - rep_eq is always generated by lift_definition
  3771   - setup for Lifting/Transfer is now automated for BNFs
  3772     + holds for BNFs that do not contain a dead variable
  3773     + relator_eq, relator_mono, relator_distr, relator_domain,
  3774       relator_eq_onp, quot_map, transfer rules for bi_unique, bi_total,
  3775       right_unique, right_total, left_unique, left_total are proved
  3776       automatically
  3777     + definition of a predicator is generated automatically
  3778     + simplification rules for a predicator definition are proved
  3779       automatically for datatypes
  3780   - consolidation of the setup of Lifting/Transfer
  3781     + property that a relator preservers reflexivity is not needed any
  3782       more
  3783       Minor INCOMPATIBILITY.
  3784     + left_total and left_unique rules are now transfer rules
  3785       (reflexivity_rule attribute not needed anymore)
  3786       INCOMPATIBILITY.
  3787     + Domainp does not have to be a separate assumption in
  3788       relator_domain theorems (=> more natural statement)
  3789       INCOMPATIBILITY.
  3790   - registration of code equations is more robust
  3791     Potential INCOMPATIBILITY.
  3792   - respectfulness proof obligation is preprocessed to a more readable
  3793     form
  3794     Potential INCOMPATIBILITY.
  3795   - eq_onp is always unfolded in respectfulness proof obligation
  3796     Potential INCOMPATIBILITY.
  3797   - unregister lifting setup for Code_Numeral.integer and
  3798     Code_Numeral.natural
  3799     Potential INCOMPATIBILITY.
  3800   - Lifting.invariant -> eq_onp
  3801     INCOMPATIBILITY.
  3802 
  3803 * New internal SAT solver "cdclite" that produces models and proof
  3804 traces.  This solver replaces the internal SAT solvers "enumerate" and
  3805 "dpll".  Applications that explicitly used one of these two SAT
  3806 solvers should use "cdclite" instead. In addition, "cdclite" is now
  3807 the default SAT solver for the "sat" and "satx" proof methods and
  3808 corresponding tactics; the old default can be restored using "declare
  3809 [[sat_solver = zchaff_with_proofs]]".  Minor INCOMPATIBILITY.
  3810 
  3811 * SMT module: A new version of the SMT module, temporarily called
  3812 "SMT2", uses SMT-LIB 2 and supports recent versions of Z3 (e.g.,
  3813 4.3). The new proof method is called "smt2". CVC3 and CVC4 are also
  3814 supported as oracles. Yices is no longer supported, because no version
  3815 of the solver can handle both SMT-LIB 2 and quantifiers.
  3816 
  3817 * Activation of Z3 now works via "z3_non_commercial" system option
  3818 (without requiring restart), instead of former settings variable
  3819 "Z3_NON_COMMERCIAL".  The option can be edited in Isabelle/jEdit menu
  3820 Plugin Options / Isabelle / General.
  3821 
  3822 * Sledgehammer:
  3823   - Z3 can now produce Isar proofs.
  3824   - MaSh overhaul:
  3825     . New SML-based learning algorithms eliminate the dependency on
  3826       Python and increase performance and reliability.
  3827     . MaSh and MeSh are now used by default together with the
  3828       traditional MePo (Meng-Paulson) relevance filter. To disable
  3829       MaSh, set the "MaSh" system option in Isabelle/jEdit Plugin
  3830       Options / Isabelle / General to "none".
  3831   - New option:
  3832       smt_proofs
  3833   - Renamed options:
  3834       isar_compress ~> compress
  3835       isar_try0 ~> try0
  3836 
  3837 INCOMPATIBILITY.
  3838 
  3839 * Removed solvers remote_cvc3 and remote_z3. Use cvc3 and z3 instead.
  3840 
  3841 * Nitpick:
  3842   - Fixed soundness bug whereby mutually recursive datatypes could
  3843     take infinite values.
  3844   - Fixed soundness bug with low-level number functions such as
  3845     "Abs_Integ" and "Rep_Integ".
  3846   - Removed "std" option.
  3847   - Renamed "show_datatypes" to "show_types" and "hide_datatypes" to
  3848     "hide_types".
  3849 
  3850 * Metis: Removed legacy proof method 'metisFT'. Use 'metis
  3851 (full_types)' instead. INCOMPATIBILITY.
  3852 
  3853 * Try0: Added 'algebra' and 'meson' to the set of proof methods.
  3854 
  3855 * Adjustion of INF and SUP operations:
  3856   - Elongated constants INFI and SUPR to INFIMUM and SUPREMUM.
  3857   - Consolidated theorem names containing INFI and SUPR: have INF and
  3858     SUP instead uniformly.
  3859   - More aggressive normalization of expressions involving INF and Inf
  3860     or SUP and Sup.
  3861   - INF_image and SUP_image do not unfold composition.
  3862   - Dropped facts INF_comp, SUP_comp.
  3863   - Default congruence rules strong_INF_cong and strong_SUP_cong, with
  3864     simplifier implication in premises.  Generalize and replace former
  3865     INT_cong, SUP_cong
  3866 
  3867 INCOMPATIBILITY.
  3868 
  3869 * SUP and INF generalized to conditionally_complete_lattice.
  3870 
  3871 * Swapped orientation of facts image_comp and vimage_comp:
  3872 
  3873   image_compose ~> image_comp [symmetric]
  3874   image_comp ~> image_comp [symmetric]
  3875   vimage_compose ~> vimage_comp [symmetric]
  3876   vimage_comp ~> vimage_comp [symmetric]
  3877 
  3878 INCOMPATIBILITY.
  3879 
  3880 * Theory reorganization: split of Big_Operators.thy into
  3881 Groups_Big.thy and Lattices_Big.thy.
  3882 
  3883 * Consolidated some facts about big group operators:
  3884 
  3885     setsum_0' ~> setsum.neutral
  3886     setsum_0 ~> setsum.neutral_const
  3887     setsum_addf ~> setsum.distrib
  3888     setsum_cartesian_product ~> setsum.cartesian_product
  3889     setsum_cases ~> setsum.If_cases
  3890     setsum_commute ~> setsum.commute
  3891     setsum_cong ~> setsum.cong
  3892     setsum_delta ~> setsum.delta
  3893     setsum_delta' ~> setsum.delta'
  3894     setsum_diff1' ~> setsum.remove
  3895     setsum_empty ~> setsum.empty
  3896     setsum_infinite ~> setsum.infinite
  3897     setsum_insert ~> setsum.insert
  3898     setsum_inter_restrict'' ~> setsum.inter_filter
  3899     setsum_mono_zero_cong_left ~> setsum.mono_neutral_cong_left
  3900     setsum_mono_zero_cong_right ~> setsum.mono_neutral_cong_right
  3901     setsum_mono_zero_left ~> setsum.mono_neutral_left
  3902     setsum_mono_zero_right ~> setsum.mono_neutral_right
  3903     setsum_reindex ~> setsum.reindex
  3904     setsum_reindex_cong ~> setsum.reindex_cong
  3905     setsum_reindex_nonzero ~> setsum.reindex_nontrivial
  3906     setsum_restrict_set ~> setsum.inter_restrict
  3907     setsum_Plus ~> setsum.Plus
  3908     setsum_setsum_restrict ~> setsum.commute_restrict
  3909     setsum_Sigma ~> setsum.Sigma
  3910     setsum_subset_diff ~> setsum.subset_diff
  3911     setsum_Un_disjoint ~> setsum.union_disjoint
  3912     setsum_UN_disjoint ~> setsum.UNION_disjoint
  3913     setsum_Un_Int ~> setsum.union_inter
  3914     setsum_Union_disjoint ~> setsum.Union_disjoint
  3915     setsum_UNION_zero ~> setsum.Union_comp
  3916     setsum_Un_zero ~> setsum.union_inter_neutral
  3917     strong_setprod_cong ~> setprod.strong_cong
  3918     strong_setsum_cong ~> setsum.strong_cong
  3919     setprod_1' ~> setprod.neutral
  3920     setprod_1 ~> setprod.neutral_const
  3921     setprod_cartesian_product ~> setprod.cartesian_product
  3922     setprod_cong ~> setprod.cong
  3923     setprod_delta ~> setprod.delta
  3924     setprod_delta' ~> setprod.delta'
  3925     setprod_empty ~> setprod.empty
  3926     setprod_infinite ~> setprod.infinite
  3927     setprod_insert ~> setprod.insert
  3928     setprod_mono_one_cong_left ~> setprod.mono_neutral_cong_left
  3929     setprod_mono_one_cong_right ~> setprod.mono_neutral_cong_right
  3930     setprod_mono_one_left ~> setprod.mono_neutral_left
  3931     setprod_mono_one_right ~> setprod.mono_neutral_right
  3932     setprod_reindex ~> setprod.reindex
  3933     setprod_reindex_cong ~> setprod.reindex_cong
  3934     setprod_reindex_nonzero ~> setprod.reindex_nontrivial
  3935     setprod_Sigma ~> setprod.Sigma
  3936     setprod_subset_diff ~> setprod.subset_diff
  3937     setprod_timesf ~> setprod.distrib
  3938     setprod_Un2 ~> setprod.union_diff2
  3939     setprod_Un_disjoint ~> setprod.union_disjoint
  3940     setprod_UN_disjoint ~> setprod.UNION_disjoint
  3941     setprod_Un_Int ~> setprod.union_inter
  3942     setprod_Union_disjoint ~> setprod.Union_disjoint
  3943     setprod_Un_one ~> setprod.union_inter_neutral
  3944 
  3945   Dropped setsum_cong2 (simple variant of setsum.cong).
  3946   Dropped setsum_inter_restrict' (simple variant of setsum.inter_restrict)
  3947   Dropped setsum_reindex_id, setprod_reindex_id
  3948     (simple variants of setsum.reindex [symmetric], setprod.reindex [symmetric]).
  3949 
  3950 INCOMPATIBILITY.
  3951 
  3952 * Abolished slightly odd global lattice interpretation for min/max.
  3953 
  3954   Fact consolidations:
  3955     min_max.inf_assoc ~> min.assoc
  3956     min_max.inf_commute ~> min.commute
  3957     min_max.inf_left_commute ~> min.left_commute
  3958     min_max.inf_idem ~> min.idem
  3959     min_max.inf_left_idem ~> min.left_idem
  3960     min_max.inf_right_idem ~> min.right_idem
  3961     min_max.sup_assoc ~> max.assoc
  3962     min_max.sup_commute ~> max.commute
  3963     min_max.sup_left_commute ~> max.left_commute
  3964     min_max.sup_idem ~> max.idem
  3965     min_max.sup_left_idem ~> max.left_idem
  3966     min_max.sup_inf_distrib1 ~> max_min_distrib2
  3967     min_max.sup_inf_distrib2 ~> max_min_distrib1
  3968     min_max.inf_sup_distrib1 ~> min_max_distrib2
  3969     min_max.inf_sup_distrib2 ~> min_max_distrib1
  3970     min_max.distrib ~> min_max_distribs
  3971     min_max.inf_absorb1 ~> min.absorb1
  3972     min_max.inf_absorb2 ~> min.absorb2
  3973     min_max.sup_absorb1 ~> max.absorb1
  3974     min_max.sup_absorb2 ~> max.absorb2
  3975     min_max.le_iff_inf ~> min.absorb_iff1
  3976     min_max.le_iff_sup ~> max.absorb_iff2
  3977     min_max.inf_le1 ~> min.cobounded1
  3978     min_max.inf_le2 ~> min.cobounded2
  3979     le_maxI1, min_max.sup_ge1 ~> max.cobounded1
  3980     le_maxI2, min_max.sup_ge2 ~> max.cobounded2
  3981     min_max.le_infI1 ~> min.coboundedI1
  3982     min_max.le_infI2 ~> min.coboundedI2
  3983     min_max.le_supI1 ~> max.coboundedI1
  3984     min_max.le_supI2 ~> max.coboundedI2
  3985     min_max.less_infI1 ~> min.strict_coboundedI1
  3986     min_max.less_infI2 ~> min.strict_coboundedI2
  3987     min_max.less_supI1 ~> max.strict_coboundedI1
  3988     min_max.less_supI2 ~> max.strict_coboundedI2
  3989     min_max.inf_mono ~> min.mono
  3990     min_max.sup_mono ~> max.mono
  3991     min_max.le_infI, min_max.inf_greatest ~> min.boundedI
  3992     min_max.le_supI, min_max.sup_least ~> max.boundedI
  3993     min_max.le_inf_iff ~> min.bounded_iff
  3994     min_max.le_sup_iff ~> max.bounded_iff
  3995 
  3996 For min_max.inf_sup_aci, prefer (one of) min.commute, min.assoc,
  3997 min.left_commute, min.left_idem, max.commute, max.assoc,
  3998 max.left_commute, max.left_idem directly.
  3999 
  4000 For min_max.inf_sup_ord, prefer (one of) min.cobounded1,
  4001 min.cobounded2, max.cobounded1m max.cobounded2 directly.
  4002 
  4003 For min_ac or max_ac, prefer more general collection ac_simps.
  4004 
  4005 INCOMPATIBILITY.
  4006 
  4007 * Theorem disambiguation Inf_le_Sup (on finite sets) ~>
  4008 Inf_fin_le_Sup_fin.  INCOMPATIBILITY.
  4009 
  4010 * Qualified constant names Wellfounded.acc, Wellfounded.accp.
  4011 INCOMPATIBILITY.
  4012 
  4013 * Fact generalization and consolidation:
  4014     neq_one_mod_two, mod_2_not_eq_zero_eq_one_int ~> not_mod_2_eq_0_eq_1
  4015 
  4016 INCOMPATIBILITY.
  4017 
  4018 * Purely algebraic definition of even.  Fact generalization and
  4019   consolidation:
  4020     nat_even_iff_2_dvd, int_even_iff_2_dvd ~> even_iff_2_dvd
  4021     even_zero_(nat|int) ~> even_zero
  4022 
  4023 INCOMPATIBILITY.
  4024 
  4025 * Abolished neg_numeral.
  4026   - Canonical representation for minus one is "- 1".
  4027   - Canonical representation for other negative numbers is "- (numeral _)".
  4028   - When devising rule sets for number calculation, consider the
  4029     following canonical cases: 0, 1, numeral _, - 1, - numeral _.
  4030   - HOLogic.dest_number also recognizes numerals in non-canonical forms
  4031     like "numeral One", "- numeral One", "- 0" and even "- ... - _".
  4032   - Syntax for negative numerals is mere input syntax.
  4033 
  4034 INCOMPATIBILITY.
  4035 
  4036 * Reduced name variants for rules on associativity and commutativity:
  4037 
  4038     add_assoc ~> add.assoc
  4039     add_commute ~> add.commute
  4040     add_left_commute ~> add.left_commute
  4041     mult_assoc ~> mult.assoc
  4042     mult_commute ~> mult.commute
  4043     mult_left_commute ~> mult.left_commute
  4044     nat_add_assoc ~> add.assoc
  4045     nat_add_commute ~> add.commute
  4046     nat_add_left_commute ~> add.left_commute
  4047     nat_mult_assoc ~> mult.assoc
  4048     nat_mult_commute ~> mult.commute
  4049     eq_assoc ~> iff_assoc
  4050     eq_left_commute ~> iff_left_commute
  4051 
  4052 INCOMPATIBILITY.
  4053 
  4054 * Fact collections add_ac and mult_ac are considered old-fashioned.
  4055 Prefer ac_simps instead, or specify rules
  4056 (add|mult).(assoc|commute|left_commute) individually.
  4057 
  4058 * Elimination of fact duplicates:
  4059     equals_zero_I ~> minus_unique
  4060     diff_eq_0_iff_eq ~> right_minus_eq
  4061     nat_infinite ~> infinite_UNIV_nat
  4062     int_infinite ~> infinite_UNIV_int
  4063 
  4064 INCOMPATIBILITY.
  4065 
  4066 * Fact name consolidation:
  4067     diff_def, diff_minus, ab_diff_minus ~> diff_conv_add_uminus
  4068     minus_le_self_iff ~> neg_less_eq_nonneg
  4069     le_minus_self_iff ~> less_eq_neg_nonpos
  4070     neg_less_nonneg ~> neg_less_pos
  4071     less_minus_self_iff ~> less_neg_neg [simp]
  4072 
  4073 INCOMPATIBILITY.
  4074 
  4075 * More simplification rules on unary and binary minus:
  4076 add_diff_cancel, add_diff_cancel_left, add_le_same_cancel1,
  4077 add_le_same_cancel2, add_less_same_cancel1, add_less_same_cancel2,
  4078 add_minus_cancel, diff_add_cancel, le_add_same_cancel1,
  4079 le_add_same_cancel2, less_add_same_cancel1, less_add_same_cancel2,
  4080 minus_add_cancel, uminus_add_conv_diff.  These correspondingly have
  4081 been taken away from fact collections algebra_simps and field_simps.
  4082 INCOMPATIBILITY.
  4083 
  4084 To restore proofs, the following patterns are helpful:
  4085 
  4086 a) Arbitrary failing proof not involving "diff_def":
  4087 Consider simplification with algebra_simps or field_simps.
  4088 
  4089 b) Lifting rules from addition to subtraction:
  4090 Try with "using <rule for addition> of [... "- _" ...]" by simp".
  4091 
  4092 c) Simplification with "diff_def": just drop "diff_def".
  4093 Consider simplification with algebra_simps or field_simps;
  4094 or the brute way with
  4095 "simp add: diff_conv_add_uminus del: add_uminus_conv_diff".
  4096 
  4097 * Introduce bdd_above and bdd_below in theory
  4098 Conditionally_Complete_Lattices, use them instead of explicitly
  4099 stating boundedness of sets.
  4100 
  4101 * ccpo.admissible quantifies only over non-empty chains to allow more
  4102 syntax-directed proof rules; the case of the empty chain shows up as
  4103 additional case in fixpoint induction proofs.  INCOMPATIBILITY.
  4104 
  4105 * Removed and renamed theorems in Series:
  4106   summable_le         ~>  suminf_le
  4107   suminf_le           ~>  suminf_le_const
  4108   series_pos_le       ~>  setsum_le_suminf
  4109   series_pos_less     ~>  setsum_less_suminf
  4110   suminf_ge_zero      ~>  suminf_nonneg
  4111   suminf_gt_zero      ~>  suminf_pos
  4112   suminf_gt_zero_iff  ~>  suminf_pos_iff
  4113   summable_sumr_LIMSEQ_suminf  ~>  summable_LIMSEQ
  4114   suminf_0_le         ~>  suminf_nonneg [rotate]
  4115   pos_summable        ~>  summableI_nonneg_bounded
  4116   ratio_test          ~>  summable_ratio_test
  4117 
  4118   removed series_zero, replaced by sums_finite
  4119 
  4120   removed auxiliary lemmas:
  4121 
  4122     sumr_offset, sumr_offset2, sumr_offset3, sumr_offset4, sumr_group,
  4123     half, le_Suc_ex_iff, lemma_realpow_diff_sumr,
  4124     real_setsum_nat_ivl_bounded, summable_le2, ratio_test_lemma2,
  4125     sumr_minus_one_realpow_zerom, sumr_one_lb_realpow_zero,
  4126     summable_convergent_sumr_iff, sumr_diff_mult_const
  4127 
  4128 INCOMPATIBILITY.
  4129 
  4130 * Replace (F)DERIV syntax by has_derivative:
  4131   - "(f has_derivative f') (at x within s)" replaces "FDERIV f x : s : f'"
  4132 
  4133   - "(f has_field_derivative f') (at x within s)" replaces "DERIV f x : s : f'"
  4134 
  4135   - "f differentiable at x within s" replaces "_ differentiable _ in _" syntax
  4136 
  4137   - removed constant isDiff
  4138 
  4139   - "DERIV f x : f'" and "FDERIV f x : f'" syntax is only available as
  4140     input syntax.
  4141 
  4142   - "DERIV f x : s : f'" and "FDERIV f x : s : f'" syntax removed.
  4143 
  4144   - Renamed FDERIV_... lemmas to has_derivative_...
  4145 
  4146   - renamed deriv (the syntax constant used for "DERIV _ _ :> _") to DERIV
  4147 
  4148   - removed DERIV_intros, has_derivative_eq_intros
  4149 
  4150   - introduced derivative_intros and deriative_eq_intros which
  4151     includes now rules for DERIV, has_derivative and
  4152     has_vector_derivative.
  4153 
  4154   - Other renamings:
  4155     differentiable_def        ~>  real_differentiable_def
  4156     differentiableE           ~>  real_differentiableE
  4157     fderiv_def                ~>  has_derivative_at
  4158     field_fderiv_def          ~>  field_has_derivative_at
  4159     isDiff_der                ~>  differentiable_def
  4160     deriv_fderiv              ~>  has_field_derivative_def
  4161     deriv_def                 ~>  DERIV_def
  4162 
  4163 INCOMPATIBILITY.
  4164 
  4165 * Include more theorems in continuous_intros. Remove the
  4166 continuous_on_intros, isCont_intros collections, these facts are now
  4167 in continuous_intros.
  4168 
  4169 * Theorems about complex numbers are now stated only using Re and Im,
  4170 the Complex constructor is not used anymore. It is possible to use
  4171 primcorec to defined the behaviour of a complex-valued function.
  4172 
  4173 Removed theorems about the Complex constructor from the simpset, they
  4174 are available as the lemma collection legacy_Complex_simps. This
  4175 especially removes
  4176 
  4177     i_complex_of_real: "ii * complex_of_real r = Complex 0 r".
  4178 
  4179 Instead the reverse direction is supported with
  4180     Complex_eq: "Complex a b = a + \<i> * b"
  4181 
  4182 Moved csqrt from Fundamental_Algebra_Theorem to Complex.
  4183 
  4184   Renamings:
  4185     Re/Im                  ~>  complex.sel
  4186     complex_Re/Im_zero     ~>  zero_complex.sel
  4187     complex_Re/Im_add      ~>  plus_complex.sel
  4188     complex_Re/Im_minus    ~>  uminus_complex.sel
  4189     complex_Re/Im_diff     ~>  minus_complex.sel
  4190     complex_Re/Im_one      ~>  one_complex.sel
  4191     complex_Re/Im_mult     ~>  times_complex.sel
  4192     complex_Re/Im_inverse  ~>  inverse_complex.sel
  4193     complex_Re/Im_scaleR   ~>  scaleR_complex.sel
  4194     complex_Re/Im_i        ~>  ii.sel
  4195     complex_Re/Im_cnj      ~>  cnj.sel
  4196     Re/Im_cis              ~>  cis.sel
  4197 
  4198     complex_divide_def   ~>  divide_complex_def
  4199     complex_norm_def     ~>  norm_complex_def
  4200     cmod_def             ~>  norm_complex_de
  4201 
  4202   Removed theorems:
  4203     complex_zero_def
  4204     complex_add_def
  4205     complex_minus_def
  4206     complex_diff_def
  4207     complex_one_def
  4208     complex_mult_def
  4209     complex_inverse_def
  4210     complex_scaleR_def
  4211 
  4212 INCOMPATIBILITY.
  4213 
  4214 * Theory Lubs moved HOL image to HOL-Library. It is replaced by
  4215 Conditionally_Complete_Lattices.  INCOMPATIBILITY.
  4216 
  4217 * HOL-Library: new theory src/HOL/Library/Tree.thy.
  4218 
  4219 * HOL-Library: removed theory src/HOL/Library/Kleene_Algebra.thy; it
  4220 is subsumed by session Kleene_Algebra in AFP.
  4221 
  4222 * HOL-Library / theory RBT: various constants and facts are hidden;
  4223 lifting setup is unregistered.  INCOMPATIBILITY.
  4224 
  4225 * HOL-Cardinals: new theory src/HOL/Cardinals/Ordinal_Arithmetic.thy.
  4226 
  4227 * HOL-Word: bit representations prefer type bool over type bit.
  4228 INCOMPATIBILITY.
  4229 
  4230 * HOL-Word:
  4231   - Abandoned fact collection "word_arith_alts", which is a duplicate
  4232     of "word_arith_wis".
  4233   - Dropped first (duplicated) element in fact collections
  4234     "sint_word_ariths", "word_arith_alts", "uint_word_ariths",
  4235     "uint_word_arith_bintrs".
  4236 
  4237 * HOL-Number_Theory:
  4238   - consolidated the proofs of the binomial theorem
  4239   - the function fib is again of type nat => nat and not overloaded
  4240   - no more references to Old_Number_Theory in the HOL libraries
  4241     (except the AFP)
  4242 
  4243 INCOMPATIBILITY.
  4244 
  4245 * HOL-Multivariate_Analysis:
  4246   - Type class ordered_real_vector for ordered vector spaces.
  4247   - New theory Complex_Basic_Analysis defining complex derivatives,
  4248     holomorphic functions, etc., ported from HOL Light's canal.ml.
  4249   - Changed order of ordered_euclidean_space to be compatible with
  4250     pointwise ordering on products. Therefore instance of
  4251     conditionally_complete_lattice and ordered_real_vector.
  4252     INCOMPATIBILITY: use box instead of greaterThanLessThan or
  4253     explicit set-comprehensions with eucl_less for other (half-)open
  4254     intervals.
  4255   - removed dependencies on type class ordered_euclidean_space with
  4256     introduction of "cbox" on euclidean_space
  4257     - renamed theorems:
  4258         interval ~> box
  4259         mem_interval ~> mem_box
  4260         interval_eq_empty ~> box_eq_empty
  4261         interval_ne_empty ~> box_ne_empty
  4262         interval_sing(1) ~> cbox_sing
  4263         interval_sing(2) ~> box_sing
  4264         subset_interval_imp ~> subset_box_imp
  4265         subset_interval ~> subset_box
  4266         open_interval ~> open_box
  4267         closed_interval ~> closed_cbox
  4268         interior_closed_interval ~> interior_cbox
  4269         bounded_closed_interval ~> bounded_cbox
  4270         compact_interval ~> compact_cbox
  4271         bounded_subset_closed_interval_symmetric ~> bounded_subset_cbox_symmetric
  4272         bounded_subset_closed_interval ~> bounded_subset_cbox
  4273         mem_interval_componentwiseI ~> mem_box_componentwiseI
  4274         convex_box ~> convex_prod
  4275         rel_interior_real_interval ~> rel_interior_real_box
  4276         convex_interval ~> convex_box
  4277         convex_hull_eq_real_interval ~> convex_hull_eq_real_cbox
  4278         frechet_derivative_within_closed_interval ~> frechet_derivative_within_cbox
  4279         content_closed_interval' ~> content_cbox'
  4280         elementary_subset_interval ~> elementary_subset_box
  4281         diameter_closed_interval ~> diameter_cbox
  4282         frontier_closed_interval ~> frontier_cbox
  4283         frontier_open_interval ~> frontier_box
  4284         bounded_subset_open_interval_symmetric ~> bounded_subset_box_symmetric
  4285         closure_open_interval ~> closure_box
  4286         open_closed_interval_convex ~> open_cbox_convex
  4287         open_interval_midpoint ~> box_midpoint
  4288         content_image_affinity_interval ~> content_image_affinity_cbox
  4289         is_interval_interval ~> is_interval_cbox + is_interval_box + is_interval_closed_interval
  4290         bounded_interval ~> bounded_closed_interval + bounded_boxes
  4291 
  4292     - respective theorems for intervals over the reals:
  4293         content_closed_interval + content_cbox
  4294         has_integral + has_integral_real
  4295         fine_division_exists + fine_division_exists_real
  4296         has_integral_null + has_integral_null_real
  4297         tagged_division_union_interval + tagged_division_union_interval_real
  4298         has_integral_const + has_integral_const_real
  4299         integral_const + integral_const_real
  4300         has_integral_bound + has_integral_bound_real
  4301         integrable_continuous + integrable_continuous_real
  4302         integrable_subinterval + integrable_subinterval_real
  4303         has_integral_reflect_lemma + has_integral_reflect_lemma_real
  4304         integrable_reflect + integrable_reflect_real
  4305         integral_reflect + integral_reflect_real
  4306         image_affinity_interval + image_affinity_cbox
  4307         image_smult_interval + image_smult_cbox
  4308         integrable_const + integrable_const_ivl
  4309         integrable_on_subinterval + integrable_on_subcbox
  4310 
  4311   - renamed theorems:
  4312     derivative_linear         ~>  has_derivative_bounded_linear
  4313     derivative_is_linear      ~>  has_derivative_linear
  4314     bounded_linear_imp_linear ~>  bounded_linear.linear
  4315 
  4316 * HOL-Probability:
  4317   - Renamed positive_integral to nn_integral:
  4318 
  4319     . Renamed all lemmas "*positive_integral*" to *nn_integral*"
  4320       positive_integral_positive ~> nn_integral_nonneg
  4321 
  4322     . Renamed abbreviation integral\<^sup>P to integral\<^sup>N.
  4323 
  4324   - replaced the Lebesgue integral on real numbers by the more general
  4325     Bochner integral for functions into a real-normed vector space.
  4326 
  4327     integral_zero               ~>  integral_zero / integrable_zero
  4328     integral_minus              ~>  integral_minus / integrable_minus
  4329     integral_add                ~>  integral_add / integrable_add
  4330     integral_diff               ~>  integral_diff / integrable_diff
  4331     integral_setsum             ~>  integral_setsum / integrable_setsum
  4332     integral_multc              ~>  integral_mult_left / integrable_mult_left
  4333     integral_cmult              ~>  integral_mult_right / integrable_mult_right
  4334     integral_triangle_inequality~>  integral_norm_bound
  4335     integrable_nonneg           ~>  integrableI_nonneg
  4336     integral_positive           ~>  integral_nonneg_AE
  4337     integrable_abs_iff          ~>  integrable_abs_cancel
  4338     positive_integral_lim_INF   ~>  nn_integral_liminf
  4339     lebesgue_real_affine        ~>  lborel_real_affine
  4340     borel_integral_has_integral ~>  has_integral_lebesgue_integral
  4341     integral_indicator          ~>
  4342          integral_real_indicator / integrable_real_indicator
  4343     positive_integral_fst       ~>  nn_integral_fst'
  4344     positive_integral_fst_measurable ~> nn_integral_fst
  4345     positive_integral_snd_measurable ~> nn_integral_snd
  4346 
  4347     integrable_fst_measurable   ~>
  4348          integral_fst / integrable_fst / AE_integrable_fst
  4349 
  4350     integrable_snd_measurable   ~>
  4351          integral_snd / integrable_snd / AE_integrable_snd
  4352 
  4353     integral_monotone_convergence  ~>
  4354          integral_monotone_convergence / integrable_monotone_convergence
  4355 
  4356     integral_monotone_convergence_at_top  ~>
  4357          integral_monotone_convergence_at_top /
  4358          integrable_monotone_convergence_at_top
  4359 
  4360     has_integral_iff_positive_integral_lebesgue  ~>
  4361          has_integral_iff_has_bochner_integral_lebesgue_nonneg
  4362 
  4363     lebesgue_integral_has_integral  ~>
  4364          has_integral_integrable_lebesgue_nonneg
  4365 
  4366     positive_integral_lebesgue_has_integral  ~>
  4367          integral_has_integral_lebesgue_nonneg /
  4368          integrable_has_integral_lebesgue_nonneg
  4369 
  4370     lebesgue_integral_real_affine  ~>
  4371          nn_integral_real_affine
  4372 
  4373     has_integral_iff_positive_integral_lborel  ~>
  4374          integral_has_integral_nonneg / integrable_has_integral_nonneg
  4375 
  4376     The following theorems where removed:
  4377 
  4378     lebesgue_integral_nonneg
  4379     lebesgue_integral_uminus
  4380     lebesgue_integral_cmult
  4381     lebesgue_integral_multc
  4382     lebesgue_integral_cmult_nonneg
  4383     integral_cmul_indicator
  4384     integral_real
  4385 
  4386   - Formalized properties about exponentially, Erlang, and normal
  4387     distributed random variables.
  4388 
  4389 * HOL-Decision_Procs: Separate command 'approximate' for approximative
  4390 computation in src/HOL/Decision_Procs/Approximation.  Minor
  4391 INCOMPATIBILITY.
  4392 
  4393 
  4394 *** Scala ***
  4395 
  4396 * The signature and semantics of Document.Snapshot.cumulate_markup /
  4397 select_markup have been clarified.  Markup is now traversed in the
  4398 order of reports given by the prover: later markup is usually more
  4399 specific and may override results accumulated so far.  The elements
  4400 guard is mandatory and checked precisely.  Subtle INCOMPATIBILITY.
  4401 
  4402 * Substantial reworking of internal PIDE protocol communication
  4403 channels.  INCOMPATIBILITY.
  4404 
  4405 
  4406 *** ML ***
  4407 
  4408 * Subtle change of semantics of Thm.eq_thm: theory stamps are not
  4409 compared (according to Thm.thm_ord), but assumed to be covered by the
  4410 current background theory.  Thus equivalent data produced in different
  4411 branches of the theory graph usually coincides (e.g. relevant for
  4412 theory merge).  Note that the softer Thm.eq_thm_prop is often more
  4413 appropriate than Thm.eq_thm.
  4414 
  4415 * Proper context for basic Simplifier operations: rewrite_rule,
  4416 rewrite_goals_rule, rewrite_goals_tac etc. INCOMPATIBILITY, need to
  4417 pass runtime Proof.context (and ensure that the simplified entity
  4418 actually belongs to it).
  4419 
  4420 * Proper context discipline for read_instantiate and instantiate_tac:
  4421 variables that are meant to become schematic need to be given as
  4422 fixed, and are generalized by the explicit context of local variables.
  4423 This corresponds to Isar attributes "where" and "of" with 'for'
  4424 declaration.  INCOMPATIBILITY, also due to potential change of indices
  4425 of schematic variables.
  4426 
  4427 * Moved ML_Compiler.exn_trace and other operations on exceptions to
  4428 structure Runtime.  Minor INCOMPATIBILITY.
  4429 
  4430 * Discontinued old Toplevel.debug in favour of system option
  4431 "ML_exception_trace", which may be also declared within the context
  4432 via "declare [[ML_exception_trace = true]]".  Minor INCOMPATIBILITY.
  4433 
  4434 * Renamed configuration option "ML_trace" to "ML_source_trace". Minor
  4435 INCOMPATIBILITY.
  4436 
  4437 * Configuration option "ML_print_depth" controls the pretty-printing
  4438 depth of the ML compiler within the context.  The old print_depth in
  4439 ML is still available as default_print_depth, but rarely used.  Minor
  4440 INCOMPATIBILITY.
  4441 
  4442 * Toplevel function "use" refers to raw ML bootstrap environment,
  4443 without Isar context nor antiquotations.  Potential INCOMPATIBILITY.
  4444 Note that 'ML_file' is the canonical command to load ML files into the
  4445 formal context.
  4446 
  4447 * Simplified programming interface to define ML antiquotations, see
  4448 structure ML_Antiquotation.  Minor INCOMPATIBILITY.
  4449 
  4450 * ML antiquotation @{here} refers to its source position, which is
  4451 occasionally useful for experimentation and diagnostic purposes.
  4452 
  4453 * ML antiquotation @{path} produces a Path.T value, similarly to
  4454 Path.explode, but with compile-time check against the file-system and
  4455 some PIDE markup.  Note that unlike theory source, ML does not have a
  4456 well-defined master directory, so an absolute symbolic path
  4457 specification is usually required, e.g. "~~/src/HOL".
  4458 
  4459 * ML antiquotation @{print} inlines a function to print an arbitrary
  4460 ML value, which is occasionally useful for diagnostic or demonstration
  4461 purposes.
  4462 
  4463 
  4464 *** System ***
  4465 
  4466 * Proof General with its traditional helper scripts is now an optional
  4467 Isabelle component, e.g. see ProofGeneral-4.2-2 from the Isabelle
  4468 component repository http://isabelle.in.tum.de/components/.  Note that
  4469 the "system" manual provides general explanations about add-on
  4470 components, especially those that are not bundled with the release.
  4471 
  4472 * The raw Isabelle process executable has been renamed from
  4473 "isabelle-process" to "isabelle_process", which conforms to common
  4474 shell naming conventions, and allows to define a shell function within
  4475 the Isabelle environment to avoid dynamic path lookup.  Rare
  4476 incompatibility for old tools that do not use the ISABELLE_PROCESS
  4477 settings variable.
  4478 
  4479 * Former "isabelle tty" has been superseded by "isabelle console",
  4480 with implicit build like "isabelle jedit", and without the mostly
  4481 obsolete Isar TTY loop.
  4482 
  4483 * Simplified "isabelle display" tool.  Settings variables DVI_VIEWER
  4484 and PDF_VIEWER now refer to the actual programs, not shell
  4485 command-lines.  Discontinued option -c: invocation may be asynchronous
  4486 via desktop environment, without any special precautions.  Potential
  4487 INCOMPATIBILITY with ambitious private settings.
  4488 
  4489 * Removed obsolete "isabelle unsymbolize".  Note that the usual format
  4490 for email communication is the Unicode rendering of Isabelle symbols,
  4491 as produced by Isabelle/jEdit, for example.
  4492 
  4493 * Removed obsolete tool "wwwfind". Similar functionality may be
  4494 integrated into Isabelle/jEdit eventually.
  4495 
  4496 * Improved 'display_drafts' concerning desktop integration and
  4497 repeated invocation in PIDE front-end: re-use single file
  4498 $ISABELLE_HOME_USER/tmp/drafts.pdf and corresponding views.
  4499 
  4500 * Session ROOT specifications require explicit 'document_files' for
  4501 robust dependencies on LaTeX sources.  Only these explicitly given
  4502 files are copied to the document output directory, before document
  4503 processing is started.
  4504 
  4505 * Windows: support for regular TeX installation (e.g. MiKTeX) instead
  4506 of TeX Live from Cygwin.
  4507 
  4508 
  4509 
  4510 New in Isabelle2013-2 (December 2013)
  4511 -------------------------------------
  4512 
  4513 *** Prover IDE -- Isabelle/Scala/jEdit ***
  4514 
  4515 * More robust editing of running commands with internal forks,
  4516 e.g. non-terminating 'by' steps.
  4517 
  4518 * More relaxed Sledgehammer panel: avoid repeated application of query
  4519 after edits surrounding the command location.
  4520 
  4521 * More status information about commands that are interrupted
  4522 accidentally (via physical event or Poly/ML runtime system signal,
  4523 e.g. out-of-memory).
  4524 
  4525 
  4526 *** System ***
  4527 
  4528 * More robust termination of external processes managed by
  4529 Isabelle/ML: support cancellation of tasks within the range of
  4530 milliseconds, as required for PIDE document editing with automatically
  4531 tried tools (e.g. Sledgehammer).
  4532 
  4533 * Reactivated Isabelle/Scala kill command for external processes on
  4534 Mac OS X, which was accidentally broken in Isabelle2013-1 due to a
  4535 workaround for some Debian/Ubuntu Linux versions from 2013.
  4536 
  4537 
  4538 
  4539 New in Isabelle2013-1 (November 2013)
  4540 -------------------------------------
  4541 
  4542 *** General ***
  4543 
  4544 * Discontinued obsolete 'uses' within theory header.  Note that
  4545 commands like 'ML_file' work without separate declaration of file
  4546 dependencies.  Minor INCOMPATIBILITY.
  4547 
  4548 * Discontinued redundant 'use' command, which was superseded by
  4549 'ML_file' in Isabelle2013.  Minor INCOMPATIBILITY.
  4550 
  4551 * Simplified subscripts within identifiers, using plain \<^sub>
  4552 instead of the second copy \<^isub> and \<^isup>.  Superscripts are
  4553 only for literal tokens within notation; explicit mixfix annotations
  4554 for consts or fixed variables may be used as fall-back for unusual
  4555 names.  Obsolete \<twosuperior> has been expanded to \<^sup>2 in
  4556 Isabelle/HOL.  INCOMPATIBILITY, use "isabelle update_sub_sup" to
  4557 standardize symbols as a starting point for further manual cleanup.
  4558 The ML reference variable "legacy_isub_isup" may be set as temporary
  4559 workaround, to make the prover accept a subset of the old identifier
  4560 syntax.
  4561 
  4562 * Document antiquotations: term style "isub" has been renamed to
  4563 "sub".  Minor INCOMPATIBILITY.
  4564 
  4565 * Uniform management of "quick_and_dirty" as system option (see also
  4566 "isabelle options"), configuration option within the context (see also
  4567 Config.get in Isabelle/ML), and attribute in Isabelle/Isar.  Minor
  4568 INCOMPATIBILITY, need to use more official Isabelle means to access
  4569 quick_and_dirty, instead of historical poking into mutable reference.
  4570 
  4571 * Renamed command 'print_configs' to 'print_options'.  Minor
  4572 INCOMPATIBILITY.
  4573 
  4574 * Proper diagnostic command 'print_state'.  Old 'pr' (with its
  4575 implicit change of some global references) is retained for now as
  4576 control command, e.g. for ProofGeneral 3.7.x.
  4577 
  4578 * Discontinued 'print_drafts' command with its old-fashioned PS output
  4579 and Unix command-line print spooling.  Minor INCOMPATIBILITY: use
  4580 'display_drafts' instead and print via the regular document viewer.
  4581 
  4582 * Updated and extended "isar-ref" and "implementation" manual,
  4583 eliminated old "ref" manual.
  4584 
  4585 
  4586 *** Prover IDE -- Isabelle/Scala/jEdit ***
  4587 
  4588 * New manual "jedit" for Isabelle/jEdit, see isabelle doc or
  4589 Documentation panel.
  4590 
  4591 * Dockable window "Documentation" provides access to Isabelle
  4592 documentation.
  4593 
  4594 * Dockable window "Find" provides query operations for formal entities
  4595 (GUI front-end to 'find_theorems' command).
  4596 
  4597 * Dockable window "Sledgehammer" manages asynchronous / parallel
  4598 sledgehammer runs over existing document sources, independently of
  4599 normal editing and checking process.
  4600 
  4601 * Dockable window "Timing" provides an overview of relevant command
  4602 timing information, depending on option jedit_timing_threshold.  The
  4603 same timing information is shown in the extended tooltip of the
  4604 command keyword, when hovering the mouse over it while the CONTROL or
  4605 COMMAND modifier is pressed.
  4606 
  4607 * Improved dockable window "Theories": Continuous checking of proof
  4608 document (visible and required parts) may be controlled explicitly,
  4609 using check box or shortcut "C+e ENTER".  Individual theory nodes may
  4610 be marked explicitly as required and checked in full, using check box
  4611 or shortcut "C+e SPACE".
  4612 
  4613 * Improved completion mechanism, which is now managed by the
  4614 Isabelle/jEdit plugin instead of SideKick.  Refined table of Isabelle
  4615 symbol abbreviations (see $ISABELLE_HOME/etc/symbols).
  4616 
  4617 * Standard jEdit keyboard shortcut C+b complete-word is remapped to
  4618 isabelle.complete for explicit completion in Isabelle sources.
  4619 INCOMPATIBILITY wrt. jEdit defaults, may have to invent new shortcuts
  4620 to resolve conflict.
  4621 
  4622 * Improved support of various "minor modes" for Isabelle NEWS,
  4623 options, session ROOT etc., with completion and SideKick tree view.
  4624 
  4625 * Strictly monotonic document update, without premature cancellation of
  4626 running transactions that are still needed: avoid reset/restart of
  4627 such command executions while editing.
  4628 
  4629 * Support for asynchronous print functions, as overlay to existing
  4630 document content.
  4631 
  4632 * Support for automatic tools in HOL, which try to prove or disprove
  4633 toplevel theorem statements.
  4634 
  4635 * Action isabelle.reset-font-size resets main text area font size
  4636 according to Isabelle/Scala plugin option "jedit_font_reset_size" (see
  4637 also "Plugin Options / Isabelle / General").  It can be bound to some
  4638 keyboard shortcut by the user (e.g. C+0 and/or C+NUMPAD0).
  4639 
  4640 * File specifications in jEdit (e.g. file browser) may refer to
  4641 $ISABELLE_HOME and $ISABELLE_HOME_USER on all platforms.  Discontinued
  4642 obsolete $ISABELLE_HOME_WINDOWS variable.
  4643 
  4644 * Improved support for Linux look-and-feel "GTK+", see also "Utilities
  4645 / Global Options / Appearance".
  4646 
  4647 * Improved support of native Mac OS X functionality via "MacOSX"
  4648 plugin, which is now enabled by default.
  4649 
  4650 
  4651 *** Pure ***
  4652 
  4653 * Commands 'interpretation' and 'sublocale' are now target-sensitive.
  4654 In particular, 'interpretation' allows for non-persistent
  4655 interpretation within "context ... begin ... end" blocks offering a
  4656 light-weight alternative to 'sublocale'.  See "isar-ref" manual for
  4657 details.
  4658 
  4659 * Improved locales diagnostic command 'print_dependencies'.
  4660 
  4661 * Discontinued obsolete 'axioms' command, which has been marked as
  4662 legacy since Isabelle2009-2.  INCOMPATIBILITY, use 'axiomatization'
  4663 instead, while observing its uniform scope for polymorphism.
  4664 
  4665 * Discontinued empty name bindings in 'axiomatization'.
  4666 INCOMPATIBILITY.
  4667 
  4668 * System option "proofs" has been discontinued.  Instead the global
  4669 state of Proofterm.proofs is persistently compiled into logic images
  4670 as required, notably HOL-Proofs.  Users no longer need to change
  4671 Proofterm.proofs dynamically.  Minor INCOMPATIBILITY.
  4672 
  4673 * Syntax translation functions (print_translation etc.) always depend
  4674 on Proof.context.  Discontinued former "(advanced)" option -- this is
  4675 now the default.  Minor INCOMPATIBILITY.
  4676 
  4677 * Former global reference trace_unify_fail is now available as
  4678 configuration option "unify_trace_failure" (global context only).
  4679 
  4680 * SELECT_GOAL now retains the syntactic context of the overall goal
  4681 state (schematic variables etc.).  Potential INCOMPATIBILITY in rare
  4682 situations.
  4683 
  4684 
  4685 *** HOL ***
  4686 
  4687 * Stronger precedence of syntax for big intersection and union on
  4688 sets, in accordance with corresponding lattice operations.
  4689 INCOMPATIBILITY.
  4690 
  4691 * Notation "{p:A. P}" now allows tuple patterns as well.
  4692 
  4693 * Nested case expressions are now translated in a separate check phase
  4694 rather than during parsing. The data for case combinators is separated
  4695 from the datatype package. The declaration attribute
  4696 "case_translation" can be used to register new case combinators:
  4697 
  4698   declare [[case_translation case_combinator constructor1 ... constructorN]]
  4699 
  4700 * Code generator:
  4701   - 'code_printing' unifies 'code_const' / 'code_type' / 'code_class' /
  4702     'code_instance'.
  4703   - 'code_identifier' declares name hints for arbitrary identifiers in
  4704     generated code, subsuming 'code_modulename'.
  4705 
  4706 See the isar-ref manual for syntax diagrams, and the HOL theories for
  4707 examples.
  4708 
  4709 * Attibute 'code': 'code' now declares concrete and abstract code
  4710 equations uniformly.  Use explicit 'code equation' and 'code abstract'
  4711 to distinguish both when desired.
  4712 
  4713 * Discontinued theories Code_Integer and Efficient_Nat by a more
  4714 fine-grain stack of theories Code_Target_Int, Code_Binary_Nat,
  4715 Code_Target_Nat and Code_Target_Numeral.  See the tutorial on code
  4716 generation for details.  INCOMPATIBILITY.
  4717 
  4718 * Numeric types are mapped by default to target language numerals:
  4719 natural (replaces former code_numeral) and integer (replaces former
  4720 code_int).  Conversions are available as integer_of_natural /
  4721 natural_of_integer / integer_of_nat / nat_of_integer (in HOL) and
  4722 Code_Numeral.integer_of_natural / Code_Numeral.natural_of_integer (in
  4723 ML).  INCOMPATIBILITY.
  4724 
  4725 * Function package: For mutually recursive functions f and g, separate
  4726 cases rules f.cases and g.cases are generated instead of unusable
  4727 f_g.cases which exposed internal sum types. Potential INCOMPATIBILITY,
  4728 in the case that the unusable rule was used nevertheless.
  4729 
  4730 * Function package: For each function f, new rules f.elims are
  4731 generated, which eliminate equalities of the form "f x = t".
  4732 
  4733 * New command 'fun_cases' derives ad-hoc elimination rules for
  4734 function equations as simplified instances of f.elims, analogous to
  4735 inductive_cases.  See ~~/src/HOL/ex/Fundefs.thy for some examples.
  4736 
  4737 * Lifting:
  4738   - parametrized correspondence relations are now supported:
  4739     + parametricity theorems for the raw term can be specified in
  4740       the command lift_definition, which allow us to generate stronger
  4741       transfer rules
  4742     + setup_lifting generates stronger transfer rules if parametric
  4743       correspondence relation can be generated
  4744     + various new properties of the relator must be specified to support
  4745       parametricity
  4746     + parametricity theorem for the Quotient relation can be specified
  4747   - setup_lifting generates domain rules for the Transfer package
  4748   - stronger reflexivity prover of respectfulness theorems for type
  4749     copies
  4750   - ===> and --> are now local. The symbols can be introduced
  4751     by interpreting the locale lifting_syntax (typically in an
  4752     anonymous context)
  4753   - Lifting/Transfer relevant parts of Library/Quotient_* are now in
  4754     Main. Potential INCOMPATIBILITY
  4755   - new commands for restoring and deleting Lifting/Transfer context:
  4756     lifting_forget, lifting_update
  4757   - the command print_quotmaps was renamed to print_quot_maps.
  4758     INCOMPATIBILITY
  4759 
  4760 * Transfer:
  4761   - better support for domains in Transfer: replace Domainp T
  4762     by the actual invariant in a transferred goal
  4763   - transfer rules can have as assumptions other transfer rules
  4764   - Experimental support for transferring from the raw level to the
  4765     abstract level: Transfer.transferred attribute
  4766   - Attribute version of the transfer method: untransferred attribute
  4767 
  4768 * Reification and reflection:
  4769   - Reification is now directly available in HOL-Main in structure
  4770     "Reification".
  4771   - Reflection now handles multiple lists with variables also.
  4772   - The whole reflection stack has been decomposed into conversions.
  4773 INCOMPATIBILITY.
  4774 
  4775 * Revised devices for recursive definitions over finite sets:
  4776   - Only one fundamental fold combinator on finite set remains:
  4777     Finite_Set.fold :: ('a => 'b => 'b) => 'b => 'a set => 'b
  4778     This is now identity on infinite sets.
  4779   - Locales ("mini packages") for fundamental definitions with
  4780     Finite_Set.fold: folding, folding_idem.
  4781   - Locales comm_monoid_set, semilattice_order_set and
  4782     semilattice_neutr_order_set for big operators on sets.
  4783     See theory Big_Operators for canonical examples.
  4784     Note that foundational constants comm_monoid_set.F and
  4785     semilattice_set.F correspond to former combinators fold_image
  4786     and fold1 respectively.  These are now gone.  You may use
  4787     those foundational constants as substitutes, but it is
  4788     preferable to interpret the above locales accordingly.
  4789   - Dropped class ab_semigroup_idem_mult (special case of lattice,
  4790     no longer needed in connection with Finite_Set.fold etc.)
  4791   - Fact renames:
  4792       card.union_inter ~> card_Un_Int [symmetric]
  4793       card.union_disjoint ~> card_Un_disjoint
  4794 INCOMPATIBILITY.
  4795 
  4796 * Locale hierarchy for abstract orderings and (semi)lattices.
  4797 
  4798 * Complete_Partial_Order.admissible is defined outside the type class
  4799 ccpo, but with mandatory prefix ccpo. Admissibility theorems lose the
  4800 class predicate assumption or sort constraint when possible.
  4801 INCOMPATIBILITY.
  4802 
  4803 * Introduce type class "conditionally_complete_lattice": Like a
  4804 complete lattice but does not assume the existence of the top and
  4805 bottom elements.  Allows to generalize some lemmas about reals and
  4806 extended reals.  Removed SupInf and replaced it by the instantiation
  4807 of conditionally_complete_lattice for real. Renamed lemmas about
  4808 conditionally-complete lattice from Sup_... to cSup_... and from
  4809 Inf_...  to cInf_... to avoid hidding of similar complete lattice
  4810 lemmas.
  4811 
  4812 * Introduce type class linear_continuum as combination of
  4813 conditionally-complete lattices and inner dense linorders which have
  4814 more than one element.  INCOMPATIBILITY.
  4815 
  4816 * Introduced type classes order_top and order_bot. The old classes top
  4817 and bot only contain the syntax without assumptions.  INCOMPATIBILITY:
  4818 Rename bot -> order_bot, top -> order_top
  4819 
  4820 * Introduce type classes "no_top" and "no_bot" for orderings without
  4821 top and bottom elements.
  4822 
  4823 * Split dense_linorder into inner_dense_order and no_top, no_bot.
  4824 
  4825 * Complex_Main: Unify and move various concepts from
  4826 HOL-Multivariate_Analysis to HOL-Complex_Main.
  4827 
  4828  - Introduce type class (lin)order_topology and
  4829    linear_continuum_topology.  Allows to generalize theorems about
  4830    limits and order.  Instances are reals and extended reals.
  4831 
  4832  - continuous and continuos_on from Multivariate_Analysis:
  4833    "continuous" is the continuity of a function at a filter.  "isCont"
  4834    is now an abbrevitation: "isCont x f == continuous (at _) f".
  4835 
  4836    Generalized continuity lemmas from isCont to continuous on an
  4837    arbitrary filter.
  4838 
  4839  - compact from Multivariate_Analysis. Use Bolzano's lemma to prove
  4840    compactness of closed intervals on reals. Continuous functions
  4841    attain infimum and supremum on compact sets. The inverse of a
  4842    continuous function is continuous, when the function is continuous
  4843    on a compact set.
  4844 
  4845  - connected from Multivariate_Analysis. Use it to prove the
  4846    intermediate value theorem. Show connectedness of intervals on
  4847    linear_continuum_topology).
  4848 
  4849  - first_countable_topology from Multivariate_Analysis. Is used to
  4850    show equivalence of properties on the neighbourhood filter of x and
  4851    on all sequences converging to x.
  4852 
  4853  - FDERIV: Definition of has_derivative moved to Deriv.thy. Moved
  4854    theorems from Library/FDERIV.thy to Deriv.thy and base the
  4855    definition of DERIV on FDERIV. Add variants of DERIV and FDERIV
  4856    which are restricted to sets, i.e. to represent derivatives from
  4857    left or right.
  4858 
  4859  - Removed the within-filter. It is replaced by the principal filter:
  4860 
  4861      F within X = inf F (principal X)
  4862 
  4863  - Introduce "at x within U" as a single constant, "at x" is now an
  4864    abbreviation for "at x within UNIV"
  4865 
  4866  - Introduce named theorem collections tendsto_intros,
  4867    continuous_intros, continuous_on_intros and FDERIV_intros. Theorems
  4868    in tendsto_intros (or FDERIV_intros) are also available as
  4869    tendsto_eq_intros (or FDERIV_eq_intros) where the right-hand side
  4870    is replaced by a congruence rule. This allows to apply them as
  4871    intro rules and then proving equivalence by the simplifier.
  4872 
  4873  - Restructured theories in HOL-Complex_Main:
  4874 
  4875    + Moved RealDef and RComplete into Real
  4876 
  4877    + Introduced Topological_Spaces and moved theorems about
  4878      topological spaces, filters, limits and continuity to it
  4879 
  4880    + Renamed RealVector to Real_Vector_Spaces
  4881 
  4882    + Split Lim, SEQ, Series into Topological_Spaces,
  4883      Real_Vector_Spaces, and Limits
  4884 
  4885    + Moved Ln and Log to Transcendental
  4886 
  4887    + Moved theorems about continuity from Deriv to Topological_Spaces
  4888 
  4889  - Remove various auxiliary lemmas.
  4890 
  4891 INCOMPATIBILITY.
  4892 
  4893 * Nitpick:
  4894   - Added option "spy".
  4895   - Reduce incidence of "too high arity" errors.
  4896 
  4897 * Sledgehammer:
  4898   - Renamed option:
  4899       isar_shrink ~> isar_compress
  4900     INCOMPATIBILITY.
  4901   - Added options "isar_try0", "spy".
  4902   - Better support for "isar_proofs".
  4903   - MaSh has been fined-tuned and now runs as a local server.
  4904 
  4905 * Improved support for ad hoc overloading of constants (see also
  4906 isar-ref manual and ~~/src/HOL/ex/Adhoc_Overloading_Examples.thy).
  4907 
  4908 * Library/Polynomial.thy:
  4909   - Use lifting for primitive definitions.
  4910   - Explicit conversions from and to lists of coefficients, used for
  4911     generated code.
  4912   - Replaced recursion operator poly_rec by fold_coeffs.
  4913   - Prefer pre-existing gcd operation for gcd.
  4914   - Fact renames:
  4915     poly_eq_iff ~> poly_eq_poly_eq_iff
  4916     poly_ext ~> poly_eqI
  4917     expand_poly_eq ~> poly_eq_iff
  4918 IMCOMPATIBILITY.
  4919 
  4920 * New Library/Simps_Case_Conv.thy: Provides commands simps_of_case and
  4921 case_of_simps to convert function definitions between a list of
  4922 equations with patterns on the lhs and a single equation with case
  4923 expressions on the rhs. See also Ex/Simps_Case_Conv_Examples.thy.
  4924 
  4925 * New Library/FSet.thy: type of finite sets defined as a subtype of
  4926 sets defined by Lifting/Transfer.
  4927 
  4928 * Discontinued theory src/HOL/Library/Eval_Witness.  INCOMPATIBILITY.
  4929 
  4930 * Consolidation of library theories on product orders:
  4931 
  4932     Product_Lattice ~> Product_Order -- pointwise order on products
  4933     Product_ord ~> Product_Lexorder -- lexicographic order on products
  4934 
  4935 INCOMPATIBILITY.
  4936 
  4937 * Imperative-HOL: The MREC combinator is considered legacy and no
  4938 longer included by default. INCOMPATIBILITY, use partial_function
  4939 instead, or import theory Legacy_Mrec as a fallback.
  4940 
  4941 * HOL-Algebra: Discontinued theories ~~/src/HOL/Algebra/abstract and
  4942 ~~/src/HOL/Algebra/poly.  Existing theories should be based on
  4943 ~~/src/HOL/Library/Polynomial instead.  The latter provides
  4944 integration with HOL's type classes for rings.  INCOMPATIBILITY.
  4945 
  4946 * HOL-BNF:
  4947   - Various improvements to BNF-based (co)datatype package, including
  4948     new commands "primrec_new", "primcorec", and
  4949     "datatype_new_compat", as well as documentation. See
  4950     "datatypes.pdf" for details.
  4951   - New "coinduction" method to avoid some boilerplate (compared to
  4952     coinduct).
  4953   - Renamed keywords:
  4954     data ~> datatype_new
  4955     codata ~> codatatype
  4956     bnf_def ~> bnf
  4957   - Renamed many generated theorems, including
  4958     discs ~> disc
  4959     map_comp' ~> map_comp
  4960     map_id' ~> map_id
  4961     sels ~> sel
  4962     set_map' ~> set_map
  4963     sets ~> set
  4964 IMCOMPATIBILITY.
  4965 
  4966 
  4967 *** ML ***
  4968 
  4969 * Spec_Check is a Quickcheck tool for Isabelle/ML.  The ML function
  4970 "check_property" allows to check specifications of the form "ALL x y
  4971 z. prop x y z".  See also ~~/src/Tools/Spec_Check/ with its
  4972 Examples.thy in particular.
  4973 
  4974 * Improved printing of exception trace in Poly/ML 5.5.1, with regular
  4975 tracing output in the command transaction context instead of physical
  4976 stdout.  See also Toplevel.debug, Toplevel.debugging and
  4977 ML_Compiler.exn_trace.
  4978 
  4979 * ML type "theory" is now immutable, without any special treatment of
  4980 drafts or linear updates (which could lead to "stale theory" errors in
  4981 the past).  Discontinued obsolete operations like Theory.copy,
  4982 Theory.checkpoint, and the auxiliary type theory_ref.  Minor
  4983 INCOMPATIBILITY.
  4984 
  4985 * More uniform naming of goal functions for skipped proofs:
  4986 
  4987     Skip_Proof.prove  ~>  Goal.prove_sorry
  4988     Skip_Proof.prove_global  ~>  Goal.prove_sorry_global
  4989 
  4990 Minor INCOMPATIBILITY.
  4991 
  4992 * Simplifier tactics and tools use proper Proof.context instead of
  4993 historic type simpset.  Old-style declarations like addsimps,
  4994 addsimprocs etc. operate directly on Proof.context.  Raw type simpset
  4995 retains its use as snapshot of the main Simplifier context, using
  4996 simpset_of and put_simpset on Proof.context.  INCOMPATIBILITY -- port
  4997 old tools by making them depend on (ctxt : Proof.context) instead of
  4998 (ss : simpset), then turn (simpset_of ctxt) into ctxt.
  4999 
  5000 * Modifiers for classical wrappers (e.g. addWrapper, delWrapper)
  5001 operate on Proof.context instead of claset, for uniformity with addIs,
  5002 addEs, addDs etc. Note that claset_of and put_claset allow to manage
  5003 clasets separately from the context.
  5004 
  5005 * Discontinued obsolete ML antiquotations @{claset} and @{simpset}.
  5006 INCOMPATIBILITY, use @{context} instead.
  5007 
  5008 * Antiquotation @{theory_context A} is similar to @{theory A}, but
  5009 presents the result as initial Proof.context.
  5010 
  5011 
  5012 *** System ***
  5013 
  5014 * Discontinued obsolete isabelle usedir, mkdir, make -- superseded by
  5015 "isabelle build" in Isabelle2013.  INCOMPATIBILITY.
  5016 
  5017 * Discontinued obsolete isabelle-process options -f and -u (former
  5018 administrative aliases of option -e).  Minor INCOMPATIBILITY.
  5019 
  5020 * Discontinued obsolete isabelle print tool, and PRINT_COMMAND
  5021 settings variable.
  5022 
  5023 * Discontinued ISABELLE_DOC_FORMAT settings variable and historic
  5024 document formats: dvi.gz, ps, ps.gz -- the default document format is
  5025 always pdf.
  5026 
  5027 * Isabelle settings variable ISABELLE_BUILD_JAVA_OPTIONS allows to
  5028 specify global resources of the JVM process run by isabelle build.
  5029 
  5030 * Toplevel executable $ISABELLE_HOME/bin/isabelle_scala_script allows
  5031 to run Isabelle/Scala source files as standalone programs.
  5032 
  5033 * Improved "isabelle keywords" tool (for old-style ProofGeneral
  5034 keyword tables): use Isabelle/Scala operations, which inspect outer
  5035 syntax without requiring to build sessions first.
  5036 
  5037 * Sessions may be organized via 'chapter' specifications in the ROOT
  5038 file, which determines a two-level hierarchy of browser info.  The old
  5039 tree-like organization via implicit sub-session relation (with its
  5040 tendency towards erratic fluctuation of URLs) has been discontinued.
  5041 The default chapter is called "Unsorted".  Potential INCOMPATIBILITY
  5042 for HTML presentation of theories.
  5043 
  5044 
  5045 
  5046 New in Isabelle2013 (February 2013)
  5047 -----------------------------------
  5048 
  5049 *** General ***
  5050 
  5051 * Theorem status about oracles and unfinished/failed future proofs is
  5052 no longer printed by default, since it is incompatible with
  5053 incremental / parallel checking of the persistent document model.  ML
  5054 function Thm.peek_status may be used to inspect a snapshot of the
  5055 ongoing evaluation process.  Note that in batch mode --- notably
  5056 isabelle build --- the system ensures that future proofs of all
  5057 accessible theorems in the theory context are finished (as before).
  5058 
  5059 * Configuration option show_markup controls direct inlining of markup
  5060 into the printed representation of formal entities --- notably type
  5061 and sort constraints.  This enables Prover IDE users to retrieve that
  5062 information via tooltips in the output window, for example.
  5063 
  5064 * Command 'ML_file' evaluates ML text from a file directly within the
  5065 theory, without any predeclaration via 'uses' in the theory header.
  5066 
  5067 * Old command 'use' command and corresponding keyword 'uses' in the
  5068 theory header are legacy features and will be discontinued soon.
  5069 Tools that load their additional source files may imitate the
  5070 'ML_file' implementation, such that the system can take care of
  5071 dependencies properly.
  5072 
  5073 * Discontinued obsolete method fastsimp / tactic fast_simp_tac, which
  5074 is called fastforce / fast_force_tac already since Isabelle2011-1.
  5075 
  5076 * Updated and extended "isar-ref" and "implementation" manual, reduced
  5077 remaining material in old "ref" manual.
  5078 
  5079 * Improved support for auxiliary contexts that indicate block structure
  5080 for specifications.  Nesting of "context fixes ... context assumes ..."
  5081 and "class ... context ...".
  5082 
  5083 * Attribute "consumes" allows a negative value as well, which is
  5084 interpreted relatively to the total number of premises of the rule in
  5085 the target context.  This form of declaration is stable when exported
  5086 from a nested 'context' with additional assumptions.  It is the
  5087 preferred form for definitional packages, notably cases/rules produced
  5088 in HOL/inductive and HOL/function.
  5089 
  5090 * More informative error messages for Isar proof commands involving
  5091 lazy enumerations (method applications etc.).
  5092 
  5093 * Refined 'help' command to retrieve outer syntax commands according
  5094 to name patterns (with clickable results).
  5095 
  5096 
  5097 *** Prover IDE -- Isabelle/Scala/jEdit ***
  5098 
  5099 * Parallel terminal proofs ('by') are enabled by default, likewise
  5100 proofs that are built into packages like 'datatype', 'function'.  This
  5101 allows to "run ahead" checking the theory specifications on the
  5102 surface, while the prover is still crunching on internal
  5103 justifications.  Unfinished / cancelled proofs are restarted as
  5104 required to complete full proof checking eventually.
  5105 
  5106 * Improved output panel with tooltips, hyperlinks etc. based on the
  5107 same Rich_Text_Area as regular Isabelle/jEdit buffers.  Activation of
  5108 tooltips leads to some window that supports the same recursively,
  5109 which can lead to stacks of tooltips as the semantic document content
  5110 is explored.  ESCAPE closes the whole stack, individual windows may be
  5111 closed separately, or detached to become independent jEdit dockables.
  5112 
  5113 * Improved support for commands that produce graph output: the text
  5114 message contains a clickable area to open a new instance of the graph
  5115 browser on demand.
  5116 
  5117 * More robust incremental parsing of outer syntax (partial comments,
  5118 malformed symbols).  Changing the balance of open/close quotes and
  5119 comment delimiters works more conveniently with unfinished situations
  5120 that frequently occur in user interaction.
  5121 
  5122 * More efficient painting and improved reactivity when editing large
  5123 files.  More scalable management of formal document content.
  5124 
  5125 * Smarter handling of tracing messages: prover process pauses after
  5126 certain number of messages per command transaction, with some user
  5127 dialog to stop or continue.  This avoids swamping the front-end with
  5128 potentially infinite message streams.
  5129 
  5130 * More plugin options and preferences, based on Isabelle/Scala.  The
  5131 jEdit plugin option panel provides access to some Isabelle/Scala
  5132 options, including tuning parameters for editor reactivity and color
  5133 schemes.
  5134 
  5135 * Dockable window "Symbols" provides some editing support for Isabelle
  5136 symbols.
  5137 
  5138 * Dockable window "Monitor" shows ML runtime statistics.  Note that
  5139 continuous display of the chart slows down the system.
  5140 
  5141 * Improved editing support for control styles: subscript, superscript,
  5142 bold, reset of style -- operating on single symbols or text
  5143 selections.  Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT.
  5144 
  5145 * Actions isabelle.increase-font-size and isabelle.decrease-font-size
  5146 adjust the main text area font size, and its derivatives for output,
  5147 tooltips etc.  Cf. keyboard shortcuts C-PLUS and C-MINUS, which often
  5148 need to be adapted to local keyboard layouts.
  5149 
  5150 * More reactive completion popup by default: use \t (TAB) instead of
  5151 \n (NEWLINE) to minimize intrusion into regular flow of editing.  See
  5152 also "Plugin Options / SideKick / General / Code Completion Options".
  5153 
  5154 * Implicit check and build dialog of the specified logic session
  5155 image.  For example, HOL, HOLCF, HOL-Nominal can be produced on
  5156 demand, without bundling big platform-dependent heap images in the
  5157 Isabelle distribution.
  5158 
  5159 * Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates
  5160 from Oracle provide better multi-platform experience.  This version is
  5161 now bundled exclusively with Isabelle.
  5162 
  5163 
  5164 *** Pure ***
  5165 
  5166 * Code generation for Haskell: restrict unqualified imports from
  5167 Haskell Prelude to a small set of fundamental operations.
  5168 
  5169 * Command 'export_code': relative file names are interpreted
  5170 relatively to master directory of current theory rather than the
  5171 rather arbitrary current working directory.  INCOMPATIBILITY.
  5172 
  5173 * Discontinued obsolete attribute "COMP".  Potential INCOMPATIBILITY,
  5174 use regular rule composition via "OF" / "THEN", or explicit proof
  5175 structure instead.  Note that Isabelle/ML provides a variety of
  5176 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied
  5177 with some care where this is really required.
  5178 
  5179 * Command 'typ' supports an additional variant with explicit sort
  5180 constraint, to infer and check the most general type conforming to a
  5181 given sort.  Example (in HOL):
  5182 
  5183   typ "_ * _ * bool * unit" :: finite
  5184 
  5185 * Command 'locale_deps' visualizes all locales and their relations as
  5186 a Hasse diagram.
  5187 
  5188 
  5189 *** HOL ***
  5190 
  5191 * Sledgehammer:
  5192 
  5193   - Added MaSh relevance filter based on machine-learning; see the
  5194     Sledgehammer manual for details.
  5195   - Polished Isar proofs generated with "isar_proofs" option.
  5196   - Rationalized type encodings ("type_enc" option).
  5197   - Renamed "kill_provers" subcommand to "kill_all".
  5198   - Renamed options:
  5199       isar_proof ~> isar_proofs
  5200       isar_shrink_factor ~> isar_shrink
  5201       max_relevant ~> max_facts
  5202       relevance_thresholds ~> fact_thresholds
  5203 
  5204 * Quickcheck: added an optimisation for equality premises.  It is
  5205 switched on by default, and can be switched off by setting the
  5206 configuration quickcheck_optimise_equality to false.
  5207 
  5208 * Quotient: only one quotient can be defined by quotient_type
  5209 INCOMPATIBILITY.
  5210 
  5211 * Lifting:
  5212   - generation of an abstraction function equation in lift_definition
  5213   - quot_del attribute
  5214   - renamed no_abs_code -> no_code (INCOMPATIBILITY.)
  5215 
  5216 * Simproc "finite_Collect" rewrites set comprehensions into pointfree
  5217 expressions.
  5218 
  5219 * Preprocessing of the code generator rewrites set comprehensions into
  5220 pointfree expressions.
  5221 
  5222 * The SMT solver Z3 has now by default a restricted set of directly
  5223 supported features. For the full set of features (div/mod, nonlinear
  5224 arithmetic, datatypes/records) with potential proof reconstruction
  5225 failures, enable the configuration option "z3_with_extensions".  Minor
  5226 INCOMPATIBILITY.
  5227 
  5228 * Simplified 'typedef' specifications: historical options for implicit
  5229 set definition and alternative name have been discontinued.  The
  5230 former behavior of "typedef (open) t = A" is now the default, but
  5231 written just "typedef t = A".  INCOMPATIBILITY, need to adapt theories
  5232 accordingly.
  5233 
  5234 * Removed constant "chars"; prefer "Enum.enum" on type "char"
  5235 directly.  INCOMPATIBILITY.
  5236 
  5237 * Moved operation product, sublists and n_lists from theory Enum to
  5238 List.  INCOMPATIBILITY.
  5239 
  5240 * Theorem UN_o generalized to SUP_comp.  INCOMPATIBILITY.
  5241 
  5242 * Class "comm_monoid_diff" formalises properties of bounded
  5243 subtraction, with natural numbers and multisets as typical instances.
  5244 
  5245 * Added combinator "Option.these" with type "'a option set => 'a set".
  5246 
  5247 * Theory "Transitive_Closure": renamed lemmas
  5248 
  5249   reflcl_tranclp -> reflclp_tranclp
  5250   rtranclp_reflcl -> rtranclp_reflclp
  5251 
  5252 INCOMPATIBILITY.
  5253 
  5254 * Theory "Rings": renamed lemmas (in class semiring)
  5255 
  5256   left_distrib ~> distrib_right
  5257   right_distrib ~> distrib_left
  5258 
  5259 INCOMPATIBILITY.
  5260 
  5261 * Generalized the definition of limits:
  5262 
  5263   - Introduced the predicate filterlim (LIM x F. f x :> G) which
  5264     expresses that when the input values x converge to F then the
  5265     output f x converges to G.
  5266 
  5267   - Added filters for convergence to positive (at_top) and negative
  5268     infinity (at_bot).
  5269 
  5270   - Moved infinity in the norm (at_infinity) from
  5271     Multivariate_Analysis to Complex_Main.
  5272 
  5273   - Removed real_tendsto_inf, it is superseded by "LIM x F. f x :>
  5274     at_top".
  5275 
  5276 INCOMPATIBILITY.
  5277 
  5278 * Theory "Library/Option_ord" provides instantiation of option type to
  5279 lattice type classes.
  5280 
  5281 * Theory "Library/Multiset": renamed
  5282 
  5283     constant fold_mset ~> Multiset.fold
  5284     fact fold_mset_commute ~> fold_mset_comm
  5285 
  5286 INCOMPATIBILITY.
  5287 
  5288 * Renamed theory Library/List_Prefix to Library/Sublist, with related
  5289 changes as follows.
  5290 
  5291   - Renamed constants (and related lemmas)
  5292 
  5293       prefix ~> prefixeq
  5294       strict_prefix ~> prefix
  5295 
  5296   - Replaced constant "postfix" by "suffixeq" with swapped argument
  5297     order (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped
  5298     old infix syntax "xs >>= ys"; use "suffixeq ys xs" instead.
  5299     Renamed lemmas accordingly.
  5300 
  5301   - Added constant "list_hembeq" for homeomorphic embedding on
  5302     lists. Added abbreviation "sublisteq" for special case
  5303     "list_hembeq (op =)".
  5304 
  5305   - Theory Library/Sublist no longer provides "order" and "bot" type
  5306     class instances for the prefix order (merely corresponding locale
  5307     interpretations). The type class instances are now in theory
  5308     Library/Prefix_Order.
  5309 
  5310   - The sublist relation of theory Library/Sublist_Order is now based
  5311     on "Sublist.sublisteq".  Renamed lemmas accordingly:
  5312 
  5313       le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff
  5314       le_list_append_mono ~> Sublist.list_hembeq_append_mono
  5315       le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2
  5316       le_list_Cons_EX ~> Sublist.list_hembeq_ConsD
  5317       le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2'
  5318       le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq
  5319       le_list_drop_Cons ~> Sublist.sublisteq_Cons'
  5320       le_list_drop_many ~> Sublist.sublisteq_drop_many
  5321       le_list_filter_left ~> Sublist.sublisteq_filter_left
  5322       le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many
  5323       le_list_rev_take_iff ~> Sublist.sublisteq_append
  5324       le_list_same_length ~> Sublist.sublisteq_same_length
  5325       le_list_take_many_iff ~> Sublist.sublisteq_append'
  5326       less_eq_list.drop ~> less_eq_list_drop
  5327       less_eq_list.induct ~> less_eq_list_induct
  5328       not_le_list_length ~> Sublist.not_sublisteq_length
  5329 
  5330 INCOMPATIBILITY.
  5331 
  5332 * New theory Library/Countable_Set.
  5333 
  5334 * Theory Library/Debug and Library/Parallel provide debugging and
  5335 parallel execution for code generated towards Isabelle/ML.
  5336 
  5337 * Theory Library/FuncSet: Extended support for Pi and extensional and
  5338 introduce the extensional dependent function space "PiE". Replaced
  5339 extensional_funcset by an abbreviation, and renamed lemmas from
  5340 extensional_funcset to PiE as follows:
  5341 
  5342   extensional_empty  ~>  PiE_empty
  5343   extensional_funcset_empty_domain  ~>  PiE_empty_domain
  5344   extensional_funcset_empty_range  ~>  PiE_empty_range
  5345   extensional_funcset_arb  ~>  PiE_arb
  5346   extensional_funcset_mem  ~>  PiE_mem
  5347   extensional_funcset_extend_domainI  ~>  PiE_fun_upd
  5348   extensional_funcset_restrict_domain  ~>  fun_upd_in_PiE
  5349   extensional_funcset_extend_domain_eq  ~>  PiE_insert_eq
  5350   card_extensional_funcset  ~>  card_PiE
  5351   finite_extensional_funcset  ~>  finite_PiE
  5352 
  5353 INCOMPATIBILITY.
  5354 
  5355 * Theory Library/FinFun: theory of almost everywhere constant
  5356 functions (supersedes the AFP entry "Code Generation for Functions as
  5357 Data").
  5358 
  5359 * Theory Library/Phantom: generic phantom type to make a type
  5360 parameter appear in a constant's type.  This alternative to adding
  5361 TYPE('a) as another parameter avoids unnecessary closures in generated
  5362 code.
  5363 
  5364 * Theory Library/RBT_Impl: efficient construction of red-black trees
  5365 from sorted associative lists. Merging two trees with rbt_union may
  5366 return a structurally different tree than before.  Potential
  5367 INCOMPATIBILITY.
  5368 
  5369 * Theory Library/IArray: immutable arrays with code generation.
  5370 
  5371 * Theory Library/Finite_Lattice: theory of finite lattices.
  5372 
  5373 * HOL/Multivariate_Analysis: replaced
  5374 
  5375   "basis :: 'a::euclidean_space => nat => real"
  5376   "\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space"
  5377 
  5378 on euclidean spaces by using the inner product "_ \<bullet> _" with
  5379 vectors from the Basis set: "\<Chi>\<Chi> i. f i" is superseded by
  5380 "SUM i : Basis. f i * r i".
  5381 
  5382   With this change the following constants are also changed or removed:
  5383 
  5384     DIM('a) :: nat  ~>  card (Basis :: 'a set)   (is an abbreviation)
  5385     a $$ i  ~>  inner a i  (where i : Basis)
  5386     cart_base i  removed
  5387     \<pi>, \<pi>'  removed
  5388 
  5389   Theorems about these constants where removed.
  5390 
  5391   Renamed lemmas:
  5392 
  5393     component_le_norm  ~>  Basis_le_norm
  5394     euclidean_eq  ~>  euclidean_eq_iff
  5395     differential_zero_maxmin_component  ~>  differential_zero_maxmin_cart
  5396     euclidean_simps  ~>  inner_simps
  5397     independent_basis  ~>  independent_Basis
  5398     span_basis  ~>  span_Basis
  5399     in_span_basis  ~>  in_span_Basis
  5400     norm_bound_component_le  ~>  norm_boound_Basis_le
  5401     norm_bound_component_lt  ~>  norm_boound_Basis_lt
  5402     component_le_infnorm  ~>  Basis_le_infnorm
  5403 
  5404 INCOMPATIBILITY.
  5405 
  5406 * HOL/Probability:
  5407 
  5408   - Added simproc "measurable" to automatically prove measurability.
  5409 
  5410   - Added induction rules for sigma sets with disjoint union
  5411     (sigma_sets_induct_disjoint) and for Borel-measurable functions
  5412     (borel_measurable_induct).
  5413 
  5414   - Added the Daniell-Kolmogorov theorem (the existence the limit of a
  5415     projective family).
  5416 
  5417 * HOL/Cardinals: Theories of ordinals and cardinals (supersedes the
  5418 AFP entry "Ordinals_and_Cardinals").
  5419 
  5420 * HOL/BNF: New (co)datatype package based on bounded natural functors
  5421 with support for mixed, nested recursion and interesting non-free
  5422 datatypes.
  5423 
  5424 * HOL/Finite_Set and Relation: added new set and relation operations
  5425 expressed by Finite_Set.fold.
  5426 
  5427 * New theory HOL/Library/RBT_Set: implementation of sets by red-black
  5428 trees for the code generator.
  5429 
  5430 * HOL/Library/RBT and HOL/Library/Mapping have been converted to
  5431 Lifting/Transfer.
  5432 possible INCOMPATIBILITY.
  5433 
  5434 * HOL/Set: renamed Set.project -> Set.filter
  5435 INCOMPATIBILITY.
  5436 
  5437 
  5438 *** Document preparation ***
  5439 
  5440 * Dropped legacy antiquotations "term_style" and "thm_style", since
  5441 styles may be given as arguments to "term" and "thm" already.
  5442 Discontinued legacy styles "prem1" .. "prem19".
  5443 
  5444 * Default LaTeX rendering for \<euro> is now based on eurosym package,
  5445 instead of slightly exotic babel/greek.
  5446 
  5447 * Document variant NAME may use different LaTeX entry point
  5448 document/root_NAME.tex if that file exists, instead of the common
  5449 document/root.tex.
  5450 
  5451 * Simplified custom document/build script, instead of old-style
  5452 document/IsaMakefile.  Minor INCOMPATIBILITY.
  5453 
  5454 
  5455 *** ML ***
  5456 
  5457 * The default limit for maximum number of worker threads is now 8,
  5458 instead of 4, in correspondence to capabilities of contemporary
  5459 hardware and Poly/ML runtime system.
  5460 
  5461 * Type Seq.results and related operations support embedded error
  5462 messages within lazy enumerations, and thus allow to provide
  5463 informative errors in the absence of any usable results.
  5464 
  5465 * Renamed Position.str_of to Position.here to emphasize that this is a
  5466 formal device to inline positions into message text, but not
  5467 necessarily printing visible text.
  5468 
  5469 
  5470 *** System ***
  5471 
  5472 * Advanced support for Isabelle sessions and build management, see
  5473 "system" manual for the chapter of that name, especially the "isabelle
  5474 build" tool and its examples.  The "isabelle mkroot" tool prepares
  5475 session root directories for use with "isabelle build", similar to
  5476 former "isabelle mkdir" for "isabelle usedir".  Note that this affects
  5477 document preparation as well.  INCOMPATIBILITY, isabelle usedir /
  5478 mkdir / make are rendered obsolete.
  5479 
  5480 * Discontinued obsolete Isabelle/build script, it is superseded by the
  5481 regular isabelle build tool.  For example:
  5482 
  5483   isabelle build -s -b HOL
  5484 
  5485 * Discontinued obsolete "isabelle makeall".
  5486 
  5487 * Discontinued obsolete IsaMakefile and ROOT.ML files from the
  5488 Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that
  5489 provides some traditional targets that invoke "isabelle build".  Note
  5490 that this is inefficient!  Applications of Isabelle/HOL involving
  5491 "isabelle make" should be upgraded to use "isabelle build" directly.
  5492 
  5493 * The "isabelle options" tool prints Isabelle system options, as
  5494 required for "isabelle build", for example.
  5495 
  5496 * The "isabelle logo" tool produces EPS and PDF format simultaneously.
  5497 Minor INCOMPATIBILITY in command-line options.
  5498 
  5499 * The "isabelle install" tool has now a simpler command-line.  Minor
  5500 INCOMPATIBILITY.
  5501 
  5502 * The "isabelle components" tool helps to resolve add-on components
  5503 that are not bundled, or referenced from a bare-bones repository
  5504 version of Isabelle.
  5505 
  5506 * Settings variable ISABELLE_PLATFORM_FAMILY refers to the general
  5507 platform family: "linux", "macos", "windows".
  5508 
  5509 * The ML system is configured as regular component, and no longer
  5510 picked up from some surrounding directory.  Potential INCOMPATIBILITY
  5511 for home-made settings.
  5512 
  5513 * Improved ML runtime statistics (heap, threads, future tasks etc.).
  5514 
  5515 * Discontinued support for Poly/ML 5.2.1, which was the last version
  5516 without exception positions and advanced ML compiler/toplevel
  5517 configuration.
  5518 
  5519 * Discontinued special treatment of Proof General -- no longer guess
  5520 PROOFGENERAL_HOME based on accidental file-system layout.  Minor
  5521 INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS
  5522 settings manually, or use a Proof General version that has been
  5523 bundled as Isabelle component.
  5524 
  5525 
  5526 
  5527 New in Isabelle2012 (May 2012)
  5528 ------------------------------
  5529 
  5530 *** General ***
  5531 
  5532 * Prover IDE (PIDE) improvements:
  5533 
  5534   - more robust Sledgehammer integration (as before the sledgehammer
  5535     command-line needs to be typed into the source buffer)
  5536   - markup for bound variables
  5537   - markup for types of term variables (displayed as tooltips)
  5538   - support for user-defined Isar commands within the running session
  5539   - improved support for Unicode outside original 16bit range
  5540     e.g. glyph for \<A> (thanks to jEdit 4.5.1)
  5541 
  5542 * Forward declaration of outer syntax keywords within the theory
  5543 header -- minor INCOMPATIBILITY for user-defined commands.  Allow new
  5544 commands to be used in the same theory where defined.
  5545 
  5546 * Auxiliary contexts indicate block structure for specifications with
  5547 additional parameters and assumptions.  Such unnamed contexts may be
  5548 nested within other targets, like 'theory', 'locale', 'class',
  5549 'instantiation' etc.  Results from the local context are generalized
  5550 accordingly and applied to the enclosing target context.  Example:
  5551 
  5552   context
  5553     fixes x y z :: 'a
  5554     assumes xy: "x = y" and yz: "y = z"
  5555   begin
  5556 
  5557   lemma my_trans: "x = z" using xy yz by simp
  5558 
  5559   end
  5560 
  5561   thm my_trans
  5562 
  5563 The most basic application is to factor-out context elements of
  5564 several fixes/assumes/shows theorem statements, e.g. see
  5565 ~~/src/HOL/Isar_Examples/Group_Context.thy
  5566 
  5567 Any other local theory specification element works within the "context
  5568 ... begin ... end" block as well.
  5569 
  5570 * Bundled declarations associate attributed fact expressions with a
  5571 given name in the context.  These may be later included in other
  5572 contexts.  This allows to manage context extensions casually, without
  5573 the logical dependencies of locales and locale interpretation.  See
  5574 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.
  5575 
  5576 * Commands 'lemmas' and 'theorems' allow local variables using 'for'
  5577 declaration, and results are standardized before being stored.  Thus
  5578 old-style "standard" after instantiation or composition of facts
  5579 becomes obsolete.  Minor INCOMPATIBILITY, due to potential change of
  5580 indices of schematic variables.
  5581 
  5582 * Rule attributes in local theory declarations (e.g. locale or class)
  5583 are now statically evaluated: the resulting theorem is stored instead
  5584 of the original expression.  INCOMPATIBILITY in rare situations, where
  5585 the historic accident of dynamic re-evaluation in interpretations
  5586 etc. was exploited.
  5587 
  5588 * New tutorial "Programming and Proving in Isabelle/HOL"
  5589 ("prog-prove").  It completely supersedes "A Tutorial Introduction to
  5590 Structured Isar Proofs" ("isar-overview"), which has been removed.  It
  5591 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order
  5592 Logic" as the recommended beginners tutorial, but does not cover all
  5593 of the material of that old tutorial.
  5594 
  5595 * Updated and extended reference manuals: "isar-ref",
  5596 "implementation", "system"; reduced remaining material in old "ref"
  5597 manual.
  5598 
  5599 
  5600 *** Pure ***
  5601 
  5602 * Command 'definition' no longer exports the foundational "raw_def"
  5603 into the user context.  Minor INCOMPATIBILITY, may use the regular
  5604 "def" result with attribute "abs_def" to imitate the old version.
  5605 
  5606 * Attribute "abs_def" turns an equation of the form "f x y == t" into
  5607 "f == %x y. t", which ensures that "simp" or "unfold" steps always
  5608 expand it.  This also works for object-logic equality.  (Formerly
  5609 undocumented feature.)
  5610 
  5611 * Sort constraints are now propagated in simultaneous statements, just
  5612 like type constraints.  INCOMPATIBILITY in rare situations, where
  5613 distinct sorts used to be assigned accidentally.  For example:
  5614 
  5615   lemma "P (x::'a::foo)" and "Q (y::'a::bar)"  -- "now illegal"
  5616 
  5617   lemma "P (x::'a)" and "Q (y::'a::bar)"
  5618     -- "now uniform 'a::bar instead of default sort for first occurrence (!)"
  5619 
  5620 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more
  5621 tolerant against multiple unifiers, as long as the final result is
  5622 unique.  (As before, rules are composed in canonical right-to-left
  5623 order to accommodate newly introduced premises.)
  5624 
  5625 * Renamed some inner syntax categories:
  5626 
  5627     num ~> num_token
  5628     xnum ~> xnum_token
  5629     xstr ~> str_token
  5630 
  5631 Minor INCOMPATIBILITY.  Note that in practice "num_const" or
  5632 "num_position" etc. are mainly used instead (which also include
  5633 position information via constraints).
  5634 
  5635 * Simplified configuration options for syntax ambiguity: see
  5636 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
  5637 manual.  Minor INCOMPATIBILITY.
  5638 
  5639 * Discontinued configuration option "syntax_positions": atomic terms
  5640 in parse trees are always annotated by position constraints.
  5641 
  5642 * Old code generator for SML and its commands 'code_module',
  5643 'code_library', 'consts_code', 'types_code' have been discontinued.
  5644 Use commands of the generic code generator instead.  INCOMPATIBILITY.
  5645 
  5646 * Redundant attribute "code_inline" has been discontinued. Use
  5647 "code_unfold" instead.  INCOMPATIBILITY.
  5648 
  5649 * Dropped attribute "code_unfold_post" in favor of the its dual
  5650 "code_abbrev", which yields a common pattern in definitions like
  5651 
  5652   definition [code_abbrev]: "f = t"
  5653 
  5654 INCOMPATIBILITY.
  5655 
  5656 * Obsolete 'types' command has been discontinued.  Use 'type_synonym'
  5657 instead.  INCOMPATIBILITY.
  5658 
  5659 * Discontinued old "prems" fact, which used to refer to the accidental
  5660 collection of foundational premises in the context (already marked as
  5661 legacy since Isabelle2011).
  5662 
  5663 
  5664 *** HOL ***
  5665 
  5666 * Type 'a set is now a proper type constructor (just as before
  5667 Isabelle2008).  Definitions mem_def and Collect_def have disappeared.
  5668 Non-trivial INCOMPATIBILITY.  For developments keeping predicates and
  5669 sets separate, it is often sufficient to rephrase some set S that has
  5670 been accidentally used as predicates by "%x. x : S", and some
  5671 predicate P that has been accidentally used as set by "{x. P x}".
  5672 Corresponding proofs in a first step should be pruned from any
  5673 tinkering with former theorems mem_def and Collect_def as far as
  5674 possible.
  5675 
  5676 For developments which deliberately mix predicates and sets, a
  5677 planning step is necessary to determine what should become a predicate
  5678 and what a set.  It can be helpful to carry out that step in
  5679 Isabelle2011-1 before jumping right into the current release.
  5680 
  5681 * Code generation by default implements sets as container type rather
  5682 than predicates.  INCOMPATIBILITY.
  5683 
  5684 * New type synonym 'a rel = ('a * 'a) set
  5685 
  5686 * The representation of numerals has changed.  Datatype "num"
  5687 represents strictly positive binary numerals, along with functions
  5688 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent
  5689 positive and negated numeric literals, respectively.  See also
  5690 definitions in ~~/src/HOL/Num.thy.  Potential INCOMPATIBILITY, some
  5691 user theories may require adaptations as follows:
  5692 
  5693   - Theorems with number_ring or number_semiring constraints: These
  5694     classes are gone; use comm_ring_1 or comm_semiring_1 instead.
  5695 
  5696   - Theories defining numeric types: Remove number, number_semiring,
  5697     and number_ring instances. Defer all theorems about numerals until
  5698     after classes one and semigroup_add have been instantiated.
  5699 
  5700   - Numeral-only simp rules: Replace each rule having a "number_of v"
  5701     pattern with two copies, one for numeral and one for neg_numeral.
  5702 
  5703   - Theorems about subclasses of semiring_1 or ring_1: These classes
  5704     automatically support numerals now, so more simp rules and
  5705     simprocs may now apply within the proof.
  5706 
  5707   - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:
  5708     Redefine using other integer operations.
  5709 
  5710 * Transfer: New package intended to generalize the existing
  5711 "descending" method and related theorem attributes from the Quotient
  5712 package.  (Not all functionality is implemented yet, but future
  5713 development will focus on Transfer as an eventual replacement for the
  5714 corresponding parts of the Quotient package.)
  5715 
  5716   - transfer_rule attribute: Maintains a collection of transfer rules,
  5717     which relate constants at two different types. Transfer rules may
  5718     relate different type instances of the same polymorphic constant,
  5719     or they may relate an operation on a raw type to a corresponding
  5720     operation on an abstract type (quotient or subtype). For example:
  5721 
  5722     ((A ===> B) ===> list_all2 A ===> list_all2 B) map map
  5723     (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int
  5724 
  5725   - transfer method: Replaces a subgoal on abstract types with an
  5726     equivalent subgoal on the corresponding raw types. Constants are
  5727     replaced with corresponding ones according to the transfer rules.
  5728     Goals are generalized over all free variables by default; this is
  5729     necessary for variables whose types change, but can be overridden
  5730     for specific variables with e.g. "transfer fixing: x y z".  The
  5731     variant transfer' method allows replacing a subgoal with one that
  5732     is logically stronger (rather than equivalent).
  5733 
  5734   - relator_eq attribute: Collects identity laws for relators of
  5735     various type constructors, e.g. "list_all2 (op =) = (op =)".  The
  5736     transfer method uses these lemmas to infer transfer rules for
  5737     non-polymorphic constants on the fly.
  5738 
  5739   - transfer_prover method: Assists with proving a transfer rule for a
  5740     new constant, provided the constant is defined in terms of other
  5741     constants that already have transfer rules. It should be applied
  5742     after unfolding the constant definitions.
  5743 
  5744   - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer
  5745     from type nat to type int.
  5746 
  5747 * Lifting: New package intended to generalize the quotient_definition
  5748 facility of the Quotient package; designed to work with Transfer.
  5749 
  5750   - lift_definition command: Defines operations on an abstract type in
  5751     terms of a corresponding operation on a representation
  5752     type.  Example syntax:
  5753 
  5754     lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"
  5755       is List.insert
  5756 
  5757     Users must discharge a respectfulness proof obligation when each
  5758     constant is defined. (For a type copy, i.e. a typedef with UNIV,
  5759     the proof is discharged automatically.) The obligation is
  5760     presented in a user-friendly, readable form; a respectfulness
  5761     theorem in the standard format and a transfer rule are generated
  5762     by the package.
  5763 
  5764   - Integration with code_abstype: For typedefs (e.g. subtypes
  5765     corresponding to a datatype invariant, such as dlist),
  5766     lift_definition generates a code certificate theorem and sets up
  5767     code generation for each constant.
  5768 
  5769   - setup_lifting command: Sets up the Lifting package to work with a
  5770     user-defined type. The user must provide either a quotient theorem
  5771     or a type_definition theorem.  The package configures transfer
  5772     rules for equality and quantifiers on the type, and sets up the
  5773     lift_definition command to work with the type.
  5774 
  5775   - Usage examples: See Quotient_Examples/Lift_DList.thy,
  5776     Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,
  5777     Word/Word.thy and Library/Float.thy.
  5778 
  5779 * Quotient package:
  5780 
  5781   - The 'quotient_type' command now supports a 'morphisms' option with
  5782     rep and abs functions, similar to typedef.
  5783 
  5784   - 'quotient_type' sets up new types to work with the Lifting and
  5785     Transfer packages, as with 'setup_lifting'.
  5786 
  5787   - The 'quotient_definition' command now requires the user to prove a
  5788     respectfulness property at the point where the constant is
  5789     defined, similar to lift_definition; INCOMPATIBILITY.
  5790 
  5791   - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems
  5792     accordingly, INCOMPATIBILITY.
  5793 
  5794 * New diagnostic command 'find_unused_assms' to find potentially
  5795 superfluous assumptions in theorems using Quickcheck.
  5796 
  5797 * Quickcheck:
  5798 
  5799   - Quickcheck returns variable assignments as counterexamples, which
  5800     allows to reveal the underspecification of functions under test.
  5801     For example, refuting "hd xs = x", it presents the variable
  5802     assignment xs = [] and x = a1 as a counterexample, assuming that
  5803     any property is false whenever "hd []" occurs in it.
  5804 
  5805     These counterexample are marked as potentially spurious, as
  5806     Quickcheck also returns "xs = []" as a counterexample to the
  5807     obvious theorem "hd xs = hd xs".
  5808 
  5809     After finding a potentially spurious counterexample, Quickcheck
  5810     continues searching for genuine ones.
  5811 
  5812     By default, Quickcheck shows potentially spurious and genuine
  5813     counterexamples. The option "genuine_only" sets quickcheck to only
  5814     show genuine counterexamples.
  5815 
  5816   - The command 'quickcheck_generator' creates random and exhaustive
  5817     value generators for a given type and operations.
  5818 
  5819     It generates values by using the operations as if they were
  5820     constructors of that type.
  5821 
  5822   - Support for multisets.
  5823 
  5824   - Added "use_subtype" options.
  5825 
  5826   - Added "quickcheck_locale" configuration to specify how to process
  5827     conjectures in a locale context.
  5828 
  5829 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option
  5830 and affecting 'rat' and 'real'.
  5831 
  5832 * Sledgehammer:
  5833   - Integrated more tightly with SPASS, as described in the ITP 2012
  5834     paper "More SPASS with Isabelle".
  5835   - Made it try "smt" as a fallback if "metis" fails or times out.
  5836   - Added support for the following provers: Alt-Ergo (via Why3 and
  5837     TFF1), iProver, iProver-Eq.
  5838   - Sped up the minimizer.
  5839   - Added "lam_trans", "uncurry_aliases", and "minimize" options.
  5840   - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
  5841   - Renamed "sound" option to "strict".
  5842 
  5843 * Metis: Added possibility to specify lambda translations scheme as a
  5844 parenthesized argument (e.g., "by (metis (lifting) ...)").
  5845 
  5846 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".
  5847 
  5848 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.
  5849 
  5850 * New "case_product" attribute to generate a case rule doing multiple
  5851 case distinctions at the same time.  E.g.
  5852 
  5853   list.exhaust [case_product nat.exhaust]
  5854 
  5855 produces a rule which can be used to perform case distinction on both
  5856 a list and a nat.
  5857 
  5858 * New "eventually_elim" method as a generalized variant of the
  5859 eventually_elim* rules.  Supports structured proofs.
  5860 
  5861 * Typedef with implicit set definition is considered legacy.  Use
  5862 "typedef (open)" form instead, which will eventually become the
  5863 default.
  5864 
  5865 * Record: code generation can be switched off manually with
  5866 
  5867   declare [[record_coden = false]]  -- "default true"
  5868 
  5869 * Datatype: type parameters allow explicit sort constraints.
  5870 
  5871 * Concrete syntax for case expressions includes constraints for source
  5872 positions, and thus produces Prover IDE markup for its bindings.
  5873 INCOMPATIBILITY for old-style syntax translations that augment the
  5874 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
  5875 one_case.
  5876 
  5877 * Clarified attribute "mono_set": pure declaration without modifying
  5878 the result of the fact expression.
  5879 
  5880 * More default pred/set conversions on a couple of relation operations
  5881 and predicates.  Added powers of predicate relations.  Consolidation
  5882 of some relation theorems:
  5883 
  5884   converse_def ~> converse_unfold
  5885   rel_comp_def ~> relcomp_unfold
  5886   symp_def ~> (modified, use symp_def and sym_def instead)
  5887   transp_def ~> transp_trans
  5888   Domain_def ~> Domain_unfold
  5889   Range_def ~> Domain_converse [symmetric]
  5890 
  5891 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.
  5892 
  5893 See theory "Relation" for examples for making use of pred/set
  5894 conversions by means of attributes "to_set" and "to_pred".
  5895 
  5896 INCOMPATIBILITY.
  5897 
  5898 * Renamed facts about the power operation on relations, i.e., relpow
  5899 to match the constant's name:
  5900 
  5901   rel_pow_1 ~> relpow_1
  5902   rel_pow_0_I ~> relpow_0_I
  5903   rel_pow_Suc_I ~> relpow_Suc_I
  5904   rel_pow_Suc_I2 ~> relpow_Suc_I2
  5905   rel_pow_0_E ~> relpow_0_E
  5906   rel_pow_Suc_E ~> relpow_Suc_E
  5907   rel_pow_E ~> relpow_E
  5908   rel_pow_Suc_D2 ~> relpow_Suc_D2
  5909   rel_pow_Suc_E2 ~> relpow_Suc_E2
  5910   rel_pow_Suc_D2' ~> relpow_Suc_D2'
  5911   rel_pow_E2 ~> relpow_E2
  5912   rel_pow_add ~> relpow_add
  5913   rel_pow_commute ~> relpow
  5914   rel_pow_empty ~> relpow_empty:
  5915   rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
  5916   rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
  5917   rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
  5918   rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
  5919   rel_pow_fun_conv ~> relpow_fun_conv
  5920   rel_pow_finite_bounded1 ~> relpow_finite_bounded1
  5921   rel_pow_finite_bounded ~> relpow_finite_bounded
  5922   rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
  5923   trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
  5924   single_valued_rel_pow ~> single_valued_relpow
  5925 
  5926 INCOMPATIBILITY.
  5927 
  5928 * Theory Relation: Consolidated constant name for relation composition
  5929 and corresponding theorem names:
  5930 
  5931   - Renamed constant rel_comp to relcomp.
  5932 
  5933   - Dropped abbreviation pred_comp. Use relcompp instead.
  5934 
  5935   - Renamed theorems:
  5936 
  5937     rel_compI ~> relcompI
  5938     rel_compEpair ~> relcompEpair
  5939     rel_compE ~> relcompE
  5940     pred_comp_rel_comp_eq ~> relcompp_relcomp_eq
  5941     rel_comp_empty1 ~> relcomp_empty1
  5942     rel_comp_mono ~> relcomp_mono
  5943     rel_comp_subset_Sigma ~> relcomp_subset_Sigma
  5944     rel_comp_distrib ~> relcomp_distrib
  5945     rel_comp_distrib2 ~> relcomp_distrib2
  5946     rel_comp_UNION_distrib ~> relcomp_UNION_distrib
  5947     rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2
  5948     single_valued_rel_comp ~> single_valued_relcomp
  5949     rel_comp_def ~> relcomp_unfold
  5950     converse_rel_comp ~> converse_relcomp
  5951     pred_compI ~> relcomppI
  5952     pred_compE ~> relcomppE
  5953     pred_comp_bot1 ~> relcompp_bot1
  5954     pred_comp_bot2 ~> relcompp_bot2
  5955     transp_pred_comp_less_eq ~> transp_relcompp_less_eq
  5956     pred_comp_mono ~> relcompp_mono
  5957     pred_comp_distrib ~> relcompp_distrib
  5958     pred_comp_distrib2 ~> relcompp_distrib2
  5959     converse_pred_comp ~> converse_relcompp
  5960 
  5961     finite_rel_comp ~> finite_relcomp
  5962 
  5963     set_rel_comp ~> set_relcomp
  5964 
  5965 INCOMPATIBILITY.
  5966 
  5967 * Theory Divides: Discontinued redundant theorems about div and mod.
  5968 INCOMPATIBILITY, use the corresponding generic theorems instead.
  5969 
  5970   DIVISION_BY_ZERO ~> div_by_0, mod_by_0
  5971   zdiv_self ~> div_self
  5972   zmod_self ~> mod_self
  5973   zdiv_zero ~> div_0
  5974   zmod_zero ~> mod_0
  5975   zdiv_zmod_equality ~> div_mod_equality2
  5976   zdiv_zmod_equality2 ~> div_mod_equality
  5977   zmod_zdiv_trivial ~> mod_div_trivial
  5978   zdiv_zminus_zminus ~> div_minus_minus
  5979   zmod_zminus_zminus ~> mod_minus_minus
  5980   zdiv_zminus2 ~> div_minus_right
  5981   zmod_zminus2 ~> mod_minus_right
  5982   zdiv_minus1_right ~> div_minus1_right
  5983   zmod_minus1_right ~> mod_minus1_right
  5984   zdvd_mult_div_cancel ~> dvd_mult_div_cancel
  5985   zmod_zmult1_eq ~> mod_mult_right_eq
  5986   zpower_zmod ~> power_mod
  5987   zdvd_zmod ~> dvd_mod
  5988   zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd
  5989   mod_mult_distrib ~> mult_mod_left
  5990   mod_mult_distrib2 ~> mult_mod_right
  5991 
  5992 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use
  5993 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.
  5994 
  5995 * Finite_Set.fold now qualified.  INCOMPATIBILITY.
  5996 
  5997 * Consolidated theorem names concerning fold combinators:
  5998 
  5999   inf_INFI_fold_inf ~> inf_INF_fold_inf
  6000   sup_SUPR_fold_sup ~> sup_SUP_fold_sup
  6001   INFI_fold_inf ~> INF_fold_inf
  6002   SUPR_fold_sup ~> SUP_fold_sup
  6003   union_set ~> union_set_fold
  6004   minus_set ~> minus_set_fold
  6005   INFI_set_fold ~> INF_set_fold
  6006   SUPR_set_fold ~> SUP_set_fold
  6007   INF_code ~> INF_set_foldr
  6008   SUP_code ~> SUP_set_foldr
  6009   foldr.simps ~> foldr.simps (in point-free formulation)
  6010   foldr_fold_rev ~> foldr_conv_fold
  6011   foldl_fold ~> foldl_conv_fold
  6012   foldr_foldr ~> foldr_conv_foldl
  6013   foldl_foldr ~> foldl_conv_foldr
  6014   fold_set_remdups ~> fold_set_fold_remdups
  6015   fold_set ~> fold_set_fold
  6016   fold1_set ~> fold1_set_fold
  6017 
  6018 INCOMPATIBILITY.
  6019 
  6020 * Dropped rarely useful theorems concerning fold combinators:
  6021 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
  6022 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
  6023 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
  6024 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
  6025 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,
  6026 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.
  6027 INCOMPATIBILITY.  For the common phrases "%xs. List.foldr plus xs 0"
  6028 and "List.foldl plus 0", prefer "List.listsum".  Otherwise it can be
  6029 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by
  6030 unfolding "foldr_conv_fold" and "foldl_conv_fold".
  6031 
  6032 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,
  6033 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,
  6034 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,
  6035 INF_set_foldr, SUP_set_foldr.  INCOMPATIBILITY.  Prefer corresponding
  6036 lemmas over fold rather than foldr, or make use of lemmas
  6037 fold_conv_foldr and fold_rev.
  6038 
  6039 * Congruence rules Option.map_cong and Option.bind_cong for recursion
  6040 through option types.
  6041 
  6042 * "Transitive_Closure.ntrancl": bounded transitive closure on
  6043 relations.
  6044 
  6045 * Constant "Set.not_member" now qualified.  INCOMPATIBILITY.
  6046 
  6047 * Theory Int: Discontinued many legacy theorems specific to type int.
  6048 INCOMPATIBILITY, use the corresponding generic theorems instead.
  6049 
  6050   zminus_zminus ~> minus_minus
  6051   zminus_0 ~> minus_zero
  6052   zminus_zadd_distrib ~> minus_add_distrib
  6053   zadd_commute ~> add_commute
  6054   zadd_assoc ~> add_assoc
  6055   zadd_left_commute ~> add_left_commute
  6056   zadd_ac ~> add_ac
  6057   zmult_ac ~> mult_ac
  6058   zadd_0 ~> add_0_left
  6059   zadd_0_right ~> add_0_right
  6060   zadd_zminus_inverse2 ~> left_minus
  6061   zmult_zminus ~> mult_minus_left
  6062   zmult_commute ~> mult_commute
  6063   zmult_assoc ~> mult_assoc
  6064   zadd_zmult_distrib ~> left_distrib
  6065   zadd_zmult_distrib2 ~> right_distrib
  6066   zdiff_zmult_distrib ~> left_diff_distrib
  6067   zdiff_zmult_distrib2 ~> right_diff_distrib
  6068   zmult_1 ~> mult_1_left
  6069   zmult_1_right ~> mult_1_right
  6070   zle_refl ~> order_refl
  6071   zle_trans ~> order_trans
  6072   zle_antisym ~> order_antisym
  6073   zle_linear ~> linorder_linear
  6074   zless_linear ~> linorder_less_linear
  6075   zadd_left_mono ~> add_left_mono
  6076   zadd_strict_right_mono ~> add_strict_right_mono
  6077   zadd_zless_mono ~> add_less_le_mono
  6078   int_0_less_1 ~> zero_less_one
  6079   int_0_neq_1 ~> zero_neq_one
  6080   zless_le ~> less_le
  6081   zpower_zadd_distrib ~> power_add
  6082   zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
  6083   zero_le_zpower_abs ~> zero_le_power_abs
  6084 
  6085 * Theory Deriv: Renamed
  6086 
  6087   DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
  6088 
  6089 * Theory Library/Multiset: Improved code generation of multisets.
  6090 
  6091 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets
  6092 are expressed via type classes again. The special syntax
  6093 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant
  6094 setsum_set, which is now subsumed by Big_Operators.setsum.
  6095 INCOMPATIBILITY.
  6096 
  6097 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
  6098 use theory HOL/Library/Nat_Bijection instead.
  6099 
  6100 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black
  6101 trees is now inside a type class context.  Names of affected
  6102 operations and lemmas have been prefixed by rbt_.  INCOMPATIBILITY for
  6103 theories working directly with raw red-black trees, adapt the names as
  6104 follows:
  6105 
  6106   Operations:
  6107   bulkload -> rbt_bulkload
  6108   del_from_left -> rbt_del_from_left
  6109   del_from_right -> rbt_del_from_right
  6110   del -> rbt_del
  6111   delete -> rbt_delete
  6112   ins -> rbt_ins
  6113   insert -> rbt_insert
  6114   insertw -> rbt_insert_with
  6115   insert_with_key -> rbt_insert_with_key
  6116   map_entry -> rbt_map_entry
  6117   lookup -> rbt_lookup
  6118   sorted -> rbt_sorted
  6119   tree_greater -> rbt_greater
  6120   tree_less -> rbt_less
  6121   tree_less_symbol -> rbt_less_symbol
  6122   union -> rbt_union
  6123   union_with -> rbt_union_with
  6124   union_with_key -> rbt_union_with_key
  6125 
  6126   Lemmas:
  6127   balance_left_sorted -> balance_left_rbt_sorted
  6128   balance_left_tree_greater -> balance_left_rbt_greater
  6129   balance_left_tree_less -> balance_left_rbt_less
  6130   balance_right_sorted -> balance_right_rbt_sorted
  6131   balance_right_tree_greater -> balance_right_rbt_greater
  6132   balance_right_tree_less -> balance_right_rbt_less
  6133   balance_sorted -> balance_rbt_sorted
  6134   balance_tree_greater -> balance_rbt_greater
  6135   balance_tree_less -> balance_rbt_less
  6136   bulkload_is_rbt -> rbt_bulkload_is_rbt
  6137   combine_sorted -> combine_rbt_sorted
  6138   combine_tree_greater -> combine_rbt_greater
  6139   combine_tree_less -> combine_rbt_less
  6140   delete_in_tree -> rbt_delete_in_tree
  6141   delete_is_rbt -> rbt_delete_is_rbt
  6142   del_from_left_tree_greater -> rbt_del_from_left_rbt_greater
  6143   del_from_left_tree_less -> rbt_del_from_left_rbt_less
  6144   del_from_right_tree_greater -> rbt_del_from_right_rbt_greater
  6145   del_from_right_tree_less -> rbt_del_from_right_rbt_less
  6146   del_in_tree -> rbt_del_in_tree
  6147   del_inv1_inv2 -> rbt_del_inv1_inv2
  6148   del_sorted -> rbt_del_rbt_sorted
  6149   del_tree_greater -> rbt_del_rbt_greater
  6150   del_tree_less -> rbt_del_rbt_less
  6151   dom_lookup_Branch -> dom_rbt_lookup_Branch
  6152   entries_lookup -> entries_rbt_lookup
  6153   finite_dom_lookup -> finite_dom_rbt_lookup
  6154   insert_sorted -> rbt_insert_rbt_sorted
  6155   insertw_is_rbt -> rbt_insertw_is_rbt
  6156   insertwk_is_rbt -> rbt_insertwk_is_rbt
  6157   insertwk_sorted -> rbt_insertwk_rbt_sorted
  6158   insertw_sorted -> rbt_insertw_rbt_sorted
  6159   ins_sorted -> ins_rbt_sorted
  6160   ins_tree_greater -> ins_rbt_greater
  6161   ins_tree_less -> ins_rbt_less
  6162   is_rbt_sorted -> is_rbt_rbt_sorted
  6163   lookup_balance -> rbt_lookup_balance
  6164   lookup_bulkload -> rbt_lookup_rbt_bulkload
  6165   lookup_delete -> rbt_lookup_rbt_delete
  6166   lookup_Empty -> rbt_lookup_Empty
  6167   lookup_from_in_tree -> rbt_lookup_from_in_tree
  6168   lookup_in_tree -> rbt_lookup_in_tree
  6169   lookup_ins -> rbt_lookup_ins
  6170   lookup_insert -> rbt_lookup_rbt_insert
  6171   lookup_insertw -> rbt_lookup_rbt_insertw
  6172   lookup_insertwk -> rbt_lookup_rbt_insertwk
  6173   lookup_keys -> rbt_lookup_keys
  6174   lookup_map -> rbt_lookup_map
  6175   lookup_map_entry -> rbt_lookup_rbt_map_entry
  6176   lookup_tree_greater -> rbt_lookup_rbt_greater
  6177   lookup_tree_less -> rbt_lookup_rbt_less
  6178   lookup_union -> rbt_lookup_rbt_union
  6179   map_entry_color_of -> rbt_map_entry_color_of
  6180   map_entry_inv1 -> rbt_map_entry_inv1
  6181   map_entry_inv2 -> rbt_map_entry_inv2
  6182   map_entry_is_rbt -> rbt_map_entry_is_rbt
  6183   map_entry_sorted -> rbt_map_entry_rbt_sorted
  6184   map_entry_tree_greater -> rbt_map_entry_rbt_greater
  6185   map_entry_tree_less -> rbt_map_entry_rbt_less
  6186   map_tree_greater -> map_rbt_greater
  6187   map_tree_less -> map_rbt_less
  6188   map_sorted -> map_rbt_sorted
  6189   paint_sorted -> paint_rbt_sorted
  6190   paint_lookup -> paint_rbt_lookup
  6191   paint_tree_greater -> paint_rbt_greater
  6192   paint_tree_less -> paint_rbt_less
  6193   sorted_entries -> rbt_sorted_entries
  6194   tree_greater_eq_trans -> rbt_greater_eq_trans
  6195   tree_greater_nit -> rbt_greater_nit
  6196   tree_greater_prop -> rbt_greater_prop
  6197   tree_greater_simps -> rbt_greater_simps
  6198   tree_greater_trans -> rbt_greater_trans
  6199   tree_less_eq_trans -> rbt_less_eq_trans
  6200   tree_less_nit -> rbt_less_nit
  6201   tree_less_prop -> rbt_less_prop
  6202   tree_less_simps -> rbt_less_simps
  6203   tree_less_trans -> rbt_less_trans
  6204   tree_ord_props -> rbt_ord_props
  6205   union_Branch -> rbt_union_Branch
  6206   union_is_rbt -> rbt_union_is_rbt
  6207   unionw_is_rbt -> rbt_unionw_is_rbt
  6208   unionwk_is_rbt -> rbt_unionwk_is_rbt
  6209   unionwk_sorted -> rbt_unionwk_rbt_sorted
  6210 
  6211 * Theory HOL/Library/Float: Floating point numbers are now defined as
  6212 a subset of the real numbers.  All operations are defined using the
  6213 lifing-framework and proofs use the transfer method.  INCOMPATIBILITY.
  6214 
  6215   Changed Operations:
  6216   float_abs -> abs
  6217   float_nprt -> nprt
  6218   float_pprt -> pprt
  6219   pow2 -> use powr
  6220   round_down -> float_round_down
  6221   round_up -> float_round_up
  6222   scale -> exponent
  6223 
  6224   Removed Operations:
  6225   ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod
  6226 
  6227   Renamed Lemmas:
  6228   abs_float_def -> Float.compute_float_abs
  6229   bitlen_ge0 -> bitlen_nonneg
  6230   bitlen.simps -> Float.compute_bitlen
  6231   float_components -> Float_mantissa_exponent
  6232   float_divl.simps -> Float.compute_float_divl
  6233   float_divr.simps -> Float.compute_float_divr
  6234   float_eq_odd -> mult_powr_eq_mult_powr_iff
  6235   float_power -> real_of_float_power
  6236   lapprox_posrat_def -> Float.compute_lapprox_posrat
  6237   lapprox_rat.simps -> Float.compute_lapprox_rat
  6238   le_float_def' -> Float.compute_float_le
  6239   le_float_def -> less_eq_float.rep_eq
  6240   less_float_def' -> Float.compute_float_less
  6241   less_float_def -> less_float.rep_eq
  6242   normfloat_def -> Float.compute_normfloat
  6243   normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0
  6244   normfloat -> normfloat_def
  6245   normfloat_unique -> use normfloat_def
  6246   number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral
  6247   one_float_def -> Float.compute_float_one
  6248   plus_float_def -> Float.compute_float_plus
  6249   rapprox_posrat_def -> Float.compute_rapprox_posrat
  6250   rapprox_rat.simps -> Float.compute_rapprox_rat
  6251   real_of_float_0 -> zero_float.rep_eq
  6252   real_of_float_1 -> one_float.rep_eq
  6253   real_of_float_abs -> abs_float.rep_eq
  6254   real_of_float_add -> plus_float.rep_eq
  6255   real_of_float_minus -> uminus_float.rep_eq
  6256   real_of_float_mult -> times_float.rep_eq
  6257   real_of_float_simp -> Float.rep_eq
  6258   real_of_float_sub -> minus_float.rep_eq
  6259   round_down.simps -> Float.compute_float_round_down
  6260   round_up.simps -> Float.compute_float_round_up
  6261   times_float_def -> Float.compute_float_times
  6262   uminus_float_def -> Float.compute_float_uminus
  6263   zero_float_def -> Float.compute_float_zero
  6264 
  6265   Lemmas not necessary anymore, use the transfer method:
  6266   bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,
  6267   float_divr, float_le_simp, float_less1_mantissa_bound,
  6268   float_less_simp, float_less_zero, float_le_zero,
  6269   float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,
  6270   floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,
  6271   lapprox_rat_bottom, normalized_float, rapprox_posrat,
  6272   rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,
  6273   real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,
  6274   round_up, zero_le_float, zero_less_float