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