NEWS
author nipkow
Thu Aug 18 17:42:18 2011 +0200 (2011-08-18)
changeset 44274 731b18266d5a
parent 44136 e63ad7d5158d
child 44282 f0de18b62d63
permissions -rw-r--r--
case_names NEWS
wenzelm@5363
     1
Isabelle NEWS -- history user-relevant changes
wenzelm@5363
     2
==============================================
wenzelm@2553
     3
wenzelm@41651
     4
New in this Isabelle version
wenzelm@41651
     5
----------------------------
wenzelm@41651
     6
wenzelm@41703
     7
*** General ***
wenzelm@41703
     8
wenzelm@41955
     9
* Theory loader: source files are identified by content via SHA1
wenzelm@41955
    10
digests.  Discontinued former path/modtime identification and optional
wenzelm@41955
    11
ISABELLE_FILE_IDENT plugin scripts.
wenzelm@41955
    12
wenzelm@41703
    13
* Parallelization of nested Isar proofs is subject to
wenzelm@41703
    14
Goal.parallel_proofs_threshold (default 100).  See also isabelle
wenzelm@41703
    15
usedir option -Q.
wenzelm@41703
    16
wenzelm@41718
    17
* Discontinued support for Poly/ML 5.2, which was the last version
wenzelm@41718
    18
without proper multithreading and TimeLimit implementation.
wenzelm@41718
    19
wenzelm@41734
    20
* Discontinued old lib/scripts/polyml-platform, which has been
wenzelm@41734
    21
obsolete since Isabelle2009-2.
wenzelm@41734
    22
wenzelm@41886
    23
* Theory loader: source files are exclusively located via the master
wenzelm@41886
    24
directory of each theory node (where the .thy file itself resides).
ballarin@43527
    25
The global load path (such as src/HOL/Library) has been discontinued.
ballarin@43527
    26
Note that the path element ~~ may be used to reference theories in the
ballarin@43527
    27
Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
ballarin@43527
    28
INCOMPATIBILITY.
wenzelm@41886
    29
wenzelm@41950
    30
* Various optional external tools are referenced more robustly and
wenzelm@41952
    31
uniformly by explicit Isabelle settings as follows:
wenzelm@41952
    32
wenzelm@41952
    33
  ISABELLE_CSDP   (formerly CSDP_EXE)
wenzelm@41952
    34
  ISABELLE_GHC    (formerly EXEC_GHC or GHC_PATH)
wenzelm@41952
    35
  ISABELLE_OCAML  (formerly EXEC_OCAML)
wenzelm@41952
    36
  ISABELLE_SWIPL  (formerly EXEC_SWIPL)
wenzelm@41952
    37
  ISABELLE_YAP    (formerly EXEC_YAP)
wenzelm@41952
    38
wenzelm@41952
    39
Note that automated detection from the file-system or search path has
wenzelm@41952
    40
been discontinued.  INCOMPATIBILITY.
wenzelm@41950
    41
wenzelm@42669
    42
* Name space: former unsynchronized references are now proper
wenzelm@42669
    43
configuration options, with more conventional names:
wenzelm@42669
    44
wenzelm@42669
    45
  long_names   ~> names_long
wenzelm@42669
    46
  short_names  ~> names_short
wenzelm@42669
    47
  unique_names ~> names_unique
wenzelm@42669
    48
wenzelm@42669
    49
Minor INCOMPATIBILITY, need to declare options in context like this:
wenzelm@42669
    50
wenzelm@42669
    51
  declare [[names_unique = false]]
wenzelm@42358
    52
wenzelm@42502
    53
* Literal facts `prop` may contain dummy patterns, e.g. `_ = _`.  Note
wenzelm@42502
    54
that the result needs to be unique, which means fact specifications
wenzelm@42502
    55
may have to be refined after enriching a proof context.
wenzelm@42502
    56
wenzelm@42633
    57
* Isabelle/Isar reference manual provides more formal references in
wenzelm@42633
    58
syntax diagrams.
wenzelm@42633
    59
nipkow@44274
    60
* Attribute case_names has been refined: the assumptions in each case can
nipkow@44274
    61
be named now by following the case name with [name1 name2 ...].
nipkow@44274
    62
wenzelm@41703
    63
blanchet@41727
    64
*** HOL ***
blanchet@41727
    65
haftmann@43816
    66
* Classes bot and top require underlying partial order rather than preorder:
haftmann@43815
    67
uniqueness of bot and top is guaranteed.  INCOMPATIBILITY.
haftmann@43815
    68
haftmann@43940
    69
* Class complete_lattice: generalized a couple of lemmas from sets;
haftmann@43940
    70
generalized theorems INF_cong and SUP_cong.  New type classes for complete
huffman@44019
    71
boolean algebras and complete linear orders.  Lemmas Inf_less_iff,
haftmann@43940
    72
less_Sup_iff, INF_less_iff, less_SUP_iff now reside in class complete_linorder.
haftmann@44103
    73
Changed proposition of lemmas Inf_fun_def, Sup_fun_def, Inf_apply, Sup_apply.
haftmann@44103
    74
Redundant lemmas Inf_singleton, Sup_singleton, Inf_binary, Sup_binary,
haftmann@44103
    75
INF_eq, SUP_eq, INF_UNIV_range, SUP_UNIV_range, Int_eq_Inter,
haftmann@44103
    76
INTER_eq_Inter_image, Inter_def, INT_eq, Un_eq_Union, UNION_eq_Union_image,
haftmann@44103
    77
Union_def, UN_singleton, UN_eq have been discarded.
haftmann@43940
    78
More consistent and less misunderstandable names:
haftmann@43872
    79
  INFI_def ~> INF_def
haftmann@43872
    80
  SUPR_def ~> SUP_def
haftmann@44103
    81
  INF_leI ~> INF_lower
haftmann@44103
    82
  INF_leI2 ~> INF_lower2
haftmann@44103
    83
  le_INFI ~> INF_greatest
haftmann@44103
    84
  le_SUPI ~> SUP_upper
haftmann@44103
    85
  le_SUPI2 ~> SUP_upper2
haftmann@44103
    86
  SUP_leI ~> SUP_least
haftmann@43873
    87
  INFI_bool_eq ~> INF_bool_eq
haftmann@43873
    88
  SUPR_bool_eq ~> SUP_bool_eq
haftmann@43873
    89
  INFI_apply ~> INF_apply
haftmann@43873
    90
  SUPR_apply ~> SUP_apply
haftmann@44103
    91
  INTER_def ~> INTER_eq
haftmann@44103
    92
  UNION_def ~> UNION_eq
haftmann@44103
    93
haftmann@43865
    94
INCOMPATIBILITY.
haftmann@43865
    95
haftmann@43967
    96
* Theorem collections ball_simps and bex_simps do not contain theorems referring
haftmann@43967
    97
to UNION any longer;  these have been moved to collection UN_ball_bex_simps.
haftmann@43967
    98
INCOMPATIBILITY.
haftmann@43967
    99
huffman@44019
   100
* Archimedean_Field.thy:
bulwahn@43737
   101
    floor now is defined as parameter of a separate type class floor_ceiling.
bulwahn@43736
   102
 
haftmann@42874
   103
* Finite_Set.thy: more coherent development of fold_set locales:
haftmann@42874
   104
haftmann@42874
   105
    locale fun_left_comm ~> locale comp_fun_commute
haftmann@42874
   106
    locale fun_left_comm_idem ~> locale comp_fun_idem
haftmann@42874
   107
    
haftmann@42874
   108
Both use point-free characterisation; interpretation proofs may need adjustment.
haftmann@42874
   109
INCOMPATIBILITY.
haftmann@42874
   110
bulwahn@42843
   111
* Code generation:
bulwahn@42843
   112
  - theory Library/Code_Char_ord provides native ordering of characters
bulwahn@42843
   113
    in the target language.
bulwahn@43957
   114
  - commands code_module and code_library are legacy, use export_code instead. 
bulwahn@44023
   115
  - method evaluation is legacy, use method eval instead.
bulwahn@44023
   116
  - legacy evaluator "SML" is deactivated by default. To activate it, add the following
bulwahn@44023
   117
    line in your theory:
bulwahn@44023
   118
      setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
bulwahn@44023
   119
 
wenzelm@42815
   120
* Declare ext [intro] by default.  Rare INCOMPATIBILITY.
wenzelm@42815
   121
blanchet@41792
   122
* Nitpick:
blanchet@41877
   123
  - Added "need" and "total_consts" options.
blanchet@41993
   124
  - Reintroduced "show_skolems" option by popular demand.
blanchet@41792
   125
  - Renamed attribute: nitpick_def ~> nitpick_unfold.
blanchet@41792
   126
    INCOMPATIBILITY.
blanchet@41792
   127
blanchet@41727
   128
* Sledgehammer:
blanchet@43627
   129
  - sledgehammer available_provers ~> sledgehammer supported_provers.
blanchet@41727
   130
    INCOMPATIBILITY.
blanchet@42582
   131
  - Added support for SNARK and ToFoF-E on SystemOnTPTP and for simply typed
blanchet@42582
   132
    TPTP problems (TFF).
blanchet@43627
   133
  - Added "preplay_timeout", "slicing", "type_enc", "sound", "max_mono_iters",
blanchet@43627
   134
    and "max_new_mono_instances" options.
blanchet@43627
   135
  - Removed "explicit_apply" and "full_types" options as well as "Full Types"
blanchet@43627
   136
    Proof General menu item. INCOMPATIBILITY.
blanchet@41727
   137
blanchet@43206
   138
* Metis:
blanchet@43573
   139
  - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
blanchet@43573
   140
  - Obsoleted "metisFT" -- use "metis (full_types)" instead. INCOMPATIBILITY.
blanchet@43206
   141
blanchet@41999
   142
* "try":
blanchet@43570
   143
  - Renamed "try_methods" and added "simp:", "intro:", "dest:", and "elim:"
blanchet@43570
   144
    options. INCOMPATIBILITY.
blanchet@43570
   145
  - Introduced "try" that not only runs "try_methods" but also "solve_direct",
blanchet@43570
   146
    "sledgehammer", "quickcheck", and "nitpick".
blanchet@41999
   147
bulwahn@42160
   148
* Quickcheck:
bulwahn@42160
   149
  - Added "eval" option to evaluate terms for the found counterexample
bulwahn@42160
   150
    (currently only supported by the default (exhaustive) tester)
bulwahn@42160
   151
  - Added post-processing of terms to obtain readable counterexamples
bulwahn@42160
   152
    (currently only supported by the default (exhaustive) tester)
bulwahn@43319
   153
  - New counterexample generator quickcheck[narrowing] enables
bulwahn@43319
   154
    narrowing-based testing.
bulwahn@43319
   155
    It requires that the Glasgow Haskell compiler is installed and
bulwahn@43319
   156
    its location is known to Isabelle with the environment variable
bulwahn@43319
   157
    ISABELLE_GHC.
bulwahn@43957
   158
  - Removed quickcheck tester "SML" based on the SML code generator
bulwahn@43957
   159
    from HOL-Library
bulwahn@42160
   160
krauss@41846
   161
* Function package: discontinued option "tailrec".
krauss@41846
   162
INCOMPATIBILITY. Use partial_function instead.
krauss@41846
   163
hoelzl@42149
   164
* HOL-Probability:
hoelzl@42149
   165
  - Caratheodory's extension lemma is now proved for ring_of_sets.
hoelzl@42149
   166
  - Infinite products of probability measures are now available.
hoelzl@42149
   167
  - Use extended reals instead of positive extended reals.
hoelzl@42149
   168
    INCOMPATIBILITY.
blanchet@41727
   169
krauss@44015
   170
* Old recdef package has been moved to Library/Old_Recdef.thy, where it
krauss@44015
   171
must be loaded explicitly.  INCOMPATIBILITY.
krauss@44015
   172
krauss@44015
   173
* Well-founded recursion combinator "wfrec" has been moved to
huffman@44018
   174
Library/Wfrec.thy. INCOMPATIBILITY.
krauss@44015
   175
huffman@44019
   176
* Theory Library/Nat_Infinity has been renamed to Library/Extended_Nat.
huffman@44019
   177
The names of the following types and constants have changed:
huffman@44019
   178
  inat (type) ~> enat
huffman@44019
   179
  Fin         ~> enat
huffman@44019
   180
  Infty       ~> infinity (overloaded)
huffman@44019
   181
  iSuc        ~> eSuc
huffman@44019
   182
  the_Fin     ~> the_enat
huffman@44019
   183
Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
huffman@44019
   184
been renamed accordingly.
huffman@44019
   185
huffman@44081
   186
* Limits.thy: Type "'a net" has been renamed to "'a filter", in
huffman@44081
   187
accordance with standard mathematical terminology. INCOMPATIBILITY.
huffman@44081
   188
huffman@44136
   189
* Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
huffman@44136
   190
to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
huffman@44136
   191
"Cart_nth" and "Cart_lambda" have been respectively renamed to
huffman@44136
   192
"vec_nth" and "vec_lambda"; theorems mentioning those names have
huffman@44136
   193
changed to match. Definition theorems for overloaded constants now use
huffman@44136
   194
the standard "foo_vec_def" naming scheme. A few other theorems have
huffman@44136
   195
been renamed as follows (INCOMPATIBILITY):
huffman@44136
   196
huffman@44136
   197
  Cart_eq          ~> vec_eq_iff
huffman@44136
   198
  dist_nth_le_cart ~> dist_vec_nth_le
huffman@44136
   199
  tendsto_vector   ~> vec_tendstoI
huffman@44136
   200
  Cauchy_vector    ~> vec_CauchyI
huffman@44136
   201
wenzelm@42484
   202
krauss@41685
   203
*** Document preparation ***
krauss@41685
   204
wenzelm@43709
   205
* Discontinued special treatment of hard tabulators, which are better
wenzelm@43709
   206
avoided in the first place.  Implicit tab-width is 1.
wenzelm@43709
   207
wenzelm@42706
   208
* Antiquotation @{rail} layouts railroad syntax diagrams, see also
wenzelm@42706
   209
isar-ref manual.
wenzelm@42633
   210
bulwahn@43613
   211
* Antiquotation @{value} evaluates the given term and presents its result.
bulwahn@43613
   212
wenzelm@42514
   213
* Localized \isabellestyle switch can be used within blocks or groups
wenzelm@42514
   214
like this:
wenzelm@42514
   215
wenzelm@42514
   216
  \isabellestyle{it}  %preferred default
wenzelm@42514
   217
  {\isabellestylett @{text "typewriter stuff"}}
wenzelm@42514
   218
krauss@41685
   219
* New term style "isub" as ad-hoc conversion of variables x1, y23 into
krauss@41685
   220
subscripted form x\<^isub>1, y\<^isub>2\<^isub>3.
wenzelm@41651
   221
wenzelm@42484
   222
* Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
wenzelm@42484
   223
