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