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