(e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
wenzelm@42484
   224
wenzelm@41651
   225
wenzelm@41944
   226
*** ML ***
wenzelm@41944
   227
wenzelm@43731
   228
* The inner syntax of sort/type/term/prop supports inlined YXML
wenzelm@43731
   229
representations within quoted string tokens.  By encoding logical
wenzelm@43731
   230
entities via Term_XML (in ML or Scala) concrete syntax can be
wenzelm@43731
   231
bypassed, which is particularly useful for producing bits of text
wenzelm@43731
   232
under external program control.
wenzelm@43731
   233
wenzelm@43565
   234
* Antiquotations for ML and document preparation are managed as theory
wenzelm@43565
   235
data, which requires explicit setup.
wenzelm@43565
   236
wenzelm@42897
   237
* Isabelle_Process.is_active allows tools to check if the official
wenzelm@42897
   238
process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
wenzelm@42897
   239
(better known as Proof General).
wenzelm@42897
   240
wenzelm@42360
   241
* Structure Proof_Context follows standard naming scheme.  Old
wenzelm@42360
   242
ProofContext is still available for some time as legacy alias.
wenzelm@42360
   243
wenzelm@42015
   244
* Structure Timing provides various operations for timing; supersedes
wenzelm@42015
   245
former start_timing/end_timing etc.
wenzelm@42015
   246
wenzelm@41944
   247
* Path.print is the official way to show file-system paths to users
wenzelm@41944
   248
(including quotes etc.).
wenzelm@41944
   249
wenzelm@42056
   250
* Inner syntax: identifiers in parse trees of generic categories
wenzelm@42056
   251
"logic", "aprop", "idt" etc. carry position information (disguised as
wenzelm@42056
   252
type constraints).  Occasional INCOMPATIBILITY with non-compliant
wenzelm@42057
   253
translations that choke on unexpected type constraints.  Positions can
wenzelm@42057
   254
be stripped in ML translations via Syntax.strip_positions /
wenzelm@42057
   255
Syntax.strip_positions_ast, or via the syntax constant
wenzelm@42057
   256
"_strip_positions" within parse trees.  As last resort, positions can
wenzelm@42057
   257
be disabled via the configuration option Syntax.positions, which is
wenzelm@42057
   258
called "syntax_positions" in Isar attribute syntax.
wenzelm@42056
   259
wenzelm@42290
   260
* Discontinued special status of various ML structures that contribute
wenzelm@42290
   261
to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
wenzelm@42290
   262
pervasive content, no inclusion in structure Syntax.  INCOMPATIBILITY,
wenzelm@42290
   263
refer directly to Ast.Constant, Lexicon.is_identifier,
wenzelm@42290
   264
Syntax_Trans.mk_binder_tr etc.
wenzelm@42224
   265
wenzelm@42247
   266
* Typed print translation: discontinued show_sorts argument, which is
wenzelm@42247
   267
already available via context of "advanced" translation.
wenzelm@42247
   268
wenzelm@42370
   269
* Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
wenzelm@42370
   270
goal states; body tactic needs to address all subgoals uniformly.
wenzelm@42370
   271
wenzelm@42403
   272
* Slightly more special eq_list/eq_set, with shortcut involving
wenzelm@42403
   273
pointer equality (assumes that eq relation is reflexive).
wenzelm@42403
   274
wenzelm@42793
   275
* Classical tactics use proper Proof.context instead of historic types
wenzelm@42793
   276
claset/clasimpset.  Old-style declarations like addIs, addEs, addDs
wenzelm@42793
   277
operate directly on Proof.context.  Raw type claset retains its use as
wenzelm@42793
   278
snapshot of the classical context, which can be recovered via
wenzelm@42793
   279
(put_claset HOL_cs) etc.  Type clasimpset has been discontinued.
wenzelm@42793
   280
INCOMPATIBILITY, classical tactics and derived proof methods require
wenzelm@42793
   281
proper Proof.context.
wenzelm@42793
   282
wenzelm@43752
   283
* Scala layer provides JVM method invocation service for static
wenzelm@43752
   284
methods of type (String)String, see Invoke_Scala.method in ML.
wenzelm@43752
   285
For example:
wenzelm@43752
   286
wenzelm@43752
   287
  Invoke_Scala.method "java.lang.System.getProperty" "java.home"
wenzelm@43752
   288
wenzelm@41944
   289
wenzelm@41703
   290
wenzelm@41512
   291
New in Isabelle2011 (January 2011)
wenzelm@41512
   292
----------------------------------
wenzelm@37383
   293
wenzelm@37536
   294
*** General ***
wenzelm@37536
   295
wenzelm@41573
   296
* Experimental Prover IDE based on Isabelle/Scala and jEdit (see
wenzelm@41612
   297
src/Tools/jEdit).  This also serves as IDE for Isabelle/ML, with
wenzelm@41612
   298
useful tooltips and hyperlinks produced from its static analysis.  The
wenzelm@41612
   299
bundled component provides an executable Isabelle tool that can be run
wenzelm@41612
   300
like this:
wenzelm@41612
   301
wenzelm@41612
   302
  Isabelle2011/bin/isabelle jedit
wenzelm@41573
   303
wenzelm@40948
   304
* Significantly improved Isabelle/Isar implementation manual.
wenzelm@40948
   305
wenzelm@41594
   306
* System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
wenzelm@41595
   307
(and thus refers to something like $HOME/.isabelle/Isabelle2011),
wenzelm@41594
   308
while the default heap location within that directory lacks that extra
wenzelm@41594
   309
suffix.  This isolates multiple Isabelle installations from each
wenzelm@41594
   310
other, avoiding problems with old settings in new versions.
wenzelm@41594
   311
INCOMPATIBILITY, need to copy/upgrade old user settings manually.
wenzelm@41594
   312
wenzelm@40947
   313
* Source files are always encoded as UTF-8, instead of old-fashioned
wenzelm@40947
   314
ISO-Latin-1.  INCOMPATIBILITY.  Isabelle LaTeX documents might require
wenzelm@40948
   315
the following package declarations:
wenzelm@40947
   316
wenzelm@40947
   317
  \usepackage[utf8]{inputenc}
wenzelm@40947
   318
  \usepackage{textcomp}
wenzelm@40947
   319
krauss@41440
   320
* Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
wenzelm@37536
   321
a Unicode character is treated as a single symbol, not a sequence of
wenzelm@37536
   322
non-ASCII bytes as before.  Since Isabelle/ML string literals may
wenzelm@37536
   323
contain symbols without further backslash escapes, Unicode can now be
wenzelm@37536
   324
used here as well.  Recall that Symbol.explode in ML provides a
wenzelm@37536
   325
consistent view on symbols, while raw explode (or String.explode)
wenzelm@37536
   326
merely give a byte-oriented representation.
wenzelm@37536
   327
wenzelm@41594
   328
* Theory loader: source files are primarily located via the master
wenzelm@41594
   329
directory of each theory node (where the .thy file itself resides).
wenzelm@41594
   330
The global load path is still partially available as legacy feature.
wenzelm@41594
   331
Minor INCOMPATIBILITY due to subtle change in file lookup: use
wenzelm@41594
   332
explicit paths, relatively to the theory.
wenzelm@38135
   333
wenzelm@37939
   334
* Special treatment of ML file names has been discontinued.
wenzelm@37939
   335
Historically, optional extensions .ML or .sml were added on demand --
wenzelm@37939
   336
at the cost of clarity of file dependencies.  Recall that Isabelle/ML
wenzelm@37939
   337
files exclusively use the .ML extension.  Minor INCOMPATIBILTY.
wenzelm@37939
   338
wenzelm@38980
   339
* Various options that affect pretty printing etc. are now properly
wenzelm@38767
   340
handled within the context via configuration options, instead of
wenzelm@40879
   341
unsynchronized references or print modes.  There are both ML Config.T
wenzelm@40879
   342
entities and Isar declaration attributes to access these.
wenzelm@38767
   343
wenzelm@39125
   344
  ML (Config.T)                 Isar (attribute)
wenzelm@39125
   345
wenzelm@39128
   346
  eta_contract                  eta_contract
wenzelm@39137
   347
  show_brackets                 show_brackets
wenzelm@39134
   348
  show_sorts                    show_sorts
wenzelm@39134
   349
  show_types                    show_types
wenzelm@39126
   350
  show_question_marks           show_question_marks
wenzelm@39126
   351
  show_consts                   show_consts
wenzelm@40879
   352
  show_abbrevs                  show_abbrevs
wenzelm@39126
   353
wenzelm@41379
   354
  Syntax.ast_trace              syntax_ast_trace
wenzelm@41379
   355
  Syntax.ast_stat               syntax_ast_stat
wenzelm@39126
   356
  Syntax.ambiguity_level        syntax_ambiguity_level
wenzelm@39126
   357
wenzelm@39126
   358
  Goal_Display.goals_limit      goals_limit
wenzelm@39126
   359
  Goal_Display.show_main_goal   show_main_goal
wenzelm@39126
   360
wenzelm@41379
   361
  Method.rule_trace             rule_trace
wenzelm@41379
   362
wenzelm@39125
   363
  Thy_Output.display            thy_output_display
wenzelm@39125
   364
  Thy_Output.quotes             thy_output_quotes
wenzelm@39125
   365
  Thy_Output.indent             thy_output_indent
wenzelm@39125
   366
  Thy_Output.source             thy_output_source
wenzelm@39125
   367
  Thy_Output.break              thy_output_break
wenzelm@39125
   368
krauss@41440
   369
Note that corresponding "..._default" references in ML may only be
wenzelm@38767
   370
changed globally at the ROOT session setup, but *not* within a theory.
wenzelm@40879
   371
The option "show_abbrevs" supersedes the former print mode
wenzelm@40879
   372
"no_abbrevs" with inverted meaning.
wenzelm@38767
   373
wenzelm@40878
   374
* More systematic naming of some configuration options.
huffman@41294
   375
INCOMPATIBILITY.
wenzelm@40878
   376
wenzelm@40878
   377
  trace_simp  ~>  simp_trace
wenzelm@40878
   378
  debug_simp  ~>  simp_debug
wenzelm@40878
   379
wenzelm@40291
   380
* Support for real valued configuration options, using simplistic
wenzelm@40291
   381
floating-point notation that coincides with the inner syntax for
wenzelm@40291
   382
float_token.
wenzelm@40291
   383
wenzelm@41594
   384
* Support for real valued preferences (with approximative PGIP type):
wenzelm@41594
   385
front-ends need to accept "pgint" values in float notation.
wenzelm@41594
   386
INCOMPATIBILITY.
wenzelm@41573
   387
wenzelm@41573
   388
* The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
wenzelm@41573
   389
DejaVu Sans.
wenzelm@41573
   390
wenzelm@41594
   391
* Discontinued support for Poly/ML 5.0 and 5.1 versions.
wenzelm@41594
   392
wenzelm@40948
   393
wenzelm@40948
   394
*** Pure ***
wenzelm@40948
   395
wenzelm@41249
   396
* Command 'type_synonym' (with single argument) replaces somewhat
wenzelm@41249
   397
outdated 'types', which is still available as legacy feature for some
wenzelm@41249
   398
time.
wenzelm@41249
   399
wenzelm@41249
   400
* Command 'nonterminal' (with 'and' separated list of arguments)
wenzelm@41249
   401
replaces somewhat outdated 'nonterminals'.  INCOMPATIBILITY.
wenzelm@41229
   402
wenzelm@40965
   403
* Command 'notepad' replaces former 'example_proof' for
wenzelm@41020
   404
experimentation in Isar without any result.  INCOMPATIBILITY.
wenzelm@40965
   405
ballarin@41435
   406
* Locale interpretation commands 'interpret' and 'sublocale' accept
ballarin@41435
   407
lists of equations to map definitions in a locale to appropriate
ballarin@41435
   408
entities in the context of the interpretation.  The 'interpretation'
ballarin@41435
   409
command already provided this functionality.
ballarin@41435
   410
wenzelm@41594
   411
* Diagnostic command 'print_dependencies' prints the locale instances
wenzelm@41594
   412
that would be activated if the specified expression was interpreted in
wenzelm@41594
   413
the current context.  Variant "print_dependencies!" assumes a context
wenzelm@41594
   414
without interpretations.
ballarin@38110
   415
ballarin@38110
   416
* Diagnostic command 'print_interps' prints interpretations in proofs
ballarin@38110
   417
in addition to interpretations in theories.
ballarin@38110
   418
wenzelm@38708
   419
* Discontinued obsolete 'global' and 'local' commands to manipulate
wenzelm@38708
   420
the theory name space.  Rare INCOMPATIBILITY.  The ML functions
wenzelm@38708
   421
Sign.root_path and Sign.local_path may be applied directly where this
wenzelm@38708
   422
feature is still required for historical reasons.
wenzelm@38708
   423
wenzelm@40948
   424
* Discontinued obsolete 'constdefs' command.  INCOMPATIBILITY, use
haftmann@39215
   425
'definition' instead.
haftmann@39215
   426
wenzelm@41574
   427
* The "prems" fact, which refers to the accidental collection of
wenzelm@41574
   428
foundational premises in the context, is now explicitly marked as
wenzelm@41594
   429
legacy feature and will be discontinued soon.  Consider using "assms"
wenzelm@41594
   430
of the head statement or reference facts by explicit names.
wenzelm@41574
   431
wenzelm@40801
   432
* Document antiquotations @{class} and @{type} print classes and type
wenzelm@40801
   433
constructors.
wenzelm@40801
   434
wenzelm@40801
   435
* Document antiquotation @{file} checks file/directory entries within
wenzelm@40801
   436
the local file system.
haftmann@39305
   437
ballarin@38110
   438
haftmann@37387
   439
*** HOL ***
haftmann@37387
   440
wenzelm@41594
   441
* Coercive subtyping: functions can be declared as coercions and type
wenzelm@41594
   442
inference will add them as necessary upon input of a term.  Theory
wenzelm@41594
   443
Complex_Main declares real :: nat => real and real :: int => real as
wenzelm@41594
   444
coercions. A coercion function f is declared like this:
wenzelm@40939
   445
wenzelm@40939
   446
  declare [[coercion f]]
nipkow@40866
   447
wenzelm@41571
   448
To lift coercions through type constructors (e.g. from nat => real to
nipkow@40866
   449
nat list => real list), map functions can be declared, e.g.
nipkow@40866
   450
wenzelm@40939
   451
  declare [[coercion_map map]]
wenzelm@40939
   452
wenzelm@40939
   453
Currently coercion inference is activated only in theories including
wenzelm@40939
   454
real numbers, i.e. descendants of Complex_Main.  This is controlled by
wenzelm@41020
   455
the configuration option "coercion_enabled", e.g. it can be enabled in
wenzelm@40939
   456
other theories like this:
wenzelm@40939
   457
wenzelm@40939
   458
  declare [[coercion_enabled]]
nipkow@40866
   459
wenzelm@41571
   460
* Command 'partial_function' provides basic support for recursive
wenzelm@41571
   461
function definitions over complete partial orders.  Concrete instances
krauss@40183
   462
are provided for i) the option type, ii) tail recursion on arbitrary
wenzelm@41571
   463
types, and iii) the heap monad of Imperative_HOL.  See
wenzelm@41571
   464
src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
wenzelm@41571
   465
for examples.
krauss@40183
   466
wenzelm@41571
   467
* Function package: f.psimps rules are no longer implicitly declared
wenzelm@41571
   468
as [simp].  INCOMPATIBILITY.
haftmann@41398
   469
haftmann@41398
   470
* Datatype package: theorems generated for executable equality (class
wenzelm@41571
   471
"eq") carry proper names and are treated as default code equations.
wenzelm@41571
   472
wenzelm@41594
   473
* Inductive package: now offers command 'inductive_simps' to
wenzelm@41594
   474
automatically derive instantiated and simplified equations for
wenzelm@41594
   475
inductive predicates, similar to 'inductive_cases'.
wenzelm@41594
   476
wenzelm@41571
   477
* Command 'enriched_type' allows to register properties of the
wenzelm@41571
   478
functorial structure of types.
haftmann@39771
   479
haftmann@39644
   480
* Improved infrastructure for term evaluation using code generator
haftmann@39644
   481
techniques, in particular static evaluation conversions.
haftmann@39644
   482
wenzelm@41594
   483
* Code generator: Scala (2.8 or higher) has been added to the target
wenzelm@41594
   484
languages.
wenzelm@41594
   485
haftmann@41398
   486
* Code generator: globbing constant expressions "*" and "Theory.*"
haftmann@41398
   487
have been replaced by the more idiomatic "_" and "Theory._".
haftmann@41398
   488
INCOMPATIBILITY.
haftmann@41398
   489
haftmann@41398
   490
* Code generator: export_code without explicit file declaration prints
haftmann@41398
   491
to standard output.  INCOMPATIBILITY.
haftmann@41398
   492
haftmann@41398
   493
* Code generator: do not print function definitions for case
haftmann@41398
   494
combinators any longer.
haftmann@41398
   495
wenzelm@41594
   496
* Code generator: simplification with rules determined with
wenzelm@41571
   497
src/Tools/Code/code_simp.ML and method "code_simp".
wenzelm@41571
   498
wenzelm@41594
   499
* Code generator for records: more idiomatic representation of record
wenzelm@40948
   500
types.  Warning: records are not covered by ancient SML code
wenzelm@40948
   501
generation any longer.  INCOMPATIBILITY.  In cases of need, a suitable
wenzelm@40948
   502
rep_datatype declaration helps to succeed then:
haftmann@38537
   503
haftmann@38537
   504
  record 'a foo = ...
haftmann@38537
   505
  ...
haftmann@38537
   506
  rep_datatype foo_ext ...
haftmann@38535
   507
wenzelm@41594
   508
* Records: logical foundation type for records does not carry a
wenzelm@41594
   509
'_type' suffix any longer (obsolete due to authentic syntax).
wenzelm@41594
   510
INCOMPATIBILITY.
wenzelm@41594
   511
haftmann@41398
   512
* Quickcheck now by default uses exhaustive testing instead of random
wenzelm@41571
   513
testing.  Random testing can be invoked by "quickcheck [random]",
wenzelm@41571
   514
exhaustive testing by "quickcheck [exhaustive]".
haftmann@41398
   515
haftmann@41398
   516
* Quickcheck instantiates polymorphic types with small finite
haftmann@41398
   517
datatypes by default. This enables a simple execution mechanism to
haftmann@41398
   518
handle quantifiers and function equality over the finite datatypes.
haftmann@41398
   519
wenzelm@41571
   520
* Quickcheck random generator has been renamed from "code" to
wenzelm@41571
   521
"random".  INCOMPATIBILITY.
haftmann@41398
   522
haftmann@41398
   523
* Quickcheck now has a configurable time limit which is set to 30
haftmann@41398
   524
seconds by default. This can be changed by adding [timeout = n] to the
haftmann@41398
   525
quickcheck command. The time limit for Auto Quickcheck is still set
haftmann@41398
   526
independently.
haftmann@38461
   527
haftmann@38461
   528
* Quickcheck in locales considers interpretations of that locale for
haftmann@38461
   529
counter example search.
haftmann@38461
   530
blanchet@40059
   531
* Sledgehammer:
wenzelm@41571
   532
  - Added "smt" and "remote_smt" provers based on the "smt" proof
wenzelm@41571
   533
    method. See the Sledgehammer manual for details ("isabelle doc
wenzelm@41571
   534
    sledgehammer").
blanchet@40059
   535
  - Renamed commands:
blanchet@40059
   536
    sledgehammer atp_info ~> sledgehammer running_provers
blanchet@40059
   537
    sledgehammer atp_kill ~> sledgehammer kill_provers
blanchet@40059
   538
    sledgehammer available_atps ~> sledgehammer available_provers
blanchet@40059
   539
    INCOMPATIBILITY.
blanchet@40059
   540
  - Renamed options:
blanchet@40059
   541
    sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
blanchet@40062
   542
    sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
blanchet@40341
   543
    sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
blanchet@40341
   544
    (and "ms" and "min" are no longer supported)
blanchet@40341
   545
    INCOMPATIBILITY.
blanchet@40341
   546
blanchet@40341
   547
* Nitpick:
blanchet@40341
   548
  - Renamed options:
blanchet@40341
   549
    nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
blanchet@40341
   550
    nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
blanchet@40059
   551
    INCOMPATIBILITY.
blanchet@40725
   552
  - Added support for partial quotient types.
blanchet@40725
   553
  - Added local versions of the "Nitpick.register_xxx" functions.
blanchet@40725
   554
  - Added "whack" option.
blanchet@40725
   555
  - Allow registration of quotient types as codatatypes.
blanchet@40725
   556
  - Improved "merge_type_vars" option to merge more types.
blanchet@40725
   557
  - Removed unsound "fast_descrs" option.
blanchet@40725
   558
  - Added custom symmetry breaking for datatypes, making it possible to reach
blanchet@40725
   559
    higher cardinalities.
blanchet@40725
   560
  - Prevent the expansion of too large definitions.
blanchet@39957
   561
wenzelm@41571
   562
* Proof methods "metis" and "meson" now have configuration options
wenzelm@41571
   563
"meson_trace", "metis_trace", and "metis_verbose" that can be enabled
wenzelm@41571
   564
to diagnose these tools. E.g.
wenzelm@41571
   565
wenzelm@41571
   566
    using [[metis_trace = true]]
wenzelm@41571
   567
haftmann@41398
   568
* Auto Solve: Renamed "Auto Solve Direct".  The tool is now available
haftmann@41398
   569
manually as command 'solve_direct'.
haftmann@41398
   570
boehmes@41601
   571
* The default SMT solver Z3 must be enabled explicitly (due to
boehmes@41601
   572
licensing issues) by setting the environment variable
wenzelm@41603
   573
Z3_NON_COMMERCIAL in etc/settings of the component, for example.  For
wenzelm@41603
   574
commercial applications, the SMT solver CVC3 is provided as fall-back;
wenzelm@41603
   575
changing the SMT solver is done via the configuration option
wenzelm@41603
   576
"smt_solver".
boehmes@41432
   577
boehmes@41432
   578
* Remote SMT solvers need to be referred to by the "remote_" prefix,
wenzelm@41571
   579
i.e. "remote_cvc3" and "remote_z3".
wenzelm@41571
   580
wenzelm@41571
   581
* Added basic SMT support for datatypes, records, and typedefs using
wenzelm@41571
   582
the oracle mode (no proofs).  Direct support of pairs has been dropped
wenzelm@41571
   583
in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
wenzelm@41571
   584
support for a similar behavior).  Minor INCOMPATIBILITY.
boehmes@41432
   585
boehmes@40162
   586
* Changed SMT configuration options:
boehmes@40162
   587
  - Renamed:
boehmes@41432
   588
    z3_proofs ~> smt_oracle (with inverted meaning)
boehmes@40162
   589
    z3_trace_assms ~> smt_trace_used_facts
boehmes@40162
   590
    INCOMPATIBILITY.
boehmes@40162
   591
  - Added:
boehmes@40424
   592
    smt_verbose
boehmes@41432
   593
    smt_random_seed
boehmes@40424
   594
    smt_datatypes
boehmes@41432
   595
    smt_infer_triggers
boehmes@41432
   596
    smt_monomorph_limit
boehmes@40162
   597
    cvc3_options
boehmes@41432
   598
    remote_cvc3_options
boehmes@41432
   599
    remote_z3_options
boehmes@40162
   600
    yices_options
blanchet@39957
   601
wenzelm@40948
   602
* Boogie output files (.b2i files) need to be declared in the theory
wenzelm@40948
   603
header.
boehmes@40580
   604
wenzelm@41594
   605
* Simplification procedure "list_to_set_comprehension" rewrites list
wenzelm@41594
   606
comprehensions applied to List.set to set comprehensions.  Occasional
wenzelm@41594
   607
INCOMPATIBILITY, may be deactivated like this:
wenzelm@41594
   608
wenzelm@41594
   609
  declare [[simproc del: list_to_set_comprehension]]
wenzelm@41594
   610
wenzelm@41573
   611
* Removed old version of primrec package.  INCOMPATIBILITY.
haftmann@41398
   612
haftmann@41398
   613
* Removed simplifier congruence rule of "prod_case", as has for long
haftmann@41398
   614
been the case with "split".  INCOMPATIBILITY.
haftmann@41398
   615
haftmann@41398
   616
* String.literal is a type, but not a datatype.  INCOMPATIBILITY.
haftmann@41398
   617
krauss@40388
   618
* Removed [split_format ... and ... and ...] version of
krauss@40388
   619
[split_format].  Potential INCOMPATIBILITY.
krauss@40388
   620
wenzelm@41571
   621
* Predicate "sorted" now defined inductively, with nice induction
wenzelm@41571
   622
rules.  INCOMPATIBILITY: former sorted.simps now named sorted_simps.
haftmann@41398
   623
haftmann@41398
   624
* Constant "contents" renamed to "the_elem", to free the generic name
haftmann@41398
   625
contents for other uses.  INCOMPATIBILITY.
haftmann@41398
   626
haftmann@41398
   627
* Renamed class eq and constant eq (for code generation) to class
haftmann@41398
   628
equal and constant equal, plus renaming of related facts and various
haftmann@41398
   629
tuning.  INCOMPATIBILITY.
haftmann@41398
   630
haftmann@41398
   631
* Dropped type classes mult_mono and mult_mono1.  INCOMPATIBILITY.
haftmann@41398
   632
wenzelm@41571
   633
* Removed output syntax "'a ~=> 'b" for "'a => 'b option".
wenzelm@41571
   634
INCOMPATIBILITY.
haftmann@41398
   635
haftmann@41398
   636
* Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
haftmann@41398
   637
avoid confusion with finite sets.  INCOMPATIBILITY.
haftmann@41398
   638
haftmann@41398
   639
* Abandoned locales equiv, congruent and congruent2 for equivalence
haftmann@41398
   640
relations.  INCOMPATIBILITY: use equivI rather than equiv_intro (same
haftmann@41398
   641
for congruent(2)).
haftmann@41398
   642
haftmann@41398
   643
* Some previously unqualified names have been qualified:
haftmann@41398
   644
haftmann@41398
   645
  types
haftmann@41398
   646
    bool ~> HOL.bool
haftmann@41398
   647
    nat ~> Nat.nat
haftmann@41398
   648
haftmann@41398
   649
  constants
haftmann@41398
   650
    Trueprop ~> HOL.Trueprop
haftmann@41398
   651
    True ~> HOL.True
haftmann@41398
   652
    False ~> HOL.False
haftmann@41398
   653
    op & ~> HOL.conj
haftmann@41398
   654
    op | ~> HOL.disj
haftmann@41398
   655
    op --> ~> HOL.implies
haftmann@41398
   656
    op = ~> HOL.eq
haftmann@41398
   657
    Not ~> HOL.Not
haftmann@41398
   658
    The ~> HOL.The
haftmann@41398
   659
    All ~> HOL.All
haftmann@41398
   660
    Ex ~> HOL.Ex
haftmann@41398
   661
    Ex1 ~> HOL.Ex1
haftmann@41398
   662
    Let ~> HOL.Let
haftmann@41398
   663
    If ~> HOL.If
haftmann@41398
   664
    Ball ~> Set.Ball
haftmann@41398
   665
    Bex ~> Set.Bex
haftmann@41398
   666
    Suc ~> Nat.Suc
haftmann@41398
   667
    Pair ~> Product_Type.Pair
haftmann@41398
   668
    fst ~> Product_Type.fst
haftmann@41398
   669
    snd ~> Product_Type.snd
haftmann@41398
   670
    curry ~> Product_Type.curry
haftmann@41398
   671
    op : ~> Set.member
haftmann@41398
   672
    Collect ~> Set.Collect
haftmann@41398
   673
haftmann@41398
   674
INCOMPATIBILITY.
haftmann@41398
   675
haftmann@41398
   676
* More canonical naming convention for some fundamental definitions:
haftmann@41398
   677
haftmann@41398
   678
    bot_bool_eq ~> bot_bool_def
haftmann@41398
   679
    top_bool_eq ~> top_bool_def
haftmann@41398
   680
    inf_bool_eq ~> inf_bool_def
haftmann@41398
   681
    sup_bool_eq ~> sup_bool_def
haftmann@41398
   682
    bot_fun_eq  ~> bot_fun_def
haftmann@41398
   683
    top_fun_eq  ~> top_fun_def
haftmann@41398
   684
    inf_fun_eq  ~> inf_fun_def
haftmann@41398
   685
    sup_fun_eq  ~> sup_fun_def
haftmann@41398
   686
haftmann@41398
   687
INCOMPATIBILITY.
haftmann@41398
   688
haftmann@41398
   689
* More stylized fact names:
haftmann@41398
   690
haftmann@41398
   691
  expand_fun_eq ~> fun_eq_iff
haftmann@41398
   692
  expand_set_eq ~> set_eq_iff
haftmann@41398
   693
  set_ext       ~> set_eqI
haftmann@41398
   694
  nat_number    ~> eval_nat_numeral
haftmann@41398
   695
haftmann@41398
   696
INCOMPATIBILITY.
haftmann@41398
   697
wenzelm@41571
   698
* Refactoring of code-generation specific operations in theory List:
haftmann@41398
   699
haftmann@41398
   700
  constants
haftmann@41398
   701
    null ~> List.null
haftmann@41398
   702
haftmann@41398
   703
  facts
haftmann@41398
   704
    mem_iff ~> member_def
haftmann@41398
   705
    null_empty ~> null_def
haftmann@41398
   706
haftmann@41398
   707
