NEWS
author wenzelm
Sat Nov 03 20:30:10 2018 +0100 (12 months ago ago)
changeset 69235 07fc77bf5eb6
parent 69221 1a52baa70aed
child 69273 c1a27fce2076
permissions -rw-r--r--
NEWS;
wenzelm@57491
     1
Isabelle NEWS -- history of user-relevant changes
wenzelm@57491
     2
=================================================
wenzelm@2553
     3
wenzelm@62114
     4
(Note: Isabelle/jEdit shows a tree-view of the NEWS file in Sidekick.)
wenzelm@60007
     5
wenzelm@64603
     6
wenzelm@68683
     7
New in this Isabelle version
wenzelm@68683
     8
----------------------------
wenzelm@68683
     9
wenzelm@69042
    10
*** General ***
wenzelm@69042
    11
wenzelm@69042
    12
* Old-style inner comments (* ... *) within the term language are no
wenzelm@69042
    13
longer supported (legacy feature in Isabelle2018).
wenzelm@69042
    14
nipkow@69066
    15
* Infix operators that begin or end with a "*" can now be paranthesized
nipkow@69066
    16
without additional spaces, eg "(*)" instead of "( * )".
nipkow@69066
    17
wenzelm@69221
    18
* ML setup commands (e.g. 'setup', 'method_setup', 'parse_translation')
wenzelm@69221
    19
need to provide a closed expression -- without trailing semicolon. Minor
wenzelm@69221
    20
INCOMPATIBILITY.
wenzelm@69221
    21
wenzelm@69042
    22
wenzelm@69190
    23
*** Isabelle/jEdit Prover IDE ***
wenzelm@69190
    24
wenzelm@69190
    25
* Improved sub-pixel font rendering (especially on Linux), thanks to
wenzelm@69190
    26
OpenJDK 11.
wenzelm@69190
    27
wenzelm@69190
    28
wenzelm@68879
    29
*** Isar ***
wenzelm@68879
    30
wenzelm@68879
    31
* More robust treatment of structural errors: begin/end blocks take
wenzelm@68879
    32
precedence over goal/proof.
wenzelm@68879
    33
wenzelm@69045
    34
* Implicit cases goal1, goal2, goal3, etc. have been discontinued
wenzelm@69045
    35
(legacy feature since Isabelle2016).
wenzelm@69045
    36
wenzelm@69045
    37
haftmann@68796
    38
*** HOL ***
haftmann@68796
    39
haftmann@68796
    40
* Simplified syntax setup for big operators under image. In rare
haftmann@68796
    41
situations, type conversions are not inserted implicitly any longer
haftmann@68796
    42
and need to be given explicitly. Auxiliary abbreviations INFIMUM,
haftmann@68796
    43
SUPREMUM, UNION, INTER should now rarely occur in output and are just
haftmann@68796
    44
retained as migration auxiliary. INCOMPATIBILITY.
haftmann@68796
    45
nipkow@69095
    46
* Theory List: the precedence of the list_update operator has changed:
nipkow@69095
    47
"f a [n := x]" now needs to be written "(f a)[n := x]".
nipkow@69095
    48
nipkow@69095
    49
* Theory "HOL-Library.Multiset": the <Union># operator now has the same
nipkow@69095
    50
precedence as any other prefix function symbol.
blanchet@68848
    51
haftmann@68938
    52
* Facts sum_mset.commute and prod_mset.commute renamed to sum_mset.swap
haftmann@68938
    53
and prod_mset.swap, similarly to sum.swap and prod.swap.
haftmann@68938
    54
INCOMPATIBILITY.
haftmann@68938
    55
nipkow@69164
    56
* Strong congruence rules (with =simp=> in the premises) for constant f
nipkow@69164
    57
are now uniformly called f_cong_strong. 
nipkow@69164
    58
nipkow@69095
    59
* Sledgehammer: The URL for SystemOnTPTP, which is used by remote
nipkow@69095
    60
provers, has been updated.
nipkow@69037
    61
Mathias@69210
    62
* SMT: reconstruction is now possible using the SMT solver veriT.
Mathias@69210
    63
wenzelm@69099
    64
* Session HOL-SPARK: .prv files are no longer written to the
wenzelm@69099
    65
file-system, but exported to the session database. Results may be
wenzelm@69099
    66
retrieved with the "isabelle export" command-line tool like this:
wenzelm@69099
    67
wenzelm@69099
    68
  isabelle export -x "*:**.prv" HOL-SPARK-Examples
wenzelm@69099
    69
haftmann@68796
    70
wenzelm@68804
    71
*** ML ***
wenzelm@68804
    72
wenzelm@68804
    73
* Original PolyML.pointerEq is retained as a convenience for tools that
wenzelm@68804
    74
don't use Isabelle/ML (where this is called "pointer_eq").
wenzelm@68804
    75
wenzelm@68824
    76
* ML evaluation (notably via commands 'ML' and 'ML_file') is subject to
wenzelm@68824
    77
option ML_environment to select a named environment, such as "Isabelle"
wenzelm@68824
    78
for Isabelle/ML, or "SML" for official Standard ML. It is also possible
wenzelm@68824
    79
to move toplevel bindings between environments, using a notation with
wenzelm@68824
    80
">" as separator. For example:
wenzelm@68824
    81
wenzelm@68824
    82
  declare [[ML_environment = "Isabelle>SML"]]
wenzelm@68824
    83
  ML \<open>val println = writeln\<close>
wenzelm@68824
    84
wenzelm@68824
    85
  declare [[ML_environment = "SML"]]
wenzelm@68824
    86
  ML \<open>println "test"\<close>
wenzelm@68824
    87
wenzelm@68824
    88
  declare [[ML_environment = "Isabelle"]]
wenzelm@68824
    89
  ML \<open>println\<close>  \<comment> \<open>not present\<close>
wenzelm@68824
    90
wenzelm@68824
    91
The Isabelle/ML function ML_Env.setup defines new ML environments. This
wenzelm@68824
    92
is useful to incorporate big SML projects in an isolated name space, and
wenzelm@68824
    93
potentially with variations on ML syntax (existing ML_Env.SML_operations
wenzelm@68824
    94
observes the official standard).
wenzelm@68804
    95
wenzelm@69216
    96
* GHC.read_source reads Haskell source text with antiquotations (only
wenzelm@69216
    97
the control-cartouche form). The default "cartouche" antiquotation
wenzelm@69216
    98
evaluates an ML expression of type string and inlines the result as
wenzelm@69216
    99
Haskell string literal. This allows to refer to Isabelle items robustly,
wenzelm@69216
   100
e.g. via Isabelle/ML antiquotations or library operations. For example:
wenzelm@69216
   101
wenzelm@69217
   102
ML_command \<open>
wenzelm@69216
   103
  GHC.read_source \<^context> \<open>
wenzelm@69216
   104
    allConst, impConst, eqConst :: String
wenzelm@69216
   105
    allConst = \<open>\<^const_name>\<open>Pure.all\<close>\<close>
wenzelm@69216
   106
    impConst = \<open>\<^const_name>\<open>Pure.imp\<close>\<close>
wenzelm@69216
   107
    eqConst = \<open>\<^const_name>\<open>Pure.eq\<close>\<close>
wenzelm@69216
   108
  \<close>
wenzelm@69217
   109
  |> writeln
wenzelm@69216
   110
\<close>
wenzelm@69216
   111
wenzelm@68804
   112
wenzelm@68883
   113
*** System ***
wenzelm@68883
   114
wenzelm@69235
   115
* Session directory $ISABELLE_HOME/src/Tools/Haskell provides some
wenzelm@69235
   116
source modules for Isabelle tools implemented in Haskell, notably for
wenzelm@69235
   117
Isabelle/PIDE.
wenzelm@69235
   118
wenzelm@69044
   119
* Isabelle server command "use_theories" supports "nodes_status_delay"
wenzelm@69044
   120
for continuous output of node status information. The time interval is
wenzelm@69044
   121
specified in seconds; a negative value means it is disabled (default).
wenzelm@69044
   122
wenzelm@69044
   123
* Isabelle Server command "use_theories" terminates more robustly in the
wenzelm@68883
   124
presence of structurally broken sources: full consolidation of theories
wenzelm@68883
   125
is no longer required.
wenzelm@68883
   126
wenzelm@69135
   127
* Support for OCaml via command-line tools "isabelle ocaml_setup",
wenzelm@69135
   128
"isabelle ocaml", "isabelle ocamlc", "isabelle ocaml_opam". Existing
wenzelm@69135
   129
settings variables ISABELLE_OCAML and ISABELLE_OCAMLC are maintained
wenzelm@69155
   130
dynamically according the state of ISABELLE_OPAM_ROOT and
wenzelm@69135
   131
ISABELLE_OCAML_VERSION.
wenzelm@69135
   132
wenzelm@69151
   133
* Support for Glasgow Haskell Compiler via command-line tools "isabelle
wenzelm@69151
   134
ghc_setup", "isabelle ghci", "isabelle ghc", "isabelle ghc_stack".
wenzelm@69151
   135
Existing settings variable ISABELLE_GHC is maintained dynamically
wenzelm@69190
   136
according to the state of ISABELLE_STACK_ROOT and
wenzelm@69190
   137
ISABELLE_STACK_RESOLVER.
wenzelm@69190
   138
wenzelm@69190
   139
* Update to Java 11: the latest long-term support version of OpenJDK.
wenzelm@69151
   140
wenzelm@68883
   141
wenzelm@68883
   142
wenzelm@68392
   143
New in Isabelle2018 (August 2018)
wenzelm@68392
   144
---------------------------------
wenzelm@66653
   145
wenzelm@66712
   146
*** General ***
wenzelm@66712
   147
wenzelm@68394
   148
* Session-qualified theory names are mandatory: it is no longer possible
wenzelm@68394
   149
to refer to unqualified theories from the parent session.
wenzelm@68394
   150
INCOMPATIBILITY for old developments that have not been updated to
wenzelm@68394
   151
Isabelle2017 yet (using the "isabelle imports" tool).
wenzelm@68394
   152
wenzelm@68394
   153
* Only the most fundamental theory names are global, usually the entry
wenzelm@68394
   154
points to major logic sessions: Pure, Main, Complex_Main, HOLCF, IFOL,
wenzelm@68394
   155
FOL, ZF, ZFC etc. INCOMPATIBILITY, need to use qualified names for
wenzelm@68394
   156
formerly global "HOL-Probability.Probability" and "HOL-SPARK.SPARK".
wenzelm@68394
   157
wenzelm@68559
   158
* Global facts need to be closed: no free variables and no hypotheses.
wenzelm@68559
   159
Rare INCOMPATIBILITY.
wenzelm@68540
   160
wenzelm@68665
   161
* Facts stemming from locale interpretation are subject to lazy
wenzelm@68665
   162
evaluation for improved performance. Rare INCOMPATIBILITY: errors
wenzelm@68665
   163
stemming from interpretation morphisms might be deferred and thus
wenzelm@68665
   164
difficult to locate; enable system option "strict_facts" temporarily to
wenzelm@68665
   165
avoid this.
wenzelm@68665
   166
wenzelm@67446
   167
* Marginal comments need to be written exclusively in the new-style form
wenzelm@67446
   168
"\<comment> \<open>text\<close>", old ASCII variants like "-- {* ... *}" are no longer
wenzelm@67446
   169
supported. INCOMPATIBILITY, use the command-line tool "isabelle
wenzelm@67446
   170
update_comments" to update existing theory files.
wenzelm@67446
   171
wenzelm@67507
   172
* Old-style inner comments (* ... *) within the term language are legacy
wenzelm@67507
   173
and will be discontinued soon: use formal comments "\<comment> \<open>...\<close>" or "\<^cancel>\<open>...\<close>"
wenzelm@67507
   174
instead.
wenzelm@67507
   175
nipkow@67402
   176
* The "op <infix-op>" syntax for infix operators has been replaced by
nipkow@67400
   177
"(<infix-op>)". If <infix-op> begins or ends with a "*", there needs to
nipkow@67400
   178
be a space between the "*" and the corresponding parenthesis.
wenzelm@68543
   179
INCOMPATIBILITY, use the command-line tool "isabelle update_op" to
wenzelm@68543
   180
convert theory and ML files to the new syntax. Because it is based on
wenzelm@68543
   181
regular expression matching, the result may need a bit of manual
wenzelm@68543
   182
postprocessing. Invoking "isabelle update_op" converts all files in the
wenzelm@68543
   183
current directory (recursively). In case you want to exclude conversion
wenzelm@68543
   184
of ML files (because the tool frequently also converts ML's "op"
wenzelm@68543
   185
syntax), use option "-m".
nipkow@67398
   186
wenzelm@67013
   187
* Theory header 'abbrevs' specifications need to be separated by 'and'.
wenzelm@67013
   188
INCOMPATIBILITY.
wenzelm@67013
   189
wenzelm@66757
   190
* Command 'external_file' declares the formal dependency on the given
wenzelm@66757
   191
file name, such that the Isabelle build process knows about it, but
wenzelm@66757
   192
without specific Prover IDE management.
wenzelm@66757
   193
wenzelm@66759
   194
* Session ROOT entries no longer allow specification of 'files'. Rare
wenzelm@66759
   195
INCOMPATIBILITY, use command 'external_file' within a proper theory
wenzelm@66759
   196
context.
wenzelm@66759
   197
wenzelm@66764
   198
* Session root directories may be specified multiple times: each
wenzelm@66764
   199
accessible ROOT file is processed only once. This facilitates
wenzelm@66764
   200
specification of $ISABELLE_HOME_USER/ROOTS or command-line options like
wenzelm@66764
   201
-d or -D for "isabelle build" and "isabelle jedit". Example:
wenzelm@66764
   202
wenzelm@66764
   203
  isabelle build -D '~~/src/ZF'
wenzelm@66764
   204
wenzelm@67264
   205
* The command 'display_drafts' has been discontinued. INCOMPATIBILITY,
wenzelm@67264
   206
use action "isabelle.draft" (or "print") in Isabelle/jEdit instead.
wenzelm@67264
   207
wenzelm@68394
   208
* In HTML output, the Isabelle symbol "\<hyphen>" is rendered as explicit
wenzelm@68394
   209
Unicode hyphen U+2010, to avoid unclear meaning of the old "soft hyphen"
wenzelm@68394
   210
U+00AD. Rare INCOMPATIBILITY, e.g. copy-paste of historic Isabelle HTML
wenzelm@68394
   211
output.
wenzelm@67305
   212
wenzelm@66712
   213
wenzelm@67262
   214
*** Isabelle/jEdit Prover IDE ***
wenzelm@66768
   215
wenzelm@68394
   216
* The command-line tool "isabelle jedit" provides more flexible options
wenzelm@68394
   217
for session management:
wenzelm@68394
   218
wenzelm@68472
   219
  - option -R builds an auxiliary logic image with all theories from
wenzelm@68472
   220
    other sessions that are not already present in its parent
wenzelm@68394
   221
wenzelm@68394
   222
  - option -S is like -R, with a focus on the selected session and its
wenzelm@68394
   223
    descendants (this reduces startup time for big projects like AFP)
wenzelm@68394
   224
wenzelm@68472
   225
  - option -A specifies an alternative ancestor session for options -R
wenzelm@68472
   226
    and -S
wenzelm@68472
   227
wenzelm@68541
   228
  - option -i includes additional sessions into the name-space of
wenzelm@68541
   229
    theories
wenzelm@68541
   230
wenzelm@68394
   231
  Examples:
wenzelm@68394
   232
    isabelle jedit -R HOL-Number_Theory
wenzelm@68394
   233
    isabelle jedit -R HOL-Number_Theory -A HOL
wenzelm@68394
   234
    isabelle jedit -d '$AFP' -S Formal_SSA -A HOL
wenzelm@68394
   235
    isabelle jedit -d '$AFP' -S Formal_SSA -A HOL-Analysis
wenzelm@68541
   236
    isabelle jedit -d '$AFP' -S Formal_SSA -A HOL-Analysis -i CryptHOL
wenzelm@68394
   237
wenzelm@68394
   238
* PIDE markup for session ROOT files: allows to complete session names,
wenzelm@68394
   239
follow links to theories and document files etc.
wenzelm@68394
   240
wenzelm@68394
   241
* Completion supports theory header imports, using theory base name.
wenzelm@68394
   242
E.g. "Prob" may be completed to "HOL-Probability.Probability".
wenzelm@68394
   243
wenzelm@68394
   244
* Named control symbols (without special Unicode rendering) are shown as
wenzelm@68394
   245
bold-italic keyword. This is particularly useful for the short form of
wenzelm@68394
   246
antiquotations with control symbol: \<^name>\<open>argument\<close>. The action
wenzelm@68394
   247
"isabelle.antiquoted_cartouche" turns an antiquotation with 0 or 1
wenzelm@68394
   248
arguments into this format.
wenzelm@68394
   249
wenzelm@68394
   250
* Completion provides templates for named symbols with arguments,
wenzelm@68394
   251
e.g. "\<comment> \<open>ARGUMENT\<close>" or "\<^emph>\<open>ARGUMENT\<close>".
wenzelm@68394
   252
wenzelm@68369
   253
* Slightly more parallel checking, notably for high priority print
wenzelm@68369
   254
functions (e.g. State output).
wenzelm@68369
   255
wenzelm@68080
   256
* The view title is set dynamically, according to the Isabelle
wenzelm@68080
   257
distribution and the logic session name. The user can override this via
wenzelm@68080
   258
set-view-title (stored persistently in $JEDIT_SETTINGS/perspective.xml).
wenzelm@68080
   259
wenzelm@67395
   260
* System options "spell_checker_include" and "spell_checker_exclude"
wenzelm@67395
   261
supersede former "spell_checker_elements" to determine regions of text
wenzelm@67395
   262
that are subject to spell-checking. Minor INCOMPATIBILITY.
wenzelm@67395
   263
wenzelm@67248
   264
* Action "isabelle.preview" is able to present more file formats,
wenzelm@67267
   265
notably bibtex database files and ML files.
wenzelm@67246
   266
wenzelm@67263
   267
* Action "isabelle.draft" is similar to "isabelle.preview", but shows a
wenzelm@68068
   268
plain-text document draft. Both are available via the menu "Plugins /
wenzelm@68068
   269
Isabelle".
wenzelm@67263
   270
wenzelm@67304
   271
* When loading text files, the Isabelle symbols encoding UTF-8-Isabelle
wenzelm@67304
   272
is only used if there is no conflict with existing Unicode sequences in
wenzelm@67304
   273
the file. Otherwise, the fallback encoding is plain UTF-8 and Isabelle
wenzelm@67304
   274
symbols remain in literal \<symbol> form. This avoids accidental loss of
wenzelm@67304
   275
Unicode content when saving the file.
wenzelm@67304
   276
wenzelm@68545
   277
* Bibtex database files (.bib) are semantically checked.
wenzelm@68545
   278
wenzelm@67994
   279
* Update to jedit-5.5.0, the latest release.
wenzelm@67994
   280
wenzelm@67246
   281
wenzelm@67262
   282
*** Isabelle/VSCode Prover IDE ***
wenzelm@67262
   283
wenzelm@67262
   284
* HTML preview of theories and other file-formats similar to
wenzelm@67262
   285
Isabelle/jEdit.
wenzelm@67262
   286
wenzelm@68690
   287
* Command-line tool "isabelle vscode_server" accepts the same options
wenzelm@68690
   288
-A, -R, -S, -i for session selection as "isabelle jedit". This is
wenzelm@68690
   289
relevant for isabelle.args configuration settings in VSCode. The former
wenzelm@68690
   290
option -A (explore all known session files) has been discontinued: it is
wenzelm@68690
   291
enabled by default, unless option -S is used to focus on a particular
wenzelm@68690
   292
spot in the session structure. INCOMPATIBILITY.
wenzelm@68690
   293
wenzelm@66768
   294
wenzelm@67140
   295
*** Document preparation ***
wenzelm@67140
   296
wenzelm@67448
   297
* Formal comments work uniformly in outer syntax, inner syntax (term
wenzelm@67448
   298
language), Isabelle/ML and some other embedded languages of Isabelle.
wenzelm@67448
   299
See also "Document comments" in the isar-ref manual. The following forms
wenzelm@67448
   300
are supported:
wenzelm@67448
   301
wenzelm@67448
   302
  - marginal text comment: \<comment> \<open>\<dots>\<close>
wenzelm@67448
   303
  - canceled source: \<^cancel>\<open>\<dots>\<close>
wenzelm@67448
   304
  - raw LaTeX: \<^latex>\<open>\<dots>\<close>
wenzelm@67413
   305
wenzelm@67381
   306
* Outside of the inner theory body, the default presentation context is
wenzelm@67381
   307
theory Pure. Thus elementary antiquotations may be used in markup
wenzelm@67381
   308
commands (e.g. 'chapter', 'section', 'text') and formal comments.
wenzelm@67381
   309
wenzelm@68513
   310
* System option "document_tags" specifies alternative command tags. This
wenzelm@68513
   311
is occasionally useful to control the global visibility of commands via
wenzelm@68513
   312
session options (e.g. in ROOT).
wenzelm@67140
   313
wenzelm@67140
   314
* Document markup commands ('section', 'text' etc.) are implicitly
wenzelm@67140
   315
tagged as "document" and visible by default. This avoids the application
wenzelm@67140
   316
of option "document_tags" to these commands.
wenzelm@67140
   317
wenzelm@67145
   318
* Isabelle names are mangled into LaTeX macro names to allow the full
wenzelm@67145
   319
identifier syntax with underscore, prime, digits. This is relevant for
wenzelm@67145
   320
antiquotations in control symbol notation, e.g. \<^const_name> becomes
wenzelm@67145
   321
\isactrlconstUNDERSCOREname.
wenzelm@67145
   322
wenzelm@68394
   323
* Document preparation with skip_proofs option now preserves the content
wenzelm@68394
   324
more accurately: only terminal proof steps ('by' etc.) are skipped.
wenzelm@67297
   325
wenzelm@68484
   326
* Document antiquotation @{theory name} requires the long
wenzelm@68484
   327
session-qualified theory name: this is what users reading the text
wenzelm@68484
   328
normally need to import.
wenzelm@68484
   329
wenzelm@67219
   330
* Document antiquotation @{session name} checks and prints the given
wenzelm@67219
   331
session name verbatim.
wenzelm@67219
   332
wenzelm@68394
   333
* Document antiquotation @{cite} now checks the given Bibtex entries
wenzelm@68394
   334
against the Bibtex database files -- only in batch-mode session builds.
wenzelm@67157
   335
wenzelm@67176
   336
* Command-line tool "isabelle document" has been re-implemented in
wenzelm@67194
   337
Isabelle/Scala, with simplified arguments and explicit errors from the
wenzelm@67203
   338
latex and bibtex process. Minor INCOMPATIBILITY.
wenzelm@67173
   339
wenzelm@68394
   340
* Session ROOT entry: empty 'document_files' means there is no document
wenzelm@68394
   341
for this session. There is no need to specify options [document = false]
wenzelm@68394
   342
anymore.
wenzelm@68394
   343
wenzelm@67140
   344
wenzelm@67702
   345
*** Isar ***
wenzelm@67702
   346
wenzelm@67702
   347
* Command 'interpret' no longer exposes resulting theorems as literal
wenzelm@67702
   348
facts, notably for the \<open>prop\<close> notation or the "fact" proof method. This
wenzelm@67702
   349
improves modularity of proofs and scalability of locale interpretation.
wenzelm@67702
   350
Rare INCOMPATIBILITY, need to refer to explicitly named facts instead
wenzelm@67702
   351
(e.g. use 'find_theorems' or 'try' to figure this out).
wenzelm@67702
   352
wenzelm@68394
   353
* The old 'def' command has been discontinued (legacy since
wenzelm@68394
   354
Isbelle2016-1). INCOMPATIBILITY, use 'define' instead -- usually with
wenzelm@68394
   355
object-logic equality or equivalence.
wenzelm@68394
   356
wenzelm@68543
   357
wenzelm@68543
   358
*** Pure ***
wenzelm@68543
   359
wenzelm@68543
   360
* The inner syntax category "sort" now includes notation "_" for the
wenzelm@68543
   361
dummy sort: it is effectively ignored in type-inference.
wenzelm@68543
   362
ballarin@67740
   363
* Rewrites clauses (keyword 'rewrites') were moved into the locale
wenzelm@68394
   364
