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