INCOMPATIBILITY.  Note that these were not supposed to be used
haftmann@41398
   708
regularly unless for striking reasons; their main purpose was code
haftmann@41398
   709
generation.
haftmann@41398
   710
haftmann@41398
   711
Various operations from the Haskell prelude are used for generating
haftmann@41398
   712
Haskell code.
haftmann@41398
   713
wenzelm@41571
   714
* Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV".  Term
wenzelm@41571
   715
"surj f" is now an abbreviation of "range f = UNIV".  The theorems
wenzelm@41571
   716
bij_def and surj_def are unchanged.  INCOMPATIBILITY.
haftmann@41398
   717
haftmann@41398
   718
* Abolished some non-alphabetic type names: "prod" and "sum" replace
haftmann@41398
   719
"*" and "+" respectively.  INCOMPATIBILITY.
haftmann@41398
   720
haftmann@41398
   721
* Name "Plus" of disjoint sum operator "<+>" is now hidden.  Write
wenzelm@41571
   722
"Sum_Type.Plus" instead.
haftmann@41398
   723
haftmann@41398
   724
* Constant "split" has been merged with constant "prod_case"; names of
haftmann@41398
   725
ML functions, facts etc. involving split have been retained so far,
haftmann@41398
   726
though.  INCOMPATIBILITY.
haftmann@41398
   727
haftmann@41398
   728
* Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
haftmann@41398
   729
instead.  INCOMPATIBILITY.
haftmann@41398
   730
wenzelm@41571
   731
* Removed lemma "Option.is_none_none" which duplicates "is_none_def".
haftmann@41398
   732
INCOMPATIBILITY.
haftmann@41398
   733
wenzelm@41594
   734
* Former theory Library/Enum is now part of the HOL-Main image.
wenzelm@41594
   735
INCOMPATIBILITY: all constants of the Enum theory now have to be
wenzelm@41594
   736
referred to by its qualified name.
wenzelm@41594
   737
wenzelm@41594
   738
  enum    ~>  Enum.enum
wenzelm@41594
   739
  nlists  ~>  Enum.nlists
wenzelm@41594
   740
  product ~>  Enum.product
wenzelm@41594
   741
wenzelm@41594
   742
* Theory Library/Monad_Syntax provides do-syntax for monad types.
wenzelm@41594
   743
Syntax in Library/State_Monad has been changed to avoid ambiguities.
wenzelm@41594
   744
INCOMPATIBILITY.
wenzelm@41594
   745
wenzelm@41594
   746
* Theory Library/SetsAndFunctions has been split into
wenzelm@41594
   747
Library/Function_Algebras and Library/Set_Algebras; canonical names
wenzelm@41594
   748
for instance definitions for functions; various improvements.
wenzelm@41594
   749
INCOMPATIBILITY.
wenzelm@41594
   750
wenzelm@41594
   751
* Theory Library/Multiset provides stable quicksort implementation of
wenzelm@41594
   752
sort_key.
wenzelm@41594
   753
wenzelm@41594
   754
* Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
wenzelm@41594
   755
INCOMPATIBILITY.
wenzelm@41594
   756
wenzelm@41594
   757
* Session Multivariate_Analysis: introduced a type class for euclidean
wenzelm@41594
   758
space.  Most theorems are now stated in terms of euclidean spaces
wenzelm@41594
   759
instead of finite cartesian products.
wenzelm@41594
   760
wenzelm@41594
   761
  types
wenzelm@41594
   762
    real ^ 'n ~>  'a::real_vector
wenzelm@41594
   763
              ~>  'a::euclidean_space
wenzelm@41594
   764
              ~>  'a::ordered_euclidean_space
wenzelm@41594
   765
        (depends on your needs)
wenzelm@41594
   766
wenzelm@41594
   767
  constants
wenzelm@41594
   768
     _ $ _        ~> _ $$ _
wenzelm@41594
   769
     \<chi> x. _  ~> \<chi>\<chi> x. _
wenzelm@41594
   770
     CARD('n)     ~> DIM('a)
wenzelm@41594
   771
wenzelm@41594
   772
Also note that the indices are now natural numbers and not from some
wenzelm@41594
   773
finite type. Finite cartesian products of euclidean spaces, products
wenzelm@41594
   774
of euclidean spaces the real and complex numbers are instantiated to
wenzelm@41594
   775
be euclidean_spaces.  INCOMPATIBILITY.
wenzelm@41594
   776
wenzelm@41594
   777
* Session Probability: introduced pextreal as positive extended real
wenzelm@41594
   778
numbers.  Use pextreal as value for measures.  Introduce the
wenzelm@41594
   779
Radon-Nikodym derivative, product spaces and Fubini's theorem for
wenzelm@41594
   780
arbitrary sigma finite measures.  Introduces Lebesgue measure based on
wenzelm@41594
   781
the integral in Multivariate Analysis.  INCOMPATIBILITY.
wenzelm@41594
   782
wenzelm@41594
   783
* Session Imperative_HOL: revamped, corrected dozens of inadequacies.
wenzelm@41594
   784
INCOMPATIBILITY.
wenzelm@41594
   785
wenzelm@41594
   786
* Session SPARK (with image HOL-SPARK) provides commands to load and
wenzelm@41594
   787
prove verification conditions generated by the SPARK Ada program
wenzelm@41594
   788
verifier.  See also src/HOL/SPARK and src/HOL/SPARK/Examples.
berghofe@41567
   789
huffman@40621
   790
ballarin@41433
   791
*** HOL-Algebra ***
ballarin@41433
   792
ballarin@41433
   793
* Theorems for additive ring operations (locale abelian_monoid and
ballarin@41433
   794
descendants) are generated by interpretation from their multiplicative
ballarin@41434
   795
counterparts.  Names (in particular theorem names) have the mandatory
ballarin@41434
   796
qualifier 'add'.  Previous theorem names are redeclared for
ballarin@41434
   797
compatibility.
ballarin@41434
   798
wenzelm@41571
   799
* Structure "int_ring" is now an abbreviation (previously a
ballarin@41434
   800
definition).  This fits more natural with advanced interpretations.
ballarin@41433
   801
ballarin@41433
   802
huffman@40621
   803
*** HOLCF ***
huffman@40621
   804
huffman@40621
   805
* The domain package now runs in definitional mode by default: The
wenzelm@41571
   806
former command 'new_domain' is now called 'domain'.  To use the domain
huffman@40621
   807
package in its original axiomatic mode, use 'domain (unsafe)'.
huffman@40621
   808
INCOMPATIBILITY.
huffman@40621
   809
wenzelm@41571
   810
* The new class "domain" is now the default sort.  Class "predomain"
wenzelm@41571
   811
is an unpointed version of "domain". Theories can be updated by
wenzelm@41571
   812
replacing sort annotations as shown below.  INCOMPATIBILITY.
huffman@40621
   813
huffman@40621
   814
  'a::type ~> 'a::countable
huffman@40621
   815
  'a::cpo  ~> 'a::predomain
huffman@40621
   816
  'a::pcpo ~> 'a::domain
huffman@40621
   817
wenzelm@41571
   818
* The old type class "rep" has been superseded by class "domain".
huffman@40621
   819
Accordingly, users of the definitional package must remove any
wenzelm@41571
   820
"default_sort rep" declarations.  INCOMPATIBILITY.
huffman@40621
   821
huffman@41401
   822
* The domain package (definitional mode) now supports unpointed
huffman@41401
   823
predomain argument types, as long as they are marked 'lazy'. (Strict
wenzelm@41571
   824
arguments must be in class "domain".) For example, the following
huffman@41401
   825
domain definition now works:
huffman@41401
   826
huffman@41401
   827
  domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
huffman@41401
   828
huffman@41401
   829
* Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
wenzelm@41571
   830
instances for types from main HOL: bool, nat, int, char, 'a + 'b,
wenzelm@41571
   831
'a option, and 'a list.  Additionally, it configures fixrec and the
wenzelm@41571
   832
domain package to work with these types.  For example:
huffman@41401
   833
huffman@41401
   834
  fixrec isInl :: "('a + 'b) u -> tr"
huffman@41401
   835
    where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
huffman@41401
   836
huffman@41401
   837
  domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
huffman@41401
   838
wenzelm@41571
   839
* The "(permissive)" option of fixrec has been replaced with a
wenzelm@41571
   840
per-equation "(unchecked)" option. See
wenzelm@41571
   841
src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
wenzelm@41571
   842
wenzelm@41571
   843
* The "bifinite" class no longer fixes a constant "approx"; the class
wenzelm@41571
   844
now just asserts that such a function exists.  INCOMPATIBILITY.
wenzelm@41571
   845
wenzelm@41571
   846
* Former type "alg_defl" has been renamed to "defl".  HOLCF no longer
huffman@41287
   847
defines an embedding of type 'a defl into udom by default; instances
wenzelm@41571
   848
of "bifinite" and "domain" classes are available in
wenzelm@41571
   849
src/HOL/HOLCF/Library/Defl_Bifinite.thy.
wenzelm@41571
   850
wenzelm@41571
   851
* The syntax "REP('a)" has been replaced with "DEFL('a)".
wenzelm@41571
   852
wenzelm@41571
   853
* The predicate "directed" has been removed.  INCOMPATIBILITY.
wenzelm@41571
   854
wenzelm@41571
   855
* The type class "finite_po" has been removed.  INCOMPATIBILITY.
wenzelm@41571
   856
wenzelm@41571
   857
* The function "cprod_map" has been renamed to "prod_map".
huffman@41401
   858
INCOMPATIBILITY.
huffman@41401
   859
huffman@41401
   860
* The monadic bind operator on each powerdomain has new binder syntax
wenzelm@41571
   861
similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
wenzelm@41571
   862
"upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
huffman@41401
   863
huffman@41401
   864
* The infix syntax for binary union on each powerdomain has changed
wenzelm@41571
   865
from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
wenzelm@41571
   866
syntax.  INCOMPATIBILITY.
wenzelm@41571
   867
wenzelm@41571
   868
* The constant "UU" has been renamed to "bottom".  The syntax "UU" is
huffman@41429
   869
still supported as an input translation.
huffman@41429
   870
huffman@40621
   871
* Renamed some theorems (the original names are also still available).
wenzelm@41571
   872
huffman@40621
   873
  expand_fun_below   ~> fun_below_iff
huffman@40621
   874
  below_fun_ext      ~> fun_belowI
huffman@40621
   875
  expand_cfun_eq     ~> cfun_eq_iff
huffman@40621
   876
  ext_cfun           ~> cfun_eqI
huffman@40621
   877
  expand_cfun_below  ~> cfun_below_iff
huffman@40621
   878
  below_cfun_ext     ~> cfun_belowI
huffman@40621
   879
  cont2cont_Rep_CFun ~> cont2cont_APP
huffman@40621
   880
huffman@40621
   881
* The Abs and Rep functions for various types have changed names.
wenzelm@40948
   882
Related theorem names have also changed to match. INCOMPATIBILITY.
wenzelm@41571
   883
huffman@40621
   884
  Rep_CFun  ~> Rep_cfun
huffman@40621
   885
  Abs_CFun  ~> Abs_cfun
huffman@40621
   886
  Rep_Sprod ~> Rep_sprod
huffman@40621
   887
  Abs_Sprod ~> Abs_sprod
huffman@40621
   888
  Rep_Ssum  ~> Rep_ssum
huffman@40621
   889
  Abs_Ssum  ~> Abs_ssum
huffman@40621
   890
huffman@40621
   891
* Lemmas with names of the form *_defined_iff or *_strict_iff have
wenzelm@41571
   892
been renamed to *_bottom_iff.  INCOMPATIBILITY.
huffman@40621
   893
huffman@40621
   894
* Various changes to bisimulation/coinduction with domain package:
wenzelm@41571
   895
wenzelm@41571
   896
  - Definitions of "bisim" constants no longer mention definedness.
wenzelm@41571
   897
  - With mutual recursion, "bisim" predicate is now curried.
huffman@40621
   898
  - With mutual recursion, each type gets a separate coind theorem.
huffman@40621
   899
  - Variable names in bisim_def and coinduct rules have changed.
wenzelm@41571
   900
huffman@40621
   901
INCOMPATIBILITY.
huffman@40621
   902
wenzelm@41571
   903
* Case combinators generated by the domain package for type "foo" are
wenzelm@41571
   904
now named "foo_case" instead of "foo_when".  INCOMPATIBILITY.
huffman@40621
   905
huffman@40771
   906
* Several theorems have been renamed to more accurately reflect the
wenzelm@41571
   907
names of constants and types involved.  INCOMPATIBILITY.
wenzelm@41571
   908
huffman@40771
   909
  thelub_const    ~> lub_const
huffman@40771
   910
  lub_const       ~> is_lub_const
huffman@40771
   911
  thelubI         ~> lub_eqI
huffman@40771
   912
  is_lub_lub      ~> is_lubD2
huffman@40771
   913
  lubI            ~> is_lub_lub
huffman@40771
   914
  unique_lub      ~> is_lub_unique
huffman@40771
   915
  is_ub_lub       ~> is_lub_rangeD1
huffman@40771
   916
  lub_bin_chain   ~> is_lub_bin_chain
huffman@41030
   917
  lub_fun         ~> is_lub_fun
huffman@41030
   918
  thelub_fun      ~> lub_fun
huffman@41031
   919
  thelub_cfun     ~> lub_cfun
huffman@40771
   920
  thelub_Pair     ~> lub_Pair
huffman@40771
   921
  lub_cprod       ~> is_lub_prod
huffman@40771
   922
  thelub_cprod    ~> lub_prod
huffman@40771
   923
  minimal_cprod   ~> minimal_prod
huffman@40771
   924
  inst_cprod_pcpo ~> inst_prod_pcpo
huffman@41430
   925
  UU_I            ~> bottomI
huffman@41430
   926
  compact_UU      ~> compact_bottom
huffman@41430
   927
  deflation_UU    ~> deflation_bottom
huffman@41430
   928
  finite_deflation_UU ~> finite_deflation_bottom
huffman@40771
   929
wenzelm@41571
   930
* Many legacy theorem names have been discontinued.  INCOMPATIBILITY.
wenzelm@41571
   931
huffman@40621
   932
  sq_ord_less_eq_trans ~> below_eq_trans
huffman@40621
   933
  sq_ord_eq_less_trans ~> eq_below_trans
huffman@40621
   934
  refl_less            ~> below_refl
huffman@40621
   935
  trans_less           ~> below_trans
huffman@40621
   936
  antisym_less         ~> below_antisym
huffman@40621
   937
  antisym_less_inverse ~> po_eq_conv [THEN iffD1]
huffman@40621
   938
  box_less             ~> box_below
huffman@40621
   939
  rev_trans_less       ~> rev_below_trans
huffman@40621
   940
  not_less2not_eq      ~> not_below2not_eq
huffman@40621
   941
  less_UU_iff          ~> below_UU_iff
huffman@40621
   942
  flat_less_iff        ~> flat_below_iff
huffman@40621
   943
  adm_less             ~> adm_below
huffman@40621
   944
  adm_not_less         ~> adm_not_below
huffman@40621
   945
  adm_compact_not_less ~> adm_compact_not_below
huffman@40621
   946
  less_fun_def         ~> below_fun_def
huffman@40621
   947
  expand_fun_less      ~> fun_below_iff
huffman@40621
   948
  less_fun_ext         ~> fun_belowI
huffman@40621
   949
  less_discr_def       ~> below_discr_def
huffman@40621
   950
  discr_less_eq        ~> discr_below_eq
huffman@40621
   951
  less_unit_def        ~> below_unit_def
huffman@40621
   952
  less_cprod_def       ~> below_prod_def
huffman@40621
   953
  prod_lessI           ~> prod_belowI
huffman@40621
   954
  Pair_less_iff        ~> Pair_below_iff
huffman@40621
   955
  fst_less_iff         ~> fst_below_iff
huffman@40621
   956
  snd_less_iff         ~> snd_below_iff
huffman@40621
   957
  expand_cfun_less     ~> cfun_below_iff
huffman@40621
   958
  less_cfun_ext        ~> cfun_belowI
huffman@40621
   959
  injection_less       ~> injection_below
huffman@40621
   960
  less_up_def          ~> below_up_def
huffman@40621
   961
  not_Iup_less         ~> not_Iup_below
huffman@40621
   962
  Iup_less             ~> Iup_below
huffman@40621
   963
  up_less              ~> up_below
huffman@40621
   964
  Def_inject_less_eq   ~> Def_below_Def
huffman@40621
   965
  Def_less_is_eq       ~> Def_below_iff
huffman@40621
   966
  spair_less_iff       ~> spair_below_iff
huffman@40621
   967
  less_sprod           ~> below_sprod
huffman@40621
   968
  spair_less           ~> spair_below
huffman@40621
   969
  sfst_less_iff        ~> sfst_below_iff
huffman@40621
   970
  ssnd_less_iff        ~> ssnd_below_iff
huffman@40621
   971
  fix_least_less       ~> fix_least_below
huffman@40621
   972
  dist_less_one        ~> dist_below_one
huffman@40621
   973
  less_ONE             ~> below_ONE
huffman@40621
   974
  ONE_less_iff         ~> ONE_below_iff
huffman@40621
   975
  less_sinlD           ~> below_sinlD
huffman@40621
   976
  less_sinrD           ~> below_sinrD
huffman@40621
   977
huffman@40621
   978
wenzelm@40948
   979
*** FOL and ZF ***
haftmann@38522
   980
wenzelm@41310
   981
* All constant names are now qualified internally and use proper
wenzelm@41310
   982
identifiers, e.g. "IFOL.eq" instead of "op =".  INCOMPATIBILITY.
wenzelm@41310
   983
haftmann@38522
   984
wenzelm@37868
   985
*** ML ***
wenzelm@37868
   986
wenzelm@41594
   987
* Antiquotation @{assert} inlines a function bool -> unit that raises
wenzelm@41594
   988
Fail if the argument is false.  Due to inlining the source position of
wenzelm@41594
   989
failed assertions is included in the error output.
wenzelm@41594
   990
wenzelm@41594
   991
* Discontinued antiquotation @{theory_ref}, which is obsolete since ML
wenzelm@41594
   992
text is in practice always evaluated with a stable theory checkpoint.
wenzelm@41594
   993
Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
wenzelm@41594
   994
wenzelm@41594
   995
* Antiquotation @{theory A} refers to theory A from the ancestry of
wenzelm@41594
   996
the current context, not any accidental theory loader state as before.
wenzelm@41594
   997
Potential INCOMPATIBILITY, subtle change in semantics.
wenzelm@41228
   998
wenzelm@40956
   999
* Syntax.pretty_priority (default 0) configures the required priority
wenzelm@40956
  1000
of pretty-printed output and thus affects insertion of parentheses.
wenzelm@40956
  1001
wenzelm@40959
  1002
* Syntax.default_root (default "any") configures the inner syntax
wenzelm@40959
  1003
category (nonterminal symbol) for parsing of terms.
wenzelm@40959
  1004
wenzelm@40722
  1005
* Former exception Library.UnequalLengths now coincides with
wenzelm@40722
  1006
ListPair.UnequalLengths.
wenzelm@40722
  1007
wenzelm@41594
  1008
* Renamed structure MetaSimplifier to Raw_Simplifier.  Note that the
wenzelm@41594
  1009
main functionality is provided by structure Simplifier.
wenzelm@41594
  1010
wenzelm@40627
  1011
* Renamed raw "explode" function to "raw_explode" to emphasize its
wenzelm@40627
  1012
meaning.  Note that internally to Isabelle, Symbol.explode is used in
wenzelm@40627
  1013
almost all situations.
wenzelm@40627
  1014
wenzelm@40318
  1015
* Discontinued obsolete function sys_error and exception SYS_ERROR.
wenzelm@40318
  1016
See implementation manual for further details on exceptions in
wenzelm@40318
  1017
Isabelle/ML.
wenzelm@40318
  1018
wenzelm@39616
  1019
* Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
wenzelm@39616
  1020
meaning.
wenzelm@39616
  1021
wenzelm@39557
  1022
* Renamed structure PureThy to Pure_Thy and moved most of its
wenzelm@39557
  1023
operations to structure Global_Theory, to emphasize that this is
wenzelm@39557
  1024
rarely-used global-only stuff.
wenzelm@39557
  1025
wenzelm@39513
  1026
* Discontinued Output.debug.  Minor INCOMPATIBILITY, use plain writeln
wenzelm@39513
  1027
instead (or tracing for high-volume output).
wenzelm@39513
  1028
wenzelm@38980
  1029
* Configuration option show_question_marks only affects regular pretty
wenzelm@38980
  1030
printing of types and terms, not raw Term.string_of_vname.
wenzelm@38980
  1031
wenzelm@39164
  1032
* ML_Context.thm and ML_Context.thms are no longer pervasive.  Rare
wenzelm@39164
  1033
INCOMPATIBILITY, superseded by static antiquotations @{thm} and
wenzelm@39164
  1034
@{thms} for most purposes.
wenzelm@39164
  1035
wenzelm@41594
  1036
* ML structure Unsynchronized is never opened, not even in Isar
wenzelm@38980
  1037
interaction mode as before.  Old Unsynchronized.set etc. have been
wenzelm@38980
  1038
discontinued -- use plain := instead.  This should be *rare* anyway,
wenzelm@38980
  1039
since modern tools always work via official context data, notably
wenzelm@38980
  1040
configuration options.
wenzelm@38980
  1041
wenzelm@39239
  1042
* Parallel and asynchronous execution requires special care concerning
wenzelm@39239
  1043
interrupts.  Structure Exn provides some convenience functions that
wenzelm@39239
  1044
avoid working directly with raw Interrupt.  User code must not absorb
wenzelm@39239
  1045
interrupts -- intermediate handling (for cleanup etc.) needs to be
wenzelm@39239
  1046
followed by re-raising of the original exception.  Another common
wenzelm@39239
  1047
source of mistakes are "handle _" patterns, which make the meaning of
wenzelm@39239
  1048
the program subject to physical effects of the environment.
wenzelm@39239
  1049
wenzelm@37868
  1050
wenzelm@37868
  1051
wenzelm@37144
  1052
New in Isabelle2009-2 (June 2010)
wenzelm@37144
  1053
