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