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