---------------------------------
haftmann@33993
  1054
wenzelm@35260
  1055
*** General ***
wenzelm@35260
  1056
wenzelm@35436
  1057
* Authentic syntax for *all* logical entities (type classes, type
wenzelm@35436
  1058
constructors, term constants): provides simple and robust
wenzelm@35436
  1059
correspondence between formal entities and concrete syntax.  Within
wenzelm@35436
  1060
the parse tree / AST representations, "constants" are decorated by
wenzelm@35436
  1061
their category (class, type, const) and spelled out explicitly with
wenzelm@35436
  1062
their full internal name.
wenzelm@35436
  1063
wenzelm@35436
  1064
Substantial INCOMPATIBILITY concerning low-level syntax declarations
wenzelm@35436
  1065
and translations (translation rules and translation functions in ML).
wenzelm@35436
  1066
Some hints on upgrading:
wenzelm@35260
  1067
wenzelm@35260
  1068
  - Many existing uses of 'syntax' and 'translations' can be replaced
wenzelm@35436
  1069
    by more modern 'type_notation', 'notation' and 'abbreviation',
wenzelm@35436
  1070
    which are independent of this issue.
wenzelm@35260
  1071
wenzelm@35260
  1072
  - 'translations' require markup within the AST; the term syntax
wenzelm@35260
  1073
    provides the following special forms:
wenzelm@35260
  1074
wenzelm@35260
  1075
      CONST c   -- produces syntax version of constant c from context
wenzelm@35261
  1076
      XCONST c  -- literally c, checked as constant from context
wenzelm@35261
  1077
      c         -- literally c, if declared by 'syntax'
wenzelm@35261
  1078
wenzelm@35261
  1079
    Plain identifiers are treated as AST variables -- occasionally the
wenzelm@35261
  1080
    system indicates accidental variables via the error "rhs contains
wenzelm@35261
  1081
    extra variables".
wenzelm@35260
  1082
wenzelm@35436
  1083
    Type classes and type constructors are marked according to their
wenzelm@35436
  1084
    concrete syntax.  Some old translations rules need to be written
wenzelm@35436
  1085
    for the "type" category, using type constructor application
wenzelm@35436
  1086
    instead of pseudo-term application of the default category
wenzelm@35436
  1087
    "logic".
wenzelm@35436
  1088
wenzelm@35260
  1089
  - 'parse_translation' etc. in ML may use the following
wenzelm@35260
  1090
    antiquotations:
wenzelm@35260
  1091
wenzelm@35436
  1092
      @{class_syntax c}   -- type class c within parse tree / AST
wenzelm@35436
  1093
      @{term_syntax c}    -- type constructor c within parse tree / AST
wenzelm@35260
  1094
      @{const_syntax c}   -- ML version of "CONST c" above
wenzelm@35260
  1095
      @{syntax_const c}   -- literally c (checked wrt. 'syntax' declarations)
wenzelm@35260
  1096
wenzelm@35436
  1097
  - Literal types within 'typed_print_translations', i.e. those *not*
wenzelm@35436
  1098
    represented as pseudo-terms are represented verbatim.  Use @{class
wenzelm@35436
  1099
    c} or @{type_name c} here instead of the above syntax
wenzelm@35436
  1100
    antiquotations.
wenzelm@35436
  1101
wenzelm@35260
  1102
Note that old non-authentic syntax was based on unqualified base
wenzelm@35436
  1103
names, so all of the above "constant" names would coincide.  Recall
wenzelm@35436
  1104
that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
wenzelm@35436
  1105
diagnose syntax problems.
wenzelm@35260
  1106
wenzelm@35351
  1107
* Type constructors admit general mixfix syntax, not just infix.
wenzelm@35351
  1108
wenzelm@36508
  1109
* Concrete syntax may be attached to local entities without a proof
wenzelm@36508
  1110
body, too.  This works via regular mixfix annotations for 'fix',
wenzelm@36508
  1111
'def', 'obtain' etc. or via the explicit 'write' command, which is
wenzelm@36508
  1112
similar to the 'notation' command in theory specifications.
wenzelm@36508
  1113
wenzelm@37351
  1114
* Discontinued unnamed infix syntax (legacy feature for many years) --
wenzelm@37351
  1115
need to specify constant name and syntax separately.  Internal ML
wenzelm@37351
  1116
datatype constructors have been renamed from InfixName to Infix etc.
wenzelm@37351
  1117
Minor INCOMPATIBILITY.
wenzelm@37351
  1118
wenzelm@37351
  1119
* Schematic theorem statements need to be explicitly markup as such,
wenzelm@37351
  1120
via commands 'schematic_lemma', 'schematic_theorem',
wenzelm@37351
  1121
'schematic_corollary'.  Thus the relevance of the proof is made
wenzelm@37351
  1122
syntactically clear, which impacts performance in a parallel or
wenzelm@37351
  1123
asynchronous interactive environment.  Minor INCOMPATIBILITY.
wenzelm@37351
  1124
wenzelm@35613
  1125
* Use of cumulative prems via "!" in some proof methods has been
wenzelm@37351
  1126
discontinued (old legacy feature).
wenzelm@35613
  1127
boehmes@35979
  1128
* References 'trace_simp' and 'debug_simp' have been replaced by
wenzelm@36857
  1129
configuration options stored in the context. Enabling tracing (the
wenzelm@36857
  1130
case of debugging is similar) in proofs works via
wenzelm@36857
  1131
wenzelm@36857
  1132
  using [[trace_simp = true]]
wenzelm@36857
  1133
wenzelm@36857
  1134
Tracing is then active for all invocations of the simplifier in
wenzelm@36857
  1135
subsequent goal refinement steps. Tracing may also still be enabled or
wenzelm@40780
  1136
disabled via the ProofGeneral settings menu.
boehmes@35979
  1137
wenzelm@36177
  1138
* Separate commands 'hide_class', 'hide_type', 'hide_const',
wenzelm@36177
  1139
'hide_fact' replace the former 'hide' KIND command.  Minor
wenzelm@36177
  1140
INCOMPATIBILITY.
wenzelm@36177
  1141
wenzelm@37298
  1142
* Improved parallelism of proof term normalization: usedir -p2 -q0 is
wenzelm@37298
  1143
more efficient than combinations with -q1 or -q2.
wenzelm@37298
  1144
wenzelm@35260
  1145
haftmann@34170
  1146
*** Pure ***
haftmann@34170
  1147
wenzelm@37351
  1148
* Proofterms record type-class reasoning explicitly, using the
wenzelm@37351
  1149
"unconstrain" operation internally.  This eliminates all sort
wenzelm@37351
  1150
constraints from a theorem and proof, introducing explicit
wenzelm@37351
  1151
OFCLASS-premises.  On the proof term level, this operation is
wenzelm@37351
  1152
automatically applied at theorem boundaries, such that closed proofs
wenzelm@37351
  1153
are always free of sort constraints.  INCOMPATIBILITY for tools that
wenzelm@37351
  1154
inspect proof terms.
haftmann@36147
  1155
wenzelm@35765
  1156
* Local theory specifications may depend on extra type variables that
wenzelm@35765
  1157
