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