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