are not present in the result type -- arguments TYPE('a) :: 'a itself
wenzelm@35765
  1158
are added internally.  For example:
wenzelm@35765
  1159
wenzelm@35765
  1160
  definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
wenzelm@35765
  1161
wenzelm@37351
  1162
* Predicates of locales introduced by classes carry a mandatory
wenzelm@37351
  1163
"class" prefix.  INCOMPATIBILITY.
wenzelm@37351
  1164
wenzelm@37351
  1165
* Vacuous class specifications observe default sort.  INCOMPATIBILITY.
wenzelm@37351
  1166
wenzelm@37351
  1167
* Old 'axclass' command has been discontinued.  INCOMPATIBILITY, use
wenzelm@37351
  1168
'class' instead.
wenzelm@37351
  1169
wenzelm@37351
  1170
* Command 'code_reflect' allows to incorporate generated ML code into
wenzelm@37351
  1171
runtime environment; replaces immature code_datatype antiquotation.
wenzelm@37351
  1172
INCOMPATIBILITY.
wenzelm@37351
  1173
wenzelm@37351
  1174
* Code generator: simple concept for abstract datatypes obeying
wenzelm@37351
  1175
invariants.
wenzelm@37351
  1176
wenzelm@36857
  1177
* Code generator: details of internal data cache have no impact on the
wenzelm@36857
  1178
user space functionality any longer.
wenzelm@36857
  1179
wenzelm@37351
  1180
* Methods "unfold_locales" and "intro_locales" ignore non-locale
wenzelm@37351
  1181
subgoals.  This is more appropriate for interpretations with 'where'.
wenzelm@36857
  1182
INCOMPATIBILITY.
haftmann@34170
  1183
wenzelm@36356
  1184
* Command 'example_proof' opens an empty proof body.  This allows to
wenzelm@36356
  1185
experiment with Isar, without producing any persistent result.
wenzelm@36356
  1186
wenzelm@35413
  1187
* Commands 'type_notation' and 'no_type_notation' declare type syntax
wenzelm@35413
  1188
within a local theory context, with explicit checking of the
wenzelm@35413
  1189
constructors involved (in contrast to the raw 'syntax' versions).
wenzelm@35413
  1190
wenzelm@36178
  1191
* Commands 'types' and 'typedecl' now work within a local theory
wenzelm@36178
  1192
context -- without introducing dependencies on parameters or
wenzelm@36178
  1193
assumptions, which is not possible in Isabelle/Pure.
wenzelm@35681
  1194
wenzelm@36857
  1195
* Command 'defaultsort' has been renamed to 'default_sort', it works
wenzelm@36857
  1196
within a local theory context.  Minor INCOMPATIBILITY.
wenzelm@36454
  1197
haftmann@34170
  1198
haftmann@33993
  1199
*** HOL ***
haftmann@33993
  1200
wenzelm@37351
  1201
* Command 'typedef' now works within a local theory context -- without
wenzelm@37351
  1202
introducing dependencies on parameters or assumptions, which is not
wenzelm@37351
  1203
possible in Isabelle/Pure/HOL.  Note that the logical environment may
wenzelm@37351
  1204
contain multiple interpretations of local typedefs (with different
wenzelm@37351
  1205
non-emptiness proofs), even in a global theory context.
wenzelm@37351
  1206
wenzelm@37351
  1207
* New package for quotient types.  Commands 'quotient_type' and
wenzelm@37351
  1208
'quotient_definition' may be used for defining types and constants by
wenzelm@37351
  1209
quotient constructions.  An example is the type of integers created by
wenzelm@37351
  1210
quotienting pairs of natural numbers:
wenzelm@37380
  1211
wenzelm@37351
  1212
  fun
wenzelm@37380
  1213
    intrel :: "(nat * nat) => (nat * nat) => bool"
wenzelm@37351
  1214
  where
wenzelm@37351
  1215
    "intrel (x, y) (u, v) = (x + v = u + y)"
wenzelm@37351
  1216
wenzelm@37380
  1217
  quotient_type int = "nat * nat" / intrel
wenzelm@37351
  1218
    by (auto simp add: equivp_def expand_fun_eq)
wenzelm@37380
  1219
wenzelm@37351
  1220
  quotient_definition
wenzelm@37351
  1221
    "0::int" is "(0::nat, 0::nat)"
wenzelm@37351
  1222
wenzelm@37351
  1223
The method "lifting" can be used to lift of theorems from the
wenzelm@37351
  1224
underlying "raw" type to the quotient type.  The example
wenzelm@37351
  1225
src/HOL/Quotient_Examples/FSet.thy includes such a quotient
wenzelm@37351
  1226
construction and provides a reasoning infrastructure for finite sets.
wenzelm@37351
  1227
wenzelm@37351
  1228
* Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
wenzelm@37351
  1229
clash with new theory Quotient in Main HOL.
wenzelm@37351
  1230
wenzelm@37351
  1231
* Moved the SMT binding into the main HOL session, eliminating
wenzelm@37351
  1232
separate HOL-SMT session.
wenzelm@37351
  1233
haftmann@37020
  1234
* List membership infix mem operation is only an input abbreviation.
haftmann@37020
  1235
INCOMPATIBILITY.
haftmann@37020
  1236
wenzelm@37144
  1237
* Theory Library/Word.thy has been removed.  Use library Word/Word.thy
wenzelm@37144
  1238
for future developements; former Library/Word.thy is still present in
wenzelm@37144
  1239
the AFP entry RSAPPS.
haftmann@36963
  1240
wenzelm@36857
  1241
* Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
wenzelm@36857
  1242
longer shadowed.  INCOMPATIBILITY.
haftmann@36808
  1243
huffman@36836
  1244
* Dropped theorem duplicate comp_arith; use semiring_norm instead.
huffman@36836
  1245
INCOMPATIBILITY.
huffman@36836
  1246
huffman@36836
  1247
* Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
huffman@36836
  1248
INCOMPATIBILITY.
haftmann@36714
  1249
wenzelm@36857
  1250
* Dropped normalizing_semiring etc; use the facts in semiring classes
wenzelm@36857
  1251
instead.  INCOMPATIBILITY.
wenzelm@36857
  1252
huffman@36979
  1253
* Dropped several real-specific versions of lemmas about floor and
wenzelm@37351
  1254
ceiling; use the generic lemmas from theory "Archimedean_Field"
wenzelm@37351
  1255
instead.  INCOMPATIBILITY.
huffman@36979
  1256
huffman@36979
  1257
  floor_number_of_eq         ~> floor_number_of
huffman@36979
  1258
  le_floor_eq_number_of      ~> number_of_le_floor
huffman@36979
  1259
  le_floor_eq_zero           ~> zero_le_floor
huffman@36979
  1260
  le_floor_eq_one            ~> one_le_floor
huffman@36979
  1261
  floor_less_eq_number_of    ~> floor_less_number_of
huffman@36979
  1262
  floor_less_eq_zero         ~> floor_less_zero
huffman@36979
  1263
  floor_less_eq_one          ~> floor_less_one
huffman@36979
  1264
  less_floor_eq_number_of    ~> number_of_less_floor
huffman@36979
  1265
  less_floor_eq_zero         ~> zero_less_floor
huffman@36979
  1266
  less_floor_eq_one          ~> one_less_floor
huffman@36979
  1267
  floor_le_eq_number_of      ~> floor_le_number_of
huffman@36979
  1268
  floor_le_eq_zero           ~> floor_le_zero
huffman@36979
  1269
  floor_le_eq_one            ~> floor_le_one
huffman@36979
  1270
  floor_subtract_number_of   ~> floor_diff_number_of
huffman@36979
  1271
  floor_subtract_one         ~> floor_diff_one
huffman@36979
  1272
  ceiling_number_of_eq       ~> ceiling_number_of
huffman@36979
  1273
  ceiling_le_eq_number_of    ~> ceiling_le_number_of
huffman@36979
  1274
  ceiling_le_zero_eq         ~> ceiling_le_zero
huffman@36979
  1275
  ceiling_le_eq_one          ~> ceiling_le_one
huffman@36979
  1276
  less_ceiling_eq_number_of  ~> number_of_less_ceiling
huffman@36979
  1277
  less_ceiling_eq_zero       ~> zero_less_ceiling
huffman@36979
  1278
  less_ceiling_eq_one        ~> one_less_ceiling
huffman@36979
  1279
  ceiling_less_eq_number_of  ~> ceiling_less_number_of
huffman@36979
  1280
  ceiling_less_eq_zero       ~> ceiling_less_zero
huffman@36979
  1281
  ceiling_less_eq_one        ~> ceiling_less_one
huffman@36979
  1282
  le_ceiling_eq_number_of    ~> number_of_le_ceiling
huffman@36979
  1283
  le_ceiling_eq_zero         ~> zero_le_ceiling
huffman@36979
  1284
  le_ceiling_eq_one          ~> one_le_ceiling
huffman@36979
  1285
  ceiling_subtract_number_of ~> ceiling_diff_number_of
huffman@36979
  1286
  ceiling_subtract_one       ~> ceiling_diff_one
huffman@36979
  1287
wenzelm@37144
  1288
* Theory "Finite_Set": various folding_XXX locales facilitate the
wenzelm@36857
  1289
application of the various fold combinators on finite sets.
wenzelm@36857
  1290
wenzelm@36857
  1291
* Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
wenzelm@36857
  1292
provides abstract red-black tree type which is backed by "RBT_Impl" as
wenzelm@36857
  1293
implementation.  INCOMPATIBILTY.
haftmann@36147
  1294
huffman@36830
  1295
* Theory Library/Coinductive_List has been removed -- superseded by
wenzelm@35763
  1296
AFP/thys/Coinductive.
wenzelm@35763
  1297
huffman@36829
  1298
* Theory PReal, including the type "preal" and related operations, has
huffman@36829
  1299
been removed.  INCOMPATIBILITY.
huffman@36829
  1300
wenzelm@37380
  1301
* Real: new development using Cauchy Sequences.
wenzelm@37380
  1302
wenzelm@37351
  1303
* Split off theory "Big_Operators" containing setsum, setprod,
wenzelm@37351
  1304
Inf_fin, Sup_fin, Min, Max from theory Finite_Set.  INCOMPATIBILITY.
wenzelm@36857
  1305
wenzelm@36857
  1306
* Theory "Rational" renamed to "Rat", for consistency with "Nat",
wenzelm@36857
  1307
"Int" etc.  INCOMPATIBILITY.
wenzelm@36857
  1308
wenzelm@37351
  1309
* Constant Rat.normalize needs to be qualified.  INCOMPATIBILITY.
wenzelm@37143
  1310
wenzelm@36857
  1311
* New set of rules "ac_simps" provides combined assoc / commute
wenzelm@36857
  1312
rewrites for all interpretations of the appropriate generic locales.
wenzelm@36857
  1313
wenzelm@36857
  1314
* Renamed theory "OrderedGroup" to "Groups" and split theory
wenzelm@36857
  1315
"Ring_and_Field" into theories "Rings" and "Fields"; for more
wenzelm@36857
  1316
appropriate and more consistent names suitable for name prefixes
wenzelm@36857
  1317
within the HOL theories.  INCOMPATIBILITY.
haftmann@35050
  1318
haftmann@35084
  1319
* Some generic constants have been put to appropriate theories:
wenzelm@36857
  1320
  - less_eq, less: Orderings
wenzelm@36857
  1321
  - zero, one, plus, minus, uminus, times, abs, sgn: Groups
wenzelm@36857
  1322
  - inverse, divide: Rings
haftmann@35084
  1323
INCOMPATIBILITY.
haftmann@35084
  1324
wenzelm@36857
  1325
* More consistent naming of type classes involving orderings (and
wenzelm@36857
  1326
lattices):
haftmann@35027
  1327
haftmann@35027
  1328
    lower_semilattice                   ~> semilattice_inf
haftmann@35027
  1329
    upper_semilattice                   ~> semilattice_sup
haftmann@35027
  1330
haftmann@35027
  1331
    dense_linear_order                  ~> dense_linorder
haftmann@35027
  1332
haftmann@35027
  1333
    pordered_ab_group_add               ~> ordered_ab_group_add
haftmann@35027
  1334
    pordered_ab_group_add_abs           ~> ordered_ab_group_add_abs
haftmann@35027
  1335
    pordered_ab_semigroup_add           ~> ordered_ab_semigroup_add
haftmann@35027
  1336
    pordered_ab_semigroup_add_imp_le    ~> ordered_ab_semigroup_add_imp_le
haftmann@35027
  1337
    pordered_cancel_ab_semigroup_add    ~> ordered_cancel_ab_semigroup_add
haftmann@35027
  1338
    pordered_cancel_comm_semiring       ~> ordered_cancel_comm_semiring
haftmann@35027
  1339
    pordered_cancel_semiring            ~> ordered_cancel_semiring
haftmann@35027
  1340
    pordered_comm_monoid_add            ~> ordered_comm_monoid_add
haftmann@35027
  1341
    pordered_comm_ring                  ~> ordered_comm_ring
haftmann@35027
  1342
    pordered_comm_semiring              ~> ordered_comm_semiring
haftmann@35027
  1343
    pordered_ring                       ~> ordered_ring
haftmann@35027
  1344
    pordered_ring_abs                   ~> ordered_ring_abs
haftmann@35027
  1345
    pordered_semiring                   ~> ordered_semiring
haftmann@35027
  1346
haftmann@35027
  1347
    ordered_ab_group_add                ~> linordered_ab_group_add
haftmann@35027
  1348
    ordered_ab_semigroup_add            ~> linordered_ab_semigroup_add
haftmann@35027
  1349
    ordered_cancel_ab_semigroup_add     ~> linordered_cancel_ab_semigroup_add
haftmann@35027
  1350
    ordered_comm_semiring_strict        ~> linordered_comm_semiring_strict
haftmann@35027
  1351
    ordered_field                       ~> linordered_field
haftmann@35027
  1352
    ordered_field_no_lb                 ~> linordered_field_no_lb
haftmann@35027
  1353
    ordered_field_no_ub                 ~> linordered_field_no_ub
haftmann@35027
  1354
    ordered_field_dense_linear_order    ~> dense_linordered_field
haftmann@35027
  1355
    ordered_idom                        ~> linordered_idom
haftmann@35027
  1356
    ordered_ring                        ~> linordered_ring
haftmann@35027
  1357
    ordered_ring_le_cancel_factor       ~> linordered_ring_le_cancel_factor
haftmann@35027
  1358
    ordered_ring_less_cancel_factor     ~> linordered_ring_less_cancel_factor
haftmann@35027
  1359
    ordered_ring_strict                 ~> linordered_ring_strict
haftmann@35027
  1360
    ordered_semidom                     ~> linordered_semidom
haftmann@35027
  1361
    ordered_semiring                    ~> linordered_semiring
haftmann@35027
  1362
    ordered_semiring_1                  ~> linordered_semiring_1
haftmann@35027
  1363
    ordered_semiring_1_strict           ~> linordered_semiring_1_strict
haftmann@35027
  1364
    ordered_semiring_strict             ~> linordered_semiring_strict
haftmann@35027
  1365
wenzelm@36857
  1366
  The following slightly odd type classes have been moved to a
wenzelm@37351
  1367
  separate theory Library/Lattice_Algebras:
haftmann@35032
  1368
haftmann@35032
  1369
    lordered_ab_group_add               ~> lattice_ab_group_add
haftmann@35032
  1370
    lordered_ab_group_add_abs           ~> lattice_ab_group_add_abs
haftmann@35032
  1371
    lordered_ab_group_add_meet          ~> semilattice_inf_ab_group_add
haftmann@35032
  1372
    lordered_ab_group_add_join          ~> semilattice_sup_ab_group_add
haftmann@35032
  1373
    lordered_ring                       ~> lattice_ring
haftmann@35032
  1374
haftmann@35027
  1375
INCOMPATIBILITY.
haftmann@35027
  1376
haftmann@36416
  1377
* Refined field classes:
wenzelm@36857
  1378
  - classes division_ring_inverse_zero, field_inverse_zero,
wenzelm@36857
  1379
    linordered_field_inverse_zero include rule inverse 0 = 0 --
wenzelm@36857
  1380
    subsumes former division_by_zero class;
wenzelm@36857
  1381
  - numerous lemmas have been ported from field to division_ring.
wenzelm@36857
  1382
INCOMPATIBILITY.
haftmann@36416
  1383
haftmann@36416
  1384
* Refined algebra theorem collections:
wenzelm@36857
  1385
  - dropped theorem group group_simps, use algebra_simps instead;
wenzelm@36857
  1386
  - dropped theorem group ring_simps, use field_simps instead;
wenzelm@36857
  1387
  - proper theorem collection field_simps subsumes former theorem
wenzelm@36857
  1388
    groups field_eq_simps and field_simps;
wenzelm@36857
  1389
  - dropped lemma eq_minus_self_iff which is a duplicate for
wenzelm@36857
  1390
    equal_neg_zero.
wenzelm@36857
  1391
INCOMPATIBILITY.
wenzelm@35009
  1392
wenzelm@35009
  1393
* Theory Finite_Set and List: some lemmas have been generalized from
wenzelm@34076
  1394
sets to lattices:
wenzelm@34076
  1395
haftmann@34007
  1396
  fun_left_comm_idem_inter      ~> fun_left_comm_idem_inf
haftmann@34007
  1397
  fun_left_comm_idem_union      ~> fun_left_comm_idem_sup
haftmann@34007
  1398
  inter_Inter_fold_inter        ~> inf_Inf_fold_inf
haftmann@34007
  1399
  union_Union_fold_union        ~> sup_Sup_fold_sup
haftmann@34007
  1400
  Inter_fold_inter              ~> Inf_fold_inf
haftmann@34007
  1401
  Union_fold_union              ~> Sup_fold_sup
haftmann@34007
  1402
  inter_INTER_fold_inter        ~> inf_INFI_fold_inf
haftmann@34007
  1403
  union_UNION_fold_union        ~> sup_SUPR_fold_sup
haftmann@34007
  1404
  INTER_fold_inter              ~> INFI_fold_inf
haftmann@34007
  1405
  UNION_fold_union              ~> SUPR_fold_sup
haftmann@34007
  1406
wenzelm@37351
  1407
* Theory "Complete_Lattice": lemmas top_def and bot_def have been
haftmann@36416
  1408
replaced by the more convenient lemmas Inf_empty and Sup_empty.
haftmann@36416
  1409
Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
haftmann@36416
  1410
by Inf_insert and Sup_insert.  Lemmas Inf_UNIV and Sup_UNIV replace
haftmann@36416
  1411
former Inf_Univ and Sup_Univ.  Lemmas inf_top_right and sup_bot_right
haftmann@36416
  1412
subsume inf_top and sup_bot respectively.  INCOMPATIBILITY.
haftmann@36416
  1413
wenzelm@36857
  1414
* Reorganized theory Multiset: swapped notation of pointwise and
wenzelm@36857
  1415
multiset order:
wenzelm@37351
  1416
wenzelm@36857
  1417
  - pointwise ordering is instance of class order with standard syntax
wenzelm@36857
  1418
    <= and <;
wenzelm@36857
  1419
  - multiset ordering has syntax <=# and <#; partial order properties
wenzelm@36857
  1420
    are provided by means of interpretation with prefix
wenzelm@36857
  1421
    multiset_order;
wenzelm@36857
  1422
  - less duplication, less historical organization of sections,
wenzelm@36857
  1423
    conversion from associations lists to multisets, rudimentary code
wenzelm@36857
  1424
    generation;
wenzelm@36857
  1425
  - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
wenzelm@36857
  1426
    if needed.
wenzelm@37351
  1427
nipkow@36903
  1428
Renamed:
wenzelm@37351
  1429
wenzelm@37351
  1430
  multiset_eq_conv_count_eq  ~>  multiset_ext_iff
wenzelm@37351
  1431
  multi_count_ext  ~>  multiset_ext
wenzelm@37351
  1432
  diff_union_inverse2  ~>  diff_union_cancelR
wenzelm@37351
  1433
wenzelm@36857
  1434
INCOMPATIBILITY.
haftmann@36416
  1435
nipkow@36903
  1436
* Theory Permutation: replaced local "remove" by List.remove1.
nipkow@36903
  1437
haftmann@36416
  1438
* Code generation: ML and OCaml code is decorated with signatures.
haftmann@36416
  1439
wenzelm@35009
  1440
* Theory List: added transpose.
wenzelm@35009
  1441
huffman@35810
  1442
* Library/Nat_Bijection.thy is a collection of bijective functions
huffman@35810
  1443
between nat and other types, which supersedes the older libraries
huffman@35810
  1444
Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy.  INCOMPATIBILITY.
huffman@35810
  1445
huffman@35810
  1446
  Constants:
huffman@35810
  1447
  Nat_Int_Bij.nat2_to_nat         ~> prod_encode
huffman@35810
  1448
  Nat_Int_Bij.nat_to_nat2         ~> prod_decode
huffman@35810
  1449
  Nat_Int_Bij.int_to_nat_bij      ~> int_encode
huffman@35810
  1450
  Nat_Int_Bij.nat_to_int_bij      ~> int_decode
huffman@35810
  1451
  Countable.pair_encode           ~> prod_encode
huffman@35810
  1452
  NatIso.prod2nat                 ~> prod_encode
huffman@35810
  1453
  NatIso.nat2prod                 ~> prod_decode
huffman@35810
  1454
  NatIso.sum2nat                  ~> sum_encode
huffman@35810
  1455
  NatIso.nat2sum                  ~> sum_decode
huffman@35810
  1456
  NatIso.list2nat                 ~> list_encode
huffman@35810
  1457
  NatIso.nat2list                 ~> list_decode
huffman@35810
  1458
  NatIso.set2nat                  ~> set_encode
huffman@35810
  1459
  NatIso.nat2set                  ~> set_decode
huffman@35810
  1460
huffman@35810
  1461
  Lemmas:
huffman@35810
  1462
  Nat_Int_Bij.bij_nat_to_int_bij  ~> bij_int_decode
huffman@35810
  1463
  Nat_Int_Bij.nat2_to_nat_inj     ~> inj_prod_encode
huffman@35810
  1464
  Nat_Int_Bij.nat2_to_nat_surj    ~> surj_prod_encode
huffman@35810
  1465
  Nat_Int_Bij.nat_to_nat2_inj     ~> inj_prod_decode
huffman@35810
  1466
  Nat_Int_Bij.nat_to_nat2_surj    ~> surj_prod_decode
huffman@35810
  1467
  Nat_Int_Bij.i2n_n2i_id          ~> int_encode_inverse
huffman@35810
  1468
  Nat_Int_Bij.n2i_i2n_id          ~> int_decode_inverse
huffman@35810
  1469
  Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
huffman@35810
  1470
  Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
huffman@35810
  1471
  Nat_Int_Bij.inj_nat_to_int_bij  ~> inj_int_encode
huffman@35810
  1472
  Nat_Int_Bij.inj_int_to_nat_bij  ~> inj_int_decode
huffman@35810
  1473
  Nat_Int_Bij.bij_nat_to_int_bij  ~> bij_int_encode
huffman@35810
  1474
  Nat_Int_Bij.bij_int_to_nat_bij  ~> bij_int_decode
huffman@35810
  1475
blanchet@36929
  1476
* Sledgehammer:
blanchet@36929
  1477
  - Renamed ATP commands:
blanchet@36929
  1478
    atp_info     ~> sledgehammer running_atps
blanchet@36929
  1479
    atp_kill     ~> sledgehammer kill_atps
blanchet@36929
  1480
    atp_messages ~> sledgehammer messages
blanchet@36929
  1481
    atp_minimize ~> sledgehammer minimize
blanchet@36929
  1482
    print_atps   ~> sledgehammer available_atps
blanchet@36929
  1483
    INCOMPATIBILITY.
blanchet@36929
  1484
  - Added user's manual ("isabelle doc sledgehammer").
blanchet@36929
  1485
  - Added option syntax and "sledgehammer_params" to customize
blanchet@36929
  1486
    Sledgehammer's behavior.  See the manual for details.
blanchet@36929
  1487
  - Modified the Isar proof reconstruction code so that it produces
blanchet@36929
  1488
    direct proofs rather than proofs by contradiction.  (This feature
blanchet@36929
  1489
    is still experimental.)
blanchet@36929
  1490
  - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
blanchet@36929
  1491
    full-typed mode.
blanchet@36929
  1492
  - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
blanchet@36929
  1493
blanchet@36928
  1494
* Nitpick:
blanchet@36928
  1495
  - Added and implemented "binary_ints" and "bits" options.
blanchet@36928
  1496
  - Added "std" option and implemented support for nonstandard models.
blanchet@36928
  1497
  - Added and implemented "finitize" option to improve the precision
blanchet@36928
  1498
    of infinite datatypes based on a monotonicity analysis.
blanchet@36928
  1499
  - Added support for quotient types.
blanchet@36928
  1500
  - Added support for "specification" and "ax_specification"
blanchet@36928
  1501
    constructs.
blanchet@36928
  1502
  - Added support for local definitions (for "function" and
blanchet@36928
  1503
    "termination" proofs).
blanchet@36928
  1504
  - Added support for term postprocessors.
blanchet@36928
  1505
  - Optimized "Multiset.multiset" and "FinFun.finfun".
blanchet@36928
  1506
  - Improved efficiency of "destroy_constrs" optimization.
blanchet@36928
  1507
  - Fixed soundness bugs related to "destroy_constrs" optimization and
blanchet@36928
  1508
    record getters.
blanchet@37272
  1509
  - Fixed soundness bug related to higher-order constructors.
blanchet@37272
  1510
  - Fixed soundness bug when "full_descrs" is enabled.
blanchet@36928
  1511
  - Improved precision of set constructs.
blanchet@37260
  1512
  - Added "atoms" option.
blanchet@36928
  1513
  - Added cache to speed up repeated Kodkod invocations on the same
blanchet@36928
  1514
    problems.
blanchet@36928
  1515
  - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
blanchet@36928
  1516
    "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
blanchet@36928
  1517
    "SAT4J_Light".  INCOMPATIBILITY.
blanchet@36928
  1518
  - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
blanchet@36928
  1519
    "sharing_depth", and "show_skolems" options.  INCOMPATIBILITY.
blanchet@37264
  1520
  - Removed "nitpick_intro" attribute.  INCOMPATIBILITY.
blanchet@36928
  1521
berghofe@37361
  1522
* Method "induct" now takes instantiations of the form t, where t is not
berghofe@37361
  1523
  a variable, as a shorthand for "x == t", where x is a fresh variable.
berghofe@37361
  1524
  If this is not intended, t has to be enclosed in parentheses.
berghofe@37361
  1525
  By default, the equalities generated by definitional instantiations
berghofe@37361
  1526
  are pre-simplified, which may cause parameters of inductive cases
berghofe@37361
  1527
  to disappear, or may even delete some of the inductive cases.
berghofe@37361
  1528
  Use "induct (no_simp)" instead of "induct" to restore the old
berghofe@37361
  1529
  behaviour. The (no_simp) option is also understood by the "cases"
berghofe@37361
  1530
  and "nominal_induct" methods, which now perform pre-simplification, too.
berghofe@37361
  1531
  INCOMPATIBILITY.
berghofe@37361
  1532
haftmann@33993
  1533
huffman@36828
  1534
*** HOLCF ***
huffman@36828
  1535
huffman@36828
  1536
* Variable names in lemmas generated by the domain package have
huffman@36828
  1537
changed; the naming scheme is now consistent with the HOL datatype
huffman@36828
  1538
package.  Some proof scripts may be affected, INCOMPATIBILITY.
huffman@36828
  1539
huffman@36828
  1540
* The domain package no longer defines the function "foo_copy" for
huffman@36828
  1541
recursive domain "foo".  The reach lemma is now stated directly in
huffman@36828
  1542
terms of "foo_take".  Lemmas and proofs that mention "foo_copy" must
huffman@36828
  1543
be reformulated in terms of "foo_take", INCOMPATIBILITY.
huffman@36828
  1544
huffman@36828
  1545
* Most definedness lemmas generated by the domain package (previously
huffman@36828
  1546
of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
huffman@36828
  1547
like "foo$x = UU <-> x = UU", which works better as a simp rule.
wenzelm@37351
  1548
Proofs that used definedness lemmas as intro rules may break,
huffman@36828
  1549
potential INCOMPATIBILITY.
huffman@36828
  1550
huffman@36828
  1551
* Induction and casedist rules generated by the domain package now
huffman@36828
  1552
declare proper case_names (one called "bottom", and one named for each
huffman@36828
  1553
constructor).  INCOMPATIBILITY.
huffman@36828
  1554
huffman@36828
  1555
* For mutually-recursive domains, separate "reach" and "take_lemma"
huffman@36828
  1556
rules are generated for each domain, INCOMPATIBILITY.
huffman@36828
  1557
huffman@36828
  1558
  foo_bar.reach       ~> foo.reach  bar.reach
huffman@36828
  1559
  foo_bar.take_lemmas ~> foo.take_lemma  bar.take_lemma
huffman@36828
  1560
huffman@36828
  1561
* Some lemmas generated by the domain package have been renamed for
huffman@36828
  1562
consistency with the datatype package, INCOMPATIBILITY.
huffman@36828
  1563
huffman@36828
  1564
  foo.ind        ~> foo.induct
huffman@36828
  1565
  foo.finite_ind ~> foo.finite_induct
huffman@36828
  1566
  foo.coind      ~> foo.coinduct
huffman@36828
  1567
  foo.casedist   ~> foo.exhaust
huffman@36828
  1568
  foo.exhaust    ~> foo.nchotomy
huffman@36828
  1569
huffman@36828
  1570
* For consistency with other definition packages, the fixrec package
huffman@36828
  1571
now generates qualified theorem names, INCOMPATIBILITY.
huffman@36828
  1572
huffman@36828
  1573
  foo_simps  ~> foo.simps
huffman@36828
  1574
  foo_unfold ~> foo.unfold
huffman@36828
  1575
  foo_induct ~> foo.induct
huffman@36828
  1576
huffman@37087
  1577
* The "fixrec_simp" attribute has been removed.  The "fixrec_simp"
huffman@37087
  1578
method and internal fixrec proofs now use the default simpset instead.
huffman@37087
  1579
INCOMPATIBILITY.
huffman@37087
  1580
huffman@36828
  1581
* The "contlub" predicate has been removed.  Proof scripts should use
huffman@36828
  1582
lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
huffman@36828
  1583
huffman@36828
  1584
* The "admw" predicate has been removed, INCOMPATIBILITY.
huffman@36828
  1585
huffman@36828
  1586
* The constants cpair, cfst, and csnd have been removed in favor of
huffman@36828
  1587
Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
huffman@36828
  1588
huffman@36828
  1589
haftmann@33993
  1590
*** ML ***
haftmann@33993
  1591
wenzelm@37351
  1592
* Antiquotations for basic formal entities:
wenzelm@37351
  1593
wenzelm@37351
  1594
    @{class NAME}         -- type class
wenzelm@37351
  1595
    @{class_syntax NAME}  -- syntax representation of the above
wenzelm@37351
  1596
wenzelm@37351
  1597
    @{type_name NAME}     -- logical type
wenzelm@37351
  1598
    @{type_abbrev NAME}   -- type abbreviation
wenzelm@37351
  1599
    @{nonterminal NAME}   -- type of concrete syntactic category
wenzelm@37351
  1600
    @{type_syntax NAME}   -- syntax representation of any of the above
wenzelm@37351
  1601
wenzelm@37351
  1602
    @{const_name NAME}    -- logical constant (INCOMPATIBILITY)
wenzelm@37351
  1603
    @{const_abbrev NAME}  -- abbreviated constant
wenzelm@37351
  1604
    @{const_syntax NAME}  -- syntax representation of any of the above
wenzelm@37351
  1605
wenzelm@37351
  1606
* Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
wenzelm@37351
  1607
syntax constant (cf. 'syntax' command).
wenzelm@37351
  1608
wenzelm@37351
  1609
* Antiquotation @{make_string} inlines a function to print arbitrary
wenzelm@37351
  1610
values similar to the ML toplevel.  The result is compiler dependent
wenzelm@37351
  1611
and may fall back on "?" in certain situations.
wenzelm@37351
  1612
wenzelm@37351
  1613
* Diagnostic commands 'ML_val' and 'ML_command' may refer to
wenzelm@37351
  1614
antiquotations @{Isar.state} and @{Isar.goal}.  This replaces impure
wenzelm@37351
  1615
Isar.state() and Isar.goal(), which belong to the old TTY loop and do
wenzelm@37351
  1616
not work with the asynchronous Isar document model.
wenzelm@37351
  1617
wenzelm@37351
  1618
* Configuration options now admit dynamic default values, depending on
wenzelm@37351
  1619
the context or even global references.
wenzelm@37351
  1620
wenzelm@37351
  1621
* SHA1.digest digests strings according to SHA-1 (see RFC 3174).  It
wenzelm@37351
  1622
uses an efficient external library if available (for Poly/ML).
wenzelm@37351
  1623
wenzelm@37144
  1624
* Renamed some important ML structures, while keeping the old names
wenzelm@37144
  1625
for some time as aliases within the structure Legacy:
wenzelm@37144
  1626
wenzelm@37144
  1627
  OuterKeyword  ~>  Keyword
wenzelm@37144
  1628
  OuterLex      ~>  Token
wenzelm@37144
  1629
  OuterParse    ~>  Parse
wenzelm@37144
  1630
  OuterSyntax   ~>  Outer_Syntax
wenzelm@37216
  1631
  PrintMode     ~>  Print_Mode
wenzelm@37144
  1632
  SpecParse     ~>  Parse_Spec
wenzelm@37216
  1633
  ThyInfo       ~>  Thy_Info
wenzelm@37216
  1634
  ThyLoad       ~>  Thy_Load
wenzelm@37216
  1635
  ThyOutput     ~>  Thy_Output
wenzelm@37145
  1636
  TypeInfer     ~>  Type_Infer
wenzelm@37144
  1637
wenzelm@37144
  1638
Note that "open Legacy" simplifies porting of sources, but forgetting
wenzelm@37144
  1639
to remove it again will complicate porting again in the future.
wenzelm@37144
  1640
wenzelm@37144
  1641
* Most operations that refer to a global context are named
wenzelm@37144
  1642
accordingly, e.g. Simplifier.global_context or
wenzelm@37144
  1643
ProofContext.init_global.  There are some situations where a global
wenzelm@37144
  1644
context actually works, but under normal circumstances one needs to
wenzelm@37144
  1645
pass the proper local context through the code!
wenzelm@37144
  1646
wenzelm@37144
  1647
* Discontinued old TheoryDataFun with its copy/init operation -- data
wenzelm@37144
  1648
needs to be pure.  Functor Theory_Data_PP retains the traditional
wenzelm@37144
  1649
Pretty.pp argument to merge, which is absent in the standard
wenzelm@37144
  1650
Theory_Data version.
wenzelm@36429
  1651
wenzelm@37144
  1652
* Sorts.certify_sort and derived "cert" operations for types and terms
wenzelm@37144
  1653
no longer minimize sorts.  Thus certification at the boundary of the
wenzelm@37144
  1654
inference kernel becomes invariant under addition of class relations,
wenzelm@37144
  1655
which is an important monotonicity principle.  Sorts are now minimized
wenzelm@37144
  1656
in the syntax layer only, at the boundary between the end-user and the
wenzelm@37144
  1657
system.  Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
wenzelm@37144
  1658
explicitly in rare situations.
wenzelm@37144
  1659
wenzelm@35021
  1660
* Renamed old-style Drule.standard to Drule.export_without_context, to
wenzelm@35021
  1661
emphasize that this is in no way a standard operation.
wenzelm@35021
  1662
INCOMPATIBILITY.
wenzelm@35021
  1663
wenzelm@34076
  1664
* Subgoal.FOCUS (and variants): resulting goal state is normalized as
wenzelm@34076
  1665
usual for resolution.  Rare INCOMPATIBILITY.
wenzelm@34076
  1666
wenzelm@35845
  1667
* Renamed varify/unvarify operations to varify_global/unvarify_global
wenzelm@35845
  1668
to emphasize that these only work in a global situation (which is
wenzelm@35845
  1669
quite rare).
wenzelm@35845
  1670
wenzelm@37144
  1671
* Curried take and drop in library.ML; negative length is interpreted
wenzelm@37144
  1672
as infinity (as in chop).  Subtle INCOMPATIBILITY.
wenzelm@36961
  1673
wenzelm@37351
  1674
* Proof terms: type substitutions on proof constants now use canonical
wenzelm@37351
  1675
order of type variables.  INCOMPATIBILITY for tools working with proof
wenzelm@37351
  1676
terms.
wenzelm@37351
  1677
wenzelm@37351
  1678
* Raw axioms/defs may no longer carry sort constraints, and raw defs
wenzelm@37351
  1679
may no longer carry premises.  User-level specifications are
wenzelm@37351
  1680
transformed accordingly by Thm.add_axiom/add_def.
wenzelm@37351
  1681
haftmann@33993
  1682
wenzelm@34238
  1683
*** System ***
wenzelm@34238
  1684
wenzelm@34238
  1685
* Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
wenzelm@34238
  1686
ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions.  Note that
wenzelm@34238
  1687
proof terms are enabled unconditionally in the new HOL-Proofs image.
wenzelm@34238
  1688
wenzelm@34255
  1689
* Discontinued old ISABELLE and ISATOOL environment settings (legacy
wenzelm@34255
  1690
feature since Isabelle2009).  Use ISABELLE_PROCESS and ISABELLE_TOOL,
wenzelm@34255
  1691
respectively.
wenzelm@34255
  1692
wenzelm@36201
  1693
* Old lib/scripts/polyml-platform is superseded by the
wenzelm@36201
  1694
ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
wenzelm@36201
  1695
variant, even on a 64 bit machine.  The following example setting
wenzelm@36201
  1696
prefers 64 bit if available:
wenzelm@36201
  1697
wenzelm@36201
  1698
  ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
wenzelm@36201
  1699
wenzelm@37218
  1700
* The preliminary Isabelle/jEdit application demonstrates the emerging
wenzelm@37218
  1701
Isabelle/Scala layer for advanced prover interaction and integration.
wenzelm@37218
  1702
See src/Tools/jEdit or "isabelle jedit" provided by the properly built
wenzelm@37218
  1703
component.
wenzelm@37218
  1704
wenzelm@37375
  1705
* "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
wenzelm@37375
  1706
and Bluesky TeX fonts.  It provides the usual Isabelle symbols,
wenzelm@37375
  1707
similar to the default assignment of the document preparation system
wenzelm@37375
  1708
(cf. isabellesym.sty).  The Isabelle/Scala class Isabelle_System
wenzelm@37375
  1709
provides some operations for direct access to the font without asking
wenzelm@37375
  1710
the user for manual installation.
wenzelm@37375
  1711
wenzelm@34238
  1712
haftmann@33993
  1713
wenzelm@33842
  1714
New in Isabelle2009-1 (December 2009)
wenzelm@33842
  1715
-------------------------------------
wenzelm@30904
  1716
wenzelm@31547
  1717
*** General ***
wenzelm@31547
  1718
wenzelm@31547
  1719
* Discontinued old form of "escaped symbols" such as \\<forall>.  Only
wenzelm@31547
  1720
one backslash should be used, even in ML sources.
wenzelm@31547
  1721
wenzelm@31547
  1722
haftmann@30951
  1723
*** Pure ***
haftmann@30951
  1724
ballarin@32846
  1725
* Locale interpretation propagates mixins along the locale hierarchy.
ballarin@32846
  1726
The currently only available mixins are the equations used to map
ballarin@32846
  1727
local definitions to terms of the target domain of an interpretation.
ballarin@32846
  1728
wenzelm@33842
  1729
* Reactivated diagnostic command 'print_interps'.  Use "print_interps
wenzelm@33842
  1730
loc" to print all interpretations of locale "loc" in the theory.
wenzelm@33842
  1731
Interpretations in proofs are not shown.
ballarin@32846
  1732
ballarin@32983
  1733
* Thoroughly revised locales tutorial.  New section on conditional
ballarin@32983
  1734
interpretation.
ballarin@32983
  1735
wenzelm@33843
  1736
* On instantiation of classes, remaining undefined class parameters
wenzelm@33843
  1737
are formally declared.  INCOMPATIBILITY.
wenzelm@33843
  1738
haftmann@30951
  1739
wenzelm@33842
  1740
*** Document preparation ***
wenzelm@33842
  1741
wenzelm@33842
  1742
* New generalized style concept for printing terms: @{foo (style) ...}
wenzelm@33842
  1743
instead of @{foo_style style ...}  (old form is still retained for
wenzelm@33842
  1744
backward compatibility).  Styles can be also applied for
wenzelm@33842
  1745
antiquotations prop, term_type and typeof.
haftmann@32891
  1746
haftmann@32891
  1747
haftmann@30930
  1748
*** HOL ***
haftmann@30930
  1749
wenzelm@33842
  1750
* New proof method "smt" for a combination of first-order logic with
wenzelm@33842
  1751
equality, linear and nonlinear (natural/integer/real) arithmetic, and
wenzelm@33842
  1752
fixed-size bitvectors; there is also basic support for higher-order
wenzelm@33842
  1753
features (esp. lambda abstractions).  It is an incomplete decision
wenzelm@33842
  1754
procedure based on external SMT solvers using the oracle mechanism;
wenzelm@33842
  1755
for the SMT solver Z3, this method is proof-producing.  Certificates
wenzelm@33842
  1756
are provided to avoid calling the external solvers solely for
wenzelm@33842
  1757
re-checking proofs.  Due to a remote SMT service there is no need for
wenzelm@33842
  1758
installing SMT solvers locally.  See src/HOL/SMT.
wenzelm@33842
  1759
wenzelm@33842
  1760
* New commands to load and prove verification conditions generated by
wenzelm@33842
  1761
the Boogie program verifier or derived systems (e.g. the Verifying C
wenzelm@33842
  1762
Compiler (VCC) or Spec#).  See src/HOL/Boogie.
wenzelm@33842
  1763
wenzelm@33842
  1764
* New counterexample generator tool 'nitpick' based on the Kodkod
wenzelm@33842
  1765
relational model finder.  See src/HOL/Tools/Nitpick and
wenzelm@33842
  1766
src/HOL/Nitpick_Examples.
wenzelm@33842
  1767
haftmann@33860
  1768
* New commands 'code_pred' and 'values' to invoke the predicate
haftmann@33860
  1769
compiler and to enumerate values of inductive predicates.
haftmann@33860
  1770
haftmann@33860
  1771
* A tabled implementation of the reflexive transitive closure.
haftmann@33860
  1772
haftmann@33860
  1773
* New implementation of quickcheck uses generic code generator;
haftmann@33860
  1774
default generators are provided for all suitable HOL types, records
haftmann@33860
  1775
and datatypes.  Old quickcheck can be re-activated importing theory
haftmann@33860
  1776
Library/SML_Quickcheck.
haftmann@33860
  1777
wenzelm@33843
  1778
* New testing tool Mirabelle for automated proof tools.  Applies
wenzelm@33843
  1779
several tools and tactics like sledgehammer, metis, or quickcheck, to
wenzelm@33843
  1780
every proof step in a theory.  To be used in batch mode via the
wenzelm@33843
  1781
"mirabelle" utility.
wenzelm@33843
  1782
wenzelm@33843
  1783
* New proof method "sos" (sum of squares) for nonlinear real
wenzelm@33843
  1784
arithmetic (originally due to John Harison). It requires theory
wenzelm@33843
  1785
Library/Sum_Of_Squares.  It is not a complete decision procedure but
wenzelm@33843
  1786
works well in practice on quantifier-free real arithmetic with +, -,
wenzelm@33843
  1787
*, ^, =, <= and <, i.e. boolean combinations of equalities and
wenzelm@33843
  1788
inequalities between polynomials.  It makes use of external
wenzelm@33843
  1789
semidefinite programming solvers.  Method "sos" generates a
wenzelm@33843
  1790
certificate that can be pasted into the proof thus avoiding the need
wenzelm@33843
  1791
to call an external tool every time the proof is checked.  See
wenzelm@33843
  1792
src/HOL/Library/Sum_Of_Squares.
wenzelm@33843
  1793
wenzelm@33843
  1794
* New method "linarith" invokes existing linear arithmetic decision
wenzelm@33843
  1795
procedure only.
wenzelm@33843
  1796
wenzelm@33843
  1797
* New command 'atp_minimal' reduces result produced by Sledgehammer.
wenzelm@33843
  1798
wenzelm@33843
  1799
* New Sledgehammer option "Full Types" in Proof General settings menu.
wenzelm@33843
  1800
Causes full type information to be output to the ATPs.  This slows
wenzelm@33843
  1801
ATPs down considerably but eliminates a source of unsound "proofs"
wenzelm@33843
  1802
that fail later.
wenzelm@33843
  1803
wenzelm@33843
  1804
* New method "metisFT": A version of metis that uses full type
wenzelm@33843
  1805
information in order to avoid failures of proof reconstruction.
wenzelm@33843
  1806
wenzelm@33843
  1807
* New evaluator "approximate" approximates an real valued term using
wenzelm@33843
  1808
the same method as the approximation method.
wenzelm@33843
  1809
wenzelm@33843
  1810
* Method "approximate" now supports arithmetic expressions as
wenzelm@33843
  1811
boundaries of intervals and implements interval splitting and Taylor
wenzelm@33843
  1812
series expansion.
wenzelm@33843
  1813
wenzelm@33843
  1814
* ML antiquotation @{code_datatype} inserts definition of a datatype
wenzelm@33843
  1815
generated by the code generator; e.g. see src/HOL/Predicate.thy.
wenzelm@33843
  1816
haftmann@33860
  1817
* New theory SupInf of the supremum and infimum operators for sets of
haftmann@33860
  1818
reals.
haftmann@33860
  1819
haftmann@33860
  1820
* New theory Probability, which contains a development of measure
haftmann@33860
  1821
theory, eventually leading to Lebesgue integration and probability.
haftmann@33860
  1822
haftmann@33860
  1823
* Extended Multivariate Analysis to include derivation and Brouwer's
haftmann@33860
  1824
fixpoint theorem.
wenzelm@33843
  1825
wenzelm@33842
  1826
* Reorganization of number theory, INCOMPATIBILITY:
wenzelm@33873
  1827
  - new number theory development for nat and int, in theories Divides
wenzelm@33873
  1828
    and GCD as well as in new session Number_Theory
wenzelm@33873
  1829
  - some constants and facts now suffixed with _nat and _int
wenzelm@33873
  1830
    accordingly
wenzelm@33873
  1831
  - former session NumberTheory now named Old_Number_Theory, including
wenzelm@33873
  1832
    theories Legacy_GCD and Primes (prefer Number_Theory if possible)
wenzelm@33842
  1833
  - moved theory Pocklington from src/HOL/Library to
wenzelm@33842
  1834
    src/HOL/Old_Number_Theory
haftmann@32479
  1835
wenzelm@33873
  1836
* Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
wenzelm@33873
  1837
lcm of finite and infinite sets. It is shown that they form a complete
haftmann@32600
  1838
lattice.
haftmann@32600
  1839
haftmann@32600
  1840
* Class semiring_div requires superclass no_zero_divisors and proof of
haftmann@32600
  1841
div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
haftmann@32600
  1842
div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
haftmann@32600
  1843
generalized to class semiring_div, subsuming former theorems
haftmann@32600
  1844
zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
haftmann@32600
  1845
zdiv_zmult_zmult2.  div_mult_mult1 is now [simp] by default.
haftmann@32600
  1846
INCOMPATIBILITY.
haftmann@32600
  1847
haftmann@32588
  1848
* Refinements to lattice classes and sets:
haftmann@32064
  1849
  - less default intro/elim rules in locale variant, more default
haftmann@32064
  1850
    intro/elim rules in class variant: more uniformity
wenzelm@33842
  1851
  - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
wenzelm@33842
  1852
    le_inf_iff
wenzelm@33842
  1853
  - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
wenzelm@33842
  1854
    sup_aci)
haftmann@32064
  1855
  - renamed ACI to inf_sup_aci
haftmann@32600
  1856
  - new class "boolean_algebra"
wenzelm@33842
  1857
  - class "complete_lattice" moved to separate theory
haftmann@33860
  1858
    "Complete_Lattice"; corresponding constants (and abbreviations)
wenzelm@33842
  1859
    renamed and with authentic syntax:
haftmann@33860
  1860
    Set.Inf ~>    Complete_Lattice.Inf
haftmann@33860
  1861
    Set.Sup ~>    Complete_Lattice.Sup
haftmann@33860
  1862
    Set.INFI ~>   Complete_Lattice.INFI
haftmann@33860
  1863
    Set.SUPR ~>   Complete_Lattice.SUPR
haftmann@33860
  1864
    Set.Inter ~>  Complete_Lattice.Inter
haftmann@33860
  1865
    Set.Union ~>  Complete_Lattice.Union
haftmann@33860
  1866
    Set.INTER ~>  Complete_Lattice.INTER
haftmann@33860
  1867
    Set.UNION ~>  Complete_Lattice.UNION
haftmann@32600
  1868
  - authentic syntax for
haftmann@32600
  1869
    Set.Pow
haftmann@32600
  1870
    Set.image
haftmann@32588
  1871
  - mere abbreviations:
haftmann@32588
  1872
    Set.empty               (for bot)
haftmann@32588
  1873
    Set.UNIV                (for top)
haftmann@33860
  1874
    Set.inter               (for inf, formerly Set.Int)
haftmann@33860
  1875
    Set.union               (for sup, formerly Set.Un)
haftmann@32588
  1876
    Complete_Lattice.Inter  (for Inf)
haftmann@32588
  1877
    Complete_Lattice.Union  (for Sup)
haftmann@32606
  1878
    Complete_Lattice.INTER  (for INFI)
haftmann@32606
  1879
    Complete_Lattice.UNION  (for SUPR)
haftmann@32600
  1880
  - object-logic definitions as far as appropriate
haftmann@32217
  1881
haftmann@32691
  1882
INCOMPATIBILITY.  Care is required when theorems Int_subset_iff or
wenzelm@33842
  1883
Un_subset_iff are explicitly deleted as default simp rules; then also
wenzelm@33842
  1884
their lattice counterparts le_inf_iff and le_sup_iff have to be
haftmann@32691
  1885
deleted to achieve the desired effect.
haftmann@32064
  1886
wenzelm@33842
  1887
* Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
wenzelm@33842
  1888
rules by default any longer; the same applies to min_max.inf_absorb1
wenzelm@33842
  1889
etc.  INCOMPATIBILITY.
wenzelm@33842
  1890
wenzelm@33842
  1891
* Rules sup_Int_eq and sup_Un_eq are no longer declared as
wenzelm@33842
  1892
pred_set_conv by default.  INCOMPATIBILITY.
wenzelm@33842
  1893
wenzelm@33842
  1894
* Power operations on relations and functions are now one dedicated
haftmann@32706
  1895
constant "compow" with infix syntax "^^".  Power operation on
wenzelm@31547
  1896
multiplicative monoids retains syntax "^" and is now defined generic
wenzelm@31547
  1897
in class power.  INCOMPATIBILITY.
wenzelm@31547
  1898
wenzelm@33842
  1899
* Relation composition "R O S" now has a more standard argument order:
wenzelm@33842
  1900
"R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}".  INCOMPATIBILITY,
wenzelm@33842
  1901
rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
wenzelm@33842
  1902
break, since the O_assoc rule was not rewritten like this.  Fix using
wenzelm@33842
  1903
O_assoc[symmetric].  The same applies to the curried version "R OO S".
wenzelm@32427
  1904
nipkow@33057
  1905
* Function "Inv" is renamed to "inv_into" and function "inv" is now an
wenzelm@33842
  1906
abbreviation for "inv_into UNIV".  Lemmas are renamed accordingly.
nipkow@32988
  1907
INCOMPATIBILITY.
nipkow@32988
  1908
haftmann@33860
  1909
* Most rules produced by inductive and datatype package have mandatory
haftmann@33860
  1910
prefixes.  INCOMPATIBILITY.
nipkow@31790
  1911
wenzelm@33842
  1912
* Changed "DERIV_intros" to a dynamic fact, which can be augmented by
wenzelm@33842
  1913
the attribute of the same name.  Each of the theorems in the list
wenzelm@33842
  1914
DERIV_intros assumes composition with an additional function and
wenzelm@33842
  1915
matches a variable to the derivative, which has to be solved by the
wenzelm@33842
  1916
Simplifier.  Hence (auto intro!: DERIV_intros) computes the derivative
wenzelm@33873
  1917
of most elementary terms.  Former Maclauren.DERIV_tac and
wenzelm@33873
  1918
Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
wenzelm@33873
  1919
INCOMPATIBILITY.
haftmann@33860
  1920
haftmann@33860
  1921
* Code generator attributes follow the usual underscore convention:
haftmann@33860
  1922
    code_unfold     replaces    code unfold
haftmann@33860
  1923
    code_post       replaces    code post
haftmann@33860
  1924
    etc.
haftmann@33860
  1925
  INCOMPATIBILITY.
wenzelm@31900
  1926
krauss@33471
  1927
* Renamed methods:
krauss@33471
  1928
    sizechange -> size_change
krauss@33471
  1929
    induct_scheme -> induction_schema
haftmann@33860
  1930
  INCOMPATIBILITY.
nipkow@33673
  1931
wenzelm@33843
  1932
* Discontinued abbreviation "arbitrary" of constant "undefined".
wenzelm@33843
  1933
INCOMPATIBILITY, use "undefined" directly.
wenzelm@33843
  1934
haftmann@33860
  1935
* Renamed theorems:
haftmann@33860
  1936
    Suc_eq_add_numeral_1 -> Suc_eq_plus1
haftmann@33860
  1937
    Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
haftmann@33860
  1938
    Suc_plus1 -> Suc_eq_plus1
haftmann@33860
  1939
    *anti_sym -> *antisym*
haftmann@33860
  1940
    vector_less_eq_def -> vector_le_def
haftmann@33860
  1941
  INCOMPATIBILITY.
haftmann@33860
  1942
haftmann@33860
  1943
* Added theorem List.map_map as [simp].  Removed List.map_compose.
haftmann@33860
  1944
INCOMPATIBILITY.
haftmann@33860
  1945
haftmann@33860
  1946
* Removed predicate "M hassize n" (<--> card M = n & finite M).
haftmann@33860
  1947
INCOMPATIBILITY.
haftmann@33860
  1948
hoelzl@31812
  1949
huffman@33825
  1950
*** HOLCF ***
huffman@33825
  1951
wenzelm@33842
  1952
* Theory Representable defines a class "rep" of domains that are
wenzelm@33842
  1953
representable (via an ep-pair) in the universal domain type "udom".
huffman@33825
  1954
Instances are provided for all type constructors defined in HOLCF.
huffman@33825
  1955
huffman@33825
  1956
* The 'new_domain' command is a purely definitional version of the
huffman@33825
  1957
domain package, for representable domains.  Syntax is identical to the
huffman@33825
  1958
old domain package.  The 'new_domain' package also supports indirect
huffman@33825
  1959
recursion using previously-defined type constructors.  See
wenzelm@33842
  1960
src/HOLCF/ex/New_Domain.thy for examples.
wenzelm@33842
  1961
wenzelm@33842
  1962
* Method "fixrec_simp" unfolds one step of a fixrec-defined constant
huffman@33825
  1963
on the left-hand side of an equation, and then performs
huffman@33825
  1964
simplification.  Rewriting is done using rules declared with the
wenzelm@33842
  1965
"fixrec_simp" attribute.  The "fixrec_simp" method is intended as a
wenzelm@33842
  1966
replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
huffman@33825
  1967
huffman@33825
  1968
* The pattern-match compiler in 'fixrec' can now handle constructors
huffman@33825
  1969
with HOL function types.  Pattern-match combinators for the Pair
huffman@33825
  1970
constructor are pre-configured.
huffman@33825
  1971
huffman@33825
  1972
* The 'fixrec' package now produces better fixed-point induction rules
huffman@33825
  1973
for mutually-recursive definitions:  Induction rules have conclusions
huffman@33825
  1974
of the form "P foo bar" instead of "P <foo, bar>".
huffman@33825
  1975
huffman@33825
  1976
* The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
huffman@33825
  1977
been renamed to "below".  The name "below" now replaces "less" in many
wenzelm@33842
  1978
theorem names.  (Legacy theorem names using "less" are still supported
wenzelm@33842
  1979
as well.)
huffman@33825
  1980
huffman@33825
  1981
* The 'fixrec' package now supports "bottom patterns".  Bottom
huffman@33825
  1982
patterns can be used to generate strictness rules, or to make
huffman@33825
  1983
functions more strict (much like the bang-patterns supported by the
wenzelm@33873
  1984
Glasgow Haskell Compiler).  See src/HOLCF/ex/Fixrec_ex.thy for
wenzelm@33873
  1985
examples.
huffman@33825
  1986
huffman@33825
  1987
wenzelm@31304
  1988
*** ML ***
wenzelm@31304
  1989
wenzelm@33843
  1990
* Support for Poly/ML 5.3.0, with improved reporting of compiler
wenzelm@33843
  1991
errors and run-time exceptions, including detailed source positions.
wenzelm@33843
  1992
wenzelm@33843
  1993
* Structure Name_Space (formerly NameSpace) now manages uniquely
wenzelm@33843
  1994
identified entries, with some additional information such as source
wenzelm@33843
  1995
position, logical grouping etc.
wenzelm@33843
  1996
wenzelm@33524
  1997
* Theory and context data is now introduced by the simplified and
wenzelm@33524
  1998
modernized functors Theory_Data, Proof_Data, Generic_Data.  Data needs
wenzelm@33524
  1999
to be pure, but the old TheoryDataFun for mutable data (with explicit
wenzelm@33524
  2000
copy operation) is still available for some time.
wenzelm@33524
  2001
wenzelm@32742
  2002
* Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
wenzelm@32742
  2003
provides a high-level programming interface to synchronized state
wenzelm@32742
  2004
variables with atomic update.  This works via pure function
wenzelm@32742
  2005
application within a critical section -- its runtime should be as
wenzelm@32742
  2006
short as possible; beware of deadlocks if critical code is nested,
wenzelm@32742
  2007
either directly or indirectly via other synchronized variables!
wenzelm@32742
  2008
wenzelm@32742
  2009
* Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
wenzelm@32742
  2010
wraps raw ML references, explicitly indicating their non-thread-safe
wenzelm@32742
  2011
behaviour.  The Isar toplevel keeps this structure open, to
wenzelm@32742
  2012
accommodate Proof General as well as quick and dirty interactive
wenzelm@32742
  2013
experiments with references.
wenzelm@32742
  2014
wenzelm@32365
  2015
* PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
wenzelm@32365
  2016
parallel tactical reasoning.
wenzelm@32365
  2017
wenzelm@32427
  2018
* Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
wenzelm@32427
  2019
are similar to SUBPROOF, but are slightly more flexible: only the
wenzelm@32427
  2020
specified parts of the subgoal are imported into the context, and the
wenzelm@32427
  2021
body tactic may introduce new subgoals and schematic variables.
wenzelm@32427
  2022
wenzelm@32427
  2023
* Old tactical METAHYPS, which does not observe the proof context, has
wenzelm@32427
  2024
been renamed to Old_Goals.METAHYPS and awaits deletion.  Use SUBPROOF
wenzelm@32427
  2025
or Subgoal.FOCUS etc.
wenzelm@32216
  2026
wenzelm@31971
  2027
* Renamed functor TableFun to Table, and GraphFun to Graph.  (Since
wenzelm@31971
  2028
functors have their own ML name space there is no point to mark them
wenzelm@31971
  2029
separately.)  Minor INCOMPATIBILITY.
wenzelm@31971
  2030
wenzelm@31901
  2031
* Renamed NamedThmsFun to Named_Thms.  INCOMPATIBILITY.
wenzelm@31901
  2032
wenzelm@33842
  2033
* Renamed several structures FooBar to Foo_Bar.  Occasional,
wenzelm@33842
  2034
INCOMPATIBILITY.
wenzelm@33842
  2035
wenzelm@33843
  2036
* Operations of structure Skip_Proof no longer require quick_and_dirty
wenzelm@33843
  2037
mode, which avoids critical setmp.
wenzelm@33843
  2038
wenzelm@31306
  2039
* Eliminated old Attrib.add_attributes, Method.add_methods and related
wenzelm@33842
  2040
combinators for "args".  INCOMPATIBILITY, need to use simplified
wenzelm@31306
  2041
Attrib/Method.setup introduced in Isabelle2009.
wenzelm@31304
  2042
wenzelm@32151
  2043
* Proper context for simpset_of, claset_of, clasimpset_of.  May fall
wenzelm@32151
  2044
back on global_simpset_of, global_claset_of, global_clasimpset_of as
wenzelm@32151
  2045
last resort.  INCOMPATIBILITY.
wenzelm@32151
  2046
wenzelm@32092
  2047
* Display.pretty_thm now requires a proper context (cf. former
wenzelm@32092
  2048
ProofContext.pretty_thm).  May fall back on Display.pretty_thm_global
wenzelm@32092
  2049
or even Display.pretty_thm_without_context as last resort.
wenzelm@32092
  2050
INCOMPATIBILITY.
wenzelm@32092
  2051
wenzelm@32433
  2052
* Discontinued Display.pretty_ctyp/cterm etc.  INCOMPATIBILITY, use
wenzelm@32433
  2053
Syntax.pretty_typ/term directly, preferably with proper context
wenzelm@32433
  2054
instead of global theory.
wenzelm@32433
  2055
wenzelm@31304
  2056
wenzelm@31308
  2057
*** System ***
wenzelm@31308
  2058
wenzelm@33842
  2059
* Further fine tuning of parallel proof checking, scales up to 8 cores
wenzelm@33842
  2060
(max. speedup factor 5.0).  See also Goal.parallel_proofs in ML and
wenzelm@33842
  2061
usedir option -q.
wenzelm@33842
  2062
wenzelm@32326
  2063
* Support for additional "Isabelle components" via etc/components, see
wenzelm@32326
  2064
also the system manual.
wenzelm@32326
  2065
wenzelm@32326
  2066
* The isabelle makeall tool now operates on all components with
wenzelm@32326
  2067
IsaMakefile, not just hardwired "logics".
wenzelm@32326
  2068
wenzelm@33842
  2069
* Removed "compress" option from isabelle-process and isabelle usedir;
wenzelm@33842
  2070
this is always enabled.
kleing@33818
  2071
wenzelm@31308
  2072
* Discontinued support for Poly/ML 4.x versions.
wenzelm@31308
  2073
wenzelm@33842
  2074
* Isabelle tool "wwwfind" provides web interface for 'find_theorems'
wenzelm@33842
  2075
on a given logic image.  This requires the lighttpd webserver and is
wenzelm@33842
  2076
currently supported on Linux only.
wenzelm@32061
  2077
wenzelm@31308
  2078
wenzelm@31304
  2079
wenzelm@30845
  2080
New in Isabelle2009 (April 2009)
wenzelm@30845
  2081
--------------------------------
haftmann@27104
  2082
wenzelm@27599
  2083
*** General ***
wenzelm@27599
  2084
wenzelm@28504
  2085
* Simplified main Isabelle executables, with less surprises on
wenzelm@28504
  2086
case-insensitive file-systems (such as Mac OS).
wenzelm@28504
  2087
wenzelm@28504
  2088
  - The main Isabelle tool wrapper is now called "isabelle" instead of
wenzelm@28504
  2089
    "isatool."
wenzelm@28504
  2090
wenzelm@28504
  2091
  - The former "isabelle" alias for "isabelle-process" has been
wenzelm@28504
  2092
    removed (should rarely occur to regular users).
wenzelm@28504
  2093
wenzelm@28915
  2094
  - The former "isabelle-interface" and its alias "Isabelle" have been
wenzelm@28915
  2095
    removed (interfaces are now regular Isabelle tools).
wenzelm@28504
  2096
wenzelm@28504
  2097
Within scripts and make files, the Isabelle environment variables
wenzelm@28504
  2098
ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
wenzelm@28504
  2099
respectively.  (The latter are still available as legacy feature.)
wenzelm@28504
  2100
wenzelm@28915
  2101
The old isabelle-interface wrapper could react in confusing ways if
wenzelm@28915
  2102
the interface was uninstalled or changed otherwise.  Individual
wenzelm@28915
  2103
interface tool configuration is now more explicit, see also the
wenzelm@28915
  2104
Isabelle system manual.  In particular, Proof General is now available
wenzelm@28915
  2105
via "isabelle emacs".
wenzelm@28504
  2106
wenzelm@28504
  2107
INCOMPATIBILITY, need to adapt derivative scripts.  Users may need to
wenzelm@28504
  2108
purge installed copies of Isabelle executables and re-run "isabelle
wenzelm@28504
  2109
install -p ...", or use symlinks.
wenzelm@28504
  2110
wenzelm@28914
  2111
* The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
wenzelm@30845
  2112
old ~/isabelle, which was slightly non-standard and apt to cause
wenzelm@30845
  2113
surprises on case-insensitive file-systems (such as Mac OS).
wenzelm@28914
  2114
wenzelm@28914
  2115
INCOMPATIBILITY, need to move existing ~/isabelle/etc,
wenzelm@28914
  2116
~/isabelle/heaps, ~/isabelle/browser_info to the new place.  Special
wenzelm@28914
  2117
care is required when using older releases of Isabelle.  Note that
wenzelm@28914
  2118
ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
wenzelm@30845
  2119
Isabelle distribution, in order to use the new ~/.isabelle uniformly.
wenzelm@28914
  2120
wenzelm@29161
  2121
* Proofs of fully specified statements are run in parallel on
wenzelm@30845
  2122
multi-core systems.  A speedup factor of 2.5 to 3.2 can be expected on
wenzelm@30845
  2123
a regular 4-core machine, if the initial heap space is made reasonably
wenzelm@30845
  2124
large (cf. Poly/ML option -H).  (Requires Poly/ML 5.2.1 or later.)
wenzelm@30845
  2125
wenzelm@30845
  2126
* The main reference manuals ("isar-ref", "implementation", and
wenzelm@30845
  2127
"system") have been updated and extended.  Formally checked references
wenzelm@30845
  2128
as hyperlinks are now available uniformly.
wenzelm@30845
  2129
wenzelm@30163
  2130
wenzelm@27599
  2131
*** Pure ***
wenzelm@27599
  2132
wenzelm@30845
  2133
* Complete re-implementation of locales.  INCOMPATIBILITY in several
wenzelm@30845
  2134
respects.  The most important changes are listed below.  See the
wenzelm@30845
  2135
Tutorial on Locales ("locales" manual) for details.
ballarin@29253
  2136
ballarin@29253
  2137
- In locale expressions, instantiation replaces renaming.  Parameters
ballarin@29253
  2138
must be declared in a for clause.  To aid compatibility with previous
ballarin@29253
  2139
parameter inheritance, in locale declarations, parameters that are not
ballarin@29253
  2140
'touched' (instantiation position "_" or omitted) are implicitly added
ballarin@29253
  2141
with their syntax at the beginning of the for clause.
ballarin@29253
  2142
ballarin@29253
  2143
- Syntax from abbreviations and definitions in locales is available in
ballarin@29253
  2144
locale expressions and context elements.  The latter is particularly
ballarin@29253
  2145
useful in locale declarations.
ballarin@29253
  2146
ballarin@29253
  2147
- More flexible mechanisms to qualify names generated by locale
ballarin@29253
  2148
expressions.  Qualifiers (prefixes) may be specified in locale
wenzelm@30728
  2149
expressions, and can be marked as mandatory (syntax: "name!:") or
wenzelm@30728
  2150
optional (syntax "name?:").  The default depends for plain "name:"
wenzelm@30728
  2151
depends on the situation where a locale expression is used: in
wenzelm@30728
  2152
commands 'locale' and 'sublocale' prefixes are optional, in
wenzelm@30845
  2153
'interpretation' and 'interpret' prefixes are mandatory.  The old
wenzelm@30728
  2154
implicit qualifiers derived from the parameter names of a locale are
wenzelm@30728
  2155
no longer generated.
wenzelm@30106
  2156
wenzelm@30845
  2157
- Command "sublocale l < e" replaces "interpretation l < e".  The
wenzelm@30106
  2158
instantiation clause in "interpretation" and "interpret" (square
wenzelm@30106
  2159
brackets) is no longer available.  Use locale expressions.
ballarin@29253
  2160
wenzelm@30845
  2161
- When converting proof scripts, mandatory qualifiers in
wenzelm@30728
  2162
'interpretation' and 'interpret' should be retained by default, even
wenzelm@30845
  2163
if this is an INCOMPATIBILITY compared to former behavior.  In the
wenzelm@30845
  2164
worst case, use the "name?:" form for non-mandatory ones.  Qualifiers
wenzelm@30845
  2165
in locale expressions range over a single locale instance only.
wenzelm@30845
  2166
wenzelm@30845
  2167
- Dropped locale element "includes".  This is a major INCOMPATIBILITY.
wenzelm@30845
  2168
In existing theorem specifications replace the includes element by the
wenzelm@30845
  2169
respective context elements of the included locale, omitting those
wenzelm@30845
  2170
that are already present in the theorem specification.  Multiple
wenzelm@30845
  2171
assume elements of a locale should be replaced by a single one
wenzelm@30845
  2172
involving the locale predicate.  In the proof body, declarations (most
wenzelm@30845
  2173
notably theorems) may be regained by interpreting the respective
wenzelm@30845
  2174
locales in the proof context as required (command "interpret").
wenzelm@30845
  2175
wenzelm@30845
  2176
If using "includes" in replacement of a target solely because the
wenzelm@30845
  2177
parameter types in the theorem are not as general as in the target,
wenzelm@30845
  2178
consider declaring a new locale with additional type constraints on
wenzelm@30845
  2179
the parameters (context element "constrains").
wenzelm@30845
  2180
wenzelm@30845
  2181
- Discontinued "locale (open)".  INCOMPATIBILITY.
wenzelm@30845
  2182
wenzelm@30845
  2183
- Locale interpretation commands no longer attempt to simplify goal.
wenzelm@30845
  2184
INCOMPATIBILITY: in rare situations the generated goal differs.  Use
wenzelm@30845
  2185
methods intro_locales and unfold_locales to clarify.
wenzelm@30845
  2186
wenzelm@30845
  2187
- Locale interpretation commands no longer accept interpretation
wenzelm@30845
  2188
attributes.  INCOMPATIBILITY.
wenzelm@30845
  2189
wenzelm@30845
  2190
* Class declaration: so-called "base sort" must not be given in import
wenzelm@30845
  2191
list any longer, but is inferred from the specification.  Particularly
wenzelm@30845
  2192
in HOL, write
wenzelm@30845
  2193
wenzelm@30845
  2194
    class foo = ...
wenzelm@30845
  2195
wenzelm@30845
  2196
instead of
wenzelm@30845
  2197
wenzelm@30845
  2198
    class foo = type + ...
wenzelm@30845
  2199
wenzelm@30845
  2200
* Class target: global versions of theorems stemming do not carry a
wenzelm@30845
  2201
parameter prefix any longer.  INCOMPATIBILITY.
wenzelm@30845
  2202
wenzelm@30845
  2203
* Class 'instance' command no longer accepts attached definitions.
wenzelm@30845
  2204
INCOMPATIBILITY, use proper 'instantiation' target instead.
wenzelm@30845
  2205
wenzelm@30845
  2206
* Recovered hiding of consts, which was accidentally broken in
wenzelm@30845
  2207
Isabelle2007.  Potential INCOMPATIBILITY, ``hide const c'' really
wenzelm@30845
  2208
makes c inaccessible; consider using ``hide (open) const c'' instead.
wenzelm@30845
  2209
wenzelm@30845
  2210
* Slightly more coherent Pure syntax, with updated documentation in
wenzelm@30845
  2211
isar-ref manual.  Removed locales meta_term_syntax and
wenzelm@30845
  2212
meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
wenzelm@30845
  2213
INCOMPATIBILITY in rare situations.  Note that &&& should not be used
wenzelm@30845
  2214
directly in regular applications.
wenzelm@30845
  2215
wenzelm@30845
  2216
* There is a new syntactic category "float_const" for signed decimal
wenzelm@30845
  2217
fractions (e.g. 123.45 or -123.45).
wenzelm@30845
  2218
wenzelm@30845
  2219
* Removed exotic 'token_translation' command.  INCOMPATIBILITY, use ML
wenzelm@30845
  2220
interface with 'setup' command instead.
wenzelm@30845
  2221
wenzelm@30845
  2222
* Command 'local_setup' is similar to 'setup', but operates on a local
wenzelm@30845
  2223
theory context.
haftmann@27104
  2224
wenzelm@28114
  2225
* The 'axiomatization' command now only works within a global theory
wenzelm@28114
  2226
context.  INCOMPATIBILITY.
wenzelm@28114
  2227
wenzelm@30845
  2228
* Goal-directed proof now enforces strict proof irrelevance wrt. sort
wenzelm@30845
  2229
hypotheses.  Sorts required in the course of reasoning need to be
wenzelm@30845
  2230
covered by the constraints in the initial statement, completed by the
wenzelm@30845
  2231
type instance information of the background theory.  Non-trivial sort
wenzelm@30845
  2232
hypotheses, which rarely occur in practice, may be specified via
wenzelm@30845
  2233
vacuous propositions of the form SORT_CONSTRAINT('a::c).  For example:
wenzelm@30845
  2234
wenzelm@30845
  2235
  lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
wenzelm@30845
  2236
wenzelm@30845
  2237
The result contains an implicit sort hypotheses as before --
wenzelm@30845
  2238
SORT_CONSTRAINT premises are eliminated as part of the canonical rule
wenzelm@30845
  2239
normalization.
wenzelm@30845
  2240
wenzelm@30845
  2241
* Generalized Isar history, with support for linear undo, direct state
wenzelm@30845
  2242
addressing etc.
wenzelm@30845
  2243
wenzelm@30845
  2244
* Changed defaults for unify configuration options:
wenzelm@30845
  2245
wenzelm@30845
  2246
  unify_trace_bound = 50 (formerly 25)
wenzelm@30845
  2247
  unify_search_bound = 60 (formerly 30)
wenzelm@30845
  2248
wenzelm@30845
  2249
* Different bookkeeping for code equations (INCOMPATIBILITY):
wenzelm@30845
  2250
wenzelm@30845
  2251
  a) On theory merge, the last set of code equations for a particular
wenzelm@30845
  2252
     constant is taken (in accordance with the policy applied by other
wenzelm@30845
  2253
     parts of the code generator framework).
wenzelm@30845
  2254
wenzelm@30845
  2255
  b) Code equations stemming from explicit declarations (e.g. code
wenzelm@30845
  2256
     attribute) gain priority over default code equations stemming
wenzelm@30845
  2257
     from definition, primrec, fun etc.
wenzelm@30845
  2258
wenzelm@30845
  2259
* Keyword 'code_exception' now named 'code_abort'.  INCOMPATIBILITY.
wenzelm@30845
  2260
haftmann@30965
  2261
* Unified theorem tables for both code generators.  Thus [code
wenzelm@30845
  2262
func] has disappeared and only [code] remains.  INCOMPATIBILITY.
wenzelm@30577
  2263
wenzelm@30577
  2264
* Command 'find_consts' searches for constants based on type and name
wenzelm@30577
  2265
patterns, e.g.
kleing@29883
  2266
kleing@29883
  2267
    find_consts "_ => bool"
kleing@29883
  2268
wenzelm@30106
  2269
By default, matching is against subtypes, but it may be restricted to
wenzelm@30728
  2270
the whole type.  Searching by name is possible.  Multiple queries are
wenzelm@30106
  2271
conjunctive and queries may be negated by prefixing them with a
wenzelm@30106
  2272
hyphen:
kleing@29883
  2273
kleing@29883
  2274
    find_consts strict: "_ => bool" name: "Int" -"int => int"
kleing@29861
  2275
wenzelm@30845
  2276
* New 'find_theorems' criterion "solves" matches theorems that
wenzelm@30845
  2277
directly solve the current goal (modulo higher-order unification).
wenzelm@30845
  2278
wenzelm@30845
  2279
* Auto solve feature for main theorem statements: whenever a new goal
wenzelm@30845
  2280
is stated, "find_theorems solves" is called; any theorems that could
wenzelm@30845
  2281
solve the lemma directly are listed as part of the goal state.
wenzelm@30845
  2282
Cf. associated options in Proof General Isabelle settings menu,
wenzelm@30845
  2283
enabled by default, with reasonable timeout for pathological cases of
wenzelm@30845
  2284
higher-order unification.
webertj@30415
  2285
haftmann@27104
  2286
wenzelm@27381
  2287
*** Document preparation ***
wenzelm@27381
  2288
wenzelm@27381
  2289
* Antiquotation @{lemma} now imitates a regular terminal proof,
wenzelm@27392
  2290
demanding keyword 'by' and supporting the full method expression
wenzelm@27519
  2291
syntax just like the Isar command 'by'.
wenzelm@27381
  2292
wenzelm@27381
  2293
haftmann@27104
  2294
*** HOL ***
haftmann@27104
  2295
wenzelm@30845
  2296
* Integrated main parts of former image HOL-Complex with HOL.  Entry
wenzelm@30845
  2297
points Main and Complex_Main remain as before.
wenzelm@30845
  2298
wenzelm@30845
  2299
* Logic image HOL-Plain provides a minimal HOL with the most important
wenzelm@30845
  2300
tools available (inductive, datatype, primrec, ...).  This facilitates
wenzelm@30845
  2301
experimentation and tool development.  Note that user applications
wenzelm@30845
  2302
(and library theories) should never refer to anything below theory
wenzelm@30845
  2303
Main, as before.
wenzelm@30845
  2304
wenzelm@30845
  2305
* Logic image HOL-Main stops at theory Main, and thus facilitates
wenzelm@30845
  2306
experimentation due to shorter build times.
wenzelm@30845
  2307
wenzelm@30845
  2308
* Logic image HOL-NSA contains theories of nonstandard analysis which
wenzelm@30845
  2309
were previously part of former HOL-Complex.  Entry point Hyperreal
wenzelm@30845
  2310
remains valid, but theories formerly using Complex_Main should now use
wenzelm@30845
  2311
new entry point Hypercomplex.
wenzelm@30845
  2312
wenzelm@30845
  2313
* Generic ATP manager for Sledgehammer, based on ML threads instead of
wenzelm@30845
  2314
Posix processes.  Avoids potentially expensive forking of the ML
wenzelm@30845
  2315
process.  New thread-based implementation also works on non-Unix
wenzelm@30845
  2316
platforms (Cygwin).  Provers are no longer hardwired, but defined
wenzelm@30845
  2317
within the theory via plain ML wrapper functions.  Basic Sledgehammer
wenzelm@30845
  2318
commands are covered in the isar-ref manual.
wenzelm@30845
  2319
wenzelm@30845
  2320
* Wrapper scripts for remote SystemOnTPTP service allows to use
wenzelm@30845
  2321
sledgehammer without local ATP installation (Vampire etc.). Other
wenzelm@30845
  2322
provers may be included via suitable ML wrappers, see also
wenzelm@30845
  2323
src/HOL/ATP_Linkup.thy.
wenzelm@30845
  2324
wenzelm@30845
  2325
* ATP selection (E/Vampire/Spass) is now via Proof General's settings
wenzelm@30845
  2326
menu.
wenzelm@30845
  2327
wenzelm@30845
  2328
* The metis method no longer fails because the theorem is too trivial
wenzelm@30845
  2329
(contains the empty clause).
wenzelm@30845
  2330
wenzelm@30845
  2331
* The metis method now fails in the usual manner, rather than raising
wenzelm@30845
  2332
an exception, if it determines that it cannot prove the theorem.
wenzelm@30845
  2333
wenzelm@30845
  2334
* Method "coherent" implements a prover for coherent logic (see also
wenzelm@30845
  2335
src/Tools/coherent.ML).
wenzelm@30845
  2336
wenzelm@30845
  2337
* Constants "undefined" and "default" replace "arbitrary".  Usually
wenzelm@30845
  2338
"undefined" is the right choice to replace "arbitrary", though
wenzelm@30845
  2339
logically there is no difference.  INCOMPATIBILITY.
wenzelm@30845
  2340
wenzelm@30845
  2341
* Command "value" now integrates different evaluation mechanisms.  The
wenzelm@30845
  2342
result of the first successful evaluation mechanism is printed.  In
wenzelm@30845
  2343
square brackets a particular named evaluation mechanisms may be
wenzelm@30845
  2344
specified (currently, [SML], [code] or [nbe]).  See further
wenzelm@30845
  2345
src/HOL/ex/Eval_Examples.thy.
wenzelm@30845
  2346
wenzelm@30845
  2347
* Normalization by evaluation now allows non-leftlinear equations.
wenzelm@30845
  2348
Declare with attribute [code nbe].
wenzelm@30845
  2349
wenzelm@30845
  2350
* Methods "case_tac" and "induct_tac" now refer to the very same rules
wenzelm@30845
  2351
as the structured Isar versions "cases" and "induct", cf. the
wenzelm@30845
  2352
corresponding "cases" and "induct" attributes.  Mutual induction rules
wenzelm@30845
  2353
are now presented as a list of individual projections
wenzelm@30845
  2354
(e.g. foo_bar.inducts for types foo and bar); the old format with
wenzelm@30845
  2355
explicit HOL conjunction is no longer supported.  INCOMPATIBILITY, in
wenzelm@30845
  2356
rare situations a different rule is selected --- notably nested tuple
wenzelm@30845
  2357
elimination instead of former prod.exhaust: use explicit (case_tac t
wenzelm@30845
  2358
rule: prod.exhaust) here.
wenzelm@30845
  2359
wenzelm@30845
  2360
* Attributes "cases", "induct", "coinduct" support "del" option.
wenzelm@30845
  2361
wenzelm@30845
  2362
* Removed fact "case_split_thm", which duplicates "case_split".
wenzelm@30845
  2363
wenzelm@30845
  2364
* The option datatype has been moved to a new theory Option.  Renamed
wenzelm@30845
  2365
option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
wenzelm@30845
  2366
wenzelm@30845
  2367
* New predicate "strict_mono" classifies strict functions on partial
wenzelm@30845
  2368
orders.  With strict functions on linear orders, reasoning about
wenzelm@30845
  2369
(in)equalities is facilitated by theorems "strict_mono_eq",
wenzelm@30845
  2370
"strict_mono_less_eq" and "strict_mono_less".
wenzelm@30845
  2371
wenzelm@30845
  2372
* Some set operations are now proper qualified constants with
wenzelm@30845
  2373
authentic syntax.  INCOMPATIBILITY:
haftmann@30304
  2374
haftmann@30304
  2375
    op Int ~>   Set.Int
haftmann@30304
  2376
    op Un ~>    Set.Un
haftmann@30304
  2377
    INTER ~>    Set.INTER
haftmann@30304
  2378
    UNION ~>    Set.UNION
haftmann@30304
  2379
    Inter ~>    Set.Inter
haftmann@30304
  2380
    Union ~>    Set.Union
haftmann@30304
  2381
    {} ~>       Set.empty
haftmann@30304
  2382
    UNIV ~>     Set.UNIV
haftmann@30304
  2383
wenzelm@30845
  2384
* Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
wenzelm@30845
  2385
theory Set.
wenzelm@30845
  2386
wenzelm@30845
  2387
* Auxiliary class "itself" has disappeared -- classes without any
wenzelm@30845
  2388
parameter are treated as expected by the 'class' command.
haftmann@29797
  2389
haftmann@29823
  2390
* Leibnitz's Series for Pi and the arcus tangens and logarithm series.
haftmann@29823
  2391
wenzelm@30845
  2392
* Common decision procedures (Cooper, MIR, Ferrack, Approximation,
wenzelm@30845
  2393
Dense_Linear_Order) are now in directory HOL/Decision_Procs.
wenzelm@30845
  2394
wenzelm@30845
  2395
* Theory src/HOL/Decision_Procs/Approximation provides the new proof
wenzelm@30845
  2396
method "approximation".  It proves formulas on real values by using
wenzelm@30845
  2397
interval arithmetic.  In the formulas are also the transcendental
wenzelm@30845
  2398
functions sin, cos, tan, atan, ln, exp and the constant pi are
wenzelm@30845
  2399
allowed. For examples see
wenzelm@30845
  2400
src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
haftmann@29823
  2401
haftmann@29823
  2402
* Theory "Reflection" now resides in HOL/Library.
haftmann@29650
  2403
wenzelm@30845
  2404
* Entry point to Word library now simply named "Word".
wenzelm@30845
  2405
INCOMPATIBILITY.
haftmann@29628
  2406
haftmann@29197
  2407
* Made source layout more coherent with logical distribution
haftmann@29197
  2408
structure:
haftmann@28952
  2409
haftmann@28952
  2410
    src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
haftmann@28952
  2411
    src/HOL/Library/Code_Message.thy ~> src/HOL/
haftmann@28952
  2412
    src/HOL/Library/GCD.thy ~> src/HOL/
haftmann@28952
  2413
    src/HOL/Library/Order_Relation.thy ~> src/HOL/
haftmann@28952
  2414
    src/HOL/Library/Parity.thy ~> src/HOL/
haftmann@28952
  2415
    src/HOL/Library/Univ_Poly.thy ~> src/HOL/
huffman@30176
  2416
    src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
haftmann@28952
  2417
    src/HOL/Real/Lubs.thy ~> src/HOL/
haftmann@28952
  2418
    src/HOL/Real/PReal.thy ~> src/HOL/
haftmann@28952
  2419
    src/HOL/Real/Rational.thy ~> src/HOL/
haftmann@28952
  2420
    src/HOL/Real/RComplete.thy ~> src/HOL/
haftmann@28952
  2421
    src/HOL/Real/RealDef.thy ~> src/HOL/
haftmann@28952
  2422
    src/HOL/Real/RealPow.thy ~> src/HOL/
haftmann@28952
  2423
    src/HOL/Real/Real.thy ~> src/HOL/
haftmann@28952
  2424
    src/HOL/Complex/Complex_Main.thy ~> src/HOL/
haftmann@28952
  2425
    src/HOL/Complex/Complex.thy ~> src/HOL/
huffman@30176
  2426
    src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
huffman@30176
  2427
    src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
haftmann@28952
  2428
    src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
haftmann@28952
  2429
    src/HOL/Hyperreal/Fact.thy ~> src/HOL/
haftmann@28952
  2430
    src/HOL/Hyperreal/Integration.thy ~> src/HOL/
haftmann@28952
  2431
    src/HOL/Hyperreal/Lim.thy ~> src/HOL/
haftmann@28952
  2432
    src/HOL/Hyperreal/Ln.thy ~> src/HOL/
haftmann@28952
  2433
    src/HOL/Hyperreal/Log.thy ~> src/HOL/
haftmann@28952
  2434
    src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
haftmann@28952
  2435
    src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
haftmann@28952
  2436
    src/HOL/Hyperreal/Series.thy ~> src/HOL/
haftmann@29197
  2437
    src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
haftmann@28952
  2438
    src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
haftmann@28952
  2439
    src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
haftmann@28952
  2440
    src/HOL/Real/Float ~> src/HOL/Library/
haftmann@29197
  2441
    src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
haftmann@29197
  2442
    src/HOL/Real/RealVector.thy ~> src/HOL/
haftmann@28952
  2443
haftmann@28952
  2444
    src/HOL/arith_data.ML ~> src/HOL/Tools
haftmann@28952
  2445
    src/HOL/hologic.ML ~> src/HOL/Tools
haftmann@28952
  2446
    src/HOL/simpdata.ML ~> src/HOL/Tools
haftmann@28952
  2447
    src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
haftmann@28952
  2448
    src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
haftmann@28952
  2449
    src/HOL/nat_simprocs.ML ~> src/HOL/Tools
haftmann@28952
  2450
    src/HOL/Real/float_arith.ML ~> src/HOL/Tools
haftmann@28952
  2451
    src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
haftmann@28952
  2452
    src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
haftmann@28952
  2453
    src/HOL/Real/real_arith.ML ~> src/HOL/Tools
haftmann@28952
  2454
haftmann@29398
  2455
    src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
haftmann@29398
  2456
    src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
haftmann@29398
  2457
    src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
haftmann@29398
  2458
    src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
haftmann@29398
  2459
    src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
haftmann@29398
  2460
    src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
haftmann@29398
  2461
wenzelm@30845
  2462
* If methods "eval" and "evaluation" encounter a structured proof
wenzelm@30845
  2463
state with !!/==>, only the conclusion is evaluated to True (if
wenzelm@30845
  2464
possible), avoiding strange error messages.
wenzelm@30845
  2465
wenzelm@30845
  2466
* Method "sizechange" automates termination proofs using (a
wenzelm@30845
  2467
modification of) the size-change principle.  Requires SAT solver.  See
wenzelm@30845
  2468
src/HOL/ex/Termination.thy for examples.
wenzelm@30845
  2469
wenzelm@30845
  2470
* Simplifier: simproc for let expressions now unfolds if bound
wenzelm@30845
  2471
variable occurs at most once in let expression body.  INCOMPATIBILITY.
wenzelm@30845
  2472
wenzelm@30845
  2473
* Method "arith": Linear arithmetic now ignores all inequalities when
wenzelm@30845
  2474
fast_arith_neq_limit is exceeded, instead of giving up entirely.
wenzelm@30845
  2475
wenzelm@30845
  2476
* New attribute "arith" for facts that should always be used
wenzelm@30845
  2477
automatically by arithmetic. It is intended to be used locally in
wenzelm@30845
  2478
proofs, e.g.
wenzelm@30845
  2479
wenzelm@30845
  2480
  assumes [arith]: "x > 0"
wenzelm@30845
  2481
nipkow@30706
  2482
Global usage is discouraged because of possible performance impact.
nipkow@30706
  2483
wenzelm@30845
  2484
* New classes "top" and "bot" with corresponding operations "top" and
wenzelm@30845
  2485
"bot" in theory Orderings; instantiation of class "complete_lattice"
wenzelm@30845
  2486
requires instantiation of classes "top" and "bot".  INCOMPATIBILITY.
wenzelm@30845
  2487
wenzelm@30845
  2488
* Changed definition lemma "less_fun_def" in order to provide an
wenzelm@30845
  2489
instance for preorders on functions; use lemma "less_le" instead.
wenzelm@30845
  2490
INCOMPATIBILITY.
wenzelm@30845
  2491
wenzelm@30845
  2492
* Theory Orderings: class "wellorder" moved here, with explicit
wenzelm@30845
  2493
induction rule "less_induct" as assumption.  For instantiation of
wenzelm@30845
  2494
"wellorder" by means of predicate "wf", use rule wf_wellorderI.
wenzelm@30845
  2495
INCOMPATIBILITY.
wenzelm@30845
  2496
wenzelm@30845
  2497
* Theory Orderings: added class "preorder" as superclass of "order".
wenzelm@27793
  2498
INCOMPATIBILITY: Instantiation proofs for order, linorder
wenzelm@27793
  2499
etc. slightly changed.  Some theorems named order_class.* now named
wenzelm@27793
  2500
preorder_class.*.
wenzelm@27793
  2501
wenzelm@30845
  2502
* Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
wenzelm@30845
  2503
"diag" to "Id_on".
wenzelm@30845
  2504
wenzelm@30845
  2505
* Theory Finite_Set: added a new fold combinator of type
wenzelm@30845
  2506
nipkow@28855
  2507
  ('a => 'b => 'b) => 'b => 'a set => 'b
wenzelm@30845
  2508
wenzelm@30845
  2509
Occasionally this is more convenient than the old fold combinator
wenzelm@30845
  2510
which is now defined in terms of the new one and renamed to
wenzelm@30845
  2511
fold_image.
wenzelm@30845
  2512
wenzelm@30845
  2513
* Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
wenzelm@30845
  2514
and "ring_simps" have been replaced by "algebra_simps" (which can be
wenzelm@30845
  2515
extended with further lemmas!).  At the moment both still exist but
wenzelm@30845
  2516
the former will disappear at some point.
wenzelm@30845
  2517
wenzelm@30845
  2518
* Theory Power: Lemma power_Suc is now declared as a simp rule in
wenzelm@30845
  2519
class recpower.  Type-specific simp rules for various recpower types
wenzelm@30845
  2520
have been removed.  INCOMPATIBILITY, rename old lemmas as follows:
huffman@30273
  2521
huffman@30273
  2522
rat_power_0    -> power_0
huffman@30273
  2523
rat_power_Suc  -> power_Suc
huffman@30273
  2524
realpow_0      -> power_0
huffman@30273
  2525
realpow_Suc    -> power_Suc
huffman@30273
  2526
complexpow_0   -> power_0
huffman@30273
  2527
complexpow_Suc -> power_Suc
huffman@30273
  2528
power_poly_0   -> power_0
huffman@30273
  2529
power_poly_Suc -> power_Suc
huffman@30273
  2530
wenzelm@30845
  2531
* Theories Ring_and_Field and Divides: Definition of "op dvd" has been
wenzelm@27793
  2532
moved to separate class dvd in Ring_and_Field; a couple of lemmas on
wenzelm@27793
  2533
dvd has been generalized to class comm_semiring_1.  Likewise a bunch
wenzelm@27793
  2534
of lemmas from Divides has been generalized from nat to class
wenzelm@27793
  2535
semiring_div.  INCOMPATIBILITY.  This involves the following theorem
wenzelm@27793
  2536
renames resulting from duplicate elimination:
haftmann@27651
  2537
haftmann@27651
  2538
    dvd_def_mod ~>          dvd_eq_mod_eq_0
haftmann@27651
  2539
    zero_dvd_iff ~>         dvd_0_left_iff
haftmann@28559
  2540
    dvd_0 ~>                dvd_0_right
haftmann@27651
  2541
    DIVISION_BY_ZERO_DIV ~> div_by_0
haftmann@27651
  2542
    DIVISION_BY_ZERO_MOD ~> mod_by_0
haftmann@27651
  2543
    mult_div ~>             div_mult_self2_is_id
haftmann@27651
  2544
    mult_mod ~>             mod_mult_self2_is_0
haftmann@27651
  2545
wenzelm@30845
  2546
* Theory IntDiv: removed many lemmas that are instances of class-based
wenzelm@30845
  2547
generalizations (from Divides and Ring_and_Field).  INCOMPATIBILITY,
wenzelm@30845
  2548
rename old lemmas as follows:
nipkow@30044
  2549
nipkow@30044
  2550
dvd_diff               -> nat_dvd_diff
nipkow@30044
  2551
dvd_zminus_iff         -> dvd_minus_iff
nipkow@30224
  2552
mod_add1_eq            -> mod_add_eq
nipkow@30224
  2553
mod_mult1_eq           -> mod_mult_right_eq
nipkow@30224
  2554
mod_mult1_eq'          -> mod_mult_left_eq
nipkow@30224
  2555
mod_mult_distrib_mod   -> mod_mult_eq
nipkow@30044
  2556
nat_mod_add_left_eq    -> mod_add_left_eq
nipkow@30044
  2557
nat_mod_add_right_eq   -> mod_add_right_eq
nipkow@30044
  2558
nat_mod_div_trivial    -> mod_div_trivial
nipkow@30044
  2559
nat_mod_mod_trivial    -> mod_mod_trivial
nipkow@30044
  2560
zdiv_zadd_self1        -> div_add_self1
nipkow@30044
  2561
zdiv_zadd_self2        -> div_add_self2
nipkow@30181
  2562
zdiv_zmult_self1       -> div_mult_self2_is_id
nipkow@30044
  2563
zdiv_zmult_self2       -> div_mult_self1_is_id
nipkow@30044
  2564
zdvd_triv_left         -> dvd_triv_left
nipkow@30044
  2565
zdvd_triv_right        -> dvd_triv_right
nipkow@30044
  2566
zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
nipkow@30085
  2567
zmod_eq0_zdvd_iff      -> dvd_eq_mod_eq_0[symmetric]
nipkow@30044
  2568
zmod_zadd_left_eq      -> mod_add_left_eq
nipkow@30044
  2569
zmod_zadd_right_eq     -> mod_add_right_eq
nipkow@30044
  2570
zmod_zadd_self1        -> mod_add_self1
nipkow@30044
  2571
zmod_zadd_self2        -> mod_add_self2
nipkow@30224
  2572
zmod_zadd1_eq          -> mod_add_eq
nipkow@30044
  2573
zmod_zdiff1_eq         -> mod_diff_eq
nipkow@30044
  2574
zmod_zdvd_zmod         -> mod_mod_cancel
nipkow@30044
  2575
zmod_zmod_cancel       -> mod_mod_cancel
nipkow@30044
  2576
zmod_zmult_self1       -> mod_mult_self2_is_0
nipkow@30044
  2577
zmod_zmult_self2       -> mod_mult_self1_is_0
nipkow@30044
  2578
zmod_1                 -> mod_by_1
nipkow@30044
  2579
zdiv_1                 -> div_by_1
nipkow@30044
  2580
zdvd_abs1              -> abs_dvd_iff
nipkow@30044
  2581
zdvd_abs2              -> dvd_abs_iff
nipkow@30044
  2582
zdvd_refl              -> dvd_refl
nipkow@30044
  2583
zdvd_trans             -> dvd_trans
nipkow@30044
  2584
zdvd_zadd              -> dvd_add
nipkow@30044
  2585
zdvd_zdiff             -> dvd_diff
nipkow@30044
  2586
zdvd_zminus_iff        -> dvd_minus_iff
nipkow@30044
  2587
zdvd_zminus2_iff       -> minus_dvd_iff
nipkow@30044
  2588
zdvd_zmultD            -> dvd_mult_right
nipkow@30044
  2589
zdvd_zmultD2           -> dvd_mult_left
nipkow@30044
  2590
zdvd_zmult_mono        -> mult_dvd_mono
nipkow@30044
  2591
zdvd_0_right           -> dvd_0_right
nipkow@30044
  2592
zdvd_0_left            -> dvd_0_left_iff
nipkow@30044
  2593
zdvd_1_left            -> one_dvd
nipkow@30044
  2594
zminus_dvd_iff         -> minus_dvd_iff
nipkow@30044
  2595
wenzelm@30845
  2596
* Theory Rational: 'Fract k 0' now equals '0'.  INCOMPATIBILITY.
wenzelm@30845
  2597
wenzelm@30845
  2598
* The real numbers offer decimal input syntax: 12.34 is translated
wenzelm@30845
  2599
into 1234/10^2. This translation is not reversed upon output.
wenzelm@30845
  2600
wenzelm@30845
  2601
* Theory Library/Polynomial defines an abstract type 'a poly of
wenzelm@30845
  2602
univariate polynomials with coefficients of type 'a.  In addition to
wenzelm@30845
  2603
the standard ring operations, it also supports div and mod.  Code
wenzelm@30845
  2604
generation is also supported, using list-style constructors.
wenzelm@30845
  2605
wenzelm@30845
  2606
* Theory Library/Inner_Product defines a class of real_inner for real
wenzelm@30845
  2607
inner product spaces, with an overloaded operation inner :: 'a => 'a
wenzelm@30845
  2608
=> real.  Class real_inner is a subclass of real_normed_vector from
wenzelm@30845
  2609
theory RealVector.
wenzelm@30845
  2610
wenzelm@30845
  2611
* Theory Library/Product_Vector provides instances for the product
wenzelm@30845
  2612
type 'a * 'b of several classes from RealVector and Inner_Product.
wenzelm@30845
  2613
Definitions of addition, subtraction, scalar multiplication, norms,
wenzelm@30845
  2614
and inner products are included.
wenzelm@30845
  2615
wenzelm@30845
  2616
* Theory Library/Bit defines the field "bit" of integers modulo 2.  In
wenzelm@30845
  2617
addition to the field operations, numerals and case syntax are also
wenzelm@30845
  2618
supported.
wenzelm@30845
  2619
wenzelm@30845
  2620
* Theory Library/Diagonalize provides constructive version of Cantor's
wenzelm@30845
  2621
first diagonalization argument.
wenzelm@30845
  2622
wenzelm@30845
  2623
* Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
wenzelm@27599
  2624
zlcm (for int); carried together from various gcd/lcm developements in
wenzelm@30845
  2625
the HOL Distribution.  Constants zgcd and zlcm replace former igcd and
wenzelm@30845
  2626
ilcm; corresponding theorems renamed accordingly.  INCOMPATIBILITY,
wenzelm@30845
  2627
may recover tupled syntax as follows:
haftmann@27556
  2628
haftmann@27556
  2629
    hide (open) const gcd
haftmann@27556
  2630
    abbreviation gcd where
haftmann@27556
  2631
      "gcd == (%(a, b). GCD.gcd a b)"
haftmann@27556
  2632
    notation (output)
haftmann@27556
  2633
      GCD.gcd ("gcd '(_, _')")
haftmann@27556
  2634
wenzelm@30845
  2635
The same works for lcm, zgcd, zlcm.
wenzelm@30845
  2636
wenzelm@30845
  2637
* Theory Library/Nat_Infinity: added addition, numeral syntax and more
wenzelm@30845
  2638
instantiations for algebraic structures.  Removed some duplicate
wenzelm@30845
  2639
theorems.  Changes in simp rules.  INCOMPATIBILITY.
wenzelm@30845
  2640
wenzelm@30845
  2641
* ML antiquotation @{code} takes a constant as argument and generates
haftmann@27651
  2642
corresponding code in background and inserts name of the corresponding
haftmann@27651
  2643
resulting ML value/function/datatype constructor binding in place.
haftmann@27651
  2644
All occurrences of @{code} with a single ML block are generated
haftmann@27651
  2645
simultaneously.  Provides a generic and safe interface for
wenzelm@30845
  2646
instrumentalizing code generation.  See
wenzelm@30845
  2647
src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
wenzelm@30845
  2648
In future you ought to refrain from ad-hoc compiling generated SML
wenzelm@30845
  2649
code on the ML toplevel.  Note that (for technical reasons) @{code}
wenzelm@30845
  2650
cannot refer to constants for which user-defined serializations are
wenzelm@30845
  2651
set.  Refer to the corresponding ML counterpart directly in that
wenzelm@30845
  2652
cases.
wenzelm@27122
  2653
wenzelm@27122
  2654
* Command 'rep_datatype': instead of theorem names the command now
wenzelm@27122
  2655
takes a list of terms denoting the constructors of the type to be
wenzelm@27122
  2656
represented as datatype.  The characteristic theorems have to be
wenzelm@27122
  2657
proven.  INCOMPATIBILITY.  Also observe that the following theorems
wenzelm@27122
  2658
have disappeared in favour of existing ones:
wenzelm@27122
  2659
haftmann@27104
  2660
    unit_induct                 ~> unit.induct
haftmann@27104
  2661
    prod_induct                 ~> prod.induct
haftmann@27104
  2662
    sum_induct                  ~> sum.induct
haftmann@27104
  2663
    Suc_Suc_eq                  ~> nat.inject
haftmann@27104
  2664
    Suc_not_Zero Zero_not_Suc   ~> nat.distinct