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