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