expression syntax, where they are part of locale instances. In
wenzelm@68394
   365
interpretation commands rewrites clauses now need to occur before 'for'
ballarin@68470
   366
and 'defines'. Rare INCOMPATIBILITY; definitions immediately subject to
ballarin@68470
   367
rewriting may need to be pulled up into the surrounding theory.
wenzelm@68394
   368
wenzelm@68394
   369
* For 'rewrites' clauses, if activating a locale instance fails, fall
wenzelm@68394
   370
back to reading the clause first. This helps avoid qualification of
ballarin@67764
   371
locale instances where the qualifier's sole purpose is avoiding
ballarin@67764
   372
duplicate constant declarations.
ballarin@67741
   373
wenzelm@68543
   374
* Proof method "simp" now supports a new modifier "flip:" followed by a
wenzelm@68543
   375
list of theorems. Each of these theorems is removed from the simpset
wenzelm@68543
   376
(without warning if it is not there) and the symmetric version of the
wenzelm@68543
   377
theorem (i.e. lhs and rhs exchanged) is added to the simpset. For "auto"
wenzelm@68543
   378
and friends the modifier is "simp flip:".
wenzelm@67719
   379
wenzelm@67719
   380
blanchet@66663
   381
*** HOL ***
blanchet@66663
   382
wenzelm@68568
   383
* Sledgehammer: bundled version of "vampire" (for non-commercial users)
wenzelm@68568
   384
helps to avoid fragility of "remote_vampire" service.
wenzelm@68568
   385
haftmann@68028
   386
* Clarified relationship of characters, strings and code generation:
haftmann@68028
   387
wenzelm@68394
   388
  - Type "char" is now a proper datatype of 8-bit values.
wenzelm@68394
   389
wenzelm@68394
   390
  - Conversions "nat_of_char" and "char_of_nat" are gone; use more
wenzelm@68394
   391
    general conversions "of_char" and "char_of" with suitable type
wenzelm@68394
   392
    constraints instead.
wenzelm@68394
   393
wenzelm@68394
   394
  - The zero character is just written "CHR 0x00", not "0" any longer.
wenzelm@68394
   395
wenzelm@68394
   396
  - Type "String.literal" (for code generation) is now isomorphic to
wenzelm@68394
   397
    lists of 7-bit (ASCII) values; concrete values can be written as
wenzelm@68394
   398
    "STR ''...''" for sequences of printable characters and "STR 0x..."
wenzelm@68394
   399
    for one single ASCII code point given as hexadecimal numeral.
wenzelm@68394
   400
wenzelm@68394
   401
  - Type "String.literal" supports concatenation "... + ..." for all
wenzelm@68394
   402
    standard target languages.
wenzelm@68394
   403
wenzelm@68394
   404
  - Theory HOL-Library.Code_Char is gone; study the explanations
wenzelm@68394
   405
    concerning "String.literal" in the tutorial on code generation to
wenzelm@68394
   406
    get an idea how target-language string literals can be converted to
wenzelm@68394
   407
    HOL string values and vice versa.
wenzelm@68394
   408
wenzelm@68394
   409
  - Session Imperative-HOL: operation "raise" directly takes a value of
wenzelm@68394
   410
    type "String.literal" as argument, not type "string".
wenzelm@68394
   411
wenzelm@68394
   412
INCOMPATIBILITY.
wenzelm@68394
   413
wenzelm@68394
   414
* Code generation: Code generation takes an explicit option
wenzelm@68394
   415
"case_insensitive" to accomodate case-insensitive file systems.
wenzelm@68394
   416
wenzelm@68394
   417
* Abstract bit operations as part of Main: push_bit, take_bit, drop_bit.
wenzelm@68394
   418
wenzelm@68394
   419
* New, more general, axiomatization of complete_distrib_lattice. The
wenzelm@68394
   420
former axioms:
wenzelm@68394
   421
wenzelm@68394
   422
  "sup x (Inf X) = Inf (sup x ` X)" and "inf x (Sup X) = Sup (inf x ` X)"
wenzelm@68394
   423
wenzelm@68394
   424
are replaced by:
wenzelm@68394
   425
wenzelm@68394
   426
  "Inf (Sup ` A) <= Sup (Inf ` {f ` A | f . (! Y \<in> A . f Y \<in> Y)})"
wenzelm@68394
   427
wenzelm@68394
   428
The instantiations of sets and functions as complete_distrib_lattice are
wenzelm@68394
   429
moved to Hilbert_Choice.thy because their proofs need the Hilbert choice
wenzelm@68394
   430
operator. The dual of this property is also proved in theory
wenzelm@68394
   431
HOL.Hilbert_Choice.
eberlm@67831
   432
lp15@67999
   433
* New syntax for the minimum/maximum of a function over a finite set:
wenzelm@68394
   434
MIN x\<in>A. B and even MIN x. B (only useful for finite types), also MAX.
lp15@67999
   435
haftmann@67525
   436
* Clarifed theorem names:
haftmann@67525
   437
haftmann@67525
   438
  Min.antimono ~> Min.subset_imp
haftmann@67525
   439
  Max.antimono ~> Max.subset_imp
haftmann@67525
   440
haftmann@67525
   441
Minor INCOMPATIBILITY.
haftmann@67525
   442
blanchet@66663
   443
* SMT module:
wenzelm@68394
   444
blanchet@66663
   445
  - The 'smt_oracle' option is now necessary when using the 'smt' method
blanchet@66664
   446
    with a solver other than Z3. INCOMPATIBILITY.
wenzelm@68394
   447
wenzelm@66844
   448
  - The encoding to first-order logic is now more complete in the
wenzelm@66844
   449
    presence of higher-order quantifiers. An 'smt_explicit_application'
wenzelm@66844
   450
    option has been added to control this. INCOMPATIBILITY.
wenzelm@66844
   451
haftmann@66804
   452
* Facts sum.commute(_restrict) and prod.commute(_restrict) renamed to
wenzelm@66844
   453
sum.swap(_restrict) and prod.swap(_restrict), to avoid name clashes on
wenzelm@66844
   454
interpretation of abstract locales. INCOMPATIBILITY.
haftmann@66804
   455
wenzelm@68394
   456
* Predicate coprime is now a real definition, not a mere abbreviation.
wenzelm@68394
   457
INCOMPATIBILITY.
wenzelm@68394
   458
haftmann@66803
   459
* Predicate pairwise_coprime abolished, use "pairwise coprime" instead.
haftmann@66803
   460
INCOMPATIBILITY.
haftmann@66803
   461
lp15@68373
   462
* The relator rel_filter on filters has been strengthened to its
wenzelm@68394
   463
canonical categorical definition with better properties.
wenzelm@68394
   464
INCOMPATIBILITY.
Andreas@67615
   465
immler@68071
   466
* Generalized linear algebra involving linear, span, dependent, dim
immler@68071
   467
from type class real_vector to locales module and vector_space.
immler@68071
   468
Renamed:
wenzelm@68394
   469
wenzelm@68394
   470
  span_inc ~> span_superset
wenzelm@68394
   471
  span_superset ~> span_base
wenzelm@68394
   472
  span_eq ~> span_eq_iff
wenzelm@68394
   473
wenzelm@68394
   474
INCOMPATIBILITY.
wenzelm@66844
   475
haftmann@66937
   476
* Class linordered_semiring_1 covers zero_less_one also, ruling out
haftmann@66937
   477
pathologic instances. Minor INCOMPATIBILITY.
haftmann@66937
   478
wenzelm@68394
   479
* Theory HOL.List: functions "sorted_wrt" and "sorted" now compare every
wenzelm@68394
   480
element in a list to all following elements, not just the next one.
wenzelm@68394
   481
wenzelm@68394
   482
* Theory HOL.List syntax:
wenzelm@68394
   483
wenzelm@68394
   484
  - filter-syntax "[x <- xs. P]" is no longer output syntax, but only
wenzelm@68394
   485
    input syntax
wenzelm@68394
   486
wenzelm@68394
   487
  - list comprehension syntax now supports tuple patterns in "pat <- xs"
nipkow@68250
   488
nipkow@68450
   489
* Theory Map: "empty" must now be qualified as "Map.empty".
nipkow@68450
   490
haftmann@67051
   491
* Removed nat-int transfer machinery. Rare INCOMPATIBILITY.
haftmann@67051
   492
haftmann@68103
   493
* Fact mod_mult_self4 (on nat) renamed to Suc_mod_mult_self3, to avoid
haftmann@68103
   494
clash with fact mod_mult_self4 (on more generic semirings).
haftmann@68103
   495
INCOMPATIBILITY.
haftmann@68103
   496
haftmann@68103
   497
* Eliminated some theorem aliasses:
haftmann@68103
   498
  even_times_iff ~> even_mult_iff
haftmann@68103
   499
  mod_2_not_eq_zero_eq_one_nat ~> not_mod_2_eq_0_eq_1
haftmann@68103
   500
  even_of_nat ~> even_int_iff
haftmann@68103
   501
haftmann@68103
   502
INCOMPATIBILITY.
haftmann@68103
   503
haftmann@68157
   504
* Eliminated some theorem duplicate variations:
wenzelm@68394
   505
wenzelm@68394
   506
  - dvd_eq_mod_eq_0_numeral can be replaced by dvd_eq_mod_eq_0
wenzelm@68394
   507
  - mod_Suc_eq_Suc_mod can be replaced by mod_Suc
wenzelm@68394
   508
  - mod_Suc_eq_Suc_mod [symmetrict] can be replaced by mod_simps
wenzelm@68394
   509
  - mod_eq_0_iff can be replaced by mod_eq_0_iff_dvd and dvd_def
wenzelm@68394
   510
  - the witness of mod_eqD can be given directly as "_ div _"
haftmann@68157
   511
haftmann@68157
   512
INCOMPATIBILITY.
haftmann@68157
   513
haftmann@68260
   514
* Classical setup: Assumption "m mod d = 0" (for m d :: nat) is no
wenzelm@68394
   515
longer aggresively destroyed to "\<exists>q. m = d * q". INCOMPATIBILITY, adding
wenzelm@68394
   516
"elim!: dvd" to classical proof methods in most situations restores
wenzelm@68394
   517
broken proofs.
wenzelm@68394
   518
wenzelm@68394
   519
* Theory HOL-Library.Conditional_Parametricity provides command
wenzelm@68394
   520
'parametric_constant' for proving parametricity of non-recursive
wenzelm@68394
   521
definitions. For constants that are not fully parametric the command
wenzelm@68394
   522
will infer conditions on relations (e.g., bi_unique, bi_total, or type
wenzelm@68394
   523
class conditions such as "respects 0") sufficient for parametricity. See
wenzelm@68394
   524
theory HOL-ex.Conditional_Parametricity_Examples for some examples.
wenzelm@68394
   525
wenzelm@68394
   526
* Theory HOL-Library.Code_Lazy provides a new preprocessor for the code
wenzelm@68394
   527
generator to generate code for algebraic types with lazy evaluation
Andreas@68639
   528
semantics even in call-by-value target languages. See the theories
wenzelm@68647
   529
HOL-ex.Code_Lazy_Demo and HOL-Codegenerator_Test.Code_Lazy_Test for some
wenzelm@68647
   530
examples.
wenzelm@68394
   531
wenzelm@68394
   532
* Theory HOL-Library.Landau_Symbols has been moved here from AFP.
wenzelm@68394
   533
wenzelm@68394
   534
* Theory HOL-Library.Old_Datatype no longer provides the legacy command
wenzelm@68394
   535
'old_datatype'. INCOMPATIBILITY.
wenzelm@68394
   536
wenzelm@68394
   537
* Theory HOL-Computational_Algebra.Polynomial_Factorial does not provide
wenzelm@68394
   538
instances of rat, real, complex as factorial rings etc. Import
wenzelm@68394
   539
HOL-Computational_Algebra.Field_as_Ring explicitly in case of need.
wenzelm@68394
   540
INCOMPATIBILITY.
wenzelm@68394
   541
wenzelm@68394
   542
* Session HOL-Algebra: renamed (^) to [^] to avoid conflict with new
wenzelm@68394
   543
infix/prefix notation.
wenzelm@68394
   544
wenzelm@68543
   545
* Session HOL-Algebra: revamped with much new material. The set of
wenzelm@68543
   546
isomorphisms between two groups is now denoted iso rather than iso_set.
wenzelm@68543
   547
INCOMPATIBILITY.
wenzelm@68543
   548
wenzelm@68543
   549
* Session HOL-Analysis: the Arg function now respects the same interval
wenzelm@68543
   550
as Ln, namely (-pi,pi]; the old Arg function has been renamed Arg2pi.
lp15@68495
   551
INCOMPATIBILITY.
lp15@68495
   552
wenzelm@68548
   553
* Session HOL-Analysis: the functions zorder, zer_poly, porder and
wenzelm@68548
   554
pol_poly have been redefined. All related lemmas have been reworked.
wl302@68532
   555
INCOMPATIBILITY.
wl302@68532
   556
wenzelm@68394
   557
* Session HOL-Analysis: infinite products, Moebius functions, the
wenzelm@68394
   558
Riemann mapping theorem, the Vitali covering theorem,
wenzelm@68394
   559
change-of-variables results for integration and measures.
haftmann@68260
   560
wenzelm@68647
   561
* Session HOL-Real_Asymp: proof method "real_asymp" proves asymptotics
wenzelm@68647
   562
or real-valued functions (limits, "Big-O", etc.) automatically.
wenzelm@68681
   563
See also ~~/src/HOL/Real_Asymp/Manual for some documentation.
wenzelm@68647
   564
wenzelm@68545
   565
* Session HOL-Types_To_Sets: more tool support (unoverload_type combines
wenzelm@68545
   566
internalize_sorts and unoverload) and larger experimental application
wenzelm@68545
   567
(type based linear algebra transferred to linear algebra on subspaces).
immler@68522
   568
wenzelm@66653
   569
wenzelm@68121
   570
*** ML ***
wenzelm@68121
   571
wenzelm@68121
   572
* Operation Export.export emits theory exports (arbitrary blobs), which
wenzelm@68121
   573
are stored persistently in the session build database.
wenzelm@68121
   574
wenzelm@68281
   575
* Command 'ML_export' exports ML toplevel bindings to the global
wenzelm@68281
   576
bootstrap environment of the ML process. This allows ML evaluation
wenzelm@68281
   577
without a formal theory context, e.g. in command-line tools like
wenzelm@68281
   578
"isabelle process".
wenzelm@68281
   579
wenzelm@68121
   580
wenzelm@66729
   581
*** System ***
wenzelm@66729
   582
wenzelm@67088
   583
* Mac OS X 10.10 Yosemite is now the baseline version; Mavericks is no
wenzelm@67088
   584
longer supported.
wenzelm@67088
   585
wenzelm@68394
   586
* Linux and Windows/Cygwin is for x86_64 only, old 32bit platform
wenzelm@68394
   587
support has been discontinued.
wenzelm@68394
   588
wenzelm@66906
   589
* Java runtime is for x86_64 only. Corresponding Isabelle settings have
wenzelm@66906
   590
been renamed to ISABELLE_TOOL_JAVA_OPTIONS and JEDIT_JAVA_OPTIONS,
wenzelm@66906
   591
instead of former 32/64 variants. INCOMPATIBILITY.
wenzelm@66906
   592
wenzelm@68004
   593
* Old settings ISABELLE_PLATFORM and ISABELLE_WINDOWS_PLATFORM should be
wenzelm@68004
   594
phased out due to unclear preference of 32bit vs. 64bit architecture.
wenzelm@68004
   595
Explicit GNU bash expressions are now preferred, for example (with
wenzelm@68004
   596
quotes):
wenzelm@68004
   597
wenzelm@68004
   598
  #Posix executables (Unix or Cygwin), with preference for 64bit
wenzelm@68004
   599
  "${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM32}"
wenzelm@68004
   600
wenzelm@68004
   601
  #native Windows or Unix executables, with preference for 64bit
wenzelm@68004
   602
  "${ISABELLE_WINDOWS_PLATFORM64:-${ISABELLE_WINDOWS_PLATFORM32:-${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM32}}}"
wenzelm@68004
   603
wenzelm@68004
   604
  #native Windows (32bit) or Unix executables (preference for 64bit)
wenzelm@68004
   605
  "${ISABELLE_WINDOWS_PLATFORM32:-${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM32}}"
wenzelm@68004
   606
wenzelm@66745
   607
* Command-line tool "isabelle build" supports new options:
wenzelm@66745
   608
  - option -B NAME: include session NAME and all descendants
wenzelm@66745
   609
  - option -S: only observe changes of sources, not heap images
wenzelm@66841
   610
  - option -f: forces a fresh build
wenzelm@66737
   611
wenzelm@68734
   612
* Command-line tool "isabelle build" options -c -x -B refer to
wenzelm@68734
   613
descendants wrt. the session parent or import graph. Subtle
wenzelm@68734
   614
INCOMPATIBILITY: options -c -x used to refer to the session parent graph
wenzelm@68734
   615
only.
wenzelm@68734
   616
wenzelm@66843
   617
* Command-line tool "isabelle build" takes "condition" options with the
wenzelm@66843
   618
corresponding environment values into account, when determining the
wenzelm@66843
   619
up-to-date status of a session.
wenzelm@66843
   620
wenzelm@68394
   621
* The command-line tool "dump" dumps information from the cumulative
wenzelm@68394
   622
PIDE session database: many sessions may be loaded into a given logic
wenzelm@68394
   623
image, results from all loaded theories are written to the output
wenzelm@68394
   624
directory.
wenzelm@68394
   625
wenzelm@66851
   626
* Command-line tool "isabelle imports -I" also reports actual session
wenzelm@66851
   627
imports. This helps to minimize the session dependency graph.
wenzelm@66851
   628
wenzelm@68394
   629
* The command-line tool "export" and 'export_files' in session ROOT
wenzelm@68394
   630
entries retrieve theory exports from the session build database.
wenzelm@68394
   631
wenzelm@68394
   632
* The command-line tools "isabelle server" and "isabelle client" provide
wenzelm@68394
   633
access to the Isabelle Server: it supports responsive session management
wenzelm@68394
   634
and concurrent use of theories, based on Isabelle/PIDE infrastructure.
wenzelm@68394
   635
See also the "system" manual.
wenzelm@68394
   636
wenzelm@68394
   637
* The command-line tool "isabelle update_comments" normalizes formal
wenzelm@68394
   638
comments in outer syntax as follows: \<comment> \<open>text\<close> (whith a single space to
wenzelm@68394
   639
approximate the appearance in document output). This is more specific
wenzelm@68394
   640
than former "isabelle update_cartouches -c": the latter tool option has
wenzelm@68394
   641
been discontinued.
wenzelm@68394
   642
wenzelm@68394
   643
* The command-line tool "isabelle mkroot" now always produces a document
wenzelm@68394
   644
outline: its options have been adapted accordingly. INCOMPATIBILITY.
wenzelm@68394
   645
wenzelm@68394
   646
* The command-line tool "isabelle mkroot -I" initializes a Mercurial
wenzelm@68394
   647
repository for the generated session files.
wenzelm@68394
   648
wenzelm@68523
   649
