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