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