* Settings ISABELLE_HEAPS + ISABELLE_BROWSER_INFO (or
wenzelm@68523
   650
ISABELLE_HEAPS_SYSTEM + ISABELLE_BROWSER_INFO_SYSTEM in "system build
wenzelm@68523
   651
mode") determine the directory locations of the main build artefacts --
wenzelm@68523
   652
instead of hard-wired directories in ISABELLE_HOME_USER (or
wenzelm@68523
   653
ISABELLE_HOME).
wenzelm@68523
   654
wenzelm@68394
   655
* Settings ISABELLE_PATH and ISABELLE_OUTPUT have been discontinued:
wenzelm@68394
   656
heap images and session databases are always stored in
wenzelm@68523
   657
$ISABELLE_HEAPS/$ML_IDENTIFIER (command-line default) or
wenzelm@68523
   658
$ISABELLE_HEAPS_SYSTEM/$ML_IDENTIFIER (main Isabelle application or
wenzelm@68394
   659
"isabelle jedit -s" or "isabelle build -s").
wenzelm@67099
   660
wenzelm@67199
   661
* ISABELLE_LATEX and ISABELLE_PDFLATEX now include platform-specific
wenzelm@67199
   662
options for improved error reporting. Potential INCOMPATIBILITY with
wenzelm@67199
   663
unusual LaTeX installations, may have to adapt these settings.
wenzelm@67199
   664
wenzelm@68394
   665
* Update to Poly/ML 5.7.1 with slightly improved performance and PIDE
wenzelm@68394
   666
markup for identifier bindings. It now uses The GNU Multiple Precision
wenzelm@67591
   667
Arithmetic Library (libgmp) on all platforms, notably Mac OS X with
wenzelm@67591
   668
32/64 bit.
wenzelm@67591
   669
wenzelm@67099
   670
wenzelm@66729
   671
wenzelm@66472
   672
New in Isabelle2017 (October 2017)
wenzelm@66472
   673
----------------------------------
wenzelm@64439
   674
wenzelm@64986
   675
*** General ***
wenzelm@64986
   676
wenzelm@66238
   677
* Experimental support for Visual Studio Code (VSCode) as alternative
wenzelm@66238
   678
Isabelle/PIDE front-end, see also
wenzelm@66601
   679
https://marketplace.visualstudio.com/items?itemName=makarius.Isabelle2017
wenzelm@66238
   680
wenzelm@66238
   681
VSCode is a new type of application that continues the concepts of
wenzelm@66238
   682
"programmer's editor" and "integrated development environment" towards
wenzelm@66238
   683
fully semantic editing and debugging -- in a relatively light-weight
wenzelm@66238
   684
manner. Thus it fits nicely on top of the Isabelle/PIDE infrastructure.
wenzelm@66238
   685
Technically, VSCode is based on the Electron application framework
wenzelm@66238
   686
(Node.js + Chromium browser + V8), which is implemented in JavaScript
wenzelm@66238
   687
and TypeScript, while Isabelle/VSCode mainly consists of Isabelle/Scala
wenzelm@66238
   688
modules around a Language Server implementation.
wenzelm@66238
   689
wenzelm@65504
   690
* Theory names are qualified by the session name that they belong to.
wenzelm@66454
   691
This affects imports, but not the theory name space prefix (which is
wenzelm@66454
   692
just the theory base name as before).
wenzelm@66454
   693
wenzelm@66454
   694
In order to import theories from other sessions, the ROOT file format
wenzelm@66454
   695
provides a new 'sessions' keyword. In contrast, a theory that is
wenzelm@66454
   696
imported in the old-fashioned manner via an explicit file-system path
wenzelm@66472
   697
belongs to the current session, and might cause theory name conflicts
wenzelm@66454
   698
later on. Theories that are imported from other sessions are excluded
wenzelm@66454
   699
from the current session document. The command-line tool "isabelle
wenzelm@66454
   700
imports" helps to update theory imports.
wenzelm@66454
   701
wenzelm@65451
   702
* The main theory entry points for some non-HOL sessions have changed,
wenzelm@65451
   703
to avoid confusion with the global name "Main" of the session HOL. This
wenzelm@65451
   704
leads to the follow renamings:
wenzelm@65451
   705
wenzelm@65451
   706
  CTT/Main.thy    ~>  CTT/CTT.thy
wenzelm@65451
   707
  ZF/Main.thy     ~>  ZF/ZF.thy
wenzelm@65451
   708
  ZF/Main_ZF.thy  ~>  ZF/ZF.thy
wenzelm@65451
   709
  ZF/Main_ZFC.thy ~>  ZF/ZFC.thy
wenzelm@65451
   710
  ZF/ZF.thy       ~>  ZF/ZF_Base.thy
wenzelm@65451
   711
wenzelm@65451
   712
INCOMPATIBILITY.
wenzelm@65451
   713
wenzelm@66472
   714
* Commands 'alias' and 'type_alias' introduce aliases for constants and
wenzelm@66472
   715
type constructors, respectively. This allows adhoc changes to name-space
wenzelm@66472
   716
accesses within global or local theory contexts, e.g. within a 'bundle'.
wenzelm@66472
   717
wenzelm@64986
   718
* Document antiquotations @{prf} and @{full_prf} output proof terms
wenzelm@64986
   719
(again) in the same way as commands 'prf' and 'full_prf'.
wenzelm@64986
   720
wenzelm@65055
   721
* Computations generated by the code generator can be embedded directly
wenzelm@65055
   722
into ML, alongside with @{code} antiquotations, using the following
wenzelm@65055
   723
antiquotations:
wenzelm@65055
   724
wenzelm@65055
   725
  @{computation ... terms: ... datatypes: ...} :
wenzelm@65055
   726
    ((term -> term) -> 'ml option -> 'a) -> Proof.context -> term -> 'a
wenzelm@65055
   727
  @{computation_conv ... terms: ... datatypes: ...} :
wenzelm@65055
   728
    (Proof.context -> 'ml -> conv) -> Proof.context -> conv
wenzelm@65045
   729
  @{computation_check terms: ... datatypes: ...} : Proof.context -> conv
haftmann@65041
   730
wenzelm@65055
   731
See src/HOL/ex/Computations.thy,
wenzelm@65055
   732
src/HOL/Decision_Procs/Commutative_Ring.thy and
wenzelm@65055
   733
src/HOL/Decision_Procs/Reflective_Field.thy for examples and the
wenzelm@65055
   734
tutorial on code generation.
haftmann@65041
   735
wenzelm@64986
   736
wenzelm@64602
   737
*** Prover IDE -- Isabelle/Scala/jEdit ***
wenzelm@64602
   738
wenzelm@66472
   739
* Session-qualified theory imports allow the Prover IDE to process
wenzelm@66472
   740
arbitrary theory hierarchies independently of the underlying logic
wenzelm@66472
   741
session image (e.g. option "isabelle jedit -l"), but the directory
wenzelm@66472
   742
structure needs to be known in advance (e.g. option "isabelle jedit -d"
wenzelm@66472
   743
or a line in the file $ISABELLE_HOME_USER/ROOTS).
wenzelm@64602
   744
wenzelm@64842
   745
* The PIDE document model maintains file content independently of the
wenzelm@64842
   746
status of jEdit editor buffers. Reloading jEdit buffers no longer causes
wenzelm@64842
   747
changes of formal document content. Theory dependencies are always
wenzelm@64842
   748
resolved internally, without the need for corresponding editor buffers.
wenzelm@64842
   749
The system option "jedit_auto_load" has been discontinued: it is
wenzelm@64842
   750
effectively always enabled.
wenzelm@64842
   751
wenzelm@64867
   752
* The Theories dockable provides a "Purge" button, in order to restrict
wenzelm@64867
   753
the document model to theories that are required for open editor
wenzelm@64867
   754
buffers.
wenzelm@64867
   755
wenzelm@66426
   756
* The Theories dockable indicates the overall status of checking of each
wenzelm@66426
   757
entry. When all forked tasks of a theory are finished, the border is
wenzelm@66426
   758
painted with thick lines; remaining errors in this situation are
wenzelm@66426
   759
represented by a different border color.
wenzelm@66426
   760
wenzelm@66472
   761
* Automatic indentation is more careful to avoid redundant spaces in
wenzelm@66472
   762
intermediate situations. Keywords are indented after input (via typed
wenzelm@66472
   763
characters or completion); see also option "jedit_indent_input".
wenzelm@66472
   764
wenzelm@66472
   765
* Action "isabelle.preview" opens an HTML preview of the current theory
wenzelm@66472
   766
document in the default web browser.
wenzelm@66472
   767
wenzelm@66576
   768
* Command-line invocation "isabelle jedit -R -l LOGIC" opens the ROOT
wenzelm@66576
   769
entry of the specified logic session in the editor, while its parent is
wenzelm@66576
   770
used for formal checking.
wenzelm@66472
   771
wenzelm@66463
   772
* The main Isabelle/jEdit plugin may be restarted manually (using the
wenzelm@66463
   773
jEdit Plugin Manager), as long as the "Isabelle Base" plugin remains
wenzelm@66463
   774
enabled at all times.
wenzelm@66463
   775
wenzelm@66472
   776
* Update to current jedit-5.4.0.
wenzelm@65329
   777
wenzelm@64602
   778
haftmann@66149
   779
*** Pure ***
haftmann@66149
   780
haftmann@66149
   781
* Deleting the last code equations for a particular function using
haftmann@66149
   782
[code del] results in function with no equations (runtime abort) rather
wenzelm@66472
   783
than an unimplemented function (generation time abort). Use explicit
haftmann@66667
   784
[[code drop:]] to enforce the latter. Minor INCOMPATIBILITY.
haftmann@66149
   785
haftmann@66313
   786
* Proper concept of code declarations in code.ML:
wenzelm@66472
   787
  - Regular code declarations act only on the global theory level, being
wenzelm@66472
   788
    ignored with warnings if syntactically malformed.
wenzelm@66472
   789
  - Explicitly global code declarations yield errors if syntactically
wenzelm@66472
   790
    malformed.
wenzelm@66472
   791
  - Default code declarations are silently ignored if syntactically
wenzelm@66472
   792
    malformed.
haftmann@66313
   793
Minor INCOMPATIBILITY.
haftmann@66313
   794
wenzelm@66472
   795
* Clarified and standardized internal data bookkeeping of code
wenzelm@66472
   796
declarations: history of serials allows to track potentially
wenzelm@66472
   797
non-monotonous declarations appropriately. Minor INCOMPATIBILITY.
haftmann@66313
   798
haftmann@66149
   799
haftmann@64593
   800
*** HOL ***
haftmann@64593
   801
blanchet@66616
   802
* The Nunchaku model finder is now part of "Main".
blanchet@66616
   803
wenzelm@66472
   804
* SMT module:
wenzelm@66472
   805
  - A new option, 'smt_nat_as_int', has been added to translate 'nat' to
wenzelm@66472
   806
    'int' and benefit from the SMT solver's theory reasoning. It is
wenzelm@66472
   807
    disabled by default.
wenzelm@66472
   808
  - The legacy module "src/HOL/Library/Old_SMT.thy" has been removed.
wenzelm@66472
   809
  - Several small issues have been rectified in the 'smt' command.
wenzelm@66472
   810
wenzelm@66472
   811
* (Co)datatype package: The 'size_gen_o_map' lemma is no longer
wenzelm@66472
   812
generated for datatypes with type class annotations. As a result, the
wenzelm@66472
   813
tactic that derives it no longer fails on nested datatypes. Slight
wenzelm@66472
   814
INCOMPATIBILITY.
eberlm@66450
   815
haftmann@66348
   816
* Command and antiquotation "value" with modified default strategy:
haftmann@66348
   817
terms without free variables are always evaluated using plain evaluation
wenzelm@66472
   818
only, with no fallback on normalization by evaluation. Minor
wenzelm@66472
   819
INCOMPATIBILITY.
eberlm@65956
   820
wenzelm@65552
   821
* Theories "GCD" and "Binomial" are already included in "Main" (instead
wenzelm@65575
   822
of "Complex_Main").
wenzelm@65552
   823
haftmann@65170
   824
* Constant "surj" is a full input/output abbreviation (again).
haftmann@65170
   825
Minor INCOMPATIBILITY.
haftmann@65170
   826
haftmann@64632
   827
* Dropped aliasses RangeP, DomainP for Rangep, Domainp respectively.
haftmann@64632
   828
INCOMPATIBILITY.
haftmann@64632
   829
wenzelm@66472
   830
* Renamed ii to imaginary_unit in order to free up ii as a variable
wenzelm@66472
   831
name. The syntax \<i> remains available. INCOMPATIBILITY.
wenzelm@66472
   832
wenzelm@66472
   833
* Dropped abbreviations transP, antisymP, single_valuedP; use constants
wenzelm@66472
   834
transp, antisymp, single_valuedp instead. INCOMPATIBILITY.
wenzelm@66472
   835
wenzelm@66472
   836
* Constant "subseq" in Topological_Spaces has been removed -- it is
wenzelm@66472
   837
subsumed by "strict_mono". Some basic lemmas specific to "subseq" have
wenzelm@66472
   838
been renamed accordingly, e.g. "subseq_o" -> "strict_mono_o" etc.
wenzelm@66472
   839
wenzelm@66472
   840
* Theory List: "sublist" renamed to "nths" in analogy with "nth", and
wenzelm@66472
   841
"sublisteq" renamed to "subseq". Minor INCOMPATIBILITY.
wenzelm@66472
   842
wenzelm@66472
   843
* Theory List: new generic function "sorted_wrt".
wenzelm@66472
   844
wenzelm@66472
   845
* Named theorems mod_simps covers various congruence rules concerning
wenzelm@66472
   846
mod, replacing former zmod_simps. INCOMPATIBILITY.
haftmann@64787
   847
haftmann@64593
   848
* Swapped orientation of congruence rules mod_add_left_eq,
haftmann@64593
   849
mod_add_right_eq, mod_add_eq, mod_mult_left_eq, mod_mult_right_eq,
haftmann@64593
   850
mod_mult_eq, mod_minus_eq, mod_diff_left_eq, mod_diff_right_eq,
wenzelm@66472
   851
mod_diff_eq. INCOMPATIBILITY.
haftmann@64593
   852
haftmann@64593
   853
* Generalized some facts:
blanchet@64876
   854
    measure_induct_rule
blanchet@64876
   855
    measure_induct
haftmann@64593
   856
    zminus_zmod ~> mod_minus_eq
haftmann@64593
   857
    zdiff_zmod_left ~> mod_diff_left_eq
haftmann@64593
   858
    zdiff_zmod_right ~> mod_diff_right_eq
haftmann@64593
   859
    zmod_eq_dvd_iff ~> mod_eq_dvd_iff
haftmann@64593
   860
INCOMPATIBILITY.
haftmann@64593
   861
wenzelm@66472
   862
* Algebraic type class hierarchy of euclidean (semi)rings in HOL:
wenzelm@66472
   863
euclidean_(semi)ring, euclidean_(semi)ring_cancel,
wenzelm@66472
   864
unique_euclidean_(semi)ring; instantiation requires provision of a
wenzelm@66472
   865
euclidean size.
wenzelm@66472
   866
wenzelm@66472
   867
* Theory "HOL-Number_Theory.Euclidean_Algorithm" has been reworked:
wenzelm@66472
   868
  - Euclidean induction is available as rule eucl_induct.
wenzelm@66472
   869
  - Constants Euclidean_Algorithm.gcd, Euclidean_Algorithm.lcm,
wenzelm@66472
   870
    Euclidean_Algorithm.Gcd and Euclidean_Algorithm.Lcm allow
wenzelm@66472
   871
    easy instantiation of euclidean (semi)rings as GCD (semi)rings.
wenzelm@66472
   872
  - Coefficients obtained by extended euclidean algorithm are
wenzelm@66472
   873
    available as "bezout_coefficients".
wenzelm@66472
   874
INCOMPATIBILITY.
wenzelm@66472
   875
wenzelm@66472
   876
* Theory "Number_Theory.Totient" introduces basic notions about Euler's
wenzelm@66472
   877
totient function previously hidden as solitary example in theory
wenzelm@66472
   878
Residues. Definition changed so that "totient 1 = 1" in agreement with
wenzelm@66472
   879
the literature. Minor INCOMPATIBILITY.
wenzelm@66472
   880
wenzelm@66542
   881
* New styles in theory "HOL-Library.LaTeXsugar":
nipkow@66541
   882
  - "dummy_pats" for printing equations with "_" on the lhs;
nipkow@66541
   883
  - "eta_expand" for printing eta-expanded terms.
nipkow@66541
   884
wenzelm@66472
   885
* Theory "HOL-Library.Permutations": theorem bij_swap_ompose_bij has
wenzelm@66472
   886
been renamed to bij_swap_compose_bij. INCOMPATIBILITY.
wenzelm@66472
   887
lp15@66645
   888
* New theory "HOL-Library.Going_To_Filter" providing the "f going_to F"
eberlm@66487
   889
filter for describing points x such that f(x) is in the filter F.
eberlm@66487
   890
eberlm@66480
   891
* Theory "HOL-Library.Formal_Power_Series": constants X/E/L/F have been
eberlm@66480
   892
renamed to fps_X/fps_exp/fps_ln/fps_hypergeo to avoid polluting the name
wenzelm@66472
   893
space. INCOMPATIBILITY.
wenzelm@66472
   894
wenzelm@66472
   895
* Theory "HOL-Library.FinFun" has been moved to AFP (again).
wenzelm@66472
   896
INCOMPATIBILITY.
wenzelm@66472
   897
wenzelm@66472
   898
* Theory "HOL-Library.FuncSet": some old and rarely used ASCII
wenzelm@66472
   899
replacement syntax has been removed. INCOMPATIBILITY, standard syntax
wenzelm@66472
   900
with symbols should be used instead. The subsequent commands help to
wenzelm@66472
   901
reproduce the old forms, e.g. to simplify porting old theories:
wenzelm@66472
   902
wenzelm@66472
   903
syntax (ASCII)
wenzelm@66472
   904
  "_PiE" :: "pttrn \<Rightarrow> 'a set \<Rightarrow> 'b set \<Rightarrow> ('a \<Rightarrow> 'b) set"  ("(3PIE _:_./ _)" 10)
wenzelm@66472
   905
  "_Pi"  :: "pttrn \<Rightarrow> 'a set \<Rightarrow> 'b set \<Rightarrow> ('a \<Rightarrow> 'b) set"  ("(3PI _:_./ _)" 10)
wenzelm@66472
   906
  "_lam" :: "pttrn \<Rightarrow> 'a set \<Rightarrow> 'a \<Rightarrow> 'b \<Rightarrow> ('a \<Rightarrow> 'b)"  ("(3%_:_./ _)" [0,0,3] 3)
wenzelm@66472
   907
wenzelm@66472
   908
* Theory "HOL-Library.Multiset": the simprocs on subsets operators of
wenzelm@66472
   909
multisets have been renamed:
wenzelm@66472
   910
wenzelm@66472
   911
  msetless_cancel_numerals ~> msetsubset_cancel
wenzelm@66472
   912
  msetle_cancel_numerals ~> msetsubset_eq_cancel
wenzelm@66472
   913
wenzelm@66472
   914
INCOMPATIBILITY.
wenzelm@66472
   915
lars@66481
   916
* Theory "HOL-Library.Pattern_Aliases" provides input and output syntax
lars@66481
   917
for pattern aliases as known from Haskell, Scala and ML.
blanchet@65515
   918
Andreas@66555
   919
* Theory "HOL-Library.Uprod" formalizes the type of unordered pairs.
Andreas@66555
   920
wenzelm@64898
   921
* Session HOL-Analysis: more material involving arcs, paths, covering
wenzelm@66652
   922
spaces, innessential maps, retracts, infinite products, simplicial
wenzelm@66652
   923
complexes. Baire Category theorem. Major results include the Jordan
wenzelm@66652
   924
Curve Theorem and the Great Picard Theorem.
wenzelm@66472
   925
wenzelm@66472
   926
* Session HOL-Algebra has been extended by additional lattice theory:
wenzelm@66472
   927
the Knaster-Tarski fixed point theorem and Galois Connections.
wenzelm@66472
   928
wenzelm@66472
   929
* Sessions HOL-Computational_Algebra and HOL-Number_Theory: new notions
wenzelm@66472
   930
of squarefreeness, n-th powers, and prime powers.
wenzelm@66472
   931
wenzelm@66472
   932
* Session "HOL-Computional_Algebra" covers many previously scattered
wenzelm@66472
   933
theories, notably Euclidean_Algorithm, Factorial_Ring,
wenzelm@66472
   934
Formal_Power_Series, Fraction_Field, Fundamental_Theorem_Algebra,
wenzelm@66472
   935
Normalized_Fraction, Polynomial_FPS, Polynomial, Primes. Minor
wenzelm@66472
   936
INCOMPATIBILITY.
Mathias@65027
   937
wenzelm@60331
   938
wenzelm@64844
   939
*** System ***
wenzelm@64844
   940
wenzelm@66474
   941
* Isabelle/Scala: the SQL module supports access to relational
wenzelm@66474
   942
databases, either as plain file (SQLite) or full-scale server
wenzelm@66474
   943
(PostgreSQL via local port or remote ssh connection).
wenzelm@66474
   944
wenzelm@66474
   945
* Results of "isabelle build" are recorded as SQLite database (i.e.
wenzelm@66474
   946
"Application File Format" in the sense of
wenzelm@66474
   947
https://www.sqlite.org/appfileformat.html). This allows systematic
wenzelm@66474
   948
access via operations from module Sessions.Store in Isabelle/Scala.
wenzelm@66474
   949
wenzelm@66472
   950
* System option "parallel_proofs" is 1 by default (instead of more
wenzelm@66472
   951
aggressive 2). This requires less heap space and avoids burning parallel
wenzelm@66472
   952
CPU cycles, while full subproof parallelization is enabled for repeated
wenzelm@66472
   953
builds (according to parallel_subproofs_threshold).
wenzelm@65072
   954
wenzelm@65448
   955
* System option "record_proofs" allows to change the global
wenzelm@65448
   956
Proofterm.proofs variable for a session. Regular values are are 0, 1, 2;
wenzelm@65448
   957
a negative value means the current state in the ML heap image remains
wenzelm@65448
   958
unchanged.
wenzelm@65448
   959
wenzelm@66472
   960
* Isabelle settings variable ISABELLE_SCALA_BUILD_OPTIONS has been
wenzelm@66472
   961
renamed to ISABELLE_SCALAC_OPTIONS. Rare INCOMPATIBILITY.
wenzelm@66472
   962
wenzelm@66472
   963
* Isabelle settings variables ISABELLE_WINDOWS_PLATFORM,
wenzelm@66472
   964
ISABELLE_WINDOWS_PLATFORM32, ISABELLE_WINDOWS_PLATFORM64 indicate the
wenzelm@66472
   965
native Windows platform (independently of the Cygwin installation). This
wenzelm@66472
   966
is analogous to ISABELLE_PLATFORM, ISABELLE_PLATFORM32,
wenzelm@66472
   967
ISABELLE_PLATFORM64.
wenzelm@65557
   968
wenzelm@66786
   969
* Command-line tool "isabelle build_docker" builds a Docker image from
wenzelm@66786
   970
the Isabelle application bundle for Linux. See also
wenzelm@66786
   971
https://hub.docker.com/r/makarius/isabelle
wenzelm@66786
   972
wenzelm@66473
   973
* Command-line tool "isabelle vscode_server" provides a Language Server
wenzelm@66473
   974
Protocol implementation, e.g. for the Visual Studio Code editor. It
wenzelm@66473
   975
serves as example for alternative PIDE front-ends.
wenzelm@66473
   976
wenzelm@66472
   977
* Command-line tool "isabelle imports" helps to maintain theory imports
wenzelm@66673
   978
wrt. session structure. Examples for the main Isabelle distribution:
wenzelm@66472
   979
wenzelm@66472
   980
  isabelle imports -I -a
wenzelm@66472
   981
  isabelle imports -U -a
wenzelm@66472
   982
  isabelle imports -U -i -a
wenzelm@66472
   983
  isabelle imports -M -a -d '~~/src/Benchmarks'
wenzelm@66472
   984
wenzelm@64844
   985
wenzelm@67099
   986
wenzelm@64072
   987
New in Isabelle2016-1 (December 2016)
wenzelm@64072
   988
-------------------------------------
wenzelm@62216
   989
wenzelm@62440
   990
*** General ***
wenzelm@62440
   991
wenzelm@64390
   992
* Splitter in proof methods "simp", "auto" and friends:
wenzelm@64390
   993
  - The syntax "split add" has been discontinued, use plain "split",
wenzelm@64390
   994
    INCOMPATIBILITY.
wenzelm@64390
   995
  - For situations with many conditional or case expressions, there is
wenzelm@64390
   996
    an alternative splitting strategy that can be much faster. It is
wenzelm@64390
   997
    selected by writing "split!" instead of "split". It applies safe
wenzelm@64390
   998
    introduction and elimination rules after each split rule. As a
wenzelm@64390
   999
    result the subgoal may be split into several subgoals.
wenzelm@64390
  1000
wenzelm@63273
  1001
* Command 'bundle' provides a local theory target to define a bundle
wenzelm@63273
  1002
from the body of specification commands (such as 'declare',
wenzelm@63273
  1003
'declaration', 'notation', 'lemmas', 'lemma'). For example:
wenzelm@63273
  1004
wenzelm@63273
  1005
bundle foo
wenzelm@63273
  1006
begin
wenzelm@63273
  1007
  declare a [simp]
wenzelm@63273
  1008
  declare b [intro]
wenzelm@63273
  1009
end
wenzelm@63272
  1010
wenzelm@63282
  1011
* Command 'unbundle' is like 'include', but works within a local theory
wenzelm@63282
  1012
context. Unlike "context includes ... begin", the effect of 'unbundle'
wenzelm@63282
  1013
on the target context persists, until different declarations are given.
wenzelm@63282
  1014
wenzelm@63977
  1015
* Simplified outer syntax: uniform category "name" includes long
wenzelm@63977
  1016
identifiers. Former "xname" / "nameref" / "name reference" has been
wenzelm@63977
  1017
discontinued.
wenzelm@63977
  1018
wenzelm@63977
  1019
* Embedded content (e.g. the inner syntax of types, terms, props) may be
wenzelm@63977
  1020
delimited uniformly via cartouches. This works better than old-fashioned
wenzelm@63977
  1021
quotes when sub-languages are nested.
wenzelm@63977
  1022
wenzelm@63977
  1023
* Mixfix annotations support general block properties, with syntax
wenzelm@63977
  1024
"(\<open>x=a y=b z \<dots>\<close>". Notable property names are "indent", "consistent",
wenzelm@63977
  1025
"unbreakable", "markup". The existing notation "(DIGITS" is equivalent
wenzelm@63977
  1026
to "(\<open>indent=DIGITS\<close>". The former notation "(00" for unbreakable blocks
wenzelm@63977
  1027
is superseded by "(\<open>unbreabable\<close>" --- rare INCOMPATIBILITY.
nipkow@63649
  1028
wenzelm@63384
  1029
* Proof method "blast" is more robust wrt. corner cases of Pure
wenzelm@63384
  1030
statements without object-logic judgment.
wenzelm@63384
  1031
wenzelm@63624
  1032
* Commands 'prf' and 'full_prf' are somewhat more informative (again):
wenzelm@63977
  1033
proof terms are reconstructed and cleaned from administrative thm nodes.
wenzelm@63977
  1034
wenzelm@63977
  1035
* Code generator: config option "code_timing" triggers measurements of
wenzelm@63977
  1036
different phases of code generation. See src/HOL/ex/Code_Timing.thy for
wenzelm@63977
  1037
examples.
wenzelm@63977
  1038
wenzelm@63977
  1039
* Code generator: implicits in Scala (stemming from type class
wenzelm@63977
  1040
instances) are generated into companion object of corresponding type
wenzelm@63977
  1041
class, to resolve some situations where ambiguities may occur.
wenzelm@63977
  1042
wenzelm@64390
  1043
* Solve direct: option "solve_direct_strict_warnings" gives explicit
wenzelm@64390
  1044
warnings for lemma statements with trivial proofs.
haftmann@64013
  1045
wenzelm@64602
  1046
wenzelm@62904
  1047
*** Prover IDE -- Isabelle/Scala/jEdit ***
wenzelm@62904
  1048
wenzelm@64527
  1049
* More aggressive flushing of machine-generated input, according to
wenzelm@64527
  1050
system option editor_generated_input_delay (in addition to existing
wenzelm@64527
  1051
editor_input_delay for regular user edits). This may affect overall PIDE
wenzelm@64527
  1052
reactivity and CPU usage.
wenzelm@64527
  1053
wenzelm@64390
  1054
* Syntactic indentation according to Isabelle outer syntax. Action
wenzelm@64390
  1055
"indent-lines" (shortcut C+i) indents the current line according to
wenzelm@64390
  1056
command keywords and some command substructure. Action
wenzelm@64390
  1057
"isabelle.newline" (shortcut ENTER) indents the old and the new line
wenzelm@64390
  1058
according to command keywords only; see also option
wenzelm@64390
  1059
"jedit_indent_newline".
wenzelm@64390
  1060
wenzelm@64390
  1061
* Semantic indentation for unstructured proof scripts ('apply' etc.) via
wenzelm@64390
  1062
number of subgoals. This requires information of ongoing document
wenzelm@64390
  1063
processing and may thus lag behind, when the user is editing too
wenzelm@64390
  1064
quickly; see also option "jedit_script_indent" and
wenzelm@64390
  1065
"jedit_script_indent_limit".
wenzelm@64390
  1066
wenzelm@64390
  1067
* Refined folding mode "isabelle" based on Isar syntax: 'next' and 'qed'
wenzelm@64390
  1068
are treated as delimiters for fold structure; 'begin' and 'end'
wenzelm@64390
  1069
structure of theory specifications is treated as well.
wenzelm@64390
  1070
wenzelm@64390
  1071
* Command 'proof' provides information about proof outline with cases,
wenzelm@64390
  1072
e.g. for proof methods "cases", "induct", "goal_cases".
wenzelm@64390
  1073
wenzelm@64390
  1074
* Completion templates for commands involving "begin ... end" blocks,
wenzelm@64390
  1075
e.g. 'context', 'notepad'.
wenzelm@64390
  1076
wenzelm@64390
  1077
* Sidekick parser "isabelle-context" shows nesting of context blocks
wenzelm@64390
  1078
according to 'begin' and 'end' structure.
wenzelm@64390
  1079
wenzelm@63977
  1080
* Highlighting of entity def/ref positions wrt. cursor.
wenzelm@63977
  1081
wenzelm@63977
  1082
* Action "isabelle.select-entity" (shortcut CS+ENTER) selects all
wenzelm@64514
  1083
occurrences of the formal entity at the caret position. This facilitates
wenzelm@63977
  1084
systematic renaming.
wenzelm@63977
  1085
wenzelm@63977
  1086
* PIDE document markup works across multiple Isar commands, e.g. the
wenzelm@63977
  1087
results established at the end of a proof are properly identified in the
wenzelm@63977
  1088
theorem statement.
wenzelm@63977
  1089
wenzelm@63977
  1090
* Cartouche abbreviations work both for " and ` to accomodate typical
wenzelm@63977
  1091
situations where old ASCII notation may be updated.
wenzelm@63977
  1092
wenzelm@63875
  1093
* Dockable window "Symbols" also provides access to 'abbrevs' from the
wenzelm@63875
  1094
outer syntax of the current theory buffer. This provides clickable
wenzelm@63875
  1095
syntax templates, including entries with empty abbrevs name (which are
wenzelm@63875
  1096
inaccessible via keyboard completion).
wenzelm@63875
  1097
wenzelm@63022
  1098
* IDE support for the Isabelle/Pure bootstrap process, with the
wenzelm@63022
  1099
following independent stages:
wenzelm@63022
  1100
wenzelm@63022
  1101
  src/Pure/ROOT0.ML
wenzelm@63022
  1102
  src/Pure/ROOT.ML
wenzelm@63022
  1103
  src/Pure/Pure.thy
wenzelm@63022
  1104
  src/Pure/ML_Bootstrap.thy
wenzelm@63022
  1105
wenzelm@63022
  1106
The ML ROOT files act like quasi-theories in the context of theory
wenzelm@63022
  1107
ML_Bootstrap: this allows continuous checking of all loaded ML files.
wenzelm@63022
  1108
The theory files are presented with a modified header to import Pure
wenzelm@63022
  1109
from the running Isabelle instance. Results from changed versions of
wenzelm@63022
  1110
each stage are *not* propagated to the next stage, and isolated from the
wenzelm@63022
  1111
actual Isabelle/Pure that runs the IDE itself. The sequential
wenzelm@63308
  1112
dependencies of the above files are only observed for batch build.
wenzelm@62904
  1113
wenzelm@63977
  1114
* Isabelle/ML and Standard ML files are presented in Sidekick with the
wenzelm@63977
  1115
tree structure of section headings: this special comment format is
wenzelm@63977
  1116
described in "implementation" chapter 0, e.g. (*** section ***).
wenzelm@63461
  1117
wenzelm@63581
  1118
* Additional abbreviations for syntactic completion may be specified
wenzelm@63871
  1119
within the theory header as 'abbrevs'. The theory syntax for 'keywords'
wenzelm@63871
  1120
has been simplified accordingly: optional abbrevs need to go into the
wenzelm@63871
  1121
new 'abbrevs' section.
wenzelm@63871
  1122
wenzelm@63871
  1123
* Global abbreviations via $ISABELLE_HOME/etc/abbrevs and
wenzelm@63871
  1124
$ISABELLE_HOME_USER/etc/abbrevs are no longer supported. Minor
wenzelm@63871
  1125
INCOMPATIBILITY, use 'abbrevs' within theory header instead.
wenzelm@63579
  1126
wenzelm@64390
  1127
* Action "isabelle.keymap-merge" asks the user to resolve pending
wenzelm@64390
  1128
Isabelle keymap changes that are in conflict with the current jEdit
wenzelm@64390
  1129
keymap; non-conflicting changes are always applied implicitly. This
wenzelm@64390
  1130
action is automatically invoked on Isabelle/jEdit startup and thus
wenzelm@64390
  1131
increases chances that users see new keyboard shortcuts when re-using
wenzelm@64390
  1132
old keymaps.
wenzelm@64390
  1133
wenzelm@63675
  1134
* ML and document antiquotations for file-systems paths are more uniform
wenzelm@63675
  1135
and diverse:
wenzelm@63675
  1136
wenzelm@63675
  1137
  @{path NAME}   -- no file-system check
wenzelm@63675
  1138
  @{file NAME}   -- check for plain file
wenzelm@63675
  1139
  @{dir NAME}    -- check for directory
wenzelm@63675
  1140
wenzelm@63675
  1141
Minor INCOMPATIBILITY, former uses of @{file} and @{file_unchecked} may
wenzelm@63675
  1142
have to be changed.
wenzelm@63669
  1143
wenzelm@63669
  1144
wenzelm@63977
  1145
*** Document preparation ***
wenzelm@63977
  1146
wenzelm@63977
  1147
* New symbol \<circle>, e.g. for temporal operator.
wenzelm@63977
  1148
wenzelm@64073
  1149
* New document and ML antiquotation @{locale} for locales, similar to
wenzelm@64073
  1150
existing antiquotation @{class}.
wenzelm@64073
  1151
wenzelm@63977
  1152
* Mixfix annotations support delimiters like \<^control>\<open>cartouche\<close> --
wenzelm@63977
  1153
this allows special forms of document output.
wenzelm@63977
  1154
wenzelm@63977
  1155
* Raw LaTeX output now works via \<^latex>\<open>...\<close> instead of raw control
wenzelm@63977
  1156
symbol \<^raw:...>. INCOMPATIBILITY, notably for LaTeXsugar.thy and its
wenzelm@63977
  1157
derivatives.
wenzelm@63977
  1158
wenzelm@63977
  1159
* \<^raw:...> symbols are no longer supported.
wenzelm@63977
  1160
wenzelm@63977
  1161
* Old 'header' command is no longer supported (legacy since
wenzelm@63977
  1162
Isabelle2015).
wenzelm@63977
  1163
wenzelm@63977
  1164
wenzelm@62312
  1165
*** Isar ***
wenzelm@62312
  1166
wenzelm@63180
  1167
* Many specification elements support structured statements with 'if' /
wenzelm@63180
  1168
'for' eigen-context, e.g. 'axiomatization', 'abbreviation',
wenzelm@63180
  1169
'definition', 'inductive', 'function'.
wenzelm@63180
  1170
wenzelm@63094
  1171
* Toplevel theorem statements support eigen-context notation with 'if' /
wenzelm@63285
  1172
'for' (in postfix), which corresponds to 'assumes' / 'fixes' in the
wenzelm@63094
  1173
traditional long statement form (in prefix). Local premises are called
wenzelm@63094
  1174
"that" or "assms", respectively. Empty premises are *not* bound in the
wenzelm@63094
  1175
context: INCOMPATIBILITY.
wenzelm@63094
  1176
wenzelm@63043
  1177
* Command 'define' introduces a local (non-polymorphic) definition, with
wenzelm@63043
  1178
optional abstraction over local parameters. The syntax resembles
wenzelm@63047
  1179
'definition' and 'obtain'. It fits better into the Isar language than
wenzelm@63047
  1180
old 'def', which is now a legacy feature.
wenzelm@63043
  1181
wenzelm@63059
  1182
* Command 'obtain' supports structured statements with 'if' / 'for'
wenzelm@63059
  1183
context.
wenzelm@63059
  1184
wenzelm@62312
  1185
* Command '\<proof>' is an alias for 'sorry', with different
wenzelm@62312
  1186
typesetting. E.g. to produce proof holes in examples and documentation.
wenzelm@62216
  1187
wenzelm@63977
  1188
* The defining position of a literal fact \<open>prop\<close> is maintained more
wenzelm@63977
  1189
carefully, and made accessible as hyperlink in the Prover IDE.
wenzelm@63977
  1190
wenzelm@63977
  1191
* Commands 'finally' and 'ultimately' used to expose the result as
wenzelm@63977
  1192
literal fact: this accidental behaviour has been discontinued. Rare
wenzelm@63977
  1193
INCOMPATIBILITY, use more explicit means to refer to facts in Isar.
wenzelm@63977
  1194
wenzelm@63977
  1195
* Command 'axiomatization' has become more restrictive to correspond
wenzelm@63977
  1196
better to internal axioms as singleton facts with mandatory name. Minor
wenzelm@63977
  1197
INCOMPATIBILITY.
wenzelm@62939
  1198
wenzelm@63259
  1199
* Proof methods may refer to the main facts via the dynamic fact
wenzelm@63259
  1200
"method_facts". This is particularly useful for Eisbach method
wenzelm@63259
  1201
definitions.
wenzelm@63259
  1202
wenzelm@63528
  1203
* Proof method "use" allows to modify the main facts of a given method
wenzelm@63528
  1204
expression, e.g.
wenzelm@63259
  1205
wenzelm@63259
  1206
  (use facts in simp)
wenzelm@63259
  1207
  (use facts in \<open>simp add: ...\<close>)
wenzelm@63259
  1208
wenzelm@63977
  1209
* The old proof method "default" has been removed (legacy since
wenzelm@63977
  1210
Isabelle2016). INCOMPATIBILITY, use "standard" instead.
wenzelm@63977
  1211
wenzelm@62216
  1212
haftmann@63165
  1213
*** Pure ***
haftmann@63165
  1214
wenzelm@63977
  1215
* Pure provides basic versions of proof methods "simp" and "simp_all"
wenzelm@63977
  1216
that only know about meta-equality (==). Potential INCOMPATIBILITY in
wenzelm@63977
  1217
theory imports that merge Pure with e.g. Main of Isabelle/HOL: the order
wenzelm@63977
  1218
is relevant to avoid confusion of Pure.simp vs. HOL.simp.
wenzelm@63977
  1219
wenzelm@63977
  1220
* The command 'unfolding' and proof method "unfold" include a second
wenzelm@63977
  1221
stage where given equations are passed through the attribute "abs_def"
wenzelm@63977
  1222
before rewriting. This ensures that definitions are fully expanded,
wenzelm@63977
  1223
regardless of the actual parameters that are provided. Rare
wenzelm@63977
  1224
INCOMPATIBILITY in some corner cases: use proof method (simp only:)
wenzelm@63977
  1225
instead, or declare [[unfold_abs_def = false]] in the proof context.
wenzelm@63977
  1226
wenzelm@63977
  1227
* Type-inference improves sorts of newly introduced type variables for
wenzelm@63977
  1228
the object-logic, using its base sort (i.e. HOL.type for Isabelle/HOL).
wenzelm@63977
  1229
Thus terms like "f x" or "\<And>x. P x" without any further syntactic context
wenzelm@63977
  1230
produce x::'a::type in HOL instead of x::'a::{} in Pure. Rare
wenzelm@63977
  1231
INCOMPATIBILITY, need to provide explicit type constraints for Pure
wenzelm@63977
  1232
types where this is really intended.
haftmann@63350
  1233
haftmann@63165
  1234
blanchet@62327
  1235
*** HOL ***
blanchet@62327
  1236
wenzelm@63977
  1237
* New proof method "argo" using the built-in Argo solver based on SMT
wenzelm@63977
  1238
technology. The method can be used to prove goals of quantifier-free
wenzelm@63977
  1239
propositional logic, goals based on a combination of quantifier-free
wenzelm@63977
  1240
propositional logic with equality, and goals based on a combination of
wenzelm@63977
  1241
quantifier-free propositional logic with linear real arithmetic
wenzelm@63977
  1242
including min/max/abs. See HOL/ex/Argo_Examples.thy for examples.
wenzelm@63977
  1243
blanchet@66616
  1244
* The new "nunchaku" command integrates the Nunchaku model finder. The
wenzelm@64390
  1245
tool is experimental. See ~~/src/HOL/Nunchaku/Nunchaku.thy for details.
wenzelm@64390
  1246
wenzelm@63977
  1247
* Metis: The problem encoding has changed very slightly. This might
blanchet@63785
  1248
break existing proofs. INCOMPATIBILITY.
blanchet@63785
  1249
blanchet@63116
  1250
* Sledgehammer:
lp15@63967
  1251
  - The MaSh relevance filter is now faster than before.
blanchet@63116
  1252
  - Produce syntactically correct Vampire 4.0 problem files.
blanchet@63116
  1253
blanchet@62327
  1254
* (Co)datatype package:
blanchet@62693
  1255
  - New commands for defining corecursive functions and reasoning about
blanchet@62693
  1256
    them in "~~/src/HOL/Library/BNF_Corec.thy": 'corec', 'corecursive',
blanchet@62693
  1257
    'friend_of_corec', and 'corecursion_upto'; and 'corec_unique' proof
blanchet@62842
  1258
    method. See 'isabelle doc corec'.
wenzelm@63977
  1259
  - The predicator :: ('a \<Rightarrow> bool) \<Rightarrow> 'a F \<Rightarrow> bool is now a first-class
blanchet@63855
  1260
    citizen in bounded natural functors.
blanchet@62693
  1261
  - 'primrec' now allows nested calls through the predicator in addition
blanchet@62327
  1262
    to the map function.
blanchet@63855
  1263
  - 'bnf' automatically discharges reflexive proof obligations.
blanchet@62693
  1264
  - 'bnf' outputs a slightly modified proof obligation expressing rel in
traytel@62332
  1265
       terms of map and set
blanchet@63855
  1266
       (not giving a specification for rel makes this one reflexive).
blanchet@62693
  1267
  - 'bnf' outputs a new proof obligation expressing pred in terms of set
blanchet@63855
  1268
       (not giving a specification for pred makes this one reflexive).
blanchet@63855
  1269
    INCOMPATIBILITY: manual 'bnf' declarations may need adjustment.
blanchet@62335
  1270
  - Renamed lemmas:
blanchet@62335
  1271
      rel_prod_apply ~> rel_prod_inject
blanchet@62335
  1272
      pred_prod_apply ~> pred_prod_inject
blanchet@62335
  1273
    INCOMPATIBILITY.
blanchet@62536
  1274
  - The "size" plugin has been made compatible again with locales.
blanchet@63855
  1275
  - The theorems about "rel" and "set" may have a slightly different (but
blanchet@63855
  1276
    equivalent) form.
blanchet@63855
  1277
    INCOMPATIBILITY.
blanchet@62327
  1278
wenzelm@63977
  1279
* The 'coinductive' command produces a proper coinduction rule for
wenzelm@63977
  1280
mutual coinductive predicates. This new rule replaces the old rule,
wenzelm@63977
  1281
which exposed details of the internal fixpoint construction and was
wenzelm@63977
  1282
hard to use. INCOMPATIBILITY.
wenzelm@63977
  1283
wenzelm@63977
  1284
* New abbreviations for negated existence (but not bounded existence):
wenzelm@63977
  1285
wenzelm@63977
  1286
  \<nexists>x. P x \<equiv> \<not> (\<exists>x. P x)
wenzelm@63977
  1287
  \<nexists>!x. P x \<equiv> \<not> (\<exists>!x. P x)
wenzelm@63977
  1288
wenzelm@63977
  1289
* The print mode "HOL" for ASCII syntax of binders "!", "?", "?!", "@"
wenzelm@63977
  1290
has been removed for output. It is retained for input only, until it is
wenzelm@63977
  1291
eliminated altogether.
wenzelm@63977
  1292
wenzelm@63977
  1293
* The unique existence quantifier no longer provides 'binder' syntax,
wenzelm@63977
  1294
but uses syntax translations (as for bounded unique existence). Thus
wenzelm@63977
  1295
iterated quantification \<exists>!x y. P x y with its slightly confusing
wenzelm@63977
  1296
sequential meaning \<exists>!x. \<exists>!y. P x y is no longer possible. Instead,
wenzelm@63977
  1297
pattern abstraction admits simultaneous unique existence \<exists>!(x, y). P x y
wenzelm@63977
  1298
(analogous to existing notation \<exists>!(x, y)\<in>A. P x y). Potential
wenzelm@63977
  1299
INCOMPATIBILITY in rare situations.
wenzelm@63977
  1300
wenzelm@63977
  1301
* Conventional syntax "%(). t" for unit abstractions. Slight syntactic
wenzelm@63977
  1302
INCOMPATIBILITY.
wenzelm@63977
  1303
wenzelm@64390
  1304
* Renamed constants and corresponding theorems:
wenzelm@64390
  1305
wenzelm@64390
  1306
    setsum ~> sum
wenzelm@64390
  1307
    setprod ~> prod
wenzelm@64390
  1308
    listsum ~> sum_list
wenzelm@64390
  1309
    listprod ~> prod_list
wenzelm@64390
  1310
wenzelm@64390
  1311
INCOMPATIBILITY.
wenzelm@64390
  1312
wenzelm@64390
  1313
* Sligthly more standardized theorem names:
wenzelm@64390
  1314
    sgn_times ~> sgn_mult
wenzelm@64390
  1315
    sgn_mult' ~> Real_Vector_Spaces.sgn_mult
wenzelm@64390
  1316
    divide_zero_left ~> div_0
wenzelm@64390
  1317
    zero_mod_left ~> mod_0
wenzelm@64390
  1318
    divide_zero ~> div_by_0
wenzelm@64390
  1319
    divide_1 ~> div_by_1
wenzelm@64390
  1320
    nonzero_mult_divide_cancel_left ~> nonzero_mult_div_cancel_left
wenzelm@64390
  1321
    div_mult_self1_is_id ~> nonzero_mult_div_cancel_left
wenzelm@64390
  1322
    nonzero_mult_divide_cancel_right ~> nonzero_mult_div_cancel_right
wenzelm@64390
  1323
    div_mult_self2_is_id ~> nonzero_mult_div_cancel_right
wenzelm@64390
  1324
    is_unit_divide_mult_cancel_left ~> is_unit_div_mult_cancel_left
wenzelm@64390
  1325
    is_unit_divide_mult_cancel_right ~> is_unit_div_mult_cancel_right
wenzelm@64390
  1326
    mod_div_equality ~> div_mult_mod_eq
wenzelm@64390
  1327
    mod_div_equality2 ~> mult_div_mod_eq
wenzelm@64390
  1328
    mod_div_equality3 ~> mod_div_mult_eq
wenzelm@64390
  1329
    mod_div_equality4 ~> mod_mult_div_eq
wenzelm@64390
  1330
    minus_div_eq_mod ~> minus_div_mult_eq_mod
wenzelm@64390
  1331
    minus_div_eq_mod2 ~> minus_mult_div_eq_mod
wenzelm@64390
  1332
    minus_mod_eq_div ~> minus_mod_eq_div_mult
wenzelm@64390
  1333
    minus_mod_eq_div2 ~> minus_mod_eq_mult_div
wenzelm@64390
  1334
    div_mod_equality' ~> minus_mod_eq_div_mult [symmetric]
wenzelm@64390
  1335
    mod_div_equality' ~> minus_div_mult_eq_mod [symmetric]
wenzelm@64390
  1336
    zmod_zdiv_equality ~> mult_div_mod_eq [symmetric]
wenzelm@64390
  1337
    zmod_zdiv_equality' ~> minus_div_mult_eq_mod [symmetric]
wenzelm@64390
  1338
    Divides.mult_div_cancel ~> minus_mod_eq_mult_div [symmetric]
wenzelm@64390
  1339
    mult_div_cancel ~> minus_mod_eq_mult_div [symmetric]
wenzelm@64390
  1340
    zmult_div_cancel ~> minus_mod_eq_mult_div [symmetric]
wenzelm@64390
  1341
    div_1 ~> div_by_Suc_0
wenzelm@64390
  1342
    mod_1 ~> mod_by_Suc_0
wenzelm@64390
  1343
INCOMPATIBILITY.
wenzelm@64390
  1344
wenzelm@64390
  1345
* New type class "idom_abs_sgn" specifies algebraic properties
wenzelm@64390
  1346
of sign and absolute value functions.  Type class "sgn_if" has
wenzelm@64390
  1347
disappeared.  Slight INCOMPATIBILITY.
wenzelm@64390
  1348
wenzelm@64390
  1349
* Dedicated syntax LENGTH('a) for length of types.
wenzelm@64390
  1350
wenzelm@63977
  1351
* Characters (type char) are modelled as finite algebraic type
wenzelm@63977
  1352
corresponding to {0..255}.
wenzelm@63977
  1353
wenzelm@63977
  1354
  - Logical representation:
wenzelm@63977
  1355
    * 0 is instantiated to the ASCII zero character.
wenzelm@63977
  1356
    * All other characters are represented as "Char n"
wenzelm@63977
  1357
      with n being a raw numeral expression less than 256.
wenzelm@63977
  1358
    * Expressions of the form "Char n" with n greater than 255
wenzelm@63977
  1359
      are non-canonical.
wenzelm@63977
  1360
  - Printing and parsing:
wenzelm@63977
  1361
    * Printable characters are printed and parsed as "CHR ''\<dots>''"
wenzelm@63977
  1362
      (as before).
wenzelm@63977
  1363
    * The ASCII zero character is printed and parsed as "0".
wenzelm@63977
  1364
    * All other canonical characters are printed as "CHR 0xXX"
wenzelm@63977
  1365
      with XX being the hexadecimal character code.  "CHR n"
wenzelm@63977
  1366
      is parsable for every numeral expression n.
wenzelm@63977
  1367
    * Non-canonical characters have no special syntax and are
wenzelm@63977
  1368
      printed as their logical representation.
wenzelm@63977
  1369
  - Explicit conversions from and to the natural numbers are
wenzelm@63977
  1370
    provided as char_of_nat, nat_of_char (as before).
wenzelm@63977
  1371
  - The auxiliary nibble type has been discontinued.
wenzelm@63977
  1372
wenzelm@63977
  1373
INCOMPATIBILITY.
wenzelm@63977
  1374
wenzelm@63977
  1375
* Type class "div" with operation "mod" renamed to type class "modulo"
wenzelm@63977
  1376
with operation "modulo", analogously to type class "divide". This
wenzelm@63977
  1377
eliminates the need to qualify any of those names in the presence of
wenzelm@63977
  1378
infix "mod" syntax. INCOMPATIBILITY.
wenzelm@63977
  1379
wenzelm@63979
  1380
* Statements and proofs of Knaster-Tarski fixpoint combinators lfp/gfp
wenzelm@63979
  1381
have been clarified. The fixpoint properties are lfp_fixpoint, its
wenzelm@63979
  1382
symmetric lfp_unfold (as before), and the duals for gfp. Auxiliary items
wenzelm@63979
  1383
for the proof (lfp_lemma2 etc.) are no longer exported, but can be
wenzelm@63979
  1384
easily recovered by composition with eq_refl. Minor INCOMPATIBILITY.
wenzelm@63979
  1385
wenzelm@63977
  1386
* Constant "surj" is a mere input abbreviation, to avoid hiding an
wenzelm@63977
  1387
equation in term output. Minor INCOMPATIBILITY.
wenzelm@63977
  1388
wenzelm@63977
  1389
* Command 'code_reflect' accepts empty constructor lists for datatypes,
wenzelm@63977
  1390
which renders those abstract effectively.
wenzelm@63977
  1391
wenzelm@63977
  1392
* Command 'export_code' checks given constants for abstraction
wenzelm@63977
  1393
violations: a small guarantee that given constants specify a safe
wenzelm@63977
  1394
interface for the generated code.
wenzelm@63977
  1395
wenzelm@63977
  1396
* Code generation for Scala: ambiguous implicts in class diagrams are
wenzelm@63977
  1397
spelt out explicitly.
wenzelm@63977
  1398
wenzelm@63977
  1399
* Static evaluators (Code_Evaluation.static_* in Isabelle/ML) rely on
wenzelm@63977
  1400
explicitly provided auxiliary definitions for required type class
wenzelm@64390
  1401
dictionaries rather than half-working magic. INCOMPATIBILITY, see the
wenzelm@64390
  1402
tutorial on code generation for details.
wenzelm@64390
  1403
wenzelm@64390
  1404
* Theory Set_Interval: substantial new theorems on indexed sums and
wenzelm@64390
  1405
products.
wenzelm@63977
  1406
wenzelm@63977
  1407
* Locale bijection establishes convenient default simp rules such as
wenzelm@63977
  1408
"inv f (f a) = a" for total bijections.
wenzelm@63977
  1409
wenzelm@63977
  1410
* Abstract locales semigroup, abel_semigroup, semilattice,
wenzelm@63977
  1411
semilattice_neutr, ordering, ordering_top, semilattice_order,
wenzelm@63977
  1412
semilattice_neutr_order, comm_monoid_set, semilattice_set,
wenzelm@63977
  1413
semilattice_neutr_set, semilattice_order_set,
wenzelm@63977
  1414
semilattice_order_neutr_set monoid_list, comm_monoid_list,
wenzelm@63977
  1415
comm_monoid_list_set, comm_monoid_mset, comm_monoid_fun use boldified
wenzelm@63977
  1416
syntax uniformly that does not clash with corresponding global syntax.
wenzelm@63977
  1417
INCOMPATIBILITY.
wenzelm@63977
  1418
wenzelm@63977
  1419
* Former locale lifting_syntax is now a bundle, which is easier to
wenzelm@63977
  1420
include in a local context or theorem statement, e.g. "context includes
wenzelm@63977
  1421
lifting_syntax begin ... end". Minor INCOMPATIBILITY.
wenzelm@63977
  1422
wenzelm@63807
  1423
* Some old / obsolete theorems have been renamed / removed, potential
wenzelm@63807
  1424
INCOMPATIBILITY.
wenzelm@63807
  1425
wenzelm@63807
  1426
  nat_less_cases  --  removed, use linorder_cases instead
wenzelm@63807
  1427
  inv_image_comp  --  removed, use image_inv_f_f instead
wenzelm@63807
  1428
  image_surj_f_inv_f  ~>  image_f_inv_f
wenzelm@63113
  1429
Mathias@63456
  1430
* Some theorems about groups and orders have been generalised from
Mathias@63456
  1431
  groups to semi-groups that are also monoids:
Mathias@63456
  1432
    le_add_same_cancel1
Mathias@63456
  1433
    le_add_same_cancel2
Mathias@63456
  1434
    less_add_same_cancel1
Mathias@63456
  1435
    less_add_same_cancel2
Mathias@63456
  1436
    add_le_same_cancel1
Mathias@63456
  1437
    add_le_same_cancel2
Mathias@63456
  1438
    add_less_same_cancel1
Mathias@63456
  1439
    add_less_same_cancel2
Mathias@63456
  1440
Mathias@63456
  1441
* Some simplifications theorems about rings have been removed, since
Mathias@63456
  1442
  superseeded by a more general version:
Mathias@63456
  1443
    less_add_cancel_left_greater_zero ~> less_add_same_cancel1
Mathias@63456
  1444
    less_add_cancel_right_greater_zero ~> less_add_same_cancel2
Mathias@63456
  1445
    less_eq_add_cancel_left_greater_eq_zero ~> le_add_same_cancel1
Mathias@63456
  1446
    less_eq_add_cancel_right_greater_eq_zero ~> le_add_same_cancel2
Mathias@63456
  1447
    less_eq_add_cancel_left_less_eq_zero ~> add_le_same_cancel1
Mathias@63456
  1448
    less_eq_add_cancel_right_less_eq_zero ~> add_le_same_cancel2
Mathias@63456
  1449
    less_add_cancel_left_less_zero ~> add_less_same_cancel1
Mathias@63456
  1450
    less_add_cancel_right_less_zero ~> add_less_same_cancel2
Mathias@63456
  1451
INCOMPATIBILITY.
Mathias@63456
  1452
wenzelm@62407
  1453
* Renamed split_if -> if_split and split_if_asm -> if_split_asm to
wenzelm@62407
  1454
resemble the f.split naming convention, INCOMPATIBILITY.
nipkow@62396
  1455
wenzelm@63977
  1456
* Added class topological_monoid.
wenzelm@63977
  1457
wenzelm@64391
  1458
* The following theorems have been renamed:
wenzelm@64391
  1459
nipkow@64457
  1460
  setsum_left_distrib ~> sum_distrib_right
nipkow@64457
  1461
  setsum_right_distrib ~> sum_distrib_left
wenzelm@64391
  1462
wenzelm@64391
  1463
INCOMPATIBILITY.
wenzelm@64391
  1464
wenzelm@64391
  1465
* Compound constants INFIMUM and SUPREMUM are mere abbreviations now.
wenzelm@64391
  1466
INCOMPATIBILITY.
wenzelm@64391
  1467
wenzelm@64391
  1468
* "Gcd (f ` A)" and "Lcm (f ` A)" are printed with optional
wenzelm@64391
  1469
comprehension-like syntax analogously to "Inf (f ` A)" and "Sup (f `
wenzelm@64391
  1470
A)".
wenzelm@64391
  1471
wenzelm@64391
  1472
* Class semiring_Lcd merged into semiring_Gcd. INCOMPATIBILITY.
wenzelm@64391
  1473
wenzelm@64391
  1474
* The type class ordered_comm_monoid_add is now called
wenzelm@64391
  1475
ordered_cancel_comm_monoid_add. A new type class ordered_comm_monoid_add
wenzelm@64391
  1476
is introduced as the combination of ordered_ab_semigroup_add +
wenzelm@64391
  1477
comm_monoid_add. INCOMPATIBILITY.
wenzelm@64391
  1478
wenzelm@64391
  1479
* Introduced the type classes canonically_ordered_comm_monoid_add and
wenzelm@64391
  1480
dioid.
wenzelm@64391
  1481
wenzelm@64391
  1482
* Introduced the type class ordered_ab_semigroup_monoid_add_imp_le. When
wenzelm@64391
  1483
instantiating linordered_semiring_strict and ordered_ab_group_add, an
wenzelm@64391
  1484
explicit instantiation of ordered_ab_semigroup_monoid_add_imp_le might
wenzelm@64391
  1485
be required. INCOMPATIBILITY.
nipkow@63117
  1486
haftmann@62348
  1487
* Dropped various legacy fact bindings, whose replacements are often
haftmann@62348
  1488
of a more general type also:
haftmann@62348
  1489
  lcm_left_commute_nat ~> lcm.left_commute
haftmann@62348
  1490
  lcm_left_commute_int ~> lcm.left_commute
haftmann@62348
  1491
  gcd_left_commute_nat ~> gcd.left_commute
haftmann@62348
  1492
  gcd_left_commute_int ~> gcd.left_commute
haftmann@62348
  1493
  gcd_greatest_iff_nat ~> gcd_greatest_iff
haftmann@62348
  1494
  gcd_greatest_iff_int ~> gcd_greatest_iff
haftmann@62348
  1495
  coprime_dvd_mult_nat ~> coprime_dvd_mult
haftmann@62348
  1496
  coprime_dvd_mult_int ~> coprime_dvd_mult
haftmann@62348
  1497
  zpower_numeral_even ~> power_numeral_even
haftmann@62348
  1498
  gcd_mult_cancel_nat ~> gcd_mult_cancel
haftmann@62348
  1499
  gcd_mult_cancel_int ~> gcd_mult_cancel
haftmann@62348
  1500
  div_gcd_coprime_nat ~> div_gcd_coprime
haftmann@62348
  1501
  div_gcd_coprime_int ~> div_gcd_coprime
haftmann@62348
  1502
  zpower_numeral_odd ~> power_numeral_odd
haftmann@62348
  1503
  zero_less_int_conv ~> of_nat_0_less_iff
haftmann@62348
  1504
  gcd_greatest_nat ~> gcd_greatest
haftmann@62348
  1505
  gcd_greatest_int ~> gcd_greatest
haftmann@62348
  1506
  coprime_mult_nat ~> coprime_mult
haftmann@62348
  1507
  coprime_mult_int ~> coprime_mult
haftmann@62348
  1508
  lcm_commute_nat ~> lcm.commute
haftmann@62348
  1509
  lcm_commute_int ~> lcm.commute
haftmann@62348
  1510
  int_less_0_conv ~> of_nat_less_0_iff
haftmann@62348
  1511
  gcd_commute_nat ~> gcd.commute
haftmann@62348
  1512
  gcd_commute_int ~> gcd.commute
haftmann@62348
  1513
  Gcd_insert_nat ~> Gcd_insert
haftmann@62348
  1514
  Gcd_insert_int ~> Gcd_insert
haftmann@62348
  1515
  of_int_int_eq ~> of_int_of_nat_eq
haftmann@62348
  1516
  lcm_least_nat ~> lcm_least
haftmann@62348
  1517
  lcm_least_int ~> lcm_least
haftmann@62348
  1518
  lcm_assoc_nat ~> lcm.assoc
haftmann@62348
  1519
  lcm_assoc_int ~> lcm.assoc
haftmann@62348
  1520
  int_le_0_conv ~> of_nat_le_0_iff
haftmann@62348
  1521
  int_eq_0_conv ~> of_nat_eq_0_iff
haftmann@62348
  1522
  Gcd_empty_nat ~> Gcd_empty
haftmann@62348
  1523
  Gcd_empty_int ~> Gcd_empty
haftmann@62348
  1524
  gcd_assoc_nat ~> gcd.assoc
haftmann@62348
  1525
  gcd_assoc_int ~> gcd.assoc
haftmann@62348
  1526
  zero_zle_int ~> of_nat_0_le_iff
haftmann@62348
  1527
  lcm_dvd2_nat ~> dvd_lcm2
haftmann@62348
  1528
  lcm_dvd2_int ~> dvd_lcm2
haftmann@62348
  1529
  lcm_dvd1_nat ~> dvd_lcm1
haftmann@62348
  1530
  lcm_dvd1_int ~> dvd_lcm1
haftmann@62348
  1531
  gcd_zero_nat ~> gcd_eq_0_iff
haftmann@62348
  1532
  gcd_zero_int ~> gcd_eq_0_iff
haftmann@62348
  1533
  gcd_dvd2_nat ~> gcd_dvd2
haftmann@62348
  1534
  gcd_dvd2_int ~> gcd_dvd2
haftmann@62348
  1535
  gcd_dvd1_nat ~> gcd_dvd1
haftmann@62348
  1536
  gcd_dvd1_int ~> gcd_dvd1
haftmann@62348
  1537
  int_numeral ~> of_nat_numeral
haftmann@62348
  1538
  lcm_ac_nat ~> ac_simps
haftmann@62348
  1539
  lcm_ac_int ~> ac_simps
haftmann@62348
  1540
  gcd_ac_nat ~> ac_simps
haftmann@62348
  1541
  gcd_ac_int ~> ac_simps
haftmann@62348
  1542
  abs_int_eq ~> abs_of_nat
haftmann@62348
  1543
  zless_int ~> of_nat_less_iff
haftmann@62348
  1544
  zdiff_int ~> of_nat_diff
haftmann@62348
  1545
  zadd_int ~> of_nat_add
haftmann@62348
  1546
  int_mult ~> of_nat_mult
haftmann@62348
  1547
  int_Suc ~> of_nat_Suc
haftmann@62348
  1548
  inj_int ~> inj_of_nat
haftmann@62348
  1549
  int_1 ~> of_nat_1
haftmann@62348
  1550
  int_0 ~> of_nat_0
haftmann@62353
  1551
  Lcm_empty_nat ~> Lcm_empty
haftmann@62353
  1552
  Lcm_empty_int ~> Lcm_empty
haftmann@62353
  1553
  Lcm_insert_nat ~> Lcm_insert
haftmann@62353
  1554
  Lcm_insert_int ~> Lcm_insert
haftmann@62353
  1555
  comp_fun_idem_gcd_nat ~> comp_fun_idem_gcd
haftmann@62353
  1556
  comp_fun_idem_gcd_int ~> comp_fun_idem_gcd
haftmann@62353
  1557
  comp_fun_idem_lcm_nat ~> comp_fun_idem_lcm
haftmann@62353
  1558
  comp_fun_idem_lcm_int ~> comp_fun_idem_lcm
haftmann@62353
  1559
  Lcm_eq_0 ~> Lcm_eq_0_I
haftmann@62353
  1560
  Lcm0_iff ~> Lcm_0_iff
haftmann@62353
  1561
  Lcm_dvd_int ~> Lcm_least
haftmann@62353
  1562
  divides_mult_nat ~> divides_mult
haftmann@62353
  1563
  divides_mult_int ~> divides_mult
haftmann@62353
  1564
  lcm_0_nat ~> lcm_0_right
haftmann@62353
  1565
  lcm_0_int ~> lcm_0_right
haftmann@62353
  1566
  lcm_0_left_nat ~> lcm_0_left
haftmann@62353
  1567
  lcm_0_left_int ~> lcm_0_left
haftmann@62353
  1568
  dvd_gcd_D1_nat ~> dvd_gcdD1
haftmann@62353
  1569
  dvd_gcd_D1_int ~> dvd_gcdD1
haftmann@62353
  1570
  dvd_gcd_D2_nat ~> dvd_gcdD2
haftmann@62353
  1571
  dvd_gcd_D2_int ~> dvd_gcdD2
haftmann@62353
  1572
  coprime_dvd_mult_iff_nat ~> coprime_dvd_mult_iff
haftmann@62353
  1573
  coprime_dvd_mult_iff_int ~> coprime_dvd_mult_iff
haftmann@62348
  1574
  realpow_minus_mult ~> power_minus_mult
haftmann@62348
  1575
  realpow_Suc_le_self ~> power_Suc_le_self
haftmann@62353
  1576
  dvd_Gcd, dvd_Gcd_nat, dvd_Gcd_int removed in favour of Gcd_greatest
haftmann@62347
  1577
INCOMPATIBILITY.
haftmann@62347
  1578
lp15@63967
  1579
* Renamed HOL/Quotient_Examples/FSet.thy to
wenzelm@63977
  1580
HOL/Quotient_Examples/Quotient_FSet.thy INCOMPATIBILITY.
wenzelm@63977
  1581
wenzelm@64390
  1582
* Session HOL-Library: theory FinFun bundles "finfun_syntax" and
wenzelm@64390
  1583
"no_finfun_syntax" allow to control optional syntax in local contexts;
wenzelm@64390
  1584
this supersedes former theory FinFun_Syntax. INCOMPATIBILITY, e.g. use
wenzelm@64390
  1585
"unbundle finfun_syntax" to imitate import of
wenzelm@64390
  1586
"~~/src/HOL/Library/FinFun_Syntax".
wenzelm@64390
  1587
wenzelm@64390
  1588
* Session HOL-Library: theory Multiset_Permutations (executably) defines
wenzelm@64390
  1589
the set of permutations of a given set or multiset, i.e. the set of all
wenzelm@64390
  1590
lists that contain every element of the carrier (multi-)set exactly
wenzelm@64390
  1591
once.
wenzelm@64390
  1592
wenzelm@64390
  1593
* Session HOL-Library: multiset membership is now expressed using
wenzelm@64390
  1594
set_mset rather than count.
wenzelm@64390
  1595
wenzelm@64390
  1596
  - Expressions "count M a > 0" and similar simplify to membership
wenzelm@64390
  1597
    by default.
wenzelm@64390
  1598
wenzelm@64390
  1599
  - Converting between "count M a = 0" and non-membership happens using
wenzelm@64390
  1600
    equations count_eq_zero_iff and not_in_iff.
wenzelm@64390
  1601
wenzelm@64390
  1602
  - Rules count_inI and in_countE obtain facts of the form
wenzelm@64390
  1603
    "count M a = n" from membership.
wenzelm@64390
  1604
wenzelm@64390
  1605
  - Rules count_in_diffI and in_diff_countE obtain facts of the form
wenzelm@64390
  1606
    "count M a = n + count N a" from membership on difference sets.
wenzelm@64390
  1607
wenzelm@64390
  1608
INCOMPATIBILITY.
wenzelm@64390
  1609
wenzelm@64390
  1610
* Session HOL-Library: theory LaTeXsugar uses new-style "dummy_pats" for
wenzelm@64390
  1611
displaying equations in functional programming style --- variables
wenzelm@64390
  1612
present on the left-hand but not on the righ-hand side are replaced by
wenzelm@64390
  1613
underscores.
wenzelm@64390
  1614
wenzelm@64390
  1615
* Session HOL-Library: theory Combinator_PER provides combinator to
wenzelm@64390
  1616
build partial equivalence relations from a predicate and an equivalence
wenzelm@64390
  1617
relation.
wenzelm@64390
  1618
wenzelm@64390
  1619
* Session HOL-Library: theory Perm provides basic facts about almost
wenzelm@64390
  1620
everywhere fix bijections.
wenzelm@64390
  1621
wenzelm@64390
  1622
* Session HOL-Library: theory Normalized_Fraction allows viewing an
wenzelm@64390
  1623
element of a field of fractions as a normalized fraction (i.e. a pair of
wenzelm@64390
  1624
numerator and denominator such that the two are coprime and the
wenzelm@64390
  1625
denominator is normalized wrt. unit factors).
wenzelm@64390
  1626
wenzelm@64390
  1627
* Session HOL-NSA has been renamed to HOL-Nonstandard_Analysis.
wenzelm@64390
  1628
wenzelm@64390
  1629
* Session HOL-Multivariate_Analysis has been renamed to HOL-Analysis.
wenzelm@64390
  1630
wenzelm@64390
  1631
* Session HOL-Analysis: measure theory has been moved here from
wenzelm@64390
  1632
HOL-Probability. When importing HOL-Analysis some theorems need
wenzelm@64390
  1633
additional name spaces prefixes due to name clashes. INCOMPATIBILITY.
wenzelm@64390
  1634
wenzelm@64390
  1635
* Session HOL-Analysis: more complex analysis including Cauchy's
wenzelm@64390
  1636
inequality, Liouville theorem, open mapping theorem, maximum modulus
wenzelm@64390
  1637
principle, Residue theorem, Schwarz Lemma.
wenzelm@64390
  1638
wenzelm@64390
  1639
* Session HOL-Analysis: Theory of polyhedra: faces, extreme points,
wenzelm@64390
  1640
polytopes, and the Krein–Milman Minkowski theorem.
wenzelm@64390
  1641
wenzelm@64390
  1642
* Session HOL-Analysis: Numerous results ported from the HOL Light
wenzelm@64390
  1643
libraries: homeomorphisms, continuous function extensions, invariance of
wenzelm@64390
  1644
domain.
wenzelm@64390
  1645
wenzelm@64390
  1646
* Session HOL-Probability: the type of emeasure and nn_integral was
wenzelm@64390
  1647
changed from ereal to ennreal, INCOMPATIBILITY.
wenzelm@64390
  1648
wenzelm@64390
  1649
  emeasure :: 'a measure \<Rightarrow> 'a set \<Rightarrow> ennreal
wenzelm@64390
  1650
  nn_integral :: 'a measure \<Rightarrow> ('a \<Rightarrow> ennreal) \<Rightarrow> ennreal
wenzelm@64390
  1651
wenzelm@64390
  1652
* Session HOL-Probability: Code generation and QuickCheck for
wenzelm@64390
  1653
Probability Mass Functions.
wenzelm@64390
  1654
wenzelm@64390
  1655
* Session HOL-Probability: theory Random_Permutations contains some
wenzelm@64390
  1656
theory about choosing a permutation of a set uniformly at random and
wenzelm@64390
  1657
folding over a list in random order.
wenzelm@64390
  1658
wenzelm@64390
  1659
* Session HOL-Probability: theory SPMF formalises discrete
wenzelm@64390
  1660
subprobability distributions.
wenzelm@64390
  1661
wenzelm@64390
  1662
* Session HOL-Library: the names of multiset theorems have been
wenzelm@64390
  1663
normalised to distinguish which ordering the theorems are about
wenzelm@64390
  1664
wenzelm@64390
  1665
    mset_less_eqI ~> mset_subset_eqI
wenzelm@64390
  1666
    mset_less_insertD ~> mset_subset_insertD
wenzelm@64390
  1667
    mset_less_eq_count ~> mset_subset_eq_count
wenzelm@64390
  1668
    mset_less_diff_self ~> mset_subset_diff_self
wenzelm@64390
  1669
    mset_le_exists_conv ~> mset_subset_eq_exists_conv
wenzelm@64390
  1670
    mset_le_mono_add_right_cancel ~> mset_subset_eq_mono_add_right_cancel
wenzelm@64390
  1671
    mset_le_mono_add_left_cancel ~> mset_subset_eq_mono_add_left_cancel
wenzelm@64390
  1672
    mset_le_mono_add ~> mset_subset_eq_mono_add
wenzelm@64390
  1673
    mset_le_add_left ~> mset_subset_eq_add_left
wenzelm@64390
  1674
    mset_le_add_right ~> mset_subset_eq_add_right
wenzelm@64390
  1675
    mset_le_single ~> mset_subset_eq_single
wenzelm@64390
  1676
    mset_le_multiset_union_diff_commute ~> mset_subset_eq_multiset_union_diff_commute
wenzelm@64390
  1677
    diff_le_self ~> diff_subset_eq_self
wenzelm@64390
  1678
    mset_leD ~> mset_subset_eqD
wenzelm@64390
  1679
    mset_lessD ~> mset_subsetD
wenzelm@64390
  1680
    mset_le_insertD ~> mset_subset_eq_insertD
wenzelm@64390
  1681
    mset_less_of_empty ~> mset_subset_of_empty
wenzelm@64390
  1682
    mset_less_size ~> mset_subset_size
wenzelm@64390
  1683
    wf_less_mset_rel ~> wf_subset_mset_rel
wenzelm@64390
  1684
    count_le_replicate_mset_le ~> count_le_replicate_mset_subset_eq
wenzelm@64390
  1685
    mset_remdups_le ~> mset_remdups_subset_eq
wenzelm@64390
  1686
    ms_lesseq_impl ~> subset_eq_mset_impl
wenzelm@64390
  1687
wenzelm@64390
  1688
Some functions have been renamed:
wenzelm@64390
  1689
    ms_lesseq_impl -> subset_eq_mset_impl
wenzelm@64390
  1690
wenzelm@64390
  1691
* HOL-Library: multisets are now ordered with the multiset ordering
wenzelm@64390
  1692
    #\<subseteq># ~> \<le>
wenzelm@64390
  1693
    #\<subset># ~> <
wenzelm@64390
  1694
    le_multiset ~> less_eq_multiset
wenzelm@64390
  1695
    less_multiset ~> le_multiset
wenzelm@64390
  1696
INCOMPATIBILITY.
wenzelm@64390
  1697
wenzelm@64390
  1698
* Session HOL-Library: the prefix multiset_order has been discontinued:
wenzelm@64390
  1699
the theorems can be directly accessed. As a consequence, the lemmas
wenzelm@64390
  1700
"order_multiset" and "linorder_multiset" have been discontinued, and the
wenzelm@64390
  1701
interpretations "multiset_linorder" and "multiset_wellorder" have been
wenzelm@64390
  1702
replaced by instantiations. INCOMPATIBILITY.
wenzelm@64390
  1703
wenzelm@64390
  1704
* Session HOL-Library: some theorems about the multiset ordering have
wenzelm@64390
  1705
been renamed:
wenzelm@64390
  1706
wenzelm@64390
  1707
    le_multiset_def ~> less_eq_multiset_def
wenzelm@64390
  1708
    less_multiset_def ~> le_multiset_def
wenzelm@64390
  1709
    less_eq_imp_le_multiset ~> subset_eq_imp_le_multiset
wenzelm@64390
  1710
    mult_less_not_refl ~> mset_le_not_refl
wenzelm@64390
  1711
    mult_less_trans ~> mset_le_trans
wenzelm@64390
  1712
    mult_less_not_sym ~> mset_le_not_sym
wenzelm@64390
  1713
    mult_less_asym ~> mset_le_asym
wenzelm@64390
  1714
    mult_less_irrefl ~> mset_le_irrefl
wenzelm@64390
  1715
    union_less_mono2{,1,2} ~> union_le_mono2{,1,2}
wenzelm@64390
  1716
wenzelm@64390
  1717
    le_multiset\<^sub>H\<^sub>O ~> less_eq_multiset\<^sub>H\<^sub>O
wenzelm@64390
  1718
    le_multiset_total ~> less_eq_multiset_total
wenzelm@64390
  1719
    less_multiset_right_total ~> subset_eq_imp_le_multiset
wenzelm@64390
  1720
    le_multiset_empty_left ~> less_eq_multiset_empty_left
wenzelm@64390
  1721
    le_multiset_empty_right ~> less_eq_multiset_empty_right
wenzelm@64390
  1722
    less_multiset_empty_right ~> le_multiset_empty_left
wenzelm@64390
  1723
    less_multiset_empty_left ~> le_multiset_empty_right
wenzelm@64390
  1724
    union_less_diff_plus ~> union_le_diff_plus
wenzelm@64390
  1725
    ex_gt_count_imp_less_multiset ~> ex_gt_count_imp_le_multiset
wenzelm@64390
  1726
    less_multiset_plus_left_nonempty ~> le_multiset_plus_left_nonempty
wenzelm@64390
  1727
    le_multiset_plus_right_nonempty ~> le_multiset_plus_right_nonempty
wenzelm@64390
  1728
INCOMPATIBILITY.
wenzelm@64390
  1729
wenzelm@64390
  1730
* Session HOL-Library: the lemma mset_map has now the attribute [simp].
wenzelm@64390
  1731
INCOMPATIBILITY.
wenzelm@64390
  1732
wenzelm@64390
  1733
* Session HOL-Library: some theorems about multisets have been removed.
wenzelm@64390
  1734
INCOMPATIBILITY, use the following replacements:
wenzelm@64390
  1735
wenzelm@64390
  1736
    le_multiset_plus_plus_left_iff ~> add_less_cancel_right
wenzelm@64390
  1737
    less_multiset_plus_plus_left_iff ~> add_less_cancel_right
wenzelm@64390
  1738
    le_multiset_plus_plus_right_iff ~> add_less_cancel_left
wenzelm@64390
  1739
    less_multiset_plus_plus_right_iff ~> add_less_cancel_left
wenzelm@64390
  1740
    add_eq_self_empty_iff ~> add_cancel_left_right
wenzelm@64390
  1741
    mset_subset_add_bothsides ~> subset_mset.add_less_cancel_right
wenzelm@64390
  1742
    mset_less_add_bothsides ~> subset_mset.add_less_cancel_right
wenzelm@64390
  1743
    mset_le_add_bothsides ~> subset_mset.add_less_cancel_right
wenzelm@64390
  1744
    empty_inter ~> subset_mset.inf_bot_left
wenzelm@64390
  1745
    inter_empty ~> subset_mset.inf_bot_right
wenzelm@64390
  1746
    empty_sup ~> subset_mset.sup_bot_left
wenzelm@64390
  1747
    sup_empty ~> subset_mset.sup_bot_right
wenzelm@64390
  1748
    bdd_below_multiset ~> subset_mset.bdd_above_bot
wenzelm@64390
  1749
    subset_eq_empty ~> subset_mset.le_zero_eq
wenzelm@64390
  1750
    le_empty ~> subset_mset.le_zero_eq
wenzelm@64390
  1751
    mset_subset_empty_nonempty ~> subset_mset.zero_less_iff_neq_zero
wenzelm@64390
  1752
    mset_less_empty_nonempty ~> subset_mset.zero_less_iff_neq_zero
wenzelm@64390
  1753
wenzelm@64390
  1754
* Session HOL-Library: some typeclass constraints about multisets have
wenzelm@64390
  1755
been reduced from ordered or linordered to preorder. Multisets have the
wenzelm@64390
  1756
additional typeclasses order_bot, no_top,
wenzelm@64390
  1757
ordered_ab_semigroup_add_imp_le, ordered_cancel_comm_monoid_add,
wenzelm@64390
  1758
linordered_cancel_ab_semigroup_add, and
wenzelm@64390
  1759
ordered_ab_semigroup_monoid_add_imp_le. INCOMPATIBILITY.
wenzelm@64390
  1760
wenzelm@64390
  1761
* Session HOL-Library: there are some new simplification rules about
wenzelm@64390
  1762
multisets, the multiset ordering, and the subset ordering on multisets.
wenzelm@64390
  1763
INCOMPATIBILITY.
wenzelm@64390
  1764
wenzelm@64390
  1765
* Session HOL-Library: the subset ordering on multisets has now the
wenzelm@64390
  1766
interpretations ordered_ab_semigroup_monoid_add_imp_le and
wenzelm@64390
  1767
bounded_lattice_bot. INCOMPATIBILITY.
wenzelm@64390
  1768
wenzelm@64390
  1769
* Session HOL-Library, theory Multiset: single has been removed in favor
wenzelm@64390
  1770
of add_mset that roughly corresponds to Set.insert. Some theorems have
wenzelm@64390
  1771
removed or changed:
wenzelm@64390
  1772
wenzelm@64390
  1773
  single_not_empty ~> add_mset_not_empty or empty_not_add_mset
wenzelm@64390
  1774
  fold_mset_insert ~> fold_mset_add_mset
wenzelm@64390
  1775
  image_mset_insert ~> image_mset_add_mset
wenzelm@64390
  1776
  union_single_eq_diff
wenzelm@64390
  1777
  multi_self_add_other_not_self
wenzelm@64390
  1778
  diff_single_eq_union
wenzelm@64390
  1779
INCOMPATIBILITY.
wenzelm@64390
  1780
wenzelm@64390
  1781
* Session HOL-Library, theory Multiset: some theorems have been changed
wenzelm@64390
  1782
to use add_mset instead of single:
wenzelm@64390
  1783
wenzelm@64390
  1784
  mset_add
wenzelm@64390
  1785
  multi_self_add_other_not_self
wenzelm@64390
  1786
  diff_single_eq_union
wenzelm@64390
  1787
  union_single_eq_diff
wenzelm@64390
  1788
  union_single_eq_member
wenzelm@64390
  1789
  add_eq_conv_diff
wenzelm@64390
  1790
  insert_noteq_member
wenzelm@64390
  1791
  add_eq_conv_ex
wenzelm@64390
  1792
  multi_member_split
wenzelm@64390
  1793
  multiset_add_sub_el_shuffle
wenzelm@64390
  1794
  mset_subset_eq_insertD
wenzelm@64390
  1795
  mset_subset_insertD
wenzelm@64390
  1796
  insert_subset_eq_iff
wenzelm@64390
  1797
  insert_union_subset_iff
wenzelm@64390
  1798
  multi_psub_of_add_self
wenzelm@64390
  1799
  inter_add_left1
wenzelm@64390
  1800
  inter_add_left2
wenzelm@64390
  1801
  inter_add_right1
wenzelm@64390
  1802
  inter_add_right2
wenzelm@64390
  1803
  sup_union_left1
wenzelm@64390
  1804
  sup_union_left2
wenzelm@64390
  1805
  sup_union_right1
wenzelm@64390
  1806
  sup_union_right2
wenzelm@64390
  1807
  size_eq_Suc_imp_eq_union
wenzelm@64390
  1808
  multi_nonempty_split
wenzelm@64390
  1809
  mset_insort
wenzelm@64390
  1810
  mset_update
wenzelm@64390
  1811
  mult1I
wenzelm@64390
  1812
  less_add
wenzelm@64390
  1813
  mset_zip_take_Cons_drop_twice
wenzelm@64390
  1814
  rel_mset_Zero
wenzelm@64390
  1815
  msed_map_invL
wenzelm@64390
  1816
  msed_map_invR
wenzelm@64390
  1817
  msed_rel_invL
wenzelm@64390
  1818
  msed_rel_invR
wenzelm@64390
  1819
  le_multiset_right_total
wenzelm@64390
  1820
  multiset_induct
wenzelm@64390
  1821
  multiset_induct2_size
wenzelm@64390
  1822
  multiset_induct2
wenzelm@64390
  1823
INCOMPATIBILITY.
wenzelm@64390
  1824
wenzelm@64390
  1825
* Session HOL-Library, theory Multiset: the definitions of some
wenzelm@64390
  1826
constants have changed to use add_mset instead of adding a single
wenzelm@64390
  1827
element:
wenzelm@64390
  1828
wenzelm@64390
  1829
  image_mset
wenzelm@64390
  1830
  mset
wenzelm@64390
  1831
  replicate_mset
wenzelm@64390
  1832
  mult1
wenzelm@64390
  1833
  pred_mset
wenzelm@64390
  1834
  rel_mset'
wenzelm@64390
  1835
  mset_insort
wenzelm@64390
  1836
wenzelm@64390
  1837
INCOMPATIBILITY.
wenzelm@64390
  1838
wenzelm@64390
  1839
* Session HOL-Library, theory Multiset: due to the above changes, the
wenzelm@64390
  1840
attributes of some multiset theorems have been changed:
wenzelm@64390
  1841
wenzelm@64390
  1842
  insert_DiffM  [] ~> [simp]
wenzelm@64390
  1843
  insert_DiffM2 [simp] ~> []
wenzelm@64390
  1844
  diff_add_mset_swap [simp]
wenzelm@64390
  1845
  fold_mset_add_mset [simp]
wenzelm@64390
  1846
  diff_diff_add [simp] (for multisets only)
wenzelm@64390
  1847
  diff_cancel [simp] ~> []
wenzelm@64390
  1848
  count_single [simp] ~> []
wenzelm@64390
  1849
  set_mset_single [simp] ~> []
wenzelm@64390
  1850
  size_multiset_single [simp] ~> []
wenzelm@64390
  1851
  size_single [simp] ~> []
wenzelm@64390
  1852
  image_mset_single [simp] ~> []
wenzelm@64390
  1853
  mset_subset_eq_mono_add_right_cancel [simp] ~> []
wenzelm@64390
  1854
  mset_subset_eq_mono_add_left_cancel [simp] ~> []
wenzelm@64390
  1855
  fold_mset_single [simp] ~> []
wenzelm@64390
  1856
  subset_eq_empty [simp] ~> []
wenzelm@64390
  1857
  empty_sup [simp] ~> []
wenzelm@64390
  1858
  sup_empty [simp] ~> []
wenzelm@64390
  1859
  inter_empty [simp] ~> []
wenzelm@64390
  1860
  empty_inter [simp] ~> []
wenzelm@64390
  1861
INCOMPATIBILITY.
wenzelm@64390
  1862
wenzelm@64391
  1863
* Session HOL-Library, theory Multiset: the order of the variables in
wenzelm@64390
  1864
the second cases of multiset_induct, multiset_induct2_size,
wenzelm@64390
  1865
multiset_induct2 has been changed (e.g. Add A a ~> Add a A).
wenzelm@64390
  1866
INCOMPATIBILITY.
wenzelm@64390
  1867
wenzelm@64390
  1868
* Session HOL-Library, theory Multiset: there is now a simplification
wenzelm@64390
  1869
procedure on multisets. It mimics the behavior of the procedure on
wenzelm@64390
  1870
natural numbers. INCOMPATIBILITY.
wenzelm@64390
  1871
wenzelm@64390
  1872
* Session HOL-Library, theory Multiset: renamed sums and products of
wenzelm@64390
  1873
multisets:
wenzelm@64390
  1874
wenzelm@64390
  1875
  msetsum ~> sum_mset
wenzelm@64390
  1876
  msetprod ~> prod_mset
wenzelm@64390
  1877
wenzelm@64390
  1878
* Session HOL-Library, theory Multiset: the notation for intersection
wenzelm@64390
  1879
and union of multisets have been changed:
wenzelm@64390
  1880
wenzelm@64390
  1881
  #\<inter> ~> \<inter>#
wenzelm@64390
  1882
  #\<union> ~> \<union>#
wenzelm@64390
  1883
wenzelm@64390
  1884
INCOMPATIBILITY.
wenzelm@64390
  1885
wenzelm@64390
  1886
* Session HOL-Library, theory Multiset: the lemma
wenzelm@64390
  1887
one_step_implies_mult_aux on multisets has been removed, use
wenzelm@64390
  1888
one_step_implies_mult instead. INCOMPATIBILITY.
wenzelm@64390
  1889
wenzelm@64390
  1890
* Session HOL-Library: theory Complete_Partial_Order2 provides reasoning
wenzelm@64390
  1891
support for monotonicity and continuity in chain-complete partial orders
wenzelm@64390
  1892
and about admissibility conditions for fixpoint inductions.
wenzelm@64390
  1893
haftmann@64523
  1894
* Session HOL-Library: theory Library/Polynomial contains also
haftmann@64523
  1895
derivation of polynomials (formerly in Library/Poly_Deriv) but not
haftmann@64523
  1896
gcd/lcm on polynomials over fields. This has been moved to a separate
haftmann@64523
  1897
theory Library/Polynomial_GCD_euclidean.thy, to pave way for a possible
haftmann@64523
  1898
future different type class instantiation for polynomials over factorial
haftmann@64523
  1899
rings. INCOMPATIBILITY.
wenzelm@64390
  1900
wenzelm@64390
  1901
* Session HOL-Library: theory Sublist provides function "prefixes" with
wenzelm@64390
  1902
the following renaming
wenzelm@64390
  1903
wenzelm@64390
  1904
  prefixeq -> prefix
wenzelm@64390
  1905
  prefix -> strict_prefix
wenzelm@64390
  1906
  suffixeq -> suffix
wenzelm@64390
  1907
  suffix -> strict_suffix
wenzelm@64390
  1908
wenzelm@64390
  1909
Added theory of longest common prefixes.
blanchet@64389
  1910
wenzelm@64391
  1911
* Session HOL-Number_Theory: algebraic foundation for primes:
wenzelm@64391
  1912
Generalisation of predicate "prime" and introduction of predicates
wenzelm@64391
  1913
"prime_elem", "irreducible", a "prime_factorization" function, and the
wenzelm@64391
  1914
"factorial_ring" typeclass with instance proofs for nat, int, poly. Some
wenzelm@64391
  1915
theorems now have different names, most notably "prime_def" is now
wenzelm@64391
  1916
"prime_nat_iff". INCOMPATIBILITY.
wenzelm@64391
  1917
wenzelm@64391
  1918
* Session Old_Number_Theory has been removed, after porting remaining
wenzelm@64391
  1919
theories.
wenzelm@64391
  1920
wenzelm@64551
  1921
* Session HOL-Types_To_Sets provides an experimental extension of
wenzelm@64551
  1922
Higher-Order Logic to allow translation of types to sets.
wenzelm@64551
  1923
wenzelm@63198
  1924
wenzelm@62498
  1925
*** ML ***
wenzelm@62498
  1926
wenzelm@63227
  1927
* Integer.gcd and Integer.lcm use efficient operations from the Poly/ML
wenzelm@63228
  1928
library (notably for big integers). Subtle change of semantics:
wenzelm@63228
  1929
Integer.gcd and Integer.lcm both normalize the sign, results are never
wenzelm@63228
  1930
negative. This coincides with the definitions in HOL/GCD.thy.
wenzelm@63228
  1931
INCOMPATIBILITY.
wenzelm@63227
  1932
wenzelm@63212
  1933
* Structure Rat for rational numbers is now an integral part of
wenzelm@63215
  1934
Isabelle/ML, with special notation @int/nat or @int for numerals (an
wenzelm@63215
  1935
abbreviation for antiquotation @{Pure.rat argument}) and ML pretty
wenzelm@63212
  1936
printing. Standard operations on type Rat.rat are provided via ad-hoc
wenzelm@63215
  1937
overloading of + - * / < <= > >= ~ abs. INCOMPATIBILITY, need to
wenzelm@63212
  1938
use + instead of +/ etc. Moreover, exception Rat.DIVZERO has been
wenzelm@63212
  1939
superseded by General.Div.
wenzelm@63198
  1940
wenzelm@64390
  1941
* ML antiquotation @{path} is superseded by @{file}, which ensures that
wenzelm@64390
  1942
the argument is a plain file. Minor INCOMPATIBILITY.
wenzelm@64390
  1943
wenzelm@64390
  1944
* Antiquotation @{make_string} is available during Pure bootstrap --
wenzelm@64390
  1945
with approximative output quality.
wenzelm@64390
  1946
wenzelm@64390
  1947
* Low-level ML system structures (like PolyML and RunCall) are no longer
wenzelm@64390
  1948
exposed to Isabelle/ML user-space. Potential INCOMPATIBILITY.
wenzelm@64390
  1949
wenzelm@62861
  1950
* The ML function "ML" provides easy access to run-time compilation.
wenzelm@62861
  1951
This is particularly useful for conditional compilation, without
wenzelm@62861
  1952
requiring separate files.
wenzelm@62861
  1953
wenzelm@62498
  1954
* Option ML_exception_debugger controls detailed exception trace via the
wenzelm@62498
  1955
Poly/ML debugger. Relevant ML modules need to be compiled beforehand
wenzelm@62498
  1956
with ML_file_debug, or with ML_file and option ML_debugger enabled. Note
wenzelm@62498
  1957
debugger information requires consirable time and space: main
wenzelm@62498
  1958
Isabelle/HOL with full debugger support may need ML_system_64.
wenzelm@62498
  1959
wenzelm@62514
  1960
* Local_Theory.restore has been renamed to Local_Theory.reset to
wenzelm@62514
  1961
emphasize its disruptive impact on the cumulative context, notably the
wenzelm@62514
  1962
scope of 'private' or 'qualified' names. Note that Local_Theory.reset is
wenzelm@62514
  1963
only appropriate when targets are managed, e.g. starting from a global
wenzelm@62514
  1964
theory and returning to it. Regular definitional packages should use
wenzelm@62514
  1965
balanced blocks of Local_Theory.open_target versus
wenzelm@62514
  1966
Local_Theory.close_target instead. Rare INCOMPATIBILITY.
wenzelm@62514
  1967
wenzelm@62519
  1968
* Structure TimeLimit (originally from the SML/NJ library) has been
wenzelm@62519
  1969
replaced by structure Timeout, with slightly different signature.
wenzelm@62519
  1970
INCOMPATIBILITY.
wenzelm@62519
  1971
wenzelm@62551
  1972
* Discontinued cd and pwd operations, which are not well-defined in a
wenzelm@62551
  1973
multi-threaded environment. Note that files are usually located
wenzelm@62551
  1974
relatively to the master directory of a theory (see also
wenzelm@62551
  1975
File.full_path). Potential INCOMPATIBILITY.
wenzelm@62551
  1976
wenzelm@63352
  1977
* Binding.empty_atts supersedes Thm.empty_binding and
wenzelm@63352
  1978
Attrib.empty_binding. Minor INCOMPATIBILITY.
wenzelm@63352
  1979
wenzelm@62498
  1980
wenzelm@62354
  1981
*** System ***
wenzelm@62354
  1982
wenzelm@64390
  1983
* SML/NJ and old versions of Poly/ML are no longer supported.
wenzelm@64390
  1984
wenzelm@64390
  1985
* Poly/ML heaps now follow the hierarchy of sessions, and thus require
wenzelm@64390
  1986
much less disk space.
wenzelm@63226
  1987
wenzelm@62591
  1988
* The Isabelle ML process is now managed directly by Isabelle/Scala, and
wenzelm@62591
  1989
shell scripts merely provide optional command-line access. In
wenzelm@62591
  1990
particular:
wenzelm@62591
  1991
wenzelm@62591
  1992
  . Scala module ML_Process to connect to the raw ML process,
wenzelm@62591
  1993
    with interaction via stdin/stdout/stderr or in batch mode;
wenzelm@62591
  1994
  . command-line tool "isabelle console" as interactive wrapper;
wenzelm@62591
  1995
  . command-line tool "isabelle process" as batch mode wrapper.
wenzelm@62588
  1996
wenzelm@62588
  1997
* The executable "isabelle_process" has been discontinued. Tools and
wenzelm@62588
  1998
prover front-ends should use ML_Process or Isabelle_Process in
wenzelm@62591
  1999
Isabelle/Scala. INCOMPATIBILITY.
wenzelm@62588
  2000
wenzelm@62588
  2001
* New command-line tool "isabelle process" supports ML evaluation of
wenzelm@62588
  2002
literal expressions (option -e) or files (option -f) in the context of a
wenzelm@62588
  2003
given heap image. Errors lead to premature exit of the ML process with
wenzelm@62588
  2004
return code 1.
wenzelm@62588
  2005
wenzelm@64390
  2006
* The command-line tool "isabelle build" supports option -N for cyclic
wenzelm@64390
  2007
shuffling of NUMA CPU nodes. This may help performance tuning on Linux
wenzelm@64390
  2008
servers with separate CPU/memory modules.
wenzelm@64390
  2009
wenzelm@64390
  2010
* System option "threads" (for the size of the Isabelle/ML thread farm)
wenzelm@64390
  2011
is also passed to the underlying ML runtime system as --gcthreads,
wenzelm@64274
  2012
unless there is already a default provided via ML_OPTIONS settings.
wenzelm@64274
  2013
wenzelm@63827
  2014
* System option "checkpoint" helps to fine-tune the global heap space
wenzelm@63827
  2015
management of isabelle build. This is relevant for big sessions that may
wenzelm@63827
  2016
exhaust the small 32-bit address space of the ML process (which is used
wenzelm@63827
  2017
by default).
wenzelm@63827
  2018
wenzelm@64308
  2019
* System option "profiling" specifies the mode for global ML profiling
wenzelm@64342
  2020
in "isabelle build". Possible values are "time", "allocations". The
wenzelm@64342
  2021
command-line tool "isabelle profiling_report" helps to digest the
wenzelm@64342
  2022
resulting log files.
wenzelm@64308
  2023
wenzelm@63986
  2024
* System option "ML_process_policy" specifies an optional command prefix
wenzelm@63986
  2025
for the underlying ML process, e.g. to control CPU affinity on
wenzelm@63987
  2026
multiprocessor systems. The "isabelle jedit" tool allows to override the
wenzelm@63987
  2027
implicit default via option -p.
wenzelm@63986
  2028
wenzelm@64390
  2029
* Command-line tool "isabelle console" provides option -r to help to
wenzelm@64390
  2030
bootstrapping Isabelle/Pure interactively.
wenzelm@64390
  2031
wenzelm@64390
  2032
* Command-line tool "isabelle yxml" has been discontinued.
wenzelm@64390
  2033
INCOMPATIBILITY, use operations from the modules "XML" and "YXML" in
wenzelm@64390
  2034
Isabelle/ML or Isabelle/Scala.
wenzelm@64390
  2035
wenzelm@64390
  2036
* Many Isabelle tools that require a Java runtime system refer to the
wenzelm@64390
  2037
settings ISABELLE_TOOL_JAVA_OPTIONS32 / ISABELLE_TOOL_JAVA_OPTIONS64,
wenzelm@64390
  2038
depending on the underlying platform. The settings for "isabelle build"
wenzelm@64390
  2039
ISABELLE_BUILD_JAVA_OPTIONS32 / ISABELLE_BUILD_JAVA_OPTIONS64 have been
wenzelm@64390
  2040
discontinued. Potential INCOMPATIBILITY.
wenzelm@64390
  2041
wenzelm@64390
  2042
* The Isabelle system environment always ensures that the main
wenzelm@64390
  2043
executables are found within the shell search $PATH: "isabelle" and
wenzelm@64390
  2044
"isabelle_scala_script".
wenzelm@64390
  2045
wenzelm@64390
  2046
* Isabelle tools may consist of .scala files: the Scala compiler is
wenzelm@64390
  2047
invoked on the spot. The source needs to define some object that extends
wenzelm@64390
  2048
Isabelle_Tool.Body.
wenzelm@64390
  2049
wenzelm@64390
  2050
* File.bash_string, File.bash_path etc. represent Isabelle/ML and
wenzelm@64390
  2051
Isabelle/Scala strings authentically within GNU bash. This is useful to
wenzelm@64390
  2052
produce robust shell scripts under program control, without worrying
wenzelm@64390
  2053
about spaces or special characters. Note that user output works via
wenzelm@64390
  2054
Path.print (ML) or Path.toString (Scala). INCOMPATIBILITY, the old (and
wenzelm@64390
  2055
less versatile) operations File.shell_quote, File.shell_path etc. have
wenzelm@64390
  2056
been discontinued.
wenzelm@64390
  2057
wenzelm@63995
  2058
* The isabelle_java executable allows to run a Java process within the
wenzelm@63995
  2059
name space of Java and Scala components that are bundled with Isabelle,
wenzelm@63995
  2060
but without the Isabelle settings environment.
wenzelm@63995
  2061
wenzelm@64390
  2062
* Isabelle/Scala: the SSH module supports ssh and sftp connections, for
wenzelm@64390
  2063
remote command-execution and file-system access. This resembles
wenzelm@64390
  2064
operations from module File and Isabelle_System to some extent. Note
wenzelm@64390
  2065
that Path specifications need to be resolved remotely via
wenzelm@64390
  2066
ssh.remote_path instead of File.standard_path: the implicit process
wenzelm@64390
  2067
environment is different, Isabelle settings are not available remotely.
wenzelm@64390
  2068
wenzelm@64390
  2069
* Isabelle/Scala: the Mercurial module supports repositories via the
wenzelm@64390
  2070
regular hg command-line interface. The repositroy clone and working
wenzelm@64390
  2071
directory may reside on a local or remote file-system (via ssh
wenzelm@64390
  2072
connection).
wenzelm@64265
  2073
wenzelm@62354
  2074
wenzelm@62354
  2075
wenzelm@62031
  2076
New in Isabelle2016 (February 2016)
wenzelm@62016
  2077
-----------------------------------
wenzelm@60138
  2078
wenzelm@61337
  2079
*** General ***
wenzelm@61337
  2080
wenzelm@62168
  2081
* Eisbach is now based on Pure instead of HOL. Objects-logics may import
wenzelm@62168
  2082
either the theory ~~/src/HOL/Eisbach/Eisbach (for HOL etc.) or
wenzelm@62168
  2083
~~/src/HOL/Eisbach/Eisbach_Old_Appl_Syntax (for FOL, ZF etc.). Note that
wenzelm@62168
  2084
the HOL-Eisbach session located in ~~/src/HOL/Eisbach/ contains further
wenzelm@62168
  2085
examples that do require HOL.
wenzelm@62168
  2086
wenzelm@62157
  2087
* Better resource usage on all platforms (Linux, Windows, Mac OS X) for
wenzelm@62157
  2088
both Isabelle/ML and Isabelle/Scala.  Slightly reduced heap space usage.
wenzelm@62157
  2089
wenzelm@62017
  2090
* Former "xsymbols" syntax with Isabelle symbols is used by default,
wenzelm@62017
  2091
without any special print mode. Important ASCII replacement syntax
wenzelm@62017
  2092
remains available under print mode "ASCII", but less important syntax
wenzelm@62017
  2093
has been removed (see below).
wenzelm@62017
  2094
wenzelm@62109
  2095
* Support for more arrow symbols, with rendering in LaTeX and Isabelle
wenzelm@62109
  2096
fonts: \<Lleftarrow> \<Rrightarrow> \<longlongleftarrow> \<longlongrightarrow> \<longlonglongleftarrow> \<longlonglongrightarrow>.
wenzelm@62017
  2097
wenzelm@62108
  2098
* Special notation \<struct> for the first implicit 'structure' in the
wenzelm@62108
  2099
context has been discontinued. Rare INCOMPATIBILITY, use explicit
wenzelm@62108
  2100
structure name instead, notably in indexed notation with block-subscript
wenzelm@62108
  2101
(e.g. \<odot>\<^bsub>A\<^esub>).
wenzelm@62108
  2102
wenzelm@62108
  2103
* The glyph for \<diamond> in the IsabelleText font now corresponds better to its
wenzelm@62108
  2104
counterpart \<box> as quantifier-like symbol. A small diamond is available as
wenzelm@62108
  2105
\<diamondop>; the old symbol \<struct> loses this rendering and any special
wenzelm@62108
  2106
meaning.
wenzelm@62108
  2107
wenzelm@62017
  2108
* Syntax for formal comments "-- text" now also supports the symbolic
wenzelm@62017
  2109
form "\<comment> text". Command-line tool "isabelle update_cartouches -c" helps
wenzelm@62017
  2110
to update old sources.
wenzelm@62017
  2111
wenzelm@61337
  2112
* Toplevel theorem statements have been simplified as follows:
wenzelm@61337
  2113
wenzelm@61337
  2114
  theorems             ~>  lemmas
wenzelm@61337
  2115
  schematic_lemma      ~>  schematic_goal
wenzelm@61337
  2116
  schematic_theorem    ~>  schematic_goal
wenzelm@61337
  2117
  schematic_corollary  ~>  schematic_goal
wenzelm@61337
  2118
wenzelm@61337
  2119
Command-line tool "isabelle update_theorems" updates theory sources
wenzelm@61337
  2120
accordingly.
wenzelm@61337
  2121
wenzelm@61338
  2122
* Toplevel theorem statement 'proposition' is another alias for
wenzelm@61338
  2123
'theorem'.
wenzelm@61338
  2124
wenzelm@62169
  2125
* The old 'defs' command has been removed (legacy since Isabelle2014).
wenzelm@62169
  2126
INCOMPATIBILITY, use regular 'definition' instead. Overloaded and/or
wenzelm@62169
  2127
deferred definitions require a surrounding 'overloading' block.
wenzelm@62169
  2128
wenzelm@61337
  2129
wenzelm@60610
  2130
*** Prover IDE -- Isabelle/Scala/jEdit ***
wenzelm@60610
  2131
wenzelm@60986
  2132
* IDE support for the source-level debugger of Poly/ML, to work with
wenzelm@62253
  2133
Isabelle/ML and official Standard ML. Option "ML_debugger" and commands
wenzelm@62253
  2134
'ML_file_debug', 'ML_file_no_debug', 'SML_file_debug',
wenzelm@62253
  2135
'SML_file_no_debug' control compilation of sources with or without
wenzelm@62253
  2136
debugging information. The Debugger panel allows to set breakpoints (via
wenzelm@62253
  2137
context menu), step through stopped threads, evaluate local ML
wenzelm@62253
  2138
expressions etc. At least one Debugger view needs to be active to have
wenzelm@62253
  2139
any effect on the running ML program.
wenzelm@60984
  2140
wenzelm@61804
  2141
* The State panel manages explicit proof state output, with dynamic
wenzelm@61804
  2142
auto-update according to cursor movement. Alternatively, the jEdit
wenzelm@61804
  2143
action "isabelle.update-state" (shortcut S+ENTER) triggers manual
wenzelm@61804
  2144
update.
wenzelm@61729
  2145
wenzelm@61729
  2146
* The Output panel no longer shows proof state output by default, to
wenzelm@61729
  2147
avoid GUI overcrowding. INCOMPATIBILITY, use the State panel instead or
wenzelm@61729
  2148
enable option "editor_output_state".
wenzelm@61215
  2149
wenzelm@61804
  2150
* The text overview column (status of errors, warnings etc.) is updated
wenzelm@61804
  2151
asynchronously, leading to much better editor reactivity. Moreover, the
wenzelm@61804
  2152
full document node content is taken into account. The width of the
wenzelm@61804
  2153
column is scaled according to the main text area font, for improved
wenzelm@61804
  2154
visibility.
wenzelm@61804
  2155
wenzelm@61804
  2156
* The main text area no longer changes its color hue in outdated
wenzelm@61804
  2157
situations. The text overview column takes over the role to indicate
wenzelm@61804
  2158
unfinished edits in the PIDE pipeline. This avoids flashing text display
wenzelm@61804
  2159
due to ad-hoc updates by auxiliary GUI components, such as the State
wenzelm@61804
  2160
panel.
wenzelm@61804
  2161
wenzelm@62254
  2162
* Slightly improved scheduling for urgent print tasks (e.g. command
wenzelm@62254
  2163
state output, interactive queries) wrt. long-running background tasks.
wenzelm@62017
  2164
wenzelm@62017
  2165
* Completion of symbols via prefix of \<name> or \<^name> or \name is
wenzelm@62017
  2166
always possible, independently of the language context. It is never
wenzelm@62017
  2167
implicit: a popup will show up unconditionally.
wenzelm@62017
  2168
wenzelm@62017
  2169
* Additional abbreviations for syntactic completion may be specified in
wenzelm@62017
  2170
$ISABELLE_HOME/etc/abbrevs and $ISABELLE_HOME_USER/etc/abbrevs, with
wenzelm@62017
  2171
support for simple templates using ASCII 007 (bell) as placeholder.
wenzelm@62017
  2172
wenzelm@62234
  2173
* Symbols \<oplus>, \<Oplus>, \<otimes>, \<Otimes>, \<odot>, \<Odot>, \<ominus>, \<oslash> no longer provide abbreviations for
wenzelm@62234
  2174
completion like "+o", "*o", ".o" etc. -- due to conflicts with other
wenzelm@62234
  2175
ASCII syntax. INCOMPATIBILITY, use plain backslash-completion or define
wenzelm@62234
  2176
suitable abbreviations in $ISABELLE_HOME_USER/etc/abbrevs.
wenzelm@62234
  2177
wenzelm@61483
  2178
* Action "isabelle-emph" (with keyboard shortcut C+e LEFT) controls
wenzelm@61483
  2179
emphasized text style; the effect is visible in document output, not in
wenzelm@61483
  2180
the editor.
wenzelm@61483
  2181
wenzelm@61483
  2182
* Action "isabelle-reset" now uses keyboard shortcut C+e BACK_SPACE,
wenzelm@61483
  2183
instead of former C+e LEFT.
wenzelm@61483
  2184
wenzelm@61512
  2185
* The command-line tool "isabelle jedit" and the isabelle.Main
wenzelm@62027
  2186
application wrapper treat the default $USER_HOME/Scratch.thy more
wenzelm@61512
  2187
uniformly, and allow the dummy file argument ":" to open an empty buffer
wenzelm@61512
  2188
instead.
wenzelm@61512
  2189
wenzelm@62017
  2190
* New command-line tool "isabelle jedit_client" allows to connect to an
wenzelm@62017
  2191
already running Isabelle/jEdit process. This achieves the effect of
wenzelm@62017
  2192
single-instance applications seen on common GUI desktops.
wenzelm@62017
  2193
wenzelm@61530
  2194
* The default look-and-feel for Linux is the traditional "Metal", which
wenzelm@61530
  2195
works better with GUI scaling for very high-resolution displays (e.g.
wenzelm@61530
  2196
4K). Moreover, it is generally more robust than "Nimbus".
wenzelm@61530
  2197
wenzelm@62163
  2198
* Update to jedit-5.3.0, with improved GUI scaling and support of
wenzelm@62163
  2199
high-resolution displays (e.g. 4K).
wenzelm@62163
  2200
wenzelm@62034
  2201
* The main Isabelle executable is managed as single-instance Desktop
wenzelm@62034
  2202
application uniformly on all platforms: Linux, Windows, Mac OS X.
wenzelm@62034
  2203
wenzelm@60610
  2204
wenzelm@61405
  2205
*** Document preparation ***
wenzelm@61405
  2206
wenzelm@62017
  2207
* Commands 'paragraph' and 'subparagraph' provide additional section
wenzelm@62017
  2208
headings. Thus there are 6 levels of standard headings, as in HTML.
wenzelm@62017
  2209
wenzelm@62017
  2210
* Command 'text_raw' has been clarified: input text is processed as in
wenzelm@62017
  2211
'text' (with antiquotations and control symbols). The key difference is
wenzelm@62017
  2212
the lack of the surrounding isabelle markup environment in output.
wenzelm@62017
  2213
wenzelm@62017
  2214
* Text is structured in paragraphs and nested lists, using notation that
wenzelm@62017
  2215
is similar to Markdown. The control symbols for list items are as
wenzelm@62017
  2216
follows:
wenzelm@62017
  2217
wenzelm@62017
  2218
  \<^item>  itemize
wenzelm@62017
  2219
  \<^enum>  enumerate
wenzelm@62017
  2220
  \<^descr>  description
wenzelm@62017
  2221
wenzelm@61491
  2222
* There is a new short form for antiquotations with a single argument
wenzelm@61491
  2223
that is a cartouche: \<^name>\<open>...\<close> is equivalent to @{name \<open>...\<close>} and
wenzelm@61595
  2224
\<open>...\<close> without control symbol is equivalent to @{cartouche \<open>...\<close>}.
wenzelm@61595
  2225
\<^name> without following cartouche is equivalent to @{name}. The
wenzelm@61501
  2226
standard Isabelle fonts provide glyphs to render important control
wenzelm@61501
  2227
symbols, e.g. "\<^verbatim>", "\<^emph>", "\<^bold>".
wenzelm@61491
  2228
wenzelm@61595
  2229
* Antiquotations @{noindent}, @{smallskip}, @{medskip}, @{bigskip} with
wenzelm@61595
  2230
corresponding control symbols \<^noindent>, \<^smallskip>, \<^medskip>, \<^bigskip> specify spacing formally, using
wenzelm@61595
  2231
standard LaTeX macros of the same names.
wenzelm@61595
  2232
wenzelm@61491
  2233
* Antiquotation @{cartouche} in Isabelle/Pure is the same as @{text}.
wenzelm@61491
  2234
Consequently, \<open>...\<close> without any decoration prints literal quasi-formal
wenzelm@61492
  2235
text. Command-line tool "isabelle update_cartouches -t" helps to update
wenzelm@61492
  2236
old sources, by approximative patching of the content of string and
wenzelm@61492
  2237
cartouche tokens seen in theory sources.
wenzelm@61491
  2238
wenzelm@61491
  2239
* The @{text} antiquotation now ignores the antiquotation option
wenzelm@61491
  2240
"source". The given text content is output unconditionally, without any
wenzelm@61491
  2241
surrounding quotes etc. Subtle INCOMPATIBILITY, put quotes into the
wenzelm@61494
  2242
argument where they are really intended, e.g. @{text \<open>"foo"\<close>}. Initial
wenzelm@61494
  2243
or terminal spaces are ignored.
wenzelm@61491
  2244
wenzelm@62017
  2245
* Antiquotations @{emph} and @{bold} output LaTeX source recursively,
wenzelm@62017
  2246
adding appropriate text style markup. These may be used in the short
wenzelm@62017
  2247
form \<^emph>\<open>...\<close> and \<^bold>\<open>...\<close>.
wenzelm@62017
  2248
wenzelm@62017
  2249
* Document antiquotation @{footnote} outputs LaTeX source recursively,
wenzelm@62017
  2250
marked as \footnote{}. This may be used in the short form \<^footnote>\<open>...\<close>.
wenzelm@62017
  2251
wenzelm@62017
  2252
* Antiquotation @{verbatim [display]} supports option "indent".
wenzelm@62017
  2253
wenzelm@62017
  2254
* Antiquotation @{theory_text} prints uninterpreted theory source text
wenzelm@62231
  2255
(Isar outer syntax with command keywords etc.). This may be used in the
wenzelm@62231
  2256
short form \<^theory_text>\<open>...\<close>. @{theory_text [display]} supports option "indent".
wenzelm@62017
  2257
wenzelm@62017
  2258
* Antiquotation @{doc ENTRY} provides a reference to the given
wenzelm@62017
  2259
documentation, with a hyperlink in the Prover IDE.
wenzelm@62017
  2260
wenzelm@62017
  2261
* Antiquotations @{command}, @{method}, @{attribute} print checked
wenzelm@62017
  2262
entities of the Isar language.
wenzelm@62017
  2263
wenzelm@61471
  2264
* HTML presentation uses the standard IsabelleText font and Unicode
wenzelm@61471
  2265
rendering of Isabelle symbols like Isabelle/Scala/jEdit.  The former
wenzelm@61488
  2266
print mode "HTML" loses its special meaning.
wenzelm@61471
  2267
wenzelm@61405
  2268
wenzelm@60406
  2269
*** Isar ***
wenzelm@60406
  2270
wenzelm@62205
  2271
* Local goals ('have', 'show', 'hence', 'thus') allow structured rule
wenzelm@62205
  2272
statements like fixes/assumes/shows in theorem specifications, but the
wenzelm@62205
  2273
notation is postfix with keywords 'if' (or 'when') and 'for'. For
wenzelm@60555
  2274
example:
wenzelm@60414
  2275
wenzelm@60414
  2276
  have result: "C x y"
wenzelm@60414
  2277
    if "A x" and "B y"
wenzelm@60414
  2278
    for x :: 'a and y :: 'a
wenzelm@60414
  2279
    <proof>
wenzelm@60414
  2280
wenzelm@60449
  2281
The local assumptions are bound to the name "that". The result is
wenzelm@60449
  2282
exported from context of the statement as usual. The above roughly
wenzelm@60414
  2283
corresponds to a raw proof block like this:
wenzelm@60414
  2284
wenzelm@60414
  2285
  {
wenzelm@60414
  2286
    fix x :: 'a and y :: 'a
wenzelm@60449
  2287
    assume that: "A x" "B y"
wenzelm@60414
  2288
    have "C x y" <proof>
wenzelm@60414
  2289
  }
wenzelm@60414
  2290
  note result = this
wenzelm@60406
  2291
wenzelm@60555
  2292
The keyword 'when' may be used instead of 'if', to indicate 'presume'
wenzelm@60555
  2293
instead of 'assume' above.
wenzelm@60555
  2294
wenzelm@61733
  2295
* Assumptions ('assume', 'presume') allow structured rule statements
wenzelm@61733
  2296
using 'if' and 'for', similar to 'have' etc. above. For example:
wenzelm@61658
  2297
wenzelm@61658
  2298
  assume result: "C x y"
wenzelm@61658
  2299
    if "A x" and "B y"
wenzelm@61658
  2300
    for x :: 'a and y :: 'a
wenzelm@61658
  2301
wenzelm@61658
  2302
This assumes "\<And>x y::'a. A x \<Longrightarrow> B y \<Longrightarrow> C x y" and produces a general
wenzelm@61658
  2303
result as usual: "A ?x \<Longrightarrow> B ?y \<Longrightarrow> C ?x ?y".
wenzelm@61658
  2304
wenzelm@61658
  2305
Vacuous quantification in assumptions is omitted, i.e. a for-context
wenzelm@61658
  2306
only effects propositions according to actual use of variables. For
wenzelm@61658
  2307
example:
wenzelm@61658
  2308
wenzelm@61658
  2309
  assume "A x" and "B y" for x and y
wenzelm@61658
  2310
wenzelm@61658
  2311
is equivalent to:
wenzelm@61658
  2312
wenzelm@61658
  2313
  assume "\<And>x. A x" and "\<And>y. B y"
wenzelm@61658
  2314
wenzelm@60595
  2315
* The meaning of 'show' with Pure rule statements has changed: premises
wenzelm@60595
  2316
are treated in the sense of 'assume', instead of 'presume'. This means,
wenzelm@62205
  2317
a goal like "\<And>x. A x \<Longrightarrow> B x \<Longrightarrow> C x" can be solved completely as
wenzelm@62205
  2318
follows:
wenzelm@60595
  2319
wenzelm@60595
  2320
  show "\<And>x. A x \<Longrightarrow> B x \<Longrightarrow> C x"
wenzelm@60595
  2321
wenzelm@60595
  2322
or:
wenzelm@60595
  2323
wenzelm@60595
  2324
  show "C x" if "A x" "B x" for x
wenzelm@60595
  2325
wenzelm@60595
  2326
Rare INCOMPATIBILITY, the old behaviour may be recovered as follows:
wenzelm@60595
  2327
wenzelm@60595
  2328
  show "C x" when "A x" "B x" for x
wenzelm@60595
  2329
wenzelm@60459
  2330
* New command 'consider' states rules for generalized elimination and
wenzelm@60459
  2331
case splitting. This is like a toplevel statement "theorem obtains" used
wenzelm@60459
  2332
within a proof body; or like a multi-branch 'obtain' without activation
wenzelm@60459
  2333
of the local context elements yet.
wenzelm@60459
  2334
wenzelm@60455
  2335
* Proof method "cases" allows to specify the rule as first entry of
wenzelm@60455
  2336
chained facts.  This is particularly useful with 'consider':
wenzelm@60455
  2337
wenzelm@60455
  2338
  consider (a) A | (b) B | (c) C <proof>
wenzelm@60455
  2339
  then have something
wenzelm@60455
  2340
  proof cases
wenzelm@60455
  2341
    case a
wenzelm@60455
  2342
    then show ?thesis <proof>
wenzelm@60455
  2343
  next
wenzelm@60455
  2344
    case b
wenzelm@60455
  2345
    then show ?thesis <proof>
wenzelm@60455
  2346
  next
wenzelm@60455
  2347
    case c
wenzelm@60455
  2348
    then show ?thesis <proof>
wenzelm@60455
  2349
  qed
wenzelm@60455
  2350
wenzelm@60565
  2351
* Command 'case' allows fact name and attribute specification like this:
wenzelm@60565
  2352
wenzelm@60565
  2353
  case a: (c xs)
wenzelm@60565
  2354
  case a [attributes]: (c xs)
wenzelm@60565
  2355
wenzelm@60565
  2356
Facts that are introduced by invoking the case context are uniformly
wenzelm@60565
  2357
qualified by "a"; the same name is used for the cumulative fact. The old
wenzelm@60565
  2358
form "case (c xs) [attributes]" is no longer supported. Rare
wenzelm@60565
  2359
INCOMPATIBILITY, need to adapt uses of case facts in exotic situations,
wenzelm@60565
  2360
and always put attributes in front.
wenzelm@60565
  2361
wenzelm@60618
  2362
* The standard proof method of commands 'proof' and '..' is now called
wenzelm@60618
  2363
"standard" to make semantically clear what it is; the old name "default"
wenzelm@60618
  2364
is still available as legacy for some time. Documentation now explains
wenzelm@60618
  2365
'..' more accurately as "by standard" instead of "by rule".
wenzelm@60618
  2366
wenzelm@62017
  2367
* Nesting of Isar goal structure has been clarified: the context after
wenzelm@62017
  2368
the initial backwards refinement is retained for the whole proof, within
wenzelm@62017
  2369
all its context sections (as indicated via 'next'). This is e.g.
wenzelm@62017
  2370
relevant for 'using', 'including', 'supply':
wenzelm@62017
  2371
wenzelm@62017
  2372
  have "A \<and> A" if a: A for A
wenzelm@62017
  2373
    supply [simp] = a
wenzelm@62017
  2374
  proof
wenzelm@62017
  2375
    show A by simp
wenzelm@62017
  2376
  next
wenzelm@62017
  2377
    show A by simp
wenzelm@62017
  2378
  qed
wenzelm@62017
  2379
wenzelm@62017
  2380
* Command 'obtain' binds term abbreviations (via 'is' patterns) in the
wenzelm@62017
  2381
proof body as well, abstracted over relevant parameters.
wenzelm@62017
  2382
wenzelm@62017
  2383
* Improved type-inference for theorem statement 'obtains': separate
wenzelm@62017
  2384
parameter scope for of each clause.
wenzelm@62017
  2385
wenzelm@62017
  2386
* Term abbreviations via 'is' patterns also work for schematic
wenzelm@62017
  2387
statements: result is abstracted over unknowns.
wenzelm@62017
  2388
wenzelm@60631
  2389
* Command 'subgoal' allows to impose some structure on backward
wenzelm@60631
  2390
refinements, to avoid proof scripts degenerating into long of 'apply'
wenzelm@60631
  2391
sequences. Further explanations and examples are given in the isar-ref
wenzelm@60631
  2392
manual.
wenzelm@60631
  2393
wenzelm@62017
  2394
* Command 'supply' supports fact definitions during goal refinement
wenzelm@62017
  2395
('apply' scripts).
wenzelm@62017
  2396
wenzelm@61166
  2397
* Proof method "goal_cases" turns the current subgoals into cases within
wenzelm@61166
  2398
the context; the conclusion is bound to variable ?case in each case. For
wenzelm@61166
  2399
example:
wenzelm@60617
  2400
wenzelm@60617
  2401
lemma "\<And>x. A x \<Longrightarrow> B x \<Longrightarrow> C x"
wenzelm@60622
  2402
  and "\<And>y z. U y \<Longrightarrow> V z \<Longrightarrow> W y z"
wenzelm@61166
  2403
proof goal_cases
wenzelm@60622
  2404
  case (1 x)
wenzelm@60622
  2405
  then show ?case using \<open>A x\<close> \<open>B x\<close> sorry
wenzelm@60622
  2406
next
wenzelm@60622
  2407
  case (2 y z)
wenzelm@60622
  2408
  then show ?case using \<open>U y\<close> \<open>V z\<close> sorry
wenzelm@60622
  2409
qed
wenzelm@60622
  2410
wenzelm@60622
  2411
lemma "\<And>x. A x \<Longrightarrow> B x \<Longrightarrow> C x"
wenzelm@60622
  2412
  and "\<And>y z. U y \<Longrightarrow> V z \<Longrightarrow> W y z"
wenzelm@61166
  2413
proof goal_cases
wenzelm@60617
  2414
  case prems: 1
wenzelm@60617
  2415
  then show ?case using prems sorry
wenzelm@60617
  2416
next
wenzelm@60617
  2417
  case prems: 2
wenzelm@60617
  2418
  then show ?case using prems sorry
wenzelm@60617
  2419
qed
wenzelm@60578
  2420
wenzelm@60581
  2421
* The undocumented feature of implicit cases goal1, goal2, goal3, etc.
wenzelm@60617
  2422
is marked as legacy, and will be removed eventually. The proof method
wenzelm@60617
  2423
"goals" achieves a similar effect within regular Isar; often it can be
wenzelm@60617
  2424
done more adequately by other means (e.g. 'consider').
wenzelm@60581
  2425
wenzelm@62017
  2426
* The vacuous fact "TERM x" may be established "by fact" or as `TERM x`
wenzelm@62017
  2427
as well, not just "by this" or "." as before.
wenzelm@60551
  2428
wenzelm@60554
  2429
* Method "sleep" succeeds after a real-time delay (in seconds). This is
wenzelm@60554
  2430
occasionally useful for demonstration and testing purposes.
wenzelm@60554
  2431
wenzelm@60406
  2432
wenzelm@60331
  2433
*** Pure ***
wenzelm@60331
  2434
wenzelm@61606
  2435
* Qualifiers in locale expressions default to mandatory ('!') regardless
wenzelm@61606
  2436
of the command. Previously, for 'locale' and 'sublocale' the default was
wenzelm@61606
  2437
optional ('?'). The old synatx '!' has been discontinued.
wenzelm@61606
  2438
INCOMPATIBILITY, remove '!' and add '?' as required.
ballarin@61565
  2439
ballarin@61566
  2440
* Keyword 'rewrites' identifies rewrite morphisms in interpretation
wenzelm@62017
  2441
commands. Previously, the keyword was 'where'. INCOMPATIBILITY.
ballarin@61566
  2442
ballarin@61701
  2443
* More gentle suppression of syntax along locale morphisms while
wenzelm@62017
  2444
printing terms. Previously 'abbreviation' and 'notation' declarations
wenzelm@62017
  2445
would be suppressed for morphisms except term identity. Now
ballarin@61701
  2446
'abbreviation' is also kept for morphims that only change the involved
wenzelm@62017
  2447
parameters, and only 'notation' is suppressed. This can be of great help
wenzelm@62017
  2448
when working with complex locale hierarchies, because proof states are
wenzelm@62017
  2449
displayed much more succinctly. It also means that only notation needs
wenzelm@62017
  2450
to be redeclared if desired, as illustrated by this example:
ballarin@61701
  2451
ballarin@61701
  2452
  locale struct = fixes composition :: "'a => 'a => 'a" (infixl "\<cdot>" 65)
ballarin@61701
  2453
  begin
ballarin@61701
  2454
    definition derived (infixl "\<odot>" 65) where ...
ballarin@61701
  2455
  end
ballarin@61701
  2456
ballarin@61701
  2457
  locale morphism =
ballarin@61701
  2458
    left: struct composition + right: struct composition'
ballarin@61701
  2459
    for composition (infix "\<cdot>" 65) and composition' (infix "\<cdot>''" 65)
ballarin@61701
  2460
  begin
ballarin@61701
  2461
    notation right.derived ("\<odot>''")
ballarin@61701
  2462
  end
ballarin@61701
  2463
wenzelm@61895
  2464
* Command 'global_interpretation' issues interpretations into global
wenzelm@61895
  2465
theories, with optional rewrite definitions following keyword 'defines'.
wenzelm@61895
  2466
wenzelm@61895
  2467
* Command 'sublocale' accepts optional rewrite definitions after keyword
haftmann@61675
  2468
'defines'.
haftmann@61675
  2469
wenzelm@61895
  2470
* Command 'permanent_interpretation' has been discontinued. Use
wenzelm@61895
  2471
'global_interpretation' or 'sublocale' instead. INCOMPATIBILITY.
haftmann@61670
  2472
wenzelm@61252
  2473
* Command 'print_definitions' prints dependencies of definitional
wenzelm@61252
  2474
specifications. This functionality used to be part of 'print_theory'.
wenzelm@61252
  2475
wenzelm@60331
  2476
* Configuration option rule_insts_schematic has been discontinued
wenzelm@62017
  2477
(intermediate legacy feature in Isabelle2015). INCOMPATIBILITY.
wenzelm@60331
  2478
wenzelm@62205
  2479
* Abbreviations in type classes now carry proper sort constraint. Rare
wenzelm@62205
  2480
INCOMPATIBILITY in situations where the previous misbehaviour has been
wenzelm@62205
  2481
exploited.
haftmann@60349
  2482
haftmann@60349
  2483
* Refinement of user-space type system in type classes: pseudo-local
wenzelm@62205
  2484
operations behave more similar to abbreviations. Potential
haftmann@60349
  2485
INCOMPATIBILITY in exotic situations.
haftmann@60349
  2486
haftmann@60349
  2487
nipkow@60171
  2488
*** HOL ***
nipkow@60171
  2489
wenzelm@62017
  2490
* The 'typedef' command has been upgraded from a partially checked
wenzelm@62017
  2491
"axiomatization", to a full definitional specification that takes the
wenzelm@62017
  2492
global collection of overloaded constant / type definitions into
wenzelm@62017
  2493
account. Type definitions with open dependencies on overloaded
wenzelm@62017
  2494
definitions need to be specified as "typedef (overloaded)". This
wenzelm@62017
  2495
provides extra robustness in theory construction. Rare INCOMPATIBILITY.
wenzelm@62017
  2496
wenzelm@62017
  2497
* Qualification of various formal entities in the libraries is done more
wenzelm@62017
  2498
uniformly via "context begin qualified definition ... end" instead of
wenzelm@62017
  2499
old-style "hide_const (open) ...". Consequently, both the defined
wenzelm@62017
  2500
constant and its defining fact become qualified, e.g. Option.is_none and
wenzelm@62017
  2501
Option.is_none_def. Occasional INCOMPATIBILITY in applications.
wenzelm@62017
  2502
wenzelm@62017
  2503
* Some old and rarely used ASCII replacement syntax has been removed.
wenzelm@62017
  2504
INCOMPATIBILITY, standard syntax with symbols should be used instead.
wenzelm@62017
  2505
The subsequent commands help to reproduce the old forms, e.g. to
wenzelm@62017
  2506
simplify porting old theories:
wenzelm@62017
  2507
wenzelm@62017
  2508
  notation iff  (infixr "<->" 25)
wenzelm@62017
  2509
wenzelm@62017
  2510
  notation Times  (infixr "<*>" 80)
wenzelm@62017
  2511
wenzelm@62017
  2512
  type_notation Map.map  (infixr "~=>" 0)
wenzelm@62017
  2513
  notation Map.map_comp  (infixl "o'_m" 55)
wenzelm@62017
  2514
wenzelm@62017
  2515
  type_notation FinFun.finfun ("(_ =>f /_)" [22, 21] 21)
wenzelm@62017
  2516
wenzelm@62017
  2517
  notation FuncSet.funcset  (infixr "->" 60)
wenzelm@62017
  2518
  notation FuncSet.extensional_funcset  (infixr "->\<^sub>E" 60)
wenzelm@62017
  2519
wenzelm@62017
  2520
  notation Omega_Words_Fun.conc (infixr "conc" 65)
wenzelm@62017
  2521
wenzelm@62017
  2522
  notation Preorder.equiv ("op ~~")
wenzelm@62017
  2523
    and Preorder.equiv ("(_/ ~~ _)" [51, 51] 50)
wenzelm@62017
  2524
wenzelm@62017
  2525
  notation (in topological_space) tendsto (infixr "--->" 55)
wenzelm@62017
  2526
  notation (in topological_space) LIMSEQ ("((_)/ ----> (_))" [60, 60] 60)
wenzelm@62017
  2527
  notation LIM ("((_)/ -- (_)/ --> (_))" [60, 0, 60] 60)
wenzelm@62017
  2528
wenzelm@62017
  2529
  notation NSA.approx (infixl "@=" 50)
wenzelm@62017
  2530
  notation NSLIMSEQ ("((_)/ ----NS> (_))" [60, 60] 60)
wenzelm@62017
  2531
  notation NSLIM ("((_)/ -- (_)/ --NS> (_))" [60, 0, 60] 60)
wenzelm@62017
  2532
wenzelm@62017
  2533
* The alternative notation "\<Colon>" for type and sort constraints has been
wenzelm@62017
  2534
removed: in LaTeX document output it looks the same as "::".
wenzelm@62017
  2535
INCOMPATIBILITY, use plain "::" instead.
wenzelm@62017
  2536
wenzelm@62017
  2537
* Commands 'inductive' and 'inductive_set' work better when names for
wenzelm@62017
  2538
intro rules are omitted: the "cases" and "induct" rules no longer
wenzelm@62017
  2539
declare empty case_names, but no case_names at all. This allows to use
wenzelm@62017
  2540
numbered cases in proofs, without requiring method "goal_cases".
wenzelm@62017
  2541
wenzelm@62017
  2542
* Inductive definitions ('inductive', 'coinductive', etc.) expose
wenzelm@62017
  2543
low-level facts of the internal construction only if the option
wenzelm@62093
  2544
"inductive_internals" is enabled. This refers to the internal predicate
wenzelm@62017
  2545
definition and its monotonicity result. Rare INCOMPATIBILITY.
wenzelm@62017
  2546
wenzelm@62017
  2547
* Recursive function definitions ('fun', 'function', 'partial_function')
wenzelm@62017
  2548
expose low-level facts of the internal construction only if the option
wenzelm@62205
  2549
"function_internals" is enabled. Its internal inductive definition is
wenzelm@62205
  2550
also subject to "inductive_internals". Rare INCOMPATIBILITY.
wenzelm@62093
  2551
wenzelm@62093
  2552
* BNF datatypes ('datatype', 'codatatype', etc.) expose low-level facts
wenzelm@62093
  2553
of the internal construction only if the option "bnf_internals" is
wenzelm@62093
  2554
enabled. This supersedes the former option "bnf_note_all". Rare
wenzelm@62093
  2555
INCOMPATIBILITY.
wenzelm@62017
  2556
wenzelm@62017
  2557
* Combinator to represent case distinction on products is named
wenzelm@62017
  2558
"case_prod", uniformly, discontinuing any input aliasses. Very popular
wenzelm@62017
  2559
theorem aliasses have been retained.
wenzelm@62017
  2560
haftmann@61424
  2561
Consolidated facts:
haftmann@61424
  2562
  PairE ~> prod.exhaust
haftmann@61424
  2563
  Pair_eq ~> prod.inject
haftmann@61424
  2564
  pair_collapse ~> prod.collapse
haftmann@61424
  2565
  Pair_fst_snd_eq ~> prod_eq_iff
haftmann@61424
  2566
  split_twice ~> prod.case_distrib
haftmann@61424
  2567
  split_weak_cong ~> prod.case_cong_weak
haftmann@61424
  2568
  split_split ~> prod.split
haftmann@61424
  2569
  split_split_asm ~> prod.split_asm
haftmann@61424
  2570
  splitI ~> case_prodI
haftmann@61424
  2571
  splitD ~> case_prodD
haftmann@61424
  2572
  splitI2 ~> case_prodI2
haftmann@61424
  2573
  splitI2' ~> case_prodI2'
haftmann@61424
  2574
  splitE ~> case_prodE
haftmann@61424
  2575
  splitE' ~> case_prodE'
haftmann@61424
  2576
  split_pair ~> case_prod_Pair
haftmann@61424
  2577
  split_eta ~> case_prod_eta
haftmann@61424
  2578
  split_comp ~> case_prod_comp
haftmann@61424
  2579
  mem_splitI ~> mem_case_prodI
haftmann@61424
  2580
  mem_splitI2 ~> mem_case_prodI2
haftmann@61424
  2581
  mem_splitE ~> mem_case_prodE
haftmann@61424
  2582
  The_split ~> The_case_prod
haftmann@61424
  2583
  cond_split_eta ~> cond_case_prod_eta
haftmann@61424
  2584
  Collect_split_in_rel_leE ~> Collect_case_prod_in_rel_leE
haftmann@61424
  2585
  Collect_split_in_rel_leI ~> Collect_case_prod_in_rel_leI
haftmann@61424
  2586
  in_rel_Collect_split_eq ~> in_rel_Collect_case_prod_eq
haftmann@61424
  2587
  Collect_split_Grp_eqD ~> Collect_case_prod_Grp_eqD
haftmann@61424
  2588
  Collect_split_Grp_inD ~> Collect_case_prod_Grp_in
haftmann@61424
  2589
  Domain_Collect_split ~> Domain_Collect_case_prod
haftmann@61424
  2590
  Image_Collect_split ~> Image_Collect_case_prod
haftmann@61424
  2591
  Range_Collect_split ~> Range_Collect_case_prod
haftmann@61424
  2592
  Eps_split ~> Eps_case_prod
haftmann@61424
  2593
  Eps_split_eq ~> Eps_case_prod_eq
haftmann@61424
  2594
  split_rsp ~> case_prod_rsp
haftmann@61424
  2595
  curry_split ~> curry_case_prod
haftmann@61424
  2596
  split_curry ~> case_prod_curry
wenzelm@62017
  2597
haftmann@61424
  2598
Changes in structure HOLogic:
haftmann@61424
  2599
  split_const ~> case_prod_const
haftmann@61424
  2600
  mk_split ~> mk_case_prod
haftmann@61424
  2601
  mk_psplits ~> mk_ptupleabs
haftmann@61424
  2602
  strip_psplits ~> strip_ptupleabs
wenzelm@62017
  2603
wenzelm@62017
  2604
INCOMPATIBILITY.
wenzelm@62017
  2605
wenzelm@62017
  2606
* The coercions to type 'real' have been reorganised. The function
wenzelm@62017
  2607
'real' is no longer overloaded, but has type 'nat => real' and
wenzelm@62017
  2608
abbreviates of_nat for that type. Also 'real_of_int :: int => real'
wenzelm@62017
  2609
abbreviates of_int for that type. Other overloaded instances of 'real'
wenzelm@62017
  2610
have been replaced by 'real_of_ereal' and 'real_of_float'.
wenzelm@62017
  2611
lp15@61694
  2612
Consolidated facts (among others):
lp15@61694
  2613
  real_of_nat_le_iff -> of_nat_le_iff
lp15@61694
  2614
  real_of_nat_numeral of_nat_numeral
lp15@61694
  2615
  real_of_int_zero of_int_0
lp15@61694
  2616
  real_of_nat_zero of_nat_0
lp15@61694
  2617
  real_of_one of_int_1
lp15@61694
  2618
  real_of_int_add of_int_add
lp15@61694
  2619
  real_of_nat_add of_nat_add
lp15@61694
  2620
  real_of_int_diff of_int_diff
lp15@61694
  2621
  real_of_nat_diff of_nat_diff
lp15@61694
  2622
  floor_subtract floor_diff_of_int
lp15@61694
  2623
  real_of_int_inject of_int_eq_iff
lp15@61694
  2624
  real_of_int_gt_zero_cancel_iff of_int_0_less_iff
lp15@61694
  2625
  real_of_int_ge_zero_cancel_iff of_int_0_le_iff
lp15@61694
  2626
  real_of_nat_ge_zero of_nat_0_le_iff
lp15@61694
  2627
  real_of_int_ceiling_ge le_of_int_ceiling
lp15@61694
  2628
  ceiling_less_eq ceiling_less_iff
lp15@61694
  2629
  ceiling_le_eq ceiling_le_iff
lp15@61694
  2630
  less_floor_eq less_floor_iff
lp15@61694
  2631
  floor_less_eq floor_less_iff
lp15@61694
  2632
  floor_divide_eq_div floor_divide_of_int_eq
lp15@61694
  2633
  real_of_int_zero_cancel of_nat_eq_0_iff
lp15@61694
  2634
  ceiling_real_of_int ceiling_of_int
wenzelm@62017
  2635
wenzelm@62017
  2636
INCOMPATIBILITY.
wenzelm@61143
  2637
wenzelm@60841
  2638
* Theory Map: lemma map_of_is_SomeD was a clone of map_of_SomeD and has
wenzelm@60841
  2639
been removed. INCOMPATIBILITY.
wenzelm@60841
  2640
lars@60712
  2641
* Quickcheck setup for finite sets.
lars@60712
  2642
nipkow@60171
  2643
* Discontinued simp_legacy_precond. Potential INCOMPATIBILITY.
wenzelm@60138
  2644
blanchet@60306
  2645
* Sledgehammer:
blanchet@61318
  2646
  - The MaSh relevance filter has been sped up.
blanchet@60306
  2647
  - Proof reconstruction has been improved, to minimize the incidence of
blanchet@60306
  2648
    cases where Sledgehammer gives a proof that does not work.
blanchet@60306
  2649
  - Auto Sledgehammer now minimizes and preplays the results.
blanchet@61030
  2650
  - Handle Vampire 4.0 proof output without raising exception.
blanchet@61043
  2651
  - Eliminated "MASH" environment variable. Use the "MaSh" option in
blanchet@61043
  2652
    Isabelle/jEdit instead. INCOMPATIBILITY.
blanchet@61317
  2653
  - Eliminated obsolete "blocking" option and related subcommands.
blanchet@60306
  2654
blanchet@60310
  2655
* Nitpick:
blanchet@61325
  2656
  - Fixed soundness bug in translation of "finite" predicate.
blanchet@61324
  2657
  - Fixed soundness bug in "destroy_constrs" optimization.
blanchet@62080
  2658
  - Fixed soundness bug in translation of "rat" type.
blanchet@60310
  2659
  - Removed "check_potential" and "check_genuine" options.
blanchet@61317
  2660
  - Eliminated obsolete "blocking" option.
blanchet@60310
  2661
wenzelm@62027
  2662
* (Co)datatype package:
blanchet@61345
  2663
  - New commands "lift_bnf" and "copy_bnf" for lifting (copying) a BNF
blanchet@61345
  2664
    structure on the raw type to an abstract type defined using typedef.
blanchet@61345
  2665
  - Always generate "case_transfer" theorem.
wenzelm@62235
  2666
  - For mutual types, generate slightly stronger "rel_induct",
haftmann@63946
  2667
    "rel_coinduct", and "coinduct" theorems. INCOMPATIBILITY.
blanchet@61552
  2668
  - Allow discriminators and selectors with the same name as the type
blanchet@61552
  2669
    being defined.
blanchet@61552
  2670
  - Avoid various internal name clashes (e.g., 'datatype f = f').
traytel@60920
  2671
wenzelm@62098
  2672
* Transfer: new methods for interactive debugging of 'transfer' and
wenzelm@62098
  2673
'transfer_prover': 'transfer_start', 'transfer_step', 'transfer_end',
wenzelm@62098
  2674
'transfer_prover_start' and 'transfer_prover_end'.
kuncar@61370
  2675
kleing@62118
  2676
* New diagnostic command print_record for displaying record definitions.
kleing@62118
  2677
haftmann@60868
  2678
* Division on integers is bootstrapped directly from division on
wenzelm@62017
  2679
naturals and uses generic numeral algorithm for computations. Slight
wenzelm@62017
  2680
INCOMPATIBILITY, simproc numeral_divmod replaces and generalizes former
wenzelm@62017
  2681
simprocs binary_int_div and binary_int_mod
wenzelm@62017
  2682
wenzelm@62017
  2683
* Tightened specification of class semiring_no_zero_divisors. Minor
haftmann@60516
  2684
INCOMPATIBILITY.
haftmann@60516
  2685
haftmann@60688
  2686
* Class algebraic_semidom introduces common algebraic notions of
wenzelm@62017
  2687
integral (semi)domains, particularly units. Although logically subsumed
wenzelm@62017
  2688
by fields, is is not a super class of these in order not to burden
wenzelm@62017
  2689
fields with notions that are trivial there.
wenzelm@62017
  2690
wenzelm@62017
  2691
* Class normalization_semidom specifies canonical representants for
wenzelm@62017
  2692
equivalence classes of associated elements in an integral (semi)domain.
wenzelm@62017
  2693
This formalizes associated elements as well.
haftmann@60688
  2694
haftmann@60688
  2695
* Abstract specification of gcd/lcm operations in classes semiring_gcd,
wenzelm@62017
  2696
semiring_Gcd, semiring_Lcd. Minor INCOMPATIBILITY: facts gcd_nat.commute
wenzelm@62017
  2697
and gcd_int.commute are subsumed by gcd.commute, as well as
wenzelm@62017
  2698
gcd_nat.assoc and gcd_int.assoc by gcd.assoc.
wenzelm@62017
  2699
wenzelm@62017
  2700
* Former constants Fields.divide (_ / _) and Divides.div (_ div _) are
wenzelm@62017
  2701
logically unified to Rings.divide in syntactic type class Rings.divide,
wenzelm@62017
  2702
with infix syntax (_ div _). Infix syntax (_ / _) for field division is
wenzelm@62017
  2703
added later as abbreviation in class Fields.inverse. INCOMPATIBILITY,
wenzelm@62017
  2704
instantiations must refer to Rings.divide rather than the former
wenzelm@62017
  2705
separate constants, hence infix syntax (_ / _) is usually not available
wenzelm@62017
  2706
during instantiation.
wenzelm@62017
  2707
wenzelm@62017
  2708
* New cancellation simprocs for boolean algebras to cancel complementary
wenzelm@62017
  2709
terms for sup and inf. For example, "sup x (sup y (- x))" simplifies to
wenzelm@62017
  2710
"top". INCOMPATIBILITY.
Andreas@61628
  2711
hoelzl@62101
  2712
* Class uniform_space introduces uniform spaces btw topological spaces
hoelzl@62101
  2713
and metric spaces. Minor INCOMPATIBILITY: open_<type>_def needs to be
wenzelm@62205
  2714
introduced in the form of an uniformity. Some constants are more general
wenzelm@62205
  2715
now, it may be necessary to add type class constraints.
hoelzl@62101
  2716
hoelzl@62101
  2717
  open_real_def \<leadsto> open_dist
hoelzl@62101
  2718
  open_complex_def \<leadsto> open_dist
hoelzl@62101
  2719
wenzelm@62026
  2720
* Library/Monad_Syntax: notation uses symbols \<bind> and \<then>. INCOMPATIBILITY.
wenzelm@62026
  2721
Mathias@60397
  2722
* Library/Multiset:
Mathias@60397
  2723
  - Renamed multiset inclusion operators:
Mathias@60397
  2724
      < ~> <#
blanchet@62208
  2725
      > ~> >#
Mathias@60397
  2726
      <= ~> <=#
blanchet@62208
  2727
      >= ~> >=#
Mathias@60397
  2728
      \<le> ~> \<le>#
blanchet@62208
  2729
      \<ge> ~> \<ge>#
Mathias@60397
  2730
    INCOMPATIBILITY.
blanchet@62209
  2731
  - Added multiset inclusion operator syntax:
blanchet@62209
  2732
      \<subset>#
blanchet@62209
  2733
      \<subseteq>#
blanchet@62209
  2734
      \<supset>#
blanchet@62209
  2735
      \<supseteq>#
Mathias@60397
  2736
  - "'a multiset" is no longer an instance of the "order",
Mathias@60397
  2737
    "ordered_ab_semigroup_add_imp_le", "ordered_cancel_comm_monoid_diff",
Mathias@60397
  2738
    "semilattice_inf", and "semilattice_sup" type classes. The theorems
Mathias@60397
  2739
    previously provided by these type classes (directly or indirectly)
Mathias@60397
  2740
    are now available through the "subset_mset" interpretation
Mathias@60397
  2741
    (e.g. add_mono ~> subset_mset.add_mono).
Mathias@60397
  2742
    INCOMPATIBILITY.
nipkow@60497
  2743
  - Renamed conversions:
nipkow@60515
  2744
      multiset_of ~> mset
nipkow@60515
  2745
      multiset_of_set ~> mset_set
nipkow@60497
  2746
      set_of ~> set_mset