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