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